fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r111-csrt-158961258100753
Last Updated
Jun 28, 2020

About the Execution of ITS-Tools for PhaseVariation-PT-D02CS010

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15748.440 8972.00 22814.00 87.40 FFFFFTTFTTTFTFFT normal

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.r111-csrt-158961258100753.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 PhaseVariation-PT-D02CS010, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r111-csrt-158961258100753
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 292K
-rw-r--r-- 1 mcc users 4.5K Apr 12 00:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 12 00:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K Apr 10 23:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 21K Apr 10 23:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.6K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.4K Apr 14 12:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Apr 14 12:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Apr 10 08:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Apr 10 08:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Apr 9 13:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 23K Apr 9 13:05 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 10 22:21 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 10 22:21 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 9 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 73K 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 PhaseVariation-PT-D02CS010-00
FORMULA_NAME PhaseVariation-PT-D02CS010-01
FORMULA_NAME PhaseVariation-PT-D02CS010-02
FORMULA_NAME PhaseVariation-PT-D02CS010-03
FORMULA_NAME PhaseVariation-PT-D02CS010-04
FORMULA_NAME PhaseVariation-PT-D02CS010-05
FORMULA_NAME PhaseVariation-PT-D02CS010-06
FORMULA_NAME PhaseVariation-PT-D02CS010-07
FORMULA_NAME PhaseVariation-PT-D02CS010-08
FORMULA_NAME PhaseVariation-PT-D02CS010-09
FORMULA_NAME PhaseVariation-PT-D02CS010-10
FORMULA_NAME PhaseVariation-PT-D02CS010-11
FORMULA_NAME PhaseVariation-PT-D02CS010-12
FORMULA_NAME PhaseVariation-PT-D02CS010-13
FORMULA_NAME PhaseVariation-PT-D02CS010-14
FORMULA_NAME PhaseVariation-PT-D02CS010-15

=== Now, execution of the tool begins

BK_START 1590029970555

