Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2020-input.r036-smll-158901930600113.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.....................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is ClientsAndServers-PT-N0002P0, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r036-smll-158901930600113
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 192K
-rw-r--r-- 1 mcc users 3.6K Mar 30 01:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 30 01:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 28 15:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 28 15:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 8 14:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 8 14:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 27 08:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 27 08:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.3K Mar 26 07:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 22K Mar 26 07:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 28 14:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 28 14:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 8 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 9.1K Mar 24 05:37 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 ClientsAndServers-PT-N0002P0-00
FORMULA_NAME ClientsAndServers-PT-N0002P0-01
FORMULA_NAME ClientsAndServers-PT-N0002P0-02
FORMULA_NAME ClientsAndServers-PT-N0002P0-03
FORMULA_NAME ClientsAndServers-PT-N0002P0-04
FORMULA_NAME ClientsAndServers-PT-N0002P0-05
FORMULA_NAME ClientsAndServers-PT-N0002P0-06
FORMULA_NAME ClientsAndServers-PT-N0002P0-07
FORMULA_NAME ClientsAndServers-PT-N0002P0-08
FORMULA_NAME ClientsAndServers-PT-N0002P0-09
FORMULA_NAME ClientsAndServers-PT-N0002P0-10
FORMULA_NAME ClientsAndServers-PT-N0002P0-11
FORMULA_NAME ClientsAndServers-PT-N0002P0-12
FORMULA_NAME ClientsAndServers-PT-N0002P0-13
FORMULA_NAME ClientsAndServers-PT-N0002P0-14
FORMULA_NAME ClientsAndServers-PT-N0002P0-15

=== Now, execution of the tool begins

BK_START 1589696952494

