Execution Chart

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

Trace from the execution

Formatting '/local/x2003239/mcc2020-input.r193-csrt-159033389200713.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2020-input.qcow2 encryption=off 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 ResAllocation-PT-R015C002, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r193-csrt-159033389200713
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 244K
-rw-r--r-- 1 mcc users 3.4K May 14 00:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K May 14 00:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 13 17:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 13 17:36 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 12 20:53 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 12 20:53 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K May 14 10:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 14 10:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 14 10:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 14K May 14 10:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 13 13:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K May 13 13:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.4K May 13 07:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 22K May 13 07:35 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 13 16:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 13 16:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 20:53 equiv_col
-rw-r--r-- 1 mcc users 9 May 12 20:53 instance
-rw-r--r-- 1 mcc users 6 May 12 20:53 iscolored
-rw-r--r-- 1 mcc users 64K May 12 20:53 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 ResAllocation-PT-R015C002-00
FORMULA_NAME ResAllocation-PT-R015C002-01
FORMULA_NAME ResAllocation-PT-R015C002-02
FORMULA_NAME ResAllocation-PT-R015C002-03
FORMULA_NAME ResAllocation-PT-R015C002-04
FORMULA_NAME ResAllocation-PT-R015C002-05
FORMULA_NAME ResAllocation-PT-R015C002-06
FORMULA_NAME ResAllocation-PT-R015C002-07
FORMULA_NAME ResAllocation-PT-R015C002-08
FORMULA_NAME ResAllocation-PT-R015C002-09
FORMULA_NAME ResAllocation-PT-R015C002-10
FORMULA_NAME ResAllocation-PT-R015C002-11
FORMULA_NAME ResAllocation-PT-R015C002-12
FORMULA_NAME ResAllocation-PT-R015C002-13
FORMULA_NAME ResAllocation-PT-R015C002-14
FORMULA_NAME ResAllocation-PT-R015C002-15

=== Now, execution of the tool begins

BK_START 1590556232100