[2020-05-21 02:59:33] [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-21 02:59:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-21 02:59:33] [INFO ] Load time of PNML (sax parser for PT used): 78 ms
[2020-05-21 02:59:33] [INFO ] Transformed 14 places.
[2020-05-21 02:59:33] [INFO ] Transformed 65 transitions.
[2020-05-21 02:59:33] [INFO ] Parsed PT model containing 14 places and 65 transitions in 139 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 74 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 5988 resets, run finished after 159 ms. (steps per millisecond=628 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 0, 0, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1]
[2020-05-21 02:59:33] [INFO ] Flow matrix only has 9 transitions (discarded 56 similar events)
// Phase 1: matrix 9 rows 14 cols
[2020-05-21 02:59:33] [INFO ] Computed 5 place invariants in 3 ms
[2020-05-21 02:59:33] [INFO ] [Real]Absence check using 5 positive place invariants in 16 ms returned sat
[2020-05-21 02:59:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 02:59:33] [INFO ] [Real]Absence check using state equation in 8 ms returned unsat
[2020-05-21 02:59:33] [INFO ] [Real]Absence check using 5 positive place invariants in 8 ms returned sat
[2020-05-21 02:59:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 02:59:33] [INFO ] [Real]Absence check using state equation in 21 ms returned unsat
[2020-05-21 02:59:33] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2020-05-21 02:59:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 02:59:33] [INFO ] [Real]Absence check using state equation in 5 ms returned unsat
[2020-05-21 02:59:33] [INFO ] [Real]Absence check using 5 positive place invariants in 7 ms returned sat
[2020-05-21 02:59:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 02:59:33] [INFO ] [Real]Absence check using state equation in 4 ms returned unsat
[2020-05-21 02:59:33] [INFO ] [Real]Absence check using 5 positive place invariants in 7 ms returned unsat
[2020-05-21 02:59:33] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned unsat
[2020-05-21 02:59:33] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2020-05-21 02:59:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 02:59:33] [INFO ] [Real]Absence check using state equation in 3 ms returned unsat
[2020-05-21 02:59:33] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned unsat
[2020-05-21 02:59:33] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2020-05-21 02:59:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 02:59:33] [INFO ] [Real]Absence check using state equation in 9 ms returned unsat
[2020-05-21 02:59:33] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2020-05-21 02:59:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 02:59:34] [INFO ] [Real]Absence check using state equation in 5 ms returned unsat
[2020-05-21 02:59:34] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2020-05-21 02:59:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 02:59:34] [INFO ] [Real]Absence check using state equation in 3 ms returned unsat
Successfully simplified 11 atomic propositions for a total of 12 simplifications.
[2020-05-21 02:59:34] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2020-05-21 02:59:34] [INFO ] Flatten gal took : 47 ms
FORMULA PhaseVariation-PT-D02CS010-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhaseVariation-PT-D02CS010-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhaseVariation-PT-D02CS010-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhaseVariation-PT-D02CS010-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhaseVariation-PT-D02CS010-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-21 02:59:34] [INFO ] Flatten gal took : 33 ms
Using solver Z3 to compute partial order matrices.
[2020-05-21 02:59:34] [INFO ] Applying decomposition
Built C files in :
/home/mcc/execution
[2020-05-21 02:59:34] [INFO ] Flatten gal took : 30 ms
[2020-05-21 02:59:34] [INFO ] Input system was already deterministic with 65 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/graph8984976874692919994.txt, -o, /tmp/graph8984976874692919994.bin, -w, /tmp/graph8984976874692919994.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/graph8984976874692919994.bin, -l, -1, -v, -w, /tmp/graph8984976874692919994.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-21 02:59:34] [INFO ] Decomposing Gal with order
[2020-05-21 02:59:34] [INFO ] Rewriting arrays to variables to allow decomposition.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 9 out of 65 initially.
// Phase 1: matrix 9 rows 14 cols
[2020-05-21 02:59:34] [INFO ] Computed 5 place invariants in 3 ms
inv : cell___1_2__A_ + cell___1_2__B_ + pool__1_2_ = 3
inv : cell___2_1__A_ + cell___2_1__B_ + pool__2_1_ = 3
inv : cell___2_2__A_ + cell___2_2__B_ + pool__2_2_ = 3
inv : pool__1_1_ + pool__1_2_ + pool__2_1_ + pool__2_2_ + size_dot = 12
inv : cell___1_1__A_ + cell___1_1__B_ + pool__1_1_ = 3
Total of 5 invariants.
[2020-05-21 02:59:34] [INFO ] Computed 5 place invariants in 7 ms
[2020-05-21 02:59:34] [INFO ] Removed a total of 121 redundant transitions.
[2020-05-21 02:59:34] [INFO ] Proved 14 variables to be positive in 58 ms
[2020-05-21 02:59:34] [INFO ] Computing symmetric may disable matrix : 65 transitions.
[2020-05-21 02:59:34] [INFO ] Computation of disable matrix completed :0/65 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-21 02:59:34] [INFO ] Flatten gal took : 51 ms
[2020-05-21 02:59:34] [INFO ] Computation of Complete disable matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-21 02:59:34] [INFO ] Computing symmetric may enable matrix : 65 transitions.
[2020-05-21 02:59:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 44 labels/synchronizations in 4 ms.
[2020-05-21 02:59:34] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-21 02:59:34] [INFO ] Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 2 ms
[2020-05-21 02:59:34] [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 11 LTL properties
Checking formula 0 : !((F(G(X(!(X(((G(X("(gu0.cell___2_1__A_>=1)")))||("(gu1.cell___2_2__A_<=gu1.pool__2_2_)"))||("(gu1.cell___1_1__B_<=gu1.cell___1_2__B_)"))))))))
Formula 0 simplified : !FGX!X("(gu1.cell___1_1__B_<=gu1.cell___1_2__B_)" | "(gu1.cell___2_2__A_<=gu1.pool__2_2_)" | GX"(gu0.cell___2_1__A_>=1)")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 1716 deadlock states
16 unique states visited
16 strongly connected components in search stack
17 transitions explored
16 items max in DFS search stack
81 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.832232,37816,1,0,21,72979,25,30,652,102243,90
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA PhaseVariation-PT-D02CS010-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((G(F(G((X("(gu0.pool__1_2_<=gu0.run_dot)"))||(("(gu0.pool__1_2_<=gu0.run_dot)")U("(gu0.cell___2_2__B_>=1)")))))))
Formula 1 simplified : !GFG(X"(gu0.pool__1_2_<=gu0.run_dot)" | ("(gu0.pool__1_2_<=gu0.run_dot)" U "(gu0.cell___2_2__B_>=1)"))
Computing Next relation with stutter on 1716 deadlock states
15 unique states visited
14 strongly connected components in search stack
17 transitions explored
15 items max in DFS search stack
18 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.02545,41544,1,0,53,87528,38,62,663,123293,194
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA PhaseVariation-PT-D02CS010-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((!(X((G("(gu1.pool__2_2_<=gu0.run_dot)"))U((X("((gu1.cell___2_2__A_>=1)&&(gu1.cell___1_1__B_>=2))"))||(X("(gu1.cell___2_2__A_>=1)")))))))
Formula 2 simplified : X(G"(gu1.pool__2_2_<=gu0.run_dot)" U (X"((gu1.cell___2_2__A_>=1)&&(gu1.cell___1_1__B_>=2))" | X"(gu1.cell___2_2__A_>=1)"))
Computing Next relation with stutter on 1716 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 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.04105,42184,1,0,69,89141,52,85,677,124678,249
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA PhaseVariation-PT-D02CS010-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((F("((gu1.cell___1_1__B_>gu0.cell___2_1__A_)&&(gu2.pool__1_1_<3))")))
Formula 3 simplified : !F"((gu1.cell___1_1__B_>gu0.cell___2_1__A_)&&(gu2.pool__1_1_<3))"
Computing Next relation with stutter on 1716 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
75 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.79107,59560,1,0,130,159509,61,136,689,237000,377
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA PhaseVariation-PT-D02CS010-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !(((!(X("(gu0.cell___2_2__B_<=gu0.run_dot)")))||(X((G(!(X("(gu1.cell___1_1__B_<=gu0.cell___2_2__B_)"))))&&("(gu1.cell___2_1__B_<2)")))))
Formula 4 simplified : !(!X"(gu0.cell___2_2__B_<=gu0.run_dot)" | X("(gu1.cell___2_1__B_<2)" & G!X"(gu1.cell___1_1__B_<=gu0.cell___2_2__B_)"))
Computing Next relation with stutter on 1716 deadlock states
15 unique states visited
14 strongly connected components in search stack
16 transitions explored
14 items max in DFS search stack
21 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,2.00298,65340,1,0,203,174410,77,200,705,269465,557
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA PhaseVariation-PT-D02CS010-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((F(X((F(X((G(!(G("((gu0.cell___2_1__A_>=3)||(gu0.cell___2_1__A_<=gu0.cell___2_2__B_))"))))&&("(gu0.pool__2_1_<=gu0.run_dot)"))))&&("(gu0.cell___2_1__A_<3)")))))
Formula 5 simplified : !FX("(gu0.cell___2_1__A_<3)" & FX("(gu0.pool__2_1_<=gu0.run_dot)" & G!G"((gu0.cell___2_1__A_>=3)||(gu0.cell___2_1__A_<=gu0.cell___2_2__B_))"))
Computing Next relation with stutter on 1716 deadlock states
[2020-05-21 02:59:37] [INFO ] Computing symmetric co enabling matrix : 65 transitions.
12 unique states visited
12 strongly connected components in search stack
12 transitions explored
12 items max in DFS search stack
73 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,2.73102,77984,1,0,258,230497,92,246,727,356281,701
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA PhaseVariation-PT-D02CS010-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((F(X(((X(!(F(X((G("(gu0.run_dot<=gu0.cell___1_2__A_)"))U("(gu1.cell___1_2__B_<=gu1.cell___1_1__B_)"))))))||(F("(gu0.run_dot<=gu0.cell___1_2__A_)")))||("(gu0.run_dot<=gu0.cell___1_2__A_)")))))
Formula 6 simplified : !FX("(gu0.run_dot<=gu0.cell___1_2__A_)" | X!FX(G"(gu0.run_dot<=gu0.cell___1_2__A_)" U "(gu1.cell___1_2__B_<=gu1.cell___1_1__B_)") | F"(gu0.run_dot<=gu0.cell___1_2__A_)")
Computing Next relation with stutter on 1716 deadlock states
[2020-05-21 02:59:37] [INFO ] Computation of co-enabling matrix(0/65) took 628 ms. Total solver calls (SAT/UNSAT): 64(64/0)
66 unique states visited
0 strongly connected components in search stack
111 transitions explored
13 items max in DFS search stack
85 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,3.60019,92056,1,0,412,286647,104,398,740,455917,1152
no accepting run found
Formula 6 is TRUE no accepting run found.
FORMULA PhaseVariation-PT-D02CS010-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((G(X(F((G(!(F(F("(gu0.run_dot>=1)")))))&&("(gu1.cell___1_1__B_<=gu1.cell___2_1__B_)"))))))
Formula 7 simplified : !GXF("(gu1.cell___1_1__B_<=gu1.cell___2_1__B_)" & G!F"(gu0.run_dot>=1)")
Computing Next relation with stutter on 1716 deadlock states
15 unique states visited
15 strongly connected components in search stack
16 transitions explored
15 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,3.62865,92572,1,0,414,287283,120,400,751,456805,1170
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA PhaseVariation-PT-D02CS010-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((G("((gu1.cell___2_1__B_<=gu1.cell___1_2__B_)&&(gu1.cell___2_1__B_<=gu1.cell___2_2__A_))")))
Formula 8 simplified : !G"((gu1.cell___2_1__B_<=gu1.cell___1_2__B_)&&(gu1.cell___2_1__B_<=gu1.cell___2_2__A_))"
Computing Next relation with stutter on 1716 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
24 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,3.86988,97852,1,0,468,312172,126,453,769,492449,1287
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA PhaseVariation-PT-D02CS010-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !(((("(gu0.cell___2_2__B_<=gu0.run_dot)")U((G("(gu1.cell___2_2__A_<=gu1.cell___1_1__B_)"))||(F("(gu0.cell___2_2__B_<=gu0.run_dot)"))))&&(X((F("(gu1.cell___2_2__A_<=gu1.cell___1_1__B_)"))&&("(gu1.cell___2_2__A_<=gu1.cell___1_1__B_)")))))
Formula 9 simplified : !(("(gu0.cell___2_2__B_<=gu0.run_dot)" U (G"(gu1.cell___2_2__A_<=gu1.cell___1_1__B_)" | F"(gu0.cell___2_2__B_<=gu0.run_dot)")) & X("(gu1.cell___2_2__A_<=gu1.cell___1_1__B_)" & F"(gu1.cell___2_2__A_<=gu1.cell___1_1__B_)"))
Computing Next relation with stutter on 1716 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 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,3.87397,98096,1,0,470,312300,135,456,777,492599,1304
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA PhaseVariation-PT-D02CS010-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((X("(gu0.cell___2_2__B_<2)")))
Formula 10 simplified : !X"(gu0.cell___2_2__B_<2)"
Computing Next relation with stutter on 1716 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,3.87435,98360,1,0,470,312300,138,456,778,492599,1306
no accepting run found
Formula 10 is TRUE no accepting run found.
FORMULA PhaseVariation-PT-D02CS010-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Skipping mayMatrices nes/nds SMT solver raised an exception on push().
java.lang.RuntimeException: SMT solver raised an exception on push().
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeCoEnablingMatrix(NecessaryEnablingsolver.java:466)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:530)
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-21 02:59:39] [INFO ] Built C files in 4798ms 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 1590029979527

--------------------
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="PhaseVariation-PT-D02CS010"
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 PhaseVariation-PT-D02CS010, 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 r111-csrt-158961258100753"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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