fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r006-smll-158897515700165
Last Updated
Jun 28, 2020

About the Execution of ITS-Tools for ASLink-PT-10b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15742.450 3600000.00 3757835.00 17980.60 ?F??FF?T?F?F?TT? normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.6M
-rw-r--r-- 1 mcc users 3.3K Mar 25 09:46 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 25 09:46 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 25 09:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 25 09:38 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 3.1K Apr 8 14:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 8 14:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Mar 25 09:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 25 09:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 25 08:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 9.9K Mar 25 08:58 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 25 09:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 25 09:04 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 1.4M 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 ASLink-PT-10b-00
FORMULA_NAME ASLink-PT-10b-01
FORMULA_NAME ASLink-PT-10b-02
FORMULA_NAME ASLink-PT-10b-03
FORMULA_NAME ASLink-PT-10b-04
FORMULA_NAME ASLink-PT-10b-05
FORMULA_NAME ASLink-PT-10b-06
FORMULA_NAME ASLink-PT-10b-07
FORMULA_NAME ASLink-PT-10b-08
FORMULA_NAME ASLink-PT-10b-09
FORMULA_NAME ASLink-PT-10b-10
FORMULA_NAME ASLink-PT-10b-11
FORMULA_NAME ASLink-PT-10b-12
FORMULA_NAME ASLink-PT-10b-13
FORMULA_NAME ASLink-PT-10b-14
FORMULA_NAME ASLink-PT-10b-15

=== Now, execution of the tool begins

BK_START 1589419609038

