About the Execution of ITS-Tools for BART-PT-010
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1217.115 | 483474.00 | 590040.00 | 1248.00 | TFTTTFTFFTFFFFTT | normal |
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.r026-smll-171620167700457.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 BART-PT-010, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r026-smll-171620167700457
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 29M
-rw-r--r-- 1 mcc users 1020K Apr 12 22:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 3.7M Apr 12 22:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 356K Apr 12 21:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.2M Apr 12 21:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 377K Apr 22 14:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 1.1M Apr 22 14:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 386K Apr 22 14:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 1010K Apr 22 14:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.1M Apr 12 23:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 7.4M Apr 12 23:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 1.9M Apr 12 22:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 6.1M Apr 12 22:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 84K Apr 22 14:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 172K Apr 22 14:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 2.4M May 18 16:42 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 BART-PT-010-CTLCardinality-2024-00
FORMULA_NAME BART-PT-010-CTLCardinality-2024-01
FORMULA_NAME BART-PT-010-CTLCardinality-2024-02
FORMULA_NAME BART-PT-010-CTLCardinality-2024-03
FORMULA_NAME BART-PT-010-CTLCardinality-2024-04
FORMULA_NAME BART-PT-010-CTLCardinality-2024-05
FORMULA_NAME BART-PT-010-CTLCardinality-2024-06
FORMULA_NAME BART-PT-010-CTLCardinality-2024-07
FORMULA_NAME BART-PT-010-CTLCardinality-2024-08
FORMULA_NAME BART-PT-010-CTLCardinality-2024-09
FORMULA_NAME BART-PT-010-CTLCardinality-2024-10
FORMULA_NAME BART-PT-010-CTLCardinality-2024-11
FORMULA_NAME BART-PT-010-CTLCardinality-2024-12
FORMULA_NAME BART-PT-010-CTLCardinality-2024-13
FORMULA_NAME BART-PT-010-CTLCardinality-2024-14
FORMULA_NAME BART-PT-010-CTLCardinality-2024-15
=== Now, execution of the tool begins
BK_START 1716384236145
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BART-PT-010
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-05-22 13:23:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-22 13:23:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 13:23:59] [INFO ] Load time of PNML (sax parser for PT used): 667 ms
[2024-05-22 13:23:59] [INFO ] Transformed 1530 places.
[2024-05-22 13:23:59] [INFO ] Transformed 2020 transitions.
[2024-05-22 13:23:59] [INFO ] Found NUPN structural information;
[2024-05-22 13:23:59] [INFO ] Parsed PT model containing 1530 places and 2020 transitions and 16200 arcs in 962 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 265 ms.
Reduce places removed 210 places and 0 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA BART-PT-010-CTLCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-010-CTLCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-010-CTLCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 37 out of 1320 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1320/1320 places, 2020/2020 transitions.
Discarding 300 places :
Symmetric choice reduction at 0 with 300 rule applications. Total rules 300 place count 1020 transition count 1720
Iterating global reduction 0 with 300 rules applied. Total rules applied 600 place count 1020 transition count 1720
Discarding 243 places :
Symmetric choice reduction at 0 with 243 rule applications. Total rules 843 place count 777 transition count 1477
Iterating global reduction 0 with 243 rules applied. Total rules applied 1086 place count 777 transition count 1477
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 1122 place count 741 transition count 1441
Iterating global reduction 0 with 36 rules applied. Total rules applied 1158 place count 741 transition count 1441
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 1185 place count 714 transition count 1414
Iterating global reduction 0 with 27 rules applied. Total rules applied 1212 place count 714 transition count 1414
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 1237 place count 689 transition count 1389
Iterating global reduction 0 with 25 rules applied. Total rules applied 1262 place count 689 transition count 1389
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 1286 place count 665 transition count 1365
Iterating global reduction 0 with 24 rules applied. Total rules applied 1310 place count 665 transition count 1365
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 1332 place count 643 transition count 1343
Iterating global reduction 0 with 22 rules applied. Total rules applied 1354 place count 643 transition count 1343
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 1376 place count 621 transition count 1321
Iterating global reduction 0 with 22 rules applied. Total rules applied 1398 place count 621 transition count 1321
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 1412 place count 607 transition count 1307
Iterating global reduction 0 with 14 rules applied. Total rules applied 1426 place count 607 transition count 1307
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 1438 place count 595 transition count 1295
Iterating global reduction 0 with 12 rules applied. Total rules applied 1450 place count 595 transition count 1295
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 1455 place count 590 transition count 1290
Iterating global reduction 0 with 5 rules applied. Total rules applied 1460 place count 590 transition count 1290
Applied a total of 1460 rules in 543 ms. Remains 590 /1320 variables (removed 730) and now considering 1290/2020 (removed 730) transitions.
// Phase 1: matrix 1290 rows 590 cols
[2024-05-22 13:24:00] [INFO ] Computed 10 invariants in 41 ms
[2024-05-22 13:24:01] [INFO ] Implicit Places using invariants in 489 ms returned []
[2024-05-22 13:24:01] [INFO ] Invariant cache hit.
[2024-05-22 13:24:02] [INFO ] Implicit Places using invariants and state equation in 939 ms returned []
Implicit Place search using SMT with State Equation took 1475 ms to find 0 implicit places.
Running 930 sub problems to find dead transitions.
[2024-05-22 13:24:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/580 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 930 unsolved
SMT process timed out in 30545ms, After SMT, problems are : Problem set: 0 solved, 930 unsolved
Search for dead transitions found 0 dead transitions in 30607ms
Starting structural reductions in LTL mode, iteration 1 : 590/1320 places, 1290/2020 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32680 ms. Remains : 590/1320 places, 1290/2020 transitions.
Support contains 37 out of 590 places after structural reductions.
[2024-05-22 13:24:33] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2024-05-22 13:24:33] [INFO ] Flatten gal took : 207 ms
[2024-05-22 13:24:33] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA BART-PT-010-CTLCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-010-CTLCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-010-CTLCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-010-CTLCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-010-CTLCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-22 13:24:33] [INFO ] Flatten gal took : 100 ms
[2024-05-22 13:24:33] [INFO ] Input system was already deterministic with 1290 transitions.
Support contains 30 out of 590 places (down from 37) after GAL structural reductions.
FORMULA BART-PT-010-CTLCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-010-CTLCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 35364 steps (8 resets) in 2406 ms. (14 steps per ms) remains 0/21 properties
[2024-05-22 13:24:34] [INFO ] Flatten gal took : 66 ms
[2024-05-22 13:24:34] [INFO ] Flatten gal took : 69 ms
[2024-05-22 13:24:34] [INFO ] Input system was already deterministic with 1290 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 590/590 places, 1290/1290 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 562 transition count 1262
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 562 transition count 1262
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 77 place count 541 transition count 1241
Iterating global reduction 0 with 21 rules applied. Total rules applied 98 place count 541 transition count 1241
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 108 place count 531 transition count 1231
Iterating global reduction 0 with 10 rules applied. Total rules applied 118 place count 531 transition count 1231
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 128 place count 521 transition count 1221
Iterating global reduction 0 with 10 rules applied. Total rules applied 138 place count 521 transition count 1221
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 146 place count 513 transition count 1213
Iterating global reduction 0 with 8 rules applied. Total rules applied 154 place count 513 transition count 1213
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 162 place count 505 transition count 1205
Iterating global reduction 0 with 8 rules applied. Total rules applied 170 place count 505 transition count 1205
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 177 place count 498 transition count 1198
Iterating global reduction 0 with 7 rules applied. Total rules applied 184 place count 498 transition count 1198
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 189 place count 493 transition count 1193
Iterating global reduction 0 with 5 rules applied. Total rules applied 194 place count 493 transition count 1193
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 195 place count 492 transition count 1192
Iterating global reduction 0 with 1 rules applied. Total rules applied 196 place count 492 transition count 1192
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 197 place count 491 transition count 1191
Iterating global reduction 0 with 1 rules applied. Total rules applied 198 place count 491 transition count 1191
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 199 place count 490 transition count 1190
Iterating global reduction 0 with 1 rules applied. Total rules applied 200 place count 490 transition count 1190
Applied a total of 200 rules in 333 ms. Remains 490 /590 variables (removed 100) and now considering 1190/1290 (removed 100) transitions.
// Phase 1: matrix 1190 rows 490 cols
[2024-05-22 13:24:35] [INFO ] Computed 10 invariants in 9 ms
[2024-05-22 13:24:35] [INFO ] Implicit Places using invariants in 131 ms returned []
[2024-05-22 13:24:35] [INFO ] Invariant cache hit.
[2024-05-22 13:24:35] [INFO ] Implicit Places using invariants and state equation in 589 ms returned []
Implicit Place search using SMT with State Equation took 724 ms to find 0 implicit places.
Running 830 sub problems to find dead transitions.
[2024-05-22 13:24:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/480 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 830 unsolved
At refinement iteration 1 (OVERLAPS) 10/490 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 830 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 490/1680 variables, and 10 constraints, problems are : Problem set: 0 solved, 830 unsolved in 30051 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/490 constraints, PredecessorRefiner: 830/830 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 830 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/480 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 830 unsolved
At refinement iteration 1 (OVERLAPS) 10/490 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 830 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/490 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 830 unsolved
At refinement iteration 3 (OVERLAPS) 1190/1680 variables, 490/500 constraints. Problems are: Problem set: 0 solved, 830 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1680 variables, 830/1330 constraints. Problems are: Problem set: 0 solved, 830 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1680/1680 variables, and 1330 constraints, problems are : Problem set: 0 solved, 830 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 490/490 constraints, PredecessorRefiner: 830/830 constraints, Known Traps: 0/0 constraints]
After SMT, in 60474ms problems are : Problem set: 0 solved, 830 unsolved
Search for dead transitions found 0 dead transitions in 60504ms
Starting structural reductions in LTL mode, iteration 1 : 490/590 places, 1190/1290 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61568 ms. Remains : 490/590 places, 1190/1290 transitions.
[2024-05-22 13:25:36] [INFO ] Flatten gal took : 60 ms
[2024-05-22 13:25:36] [INFO ] Flatten gal took : 59 ms
[2024-05-22 13:25:36] [INFO ] Input system was already deterministic with 1190 transitions.
[2024-05-22 13:25:36] [INFO ] Flatten gal took : 56 ms
[2024-05-22 13:25:36] [INFO ] Flatten gal took : 54 ms
[2024-05-22 13:25:36] [INFO ] Time to serialize gal into /tmp/CTLCardinality2199915011327377236.gal : 37 ms
[2024-05-22 13:25:36] [INFO ] Time to serialize properties into /tmp/CTLCardinality6269324732304986390.ctl : 4 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality2199915011327377236.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6269324732304986390.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-22 13:26:07] [INFO ] Flatten gal took : 27 ms
[2024-05-22 13:26:07] [INFO ] Applying decomposition
[2024-05-22 13:26:07] [INFO ] Flatten gal took : 25 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/graph4052871986434388568.txt' '-o' '/tmp/graph4052871986434388568.bin' '-w' '/tmp/graph4052871986434388568.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4052871986434388568.bin' '-l' '-1' '-v' '-w' '/tmp/graph4052871986434388568.weights' '-q' '0' '-e' '0.001'
[2024-05-22 13:26:07] [INFO ] Decomposing Gal with order
[2024-05-22 13:26:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 13:26:07] [INFO ] Removed a total of 376 redundant transitions.
[2024-05-22 13:26:07] [INFO ] Flatten gal took : 136 ms
[2024-05-22 13:26:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 225 labels/synchronizations in 18 ms.
[2024-05-22 13:26:07] [INFO ] Time to serialize gal into /tmp/CTLCardinality754254900014122400.gal : 22 ms
[2024-05-22 13:26:07] [INFO ] Time to serialize properties into /tmp/CTLCardinality5184737716211615435.ctl : 1 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality754254900014122400.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5184737716211615435.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.97923e+16,0.234106,8828,76,23,461,439,337,304,109,645,0
Converting to forward existential form...Done !
original formula: !(E(EG(EX(TRUE)) U AG(AX(FALSE))))
=> equivalent forward existential formula: [(FwdU(Init,EG(EX(TRUE))) * !(E(TRUE U !(!(EX(!(FALSE)))))))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.271586,8828,1,0,697,827,1314,474,426,956,2025
FORMULA BART-PT-010-CTLCardinality-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 590/590 places, 1290/1290 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 564 transition count 1264
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 564 transition count 1264
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 72 place count 544 transition count 1244
Iterating global reduction 0 with 20 rules applied. Total rules applied 92 place count 544 transition count 1244
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 102 place count 534 transition count 1234
Iterating global reduction 0 with 10 rules applied. Total rules applied 112 place count 534 transition count 1234
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 122 place count 524 transition count 1224
Iterating global reduction 0 with 10 rules applied. Total rules applied 132 place count 524 transition count 1224
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 140 place count 516 transition count 1216
Iterating global reduction 0 with 8 rules applied. Total rules applied 148 place count 516 transition count 1216
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 156 place count 508 transition count 1208
Iterating global reduction 0 with 8 rules applied. Total rules applied 164 place count 508 transition count 1208
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 171 place count 501 transition count 1201
Iterating global reduction 0 with 7 rules applied. Total rules applied 178 place count 501 transition count 1201
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 183 place count 496 transition count 1196
Iterating global reduction 0 with 5 rules applied. Total rules applied 188 place count 496 transition count 1196
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 189 place count 495 transition count 1195
Iterating global reduction 0 with 1 rules applied. Total rules applied 190 place count 495 transition count 1195
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 191 place count 494 transition count 1194
Iterating global reduction 0 with 1 rules applied. Total rules applied 192 place count 494 transition count 1194
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 193 place count 493 transition count 1193
Iterating global reduction 0 with 1 rules applied. Total rules applied 194 place count 493 transition count 1193
Applied a total of 194 rules in 199 ms. Remains 493 /590 variables (removed 97) and now considering 1193/1290 (removed 97) transitions.
// Phase 1: matrix 1193 rows 493 cols
[2024-05-22 13:26:08] [INFO ] Computed 10 invariants in 10 ms
[2024-05-22 13:26:08] [INFO ] Implicit Places using invariants in 182 ms returned []
[2024-05-22 13:26:08] [INFO ] Invariant cache hit.
[2024-05-22 13:26:08] [INFO ] Implicit Places using invariants and state equation in 632 ms returned []
Implicit Place search using SMT with State Equation took 816 ms to find 0 implicit places.
Running 833 sub problems to find dead transitions.
[2024-05-22 13:26:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/483 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 1 (OVERLAPS) 10/493 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 833 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 493/1686 variables, and 10 constraints, problems are : Problem set: 0 solved, 833 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/493 constraints, PredecessorRefiner: 833/833 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 833 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/483 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 1 (OVERLAPS) 10/493 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/493 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 3 (OVERLAPS) 1193/1686 variables, 493/503 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1686 variables, 833/1336 constraints. Problems are: Problem set: 0 solved, 833 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1686/1686 variables, and 1336 constraints, problems are : Problem set: 0 solved, 833 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 493/493 constraints, PredecessorRefiner: 833/833 constraints, Known Traps: 0/0 constraints]
After SMT, in 60267ms problems are : Problem set: 0 solved, 833 unsolved
Search for dead transitions found 0 dead transitions in 60277ms
Starting structural reductions in LTL mode, iteration 1 : 493/590 places, 1193/1290 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61295 ms. Remains : 493/590 places, 1193/1290 transitions.
[2024-05-22 13:27:09] [INFO ] Flatten gal took : 40 ms
[2024-05-22 13:27:09] [INFO ] Flatten gal took : 36 ms
[2024-05-22 13:27:09] [INFO ] Input system was already deterministic with 1193 transitions.
[2024-05-22 13:27:09] [INFO ] Flatten gal took : 34 ms
[2024-05-22 13:27:09] [INFO ] Flatten gal took : 37 ms
[2024-05-22 13:27:09] [INFO ] Time to serialize gal into /tmp/CTLCardinality10913289571860053847.gal : 8 ms
[2024-05-22 13:27:09] [INFO ] Time to serialize properties into /tmp/CTLCardinality540738084700297306.ctl : 1 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality10913289571860053847.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality540738084700297306.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-22 13:27:39] [INFO ] Flatten gal took : 19 ms
[2024-05-22 13:27:39] [INFO ] Applying decomposition
[2024-05-22 13:27:39] [INFO ] Flatten gal took : 19 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/graph6271719258295226716.txt' '-o' '/tmp/graph6271719258295226716.bin' '-w' '/tmp/graph6271719258295226716.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6271719258295226716.bin' '-l' '-1' '-v' '-w' '/tmp/graph6271719258295226716.weights' '-q' '0' '-e' '0.001'
[2024-05-22 13:27:39] [INFO ] Decomposing Gal with order
[2024-05-22 13:27:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 13:27:39] [INFO ] Removed a total of 391 redundant transitions.
[2024-05-22 13:27:39] [INFO ] Flatten gal took : 54 ms
[2024-05-22 13:27:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 206 labels/synchronizations in 11 ms.
[2024-05-22 13:27:39] [INFO ] Time to serialize gal into /tmp/CTLCardinality16686115218208203279.gal : 9 ms
[2024-05-22 13:27:39] [INFO ] Time to serialize properties into /tmp/CTLCardinality5938781120125889360.ctl : 1 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality16686115218208203279.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5938781120125889360.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,8.4744e+16,0.230932,8940,89,25,562,474,382,390,114,684,0
Converting to forward existential form...Done !
original formula: EX((EG(EF((i2.u94.TrainState_3_2_34==0))) * (i9.u49.TrainState_9_3_16==0)))
=> equivalent forward existential formula: [FwdG((EY(Init) * (i9.u49.TrainState_9_3_16==0)),E(TRUE U (i2.u94.TrainState_3_2_34==0)))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
(forward)formula 0,1,0.337216,9200,1,0,1514,1736,2192,1276,524,2140,5495
FORMULA BART-PT-010-CTLCardinality-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 590/590 places, 1290/1290 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 574 transition count 1274
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 574 transition count 1274
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 43 place count 563 transition count 1263
Iterating global reduction 0 with 11 rules applied. Total rules applied 54 place count 563 transition count 1263
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 57 place count 560 transition count 1260
Iterating global reduction 0 with 3 rules applied. Total rules applied 60 place count 560 transition count 1260
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 63 place count 557 transition count 1257
Iterating global reduction 0 with 3 rules applied. Total rules applied 66 place count 557 transition count 1257
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 69 place count 554 transition count 1254
Iterating global reduction 0 with 3 rules applied. Total rules applied 72 place count 554 transition count 1254
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 75 place count 551 transition count 1251
Iterating global reduction 0 with 3 rules applied. Total rules applied 78 place count 551 transition count 1251
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 79 place count 550 transition count 1250
Iterating global reduction 0 with 1 rules applied. Total rules applied 80 place count 550 transition count 1250
Applied a total of 80 rules in 91 ms. Remains 550 /590 variables (removed 40) and now considering 1250/1290 (removed 40) transitions.
// Phase 1: matrix 1250 rows 550 cols
[2024-05-22 13:27:40] [INFO ] Computed 10 invariants in 11 ms
[2024-05-22 13:27:40] [INFO ] Implicit Places using invariants in 184 ms returned []
[2024-05-22 13:27:40] [INFO ] Invariant cache hit.
[2024-05-22 13:27:41] [INFO ] Implicit Places using invariants and state equation in 718 ms returned []
Implicit Place search using SMT with State Equation took 907 ms to find 0 implicit places.
Running 890 sub problems to find dead transitions.
[2024-05-22 13:27:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/540 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 890 unsolved
At refinement iteration 1 (OVERLAPS) 10/550 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 890 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 550/1800 variables, and 10 constraints, problems are : Problem set: 0 solved, 890 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/550 constraints, PredecessorRefiner: 890/890 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 890 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/540 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 890 unsolved
At refinement iteration 1 (OVERLAPS) 10/550 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 890 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 550/1800 variables, and 10 constraints, problems are : Problem set: 0 solved, 890 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/550 constraints, PredecessorRefiner: 0/890 constraints, Known Traps: 0/0 constraints]
After SMT, in 60381ms problems are : Problem set: 0 solved, 890 unsolved
Search for dead transitions found 0 dead transitions in 60398ms
Starting structural reductions in LTL mode, iteration 1 : 550/590 places, 1250/1290 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61400 ms. Remains : 550/590 places, 1250/1290 transitions.
[2024-05-22 13:28:41] [INFO ] Flatten gal took : 36 ms
[2024-05-22 13:28:41] [INFO ] Flatten gal took : 31 ms
[2024-05-22 13:28:41] [INFO ] Input system was already deterministic with 1250 transitions.
[2024-05-22 13:28:41] [INFO ] Flatten gal took : 37 ms
[2024-05-22 13:28:41] [INFO ] Flatten gal took : 32 ms
[2024-05-22 13:28:41] [INFO ] Time to serialize gal into /tmp/CTLCardinality17585285833083843581.gal : 47 ms
[2024-05-22 13:28:41] [INFO ] Time to serialize properties into /tmp/CTLCardinality5755234874649080894.ctl : 2 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality17585285833083843581.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5755234874649080894.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.41757e+17,0.990604,10356,2,1091,5,9132,6,0,3453,5451,0
Converting to forward existential form...Done !
original formula: !(A(AF(((((TrainState_8_1_3==1)&&(!((TrainState_9_4_16==0)||(TrainState_9_4_13==1)))) + EG((TrainState_6_4_29==0))) + EF((TrainState_1_2_...428
=> equivalent forward existential formula: (([(FwdU((FwdU(Init,!((!(E(TRUE U !(EX((TrainState_10_3_29==0))))) * E(TRUE U ((E(((TrainState_4_4_28==0)||(Trai...1566
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 1244/0/6
(forward)formula 0,0,4.64132,60732,1,0,17,341634,39,5,15099,35250,17
FORMULA BART-PT-010-CTLCardinality-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 590/590 places, 1290/1290 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 567 transition count 1267
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 567 transition count 1267
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 65 place count 548 transition count 1248
Iterating global reduction 0 with 19 rules applied. Total rules applied 84 place count 548 transition count 1248
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 94 place count 538 transition count 1238
Iterating global reduction 0 with 10 rules applied. Total rules applied 104 place count 538 transition count 1238
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 114 place count 528 transition count 1228
Iterating global reduction 0 with 10 rules applied. Total rules applied 124 place count 528 transition count 1228
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 132 place count 520 transition count 1220
Iterating global reduction 0 with 8 rules applied. Total rules applied 140 place count 520 transition count 1220
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 148 place count 512 transition count 1212
Iterating global reduction 0 with 8 rules applied. Total rules applied 156 place count 512 transition count 1212
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 163 place count 505 transition count 1205
Iterating global reduction 0 with 7 rules applied. Total rules applied 170 place count 505 transition count 1205
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 175 place count 500 transition count 1200
Iterating global reduction 0 with 5 rules applied. Total rules applied 180 place count 500 transition count 1200
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 181 place count 499 transition count 1199
Iterating global reduction 0 with 1 rules applied. Total rules applied 182 place count 499 transition count 1199
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 183 place count 498 transition count 1198
Iterating global reduction 0 with 1 rules applied. Total rules applied 184 place count 498 transition count 1198
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 185 place count 497 transition count 1197
Iterating global reduction 0 with 1 rules applied. Total rules applied 186 place count 497 transition count 1197
Applied a total of 186 rules in 119 ms. Remains 497 /590 variables (removed 93) and now considering 1197/1290 (removed 93) transitions.
// Phase 1: matrix 1197 rows 497 cols
[2024-05-22 13:28:46] [INFO ] Computed 10 invariants in 5 ms
[2024-05-22 13:28:46] [INFO ] Implicit Places using invariants in 108 ms returned []
[2024-05-22 13:28:46] [INFO ] Invariant cache hit.
[2024-05-22 13:28:47] [INFO ] Implicit Places using invariants and state equation in 502 ms returned []
Implicit Place search using SMT with State Equation took 613 ms to find 0 implicit places.
Running 837 sub problems to find dead transitions.
[2024-05-22 13:28:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/487 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 837 unsolved
At refinement iteration 1 (OVERLAPS) 10/497 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 837 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 497/1694 variables, and 10 constraints, problems are : Problem set: 0 solved, 837 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/497 constraints, PredecessorRefiner: 837/837 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 837 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/487 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 837 unsolved
At refinement iteration 1 (OVERLAPS) 10/497 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 837 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/497 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 837 unsolved
At refinement iteration 3 (OVERLAPS) 1197/1694 variables, 497/507 constraints. Problems are: Problem set: 0 solved, 837 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1694 variables, 837/1344 constraints. Problems are: Problem set: 0 solved, 837 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1694/1694 variables, and 1344 constraints, problems are : Problem set: 0 solved, 837 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 497/497 constraints, PredecessorRefiner: 837/837 constraints, Known Traps: 0/0 constraints]
After SMT, in 60311ms problems are : Problem set: 0 solved, 837 unsolved
Search for dead transitions found 0 dead transitions in 60327ms
Starting structural reductions in LTL mode, iteration 1 : 497/590 places, 1197/1290 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61063 ms. Remains : 497/590 places, 1197/1290 transitions.
[2024-05-22 13:29:47] [INFO ] Flatten gal took : 29 ms
[2024-05-22 13:29:47] [INFO ] Flatten gal took : 28 ms
[2024-05-22 13:29:47] [INFO ] Input system was already deterministic with 1197 transitions.
[2024-05-22 13:29:47] [INFO ] Flatten gal took : 28 ms
[2024-05-22 13:29:47] [INFO ] Flatten gal took : 29 ms
[2024-05-22 13:29:47] [INFO ] Time to serialize gal into /tmp/CTLCardinality18223558671836765067.gal : 7 ms
[2024-05-22 13:29:47] [INFO ] Time to serialize properties into /tmp/CTLCardinality2284217769841357303.ctl : 1 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality18223558671836765067.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2284217769841357303.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.1803e+16,0.659743,9280,2,985,5,7863,6,0,3188,4429,0
Converting to forward existential form...Done !
original formula: (AX(((AF((TrainState_7_2_28==0)) * (TrainState_2_2_17==0)) * (TrainState_8_3_20==1))) + AX(((TrainState_10_3_22==0)&&(TrainState_7_2_15==...160
=> equivalent forward existential formula: [(EY((Init * !(!(EX(!(((!(EG(!((TrainState_7_2_28==0)))) * (TrainState_2_2_17==0)) * (TrainState_8_3_20==1))))))...222
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,2.56929,47716,1,0,16,265889,23,7,12277,22682,11
FORMULA BART-PT-010-CTLCardinality-2024-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 590/590 places, 1290/1290 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 564 transition count 1264
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 564 transition count 1264
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 72 place count 544 transition count 1244
Iterating global reduction 0 with 20 rules applied. Total rules applied 92 place count 544 transition count 1244
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 102 place count 534 transition count 1234
Iterating global reduction 0 with 10 rules applied. Total rules applied 112 place count 534 transition count 1234
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 122 place count 524 transition count 1224
Iterating global reduction 0 with 10 rules applied. Total rules applied 132 place count 524 transition count 1224
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 139 place count 517 transition count 1217
Iterating global reduction 0 with 7 rules applied. Total rules applied 146 place count 517 transition count 1217
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 153 place count 510 transition count 1210
Iterating global reduction 0 with 7 rules applied. Total rules applied 160 place count 510 transition count 1210
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 166 place count 504 transition count 1204
Iterating global reduction 0 with 6 rules applied. Total rules applied 172 place count 504 transition count 1204
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 177 place count 499 transition count 1199
Iterating global reduction 0 with 5 rules applied. Total rules applied 182 place count 499 transition count 1199
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 183 place count 498 transition count 1198
Iterating global reduction 0 with 1 rules applied. Total rules applied 184 place count 498 transition count 1198
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 185 place count 497 transition count 1197
Iterating global reduction 0 with 1 rules applied. Total rules applied 186 place count 497 transition count 1197
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 187 place count 496 transition count 1196
Iterating global reduction 0 with 1 rules applied. Total rules applied 188 place count 496 transition count 1196
Applied a total of 188 rules in 114 ms. Remains 496 /590 variables (removed 94) and now considering 1196/1290 (removed 94) transitions.
// Phase 1: matrix 1196 rows 496 cols
[2024-05-22 13:29:50] [INFO ] Computed 10 invariants in 12 ms
[2024-05-22 13:29:50] [INFO ] Implicit Places using invariants in 118 ms returned []
[2024-05-22 13:29:50] [INFO ] Invariant cache hit.
[2024-05-22 13:29:51] [INFO ] Implicit Places using invariants and state equation in 486 ms returned []
Implicit Place search using SMT with State Equation took 606 ms to find 0 implicit places.
Running 836 sub problems to find dead transitions.
[2024-05-22 13:29:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/486 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 836 unsolved
At refinement iteration 1 (OVERLAPS) 10/496 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 836 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 496/1692 variables, and 10 constraints, problems are : Problem set: 0 solved, 836 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/496 constraints, PredecessorRefiner: 836/836 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 836 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/486 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 836 unsolved
At refinement iteration 1 (OVERLAPS) 10/496 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 836 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/496 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 836 unsolved
At refinement iteration 3 (OVERLAPS) 1196/1692 variables, 496/506 constraints. Problems are: Problem set: 0 solved, 836 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1692 variables, 836/1342 constraints. Problems are: Problem set: 0 solved, 836 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1692/1692 variables, and 1342 constraints, problems are : Problem set: 0 solved, 836 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 496/496 constraints, PredecessorRefiner: 836/836 constraints, Known Traps: 0/0 constraints]
After SMT, in 60237ms problems are : Problem set: 0 solved, 836 unsolved
Search for dead transitions found 0 dead transitions in 60248ms
Starting structural reductions in LTL mode, iteration 1 : 496/590 places, 1196/1290 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60972 ms. Remains : 496/590 places, 1196/1290 transitions.
[2024-05-22 13:30:51] [INFO ] Flatten gal took : 28 ms
[2024-05-22 13:30:51] [INFO ] Flatten gal took : 28 ms
[2024-05-22 13:30:51] [INFO ] Input system was already deterministic with 1196 transitions.
[2024-05-22 13:30:51] [INFO ] Flatten gal took : 30 ms
[2024-05-22 13:30:51] [INFO ] Flatten gal took : 29 ms
[2024-05-22 13:30:51] [INFO ] Time to serialize gal into /tmp/CTLCardinality5462041498865908126.gal : 6 ms
[2024-05-22 13:30:51] [INFO ] Time to serialize properties into /tmp/CTLCardinality11957775513479694130.ctl : 1 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality5462041498865908126.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11957775513479694130.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,8.97289e+16,0.868299,9276,2,986,5,7807,6,0,3183,4272,0
Converting to forward existential form...Done !
original formula: EF((EG((((TrainState_9_4_24==0)||(TrainState_1_1_33==1)) * (EF((TrainState_2_1_10==0)) + AF((TrainState_3_2_24==1))))) + AX(FALSE)))
=> equivalent forward existential formula: ([FwdG(FwdU(Init,TRUE),(((TrainState_9_4_24==0)||(TrainState_1_1_33==1)) * (E(TRUE U (TrainState_2_1_10==0)) + !...249
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,3.17255,48348,1,0,9,260923,29,3,13224,21697,14
FORMULA BART-PT-010-CTLCardinality-2024-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 590/590 places, 1290/1290 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 565 transition count 1265
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 565 transition count 1265
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 68 place count 547 transition count 1247
Iterating global reduction 0 with 18 rules applied. Total rules applied 86 place count 547 transition count 1247
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 94 place count 539 transition count 1239
Iterating global reduction 0 with 8 rules applied. Total rules applied 102 place count 539 transition count 1239
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 110 place count 531 transition count 1231
Iterating global reduction 0 with 8 rules applied. Total rules applied 118 place count 531 transition count 1231
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 124 place count 525 transition count 1225
Iterating global reduction 0 with 6 rules applied. Total rules applied 130 place count 525 transition count 1225
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 136 place count 519 transition count 1219
Iterating global reduction 0 with 6 rules applied. Total rules applied 142 place count 519 transition count 1219
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 147 place count 514 transition count 1214
Iterating global reduction 0 with 5 rules applied. Total rules applied 152 place count 514 transition count 1214
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 156 place count 510 transition count 1210
Iterating global reduction 0 with 4 rules applied. Total rules applied 160 place count 510 transition count 1210
Applied a total of 160 rules in 96 ms. Remains 510 /590 variables (removed 80) and now considering 1210/1290 (removed 80) transitions.
// Phase 1: matrix 1210 rows 510 cols
[2024-05-22 13:30:54] [INFO ] Computed 10 invariants in 4 ms
[2024-05-22 13:30:55] [INFO ] Implicit Places using invariants in 115 ms returned []
[2024-05-22 13:30:55] [INFO ] Invariant cache hit.
[2024-05-22 13:30:55] [INFO ] Implicit Places using invariants and state equation in 689 ms returned []
Implicit Place search using SMT with State Equation took 818 ms to find 0 implicit places.
Running 850 sub problems to find dead transitions.
[2024-05-22 13:30:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/500 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 1 (OVERLAPS) 10/510 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 850 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 510/1720 variables, and 10 constraints, problems are : Problem set: 0 solved, 850 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/510 constraints, PredecessorRefiner: 850/850 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 850 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/500 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 1 (OVERLAPS) 10/510 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/510 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 3 (OVERLAPS) 1210/1720 variables, 510/520 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1720 variables, 850/1370 constraints. Problems are: Problem set: 0 solved, 850 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1720/1720 variables, and 1370 constraints, problems are : Problem set: 0 solved, 850 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 510/510 constraints, PredecessorRefiner: 850/850 constraints, Known Traps: 0/0 constraints]
After SMT, in 60327ms problems are : Problem set: 0 solved, 850 unsolved
Search for dead transitions found 0 dead transitions in 60341ms
Starting structural reductions in LTL mode, iteration 1 : 510/590 places, 1210/1290 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61260 ms. Remains : 510/590 places, 1210/1290 transitions.
[2024-05-22 13:31:56] [INFO ] Flatten gal took : 34 ms
[2024-05-22 13:31:56] [INFO ] Flatten gal took : 29 ms
[2024-05-22 13:31:56] [INFO ] Input system was already deterministic with 1210 transitions.
[2024-05-22 13:31:56] [INFO ] Flatten gal took : 29 ms
[2024-05-22 13:31:56] [INFO ] Flatten gal took : 29 ms
[2024-05-22 13:31:56] [INFO ] Time to serialize gal into /tmp/CTLCardinality895276718859547805.gal : 11 ms
[2024-05-22 13:31:56] [INFO ] Time to serialize properties into /tmp/CTLCardinality1700016639315623046.ctl : 0 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality895276718859547805.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1700016639315623046.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.15385e+17,0.711792,9612,2,1011,5,8148,6,0,3253,4547,0
Converting to forward existential form...Done !
original formula: AG((E(AF(EX((TrainState_8_2_4==0))) U ((EX((TrainState_1_1_35==1)) * EG(((TrainState_2_4_15==0)||(TrainState_8_1_23==1)))) + (TrainState_...184
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !(EX(EX(TRUE)))) * !(E(!(EG(!(EX((TrainState_8_2_4==0))))) U ((EX((TrainState_1_1_35==1)) *...247
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,3.16595,52060,1,0,12,285513,30,2,13526,24130,13
FORMULA BART-PT-010-CTLCardinality-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
[2024-05-22 13:31:59] [INFO ] Flatten gal took : 34 ms
[2024-05-22 13:31:59] [INFO ] Flatten gal took : 19 ms
Total runtime 480820 ms.
BK_STOP 1716384719619
--------------------
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
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLCardinality -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 CTLCardinality -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="BART-PT-010"
export BK_EXAMINATION="CTLCardinality"
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 BART-PT-010, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r026-smll-171620167700457"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BART-PT-010.tgz
mv BART-PT-010 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;