About the Execution of ITS-Tools for DBSingleClientW-PT-d2m04
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
754.640 | 65983.00 | 94898.00 | 299.90 | TFFFFFFFFFFTFTTF | 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.r092-tall-171624189500547.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 DBSingleClientW-PT-d2m04, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r092-tall-171624189500547
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 34K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 22 14:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 12 12:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 151K Apr 12 12:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Apr 12 12:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K Apr 12 12:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1.6M 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 DBSingleClientW-PT-d2m04-LTLCardinality-00
FORMULA_NAME DBSingleClientW-PT-d2m04-LTLCardinality-01
FORMULA_NAME DBSingleClientW-PT-d2m04-LTLCardinality-02
FORMULA_NAME DBSingleClientW-PT-d2m04-LTLCardinality-03
FORMULA_NAME DBSingleClientW-PT-d2m04-LTLCardinality-04
FORMULA_NAME DBSingleClientW-PT-d2m04-LTLCardinality-05
FORMULA_NAME DBSingleClientW-PT-d2m04-LTLCardinality-06
FORMULA_NAME DBSingleClientW-PT-d2m04-LTLCardinality-07
FORMULA_NAME DBSingleClientW-PT-d2m04-LTLCardinality-08
FORMULA_NAME DBSingleClientW-PT-d2m04-LTLCardinality-09
FORMULA_NAME DBSingleClientW-PT-d2m04-LTLCardinality-10
FORMULA_NAME DBSingleClientW-PT-d2m04-LTLCardinality-11
FORMULA_NAME DBSingleClientW-PT-d2m04-LTLCardinality-12
FORMULA_NAME DBSingleClientW-PT-d2m04-LTLCardinality-13
FORMULA_NAME DBSingleClientW-PT-d2m04-LTLCardinality-14
FORMULA_NAME DBSingleClientW-PT-d2m04-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1716325692174
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DBSingleClientW-PT-d2m04
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-05-21 21:08:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 21:08:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 21:08:13] [INFO ] Load time of PNML (sax parser for PT used): 201 ms
[2024-05-21 21:08:13] [INFO ] Transformed 4763 places.
[2024-05-21 21:08:13] [INFO ] Transformed 2478 transitions.
[2024-05-21 21:08:13] [INFO ] Parsed PT model containing 4763 places and 2478 transitions and 9912 arcs in 312 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 3580 places in 25 ms
Reduce places removed 3580 places and 0 transitions.
FORMULA DBSingleClientW-PT-d2m04-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m04-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m04-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m04-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m04-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m04-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m04-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m04-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m04-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m04-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m04-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m04-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m04-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 3 out of 1183 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1183/1183 places, 2478/2478 transitions.
Reduce places removed 46 places and 0 transitions.
Ensure Unique test removed 199 transitions
Reduce isomorphic transitions removed 199 transitions.
Iterating post reduction 0 with 245 rules applied. Total rules applied 245 place count 1137 transition count 2279
Discarding 390 places :
Symmetric choice reduction at 1 with 390 rule applications. Total rules 635 place count 747 transition count 1210
Iterating global reduction 1 with 390 rules applied. Total rules applied 1025 place count 747 transition count 1210
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 1034 place count 747 transition count 1201
Discarding 316 places :
Symmetric choice reduction at 2 with 316 rule applications. Total rules 1350 place count 431 transition count 885
Iterating global reduction 2 with 316 rules applied. Total rules applied 1666 place count 431 transition count 885
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 1678 place count 431 transition count 873
Discarding 241 places :
Symmetric choice reduction at 3 with 241 rule applications. Total rules 1919 place count 190 transition count 531
Iterating global reduction 3 with 241 rules applied. Total rules applied 2160 place count 190 transition count 531
Ensure Unique test removed 212 transitions
Reduce isomorphic transitions removed 212 transitions.
Iterating post reduction 3 with 212 rules applied. Total rules applied 2372 place count 190 transition count 319
Discarding 24 places :
Symmetric choice reduction at 4 with 24 rule applications. Total rules 2396 place count 166 transition count 274
Iterating global reduction 4 with 24 rules applied. Total rules applied 2420 place count 166 transition count 274
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 2426 place count 166 transition count 268
Discarding 16 places :
Symmetric choice reduction at 5 with 16 rule applications. Total rules 2442 place count 150 transition count 252
Iterating global reduction 5 with 16 rules applied. Total rules applied 2458 place count 150 transition count 252
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 2462 place count 150 transition count 248
Discarding 13 places :
Symmetric choice reduction at 6 with 13 rule applications. Total rules 2475 place count 137 transition count 235
Iterating global reduction 6 with 13 rules applied. Total rules applied 2488 place count 137 transition count 235
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 6 with 13 rules applied. Total rules applied 2501 place count 137 transition count 222
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 2507 place count 131 transition count 187
Iterating global reduction 7 with 6 rules applied. Total rules applied 2513 place count 131 transition count 187
Applied a total of 2513 rules in 186 ms. Remains 131 /1183 variables (removed 1052) and now considering 187/2478 (removed 2291) transitions.
// Phase 1: matrix 187 rows 131 cols
[2024-05-21 21:08:14] [INFO ] Computed 2 invariants in 17 ms
[2024-05-21 21:08:14] [INFO ] Implicit Places using invariants in 572 ms returned []
[2024-05-21 21:08:14] [INFO ] Invariant cache hit.
[2024-05-21 21:08:14] [INFO ] State equation strengthened by 63 read => feed constraints.
[2024-05-21 21:08:14] [INFO ] Implicit Places using invariants and state equation in 355 ms returned []
Implicit Place search using SMT with State Equation took 957 ms to find 0 implicit places.
Running 186 sub problems to find dead transitions.
[2024-05-21 21:08:14] [INFO ] Invariant cache hit.
[2024-05-21 21:08:15] [INFO ] State equation strengthened by 63 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 2 (OVERLAPS) 1/131 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/131 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 4 (OVERLAPS) 187/318 variables, 131/133 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/318 variables, 63/196 constraints. Problems are: Problem set: 0 solved, 186 unsolved
[2024-05-21 21:08:18] [INFO ] Deduced a trap composed of 54 places in 86 ms of which 14 ms to minimize.
[2024-05-21 21:08:19] [INFO ] Deduced a trap composed of 59 places in 65 ms of which 2 ms to minimize.
[2024-05-21 21:08:19] [INFO ] Deduced a trap composed of 59 places in 73 ms of which 1 ms to minimize.
[2024-05-21 21:08:19] [INFO ] Deduced a trap composed of 57 places in 51 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/318 variables, 4/200 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/318 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 8 (OVERLAPS) 0/318 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 186 unsolved
No progress, stopping.
After SMT solving in domain Real declared 318/318 variables, and 200 constraints, problems are : Problem set: 0 solved, 186 unsolved in 7484 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 131/131 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 186/186 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 186 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 2 (OVERLAPS) 1/131 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/131 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/131 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 5 (OVERLAPS) 187/318 variables, 131/137 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/318 variables, 63/200 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/318 variables, 186/386 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/318 variables, 0/386 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 9 (OVERLAPS) 0/318 variables, 0/386 constraints. Problems are: Problem set: 0 solved, 186 unsolved
No progress, stopping.
After SMT solving in domain Int declared 318/318 variables, and 386 constraints, problems are : Problem set: 0 solved, 186 unsolved in 12501 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 131/131 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 186/186 constraints, Known Traps: 4/4 constraints]
After SMT, in 20486ms problems are : Problem set: 0 solved, 186 unsolved
Search for dead transitions found 0 dead transitions in 20503ms
Starting structural reductions in LTL mode, iteration 1 : 131/1183 places, 187/2478 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21666 ms. Remains : 131/1183 places, 187/2478 transitions.
Support contains 3 out of 131 places after structural reductions.
[2024-05-21 21:08:35] [INFO ] Flatten gal took : 38 ms
[2024-05-21 21:08:35] [INFO ] Flatten gal took : 15 ms
[2024-05-21 21:08:35] [INFO ] Input system was already deterministic with 187 transitions.
RANDOM walk for 40000 steps (9141 resets) in 1809 ms. (22 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (3832 resets) in 190 ms. (209 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (3787 resets) in 90 ms. (439 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (3834 resets) in 70 ms. (563 steps per ms) remains 3/3 properties
Probably explored full state space saw : 25274 states, properties seen :1
Probabilistic random walk after 59836 steps, saw 25274 distinct states, run finished after 371 ms. (steps per millisecond=161 ) properties seen :1
Explored full state space saw : 25333 states, properties seen :0
Exhaustive walk after 59897 steps, saw 25333 distinct states, run finished after 208 ms. (steps per millisecond=287 ) properties seen :0
Successfully simplified 2 atomic propositions for a total of 3 simplifications.
FORMULA DBSingleClientW-PT-d2m04-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m04-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 5 stabilizing places and 17 stable transitions
Graph (complete) has 472 edges and 131 vertex of which 130 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 131 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 131/131 places, 187/187 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 130 transition count 186
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 130 transition count 186
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 129 transition count 185
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 129 transition count 185
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 128 transition count 184
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 128 transition count 184
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 127 transition count 182
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 127 transition count 182
Applied a total of 8 rules in 44 ms. Remains 127 /131 variables (removed 4) and now considering 182/187 (removed 5) transitions.
// Phase 1: matrix 182 rows 127 cols
[2024-05-21 21:08:37] [INFO ] Computed 2 invariants in 3 ms
[2024-05-21 21:08:37] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-05-21 21:08:37] [INFO ] Invariant cache hit.
[2024-05-21 21:08:37] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-05-21 21:08:37] [INFO ] Implicit Places using invariants and state equation in 238 ms returned []
Implicit Place search using SMT with State Equation took 328 ms to find 0 implicit places.
[2024-05-21 21:08:37] [INFO ] Redundant transitions in 7 ms returned []
Running 181 sub problems to find dead transitions.
[2024-05-21 21:08:37] [INFO ] Invariant cache hit.
[2024-05-21 21:08:37] [INFO ] State equation strengthened by 60 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (OVERLAPS) 1/127 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (OVERLAPS) 182/309 variables, 127/129 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/309 variables, 60/189 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-21 21:08:40] [INFO ] Deduced a trap composed of 12 places in 61 ms of which 1 ms to minimize.
[2024-05-21 21:08:40] [INFO ] Deduced a trap composed of 60 places in 84 ms of which 1 ms to minimize.
[2024-05-21 21:08:40] [INFO ] Deduced a trap composed of 60 places in 67 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/309 variables, 3/192 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/309 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 8 (OVERLAPS) 0/309 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 181 unsolved
No progress, stopping.
After SMT solving in domain Real declared 309/309 variables, and 192 constraints, problems are : Problem set: 0 solved, 181 unsolved in 6581 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 127/127 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 181 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (OVERLAPS) 1/127 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 6 (OVERLAPS) 182/309 variables, 127/132 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/309 variables, 60/192 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/309 variables, 181/373 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/309 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 10 (OVERLAPS) 0/309 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 181 unsolved
No progress, stopping.
After SMT solving in domain Int declared 309/309 variables, and 373 constraints, problems are : Problem set: 0 solved, 181 unsolved in 11646 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 127/127 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 3/3 constraints]
After SMT, in 18527ms problems are : Problem set: 0 solved, 181 unsolved
Search for dead transitions found 0 dead transitions in 18530ms
Starting structural reductions in SI_LTL mode, iteration 1 : 127/131 places, 182/187 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 18914 ms. Remains : 127/131 places, 182/187 transitions.
Stuttering acceptance computed with spot in 214 ms :[(NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m04-LTLCardinality-10
Product exploration explored 100000 steps with 23110 reset in 229 ms.
Product exploration explored 100000 steps with 23000 reset in 191 ms.
Computed a total of 5 stabilizing places and 16 stable transitions
Graph (complete) has 461 edges and 127 vertex of which 126 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 16 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 78 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
RANDOM walk for 40000 steps (9157 resets) in 130 ms. (305 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (3834 resets) in 82 ms. (481 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 11509 steps, run visited all 1 properties in 22 ms. (steps per millisecond=523 )
Probabilistic random walk after 11509 steps, saw 5473 distinct states, run finished after 25 ms. (steps per millisecond=460 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 110 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Support contains 1 out of 127 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 127/127 places, 182/182 transitions.
Applied a total of 0 rules in 16 ms. Remains 127 /127 variables (removed 0) and now considering 182/182 (removed 0) transitions.
[2024-05-21 21:08:57] [INFO ] Invariant cache hit.
[2024-05-21 21:08:57] [INFO ] Implicit Places using invariants in 179 ms returned []
[2024-05-21 21:08:57] [INFO ] Invariant cache hit.
[2024-05-21 21:08:57] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-05-21 21:08:57] [INFO ] Implicit Places using invariants and state equation in 220 ms returned []
Implicit Place search using SMT with State Equation took 402 ms to find 0 implicit places.
[2024-05-21 21:08:57] [INFO ] Redundant transitions in 7 ms returned []
Running 181 sub problems to find dead transitions.
[2024-05-21 21:08:57] [INFO ] Invariant cache hit.
[2024-05-21 21:08:57] [INFO ] State equation strengthened by 60 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (OVERLAPS) 1/127 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (OVERLAPS) 182/309 variables, 127/129 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/309 variables, 60/189 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-21 21:09:00] [INFO ] Deduced a trap composed of 12 places in 75 ms of which 13 ms to minimize.
[2024-05-21 21:09:00] [INFO ] Deduced a trap composed of 60 places in 70 ms of which 13 ms to minimize.
[2024-05-21 21:09:01] [INFO ] Deduced a trap composed of 60 places in 68 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/309 variables, 3/192 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/309 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 8 (OVERLAPS) 0/309 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 181 unsolved
No progress, stopping.
After SMT solving in domain Real declared 309/309 variables, and 192 constraints, problems are : Problem set: 0 solved, 181 unsolved in 6635 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 127/127 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 181 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (OVERLAPS) 1/127 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 6 (OVERLAPS) 182/309 variables, 127/132 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/309 variables, 60/192 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/309 variables, 181/373 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/309 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 10 (OVERLAPS) 0/309 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 181 unsolved
No progress, stopping.
After SMT solving in domain Int declared 309/309 variables, and 373 constraints, problems are : Problem set: 0 solved, 181 unsolved in 11556 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 127/127 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 3/3 constraints]
After SMT, in 18449ms problems are : Problem set: 0 solved, 181 unsolved
Search for dead transitions found 0 dead transitions in 18453ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 18883 ms. Remains : 127/127 places, 182/182 transitions.
Computed a total of 5 stabilizing places and 16 stable transitions
Graph (complete) has 461 edges and 127 vertex of which 126 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.7 ms
Computed a total of 5 stabilizing places and 16 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 90 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
RANDOM walk for 40000 steps (9181 resets) in 193 ms. (206 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (3850 resets) in 45 ms. (869 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 11509 steps, run visited all 1 properties in 45 ms. (steps per millisecond=255 )
Probabilistic random walk after 11509 steps, saw 5473 distinct states, run finished after 45 ms. (steps per millisecond=255 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 113 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Product exploration explored 100000 steps with 23088 reset in 133 ms.
Product exploration explored 100000 steps with 22984 reset in 174 ms.
Built C files in :
/tmp/ltsmin11017246547824662973
[2024-05-21 21:09:16] [INFO ] Computing symmetric may disable matrix : 182 transitions.
[2024-05-21 21:09:16] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:09:16] [INFO ] Computing symmetric may enable matrix : 182 transitions.
[2024-05-21 21:09:16] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:09:16] [INFO ] Computing Do-Not-Accords matrix : 182 transitions.
[2024-05-21 21:09:16] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:09:16] [INFO ] Built C files in 56ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11017246547824662973
Running compilation step : cd /tmp/ltsmin11017246547824662973;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 733 ms.
Running link step : cd /tmp/ltsmin11017246547824662973;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin11017246547824662973;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased9641466765170836183.hoa' '--buchi-type=spotba'
LTSmin run took 421 ms.
FORMULA DBSingleClientW-PT-d2m04-LTLCardinality-10 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DBSingleClientW-PT-d2m04-LTLCardinality-10 finished in 40972 ms.
All properties solved by simple procedures.
Total runtime 64781 ms.
BK_STOP 1716325758157
--------------------
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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="DBSingleClientW-PT-d2m04"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
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 DBSingleClientW-PT-d2m04, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r092-tall-171624189500547"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DBSingleClientW-PT-d2m04.tgz
mv DBSingleClientW-PT-d2m04 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;