[2020-05-27 05:10:34] [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 05:10:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-27 05:10:34] [INFO ] Load time of PNML (sax parser for PT used): 57 ms
[2020-05-27 05:10:34] [INFO ] Transformed 60 places.
[2020-05-27 05:10:34] [INFO ] Transformed 32 transitions.
[2020-05-27 05:10:34] [INFO ] Parsed PT model containing 60 places and 32 transitions in 106 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 19 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 1460 resets, run finished after 290 ms. (steps per millisecond=344 ) properties seen :[1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0, 1, 1, 0, 0, 1, 0, 0, 1, 1, 0, 0, 1, 0, 0, 1, 1, 0, 1, 0, 0, 0]
// Phase 1: matrix 32 rows 60 cols
[2020-05-27 05:10:34] [INFO ] Computed 30 place invariants in 6 ms
[2020-05-27 05:10:35] [INFO ] [Real]Absence check using 30 positive place invariants in 40 ms returned sat
[2020-05-27 05:10:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 05:10:35] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2020-05-27 05:10:35] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 05:10:35] [INFO ] [Nat]Absence check using 30 positive place invariants in 20 ms returned sat
[2020-05-27 05:10:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 05:10:35] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2020-05-27 05:10:35] [INFO ] Deduced a trap composed of 4 places in 43 ms
[2020-05-27 05:10:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 69 ms
[2020-05-27 05:10:35] [INFO ] [Real]Absence check using 30 positive place invariants in 3 ms returned unsat
[2020-05-27 05:10:35] [INFO ] [Real]Absence check using 30 positive place invariants in 7 ms returned unsat
[2020-05-27 05:10:35] [INFO ] [Real]Absence check using 30 positive place invariants in 3 ms returned unsat
[2020-05-27 05:10:35] [INFO ] [Real]Absence check using 30 positive place invariants in 3 ms returned unsat
[2020-05-27 05:10:35] [INFO ] [Real]Absence check using 30 positive place invariants in 3 ms returned unsat
[2020-05-27 05:10:35] [INFO ] [Real]Absence check using 30 positive place invariants in 3 ms returned unsat
[2020-05-27 05:10:35] [INFO ] [Real]Absence check using 30 positive place invariants in 16 ms returned sat
[2020-05-27 05:10:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 05:10:35] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2020-05-27 05:10:35] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 05:10:35] [INFO ] [Nat]Absence check using 30 positive place invariants in 10 ms returned sat
[2020-05-27 05:10:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 05:10:35] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2020-05-27 05:10:35] [INFO ] Computed and/alt/rep : 30/30/30 causal constraints in 5 ms.
[2020-05-27 05:10:35] [INFO ] Added : 14 causal constraints over 3 iterations in 28 ms. Result :sat
[2020-05-27 05:10:35] [INFO ] [Real]Absence check using 30 positive place invariants in 2 ms returned unsat
[2020-05-27 05:10:35] [INFO ] [Real]Absence check using 30 positive place invariants in 2 ms returned unsat
[2020-05-27 05:10:35] [INFO ] [Real]Absence check using 30 positive place invariants in 2 ms returned unsat
[2020-05-27 05:10:35] [INFO ] [Real]Absence check using 30 positive place invariants in 4 ms returned unsat
[2020-05-27 05:10:35] [INFO ] [Real]Absence check using 30 positive place invariants in 3 ms returned unsat
[2020-05-27 05:10:35] [INFO ] [Real]Absence check using 30 positive place invariants in 5 ms returned unsat
[2020-05-27 05:10:35] [INFO ] [Real]Absence check using 30 positive place invariants in 5 ms returned unsat
[2020-05-27 05:10:35] [INFO ] [Real]Absence check using 30 positive place invariants in 4 ms returned unsat
[2020-05-27 05:10:35] [INFO ] [Real]Absence check using 30 positive place invariants in 8 ms returned sat
[2020-05-27 05:10:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 05:10:35] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2020-05-27 05:10:35] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 05:10:35] [INFO ] [Nat]Absence check using 30 positive place invariants in 9 ms returned sat
[2020-05-27 05:10:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 05:10:35] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2020-05-27 05:10:35] [INFO ] Computed and/alt/rep : 30/30/30 causal constraints in 4 ms.
[2020-05-27 05:10:35] [INFO ] Added : 25 causal constraints over 5 iterations in 30 ms. Result :sat
[2020-05-27 05:10:35] [INFO ] [Real]Absence check using 30 positive place invariants in 9 ms returned sat
[2020-05-27 05:10:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 05:10:35] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2020-05-27 05:10:35] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 05:10:35] [INFO ] [Nat]Absence check using 30 positive place invariants in 9 ms returned sat
[2020-05-27 05:10:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 05:10:35] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2020-05-27 05:10:35] [INFO ] Computed and/alt/rep : 30/30/30 causal constraints in 10 ms.
[2020-05-27 05:10:35] [INFO ] Added : 25 causal constraints over 5 iterations in 33 ms. Result :sat
[2020-05-27 05:10:35] [INFO ] [Real]Absence check using 30 positive place invariants in 9 ms returned sat
[2020-05-27 05:10:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 05:10:35] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2020-05-27 05:10:35] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 05:10:35] [INFO ] [Nat]Absence check using 30 positive place invariants in 9 ms returned sat
[2020-05-27 05:10:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 05:10:36] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2020-05-27 05:10:36] [INFO ] Computed and/alt/rep : 30/30/30 causal constraints in 3 ms.
[2020-05-27 05:10:36] [INFO ] Added : 13 causal constraints over 3 iterations in 30 ms. Result :sat
[2020-05-27 05:10:36] [INFO ] [Real]Absence check using 30 positive place invariants in 8 ms returned unsat
[2020-05-27 05:10:36] [INFO ] [Real]Absence check using 30 positive place invariants in 11 ms returned sat
[2020-05-27 05:10:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 05:10:36] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2020-05-27 05:10:36] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 05:10:36] [INFO ] [Nat]Absence check using 30 positive place invariants in 9 ms returned sat
[2020-05-27 05:10:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 05:10:36] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2020-05-27 05:10:36] [INFO ] Computed and/alt/rep : 30/30/30 causal constraints in 2 ms.
[2020-05-27 05:10:36] [INFO ] Added : 13 causal constraints over 3 iterations in 16 ms. Result :sat
Successfully simplified 16 atomic propositions for a total of 18 simplifications.
[2020-05-27 05:10:36] [INFO ] Initial state reduction rules for CTL removed 7 formulas.
[2020-05-27 05:10:36] [INFO ] Flatten gal took : 87 ms
FORMULA ResAllocation-PT-R015C002-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R015C002-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R015C002-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R015C002-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R015C002-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R015C002-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R015C002-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-27 05:10:36] [INFO ] Flatten gal took : 10 ms
[2020-05-27 05:10:36] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA ResAllocation-PT-R015C002-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Using solver Z3 to compute partial order matrices.
[2020-05-27 05:10:36] [INFO ] Applying decomposition
Built C files in :
/home/mcc/execution
[2020-05-27 05:10:36] [INFO ] Flatten gal took : 8 ms
[2020-05-27 05:10:36] [INFO ] Input system was already deterministic with 32 transitions.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 32 rows 60 cols
[2020-05-27 05:10:36] [INFO ] Computed 30 place invariants in 2 ms
inv : p_1_0 + r_1_0 = 1
inv : p_0_11 + r_0_11 + p_1_11 = 1
inv : p_0_7 + r_0_7 + p_1_7 = 1
inv : p_1_5 + r_1_5 = 1
inv : p_1_1 + r_1_1 = 1
inv : p_0_6 + r_0_6 + p_1_6 = 1
inv : p_1_11 + r_1_11 = 1
inv : p_0_2 + r_0_2 + p_1_2 = 1
inv : p_0_10 + r_0_10 + p_1_10 = 1
inv : p_1_4 + r_1_4 = 1
inv : p_1_12 + r_1_12 = 1
inv : p_0_12 + r_0_12 + p_1_12 = 1
inv : p_0_3 + r_0_3 + p_1_3 = 1
inv : p_0_4 + r_0_4 + p_1_4 = 1
inv : p_1_8 + r_1_8 = 1
inv : p_0_9 + r_0_9 + p_1_9 = 1
inv : p_0_5 + r_0_5 + p_1_5 = 1
inv : p_0_13 + r_0_13 + p_1_13 = 1
inv : p_1_3 + r_1_3 = 1
inv : p_1_13 + r_1_13 = 1
inv : p_1_7 + r_1_7 = 1
inv : p_1_9 + r_1_9 = 1
inv : p_0_8 + r_0_8 + p_1_8 = 1
inv : p_0_1 + r_0_1 + p_1_1 = 1
inv : p_0_14 + r_0_14 + p_1_14 = 1
inv : p_1_6 + r_1_6 = 1
inv : p_1_2 + r_1_2 = 1
inv : p_1_14 + r_1_14 = 1
inv : p_1_10 + r_1_10 = 1
inv : p_0_0 + r_0_0 + p_1_0 = 1
Total of 30 invariants.
[2020-05-27 05:10:36] [INFO ] Computed 30 place invariants in 4 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/graph3758999996213170152.txt, -o, /tmp/graph3758999996213170152.bin, -w, /tmp/graph3758999996213170152.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/graph3758999996213170152.bin, -l, -1, -v, -w, /tmp/graph3758999996213170152.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-27 05:10:36] [INFO ] Decomposing Gal with order
[2020-05-27 05:10:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-27 05:10:37] [INFO ] Flatten gal took : 85 ms
[2020-05-27 05:10:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2020-05-27 05:10:37] [INFO ] Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 20 ms
[2020-05-27 05:10:37] [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, --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 8 LTL properties
Checking formula 0 : !((F(G(!(F((("(gi8.gu18.r_1_11<=gi8.gu18.r_1_12)")U("(gi4.gu0.p_0_0<=gi4.gu0.p_0_3)"))&&(X((F(G("(gi8.gu18.r_1_11<=gi8.gu18.r_1_12)")))||(F("(gu16.p_1_8>=1)"))))))))))
Formula 0 simplified : !FG!F(("(gi8.gu18.r_1_11<=gi8.gu18.r_1_12)" U "(gi4.gu0.p_0_0<=gi4.gu0.p_0_3)") & X(FG"(gi8.gu18.r_1_11<=gi8.gu18.r_1_12)" | F"(gu16.p_1_8>=1)"))
Reverse transition relation is NOT exact ! Due to transitions gi3.gu8.t_0_15, gi4.t_1_0, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/30/2/32
Computing Next relation with stutter on 14 deadlock states
[2020-05-27 05:10:37] [INFO ] Proved 60 variables to be positive in 615 ms
[2020-05-27 05:10:37] [INFO ] Computing symmetric may disable matrix : 32 transitions.
[2020-05-27 05:10:37] [INFO ] Computation of disable matrix completed :0/32 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-27 05:10:37] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-27 05:10:37] [INFO ] Computing symmetric may enable matrix : 32 transitions.
[2020-05-27 05:10:37] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
92 unique states visited
89 strongly connected components in search stack
96 transitions explored
90 items max in DFS search stack
51 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.57929,35732,1,0,543,93297,121,661,1816,138924,1572
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ResAllocation-PT-R015C002-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !(((G("((gu7.p_0_12<=gu7.r_0_1)&&(gu4.p_1_9<=gu4.r_0_9))"))||(F(G(F("(gu7.p_0_12<=gu7.r_0_1)"))))))
Formula 1 simplified : !(G"((gu7.p_0_12<=gu7.r_0_1)&&(gu4.p_1_9<=gu4.r_0_9))" | FGF"(gu7.p_0_12<=gu7.r_0_1)")
Computing Next relation with stutter on 14 deadlock states
4 unique states visited
4 strongly connected components in search stack
6 transitions explored
4 items max in DFS search stack
36 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.939179,45192,1,0,887,142808,139,1008,1828,214944,2343
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA ResAllocation-PT-R015C002-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((X(G(!(F("(gi8.gu2.p_0_4<=gi8.gu2.r_0_3)"))))))
Formula 2 simplified : !XG!F"(gi8.gu2.p_0_4<=gi8.gu2.r_0_3)"
Computing Next relation with stutter on 14 deadlock states
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.941385,45456,1,0,888,142902,147,1009,1831,215074,2355
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA ResAllocation-PT-R015C002-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((G(X("(gu4.p_1_9<=gu4.r_0_8)"))))
Formula 3 simplified : !GX"(gu4.p_1_9<=gu4.r_0_8)"
Computing Next relation with stutter on 14 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
22 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,1.16919,52056,1,0,1128,181475,153,1298,1835,273811,2961
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA ResAllocation-PT-R015C002-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((G(!(G(F(!(X("(gi7.gu17.p_1_10<=gi7.gu17.r_0_6)"))))))))
Formula 4 simplified : !G!GF!X"(gi7.gu17.p_1_10<=gi7.gu17.r_0_6)"
Computing Next relation with stutter on 14 deadlock states
2 unique states visited
1 strongly connected components in search stack
3 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,1.17537,52320,1,0,1133,182370,158,1304,1839,275576,2977
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA ResAllocation-PT-R015C002-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((G(F(G(F(X("(gi8.gu2.r_0_3>gi8.gu18.r_1_12)")))))))
Formula 5 simplified : !GFGFX"(gi8.gu2.r_0_3>gi8.gu18.r_1_12)"
Computing Next relation with stutter on 14 deadlock states
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
1 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,1.18025,52320,1,0,1135,183114,167,1307,1845,277092,2990
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA ResAllocation-PT-R015C002-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !(((!(F(X("(gi3.gu15.p_0_13<=gi3.gu15.p_1_7)"))))&&(!(G("(gi7.gu17.p_0_5<=gi7.gu17.r_0_6)")))))
Formula 6 simplified : !(!FX"(gi3.gu15.p_0_13<=gi3.gu15.p_1_7)" & !G"(gi7.gu17.p_0_5<=gi7.gu17.r_0_6)")
Computing Next relation with stutter on 14 deadlock states
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,1.18159,52584,1,0,1135,183114,180,1307,1855,277096,3000
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA ResAllocation-PT-R015C002-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((!(G("(gu16.p_1_1<=gu16.p_1_8)"))))
Formula 7 simplified : G"(gu16.p_1_1<=gu16.p_1_8)"
Computing Next relation with stutter on 14 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
38 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,1.56144,58128,1,0,1364,214296,189,1592,1860,326544,3592
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA ResAllocation-PT-R015C002-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
[2020-05-27 05:10:39] [INFO ] Computing symmetric co enabling matrix : 32 transitions.
[2020-05-27 05:10:39] [INFO ] Computation of Finished co-enabling matrix. took 554 ms. Total solver calls (SAT/UNSAT): 76(15/61)
Skipping mayMatrices nes/nds SMT solver raised an error on invariants :(error "Failed to assert expression: java.io.IOException: Stream closed (invariants (select s 2))")
java.lang.RuntimeException: SMT solver raised an error on invariants :(error "Failed to assert expression: java.io.IOException: Stream closed (invariants (select s 2))")
at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.addKnownInvariants(KInductionSolver.java:460)
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeDoNotAccord(NecessaryEnablingsolver.java:574)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:538)
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 05:10:39] [INFO ] Built C files in 2902ms 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 1590556240009

--------------------
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="ResAllocation-PT-R015C002"
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 ResAllocation-PT-R015C002, 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 r193-csrt-159033389200713"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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