Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r004-smll-171620118300320.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is Anderson-PT-04, examination is StateSpace
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r004-smll-171620118300320
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 548K
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 22 14:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 22 14:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Apr 22 14:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 12 15:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 151K Apr 12 15:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 15:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 70K Apr 12 15:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:27 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 103K May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

no data necessary for post analysis


=== Now, execution of the tool begins

BK_START 1716422959215

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=StateSpace
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Anderson-PT-04
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
StateSpace PT
Running Version 202405141337
[2024-05-23 00:09:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StateSpace, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-23 00:09:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 00:09:22] [INFO ] Load time of PNML (sax parser for PT used): 172 ms
[2024-05-23 00:09:22] [INFO ] Transformed 105 places.
[2024-05-23 00:09:22] [INFO ] Transformed 200 transitions.
[2024-05-23 00:09:22] [INFO ] Found NUPN structural information;
[2024-05-23 00:09:22] [INFO ] Parsed PT model containing 105 places and 200 transitions and 752 arcs in 395 ms.
Starting structural reductions in STATESPACE mode, iteration 0 : 105/105 places, 200/200 transitions.
[2024-05-23 00:09:22] [INFO ] Redundant transitions in 18 ms returned []
Running 196 sub problems to find dead transitions.
// Phase 1: matrix 200 rows 105 cols
[2024-05-23 00:09:22] [INFO ] Computed 11 invariants in 26 ms
[2024-05-23 00:09:22] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 105/105 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 5/110 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 6/116 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-23 00:09:25] [INFO ] Deduced a trap composed of 46 places in 216 ms of which 32 ms to minimize.
[2024-05-23 00:09:25] [INFO ] Deduced a trap composed of 67 places in 155 ms of which 3 ms to minimize.
[2024-05-23 00:09:26] [INFO ] Deduced a trap composed of 57 places in 135 ms of which 3 ms to minimize.
[2024-05-23 00:09:26] [INFO ] Deduced a trap composed of 46 places in 137 ms of which 2 ms to minimize.
[2024-05-23 00:09:26] [INFO ] Deduced a trap composed of 31 places in 126 ms of which 2 ms to minimize.
[2024-05-23 00:09:26] [INFO ] Deduced a trap composed of 50 places in 134 ms of which 3 ms to minimize.
[2024-05-23 00:09:26] [INFO ] Deduced a trap composed of 41 places in 119 ms of which 2 ms to minimize.
[2024-05-23 00:09:26] [INFO ] Deduced a trap composed of 62 places in 116 ms of which 4 ms to minimize.
[2024-05-23 00:09:26] [INFO ] Deduced a trap composed of 59 places in 119 ms of which 2 ms to minimize.
[2024-05-23 00:09:27] [INFO ] Deduced a trap composed of 49 places in 114 ms of which 3 ms to minimize.
[2024-05-23 00:09:27] [INFO ] Deduced a trap composed of 55 places in 112 ms of which 3 ms to minimize.
[2024-05-23 00:09:27] [INFO ] Deduced a trap composed of 43 places in 122 ms of which 2 ms to minimize.
[2024-05-23 00:09:27] [INFO ] Deduced a trap composed of 49 places in 115 ms of which 2 ms to minimize.
[2024-05-23 00:09:27] [INFO ] Deduced a trap composed of 55 places in 106 ms of which 2 ms to minimize.
[2024-05-23 00:09:27] [INFO ] Deduced a trap composed of 59 places in 98 ms of which 2 ms to minimize.
[2024-05-23 00:09:27] [INFO ] Deduced a trap composed of 57 places in 98 ms of which 2 ms to minimize.
[2024-05-23 00:09:27] [INFO ] Deduced a trap composed of 60 places in 82 ms of which 3 ms to minimize.
[2024-05-23 00:09:28] [INFO ] Deduced a trap composed of 52 places in 90 ms of which 3 ms to minimize.
[2024-05-23 00:09:28] [INFO ] Deduced a trap composed of 50 places in 74 ms of which 2 ms to minimize.
[2024-05-23 00:09:28] [INFO ] Deduced a trap composed of 63 places in 85 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 20/136 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-23 00:09:29] [INFO ] Deduced a trap composed of 31 places in 134 ms of which 3 ms to minimize.
[2024-05-23 00:09:29] [INFO ] Deduced a trap composed of 54 places in 127 ms of which 3 ms to minimize.
[2024-05-23 00:09:30] [INFO ] Deduced a trap composed of 51 places in 126 ms of which 2 ms to minimize.
[2024-05-23 00:09:30] [INFO ] Deduced a trap composed of 44 places in 92 ms of which 2 ms to minimize.
[2024-05-23 00:09:30] [INFO ] Deduced a trap composed of 50 places in 115 ms of which 2 ms to minimize.
[2024-05-23 00:09:30] [INFO ] Deduced a trap composed of 50 places in 111 ms of which 2 ms to minimize.
[2024-05-23 00:09:30] [INFO ] Deduced a trap composed of 57 places in 91 ms of which 2 ms to minimize.
[2024-05-23 00:09:30] [INFO ] Deduced a trap composed of 52 places in 118 ms of which 2 ms to minimize.
[2024-05-23 00:09:30] [INFO ] Deduced a trap composed of 66 places in 90 ms of which 2 ms to minimize.
[2024-05-23 00:09:31] [INFO ] Deduced a trap composed of 52 places in 131 ms of which 2 ms to minimize.
[2024-05-23 00:09:31] [INFO ] Deduced a trap composed of 49 places in 65 ms of which 1 ms to minimize.
[2024-05-23 00:09:31] [INFO ] Deduced a trap composed of 57 places in 111 ms of which 2 ms to minimize.
[2024-05-23 00:09:31] [INFO ] Deduced a trap composed of 40 places in 90 ms of which 2 ms to minimize.
[2024-05-23 00:09:31] [INFO ] Deduced a trap composed of 56 places in 103 ms of which 3 ms to minimize.
[2024-05-23 00:09:31] [INFO ] Deduced a trap composed of 43 places in 128 ms of which 3 ms to minimize.
[2024-05-23 00:09:31] [INFO ] Deduced a trap composed of 74 places in 144 ms of which 3 ms to minimize.
[2024-05-23 00:09:32] [INFO ] Deduced a trap composed of 56 places in 138 ms of which 2 ms to minimize.
[2024-05-23 00:09:32] [INFO ] Deduced a trap composed of 32 places in 117 ms of which 2 ms to minimize.
[2024-05-23 00:09:32] [INFO ] Deduced a trap composed of 27 places in 107 ms of which 2 ms to minimize.
[2024-05-23 00:09:32] [INFO ] Deduced a trap composed of 60 places in 102 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 20/156 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-23 00:09:33] [INFO ] Deduced a trap composed of 75 places in 88 ms of which 2 ms to minimize.
[2024-05-23 00:09:33] [INFO ] Deduced a trap composed of 64 places in 101 ms of which 2 ms to minimize.
[2024-05-23 00:09:33] [INFO ] Deduced a trap composed of 72 places in 92 ms of which 2 ms to minimize.
[2024-05-23 00:09:33] [INFO ] Deduced a trap composed of 71 places in 90 ms of which 2 ms to minimize.
[2024-05-23 00:09:33] [INFO ] Deduced a trap composed of 57 places in 121 ms of which 3 ms to minimize.
[2024-05-23 00:09:33] [INFO ] Deduced a trap composed of 31 places in 91 ms of which 2 ms to minimize.
[2024-05-23 00:09:34] [INFO ] Deduced a trap composed of 65 places in 76 ms of which 2 ms to minimize.
[2024-05-23 00:09:34] [INFO ] Deduced a trap composed of 42 places in 85 ms of which 1 ms to minimize.
[2024-05-23 00:09:34] [INFO ] Deduced a trap composed of 52 places in 97 ms of which 2 ms to minimize.
[2024-05-23 00:09:34] [INFO ] Deduced a trap composed of 50 places in 90 ms of which 2 ms to minimize.
[2024-05-23 00:09:34] [INFO ] Deduced a trap composed of 52 places in 106 ms of which 4 ms to minimize.
[2024-05-23 00:09:34] [INFO ] Deduced a trap composed of 47 places in 86 ms of which 2 ms to minimize.
[2024-05-23 00:09:35] [INFO ] Deduced a trap composed of 57 places in 84 ms of which 2 ms to minimize.
[2024-05-23 00:09:35] [INFO ] Deduced a trap composed of 44 places in 84 ms of which 1 ms to minimize.
[2024-05-23 00:09:35] [INFO ] Deduced a trap composed of 60 places in 105 ms of which 2 ms to minimize.
[2024-05-23 00:09:35] [INFO ] Deduced a trap composed of 67 places in 95 ms of which 2 ms to minimize.
[2024-05-23 00:09:35] [INFO ] Deduced a trap composed of 62 places in 190 ms of which 13 ms to minimize.
[2024-05-23 00:09:36] [INFO ] Deduced a trap composed of 25 places in 105 ms of which 2 ms to minimize.
[2024-05-23 00:09:36] [INFO ] Deduced a trap composed of 39 places in 98 ms of which 3 ms to minimize.
[2024-05-23 00:09:36] [INFO ] Deduced a trap composed of 58 places in 113 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/105 variables, 20/176 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-23 00:09:38] [INFO ] Deduced a trap composed of 56 places in 98 ms of which 2 ms to minimize.
[2024-05-23 00:09:38] [INFO ] Deduced a trap composed of 27 places in 128 ms of which 3 ms to minimize.
[2024-05-23 00:09:38] [INFO ] Deduced a trap composed of 53 places in 93 ms of which 2 ms to minimize.
[2024-05-23 00:09:38] [INFO ] Deduced a trap composed of 42 places in 113 ms of which 5 ms to minimize.
[2024-05-23 00:09:38] [INFO ] Deduced a trap composed of 41 places in 112 ms of which 3 ms to minimize.
[2024-05-23 00:09:39] [INFO ] Deduced a trap composed of 41 places in 125 ms of which 2 ms to minimize.
[2024-05-23 00:09:39] [INFO ] Deduced a trap composed of 44 places in 95 ms of which 2 ms to minimize.
[2024-05-23 00:09:40] [INFO ] Deduced a trap composed of 41 places in 105 ms of which 2 ms to minimize.
[2024-05-23 00:09:40] [INFO ] Deduced a trap composed of 28 places in 117 ms of which 3 ms to minimize.
[2024-05-23 00:09:40] [INFO ] Deduced a trap composed of 36 places in 108 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/105 variables, 10/186 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-23 00:09:43] [INFO ] Deduced a trap composed of 67 places in 107 ms of which 2 ms to minimize.
[2024-05-23 00:09:43] [INFO ] Deduced a trap composed of 52 places in 101 ms of which 2 ms to minimize.
[2024-05-23 00:09:43] [INFO ] Deduced a trap composed of 30 places in 91 ms of which 2 ms to minimize.
[2024-05-23 00:09:43] [INFO ] Deduced a trap composed of 50 places in 95 ms of which 2 ms to minimize.
[2024-05-23 00:09:44] [INFO ] Deduced a trap composed of 62 places in 103 ms of which 2 ms to minimize.
[2024-05-23 00:09:44] [INFO ] Deduced a trap composed of 40 places in 98 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/105 variables, 6/192 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-23 00:09:46] [INFO ] Deduced a trap composed of 52 places in 91 ms of which 2 ms to minimize.
[2024-05-23 00:09:46] [INFO ] Deduced a trap composed of 55 places in 100 ms of which 2 ms to minimize.
[2024-05-23 00:09:46] [INFO ] Deduced a trap composed of 44 places in 96 ms of which 2 ms to minimize.
[2024-05-23 00:09:47] [INFO ] Deduced a trap composed of 70 places in 118 ms of which 2 ms to minimize.
[2024-05-23 00:09:47] [INFO ] Deduced a trap composed of 57 places in 126 ms of which 2 ms to minimize.
[2024-05-23 00:09:47] [INFO ] Deduced a trap composed of 58 places in 125 ms of which 2 ms to minimize.
[2024-05-23 00:09:47] [INFO ] Deduced a trap composed of 52 places in 94 ms of which 2 ms to minimize.
[2024-05-23 00:09:47] [INFO ] Deduced a trap composed of 49 places in 122 ms of which 3 ms to minimize.
[2024-05-23 00:09:48] [INFO ] Deduced a trap composed of 38 places in 105 ms of which 2 ms to minimize.
[2024-05-23 00:09:48] [INFO ] Deduced a trap composed of 47 places in 108 ms of which 6 ms to minimize.
[2024-05-23 00:09:48] [INFO ] Deduced a trap composed of 73 places in 109 ms of which 2 ms to minimize.
[2024-05-23 00:09:48] [INFO ] Deduced a trap composed of 63 places in 106 ms of which 2 ms to minimize.
[2024-05-23 00:09:48] [INFO ] Deduced a trap composed of 46 places in 100 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/105 variables, 13/205 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-23 00:09:50] [INFO ] Deduced a trap composed of 66 places in 106 ms of which 2 ms to minimize.
[2024-05-23 00:09:51] [INFO ] Deduced a trap composed of 43 places in 103 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/105 variables, 2/207 constraints. Problems are: Problem set: 0 solved, 196 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 105/305 variables, and 207 constraints, problems are : Problem set: 0 solved, 196 unsolved in 30037 ms.
Refiners :[Domain max(s): 105/105 constraints, Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/105 constraints, ReadFeed: 0/12 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 91/91 constraints]
Escalating to Integer solving :Problem set: 0 solved, 196 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 105/105 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 5/110 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 6/116 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 91/207 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-23 00:09:55] [INFO ] Deduced a trap composed of 64 places in 83 ms of which 2 ms to minimize.
[2024-05-23 00:09:55] [INFO ] Deduced a trap composed of 48 places in 73 ms of which 1 ms to minimize.
[2024-05-23 00:09:56] [INFO ] Deduced a trap composed of 51 places in 122 ms of which 2 ms to minimize.
[2024-05-23 00:09:56] [INFO ] Deduced a trap composed of 48 places in 106 ms of which 3 ms to minimize.
[2024-05-23 00:09:56] [INFO ] Deduced a trap composed of 51 places in 84 ms of which 2 ms to minimize.
[2024-05-23 00:09:56] [INFO ] Deduced a trap composed of 47 places in 138 ms of which 3 ms to minimize.
[2024-05-23 00:09:57] [INFO ] Deduced a trap composed of 41 places in 121 ms of which 2 ms to minimize.
[2024-05-23 00:09:57] [INFO ] Deduced a trap composed of 64 places in 112 ms of which 2 ms to minimize.
[2024-05-23 00:09:59] [INFO ] Deduced a trap composed of 25 places in 107 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 9/216 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-23 00:10:03] [INFO ] Deduced a trap composed of 51 places in 78 ms of which 1 ms to minimize.
[2024-05-23 00:10:05] [INFO ] Deduced a trap composed of 35 places in 84 ms of which 2 ms to minimize.
[2024-05-23 00:10:05] [INFO ] Deduced a trap composed of 37 places in 63 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/105 variables, 3/219 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-23 00:10:09] [INFO ] Deduced a trap composed of 60 places in 78 ms of which 2 ms to minimize.
[2024-05-23 00:10:11] [INFO ] Deduced a trap composed of 32 places in 66 ms of which 2 ms to minimize.
[2024-05-23 00:10:11] [INFO ] Deduced a trap composed of 28 places in 64 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/105 variables, 3/222 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-23 00:10:16] [INFO ] Deduced a trap composed of 43 places in 78 ms of which 2 ms to minimize.
[2024-05-23 00:10:16] [INFO ] Deduced a trap composed of 52 places in 91 ms of which 2 ms to minimize.
[2024-05-23 00:10:21] [INFO ] Deduced a trap composed of 57 places in 111 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/105 variables, 3/225 constraints. Problems are: Problem set: 0 solved, 196 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 105/305 variables, and 225 constraints, problems are : Problem set: 0 solved, 196 unsolved in 30018 ms.
Refiners :[Domain max(s): 105/105 constraints, Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/105 constraints, ReadFeed: 0/12 constraints, PredecessorRefiner: 0/196 constraints, Known Traps: 109/109 constraints]
After SMT, in 60709ms problems are : Problem set: 0 solved, 196 unsolved
Search for dead transitions found 0 dead transitions in 60755ms
Finished structural reductions in STATESPACE mode , in 1 iterations and 61168 ms. Remains : 105/105 places, 200/200 transitions.
Final net has 105 places and 200 transitions.
[2024-05-23 00:10:23] [INFO ] Flatten gal took : 107 ms
[2024-05-23 00:10:23] [INFO ] Applying decomposition
[2024-05-23 00:10:23] [INFO ] Flatten gal took : 39 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph729319391578553106.txt' '-o' '/tmp/graph729319391578553106.bin' '-w' '/tmp/graph729319391578553106.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph729319391578553106.bin' '-l' '-1' '-v' '-w' '/tmp/graph729319391578553106.weights' '-q' '0' '-e' '0.001'
[2024-05-23 00:10:24] [INFO ] Decomposing Gal with order
[2024-05-23 00:10:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 00:10:24] [INFO ] Removed a total of 289 redundant transitions.
[2024-05-23 00:10:24] [INFO ] Flatten gal took : 118 ms
[2024-05-23 00:10:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 50 labels/synchronizations in 21 ms.
[2024-05-23 00:10:24] [INFO ] Time to serialize gal into /tmp/StateSpace7300849892205610863.gal : 13 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/StateSpace7300849892205610863.gal' '-t' 'CGAL' '--stats'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...219
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,29641,0.72357,20932,868,495,30052,1356,529,41681,228,1981,0
Total reachable state count : 29641

Max variable value : 1
STATE_SPACE MAX_TOKEN_IN_PLACE 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Maximum sum along a path : 6
STATE_SPACE MAX_TOKEN_PER_MARKING 6 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Exact state count : 29641
STATE_SPACE STATES 29641 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Total runtime 63414 ms.

BK_STOP 1716423025251

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ StateSpace = StateSpace ]]
+ [[ -f modelMain.xml ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution StateSpace -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination StateSpace -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="Anderson-PT-04"
export BK_EXAMINATION="StateSpace"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# 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-5568"
echo " Executing tool itstools"
echo " Input is Anderson-PT-04, examination is StateSpace"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r004-smll-171620118300320"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Anderson-PT-04.tgz
mv Anderson-PT-04 execution
cd execution
if [ "StateSpace" = "ReachabilityDeadlock" ] || [ "StateSpace" = "UpperBounds" ] || [ "StateSpace" = "QuasiLiveness" ] || [ "StateSpace" = "StableMarking" ] || [ "StateSpace" = "Liveness" ] || [ "StateSpace" = "OneSafe" ] || [ "StateSpace" = "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 [ "StateSpace" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "StateSpace" != "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 "StateSpace.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property StateSpace.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "StateSpace.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 '' StateSpace.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "StateSpace" = "ReachabilityDeadlock" ] || [ "StateSpace" = "QuasiLiveness" ] || [ "StateSpace" = "StableMarking" ] || [ "StateSpace" = "Liveness" ] || [ "StateSpace" = "OneSafe" ] ; then
echo "FORMULA_NAME StateSpace"
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 ;