fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r066-tajo-158922814800745
Last Updated
Jun 28, 2020

About the Execution of ITS-Tools for DoubleExponent-PT-001

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15756.860 5551.00 12048.00 47.80 FFFTFFFFFFTTTTFF 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.r066-tajo-158922814800745.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 DoubleExponent-PT-001, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r066-tajo-158922814800745
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 196K
-rw-r--r-- 1 mcc users 3.1K Mar 31 07:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 31 07:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 30 00:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 30 00:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.8K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 8 14:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Apr 8 14:52 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 28 14:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 28 14:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 27 07:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 27 07:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 28 14:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 28 14:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 17K 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 DoubleExponent-PT-001-00
FORMULA_NAME DoubleExponent-PT-001-01
FORMULA_NAME DoubleExponent-PT-001-02
FORMULA_NAME DoubleExponent-PT-001-03
FORMULA_NAME DoubleExponent-PT-001-04
FORMULA_NAME DoubleExponent-PT-001-05
FORMULA_NAME DoubleExponent-PT-001-06
FORMULA_NAME DoubleExponent-PT-001-07
FORMULA_NAME DoubleExponent-PT-001-08
FORMULA_NAME DoubleExponent-PT-001-09
FORMULA_NAME DoubleExponent-PT-001-10
FORMULA_NAME DoubleExponent-PT-001-11
FORMULA_NAME DoubleExponent-PT-001-12
FORMULA_NAME DoubleExponent-PT-001-13
FORMULA_NAME DoubleExponent-PT-001-14
FORMULA_NAME DoubleExponent-PT-001-15

=== Now, execution of the tool begins

BK_START 1590133720964

