Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 460K
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 131K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 22K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 122K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.1K Mar 28 16:13 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 28 16:13 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 28 16:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 28 16:13 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 23 11:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 23 11:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.0K Mar 22 19:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 22 19:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 17 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 1 May 5 16:51 large_marking
-rw-r--r-- 1 mcc users 21K May 5 16:51 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME GPPP-PT-C0100N0000000010-00
FORMULA_NAME GPPP-PT-C0100N0000000010-01
FORMULA_NAME GPPP-PT-C0100N0000000010-02
FORMULA_NAME GPPP-PT-C0100N0000000010-03
FORMULA_NAME GPPP-PT-C0100N0000000010-04
FORMULA_NAME GPPP-PT-C0100N0000000010-05
FORMULA_NAME GPPP-PT-C0100N0000000010-06
FORMULA_NAME GPPP-PT-C0100N0000000010-07
FORMULA_NAME GPPP-PT-C0100N0000000010-08
FORMULA_NAME GPPP-PT-C0100N0000000010-09
FORMULA_NAME GPPP-PT-C0100N0000000010-10
FORMULA_NAME GPPP-PT-C0100N0000000010-11
FORMULA_NAME GPPP-PT-C0100N0000000010-12
FORMULA_NAME GPPP-PT-C0100N0000000010-13
FORMULA_NAME GPPP-PT-C0100N0000000010-14
FORMULA_NAME GPPP-PT-C0100N0000000010-15

=== Now, execution of the tool begins

BK_START 1621216042040

