About the Execution of ITS-Tools for ShieldPPPt-PT-001A
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
15742.240 | 3004.00 | 7154.00 | 50.60 | TFTTFTFFTFFFFFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2020-input.r210-tajo-159033475900569.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/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 ShieldPPPt-PT-001A, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r210-tajo-159033475900569
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 180K
-rw-r--r-- 1 mcc users 3.1K May 14 01:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K May 14 01:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 13 19:13 CTLFireability.txt
-rw-r--r-- 1 mcc users 14K May 13 19:13 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K May 14 10:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 14 10:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K May 14 10:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 14 10:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 20:42 NewModel
-rw-r--r-- 1 mcc users 3.8K May 13 14:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K May 13 14:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.1K May 13 08:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 22K May 13 08:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 13 16:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 13 16:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 20:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 12 20:42 instance
-rw-r--r-- 1 mcc users 6 May 12 20:42 iscolored
-rw-r--r-- 1 mcc users 7.4K May 12 20:42 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 ShieldPPPt-PT-001A-00
FORMULA_NAME ShieldPPPt-PT-001A-01
FORMULA_NAME ShieldPPPt-PT-001A-02
FORMULA_NAME ShieldPPPt-PT-001A-03
FORMULA_NAME ShieldPPPt-PT-001A-04
FORMULA_NAME ShieldPPPt-PT-001A-05
FORMULA_NAME ShieldPPPt-PT-001A-06
FORMULA_NAME ShieldPPPt-PT-001A-07
FORMULA_NAME ShieldPPPt-PT-001A-08
FORMULA_NAME ShieldPPPt-PT-001A-09
FORMULA_NAME ShieldPPPt-PT-001A-10
FORMULA_NAME ShieldPPPt-PT-001A-11
FORMULA_NAME ShieldPPPt-PT-001A-12
FORMULA_NAME ShieldPPPt-PT-001A-13
FORMULA_NAME ShieldPPPt-PT-001A-14
FORMULA_NAME ShieldPPPt-PT-001A-15
=== Now, execution of the tool begins
BK_START 1590606108215
[2020-05-27 19:01:49] [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-27 19:01:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-27 19:01:49] [INFO ] Load time of PNML (sax parser for PT used): 23 ms
[2020-05-27 19:01:49] [INFO ] Transformed 28 places.
[2020-05-27 19:01:49] [INFO ] Transformed 21 transitions.
[2020-05-27 19:01:49] [INFO ] Found NUPN structural information;
[2020-05-27 19:01:49] [INFO ] Parsed PT model containing 28 places and 21 transitions in 56 ms.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 199 ms. (steps per millisecond=502 ) properties seen :[0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 20 rows 28 cols
[2020-05-27 19:01:50] [INFO ] Computed 12 place invariants in 6 ms
[2020-05-27 19:01:50] [INFO ] [Real]Absence check using 12 positive place invariants in 22 ms returned sat
[2020-05-27 19:01:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 19:01:50] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2020-05-27 19:01:50] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 19:01:50] [INFO ] [Nat]Absence check using 12 positive place invariants in 9 ms returned unsat
[2020-05-27 19:01:50] [INFO ] [Real]Absence check using 12 positive place invariants in 9 ms returned sat
[2020-05-27 19:01:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 19:01:50] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2020-05-27 19:01:50] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 19:01:50] [INFO ] [Nat]Absence check using 12 positive place invariants in 11 ms returned unsat
[2020-05-27 19:01:50] [INFO ] [Real]Absence check using 12 positive place invariants in 4 ms returned sat
[2020-05-27 19:01:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 19:01:50] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2020-05-27 19:01:50] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 19:01:50] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned unsat
[2020-05-27 19:01:50] [INFO ] [Real]Absence check using 12 positive place invariants in 5 ms returned sat
[2020-05-27 19:01:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 19:01:50] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2020-05-27 19:01:50] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 19:01:50] [INFO ] [Nat]Absence check using 12 positive place invariants in 4 ms returned unsat
[2020-05-27 19:01:50] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned sat
[2020-05-27 19:01:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 19:01:50] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2020-05-27 19:01:50] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 19:01:50] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned unsat
[2020-05-27 19:01:50] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned sat
[2020-05-27 19:01:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 19:01:50] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2020-05-27 19:01:50] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 19:01:50] [INFO ] [Nat]Absence check using 12 positive place invariants in 4 ms returned unsat
Successfully simplified 6 atomic propositions for a total of 6 simplifications.
[2020-05-27 19:01:50] [INFO ] Initial state reduction rules for CTL removed 7 formulas.
[2020-05-27 19:01:50] [INFO ] Flatten gal took : 22 ms
FORMULA ShieldPPPt-PT-001A-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-001A-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-001A-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-001A-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-001A-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-001A-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-001A-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-27 19:01:50] [INFO ] Flatten gal took : 5 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-27 19:01:50] [INFO ] Applying decomposition
[2020-05-27 19:01:50] [INFO ] Flatten gal took : 4 ms
[2020-05-27 19:01:50] [INFO ] Input system was already deterministic with 20 transitions.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 20 rows 28 cols
[2020-05-27 19:01:50] [INFO ] Computed 12 place invariants in 2 ms
inv : p0 + p5 + p6 + p7 = 1
inv : p0 + p3 + p4 = 1
inv : p0 + p15 + p18 + p19 = 1
inv : p0 + p10 + p13 + p14 = 1
inv : p0 + p24 + p25 = 1
inv : p0 + p20 + p21 = 1
inv : p0 + p22 + p23 = 1
inv : p0 + p1 + p2 = 1
inv : p0 + p15 + p16 + p17 = 1
inv : p0 + p26 + p27 = 1
inv : p0 + p10 + p11 + p12 = 1
inv : p0 + p5 + p8 + p9 = 1
Total of 12 invariants.
[2020-05-27 19:01:50] [INFO ] Computed 12 place invariants in 3 ms
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/graph11045432017434250921.txt, -o, /tmp/graph11045432017434250921.bin, -w, /tmp/graph11045432017434250921.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/louvain-linux64, /tmp/graph11045432017434250921.bin, -l, -1, -v, -w, /tmp/graph11045432017434250921.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-27 19:01:50] [INFO ] Decomposing Gal with order
[2020-05-27 19:01:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-27 19:01:50] [INFO ] Removed a total of 3 redundant transitions.
[2020-05-27 19:01:50] [INFO ] Flatten gal took : 28 ms
[2020-05-27 19:01:50] [INFO ] Proved 28 variables to be positive in 85 ms
[2020-05-27 19:01:50] [INFO ] Computing symmetric may disable matrix : 20 transitions.
[2020-05-27 19:01:50] [INFO ] Computation of disable matrix completed :0/20 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-27 19:01:50] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-27 19:01:50] [INFO ] Computing symmetric may enable matrix : 20 transitions.
[2020-05-27 19:01:50] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-27 19:01:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2020-05-27 19:01:50] [INFO ] Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 1 ms
[2020-05-27 19:01:50] [INFO ] Time to serialize properties into /home/mcc/execution/LTLCardinality.ltl : 1 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], 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
Read 9 LTL properties
Checking formula 0 : !((!(G(F("(u5.p21==1)")))))
Formula 0 simplified : GF"(u5.p21==1)"
built 10 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
5 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.085028,20324,1,0,11892,156,313,9686,124,682,13359
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ShieldPPPt-PT-001A-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((X(G("((u2.p7==0)||(u2.p5==1))"))))
Formula 1 simplified : !XG"((u2.p7==0)||(u2.p5==1))"
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
2 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.090486,20876,1,0,12592,168,367,10489,130,731,14920
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA ShieldPPPt-PT-001A-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((G(F(X(X(X(!(X("((i1.u1.p4==0)||(u2.p7==1))")))))))))
Formula 2 simplified : !GFXXX!X"((i1.u1.p4==0)||(u2.p7==1))"
7 unique states visited
7 strongly connected components in search stack
8 transitions explored
7 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,0.101185,21816,1,0,13348,187,400,11354,132,787,16429
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA ShieldPPPt-PT-001A-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !(((!(F((X(X((F(G("(u8.p27==1)")))&&("((u2.p8==0)||(u8.p26==1))"))))&&(X("((u2.p8==0)||(u8.p26==1))")))))&&(!(F("(u8.p27==1)")))))
Formula 3 simplified : !(!F(XX("((u2.p8==0)||(u8.p26==1))" & FG"(u8.p27==1)") & X"((u2.p8==0)||(u8.p26==1))") & !F"(u8.p27==1)")
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 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,0.103755,22604,1,0,13366,189,415,11373,132,796,16511
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA ShieldPPPt-PT-001A-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((G(((!(X("((u5.p21==0)||(u3.p12==1))")))||("(i5.u0.p1==0)"))||("(u5.p21==1)"))))
Formula 4 simplified : !G("(i5.u0.p1==0)" | "(u5.p21==1)" | !X"((u5.p21==0)||(u3.p12==1))")
6 unique states visited
5 strongly connected components in search stack
9 transitions explored
6 items max in DFS search stack
3 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.131202,24132,1,0,18150,191,472,15993,133,845,24658
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA ShieldPPPt-PT-001A-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((G((!(X("((u3.p13==0)||(u5.p20==1))")))&&("((u2.p6!=1)||((u5.p20!=0)&&(u5.p20!=1)))"))))
Formula 5 simplified : !G("((u2.p6!=1)||((u5.p20!=0)&&(u5.p20!=1)))" & !X"((u3.p13==0)||(u5.p20==1))")
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 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,0.132357,24336,1,0,18150,191,511,15993,137,845,24694
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA ShieldPPPt-PT-001A-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((G((G(!(G(!(G(!(X("((i5.u7.p24!=0)&&(i1.u6.p22!=1))"))))))))U(X("((i5.u0.p1==0)||(i1.u1.p3==1))")))))
Formula 6 simplified : !G(G!G!G!X"((i5.u7.p24!=0)&&(i1.u6.p22!=1))" U X"((i5.u0.p1==0)||(i1.u1.p3==1))")
5 unique states visited
4 strongly connected components in search stack
7 transitions explored
5 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,0.137526,24808,1,0,18838,191,557,16822,137,845,25779
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA ShieldPPPt-PT-001A-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((X(X(F(G(X("((i5.u0.p2!=0)&&(u3.p14!=1))")))))))
Formula 7 simplified : !XXFGX"((i5.u0.p2!=0)&&(u3.p14!=1))"
3 unique states visited
2 strongly connected components in search stack
4 transitions explored
3 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,0.138802,24808,1,0,18901,191,582,16916,138,848,25908
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA ShieldPPPt-PT-001A-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((X(G(!(("((u4.p19==0)||(i1.u1.p3==1))")U("((u5.p21==0)||(u2.p8==1))"))))))
Formula 8 simplified : !XG!("((u4.p19==0)||(i1.u1.p3==1))" U "((u5.p21==0)||(u2.p8==1))")
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 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,0.143732,25048,1,0,19262,191,604,17376,139,848,26710
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA ShieldPPPt-PT-001A-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Skipping mayMatrices nes/nds Could not set logic :(error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
java.lang.RuntimeException: Could not set logic :(error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.buildSolver(NecessaryEnablingsolver.java:104)
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeAblingForPredicate(NecessaryEnablingsolver.java:662)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:502)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printDependencyMatrix(Gal2PinsTransformerNext.java:209)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.buildBodyFile(Gal2PinsTransformerNext.java:85)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.transform(Gal2PinsTransformerNext.java:831)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:73)
at java.base/java.lang.Thread.run(Thread.java:834)
[2020-05-27 19:01:51] [INFO ] Built C files in 367ms 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]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
BK_STOP 1590606111219
--------------------
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="ShieldPPPt-PT-001A"
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 ShieldPPPt-PT-001A, 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 r210-tajo-159033475900569"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPt-PT-001A.tgz
mv ShieldPPPt-PT-001A 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 '
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 ;