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.r602-tall-171774424600168.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 BlocksWorld-PT-01, examination is StateSpace
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r602-tall-171774424600168
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.6M
-rw-r--r-- 1 mcc users 42K Jun 7 06:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 240K Jun 7 06:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 28K Jun 7 06:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 170K Jun 7 06:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 9.1K Jun 7 06:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 39K Jun 7 06:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 12K Jun 7 06:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 60K Jun 7 06:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 7 06:26 NewModel
-rw-r--r-- 1 mcc users 93K Jun 7 06:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 500K Jun 7 06:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 32K Jun 7 06:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 192K Jun 7 06:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.2K Jun 7 06:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.4K Jun 7 06:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Jun 7 06:26 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 7 06:26 instance
-rw-r--r-- 1 mcc users 6 Jun 7 06:26 iscolored
-rw-r--r-- 1 mcc users 87K Jun 7 06:26 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 1717745458169

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=StateSpace
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BlocksWorld-PT-01
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
StateSpace PT
Running Version 202405141337
[2024-06-07 07:30:59] [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-06-07 07:30:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-07 07:30:59] [INFO ] Load time of PNML (sax parser for PT used): 68 ms
[2024-06-07 07:30:59] [INFO ] Transformed 109 places.
[2024-06-07 07:30:59] [INFO ] Transformed 181 transitions.
[2024-06-07 07:30:59] [INFO ] Found NUPN structural information;
[2024-06-07 07:30:59] [INFO ] Completing missing partition info from NUPN : creating a component with [pred_on_table_0, pred_arm_empty_0, pred_on_table_1, pred_on_table_2, pred_on_table_3, pred_on_table_4, pred_on_table_5, pred_on_table_6, pred_on_table_7, pred_on_table_8]
[2024-06-07 07:30:59] [INFO ] Parsed PT model containing 109 places and 181 transitions and 896 arcs in 166 ms.
Reduce redundant transitions removed 1 transitions.
Starting structural reductions in STATESPACE mode, iteration 0 : 109/109 places, 180/180 transitions.
[2024-06-07 07:30:59] [INFO ] Redundant transitions in 7 ms returned []
Running 178 sub problems to find dead transitions.
// Phase 1: matrix 180 rows 109 cols
[2024-06-07 07:30:59] [INFO ] Computed 19 invariants in 8 ms
[2024-06-07 07:30:59] [INFO ] State equation strengthened by 14 read => feed constraints.
Problem TDEAD28 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD178 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 15/15 constraints. Problems are: Problem set: 14 solved, 164 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 0/15 constraints. Problems are: Problem set: 14 solved, 164 unsolved
Problem TDEAD1 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD124 is UNSAT
At refinement iteration 2 (OVERLAPS) 2/109 variables, 4/19 constraints. Problems are: Problem set: 18 solved, 160 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 0/19 constraints. Problems are: Problem set: 18 solved, 160 unsolved
At refinement iteration 4 (OVERLAPS) 180/289 variables, 109/128 constraints. Problems are: Problem set: 18 solved, 160 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/289 variables, 14/142 constraints. Problems are: Problem set: 18 solved, 160 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/289 variables, 0/142 constraints. Problems are: Problem set: 18 solved, 160 unsolved
At refinement iteration 7 (OVERLAPS) 0/289 variables, 0/142 constraints. Problems are: Problem set: 18 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Real declared 289/289 variables, and 142 constraints, problems are : Problem set: 18 solved, 160 unsolved in 3650 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 109/109 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 178/178 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 18 solved, 160 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 18 solved, 160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 0/1 constraints. Problems are: Problem set: 18 solved, 160 unsolved
At refinement iteration 2 (OVERLAPS) 11/109 variables, 18/19 constraints. Problems are: Problem set: 18 solved, 160 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 0/19 constraints. Problems are: Problem set: 18 solved, 160 unsolved
At refinement iteration 4 (OVERLAPS) 180/289 variables, 109/128 constraints. Problems are: Problem set: 18 solved, 160 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/289 variables, 14/142 constraints. Problems are: Problem set: 18 solved, 160 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/289 variables, 160/302 constraints. Problems are: Problem set: 18 solved, 160 unsolved
[2024-06-07 07:31:06] [INFO ] Deduced a trap composed of 10 places in 485 ms of which 29 ms to minimize.
[2024-06-07 07:31:06] [INFO ] Deduced a trap composed of 10 places in 64 ms of which 2 ms to minimize.
[2024-06-07 07:31:06] [INFO ] Deduced a trap composed of 10 places in 118 ms of which 2 ms to minimize.
[2024-06-07 07:31:06] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 1 ms to minimize.
[2024-06-07 07:31:07] [INFO ] Deduced a trap composed of 30 places in 91 ms of which 1 ms to minimize.
[2024-06-07 07:31:07] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 1 ms to minimize.
[2024-06-07 07:31:07] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 1 ms to minimize.
[2024-06-07 07:31:07] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 1 ms to minimize.
[2024-06-07 07:31:07] [INFO ] Deduced a trap composed of 30 places in 98 ms of which 1 ms to minimize.
[2024-06-07 07:31:07] [INFO ] Deduced a trap composed of 28 places in 85 ms of which 1 ms to minimize.
[2024-06-07 07:31:07] [INFO ] Deduced a trap composed of 18 places in 209 ms of which 1 ms to minimize.
[2024-06-07 07:31:07] [INFO ] Deduced a trap composed of 24 places in 98 ms of which 1 ms to minimize.
[2024-06-07 07:31:08] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 0 ms to minimize.
[2024-06-07 07:31:08] [INFO ] Deduced a trap composed of 10 places in 281 ms of which 2 ms to minimize.
[2024-06-07 07:31:08] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
[2024-06-07 07:31:08] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
[2024-06-07 07:31:08] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 0 ms to minimize.
[2024-06-07 07:31:08] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 0 ms to minimize.
[2024-06-07 07:31:08] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 0 ms to minimize.
[2024-06-07 07:31:08] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/289 variables, 20/322 constraints. Problems are: Problem set: 18 solved, 160 unsolved
[2024-06-07 07:31:09] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 2 ms to minimize.
[2024-06-07 07:31:10] [INFO ] Deduced a trap composed of 28 places in 376 ms of which 1 ms to minimize.
[2024-06-07 07:31:10] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 1 ms to minimize.
[2024-06-07 07:31:10] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 1 ms to minimize.
[2024-06-07 07:31:10] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
[2024-06-07 07:31:10] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 1 ms to minimize.
[2024-06-07 07:31:10] [INFO ] Deduced a trap composed of 28 places in 55 ms of which 0 ms to minimize.
[2024-06-07 07:31:11] [INFO ] Deduced a trap composed of 30 places in 52 ms of which 1 ms to minimize.
[2024-06-07 07:31:11] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 1 ms to minimize.
[2024-06-07 07:31:11] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
[2024-06-07 07:31:11] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 0 ms to minimize.
[2024-06-07 07:31:11] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 1 ms to minimize.
[2024-06-07 07:31:11] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 1 ms to minimize.
[2024-06-07 07:31:11] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 1 ms to minimize.
[2024-06-07 07:31:11] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 4 ms to minimize.
[2024-06-07 07:31:11] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 1 ms to minimize.
[2024-06-07 07:31:11] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 1 ms to minimize.
[2024-06-07 07:31:11] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 1 ms to minimize.
[2024-06-07 07:31:12] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 1 ms to minimize.
[2024-06-07 07:31:12] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/289 variables, 20/342 constraints. Problems are: Problem set: 18 solved, 160 unsolved
[2024-06-07 07:31:13] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 0 ms to minimize.
[2024-06-07 07:31:13] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 0 ms to minimize.
[2024-06-07 07:31:13] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 0 ms to minimize.
[2024-06-07 07:31:13] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-06-07 07:31:13] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-06-07 07:31:14] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
[2024-06-07 07:31:14] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 1 ms to minimize.
[2024-06-07 07:31:14] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
[2024-06-07 07:31:14] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 0 ms to minimize.
[2024-06-07 07:31:14] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 1 ms to minimize.
[2024-06-07 07:31:14] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 2 ms to minimize.
[2024-06-07 07:31:14] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 1 ms to minimize.
[2024-06-07 07:31:14] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 0 ms to minimize.
[2024-06-07 07:31:15] [INFO ] Deduced a trap composed of 30 places in 50 ms of which 1 ms to minimize.
[2024-06-07 07:31:15] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 0 ms to minimize.
[2024-06-07 07:31:15] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 1 ms to minimize.
[2024-06-07 07:31:15] [INFO ] Deduced a trap composed of 28 places in 47 ms of which 4 ms to minimize.
[2024-06-07 07:31:15] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 1 ms to minimize.
[2024-06-07 07:31:15] [INFO ] Deduced a trap composed of 30 places in 52 ms of which 1 ms to minimize.
[2024-06-07 07:31:15] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/289 variables, 20/362 constraints. Problems are: Problem set: 18 solved, 160 unsolved
[2024-06-07 07:31:17] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 0 ms to minimize.
[2024-06-07 07:31:17] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 1 ms to minimize.
[2024-06-07 07:31:17] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2024-06-07 07:31:17] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 1 ms to minimize.
[2024-06-07 07:31:17] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 1 ms to minimize.
[2024-06-07 07:31:18] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2024-06-07 07:31:18] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
[2024-06-07 07:31:18] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
[2024-06-07 07:31:18] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 1 ms to minimize.
[2024-06-07 07:31:18] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 1 ms to minimize.
[2024-06-07 07:31:18] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 1 ms to minimize.
[2024-06-07 07:31:18] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 1 ms to minimize.
[2024-06-07 07:31:19] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 0 ms to minimize.
[2024-06-07 07:31:19] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2024-06-07 07:31:19] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 0 ms to minimize.
[2024-06-07 07:31:19] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 0 ms to minimize.
[2024-06-07 07:31:19] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 1 ms to minimize.
[2024-06-07 07:31:20] [INFO ] Deduced a trap composed of 24 places in 62 ms of which 1 ms to minimize.
[2024-06-07 07:31:20] [INFO ] Deduced a trap composed of 28 places in 53 ms of which 1 ms to minimize.
[2024-06-07 07:31:20] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/289 variables, 20/382 constraints. Problems are: Problem set: 18 solved, 160 unsolved
[2024-06-07 07:31:22] [INFO ] Deduced a trap composed of 28 places in 60 ms of which 1 ms to minimize.
[2024-06-07 07:31:22] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 1 ms to minimize.
[2024-06-07 07:31:23] [INFO ] Deduced a trap composed of 30 places in 53 ms of which 1 ms to minimize.
[2024-06-07 07:31:23] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 0 ms to minimize.
[2024-06-07 07:31:23] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
[2024-06-07 07:31:24] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 0 ms to minimize.
[2024-06-07 07:31:24] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 1 ms to minimize.
[2024-06-07 07:31:24] [INFO ] Deduced a trap composed of 28 places in 49 ms of which 1 ms to minimize.
[2024-06-07 07:31:25] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 1 ms to minimize.
[2024-06-07 07:31:25] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/289 variables, 10/392 constraints. Problems are: Problem set: 18 solved, 160 unsolved
[2024-06-07 07:31:27] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 0 ms to minimize.
[2024-06-07 07:31:28] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 0 ms to minimize.
[2024-06-07 07:31:29] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/289 variables, 3/395 constraints. Problems are: Problem set: 18 solved, 160 unsolved
[2024-06-07 07:31:33] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 289/289 variables, and 396 constraints, problems are : Problem set: 18 solved, 160 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 109/109 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 160/178 constraints, Known Traps: 94/94 constraints]
After SMT, in 34208ms problems are : Problem set: 18 solved, 160 unsolved
Search for dead transitions found 18 dead transitions in 34225ms
Found 18 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 18 transitions
Dead transitions reduction (with SMT) removed 18 transitions
Starting structural reductions in STATESPACE mode, iteration 1 : 109/109 places, 162/180 transitions.
Reduce places removed 9 places and 0 transitions.
Starting structural reductions in STATESPACE mode, iteration 2 : 100/109 places, 162/180 transitions.
Finished structural reductions in STATESPACE mode , in 2 iterations and 34353 ms. Remains : 100/109 places, 162/180 transitions.
Final net has 100 places and 162 transitions.
[2024-06-07 07:31:34] [INFO ] Flatten gal took : 47 ms
[2024-06-07 07:31:34] [INFO ] Applying decomposition
[2024-06-07 07:31:34] [INFO ] Flatten gal took : 16 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/graph8391352295241145395.txt' '-o' '/tmp/graph8391352295241145395.bin' '-w' '/tmp/graph8391352295241145395.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8391352295241145395.bin' '-l' '-1' '-v' '-w' '/tmp/graph8391352295241145395.weights' '-q' '0' '-e' '0.001'
[2024-06-07 07:31:34] [INFO ] Decomposing Gal with order
[2024-06-07 07:31:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-07 07:31:34] [INFO ] Removed a total of 234 redundant transitions.
[2024-06-07 07:31:34] [INFO ] Flatten gal took : 54 ms
[2024-06-07 07:31:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2024-06-07 07:31:34] [INFO ] Time to serialize gal into /tmp/StateSpace2649942386550938279.gal : 7 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/StateSpace2649942386550938279.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,8.14573e+06,79.8981,2141348,132735,341,4.08872e+06,668,435,2.90172e+06,116,9955,0
Total reachable state count : 8145730

Max variable value : 1
STATE_SPACE MAX_TOKEN_IN_PLACE 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Maximum sum along a path : 19
STATE_SPACE MAX_TOKEN_PER_MARKING 19 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Exact state count : 8145730
STATE_SPACE STATES 8145730 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 116184 ms.

BK_STOP 1717745575520

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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="BlocksWorld-PT-01"
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 BlocksWorld-PT-01, 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 r602-tall-171774424600168"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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