About the Execution of ITS-Tools for BART-PT-002
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 404.792 | 70384.00 | 99222.00 | 338.80 | FFFFFFFTTFFTTFTT | 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-171620167700441.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-002, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r026-smll-171620167700441
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.2M
-rw-r--r-- 1 mcc users 231K Apr 12 21:33 CTLCardinality.txt
-rw-r--r-- 1 mcc users 891K Apr 12 21:33 CTLCardinality.xml
-rw-r--r-- 1 mcc users 98K Apr 12 21:17 CTLFireability.txt
-rw-r--r-- 1 mcc users 351K Apr 12 21:17 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 105K Apr 22 14:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 278K Apr 22 14:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 31K Apr 22 14:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 86K Apr 22 14:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 405K Apr 12 22:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 1.5M Apr 12 22:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 383K Apr 12 21:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.3M Apr 12 21:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 19K Apr 22 14:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 37K 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 534K 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-002-CTLCardinality-2024-00
FORMULA_NAME BART-PT-002-CTLCardinality-2024-01
FORMULA_NAME BART-PT-002-CTLCardinality-2024-02
FORMULA_NAME BART-PT-002-CTLCardinality-2024-03
FORMULA_NAME BART-PT-002-CTLCardinality-2024-04
FORMULA_NAME BART-PT-002-CTLCardinality-2024-05
FORMULA_NAME BART-PT-002-CTLCardinality-2024-06
FORMULA_NAME BART-PT-002-CTLCardinality-2024-07
FORMULA_NAME BART-PT-002-CTLCardinality-2024-08
FORMULA_NAME BART-PT-002-CTLCardinality-2024-09
FORMULA_NAME BART-PT-002-CTLCardinality-2024-10
FORMULA_NAME BART-PT-002-CTLCardinality-2024-11
FORMULA_NAME BART-PT-002-CTLCardinality-2024-12
FORMULA_NAME BART-PT-002-CTLCardinality-2024-13
FORMULA_NAME BART-PT-002-CTLCardinality-2024-14
FORMULA_NAME BART-PT-002-CTLCardinality-2024-15
=== Now, execution of the tool begins
BK_START 1716381787405
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-002
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-05-22 12:43:09] [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 12:43:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 12:43:09] [INFO ] Load time of PNML (sax parser for PT used): 263 ms
[2024-05-22 12:43:09] [INFO ] Transformed 474 places.
[2024-05-22 12:43:10] [INFO ] Transformed 404 transitions.
[2024-05-22 12:43:10] [INFO ] Found NUPN structural information;
[2024-05-22 12:43:10] [INFO ] Parsed PT model containing 474 places and 404 transitions and 3240 arcs in 615 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 108 ms.
Reduce places removed 210 places and 0 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA BART-PT-002-CTLCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-002-CTLCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-002-CTLCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 13 out of 264 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 264/264 places, 404/404 transitions.
Discarding 58 places :
Symmetric choice reduction at 0 with 58 rule applications. Total rules 58 place count 206 transition count 346
Iterating global reduction 0 with 58 rules applied. Total rules applied 116 place count 206 transition count 346
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 163 place count 159 transition count 299
Iterating global reduction 0 with 47 rules applied. Total rules applied 210 place count 159 transition count 299
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 217 place count 152 transition count 292
Iterating global reduction 0 with 7 rules applied. Total rules applied 224 place count 152 transition count 292
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 229 place count 147 transition count 287
Iterating global reduction 0 with 5 rules applied. Total rules applied 234 place count 147 transition count 287
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 239 place count 142 transition count 282
Iterating global reduction 0 with 5 rules applied. Total rules applied 244 place count 142 transition count 282
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 249 place count 137 transition count 277
Iterating global reduction 0 with 5 rules applied. Total rules applied 254 place count 137 transition count 277
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 259 place count 132 transition count 272
Iterating global reduction 0 with 5 rules applied. Total rules applied 264 place count 132 transition count 272
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 268 place count 128 transition count 268
Iterating global reduction 0 with 4 rules applied. Total rules applied 272 place count 128 transition count 268
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 276 place count 124 transition count 264
Iterating global reduction 0 with 4 rules applied. Total rules applied 280 place count 124 transition count 264
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 283 place count 121 transition count 261
Iterating global reduction 0 with 3 rules applied. Total rules applied 286 place count 121 transition count 261
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 288 place count 119 transition count 259
Iterating global reduction 0 with 2 rules applied. Total rules applied 290 place count 119 transition count 259
Applied a total of 290 rules in 168 ms. Remains 119 /264 variables (removed 145) and now considering 259/404 (removed 145) transitions.
// Phase 1: matrix 259 rows 119 cols
[2024-05-22 12:43:10] [INFO ] Computed 2 invariants in 38 ms
[2024-05-22 12:43:10] [INFO ] Implicit Places using invariants in 401 ms returned []
[2024-05-22 12:43:10] [INFO ] Invariant cache hit.
[2024-05-22 12:43:11] [INFO ] Implicit Places using invariants and state equation in 225 ms returned []
Implicit Place search using SMT with State Equation took 701 ms to find 0 implicit places.
Running 187 sub problems to find dead transitions.
[2024-05-22 12:43:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 1 (OVERLAPS) 2/119 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 3 (OVERLAPS) 259/378 variables, 119/121 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/378 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 5 (OVERLAPS) 0/378 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 187 unsolved
No progress, stopping.
After SMT solving in domain Real declared 378/378 variables, and 121 constraints, problems are : Problem set: 0 solved, 187 unsolved in 6058 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 119/119 constraints, PredecessorRefiner: 187/187 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 187 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 1 (OVERLAPS) 2/119 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 3 (OVERLAPS) 259/378 variables, 119/121 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/378 variables, 187/308 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/378 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 6 (OVERLAPS) 0/378 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 187 unsolved
No progress, stopping.
After SMT solving in domain Int declared 378/378 variables, and 308 constraints, problems are : Problem set: 0 solved, 187 unsolved in 5034 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 119/119 constraints, PredecessorRefiner: 187/187 constraints, Known Traps: 0/0 constraints]
After SMT, in 11229ms problems are : Problem set: 0 solved, 187 unsolved
Search for dead transitions found 0 dead transitions in 11275ms
Starting structural reductions in LTL mode, iteration 1 : 119/264 places, 259/404 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12189 ms. Remains : 119/264 places, 259/404 transitions.
Support contains 13 out of 119 places after structural reductions.
[2024-05-22 12:43:22] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2024-05-22 12:43:22] [INFO ] Flatten gal took : 88 ms
FORMULA BART-PT-002-CTLCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-002-CTLCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-002-CTLCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-002-CTLCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-002-CTLCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-22 12:43:22] [INFO ] Flatten gal took : 32 ms
[2024-05-22 12:43:23] [INFO ] Input system was already deterministic with 259 transitions.
Support contains 10 out of 119 places (down from 13) after GAL structural reductions.
FORMULA BART-PT-002-CTLCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 3024 steps (0 resets) in 324 ms. (9 steps per ms) remains 0/7 properties
[2024-05-22 12:43:23] [INFO ] Flatten gal took : 21 ms
[2024-05-22 12:43:23] [INFO ] Flatten gal took : 21 ms
[2024-05-22 12:43:23] [INFO ] Input system was already deterministic with 259 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 119/119 places, 259/259 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 112 transition count 252
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 112 transition count 252
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 21 place count 105 transition count 245
Iterating global reduction 0 with 7 rules applied. Total rules applied 28 place count 105 transition count 245
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 30 place count 103 transition count 243
Iterating global reduction 0 with 2 rules applied. Total rules applied 32 place count 103 transition count 243
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 102 transition count 242
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 102 transition count 242
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 101 transition count 241
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 101 transition count 241
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 100 transition count 240
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 100 transition count 240
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 99 transition count 239
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 99 transition count 239
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 98 transition count 238
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 98 transition count 238
Applied a total of 42 rules in 37 ms. Remains 98 /119 variables (removed 21) and now considering 238/259 (removed 21) transitions.
// Phase 1: matrix 238 rows 98 cols
[2024-05-22 12:43:23] [INFO ] Computed 2 invariants in 7 ms
[2024-05-22 12:43:23] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-22 12:43:23] [INFO ] Invariant cache hit.
[2024-05-22 12:43:23] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 178 ms to find 0 implicit places.
Running 166 sub problems to find dead transitions.
[2024-05-22 12:43:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 1 (OVERLAPS) 2/98 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 3 (OVERLAPS) 238/336 variables, 98/100 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/336 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 5 (OVERLAPS) 0/336 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 166 unsolved
No progress, stopping.
After SMT solving in domain Real declared 336/336 variables, and 100 constraints, problems are : Problem set: 0 solved, 166 unsolved in 5083 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 98/98 constraints, PredecessorRefiner: 166/166 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 166 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 1 (OVERLAPS) 2/98 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 3 (OVERLAPS) 238/336 variables, 98/100 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/336 variables, 166/266 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/336 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 6 (OVERLAPS) 0/336 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 166 unsolved
No progress, stopping.
After SMT solving in domain Int declared 336/336 variables, and 266 constraints, problems are : Problem set: 0 solved, 166 unsolved in 3039 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 98/98 constraints, PredecessorRefiner: 166/166 constraints, Known Traps: 0/0 constraints]
After SMT, in 8171ms problems are : Problem set: 0 solved, 166 unsolved
Search for dead transitions found 0 dead transitions in 8176ms
Starting structural reductions in LTL mode, iteration 1 : 98/119 places, 238/259 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8393 ms. Remains : 98/119 places, 238/259 transitions.
[2024-05-22 12:43:31] [INFO ] Flatten gal took : 12 ms
[2024-05-22 12:43:31] [INFO ] Flatten gal took : 11 ms
[2024-05-22 12:43:31] [INFO ] Input system was already deterministic with 238 transitions.
[2024-05-22 12:43:31] [INFO ] Flatten gal took : 12 ms
[2024-05-22 12:43:31] [INFO ] Flatten gal took : 10 ms
[2024-05-22 12:43:31] [INFO ] Time to serialize gal into /tmp/CTLCardinality251213616559647569.gal : 7 ms
[2024-05-22 12:43:31] [INFO ] Time to serialize properties into /tmp/CTLCardinality3235879676082298469.ctl : 3 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/CTLCardinality251213616559647569.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3235879676082298469.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,2401,0.05762,4252,2,384,5,4104,6,0,633,1950,0
Converting to forward existential form...Done !
original formula: AX(FALSE)
=> equivalent forward existential formula: [(EY(Init) * !(FALSE))] = FALSE
(forward)formula 0,0,0.06654,4252,1,0,6,4104,7,1,804,1950,1
FORMULA BART-PT-002-CTLCardinality-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 119/119 places, 259/259 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 112 transition count 252
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 112 transition count 252
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 21 place count 105 transition count 245
Iterating global reduction 0 with 7 rules applied. Total rules applied 28 place count 105 transition count 245
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 30 place count 103 transition count 243
Iterating global reduction 0 with 2 rules applied. Total rules applied 32 place count 103 transition count 243
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 102 transition count 242
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 102 transition count 242
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 101 transition count 241
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 101 transition count 241
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 100 transition count 240
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 100 transition count 240
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 99 transition count 239
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 99 transition count 239
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 98 transition count 238
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 98 transition count 238
Applied a total of 42 rules in 24 ms. Remains 98 /119 variables (removed 21) and now considering 238/259 (removed 21) transitions.
[2024-05-22 12:43:31] [INFO ] Invariant cache hit.
[2024-05-22 12:43:32] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-22 12:43:32] [INFO ] Invariant cache hit.
[2024-05-22 12:43:32] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 159 ms to find 0 implicit places.
Running 166 sub problems to find dead transitions.
[2024-05-22 12:43:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 1 (OVERLAPS) 2/98 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 3 (OVERLAPS) 238/336 variables, 98/100 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/336 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 5 (OVERLAPS) 0/336 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 166 unsolved
No progress, stopping.
After SMT solving in domain Real declared 336/336 variables, and 100 constraints, problems are : Problem set: 0 solved, 166 unsolved in 4334 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 98/98 constraints, PredecessorRefiner: 166/166 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 166 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 1 (OVERLAPS) 2/98 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 3 (OVERLAPS) 238/336 variables, 98/100 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/336 variables, 166/266 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/336 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 6 (OVERLAPS) 0/336 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 166 unsolved
No progress, stopping.
After SMT solving in domain Int declared 336/336 variables, and 266 constraints, problems are : Problem set: 0 solved, 166 unsolved in 3819 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 98/98 constraints, PredecessorRefiner: 166/166 constraints, Known Traps: 0/0 constraints]
After SMT, in 8186ms problems are : Problem set: 0 solved, 166 unsolved
Search for dead transitions found 0 dead transitions in 8189ms
Starting structural reductions in LTL mode, iteration 1 : 98/119 places, 238/259 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8373 ms. Remains : 98/119 places, 238/259 transitions.
[2024-05-22 12:43:40] [INFO ] Flatten gal took : 11 ms
[2024-05-22 12:43:40] [INFO ] Flatten gal took : 11 ms
[2024-05-22 12:43:40] [INFO ] Input system was already deterministic with 238 transitions.
[2024-05-22 12:43:40] [INFO ] Flatten gal took : 10 ms
[2024-05-22 12:43:40] [INFO ] Flatten gal took : 9 ms
[2024-05-22 12:43:40] [INFO ] Time to serialize gal into /tmp/CTLCardinality12287293370535156446.gal : 3 ms
[2024-05-22 12:43:40] [INFO ] Time to serialize properties into /tmp/CTLCardinality17052532517834024277.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/CTLCardinality12287293370535156446.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17052532517834024277.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 -...285
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,2401,0.043405,4412,2,384,5,4104,6,0,633,1950,0
Converting to forward existential form...Done !
original formula: EX(EX(TRUE))
=> equivalent forward existential formula: [(EY(EY(Init)) * TRUE)] != FALSE
(forward)formula 0,1,0.056674,4412,1,0,7,4104,7,1,894,1950,2
FORMULA BART-PT-002-CTLCardinality-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 119/119 places, 259/259 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 114 transition count 254
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 114 transition count 254
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 15 place count 109 transition count 249
Iterating global reduction 0 with 5 rules applied. Total rules applied 20 place count 109 transition count 249
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 107 transition count 247
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 107 transition count 247
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 106 transition count 246
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 106 transition count 246
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 105 transition count 245
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 105 transition count 245
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 104 transition count 244
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 104 transition count 244
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 103 transition count 243
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 103 transition count 243
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 102 transition count 242
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 102 transition count 242
Applied a total of 34 rules in 11 ms. Remains 102 /119 variables (removed 17) and now considering 242/259 (removed 17) transitions.
// Phase 1: matrix 242 rows 102 cols
[2024-05-22 12:43:40] [INFO ] Computed 2 invariants in 2 ms
[2024-05-22 12:43:40] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-22 12:43:40] [INFO ] Invariant cache hit.
[2024-05-22 12:43:40] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 139 ms to find 0 implicit places.
Running 170 sub problems to find dead transitions.
[2024-05-22 12:43:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 1 (OVERLAPS) 2/102 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 3 (OVERLAPS) 242/344 variables, 102/104 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/344 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 5 (OVERLAPS) 0/344 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 170 unsolved
No progress, stopping.
After SMT solving in domain Real declared 344/344 variables, and 104 constraints, problems are : Problem set: 0 solved, 170 unsolved in 4859 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 102/102 constraints, PredecessorRefiner: 170/170 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 170 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 1 (OVERLAPS) 2/102 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 3 (OVERLAPS) 242/344 variables, 102/104 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/344 variables, 170/274 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/344 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 6 (OVERLAPS) 0/344 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 170 unsolved
No progress, stopping.
After SMT solving in domain Int declared 344/344 variables, and 274 constraints, problems are : Problem set: 0 solved, 170 unsolved in 3806 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 102/102 constraints, PredecessorRefiner: 170/170 constraints, Known Traps: 0/0 constraints]
After SMT, in 8703ms problems are : Problem set: 0 solved, 170 unsolved
Search for dead transitions found 0 dead transitions in 8706ms
Starting structural reductions in LTL mode, iteration 1 : 102/119 places, 242/259 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8858 ms. Remains : 102/119 places, 242/259 transitions.
[2024-05-22 12:43:49] [INFO ] Flatten gal took : 15 ms
[2024-05-22 12:43:49] [INFO ] Flatten gal took : 16 ms
[2024-05-22 12:43:49] [INFO ] Input system was already deterministic with 242 transitions.
[2024-05-22 12:43:49] [INFO ] Flatten gal took : 13 ms
[2024-05-22 12:43:49] [INFO ] Flatten gal took : 13 ms
[2024-05-22 12:43:49] [INFO ] Time to serialize gal into /tmp/CTLCardinality7060007240840009049.gal : 3 ms
[2024-05-22 12:43:49] [INFO ] Time to serialize properties into /tmp/CTLCardinality11449051704595830247.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/CTLCardinality7060007240840009049.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11449051704595830247.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,2597,0.04582,4432,2,400,5,4418,6,0,653,2142,0
Converting to forward existential form...Done !
original formula: EG((EG(EX(((TrainState_2_1_28==0)||((TrainState_2_3_34==0)&&(TrainState_2_3_22==1))))) + EX(TRUE)))
=> equivalent forward existential formula: [FwdG(Init,(EG(EX(((TrainState_2_1_28==0)||((TrainState_2_3_34==0)&&(TrainState_2_3_22==1))))) + EX(TRUE)))] != ...160
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.159491,7652,1,0,6,21805,18,1,2717,5857,10
FORMULA BART-PT-002-CTLCardinality-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 119/119 places, 259/259 transitions.
Graph (trivial) has 255 edges and 119 vertex of which 118 / 119 are part of one of the 2 SCC in 5 ms
Free SCC test removed 116 places
Ensure Unique test removed 255 transitions
Reduce isomorphic transitions removed 255 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 2 transition count 3
Applied a total of 2 rules in 32 ms. Remains 2 /119 variables (removed 117) and now considering 3/259 (removed 256) transitions.
// Phase 1: matrix 3 rows 2 cols
[2024-05-22 12:43:49] [INFO ] Computed 1 invariants in 0 ms
[2024-05-22 12:43:49] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-05-22 12:43:49] [INFO ] Invariant cache hit.
[2024-05-22 12:43:49] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
[2024-05-22 12:43:49] [INFO ] Redundant transitions in 0 ms returned []
Running 1 sub problems to find dead transitions.
[2024-05-22 12:43:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/4 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4/5 variables, and 3 constraints, problems are : Problem set: 0 solved, 1 unsolved in 26 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/4 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4/5 variables, and 4 constraints, problems are : Problem set: 0 solved, 1 unsolved in 25 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 53ms problems are : Problem set: 0 solved, 1 unsolved
Search for dead transitions found 0 dead transitions in 53ms
Starting structural reductions in SI_CTL mode, iteration 1 : 2/119 places, 3/259 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 131 ms. Remains : 2/119 places, 3/259 transitions.
[2024-05-22 12:43:49] [INFO ] Flatten gal took : 1 ms
[2024-05-22 12:43:49] [INFO ] Flatten gal took : 0 ms
[2024-05-22 12:43:49] [INFO ] Input system was already deterministic with 3 transitions.
[2024-05-22 12:43:49] [INFO ] Flatten gal took : 1 ms
[2024-05-22 12:43:49] [INFO ] Flatten gal took : 1 ms
[2024-05-22 12:43:49] [INFO ] Time to serialize gal into /tmp/CTLCardinality14385300006354395246.gal : 3 ms
[2024-05-22 12:43:49] [INFO ] Time to serialize properties into /tmp/CTLCardinality4083113585557618303.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/CTLCardinality14385300006354395246.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4083113585557618303.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,0.001749,3276,2,4,5,12,5,0,12,6,0
Converting to forward existential form...Done !
original formula: AF(AG((TrainState_2_1_17!=0)))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !((TrainState_2_1_17!=0))))))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.002627,3592,1,0,5,19,17,1,46,11,10
FORMULA BART-PT-002-CTLCardinality-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 119/119 places, 259/259 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 113 transition count 253
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 113 transition count 253
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 107 transition count 247
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 107 transition count 247
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 26 place count 105 transition count 245
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 105 transition count 245
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 104 transition count 244
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 104 transition count 244
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 103 transition count 243
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 103 transition count 243
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 102 transition count 242
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 102 transition count 242
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 101 transition count 241
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 101 transition count 241
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 100 transition count 240
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 100 transition count 240
Applied a total of 38 rules in 13 ms. Remains 100 /119 variables (removed 19) and now considering 240/259 (removed 19) transitions.
// Phase 1: matrix 240 rows 100 cols
[2024-05-22 12:43:49] [INFO ] Computed 2 invariants in 3 ms
[2024-05-22 12:43:49] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-22 12:43:49] [INFO ] Invariant cache hit.
[2024-05-22 12:43:49] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 174 ms to find 0 implicit places.
Running 168 sub problems to find dead transitions.
[2024-05-22 12:43:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 1 (OVERLAPS) 2/100 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 3 (OVERLAPS) 240/340 variables, 100/102 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/340 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 5 (OVERLAPS) 0/340 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 168 unsolved
No progress, stopping.
After SMT solving in domain Real declared 340/340 variables, and 102 constraints, problems are : Problem set: 0 solved, 168 unsolved in 4391 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 168/168 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 168 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 1 (OVERLAPS) 2/100 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 3 (OVERLAPS) 240/340 variables, 100/102 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/340 variables, 168/270 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/340 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 6 (OVERLAPS) 0/340 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 168 unsolved
No progress, stopping.
After SMT solving in domain Int declared 340/340 variables, and 270 constraints, problems are : Problem set: 0 solved, 168 unsolved in 5024 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 168/168 constraints, Known Traps: 0/0 constraints]
After SMT, in 9460ms problems are : Problem set: 0 solved, 168 unsolved
Search for dead transitions found 0 dead transitions in 9464ms
Starting structural reductions in LTL mode, iteration 1 : 100/119 places, 240/259 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9652 ms. Remains : 100/119 places, 240/259 transitions.
[2024-05-22 12:43:59] [INFO ] Flatten gal took : 15 ms
[2024-05-22 12:43:59] [INFO ] Flatten gal took : 14 ms
[2024-05-22 12:43:59] [INFO ] Input system was already deterministic with 240 transitions.
[2024-05-22 12:43:59] [INFO ] Flatten gal took : 12 ms
[2024-05-22 12:43:59] [INFO ] Flatten gal took : 12 ms
[2024-05-22 12:43:59] [INFO ] Time to serialize gal into /tmp/CTLCardinality1196536124653699978.gal : 4 ms
[2024-05-22 12:43:59] [INFO ] Time to serialize properties into /tmp/CTLCardinality804883760605139810.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/CTLCardinality1196536124653699978.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality804883760605139810.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,2499,0.04796,4420,2,392,5,4258,6,0,643,2082,0
Converting to forward existential form...Done !
original formula: EX(EX(!(A((TrainState_1_1_38==0) U ((TrainState_1_2_28==0)||(TrainState_1_3_26==1))))))
=> equivalent forward existential formula: ([(FwdU(EY(EY(Init)),!(((TrainState_1_2_28==0)||(TrainState_1_3_26==1)))) * (!((TrainState_1_1_38==0)) * !(((Tra...296
Hit Full ! (commute/partial/dont) 237/2/3
(forward)formula 0,1,0.166325,7640,1,0,9,21787,24,1,2691,6040,10
FORMULA BART-PT-002-CTLCardinality-2024-12 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 : 119/119 places, 259/259 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 112 transition count 252
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 112 transition count 252
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 21 place count 105 transition count 245
Iterating global reduction 0 with 7 rules applied. Total rules applied 28 place count 105 transition count 245
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 30 place count 103 transition count 243
Iterating global reduction 0 with 2 rules applied. Total rules applied 32 place count 103 transition count 243
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 102 transition count 242
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 102 transition count 242
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 101 transition count 241
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 101 transition count 241
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 100 transition count 240
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 100 transition count 240
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 99 transition count 239
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 99 transition count 239
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 98 transition count 238
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 98 transition count 238
Applied a total of 42 rules in 15 ms. Remains 98 /119 variables (removed 21) and now considering 238/259 (removed 21) transitions.
// Phase 1: matrix 238 rows 98 cols
[2024-05-22 12:43:59] [INFO ] Computed 2 invariants in 2 ms
[2024-05-22 12:43:59] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-22 12:43:59] [INFO ] Invariant cache hit.
[2024-05-22 12:43:59] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
Running 166 sub problems to find dead transitions.
[2024-05-22 12:43:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 1 (OVERLAPS) 2/98 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 3 (OVERLAPS) 238/336 variables, 98/100 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/336 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 5 (OVERLAPS) 0/336 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 166 unsolved
No progress, stopping.
After SMT solving in domain Real declared 336/336 variables, and 100 constraints, problems are : Problem set: 0 solved, 166 unsolved in 5151 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 98/98 constraints, PredecessorRefiner: 166/166 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 166 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 1 (OVERLAPS) 2/98 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 3 (OVERLAPS) 238/336 variables, 98/100 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/336 variables, 166/266 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/336 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 6 (OVERLAPS) 0/336 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 166 unsolved
No progress, stopping.
After SMT solving in domain Int declared 336/336 variables, and 266 constraints, problems are : Problem set: 0 solved, 166 unsolved in 3563 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 98/98 constraints, PredecessorRefiner: 166/166 constraints, Known Traps: 0/0 constraints]
After SMT, in 8758ms problems are : Problem set: 0 solved, 166 unsolved
Search for dead transitions found 0 dead transitions in 8763ms
Starting structural reductions in LTL mode, iteration 1 : 98/119 places, 238/259 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8951 ms. Remains : 98/119 places, 238/259 transitions.
[2024-05-22 12:44:08] [INFO ] Flatten gal took : 7 ms
[2024-05-22 12:44:08] [INFO ] Flatten gal took : 8 ms
[2024-05-22 12:44:08] [INFO ] Input system was already deterministic with 238 transitions.
[2024-05-22 12:44:08] [INFO ] Flatten gal took : 8 ms
[2024-05-22 12:44:08] [INFO ] Flatten gal took : 8 ms
[2024-05-22 12:44:08] [INFO ] Time to serialize gal into /tmp/CTLCardinality670550812001170630.gal : 2 ms
[2024-05-22 12:44:08] [INFO ] Time to serialize properties into /tmp/CTLCardinality12010841717644362912.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/CTLCardinality670550812001170630.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12010841717644362912.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.
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,2401,0.041821,4412,2,384,5,4104,6,0,633,1950,0
Converting to forward existential form...Done !
original formula: AX(FALSE)
=> equivalent forward existential formula: [(EY(Init) * !(FALSE))] = FALSE
(forward)formula 0,0,0.050814,4412,1,0,6,4104,7,1,804,1950,1
FORMULA BART-PT-002-CTLCardinality-2024-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 119/119 places, 259/259 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 113 transition count 253
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 113 transition count 253
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 107 transition count 247
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 107 transition count 247
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 106 transition count 246
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 106 transition count 246
Applied a total of 26 rules in 4 ms. Remains 106 /119 variables (removed 13) and now considering 246/259 (removed 13) transitions.
// Phase 1: matrix 246 rows 106 cols
[2024-05-22 12:44:08] [INFO ] Computed 2 invariants in 2 ms
[2024-05-22 12:44:08] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-22 12:44:08] [INFO ] Invariant cache hit.
[2024-05-22 12:44:08] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 143 ms to find 0 implicit places.
Running 174 sub problems to find dead transitions.
[2024-05-22 12:44:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 1 (OVERLAPS) 2/106 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 3 (OVERLAPS) 246/352 variables, 106/108 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 5 (OVERLAPS) 0/352 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 174 unsolved
No progress, stopping.
After SMT solving in domain Real declared 352/352 variables, and 108 constraints, problems are : Problem set: 0 solved, 174 unsolved in 5108 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 106/106 constraints, PredecessorRefiner: 174/174 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 174 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 1 (OVERLAPS) 2/106 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 3 (OVERLAPS) 246/352 variables, 106/108 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 174/282 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/352 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 6 (OVERLAPS) 0/352 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 174 unsolved
No progress, stopping.
After SMT solving in domain Int declared 352/352 variables, and 282 constraints, problems are : Problem set: 0 solved, 174 unsolved in 3315 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 106/106 constraints, PredecessorRefiner: 174/174 constraints, Known Traps: 0/0 constraints]
After SMT, in 8454ms problems are : Problem set: 0 solved, 174 unsolved
Search for dead transitions found 0 dead transitions in 8456ms
Starting structural reductions in LTL mode, iteration 1 : 106/119 places, 246/259 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8604 ms. Remains : 106/119 places, 246/259 transitions.
[2024-05-22 12:44:17] [INFO ] Flatten gal took : 7 ms
[2024-05-22 12:44:17] [INFO ] Flatten gal took : 7 ms
[2024-05-22 12:44:17] [INFO ] Input system was already deterministic with 246 transitions.
[2024-05-22 12:44:17] [INFO ] Flatten gal took : 8 ms
[2024-05-22 12:44:17] [INFO ] Flatten gal took : 10 ms
[2024-05-22 12:44:17] [INFO ] Time to serialize gal into /tmp/CTLCardinality17458856253364848822.gal : 4 ms
[2024-05-22 12:44:17] [INFO ] Time to serialize properties into /tmp/CTLCardinality1280205962849799410.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/CTLCardinality17458856253364848822.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1280205962849799410.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,2793,0.049302,4768,2,418,5,5312,6,0,673,2840,0
Converting to forward existential form...Done !
original formula: EG(((TrainState_1_1_22==0) * (EX((TrainState_1_4_11==0)) + AG((TrainState_1_1_6==0)))))
=> equivalent forward existential formula: [FwdG(Init,((TrainState_1_1_22==0) * (EX((TrainState_1_4_11==0)) + !(E(TRUE U !((TrainState_1_1_6==0)))))))] != ...160
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.274516,11368,1,0,31,43147,23,21,2803,25835,34
FORMULA BART-PT-002-CTLCardinality-2024-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
[2024-05-22 12:44:17] [INFO ] Flatten gal took : 11 ms
[2024-05-22 12:44:17] [INFO ] Flatten gal took : 10 ms
Total runtime 68372 ms.
BK_STOP 1716381857789
--------------------
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-002"
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-002, 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-171620167700441"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BART-PT-002.tgz
mv BART-PT-002 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 ;