[2020-05-22 07:48:42] [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-22 07:48:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-22 07:48:42] [INFO ] Load time of PNML (sax parser for PT used): 45 ms
[2020-05-22 07:48:42] [INFO ] Transformed 57 places.
[2020-05-22 07:48:42] [INFO ] Transformed 48 transitions.
[2020-05-22 07:48:42] [INFO ] Parsed PT model containing 57 places and 48 transitions in 79 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 3314 resets, run finished after 164 ms. (steps per millisecond=609 ) properties seen :[0, 0, 1, 0, 1, 1, 0, 0, 1, 1, 1, 0, 0, 1, 1, 0, 1, 0, 0, 1, 1, 0, 1, 1, 0, 0, 1, 0, 1, 0, 0, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 0, 0, 0, 0, 1, 1, 1, 1]
// Phase 1: matrix 48 rows 57 cols
[2020-05-22 07:48:42] [INFO ] Computed 9 place invariants in 5 ms
[2020-05-22 07:48:42] [INFO ] [Real]Absence check using 4 positive place invariants in 14 ms returned unsat
[2020-05-22 07:48:42] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned unsat
[2020-05-22 07:48:42] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned unsat
[2020-05-22 07:48:42] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned unsat
[2020-05-22 07:48:42] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2020-05-22 07:48:42] [INFO ] [Real]Absence check using 4 positive and 5 generalized place invariants in 2 ms returned sat
[2020-05-22 07:48:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 07:48:42] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2020-05-22 07:48:43] [INFO ] Deduced a trap composed of 14 places in 63 ms
[2020-05-22 07:48:43] [INFO ] Deduced a trap composed of 27 places in 26 ms
[2020-05-22 07:48:43] [INFO ] Deduced a trap composed of 40 places in 27 ms
[2020-05-22 07:48:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 3 trap constraints in 138 ms
[2020-05-22 07:48:43] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2020-05-22 07:48:43] [INFO ] [Real]Absence check using 4 positive and 5 generalized place invariants in 2 ms returned sat
[2020-05-22 07:48:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 07:48:43] [INFO ] [Real]Absence check using state equation in 17 ms returned unsat
[2020-05-22 07:48:43] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned unsat
[2020-05-22 07:48:43] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2020-05-22 07:48:43] [INFO ] [Real]Absence check using 4 positive and 5 generalized place invariants in 1 ms returned unsat
[2020-05-22 07:48:43] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned unsat
[2020-05-22 07:48:43] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2020-05-22 07:48:43] [INFO ] [Real]Absence check using 4 positive and 5 generalized place invariants in 2 ms returned sat
[2020-05-22 07:48:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 07:48:43] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2020-05-22 07:48:43] [INFO ] Deduced a trap composed of 14 places in 31 ms
[2020-05-22 07:48:43] [INFO ] Deduced a trap composed of 27 places in 19 ms
[2020-05-22 07:48:43] [INFO ] Deduced a trap composed of 40 places in 16 ms
[2020-05-22 07:48:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 3 trap constraints in 76 ms
[2020-05-22 07:48:43] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned unsat
[2020-05-22 07:48:43] [INFO ] [Real]Absence check using 4 positive place invariants in 8 ms returned sat
[2020-05-22 07:48:43] [INFO ] [Real]Absence check using 4 positive and 5 generalized place invariants in 7 ms returned sat
[2020-05-22 07:48:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 07:48:43] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2020-05-22 07:48:43] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 07:48:43] [INFO ] [Nat]Absence check using 4 positive place invariants in 7 ms returned sat
[2020-05-22 07:48:43] [INFO ] [Nat]Absence check using 4 positive and 5 generalized place invariants in 1 ms returned sat
[2020-05-22 07:48:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 07:48:43] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2020-05-22 07:48:43] [INFO ] Deduced a trap composed of 10 places in 19 ms
[2020-05-22 07:48:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2020-05-22 07:48:43] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned unsat
[2020-05-22 07:48:43] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2020-05-22 07:48:43] [INFO ] [Real]Absence check using 4 positive and 5 generalized place invariants in 4 ms returned sat
[2020-05-22 07:48:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 07:48:43] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2020-05-22 07:48:43] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 07:48:43] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2020-05-22 07:48:43] [INFO ] [Nat]Absence check using 4 positive and 5 generalized place invariants in 2 ms returned sat
[2020-05-22 07:48:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 07:48:43] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2020-05-22 07:48:43] [INFO ] Deduced a trap composed of 23 places in 23 ms
[2020-05-22 07:48:43] [INFO ] Deduced a trap composed of 17 places in 17 ms
[2020-05-22 07:48:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 48 ms
[2020-05-22 07:48:43] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned unsat
[2020-05-22 07:48:43] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned unsat
[2020-05-22 07:48:43] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned unsat
[2020-05-22 07:48:43] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2020-05-22 07:48:43] [INFO ] [Real]Absence check using 4 positive and 5 generalized place invariants in 3 ms returned sat
[2020-05-22 07:48:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 07:48:43] [INFO ] [Real]Absence check using state equation in 24 ms returned unsat
[2020-05-22 07:48:43] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2020-05-22 07:48:43] [INFO ] [Real]Absence check using 4 positive and 5 generalized place invariants in 2 ms returned sat
[2020-05-22 07:48:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 07:48:43] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2020-05-22 07:48:43] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 07:48:43] [INFO ] [Nat]Absence check using 4 positive place invariants in 5 ms returned sat
[2020-05-22 07:48:43] [INFO ] [Nat]Absence check using 4 positive and 5 generalized place invariants in 2 ms returned sat
[2020-05-22 07:48:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 07:48:43] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2020-05-22 07:48:43] [INFO ] Deduced a trap composed of 14 places in 12 ms
[2020-05-22 07:48:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 13 ms
[2020-05-22 07:48:43] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned unsat
[2020-05-22 07:48:43] [INFO ] [Real]Absence check using 4 positive place invariants in 9 ms returned unsat
[2020-05-22 07:48:43] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned unsat
[2020-05-22 07:48:43] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned unsat
Successfully simplified 23 atomic propositions for a total of 25 simplifications.
[2020-05-22 07:48:43] [INFO ] Initial state reduction rules for CTL removed 7 formulas.
[2020-05-22 07:48:43] [INFO ] Flatten gal took : 27 ms
FORMULA DoubleExponent-PT-001-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-001-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-001-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-001-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-001-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-001-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-001-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-22 07:48:43] [INFO ] Flatten gal took : 6 ms
Using solver Z3 to compute partial order matrices.
[2020-05-22 07:48:43] [INFO ] Applying decomposition
[2020-05-22 07:48:43] [INFO ] Flatten gal took : 4 ms
Built C files in :
/home/mcc/execution
[2020-05-22 07:48:44] [INFO ] Input system was already deterministic with 48 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/graph12793841322454423517.txt, -o, /tmp/graph12793841322454423517.bin, -w, /tmp/graph12793841322454423517.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/graph12793841322454423517.bin, -l, -1, -v, -w, /tmp/graph12793841322454423517.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-22 07:48:44] [INFO ] Decomposing Gal with order
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 48 rows 57 cols
[2020-05-22 07:48:44] [INFO ] Computed 9 place invariants in 3 ms
inv : 3*p1 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + 3*p2 + p20 + p21 + p23 + p25 + p26 + p27 + p28 + p29 + 3*p3 + p30 + p31 + p32 + p33 + p35 + p37 + p38 + p39 + 2*p4 + p40 + p41 + p42 + p43 + p44 + p45 + p47 + p49 + 2*p5 + p50 + 2*p51 + p52 + 2*p53 + p54 + 2*p6 + p7 = 3
inv : p1 + p14 + p15 + p16 + p17 + p18 + p19 + p2 + p20 + p21 + p23 + p25 + p26 + p27 + p28 + p29 + p3 + p30 + p31 + p32 + p33 + p34 + p35 + p37 + p38 + p39 + p4 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p49 + p5 + p50 + p51 + p52 + p53 + p54 + p6 + p7 = 1
inv : 2*p1 + p15 + p2 + p3 + p4 + p41 + p44 + p8 + p9 = 2
inv : p22 - p26 - p27 - p28 - p29 - p30 - p31 - p32 - p33 - p34 - p35 - p37 + p48 - p50 - p51 - p52 - p53 - p54 = 0
inv : p36 + p48 - p50 - p51 - p52 - p53 - p54 = 0
inv : -p19 - p20 + p55 - p57 = 0
inv : -p20 + p56 - p57 = 0
inv : 2*p1 + p10 + p11 + p17 + 2*p2 + p29 + p3 + p32 + p4 + p5 = 2
inv : p1 + p14 + p15 + p16 + p17 + p18 + p19 + p2 + p20 + p21 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p3 + p30 + p31 + p32 + p33 + p34 + p35 + p37 + p4 - p48 + p5 + p50 + p51 + p52 + p53 + p54 + p6 + p7 = 1
Total of 9 invariants.
[2020-05-22 07:48:44] [INFO ] Computed 9 place invariants in 4 ms
[2020-05-22 07:48:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-22 07:48:44] [INFO ] Removed a total of 14 redundant transitions.
[2020-05-22 07:48:44] [INFO ] Flatten gal took : 31 ms
[2020-05-22 07:48:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2020-05-22 07:48:44] [INFO ] Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 3 ms
[2020-05-22 07:48:44] [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 9 LTL properties
Checking formula 0 : !((F(G("(gi2.gu1.p10>gi2.gu1.p24)"))))
Formula 0 simplified : !FG"(gi2.gu1.p10>gi2.gu1.p24)"
[2020-05-22 07:48:44] [INFO ] Proved 57 variables to be positive in 126 ms
[2020-05-22 07:48:44] [INFO ] Computing symmetric may disable matrix : 48 transitions.
[2020-05-22 07:48:44] [INFO ] Computation of disable matrix completed :0/48 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-22 07:48:44] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-22 07:48:44] [INFO ] Computing symmetric may enable matrix : 48 transitions.
[2020-05-22 07:48:44] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Reverse transition relation is NOT exact ! Due to transitions gi1.gi1.gu9.t25, gi2.gu4.t7, gi5.gi0.gu14.t42, gi5.gi0.t37, t16, t19, t30, t9, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/40/8/48
Computing Next relation with stutter on 16 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
26 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.27953,26400,1,0,818,37901,126,791,1465,46371,1749
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA DoubleExponent-PT-001-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((F(G(!(F(((F("(gi6.gu18.p36<=gi6.gu18.p51)"))U((!(G("(gu13.p50<=gu13.p42)")))&&("(gi5.gi0.gu8.p40<1)")))||(G("(gu13.p50<=gu13.p42)"))))))))
Formula 1 simplified : !FG!F(G"(gu13.p50<=gu13.p42)" | (F"(gi6.gu18.p36<=gi6.gu18.p51)" U ("(gi5.gi0.gu8.p40<1)" & !G"(gu13.p50<=gu13.p42)")))
Computing Next relation with stutter on 16 deadlock states
14 unique states visited
12 strongly connected components in search stack
17 transitions explored
12 items max in DFS search stack
6 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.344725,30000,1,0,922,39868,179,920,1569,52766,2169
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA DoubleExponent-PT-001-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((X(((F(X("(gi6.gu18.p51>=1)")))&&(X(F("(gi0.gu2.p35<=gi0.gu2.p11)"))))U(G("(gi0.gu2.p35<=gi0.gu2.p11)")))))
Formula 2 simplified : !X((FX"(gi6.gu18.p51>=1)" & XF"(gi0.gu2.p35<=gi0.gu2.p11)") U G"(gi0.gu2.p35<=gi0.gu2.p11)")
Computing Next relation with stutter on 16 deadlock states
100 unique states visited
47 strongly connected components in search stack
144 transitions explored
56 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.382098,31056,1,0,1163,44406,194,1254,1574,64863,3107
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA DoubleExponent-PT-001-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((X(X(G("(gi1.gi0.gu22.p56>=1)")))))
Formula 3 simplified : !XXG"(gi1.gi0.gu22.p56>=1)"
Computing Next relation with stutter on 16 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 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.410752,32112,1,0,1214,49263,202,1461,1576,73785,3434
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA DoubleExponent-PT-001-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !(((!(F("(gi0.gu2.p11>gi0.gu0.p1)")))||(X(G(!(F(X("(gi6.gu15.p44<=gi6.gu18.p36)"))))))))
Formula 4 simplified : !(!F"(gi0.gu2.p11>gi0.gu0.p1)" | XG!FX"(gi6.gu15.p44<=gi6.gu18.p36)")
Computing Next relation with stutter on 16 deadlock states
14 unique states visited
14 strongly connected components in search stack
14 transitions explored
14 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,0.420042,32640,1,0,1235,49829,224,1493,1594,75965,3565
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA DoubleExponent-PT-001-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !(((F(F(X(X("((gu3.p9<=gu3.p12)&&(gu24.p15<=gu24.p8))")))))&&(("(gu3.p9<=gu3.p12)")U("((gu24.p15<=gu24.p8)&&(gi2.gu10.p3>=0))"))))
Formula 5 simplified : !(FXX"((gu3.p9<=gu3.p12)&&(gu24.p15<=gu24.p8))" & ("(gu3.p9<=gu3.p12)" U "((gu24.p15<=gu24.p8)&&(gi2.gu10.p3>=0))"))
Computing Next relation with stutter on 16 deadlock states
3 unique states visited
0 strongly connected components in search stack
2 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.421735,32904,1,0,1235,49829,244,1493,1615,75973,3575
no accepting run found
Formula 5 is TRUE no accepting run found.
FORMULA DoubleExponent-PT-001-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((!(X(X(F(!(F((F("(gi2.gu23.p13>=1)"))||("(gi2.gu23.p13<1)")))))))))
Formula 6 simplified : XXF!F("(gi2.gu23.p13<1)" | F"(gi2.gu23.p13>=1)")
Computing Next relation with stutter on 16 deadlock states
107 unique states visited
0 strongly connected components in search stack
107 transitions explored
107 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.442013,33168,1,0,1235,49995,249,1582,1618,81914,4113
no accepting run found
Formula 6 is TRUE no accepting run found.
FORMULA DoubleExponent-PT-001-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((X(G(((F(G("(gi5.gi0.gu8.p25>gi5.gi0.gu8.p40)")))||("(gi6.gu15.p44<=gi6.gu15.p32)"))||("(gi0.gu2.p35<=gi0.gu2.p30)")))))
Formula 7 simplified : !XG("(gi0.gu2.p35<=gi0.gu2.p30)" | "(gi6.gu15.p44<=gi6.gu15.p32)" | FG"(gi5.gi0.gu8.p25>gi5.gi0.gu8.p40)")
Computing Next relation with stutter on 16 deadlock states
107 unique states visited
0 strongly connected components in search stack
107 transitions explored
107 items max in DFS search stack
7 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.501711,35016,1,0,1414,54605,262,1938,1630,99303,5105
no accepting run found
Formula 7 is TRUE no accepting run found.
FORMULA DoubleExponent-PT-001-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((X((F("(gi1.gi1.gu5.p28>gi1.gi1.gu5.p16)"))||(("(gi0.gu0.p1<=gi0.gu0.p34)")U("(gi5.gi0.gu11.p38>=1)")))))
Formula 8 simplified : !X(F"(gi1.gi1.gu5.p28>gi1.gi1.gu5.p16)" | ("(gi0.gu0.p1<=gi0.gu0.p34)" U "(gi5.gi0.gu11.p38>=1)"))
Computing Next relation with stutter on 16 deadlock states
25 unique states visited
25 strongly connected components in search stack
25 transitions explored
25 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,0.516065,35544,1,0,1473,55874,280,2036,1652,103235,5358
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA DoubleExponent-PT-001-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
[2020-05-22 07:48:44] [INFO ] Computing symmetric co enabling matrix : 48 transitions.
[2020-05-22 07:48:46] [INFO ] Computation of Finished co-enabling matrix. took 1310 ms. Total solver calls (SAT/UNSAT): 1128(4/1124)
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-22 07:48:46] [INFO ] Built C files in 2249ms 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 1590133726515

--------------------
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="DoubleExponent-PT-001"
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 DoubleExponent-PT-001, 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 r066-tajo-158922814800745"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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