[2020-05-17 06:29:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2020-05-17 06:29:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-17 06:29:15] [INFO ] Load time of PNML (sax parser for PT used): 34 ms
[2020-05-17 06:29:15] [INFO ] Transformed 25 places.
[2020-05-17 06:29:15] [INFO ] Transformed 18 transitions.
[2020-05-17 06:29:15] [INFO ] Parsed PT model containing 25 places and 18 transitions in 87 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 24 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100002 steps, including 334 resets, run finished after 255 ms. (steps per millisecond=392 ) properties seen :[0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 0]
// Phase 1: matrix 18 rows 25 cols
[2020-05-17 06:29:15] [INFO ] Computed 8 place invariants in 4 ms
[2020-05-17 06:29:16] [INFO ] [Real]Absence check using 5 positive place invariants in 16 ms returned unsat
[2020-05-17 06:29:16] [INFO ] [Real]Absence check using 5 positive place invariants in 10 ms returned sat
[2020-05-17 06:29:16] [INFO ] [Real]Absence check using 5 positive and 3 generalized place invariants in 2 ms returned unsat
[2020-05-17 06:29:16] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned unsat
[2020-05-17 06:29:16] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2020-05-17 06:29:16] [INFO ] [Real]Absence check using 5 positive and 3 generalized place invariants in 2 ms returned sat
[2020-05-17 06:29:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-17 06:29:16] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2020-05-17 06:29:16] [INFO ] Solution in real domain found non-integer solution.
[2020-05-17 06:29:16] [INFO ] [Nat]Absence check using 5 positive place invariants in 11 ms returned unsat
[2020-05-17 06:29:16] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned unsat
[2020-05-17 06:29:16] [INFO ] [Real]Absence check using 5 positive place invariants in 6 ms returned sat
[2020-05-17 06:29:16] [INFO ] [Real]Absence check using 5 positive and 3 generalized place invariants in 3 ms returned unsat
[2020-05-17 06:29:16] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned unsat
[2020-05-17 06:29:16] [INFO ] [Real]Absence check using 5 positive place invariants in 7 ms returned sat
[2020-05-17 06:29:16] [INFO ] [Real]Absence check using 5 positive and 3 generalized place invariants in 2 ms returned sat
[2020-05-17 06:29:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-17 06:29:16] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2020-05-17 06:29:16] [INFO ] Solution in real domain found non-integer solution.
[2020-05-17 06:29:16] [INFO ] [Nat]Absence check using 5 positive place invariants in 13 ms returned sat
[2020-05-17 06:29:16] [INFO ] [Nat]Absence check using 5 positive and 3 generalized place invariants in 3 ms returned sat
[2020-05-17 06:29:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-17 06:29:16] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2020-05-17 06:29:16] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints in 10 ms.
[2020-05-17 06:29:16] [INFO ] Added : 13 causal constraints over 3 iterations in 72 ms. Result :sat
[2020-05-17 06:29:16] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned unsat
[2020-05-17 06:29:16] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned unsat
[2020-05-17 06:29:16] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned unsat
Successfully simplified 10 atomic propositions for a total of 12 simplifications.
[2020-05-17 06:29:17] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2020-05-17 06:29:17] [INFO ] Flatten gal took : 51 ms
FORMULA ClientsAndServers-PT-N0002P0-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0002P0-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0002P0-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0002P0-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0002P0-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-17 06:29:17] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2020-05-17 06:29:17] [INFO ] Flatten gal took : 13 ms
[2020-05-17 06:29:17] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA ClientsAndServers-PT-N0002P0-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0002P0-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-17 06:29:17] [INFO ] Applying decomposition
[2020-05-17 06:29:17] [INFO ] Flatten gal took : 21 ms
[2020-05-17 06:29:17] [INFO ] Input system was already deterministic with 18 transitions.
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/convert-linux64, -i, /tmp/graph17093023285668735002.txt, -o, /tmp/graph17093023285668735002.bin, -w, /tmp/graph17093023285668735002.weights], workingDir=null]
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 18 rows 25 cols
[2020-05-17 06:29:17] [INFO ] Computed 8 place invariants in 2 ms
inv : CG + CR + StR + SwG + SpG - CwG = 0
inv : SR + SG + MpG + MwU - SwG = 0
inv : StF + Si + StR + SwG + SpG + SwA + SpA = 4
inv : SA + SF + MpA + MtF - SwA = 0
inv : CA + CF + StF + SwA + SpA + Cb + CwG + Ci = 16
inv : MpA + MtF + MpG + MwU + Mi = 6
inv : CwA + Cb + CwG + Ci = 16
inv : Uf + SF + CF + StF + CG + MtF + SG + MpG + SpG + Cb = 8
Total of 8 invariants.
[2020-05-17 06:29:17] [INFO ] Computed 8 place invariants in 5 ms
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/louvain-linux64, /tmp/graph17093023285668735002.bin, -l, -1, -v, -w, /tmp/graph17093023285668735002.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-17 06:29:17] [INFO ] Decomposing Gal with order
[2020-05-17 06:29:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-17 06:29:17] [INFO ] Removed a total of 3 redundant transitions.
[2020-05-17 06:29:17] [INFO ] Proved 25 variables to be positive in 143 ms
[2020-05-17 06:29:17] [INFO ] Computing symmetric may disable matrix : 18 transitions.
[2020-05-17 06:29:17] [INFO ] Computation of disable matrix completed :0/18 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-17 06:29:17] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-17 06:29:17] [INFO ] Computing symmetric may enable matrix : 18 transitions.
[2020-05-17 06:29:17] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-17 06:29:17] [INFO ] Flatten gal took : 64 ms
[2020-05-17 06:29:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2020-05-17 06:29:17] [INFO ] Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 4 ms
[2020-05-17 06:29:17] [INFO ] Time to serialize properties into /home/mcc/execution/LTLCardinality.ltl : 2 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /home/mcc/execution/LTLCardinality.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLCardinality.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.202005100927/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLCardinality.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLCardinality.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 9 LTL properties
Checking formula 0 : !(((G(F(!(X("(gi2.gu3.MpA>=3)")))))U((X("(gi4.gu1.CA<=gi4.gu1.Ci)"))&&((!(("(gi2.gu3.MpA>=3)")U("(gi2.gu4.SG>=2)")))||("(gi3.gu7.SA>gi3.gu7.SpG)")))))
Formula 0 simplified : !(GF!X"(gi2.gu3.MpA>=3)" U (X"(gi4.gu1.CA<=gi4.gu1.Ci)" & ("(gi3.gu7.SA>gi3.gu7.SpG)" | !("(gi2.gu3.MpA>=3)" U "(gi2.gu4.SG>=2)"))))
[2020-05-17 06:29:18] [INFO ] Computing symmetric co enabling matrix : 18 transitions.
[2020-05-17 06:29:19] [INFO ] Computation of Finished co-enabling matrix. took 676 ms. Total solver calls (SAT/UNSAT): 99(99/0)
[2020-05-17 06:29:19] [INFO ] Computing Do-Not-Accords matrix : 18 transitions.
[2020-05-17 06:29:19] [INFO ] Computation of Completed DNA matrix. took 241 ms. Total solver calls (SAT/UNSAT): 33(0/33)
[2020-05-17 06:29:19] [INFO ] Built C files in 2330ms conformant to PINS in folder :/home/mcc/execution
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit//lts_install_dir//include, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/home/mcc/execution]
Compilation finished in 691 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Link finished in 63 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, ([](<>(!( X((LTLAP0==true))) )))U(( X((LTLAP1==true)) ) && ( ( !( ((LTLAP0==true))U((LTLAP2==true))) ) || ( (LTLAP3==true)) )), --buchi-type=spotba], workingDir=/home/mcc/execution]
/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc: error while loading shared libraries: libltdl.so.7: cannot open shared object file: No such file or directory
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, ([](<>(!( X((LTLAP0==true))) )))U(( X((LTLAP1==true)) ) && ( ( !( ((LTLAP0==true))U((LTLAP2==true))) ) || ( (LTLAP3==true)) )), --buchi-type=spotba], workingDir=/home/mcc/execution]
127
java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, ([](<>(!( X((LTLAP0==true))) )))U(( X((LTLAP1==true)) ) && ( ( !( ((LTLAP0==true))U((LTLAP2==true))) ) || ( (LTLAP3==true)) )), --buchi-type=spotba], workingDir=/home/mcc/execution]
127
at fr.lip6.move.gal.application.LTSminRunner.checkProperty(LTSminRunner.java:170)
at fr.lip6.move.gal.application.LTSminRunner.access$10(LTSminRunner.java:124)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:834)
Reverse transition relation is NOT exact ! Due to transitions ssA, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/17/1/18
Computing Next relation with stutter on 1 deadlock states
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
7087 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,70.9212,1169716,1,0,36,4.95366e+06,84,23,816,4.38204e+06,57
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA ClientsAndServers-PT-N0002P0-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((X(X(G(F(X((G("(gi2.gu4.MpG>=3)"))U(!(F("(gi2.gu4.MpG>=3)"))))))))))
Formula 1 simplified : !XXGFX(G"(gi2.gu4.MpG>=3)" U !F"(gi2.gu4.MpG>=3)")
Computing Next relation with stutter on 1 deadlock states
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
9489 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,165.815,2237484,1,0,108,9.87069e+06,18,114,499,1.22143e+07,207
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA ClientsAndServers-PT-N0002P0-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((!(F((G((G("(gi3.gu7.SpG<=gi3.gu7.StF)"))||("(gi3.gu6.SwG>gi3.gu6.MtF)")))||(G(F("(gi4.gu8.CF>=2)")))))))
Formula 2 simplified : F(G("(gi3.gu6.SwG>gi3.gu6.MtF)" | G"(gi3.gu7.SpG<=gi3.gu7.StF)") | GF"(gi4.gu8.CF>=2)")
Computing Next relation with stutter on 1 deadlock states
48 unique states visited
48 strongly connected components in search stack
49 transitions explored
48 items max in DFS search stack
10476 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,270.571,2463676,1,0,262,1.18818e+07,18,272,501,1.53049e+07,186
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA ClientsAndServers-PT-N0002P0-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !(((!(X("(gi2.gu5.MwU>=1)")))&&(!(F("(gi2.gu3.Si<3)")))))
Formula 3 simplified : !(!X"(gi2.gu5.MwU>=1)" & !F"(gi2.gu3.Si<3)")
Computing Next relation with stutter on 1 deadlock states
5 unique states visited
5 strongly connected components in search stack
6 transitions explored
5 items max in DFS search stack
3964 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,310.268,2463676,1,0,641,1.18818e+07,41,615,623,1.53049e+07,1577
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA ClientsAndServers-PT-N0002P0-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((!(G(X("(gi3.gu7.StF>=1)")))))
Formula 4 simplified : GX"(gi3.gu7.StF>=1)"
Computing Next relation with stutter on 1 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,310.269,2463676,1,0,641,1.18818e+07,50,615,624,1.53049e+07,1581
no accepting run found
Formula 4 is TRUE no accepting run found.
FORMULA ClientsAndServers-PT-N0002P0-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !(((F("(gi4.gu8.CG>=2)"))U("(gu2.SpA>=3)")))
Formula 5 simplified : !(F"(gi4.gu8.CG>=2)" U "(gu2.SpA>=3)")
Computing Next relation with stutter on 1 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
27795 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,588.224,3001572,1,0,805,1.52574e+07,19,812,500,1.97598e+07,858
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA ClientsAndServers-PT-N0002P0-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((!((G(X(F("(gi2.gu3.Si<=gi2.gu3.MpA)"))))U(G("((gi3.gu7.SpG<=gi3.gu6.MtF)&&(gi2.gu4.SG>=1))")))))
Formula 6 simplified : GXF"(gi2.gu3.Si<=gi2.gu3.MpA)" U G"((gi3.gu7.SpG<=gi3.gu6.MtF)&&(gi2.gu4.SG>=1))"
Computing Next relation with stutter on 1 deadlock states
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
4210 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,630.316,3001572,1,0,805,1.52574e+07,45,812,626,1.97598e+07,1499
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA ClientsAndServers-PT-N0002P0-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((F(((X(X(G("(gi2.gu4.SG>=1)"))))||(F(G(F((X("(gi2.gu3.MpA>=2)"))U("(gi4.gu8.Cb>=2)"))))))||("(gi2.gu4.SG>=1)"))))
Formula 7 simplified : !F("(gi2.gu4.SG>=1)" | XXG"(gi2.gu4.SG>=1)" | FGF(X"(gi2.gu3.MpA>=2)" U "(gi4.gu8.Cb>=2)"))
Computing Next relation with stutter on 1 deadlock states
67 unique states visited
0 strongly connected components in search stack
66 transitions explored
34 items max in DFS search stack
25 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,630.578,3001572,1,0,805,1.52574e+07,61,826,630,1.97598e+07,1993
no accepting run found
Formula 7 is TRUE no accepting run found.
FORMULA ClientsAndServers-PT-N0002P0-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !(((!(F("(gu2.CR<=gu2.SpA)")))||(F(X(F(!(X("(gu0.SR<=gu0.SF)"))))))))
Formula 8 simplified : !(!F"(gu2.CR<=gu2.SpA)" | FXF!X"(gu0.SR<=gu0.SF)")
Computing Next relation with stutter on 1 deadlock states
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
3 items max in DFS search stack
4 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,630.613,3001572,1,0,878,1.52574e+07,74,884,637,1.97598e+07,2191
no accepting run found
Formula 8 is TRUE no accepting run found.
FORMULA ClientsAndServers-PT-N0002P0-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.

BK_STOP 1589697625161

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLCardinality -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6

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="ClientsAndServers-PT-N0002P0"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# 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 ClientsAndServers-PT-N0002P0, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r036-smll-158901930600113"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ClientsAndServers-PT-N0002P0.tgz
mv ClientsAndServers-PT-N0002P0 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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