Running Version 0
[2021-05-17 01:47:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-17 01:47:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 01:47:25] [INFO ] Load time of PNML (sax parser for PT used): 56 ms
[2021-05-17 01:47:25] [INFO ] Transformed 33 places.
[2021-05-17 01:47:25] [INFO ] Transformed 22 transitions.
[2021-05-17 01:47:25] [INFO ] Parsed PT model containing 33 places and 22 transitions in 138 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 19 ms.
Working with output stream class java.io.PrintStream
[2021-05-17 01:47:25] [INFO ] Initial state test concluded for 4 properties.
FORMULA GPPP-PT-C0100N0000000010-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0100N0000000010-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0100N0000000010-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 27 out of 33 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 17 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 33 cols
[2021-05-17 01:47:26] [INFO ] Computed 12 place invariants in 14 ms
[2021-05-17 01:47:26] [INFO ] Dead Transitions using invariants and state equation in 248 ms returned []
// Phase 1: matrix 22 rows 33 cols
[2021-05-17 01:47:26] [INFO ] Computed 12 place invariants in 6 ms
[2021-05-17 01:47:26] [INFO ] Implicit Places using invariants in 61 ms returned [3]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 67 ms to find 1 implicit places.
// Phase 1: matrix 22 rows 32 cols
[2021-05-17 01:47:26] [INFO ] Computed 11 place invariants in 4 ms
[2021-05-17 01:47:26] [INFO ] Dead Transitions using invariants and state equation in 70 ms returned []
Starting structural reductions, iteration 1 : 32/33 places, 22/22 transitions.
Applied a total of 0 rules in 5 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 32 cols
[2021-05-17 01:47:26] [INFO ] Computed 11 place invariants in 3 ms
[2021-05-17 01:47:26] [INFO ] Dead Transitions using invariants and state equation in 61 ms returned []
Finished structural reductions, in 2 iterations. Remains : 32/33 places, 22/22 transitions.
[2021-05-17 01:47:26] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-05-17 01:47:26] [INFO ] Flatten gal took : 49 ms
FORMULA GPPP-PT-C0100N0000000010-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0100N0000000010-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-17 01:47:26] [INFO ] Flatten gal took : 16 ms
[2021-05-17 01:47:26] [INFO ] Input system was already deterministic with 22 transitions.
Incomplete random walk after 100000 steps, including 233 resets, run finished after 326 ms. (steps per millisecond=306 ) properties (out of 21) seen :19
Running SMT prover for 2 properties.
// Phase 1: matrix 22 rows 32 cols
[2021-05-17 01:47:27] [INFO ] Computed 11 place invariants in 3 ms
[2021-05-17 01:47:27] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2021-05-17 01:47:27] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 6 ms returned sat
[2021-05-17 01:47:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 01:47:27] [INFO ] [Real]Absence check using state equation in 28 ms returned unsat
[2021-05-17 01:47:27] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2021-05-17 01:47:27] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 3 ms returned unsat
Successfully simplified 2 atomic propositions for a total of 11 simplifications.
[2021-05-17 01:47:27] [INFO ] Initial state test concluded for 1 properties.
FORMULA GPPP-PT-C0100N0000000010-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((X(F((p0&&F(p1)))) U (p0||(!p1 U X(G(p2)))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 32 places. Attempting structural reductions.
Starting structural reductions, 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
[2021-05-17 01:47:27] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-17 01:47:27] [INFO ] Dead Transitions using invariants and state equation in 39 ms returned []
// Phase 1: matrix 22 rows 32 cols
[2021-05-17 01:47:27] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-17 01:47:27] [INFO ] Implicit Places using invariants in 41 ms returned [18]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 42 ms to find 1 implicit places.
// Phase 1: matrix 22 rows 31 cols
[2021-05-17 01:47:27] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-17 01:47:27] [INFO ] Dead Transitions using invariants and state equation in 40 ms returned []
Starting structural reductions, iteration 1 : 31/32 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 31 cols
[2021-05-17 01:47:27] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-17 01:47:27] [INFO ] Dead Transitions using invariants and state equation in 39 ms returned []
Finished structural reductions, in 2 iterations. Remains : 31/32 places, 22/22 transitions.
Stuttering acceptance computed with spot in 576 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND p0 (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : GPPP-PT-C0100N0000000010-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 4}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=2 dest: 5}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=2 dest: 6}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 7}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p1) p2), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=5 dest: 6}], [{ cond=(NOT p1), acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=7 dest: 7}, { cond=(AND (NOT p1) p2), acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(GEQ s11 1), p1:(LT s18 1), p2:(AND (GEQ s1 1) (GEQ s24 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 8441 reset in 543 ms.
Product exploration explored 100000 steps with 8423 reset in 285 ms.
Knowledge obtained : [(NOT p0), p1, (NOT p2)]
Stuttering acceptance computed with spot in 320 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND p0 (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 8479 reset in 291 ms.
Product exploration explored 100000 steps with 8458 reset in 500 ms.
Applying partial POR strategy [false, false, true, true, true, true, true, true]
Stuttering acceptance computed with spot in 413 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND p0 (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2))]
Support contains 4 out of 31 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 31/31 places, 22/22 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 31 transition count 22
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 1 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 3 place count 31 transition count 22
Deduced a syphon composed of 3 places in 0 ms
Applied a total of 3 rules in 22 ms. Remains 31 /31 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 31 cols
[2021-05-17 01:47:31] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-17 01:47:31] [INFO ] Dead Transitions using invariants and state equation in 69 ms returned []
[2021-05-17 01:47:31] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 22 rows 31 cols
[2021-05-17 01:47:31] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-17 01:47:31] [INFO ] Dead Transitions using invariants and state equation in 87 ms returned []
Finished structural reductions, in 1 iterations. Remains : 31/31 places, 22/22 transitions.
Product exploration explored 100000 steps with 8664 reset in 631 ms.
Product exploration explored 100000 steps with 8730 reset in 397 ms.
[2021-05-17 01:47:32] [INFO ] Flatten gal took : 13 ms
[2021-05-17 01:47:32] [INFO ] Flatten gal took : 9 ms
[2021-05-17 01:47:32] [INFO ] Time to serialize gal into /tmp/LTL712072785727035561.gal : 3 ms
[2021-05-17 01:47:32] [INFO ] Time to serialize properties into /tmp/LTL15799188032856946509.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL712072785727035561.gal, -t, CGAL, -LTL, /tmp/LTL15799188032856946509.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL712072785727035561.gal -t CGAL -LTL /tmp/LTL15799188032856946509.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X((X(F(("(GAP>=1)")&&(F("(_3PG<1)")))))U(("(GAP>=1)")||(("(_3PG>=1)")U(X(G("((ATP>=1)&&(Gluc>=1))"))))))))
Formula 0 simplified : !X(XF("(GAP>=1)" & F"(_3PG<1)") U ("(GAP>=1)" | ("(_3PG>=1)" U XG"((ATP>=1)&&(Gluc>=1))")))
Detected timeout of ITS tools.
[2021-05-17 01:47:47] [INFO ] Flatten gal took : 9 ms
[2021-05-17 01:47:47] [INFO ] Applying decomposition
[2021-05-17 01:47:47] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph16405004756156756528.txt, -o, /tmp/graph16405004756156756528.bin, -w, /tmp/graph16405004756156756528.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph16405004756156756528.bin, -l, -1, -v, -w, /tmp/graph16405004756156756528.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 01:47:47] [INFO ] Decomposing Gal with order
[2021-05-17 01:47:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 01:47:47] [INFO ] Removed a total of 2 redundant transitions.
[2021-05-17 01:47:47] [INFO ] Flatten gal took : 57 ms
[2021-05-17 01:47:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2021-05-17 01:47:47] [INFO ] Time to serialize gal into /tmp/LTL10252057938870761307.gal : 2 ms
[2021-05-17 01:47:47] [INFO ] Time to serialize properties into /tmp/LTL8567965102481038039.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL10252057938870761307.gal, -t, CGAL, -LTL, /tmp/LTL8567965102481038039.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL10252057938870761307.gal -t CGAL -LTL /tmp/LTL8567965102481038039.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X((X(F(("(i4.u5.GAP>=1)")&&(F("(i1.u6._3PG<1)")))))U(("(i4.u5.GAP>=1)")||(("(i1.u6._3PG>=1)")U(X(G("((i0.u1.ATP>=1)&&(i0.u7.Gluc>=1))"))))))))
Formula 0 simplified : !X(XF("(i4.u5.GAP>=1)" & F"(i1.u6._3PG<1)") U ("(i4.u5.GAP>=1)" | ("(i1.u6._3PG>=1)" U XG"((i0.u1.ATP>=1)&&(i0.u7.Gluc>=1))")))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin117379400354549544
[2021-05-17 01:48:02] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin117379400354549544
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin117379400354549544]
Compilation finished in 361 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin117379400354549544]
Link finished in 46 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X((X(<>(((LTLAPp0==true)&&<>((LTLAPp1==true))))) U ((LTLAPp0==true)||(!(LTLAPp1==true) U X([]((LTLAPp2==true))))))), --buchi-type=spotba], workingDir=/tmp/ltsmin117379400354549544]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property GPPP-PT-C0100N0000000010-01 finished in 50204 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)||X(X((p1||X((p1 U X(p2))))))))], workingDir=/home/mcc/execution]
Support contains 7 out of 32 places. Attempting structural reductions.
Starting structural reductions, 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
[2021-05-17 01:48:17] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-17 01:48:17] [INFO ] Dead Transitions using invariants and state equation in 40 ms returned []
// Phase 1: matrix 22 rows 32 cols
[2021-05-17 01:48:17] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-17 01:48:17] [INFO ] Implicit Places using invariants in 36 ms returned [18]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 38 ms to find 1 implicit places.
// Phase 1: matrix 22 rows 31 cols
[2021-05-17 01:48:17] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-17 01:48:17] [INFO ] Dead Transitions using invariants and state equation in 46 ms returned []
Starting structural reductions, iteration 1 : 31/32 places, 22/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 31 /31 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 31 cols
[2021-05-17 01:48:17] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-17 01:48:17] [INFO ] Dead Transitions using invariants and state equation in 42 ms returned []
Finished structural reductions, in 2 iterations. Remains : 31/32 places, 22/22 transitions.
Stuttering acceptance computed with spot in 422 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), true, (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p0) (NOT p2)), (NOT p0)]
Running random walk in product with property : GPPP-PT-C0100N0000000010-02 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 6}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 6}], [{ cond=(AND p0 p1), acceptance={} source=3 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 9}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 10}], [{ cond=(AND p0 p1 (NOT p2)), acceptance={} source=4 dest: 4}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=4 dest: 9}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=4 dest: 10}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 7}, { cond=(AND p0 (NOT p2)), acceptance={} source=5 dest: 12}], [{ cond=p1, acceptance={} source=6 dest: 9}, { cond=(NOT p1), acceptance={} source=6 dest: 10}], [{ cond=true, acceptance={0} source=7 dest: 7}], [{ cond=true, acceptance={} source=8 dest: 0}], [{ cond=(AND p1 (NOT p2)), acceptance={0} source=9 dest: 9}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=9 dest: 10}], [{ cond=(NOT p2), acceptance={} source=10 dest: 7}], [{ cond=p0, acceptance={} source=11 dest: 1}, { cond=(NOT p0), acceptance={} source=11 dest: 8}], [{ cond=(NOT p0), acceptance={} source=12 dest: 7}, { cond=p0, acceptance={} source=12 dest: 12}]], initial=11, aps=[p1:(AND (GEQ s1 1) (GEQ s13 1)), p0:(OR (LT s8 1) (LT s9 1)), p2:(AND (GEQ s3 2) (GEQ s14 1) (GEQ s26 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 29 steps with 2 reset in 1 ms.
FORMULA GPPP-PT-C0100N0000000010-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0100N0000000010-02 finished in 622 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G(p0)&&X(p1))))], workingDir=/home/mcc/execution]
Support contains 5 out of 32 places. Attempting structural reductions.
Starting structural reductions, 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
[2021-05-17 01:48:18] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-17 01:48:18] [INFO ] Dead Transitions using invariants and state equation in 39 ms returned []
// Phase 1: matrix 22 rows 32 cols
[2021-05-17 01:48:18] [INFO ] Computed 11 place invariants in 4 ms
[2021-05-17 01:48:18] [INFO ] Implicit Places using invariants in 42 ms returned []
// Phase 1: matrix 22 rows 32 cols
[2021-05-17 01:48:18] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-17 01:48:18] [INFO ] Implicit Places using invariants and state equation in 87 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 131 ms to find 1 implicit places.
// Phase 1: matrix 22 rows 31 cols
[2021-05-17 01:48:18] [INFO ] Computed 10 place invariants in 2 ms
[2021-05-17 01:48:18] [INFO ] Dead Transitions using invariants and state equation in 33 ms returned []
Starting structural reductions, iteration 1 : 31/32 places, 22/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 31 /31 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 31 cols
[2021-05-17 01:48:18] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-17 01:48:18] [INFO ] Dead Transitions using invariants and state equation in 34 ms returned []
Finished structural reductions, in 2 iterations. Remains : 31/32 places, 22/22 transitions.
Stuttering acceptance computed with spot in 142 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), true]
Running random walk in product with property : GPPP-PT-C0100N0000000010-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 3}, { cond=(OR (NOT p0) (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(OR (LT s16 1) (LT s17 1) (AND (GEQ s13 1) (GEQ s25 300))), p1:(GEQ s19 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0100N0000000010-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0100N0000000010-03 finished in 402 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(((F(p0) U p1)||X(p2))))], workingDir=/home/mcc/execution]
Support contains 5 out of 32 places. Attempting structural reductions.
Starting structural reductions, 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
[2021-05-17 01:48:18] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-17 01:48:18] [INFO ] Dead Transitions using invariants and state equation in 31 ms returned []
// Phase 1: matrix 22 rows 32 cols
[2021-05-17 01:48:18] [INFO ] Computed 11 place invariants in 2 ms
[2021-05-17 01:48:18] [INFO ] Implicit Places using invariants in 51 ms returned []
// Phase 1: matrix 22 rows 32 cols
[2021-05-17 01:48:18] [INFO ] Computed 11 place invariants in 2 ms
[2021-05-17 01:48:18] [INFO ] Implicit Places using invariants and state equation in 73 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 127 ms to find 1 implicit places.
// Phase 1: matrix 22 rows 31 cols
[2021-05-17 01:48:18] [INFO ] Computed 10 place invariants in 2 ms
[2021-05-17 01:48:18] [INFO ] Dead Transitions using invariants and state equation in 30 ms returned []
Starting structural reductions, iteration 1 : 31/32 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 31 cols
[2021-05-17 01:48:18] [INFO ] Computed 10 place invariants in 2 ms
[2021-05-17 01:48:18] [INFO ] Dead Transitions using invariants and state equation in 45 ms returned []
Finished structural reductions, in 2 iterations. Remains : 31/32 places, 22/22 transitions.
Stuttering acceptance computed with spot in 174 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND p1 (NOT p0) (NOT p2)), (NOT p0), (NOT p1)]
Running random walk in product with property : GPPP-PT-C0100N0000000010-04 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 3}, { cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(OR (GEQ s10 1) (AND (GEQ s13 1) (GEQ s25 300))), p0:(OR (LT s17 1) (LT s20 1)), p2:(AND (GEQ s13 1) (GEQ s25 300))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 18072 reset in 160 ms.
Product exploration explored 100000 steps with 18200 reset in 246 ms.
Knowledge obtained : [(NOT p1), p0, (NOT p2)]
Stuttering acceptance computed with spot in 179 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND p1 (NOT p0) (NOT p2)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 18034 reset in 177 ms.
Stack based approach found an accepted trace after 38245 steps with 6955 reset with depth 73 and stack size 73 in 70 ms.
FORMULA GPPP-PT-C0100N0000000010-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0100N0000000010-04 finished in 1419 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((X(G(p0))||G(p1))))], workingDir=/home/mcc/execution]
Support contains 2 out of 32 places. Attempting structural reductions.
Starting structural reductions, 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
[2021-05-17 01:48:20] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-17 01:48:20] [INFO ] Dead Transitions using invariants and state equation in 30 ms returned []
// Phase 1: matrix 22 rows 32 cols
[2021-05-17 01:48:20] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-17 01:48:20] [INFO ] Implicit Places using invariants in 34 ms returned [18]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 44 ms to find 1 implicit places.
// Phase 1: matrix 22 rows 31 cols
[2021-05-17 01:48:20] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-17 01:48:20] [INFO ] Dead Transitions using invariants and state equation in 30 ms returned []
Starting structural reductions, iteration 1 : 31/32 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 31 cols
[2021-05-17 01:48:20] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-17 01:48:20] [INFO ] Dead Transitions using invariants and state equation in 31 ms returned []
Finished structural reductions, in 2 iterations. Remains : 31/32 places, 22/22 transitions.
Stuttering acceptance computed with spot in 178 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : GPPP-PT-C0100N0000000010-05 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 1}, { cond=(AND p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=(NOT p1), acceptance={} source=5 dest: 1}, { cond=p1, acceptance={} source=5 dest: 2}]], initial=4, aps=[p0:(OR (GEQ s6 2) (LT s18 1)), p1:(LT s18 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 136 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0100N0000000010-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0100N0000000010-05 finished in 333 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 32 places. Attempting structural reductions.
Starting structural reductions, 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 4 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
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 17 place count 22 transition count 14
Applied a total of 17 rules in 16 ms. Remains 22 /32 variables (removed 10) and now considering 14/22 (removed 8) transitions.
// Phase 1: matrix 14 rows 22 cols
[2021-05-17 01:48:20] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 01:48:20] [INFO ] Dead Transitions using invariants and state equation in 24 ms returned []
// Phase 1: matrix 14 rows 22 cols
[2021-05-17 01:48:20] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 01:48:20] [INFO ] Implicit Places using invariants in 27 ms returned [12]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 28 ms to find 1 implicit places.
[2021-05-17 01:48:20] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 14 rows 21 cols
[2021-05-17 01:48:20] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-17 01:48:20] [INFO ] Dead Transitions using invariants and state equation in 51 ms returned []
Starting structural reductions, iteration 1 : 21/32 places, 14/22 transitions.
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 5 place count 18 transition count 12
Applied a total of 5 rules in 3 ms. Remains 18 /21 variables (removed 3) and now considering 12/14 (removed 2) transitions.
// Phase 1: matrix 12 rows 18 cols
[2021-05-17 01:48:20] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-17 01:48:20] [INFO ] Implicit Places using invariants in 68 ms returned []
// Phase 1: matrix 12 rows 18 cols
[2021-05-17 01:48:20] [INFO ] Computed 7 place invariants in 5 ms
[2021-05-17 01:48:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 01:48:20] [INFO ] Implicit Places using invariants and state equation in 62 ms returned [0, 11]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 142 ms to find 2 implicit places.
Starting structural reductions, 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.
[2021-05-17 01:48:20] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 12 rows 16 cols
[2021-05-17 01:48:20] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-17 01:48:20] [INFO ] Dead Transitions using invariants and state equation in 23 ms returned []
Finished structural reductions, in 3 iterations. 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-C0100N0000000010-07 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s12 200))], 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 5 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0100N0000000010-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0100N0000000010-07 finished in 375 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(!p0) U (F(!p0)&&p1)))], workingDir=/home/mcc/execution]
Support contains 4 out of 32 places. Attempting structural reductions.
Starting structural reductions, 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
[2021-05-17 01:48:20] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-17 01:48:20] [INFO ] Dead Transitions using invariants and state equation in 29 ms returned []
// Phase 1: matrix 22 rows 32 cols
[2021-05-17 01:48:20] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-17 01:48:20] [INFO ] Implicit Places using invariants in 40 ms returned [18]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 45 ms to find 1 implicit places.
// Phase 1: matrix 22 rows 31 cols
[2021-05-17 01:48:20] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-17 01:48:20] [INFO ] Dead Transitions using invariants and state equation in 48 ms returned []
Starting structural reductions, iteration 1 : 31/32 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 31 cols
[2021-05-17 01:48:20] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-17 01:48:21] [INFO ] Dead Transitions using invariants and state equation in 53 ms returned []
Finished structural reductions, in 2 iterations. Remains : 31/32 places, 22/22 transitions.
Stuttering acceptance computed with spot in 124 ms :[p0, (OR (NOT p1) p0), (OR (NOT p1) p0), true]
Running random walk in product with property : GPPP-PT-C0100N0000000010-09 automaton TGBA [mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}], [{ cond=(AND p1 p0), acceptance={} source=1 dest: 0}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}, { cond=p0, acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=1, aps=[p0:(GEQ s11 1), p1:(AND (GEQ s0 1) (GEQ s2 1) (GEQ s11 1) (GEQ s30 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 6 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0100N0000000010-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0100N0000000010-09 finished in 325 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G(!p0)||G(p1))))], workingDir=/home/mcc/execution]
Support contains 4 out of 32 places. Attempting structural reductions.
Starting structural reductions, 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 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 6 ms. Remains 23 /32 variables (removed 9) and now considering 15/22 (removed 7) transitions.
// Phase 1: matrix 15 rows 23 cols
[2021-05-17 01:48:21] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 01:48:21] [INFO ] Dead Transitions using invariants and state equation in 45 ms returned []
// Phase 1: matrix 15 rows 23 cols
[2021-05-17 01:48:21] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 01:48:21] [INFO ] Implicit Places using invariants in 29 ms returned [12]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 30 ms to find 1 implicit places.
[2021-05-17 01:48:21] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 15 rows 22 cols
[2021-05-17 01:48:21] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-17 01:48:21] [INFO ] Dead Transitions using invariants and state equation in 28 ms returned []
Starting structural reductions, iteration 1 : 22/32 places, 15/22 transitions.
Applied a total of 0 rules in 5 ms. Remains 22 /22 variables (removed 0) and now considering 15/15 (removed 0) transitions.
[2021-05-17 01:48:21] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 15 rows 22 cols
[2021-05-17 01:48:21] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-17 01:48:21] [INFO ] Dead Transitions using invariants and state equation in 20 ms returned []
Finished structural reductions, in 2 iterations. Remains : 22/32 places, 15/22 transitions.
Stuttering acceptance computed with spot in 31 ms :[(AND p0 (NOT p1))]
Running random walk in product with property : GPPP-PT-C0100N0000000010-13 automaton TGBA [mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s15 1)), p1:(OR (LT s4 1) (LT s7 1))], nbAcceptance=2, 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 20 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0100N0000000010-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0100N0000000010-13 finished in 198 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(F(p0)) U (G(p1)||G(p2))))], workingDir=/home/mcc/execution]
Support contains 5 out of 32 places. Attempting structural reductions.
Starting structural reductions, 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
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 11 place count 26 transition count 16
Applied a total of 11 rules in 5 ms. Remains 26 /32 variables (removed 6) and now considering 16/22 (removed 6) transitions.
// Phase 1: matrix 16 rows 26 cols
[2021-05-17 01:48:21] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-17 01:48:21] [INFO ] Dead Transitions using invariants and state equation in 27 ms returned []
// Phase 1: matrix 16 rows 26 cols
[2021-05-17 01:48:21] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-17 01:48:21] [INFO ] Implicit Places using invariants in 51 ms returned [16]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 53 ms to find 1 implicit places.
[2021-05-17 01:48:21] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 16 rows 25 cols
[2021-05-17 01:48:21] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-17 01:48:21] [INFO ] Dead Transitions using invariants and state equation in 25 ms returned []
Starting structural reductions, iteration 1 : 25/32 places, 16/22 transitions.
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 5 place count 22 transition count 14
Applied a total of 5 rules in 3 ms. Remains 22 /25 variables (removed 3) and now considering 14/16 (removed 2) transitions.
// Phase 1: matrix 14 rows 22 cols
[2021-05-17 01:48:21] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 01:48:21] [INFO ] Implicit Places using invariants in 29 ms returned []
// Phase 1: matrix 14 rows 22 cols
[2021-05-17 01:48:21] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 01:48:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 01:48:21] [INFO ] Implicit Places using invariants and state equation in 45 ms returned [0, 15]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 74 ms to find 2 implicit places.
Starting structural reductions, iteration 2 : 20/32 places, 14/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 14/14 (removed 0) transitions.
[2021-05-17 01:48:21] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 14 rows 20 cols
[2021-05-17 01:48:21] [INFO ] Computed 7 place invariants in 3 ms
[2021-05-17 01:48:21] [INFO ] Dead Transitions using invariants and state equation in 21 ms returned []
Finished structural reductions, in 3 iterations. Remains : 20/32 places, 14/22 transitions.
Stuttering acceptance computed with spot in 165 ms :[(AND (NOT p1) (NOT p2)), (NOT p0), (OR (AND (NOT p0) p1) (AND (NOT p0) p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p1) p2)]
Running random walk in product with property : GPPP-PT-C0100N0000000010-14 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={1} source=0 dest: 0}, { cond=(AND p1 p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={0, 1} source=1 dest: 1}], [{ cond=(OR (AND p1 (NOT p0)) (AND p2 (NOT p0))), acceptance={} source=2 dest: 1}, { cond=(OR p1 p2), acceptance={} source=2 dest: 2}], [{ cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND p1 p2), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={} source=4 dest: 2}, { cond=(AND p1 p2), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(AND (GEQ s5 1) (GEQ s17 1)), p2:(GEQ s4 2), p0:(OR (LT s6 1) (LT s7 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0100N0000000010-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0100N0000000010-14 finished in 401 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((X(!p0)||(X(G(p1))&&F((!p0&&(!p2 U (p3||G(!p2)))))))))], workingDir=/home/mcc/execution]
Support contains 9 out of 32 places. Attempting structural reductions.
Starting structural reductions, 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
[2021-05-17 01:48:21] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-17 01:48:21] [INFO ] Dead Transitions using invariants and state equation in 30 ms returned []
// Phase 1: matrix 22 rows 32 cols
[2021-05-17 01:48:21] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-17 01:48:21] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 22 rows 32 cols
[2021-05-17 01:48:21] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-17 01:48:21] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
// Phase 1: matrix 22 rows 32 cols
[2021-05-17 01:48:21] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-17 01:48:21] [INFO ] Dead Transitions using invariants and state equation in 28 ms returned []
Finished structural reductions, in 1 iterations. Remains : 32/32 places, 22/22 transitions.
Stuttering acceptance computed with spot in 322 ms :[p0, (AND p0 (NOT p1)), p0, (AND p0 (NOT p3) p2), true, (AND (NOT p0) (NOT p1)), (OR p0 (AND p2 (NOT p3))), (AND p2 (NOT p3))]
Running random walk in product with property : GPPP-PT-C0100N0000000010-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=true, acceptance={} source=0 dest: 1}, { cond=(OR p0 (AND (NOT p3) p2)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=0 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 4}, { cond=(AND p0 p1), acceptance={} source=1 dest: 5}], [{ cond=p0, acceptance={} source=2 dest: 6}], [{ cond=(AND p0 (NOT p3) p2), acceptance={} source=3 dest: 6}, { cond=(AND p0 (NOT p3) (NOT p2)), acceptance={} source=3 dest: 7}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=5 dest: 5}], [{ cond=(OR p0 (AND (NOT p3) p2)), acceptance={0} source=6 dest: 6}, { cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=6 dest: 7}], [{ cond=(AND (NOT p3) p2), acceptance={0} source=7 dest: 6}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s13 1)), p3:(AND (LT s20 1) (OR (LT s18 1) (LT s21 1))), p2:(GEQ s20 1), p1:(OR (LT s0 1) (LT s2 1) (LT s11 1) (LT s31 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 21344 reset in 253 ms.
Stack based approach found an accepted trace after 1094 steps with 198 reset with depth 27 and stack size 27 in 3 ms.
FORMULA GPPP-PT-C0100N0000000010-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0100N0000000010-15 finished in 726 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin1333050366121047118
[2021-05-17 01:48:22] [INFO ] Applying decomposition
[2021-05-17 01:48:22] [INFO ] Computing symmetric may disable matrix : 22 transitions.
[2021-05-17 01:48:22] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-17 01:48:22] [INFO ] Computing symmetric may enable matrix : 22 transitions.
[2021-05-17 01:48:22] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-17 01:48:22] [INFO ] Computing Do-Not-Accords matrix : 22 transitions.
[2021-05-17 01:48:22] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-17 01:48:22] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1333050366121047118
[2021-05-17 01:48:22] [INFO ] Flatten gal took : 5 ms
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin1333050366121047118]
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph11822512384018101260.txt, -o, /tmp/graph11822512384018101260.bin, -w, /tmp/graph11822512384018101260.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph11822512384018101260.bin, -l, -1, -v, -w, /tmp/graph11822512384018101260.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 01:48:22] [INFO ] Decomposing Gal with order
[2021-05-17 01:48:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 01:48:22] [INFO ] Removed a total of 2 redundant transitions.
[2021-05-17 01:48:22] [INFO ] Flatten gal took : 6 ms
[2021-05-17 01:48:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-17 01:48:22] [INFO ] Time to serialize gal into /tmp/LTLFireability16931212368895496517.gal : 2 ms
[2021-05-17 01:48:22] [INFO ] Time to serialize properties into /tmp/LTLFireability16820690245527502888.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTLFireability16931212368895496517.gal, -t, CGAL, -LTL, /tmp/LTLFireability16820690245527502888.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireability16931212368895496517.gal -t CGAL -LTL /tmp/LTLFireability16820690245527502888.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X((X(F(("(i2.u3.GAP>=1)")&&(F("(u4._3PG<1)")))))U(("(i2.u3.GAP>=1)")||(("(u4._3PG>=1)")U(X(G("((i0.u0.ATP>=1)&&(i0.u6.Gluc>=1))"))))))))
Formula 0 simplified : !X(XF("(i2.u3.GAP>=1)" & F"(u4._3PG<1)") U ("(i2.u3.GAP>=1)" | ("(u4._3PG>=1)" U XG"((i0.u0.ATP>=1)&&(i0.u6.Gluc>=1))")))
Compilation finished in 318 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin1333050366121047118]
Link finished in 34 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X((X(<>(((LTLAPp0==true)&&<>((LTLAPp1==true))))) U ((LTLAPp0==true)||(!(LTLAPp1==true) U X([]((LTLAPp2==true))))))), --buchi-type=spotba], workingDir=/tmp/ltsmin1333050366121047118]
LTSmin run took 23128 ms.
FORMULA GPPP-PT-C0100N0000000010-01 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.

BK_STOP 1621216127047

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="GPPP-PT-C0100N0000000010"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is GPPP-PT-C0100N0000000010, 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 r102-smll-162075331300237"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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