About the Execution of ITS-Tools for BridgeAndVehicles-PT-V20P10N50
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
0.000 | 178529.00 | 0.00 | 0.00 | ??T????F???F???? | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2024-input.r048-tajo-171620399000196.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is BridgeAndVehicles-PT-V20P10N50, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r048-tajo-171620399000196
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.8M
-rw-r--r-- 1 mcc users 16K Apr 13 02:42 CTLCardinality.txt
-rw-r--r-- 1 mcc users 101K Apr 13 02:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 400K Apr 13 02:37 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.5M Apr 13 02:37 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 8.4K Apr 22 14:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 42K Apr 22 14:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 144K Apr 22 14:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 406K Apr 22 14:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 30K Apr 13 03:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 206K Apr 13 03:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 227K Apr 13 03:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 886K Apr 13 03:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.6K Apr 22 14:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.8K 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 10 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1.8M 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 BridgeAndVehicles-PT-V20P10N50-LTLFireability-00
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-LTLFireability-01
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-LTLFireability-02
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-LTLFireability-03
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-LTLFireability-04
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-LTLFireability-05
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-LTLFireability-06
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-LTLFireability-07
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-LTLFireability-08
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-LTLFireability-09
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-LTLFireability-10
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-LTLFireability-11
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-LTLFireability-12
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-LTLFireability-13
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-LTLFireability-14
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1716326440038
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-PT-V20P10N50
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-21 21:20:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 21:20:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 21:20:43] [INFO ] Load time of PNML (sax parser for PT used): 439 ms
[2024-05-21 21:20:43] [INFO ] Transformed 108 places.
[2024-05-21 21:20:43] [INFO ] Transformed 2228 transitions.
[2024-05-21 21:20:43] [INFO ] Parsed PT model containing 108 places and 2228 transitions and 17190 arcs in 678 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 82 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA BridgeAndVehicles-PT-V20P10N50-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P10N50-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 106 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 2228/2228 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 106 transition count 2228
Applied a total of 2 rules in 96 ms. Remains 106 /108 variables (removed 2) and now considering 2228/2228 (removed 0) transitions.
Running 2225 sub problems to find dead transitions.
[2024-05-21 21:20:44] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 106 cols
[2024-05-21 21:20:44] [INFO ] Computed 5 invariants in 18 ms
[2024-05-21 21:20:44] [INFO ] State equation strengthened by 102 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2225 unsolved
[2024-05-21 21:21:13] [INFO ] Deduced a trap composed of 5 places in 386 ms of which 13 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 106/396 variables, and 6 constraints, problems are : Problem set: 0 solved, 2225 unsolved in 20176 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/106 constraints, ReadFeed: 0/102 constraints, PredecessorRefiner: 2225/2225 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2225 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2225 unsolved
[2024-05-21 21:21:39] [INFO ] Deduced a trap composed of 55 places in 235 ms of which 3 ms to minimize.
Problem TDEAD1188 is UNSAT
Problem TDEAD1189 is UNSAT
Problem TDEAD1190 is UNSAT
Problem TDEAD1191 is UNSAT
Problem TDEAD1192 is UNSAT
Problem TDEAD1193 is UNSAT
Problem TDEAD1194 is UNSAT
Problem TDEAD1195 is UNSAT
Problem TDEAD1196 is UNSAT
Problem TDEAD1197 is UNSAT
Problem TDEAD1198 is UNSAT
Problem TDEAD1199 is UNSAT
Problem TDEAD1200 is UNSAT
Problem TDEAD1201 is UNSAT
Problem TDEAD1202 is UNSAT
Problem TDEAD1203 is UNSAT
Problem TDEAD1204 is UNSAT
Problem TDEAD1205 is UNSAT
Problem TDEAD1206 is UNSAT
Problem TDEAD1207 is UNSAT
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 106/396 variables, and 7 constraints, problems are : Problem set: 20 solved, 2205 unsolved in 20048 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/106 constraints, ReadFeed: 0/102 constraints, PredecessorRefiner: 0/2225 constraints, Known Traps: 2/2 constraints]
After SMT, in 58817ms problems are : Problem set: 20 solved, 2205 unsolved
Search for dead transitions found 20 dead transitions in 58922ms
Found 20 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 20 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 20 transitions.
[2024-05-21 21:21:43] [INFO ] Flow matrix only has 289 transitions (discarded 1919 similar events)
// Phase 1: matrix 289 rows 106 cols
[2024-05-21 21:21:43] [INFO ] Computed 5 invariants in 7 ms
[2024-05-21 21:21:43] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-21 21:21:43] [INFO ] Flow matrix only has 289 transitions (discarded 1919 similar events)
[2024-05-21 21:21:43] [INFO ] Invariant cache hit.
[2024-05-21 21:21:43] [INFO ] State equation strengthened by 101 read => feed constraints.
[2024-05-21 21:21:43] [INFO ] Implicit Places using invariants and state equation in 151 ms returned []
Implicit Place search using SMT with State Equation took 233 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 106/108 places, 2208/2228 transitions.
Applied a total of 0 rules in 12 ms. Remains 106 /106 variables (removed 0) and now considering 2208/2208 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59370 ms. Remains : 106/108 places, 2208/2228 transitions.
Support contains 106 out of 106 places after structural reductions.
[2024-05-21 21:21:44] [INFO ] Flatten gal took : 251 ms
[2024-05-21 21:21:44] [INFO ] Flatten gal took : 188 ms
[2024-05-21 21:21:45] [INFO ] Input system was already deterministic with 2208 transitions.
Reduction of identical properties reduced properties to check from 25 to 24
RANDOM walk for 40000 steps (228 resets) in 3343 ms. (11 steps per ms) remains 2/24 properties
BEST_FIRST walk for 40002 steps (108 resets) in 492 ms. (81 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (78 resets) in 290 ms. (137 steps per ms) remains 2/2 properties
[2024-05-21 21:21:46] [INFO ] Flow matrix only has 289 transitions (discarded 1919 similar events)
[2024-05-21 21:21:46] [INFO ] Invariant cache hit.
[2024-05-21 21:21:46] [INFO ] State equation strengthened by 101 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 92/99 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 287/386 variables, 99/103 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/386 variables, 101/204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/386 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 9/395 variables, 7/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/395 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/395 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/395 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 395/395 variables, and 212 constraints, problems are : Problem set: 0 solved, 2 unsolved in 389 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 106/106 constraints, ReadFeed: 101/101 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 92/99 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 287/386 variables, 99/103 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/386 variables, 101/204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/386 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 9/395 variables, 7/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/395 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/395 variables, 2/214 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/395 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/395 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 395/395 variables, and 214 constraints, problems are : Problem set: 0 solved, 2 unsolved in 656 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 106/106 constraints, ReadFeed: 101/101 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 1106ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 2413 ms.
Support contains 7 out of 106 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 106/106 places, 2208/2208 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 105 transition count 2207
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 105 transition count 2207
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 5 place count 103 transition count 2206
Applied a total of 5 rules in 396 ms. Remains 103 /106 variables (removed 3) and now considering 2206/2208 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 400 ms. Remains : 103/106 places, 2206/2208 transitions.
RANDOM walk for 40000 steps (316 resets) in 804 ms. (49 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40000 steps (164 resets) in 372 ms. (107 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (136 resets) in 300 ms. (132 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 250830 steps, run timeout after 3001 ms. (steps per millisecond=83 ) properties seen :1 out of 2
Probabilistic random walk after 250830 steps, saw 71885 distinct states, run finished after 3005 ms. (steps per millisecond=83 ) properties seen :1
[2024-05-21 21:21:54] [INFO ] Flow matrix only has 287 transitions (discarded 1919 similar events)
// Phase 1: matrix 287 rows 103 cols
[2024-05-21 21:21:54] [INFO ] Computed 4 invariants in 4 ms
[2024-05-21 21:21:54] [INFO ] State equation strengthened by 101 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 54/57 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 245/302 variables, 57/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/302 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 86/388 variables, 44/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/388 variables, 2/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/388 variables, 101/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/388 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/390 variables, 2/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/390 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/390 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 390/390 variables, and 208 constraints, problems are : Problem set: 0 solved, 1 unsolved in 246 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 103/103 constraints, ReadFeed: 101/101 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 54/57 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 245/302 variables, 57/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/302 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 86/388 variables, 44/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/388 variables, 2/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/388 variables, 101/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/388 variables, 1/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/388 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/390 variables, 2/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/390 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/390 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 390/390 variables, and 209 constraints, problems are : Problem set: 0 solved, 1 unsolved in 546 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 103/103 constraints, ReadFeed: 101/101 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 829ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 335 ms.
Support contains 3 out of 103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 2206/2206 transitions.
Applied a total of 0 rules in 311 ms. Remains 103 /103 variables (removed 0) and now considering 2206/2206 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 311 ms. Remains : 103/103 places, 2206/2206 transitions.
RANDOM walk for 40000 steps (316 resets) in 583 ms. (68 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (164 resets) in 296 ms. (134 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 310709 steps, run timeout after 3001 ms. (steps per millisecond=103 ) properties seen :0 out of 1
Probabilistic random walk after 310709 steps, saw 88139 distinct states, run finished after 3001 ms. (steps per millisecond=103 ) properties seen :0
[2024-05-21 21:21:59] [INFO ] Flow matrix only has 287 transitions (discarded 1919 similar events)
[2024-05-21 21:21:59] [INFO ] Invariant cache hit.
[2024-05-21 21:21:59] [INFO ] State equation strengthened by 101 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 54/57 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 245/302 variables, 57/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/302 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 86/388 variables, 44/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/388 variables, 2/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/388 variables, 101/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/388 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/390 variables, 2/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/390 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/390 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 390/390 variables, and 208 constraints, problems are : Problem set: 0 solved, 1 unsolved in 273 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 103/103 constraints, ReadFeed: 101/101 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 54/57 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 245/302 variables, 57/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/302 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 86/388 variables, 44/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/388 variables, 2/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/388 variables, 101/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/388 variables, 1/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/388 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/390 variables, 2/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/390 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/390 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 390/390 variables, and 209 constraints, problems are : Problem set: 0 solved, 1 unsolved in 763 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 103/103 constraints, ReadFeed: 101/101 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1075ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 343 ms.
Support contains 3 out of 103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 2206/2206 transitions.
Applied a total of 0 rules in 241 ms. Remains 103 /103 variables (removed 0) and now considering 2206/2206 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 242 ms. Remains : 103/103 places, 2206/2206 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 2206/2206 transitions.
Applied a total of 0 rules in 280 ms. Remains 103 /103 variables (removed 0) and now considering 2206/2206 (removed 0) transitions.
[2024-05-21 21:22:00] [INFO ] Flow matrix only has 287 transitions (discarded 1919 similar events)
[2024-05-21 21:22:00] [INFO ] Invariant cache hit.
[2024-05-21 21:22:01] [INFO ] Implicit Places using invariants in 417 ms returned []
[2024-05-21 21:22:01] [INFO ] Flow matrix only has 287 transitions (discarded 1919 similar events)
[2024-05-21 21:22:01] [INFO ] Invariant cache hit.
[2024-05-21 21:22:01] [INFO ] State equation strengthened by 101 read => feed constraints.
[2024-05-21 21:22:02] [INFO ] Implicit Places using invariants and state equation in 1420 ms returned [22, 46]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1846 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 101/103 places, 2206/2206 transitions.
Applied a total of 0 rules in 200 ms. Remains 101 /101 variables (removed 0) and now considering 2206/2206 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2327 ms. Remains : 101/103 places, 2206/2206 transitions.
RANDOM walk for 40000 steps (316 resets) in 678 ms. (58 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (164 resets) in 293 ms. (136 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 323437 steps, run timeout after 3001 ms. (steps per millisecond=107 ) properties seen :0 out of 1
Probabilistic random walk after 323437 steps, saw 91770 distinct states, run finished after 3001 ms. (steps per millisecond=107 ) properties seen :0
[2024-05-21 21:22:06] [INFO ] Flow matrix only has 287 transitions (discarded 1919 similar events)
// Phase 1: matrix 287 rows 101 cols
[2024-05-21 21:22:06] [INFO ] Computed 4 invariants in 4 ms
[2024-05-21 21:22:06] [INFO ] State equation strengthened by 101 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 54/57 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 245/302 variables, 57/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/302 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 84/386 variables, 42/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/386 variables, 2/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/386 variables, 101/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/386 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/388 variables, 2/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/388 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/388 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 388/388 variables, and 206 constraints, problems are : Problem set: 0 solved, 1 unsolved in 270 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 101/101 constraints, ReadFeed: 101/101 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 54/57 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 245/302 variables, 57/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/302 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 84/386 variables, 42/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/386 variables, 2/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/386 variables, 101/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/386 variables, 1/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/386 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/388 variables, 2/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/388 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/388 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 388/388 variables, and 207 constraints, problems are : Problem set: 0 solved, 1 unsolved in 629 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 101/101 constraints, ReadFeed: 101/101 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 927ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 392 ms.
Support contains 3 out of 101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 2206/2206 transitions.
Applied a total of 0 rules in 216 ms. Remains 101 /101 variables (removed 0) and now considering 2206/2206 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 217 ms. Remains : 101/101 places, 2206/2206 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 2206/2206 transitions.
Applied a total of 0 rules in 228 ms. Remains 101 /101 variables (removed 0) and now considering 2206/2206 (removed 0) transitions.
[2024-05-21 21:22:08] [INFO ] Flow matrix only has 287 transitions (discarded 1919 similar events)
[2024-05-21 21:22:08] [INFO ] Invariant cache hit.
[2024-05-21 21:22:08] [INFO ] Implicit Places using invariants in 361 ms returned []
[2024-05-21 21:22:08] [INFO ] Flow matrix only has 287 transitions (discarded 1919 similar events)
[2024-05-21 21:22:08] [INFO ] Invariant cache hit.
[2024-05-21 21:22:08] [INFO ] State equation strengthened by 101 read => feed constraints.
[2024-05-21 21:22:09] [INFO ] Implicit Places using invariants and state equation in 1039 ms returned []
Implicit Place search using SMT with State Equation took 1403 ms to find 0 implicit places.
[2024-05-21 21:22:09] [INFO ] Redundant transitions in 139 ms returned []
Running 2203 sub problems to find dead transitions.
[2024-05-21 21:22:09] [INFO ] Flow matrix only has 287 transitions (discarded 1919 similar events)
[2024-05-21 21:22:09] [INFO ] Invariant cache hit.
[2024-05-21 21:22:09] [INFO ] State equation strengthened by 101 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2203 unsolved
[2024-05-21 21:22:32] [INFO ] Deduced a trap composed of 5 places in 272 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 101/388 variables, and 5 constraints, problems are : Problem set: 0 solved, 2203 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/101 constraints, ReadFeed: 0/101 constraints, PredecessorRefiner: 2203/2203 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2203 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2203 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2203 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 101/388 variables, and 5 constraints, problems are : Problem set: 0 solved, 2203 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/101 constraints, ReadFeed: 0/101 constraints, PredecessorRefiner: 0/2203 constraints, Known Traps: 1/1 constraints]
After SMT, in 77083ms problems are : Problem set: 0 solved, 2203 unsolved
Search for dead transitions found 0 dead transitions in 77113ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 78898 ms. Remains : 101/101 places, 2206/2206 transitions.
FORMULA BridgeAndVehicles-PT-V20P10N50-LTLFireability-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 49 stabilizing places and 84 stable transitions
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((p0&&F(p1))))'
Support contains 74 out of 106 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 106/106 places, 2208/2208 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 105 transition count 2207
Applied a total of 2 rules in 512 ms. Remains 105 /106 variables (removed 1) and now considering 2207/2208 (removed 1) transitions.
Running 2204 sub problems to find dead transitions.
[2024-05-21 21:23:28] [INFO ] Flow matrix only has 288 transitions (discarded 1919 similar events)
// Phase 1: matrix 288 rows 105 cols
[2024-05-21 21:23:28] [INFO ] Computed 5 invariants in 4 ms
[2024-05-21 21:23:28] [INFO ] State equation strengthened by 101 read => feed constraints.
BK_STOP 1716326618567
--------------------
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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -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="BridgeAndVehicles-PT-V20P10N50"
export BK_EXAMINATION="LTLFireability"
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 BridgeAndVehicles-PT-V20P10N50, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r048-tajo-171620399000196"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-PT-V20P10N50.tgz
mv BridgeAndVehicles-PT-V20P10N50 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;