[2020-05-14 01:26:51] [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-14 01:26:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-14 01:26:51] [INFO ] Load time of PNML (sax parser for PT used): 513 ms
[2020-05-14 01:26:51] [INFO ] Transformed 4410 places.
[2020-05-14 01:26:51] [INFO ] Transformed 5405 transitions.
[2020-05-14 01:26:51] [INFO ] Found NUPN structural information;
[2020-05-14 01:26:51] [INFO ] Parsed PT model containing 4410 places and 5405 transitions in 667 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 190 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 122 resets, run finished after 1178 ms. (steps per millisecond=84 ) properties seen :[1, 0, 0, 1, 1, 0, 1, 0, 1, 1, 1, 1, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 1, 0, 0]
// Phase 1: matrix 5405 rows 4410 cols
[2020-05-14 01:26:53] [INFO ] Computed 433 place invariants in 475 ms
[2020-05-14 01:26:55] [INFO ] [Real]Absence check using 102 positive place invariants in 574 ms returned sat
[2020-05-14 01:26:57] [INFO ] [Real]Absence check using 102 positive and 331 generalized place invariants in 1900 ms returned sat
[2020-05-14 01:26:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-14 01:27:13] [INFO ] [Real]Absence check using state equation in 16313 ms returned (error "Solver has unexpectedly terminated")
[2020-05-14 01:27:15] [INFO ] [Real]Absence check using 102 positive place invariants in 502 ms returned sat
[2020-05-14 01:27:16] [INFO ] [Real]Absence check using 102 positive and 331 generalized place invariants in 1376 ms returned sat
[2020-05-14 01:27:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-14 01:27:34] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-14 01:27:34] [INFO ] [Real]Absence check using state equation in 17048 ms returned (error "Failed to check-sat")
[2020-05-14 01:27:35] [INFO ] [Real]Absence check using 102 positive place invariants in 649 ms returned sat
[2020-05-14 01:27:37] [INFO ] [Real]Absence check using 102 positive and 331 generalized place invariants in 1427 ms returned sat
[2020-05-14 01:27:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-14 01:27:54] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-14 01:27:54] [INFO ] [Real]Absence check using state equation in 16816 ms returned unknown
[2020-05-14 01:27:55] [INFO ] [Real]Absence check using 102 positive place invariants in 724 ms returned sat
[2020-05-14 01:27:57] [INFO ] [Real]Absence check using 102 positive and 331 generalized place invariants in 1577 ms returned sat
[2020-05-14 01:27:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-14 01:28:14] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-14 01:28:14] [INFO ] [Real]Absence check using state equation in 16523 ms returned (error "Failed to check-sat")
[2020-05-14 01:28:15] [INFO ] [Real]Absence check using 102 positive place invariants in 731 ms returned sat
[2020-05-14 01:28:17] [INFO ] [Real]Absence check using 102 positive and 331 generalized place invariants in 1631 ms returned sat
[2020-05-14 01:28:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-14 01:28:34] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-14 01:28:34] [INFO ] [Real]Absence check using state equation in 16546 ms returned (error "Failed to check-sat")
[2020-05-14 01:28:35] [INFO ] [Real]Absence check using 102 positive place invariants in 577 ms returned sat
[2020-05-14 01:28:37] [INFO ] [Real]Absence check using 102 positive and 331 generalized place invariants in 1336 ms returned sat
[2020-05-14 01:28:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-14 01:28:54] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-14 01:28:54] [INFO ] [Real]Absence check using state equation in 16836 ms returned (error "Failed to check-sat")
[2020-05-14 01:28:55] [INFO ] [Real]Absence check using 102 positive place invariants in 662 ms returned sat
[2020-05-14 01:28:57] [INFO ] [Real]Absence check using 102 positive and 331 generalized place invariants in 1497 ms returned sat
[2020-05-14 01:28:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-14 01:29:14] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-14 01:29:14] [INFO ] [Real]Absence check using state equation in 17022 ms returned unknown
[2020-05-14 01:29:15] [INFO ] [Real]Absence check using 102 positive place invariants in 485 ms returned sat
[2020-05-14 01:29:16] [INFO ] [Real]Absence check using 102 positive and 331 generalized place invariants in 1459 ms returned sat
[2020-05-14 01:29:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-14 01:29:34] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-14 01:29:34] [INFO ] [Real]Absence check using state equation in 17245 ms returned unknown
[2020-05-14 01:29:35] [INFO ] [Real]Absence check using 102 positive place invariants in 746 ms returned sat
[2020-05-14 01:29:37] [INFO ] [Real]Absence check using 102 positive and 331 generalized place invariants in 1298 ms returned sat
[2020-05-14 01:29:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-14 01:29:54] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-14 01:29:54] [INFO ] [Real]Absence check using state equation in 16910 ms returned (error "Failed to check-sat")
[2020-05-14 01:29:55] [INFO ] [Real]Absence check using 102 positive place invariants in 709 ms returned sat
[2020-05-14 01:29:57] [INFO ] [Real]Absence check using 102 positive and 331 generalized place invariants in 1603 ms returned sat
[2020-05-14 01:29:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-14 01:30:14] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-14 01:30:14] [INFO ] [Real]Absence check using state equation in 16701 ms returned unknown
[2020-05-14 01:30:15] [INFO ] [Real]Absence check using 102 positive place invariants in 588 ms returned sat
[2020-05-14 01:30:17] [INFO ] [Real]Absence check using 102 positive and 331 generalized place invariants in 1642 ms returned sat
[2020-05-14 01:30:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-14 01:30:34] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-14 01:30:34] [INFO ] [Real]Absence check using state equation in 16878 ms returned unknown
[2020-05-14 01:30:36] [INFO ] [Real]Absence check using 102 positive place invariants in 747 ms returned sat
[2020-05-14 01:30:37] [INFO ] [Real]Absence check using 102 positive and 331 generalized place invariants in 1245 ms returned sat
[2020-05-14 01:30:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-14 01:30:54] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-14 01:30:54] [INFO ] [Real]Absence check using state equation in 16865 ms returned (error "Failed to check-sat")
[2020-05-14 01:30:55] [INFO ] [Real]Absence check using 102 positive place invariants in 744 ms returned sat
[2020-05-14 01:30:57] [INFO ] [Real]Absence check using 102 positive and 331 generalized place invariants in 1858 ms returned sat
[2020-05-14 01:30:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-14 01:31:14] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-14 01:31:14] [INFO ] [Real]Absence check using state equation in 16375 ms returned unknown
[2020-05-14 01:31:14] [INFO ] Initial state reduction rules for CTL removed 7 formulas.
[2020-05-14 01:31:14] [INFO ] Flatten gal took : 528 ms
FORMULA ASLink-PT-10b-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-10b-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-10b-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-10b-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-10b-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-10b-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-10b-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-14 01:31:15] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-05-14 01:31:15] [INFO ] Flatten gal took : 277 ms
[2020-05-14 01:31:15] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA ASLink-PT-10b-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-14 01:31:15] [INFO ] Applying decomposition
[2020-05-14 01:31:16] [INFO ] Input system was already deterministic with 5405 transitions.
[2020-05-14 01:31:16] [INFO ] Too many transitions (5405) to apply POR reductions. Disabling POR matrices.
[2020-05-14 01:31:16] [INFO ] Flatten gal took : 409 ms
[2020-05-14 01:31:16] [INFO ] Built C files in 1277ms 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]
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/graph7725550814216575946.txt, -o, /tmp/graph7725550814216575946.bin, -w, /tmp/graph7725550814216575946.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/graph7725550814216575946.bin, -l, -1, -v, -w, /tmp/graph7725550814216575946.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-14 01:31:17] [INFO ] Decomposing Gal with order
[2020-05-14 01:31:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-14 01:31:19] [INFO ] Removed a total of 3821 redundant transitions.
[2020-05-14 01:31:19] [INFO ] Flatten gal took : 552 ms
[2020-05-14 01:31:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 22 labels/synchronizations in 86 ms.
[2020-05-14 01:31:19] [INFO ] Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 74 ms
[2020-05-14 01:31:19] [INFO ] Time to serialize properties into /home/mcc/execution/LTLCardinality.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /home/mcc/execution/LTLCardinality.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLCardinality.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLCardinality.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLCardinality.ltl -c -stutter-deadlock
Read 8 LTL properties
Checking formula 0 : !(((G("((i36.u1536.p3948==0)||(i8.u352.p918==1))"))||(G(X(G("((i19.u863.p2233!=0)&&(i13.u632.p1628!=1))"))))))
Formula 0 simplified : !(G"((i36.u1536.p3948==0)||(i8.u352.p918==1))" | GXG"((i19.u863.p2233!=0)&&(i13.u632.p1628!=1))")
built 92 ordering constraints for composite.
built 122 ordering constraints for composite.
built 69 ordering constraints for composite.
built 75 ordering constraints for composite.
built 40 ordering constraints for composite.
built 33 ordering constraints for composite.
built 31 ordering constraints for composite.
built 6 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 8 ordering constraints for composite.
built 9 ordering constraints for composite.
built 11 ordering constraints for composite.
built 15 ordering constraints for composite.
built 7 ordering constraints for composite.
built 18 ordering constraints for composite.
built 21 ordering constraints for composite.
built 33 ordering constraints for composite.
built 39 ordering constraints for composite.
built 3 ordering constraints for composite.
built 6 ordering constraints for composite.
built 3 ordering constraints for composite.
built 3 ordering constraints for composite.
built 3 ordering constraints for composite.
built 6 ordering constraints for composite.
built 3 ordering constraints for composite.
built 3 ordering constraints for composite.
built 6 ordering constraints for composite.
built 3 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 3 ordering constraints for composite.
built 3 ordering constraints for composite.
built 79 ordering constraints for composite.
built 129 ordering constraints for composite.
built 118 ordering constraints for composite.
built 73 ordering constraints for composite.
built 40 ordering constraints for composite.
built 67 ordering constraints for composite.
built 122 ordering constraints for composite.
built 75 ordering constraints for composite.
built 43 ordering constraints for composite.
built 33 ordering constraints for composite.
built 23 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 9 ordering constraints for composite.
built 11 ordering constraints for composite.
built 24 ordering constraints for composite.
built 7 ordering constraints for composite.
built 8 ordering constraints for composite.
built 7 ordering constraints for composite.
built 18 ordering constraints for composite.
built 25 ordering constraints for composite.
built 34 ordering constraints for composite.
built 3 ordering constraints for composite.
built 39 ordering constraints for composite.
built 6 ordering constraints for composite.
built 3 ordering constraints for composite.
built 3 ordering constraints for composite.
built 6 ordering constraints for composite.
built 3 ordering constraints for composite.
built 3 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 3 ordering constraints for composite.
built 3 ordering constraints for composite.
built 5 ordering constraints for composite.
built 3 ordering constraints for composite.
built 3 ordering constraints for composite.
built 5 ordering constraints for composite.
built 79 ordering constraints for composite.
built 133 ordering constraints for composite.
built 40 ordering constraints for composite.
built 135 ordering constraints for composite.
built 8 ordering constraints for composite.
built 133 ordering constraints for composite.
built 40 ordering constraints for composite.
built 144 ordering constraints for composite.
built 122 ordering constraints for composite.
built 107 ordering constraints for composite.
built 122 ordering constraints for composite.
built 78 ordering constraints for composite.
built 53 ordering constraints for composite.
built 75 ordering constraints for composite.
built 69 ordering constraints for composite.
built 129 ordering constraints for composite.
built 40 ordering constraints for composite.
built 136 ordering constraints for composite.
built 8 ordering constraints for composite.
built 126 ordering constraints for composite.
built 60 ordering constraints for composite.
built 117 ordering constraints for composite.
built 68 ordering constraints for composite.
built 245 ordering constraints for composite.
built 90 ordering constraints for composite.
built 56 ordering constraints for composite.
Compilation finished in 110147 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Link finished in 106 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, ( []((LTLAP0==true))) || ( [](X([]((LTLAP1==true))))) , --buchi-type=spotba], workingDir=/home/mcc/execution]
/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc: error while loading shared libraries: libltdl.so.7: cannot open shared object file: No such file or directory
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, ( []((LTLAP0==true))) || ( [](X([]((LTLAP1==true))))) , --buchi-type=spotba], workingDir=/home/mcc/execution]
127
java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, ( []((LTLAP0==true))) || ( [](X([]((LTLAP1==true))))) , --buchi-type=spotba], workingDir=/home/mcc/execution]
127
at fr.lip6.move.gal.application.LTSminRunner.checkProperty(LTSminRunner.java:170)
at fr.lip6.move.gal.application.LTSminRunner.access$10(LTSminRunner.java:124)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:834)
Detected timeout of ITS tools.
[2020-05-14 01:52:48] [INFO ] Applying decomposition
[2020-05-14 01:52:48] [INFO ] Flatten gal took : 199 ms
[2020-05-14 01:52:48] [INFO ] Decomposing Gal with order
[2020-05-14 01:52:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-14 01:52:50] [INFO ] Removed a total of 3509 redundant transitions.
[2020-05-14 01:52:50] [INFO ] Flatten gal took : 390 ms
[2020-05-14 01:52:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 5642 labels/synchronizations in 182 ms.
[2020-05-14 01:52:50] [INFO ] Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 32 ms
[2020-05-14 01:52:50] [INFO ] Time to serialize properties into /home/mcc/execution/LTLCardinality.ltl : 2 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /home/mcc/execution/LTLCardinality.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLCardinality.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLCardinality.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLCardinality.ltl -c -stutter-deadlock
Read 8 LTL properties
Checking formula 0 : !(((G("((i0.i1.i0.i0.i0.i0.i0.i1.u475.p3948==0)||(i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.i0.i0.i0.i0.u118.p918==1))"))||(G(X(G("((i0.i0.i0.i0.i0.i1.i0.i0.i0.i0.i0.i1.i1.u686.p2233!=0)&&(i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.u200.p1628!=1))"))))))
Formula 0 simplified : !(G"((i0.i1.i0.i0.i0.i0.i0.i1.u475.p3948==0)||(i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.i0.i0.i0.i0.u118.p918==1))" | GXG"((i0.i0.i0.i0.i0.i1.i0.i0.i0.i0.i0.i1.i1.u686.p2233!=0)&&(i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.u200.p1628!=1))")
built 2 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 10 ordering constraints for composite.
built 11 ordering constraints for composite.
built 17 ordering constraints for composite.
built 23 ordering constraints for composite.
built 27 ordering constraints for composite.
built 30 ordering constraints for composite.
built 25 ordering constraints for composite.
built 15 ordering constraints for composite.
built 11 ordering constraints for composite.
built 49 ordering constraints for composite.
built 7 ordering constraints for composite.
built 4 ordering constraints for composite.
built 5 ordering constraints for composite.
built 4 ordering constraints for composite.
built 5 ordering constraints for composite.
built 4 ordering constraints for composite.
built 5 ordering constraints for composite.
built 4 ordering constraints for composite.
built 8 ordering constraints for composite.
built 11 ordering constraints for composite.
built 17 ordering constraints for composite.
built 23 ordering constraints for composite.
built 27 ordering constraints for composite.
built 30 ordering constraints for composite.
built 25 ordering constraints for composite.
built 15 ordering constraints for composite.
built 11 ordering constraints for composite.
built 49 ordering constraints for composite.
built 7 ordering constraints for composite.
built 4 ordering constraints for composite.
built 5 ordering constraints for composite.
built 4 ordering constraints for composite.
built 5 ordering constraints for composite.
built 4 ordering constraints for composite.
built 5 ordering constraints for composite.
built 4 ordering constraints for composite.
built 8 ordering constraints for composite.
built 11 ordering constraints for composite.
built 17 ordering constraints for composite.
built 23 ordering constraints for composite.
built 27 ordering constraints for composite.
built 30 ordering constraints for composite.
built 25 ordering constraints for composite.
built 15 ordering constraints for composite.
built 11 ordering constraints for composite.
built 49 ordering constraints for composite.
built 7 ordering constraints for composite.
built 4 ordering constraints for composite.
built 5 ordering constraints for composite.
built 4 ordering constraints for composite.
built 5 ordering constraints for composite.
built 4 ordering constraints for composite.
built 5 ordering constraints for composite.
built 4 ordering constraints for composite.
built 8 ordering constraints for composite.
built 11 ordering constraints for composite.
built 17 ordering constraints for composite.
built 23 ordering constraints for composite.
built 27 ordering constraints for composite.
built 30 ordering constraints for composite.
built 25 ordering constraints for composite.
built 15 ordering constraints for composite.
built 11 ordering constraints for composite.
built 49 ordering constraints for composite.
built 7 ordering constraints for composite.
built 4 ordering constraints for composite.
built 5 ordering constraints for composite.
built 4 ordering constraints for composite.
built 5 ordering constraints for composite.
built 4 ordering constraints for composite.
built 5 ordering constraints for composite.
built 4 ordering constraints for composite.
built 8 ordering constraints for composite.
built 11 ordering constraints for composite.
built 17 ordering constraints for composite.
built 23 ordering constraints for composite.
built 27 ordering constraints for composite.
built 30 ordering constraints for composite.
built 25 ordering constraints for composite.
built 15 ordering constraints for composite.
built 11 ordering constraints for composite.
built 49 ordering constraints for composite.
built 7 ordering constraints for composite.
built 4 ordering constraints for composite.
built 5 ordering constraints for composite.
built 4 ordering constraints for composite.
built 5 ordering constraints for composite.
built 4 ordering constraints for composite.
built 5 ordering constraints for composite.
built 4 ordering constraints for composite.
built 8 ordering constraints for composite.
built 11 ordering constraints for composite.
built 17 ordering constraints for composite.
built 23 ordering constraints for composite.
built 27 ordering constraints for composite.
built 30 ordering constraints for composite.
built 25 ordering constraints for composite.
built 15 ordering constraints for composite.
built 11 ordering constraints for composite.
built 49 ordering constraints for composite.
built 7 ordering constraints for composite.
built 4 ordering constraints for composite.
built 5 ordering constraints for composite.
built 4 ordering constraints for composite.
built 5 ordering constraints for composite.
built 4 ordering constraints for composite.
built 5 ordering constraints for composite.
built 4 ordering constraints for composite.
built 8 ordering constraints for composite.
built 11 ordering constraints for composite.
built 17 ordering constraints for composite.
built 23 ordering constraints for composite.
built 27 ordering constraints for composite.
built 30 ordering constraints for composite.
built 25 ordering constraints for composite.
built 15 ordering constraints for composite.
built 11 ordering constraints for composite.
built 49 ordering constraints for composite.
built 7 ordering constraints for composite.
built 4 ordering constraints for composite.
built 5 ordering constraints for composite.
built 4 ordering constraints for composite.
built 5 ordering constraints for composite.
built 4 ordering constraints for composite.
built 5 ordering constraints for composite.
built 4 ordering constraints for composite.
built 8 ordering constraints for composite.
built 11 ordering constraints for composite.
built 17 ordering constraints for composite.
built 23 ordering constraints for composite.
built 27 ordering constraints for composite.
built 30 ordering constraints for composite.
built 25 ordering constraints for composite.
built 15 ordering constraints for composite.
built 11 ordering constraints for composite.
built 49 ordering constraints for composite.
built 7 ordering constraints for composite.
built 4 ordering constraints for composite.
built 5 ordering constraints for composite.
built 4 ordering constraints for composite.
built 5 ordering constraints for composite.
built 4 ordering constraints for composite.
built 5 ordering constraints for composite.
built 4 ordering constraints for composite.
built 8 ordering constraints for composite.
built 11 ordering constraints for composite.
built 17 ordering constraints for composite.
built 23 ordering constraints for composite.
built 27 ordering constraints for composite.
built 30 ordering constraints for composite.
built 25 ordering constraints for composite.
built 15 ordering constraints for composite.
built 11 ordering constraints for composite.
built 49 ordering constraints for composite.
built 7 ordering constraints for composite.
built 4 ordering constraints for composite.
built 5 ordering constraints for composite.
built 4 ordering constraints for composite.
built 5 ordering constraints for composite.
built 4 ordering constraints for composite.
built 5 ordering constraints for composite.
built 4 ordering constraints for composite.
built 8 ordering constraints for composite.
built 11 ordering constraints for composite.
built 17 ordering constraints for composite.
built 23 ordering constraints for composite.
built 27 ordering constraints for composite.
built 30 ordering constraints for composite.
built 25 ordering constraints for composite.
built 15 ordering constraints for composite.
built 11 ordering constraints for composite.
built 49 ordering constraints for composite.
built 7 ordering constraints for composite.
built 4 ordering constraints for composite.
built 5 ordering constraints for composite.
built 4 ordering constraints for composite.
built 5 ordering constraints for composite.
built 4 ordering constraints for composite.
built 5 ordering constraints for composite.
built 4 ordering constraints for composite.
built 8 ordering constraints for composite.
built 7 ordering constraints for composite.
built 23 ordering constraints for composite.
built 19 ordering constraints for composite.
built 15 ordering constraints for composite.
built 89 ordering constraints for composite.
built 8 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
Detected timeout of ITS tools.
[2020-05-14 02:14:19] [INFO ] Flatten gal took : 244 ms
[2020-05-14 02:14:19] [INFO ] Input system was already deterministic with 5405 transitions.
[2020-05-14 02:14:19] [INFO ] Transformed 4410 places.
[2020-05-14 02:14:19] [INFO ] Transformed 5405 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2020-05-14 02:14:50] [INFO ] Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 23 ms
[2020-05-14 02:14:50] [INFO ] Time to serialize properties into /home/mcc/execution/LTLCardinality.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /home/mcc/execution/LTLCardinality.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLCardinality.ltl, -c, -stutter-deadlock, --load-order, /home/mcc/execution/model.ord, --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 --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Read 8 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !(((G("((p3948==0)||(p918==1))"))||(G(X(G("((p2233!=0)&&(p1628!=1))"))))))
Formula 0 simplified : !(G"((p3948==0)||(p918==1))" | GXG"((p2233!=0)&&(p1628!=1))")

BK_TIME_CONFINEMENT_REACHED

--------------------
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="ASLink-PT-10b"
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 ASLink-PT-10b, 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 r006-smll-158897515700165"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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