Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r516-tajo-171654447100447.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 ltsminxred
Input is PolyORBNT-PT-S05J20, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r516-tajo-171654447100447
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.4M
-rw-r--r-- 1 mcc users 17K Apr 12 09:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 113K Apr 12 09:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 50K Apr 12 09:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 220K Apr 12 09:46 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 9.0K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 39K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 23K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 74K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 25K Apr 12 09:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 128K Apr 12 09:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 22K Apr 12 09:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 100K Apr 12 09:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.7K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 1.6M May 18 16:43 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 PolyORBNT-PT-S05J20-ReachabilityFireability-2024-00
FORMULA_NAME PolyORBNT-PT-S05J20-ReachabilityFireability-2024-01
FORMULA_NAME PolyORBNT-PT-S05J20-ReachabilityFireability-2024-02
FORMULA_NAME PolyORBNT-PT-S05J20-ReachabilityFireability-2024-03
FORMULA_NAME PolyORBNT-PT-S05J20-ReachabilityFireability-2024-04
FORMULA_NAME PolyORBNT-PT-S05J20-ReachabilityFireability-2024-05
FORMULA_NAME PolyORBNT-PT-S05J20-ReachabilityFireability-2024-06
FORMULA_NAME PolyORBNT-PT-S05J20-ReachabilityFireability-2024-07
FORMULA_NAME PolyORBNT-PT-S05J20-ReachabilityFireability-2024-08
FORMULA_NAME PolyORBNT-PT-S05J20-ReachabilityFireability-2024-09
FORMULA_NAME PolyORBNT-PT-S05J20-ReachabilityFireability-2024-10
FORMULA_NAME PolyORBNT-PT-S05J20-ReachabilityFireability-2024-11
FORMULA_NAME PolyORBNT-PT-S05J20-ReachabilityFireability-2024-12
FORMULA_NAME PolyORBNT-PT-S05J20-ReachabilityFireability-2024-13
FORMULA_NAME PolyORBNT-PT-S05J20-ReachabilityFireability-2024-14
FORMULA_NAME PolyORBNT-PT-S05J20-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717259972352

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-PT-S05J20
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 16:39:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 16:39:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 16:39:33] [INFO ] Load time of PNML (sax parser for PT used): 154 ms
[2024-06-01 16:39:33] [INFO ] Transformed 349 places.
[2024-06-01 16:39:33] [INFO ] Transformed 1210 transitions.
[2024-06-01 16:39:33] [INFO ] Parsed PT model containing 349 places and 1210 transitions and 8824 arcs in 256 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
[2024-06-01 16:39:33] [INFO ] Reduced 90 identical enabling conditions.
[2024-06-01 16:39:33] [INFO ] Reduced 90 identical enabling conditions.
Ensure Unique test removed 655 transitions
Reduce redundant transitions removed 655 transitions.
RANDOM walk for 40000 steps (2748 resets) in 1558 ms. (25 steps per ms) remains 10/16 properties
FORMULA PolyORBNT-PT-S05J20-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-PT-S05J20-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-PT-S05J20-ReachabilityFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-PT-S05J20-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-PT-S05J20-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-PT-S05J20-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40002 steps (991 resets) in 589 ms. (67 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (657 resets) in 663 ms. (60 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (687 resets) in 175 ms. (227 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (137 resets) in 983 ms. (40 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (128 resets) in 164 ms. (242 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (128 resets) in 115 ms. (344 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (217 resets) in 130 ms. (305 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (128 resets) in 187 ms. (212 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (112 resets) in 99 ms. (400 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (128 resets) in 66 ms. (597 steps per ms) remains 10/10 properties
[2024-06-01 16:39:35] [INFO ] Flow matrix only has 551 transitions (discarded 4 similar events)
// Phase 1: matrix 551 rows 349 cols
[2024-06-01 16:39:35] [INFO ] Computed 62 invariants in 37 ms
[2024-06-01 16:39:35] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/173 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 88/261 variables, 28/30 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/261 variables, 3/33 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/261 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 60/321 variables, 12/45 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/321 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Problem PolyORBNT-PT-S05J20-ReachabilityFireability-2024-05 is UNSAT
FORMULA PolyORBNT-PT-S05J20-ReachabilityFireability-2024-05 FALSE TECHNIQUES SMT_REFINEMENT
Problem PolyORBNT-PT-S05J20-ReachabilityFireability-2024-08 is UNSAT
FORMULA PolyORBNT-PT-S05J20-ReachabilityFireability-2024-08 TRUE TECHNIQUES SMT_REFINEMENT
Problem PolyORBNT-PT-S05J20-ReachabilityFireability-2024-09 is UNSAT
FORMULA PolyORBNT-PT-S05J20-ReachabilityFireability-2024-09 FALSE TECHNIQUES SMT_REFINEMENT
Problem PolyORBNT-PT-S05J20-ReachabilityFireability-2024-13 is UNSAT
FORMULA PolyORBNT-PT-S05J20-ReachabilityFireability-2024-13 FALSE TECHNIQUES SMT_REFINEMENT
Problem PolyORBNT-PT-S05J20-ReachabilityFireability-2024-14 is UNSAT
FORMULA PolyORBNT-PT-S05J20-ReachabilityFireability-2024-14 FALSE TECHNIQUES SMT_REFINEMENT
Problem PolyORBNT-PT-S05J20-ReachabilityFireability-2024-15 is UNSAT
FORMULA PolyORBNT-PT-S05J20-ReachabilityFireability-2024-15 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 8 (OVERLAPS) 27/348 variables, 16/61 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/348 variables, 0/61 constraints. Problems are: Problem set: 6 solved, 4 unsolved
Problem PolyORBNT-PT-S05J20-ReachabilityFireability-2024-10 is UNSAT
FORMULA PolyORBNT-PT-S05J20-ReachabilityFireability-2024-10 FALSE TECHNIQUES SMT_REFINEMENT
Problem PolyORBNT-PT-S05J20-ReachabilityFireability-2024-11 is UNSAT
FORMULA PolyORBNT-PT-S05J20-ReachabilityFireability-2024-11 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 10 (OVERLAPS) 1/349 variables, 1/62 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/349 variables, 0/62 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 551/900 variables, 349/411 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/900 variables, 1/412 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/900 variables, 0/412 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/900 variables, 0/412 constraints. Problems are: Problem set: 8 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 900/900 variables, and 412 constraints, problems are : Problem set: 8 solved, 2 unsolved in 993 ms.
Refiners :[Positive P Invariants (semi-flows): 42/42 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 349/349 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 8 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 0/0 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 118/202 variables, 20/20 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/202 variables, 0/20 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 90/292 variables, 18/38 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/292 variables, 0/38 constraints. Problems are: Problem set: 8 solved, 2 unsolved
Problem PolyORBNT-PT-S05J20-ReachabilityFireability-2024-06 is UNSAT
FORMULA PolyORBNT-PT-S05J20-ReachabilityFireability-2024-06 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 5 (OVERLAPS) 53/345 variables, 20/58 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/345 variables, 0/58 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 4/349 variables, 4/62 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/349 variables, 0/62 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 551/900 variables, 349/411 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/900 variables, 1/412 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/900 variables, 1/413 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/900 variables, 0/413 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/900 variables, 0/413 constraints. Problems are: Problem set: 9 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 900/900 variables, and 413 constraints, problems are : Problem set: 9 solved, 1 unsolved in 637 ms.
Refiners :[Positive P Invariants (semi-flows): 42/42 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 349/349 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/10 constraints, Known Traps: 0/0 constraints]
After SMT, in 2146ms problems are : Problem set: 9 solved, 1 unsolved
Parikh walk visited 0 properties in 44 ms.
Support contains 1 out of 349 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 349/349 places, 555/555 transitions.
Ensure Unique test removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 344 transition count 529
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 57 place count 318 transition count 529
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 57 place count 318 transition count 504
Deduced a syphon composed of 25 places in 2 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 107 place count 293 transition count 504
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 108 place count 292 transition count 503
Iterating global reduction 2 with 1 rules applied. Total rules applied 109 place count 292 transition count 503
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 113 place count 290 transition count 501
Applied a total of 113 rules in 166 ms. Remains 290 /349 variables (removed 59) and now considering 501/555 (removed 54) transitions.
Running 495 sub problems to find dead transitions.
[2024-06-01 16:39:37] [INFO ] Flow matrix only has 497 transitions (discarded 4 similar events)
// Phase 1: matrix 497 rows 290 cols
[2024-06-01 16:39:37] [INFO ] Computed 57 invariants in 9 ms
[2024-06-01 16:39:37] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/285 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 495 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/285 variables, 10/52 constraints. Problems are: Problem set: 0 solved, 495 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/285 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 495 unsolved
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD383 is UNSAT
At refinement iteration 3 (OVERLAPS) 5/290 variables, 5/57 constraints. Problems are: Problem set: 95 solved, 400 unsolved
[2024-06-01 16:39:46] [INFO ] Deduced a trap composed of 64 places in 166 ms of which 16 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/290 variables, 1/58 constraints. Problems are: Problem set: 95 solved, 400 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/290 variables, 0/58 constraints. Problems are: Problem set: 95 solved, 400 unsolved
At refinement iteration 6 (OVERLAPS) 497/787 variables, 290/348 constraints. Problems are: Problem set: 95 solved, 400 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/787 variables, 1/349 constraints. Problems are: Problem set: 95 solved, 400 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 787/787 variables, and 349 constraints, problems are : Problem set: 95 solved, 400 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 42/42 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 290/290 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 495/495 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 95 solved, 400 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/285 variables, 42/42 constraints. Problems are: Problem set: 95 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/285 variables, 10/52 constraints. Problems are: Problem set: 95 solved, 400 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/285 variables, 1/53 constraints. Problems are: Problem set: 95 solved, 400 unsolved
[2024-06-01 16:39:59] [INFO ] Deduced a trap composed of 13 places in 91 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/285 variables, 1/54 constraints. Problems are: Problem set: 95 solved, 400 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/285 variables, 0/54 constraints. Problems are: Problem set: 95 solved, 400 unsolved
At refinement iteration 5 (OVERLAPS) 5/290 variables, 5/59 constraints. Problems are: Problem set: 95 solved, 400 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/290 variables, 0/59 constraints. Problems are: Problem set: 95 solved, 400 unsolved
At refinement iteration 7 (OVERLAPS) 497/787 variables, 290/349 constraints. Problems are: Problem set: 95 solved, 400 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/787 variables, 1/350 constraints. Problems are: Problem set: 95 solved, 400 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 787/787 variables, and 750 constraints, problems are : Problem set: 95 solved, 400 unsolved in 20191 ms.
Refiners :[Positive P Invariants (semi-flows): 42/42 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 290/290 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 400/495 constraints, Known Traps: 2/2 constraints]
After SMT, in 41106ms problems are : Problem set: 95 solved, 400 unsolved
Search for dead transitions found 95 dead transitions in 41113ms
Found 95 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 95 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 95 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 290/349 places, 406/555 transitions.
Applied a total of 0 rules in 28 ms. Remains 290 /290 variables (removed 0) and now considering 406/406 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41327 ms. Remains : 290/349 places, 406/555 transitions.
RANDOM walk for 40000 steps (2089 resets) in 596 ms. (67 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (268 resets) in 117 ms. (339 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 541365 steps, run timeout after 3001 ms. (steps per millisecond=180 ) properties seen :0 out of 1
Probabilistic random walk after 541365 steps, saw 166130 distinct states, run finished after 3006 ms. (steps per millisecond=180 ) properties seen :0
[2024-06-01 16:40:22] [INFO ] Flow matrix only has 402 transitions (discarded 4 similar events)
// Phase 1: matrix 402 rows 290 cols
[2024-06-01 16:40:22] [INFO ] Computed 57 invariants in 26 ms
[2024-06-01 16:40:22] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 108/117 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 152/269 variables, 41/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/269 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 19/288 variables, 12/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 16:40:22] [INFO ] Deduced a trap composed of 107 places in 151 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/288 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/288 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/289 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/289 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 402/691 variables, 289/347 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/691 variables, 1/348 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/691 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/692 variables, 1/349 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/692 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/692 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 692/692 variables, and 349 constraints, problems are : Problem set: 0 solved, 1 unsolved in 551 ms.
Refiners :[Positive P Invariants (semi-flows): 43/43 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 290/290 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 108/117 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 152/269 variables, 41/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/269 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 19/288 variables, 12/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/288 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 16:40:23] [INFO ] Deduced a trap composed of 83 places in 166 ms of which 3 ms to minimize.
[2024-06-01 16:40:23] [INFO ] Deduced a trap composed of 92 places in 138 ms of which 3 ms to minimize.
[2024-06-01 16:40:23] [INFO ] Deduced a trap composed of 95 places in 79 ms of which 5 ms to minimize.
[2024-06-01 16:40:23] [INFO ] Deduced a trap composed of 95 places in 87 ms of which 5 ms to minimize.
[2024-06-01 16:40:23] [INFO ] Deduced a trap composed of 86 places in 92 ms of which 14 ms to minimize.
[2024-06-01 16:40:23] [INFO ] Deduced a trap composed of 85 places in 105 ms of which 2 ms to minimize.
[2024-06-01 16:40:23] [INFO ] Deduced a trap composed of 92 places in 122 ms of which 2 ms to minimize.
[2024-06-01 16:40:23] [INFO ] Deduced a trap composed of 83 places in 99 ms of which 2 ms to minimize.
[2024-06-01 16:40:24] [INFO ] Deduced a trap composed of 99 places in 84 ms of which 2 ms to minimize.
[2024-06-01 16:40:24] [INFO ] Deduced a trap composed of 86 places in 76 ms of which 2 ms to minimize.
[2024-06-01 16:40:24] [INFO ] Deduced a trap composed of 86 places in 86 ms of which 2 ms to minimize.
[2024-06-01 16:40:24] [INFO ] Deduced a trap composed of 83 places in 99 ms of which 2 ms to minimize.
[2024-06-01 16:40:24] [INFO ] Deduced a trap composed of 92 places in 85 ms of which 2 ms to minimize.
[2024-06-01 16:40:24] [INFO ] Deduced a trap composed of 92 places in 91 ms of which 1 ms to minimize.
[2024-06-01 16:40:24] [INFO ] Deduced a trap composed of 93 places in 94 ms of which 2 ms to minimize.
[2024-06-01 16:40:24] [INFO ] Deduced a trap composed of 89 places in 84 ms of which 2 ms to minimize.
[2024-06-01 16:40:24] [INFO ] Deduced a trap composed of 95 places in 88 ms of which 1 ms to minimize.
[2024-06-01 16:40:24] [INFO ] Deduced a trap composed of 93 places in 99 ms of which 1 ms to minimize.
[2024-06-01 16:40:25] [INFO ] Deduced a trap composed of 86 places in 90 ms of which 2 ms to minimize.
[2024-06-01 16:40:25] [INFO ] Deduced a trap composed of 80 places in 86 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/288 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 16:40:25] [INFO ] Deduced a trap composed of 97 places in 87 ms of which 2 ms to minimize.
[2024-06-01 16:40:25] [INFO ] Deduced a trap composed of 86 places in 81 ms of which 2 ms to minimize.
[2024-06-01 16:40:25] [INFO ] Deduced a trap composed of 93 places in 112 ms of which 2 ms to minimize.
[2024-06-01 16:40:25] [INFO ] Deduced a trap composed of 86 places in 82 ms of which 2 ms to minimize.
[2024-06-01 16:40:25] [INFO ] Deduced a trap composed of 83 places in 86 ms of which 3 ms to minimize.
[2024-06-01 16:40:25] [INFO ] Deduced a trap composed of 89 places in 140 ms of which 2 ms to minimize.
[2024-06-01 16:40:26] [INFO ] Deduced a trap composed of 95 places in 117 ms of which 2 ms to minimize.
[2024-06-01 16:40:26] [INFO ] Deduced a trap composed of 98 places in 90 ms of which 2 ms to minimize.
[2024-06-01 16:40:26] [INFO ] Deduced a trap composed of 102 places in 83 ms of which 2 ms to minimize.
[2024-06-01 16:40:26] [INFO ] Deduced a trap composed of 89 places in 88 ms of which 1 ms to minimize.
[2024-06-01 16:40:26] [INFO ] Deduced a trap composed of 95 places in 91 ms of which 2 ms to minimize.
[2024-06-01 16:40:26] [INFO ] Deduced a trap composed of 98 places in 80 ms of which 3 ms to minimize.
[2024-06-01 16:40:26] [INFO ] Deduced a trap composed of 89 places in 90 ms of which 2 ms to minimize.
[2024-06-01 16:40:26] [INFO ] Deduced a trap composed of 116 places in 108 ms of which 2 ms to minimize.
[2024-06-01 16:40:26] [INFO ] Deduced a trap composed of 93 places in 87 ms of which 2 ms to minimize.
[2024-06-01 16:40:26] [INFO ] Deduced a trap composed of 99 places in 86 ms of which 2 ms to minimize.
[2024-06-01 16:40:27] [INFO ] Deduced a trap composed of 92 places in 93 ms of which 2 ms to minimize.
[2024-06-01 16:40:27] [INFO ] Deduced a trap composed of 89 places in 93 ms of which 1 ms to minimize.
[2024-06-01 16:40:27] [INFO ] Deduced a trap composed of 80 places in 115 ms of which 2 ms to minimize.
[2024-06-01 16:40:27] [INFO ] Deduced a trap composed of 86 places in 83 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/288 variables, 20/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 16:40:27] [INFO ] Deduced a trap composed of 86 places in 122 ms of which 2 ms to minimize.
[2024-06-01 16:40:27] [INFO ] Deduced a trap composed of 89 places in 100 ms of which 2 ms to minimize.
[2024-06-01 16:40:27] [INFO ] Deduced a trap composed of 90 places in 147 ms of which 2 ms to minimize.
[2024-06-01 16:40:28] [INFO ] Deduced a trap composed of 86 places in 112 ms of which 2 ms to minimize.
[2024-06-01 16:40:28] [INFO ] Deduced a trap composed of 92 places in 108 ms of which 2 ms to minimize.
[2024-06-01 16:40:28] [INFO ] Deduced a trap composed of 101 places in 95 ms of which 1 ms to minimize.
[2024-06-01 16:40:28] [INFO ] Deduced a trap composed of 89 places in 100 ms of which 1 ms to minimize.
[2024-06-01 16:40:28] [INFO ] Deduced a trap composed of 84 places in 93 ms of which 7 ms to minimize.
[2024-06-01 16:40:28] [INFO ] Deduced a trap composed of 94 places in 89 ms of which 2 ms to minimize.
[2024-06-01 16:40:28] [INFO ] Deduced a trap composed of 89 places in 105 ms of which 2 ms to minimize.
[2024-06-01 16:40:28] [INFO ] Deduced a trap composed of 93 places in 125 ms of which 2 ms to minimize.
[2024-06-01 16:40:29] [INFO ] Deduced a trap composed of 90 places in 92 ms of which 2 ms to minimize.
[2024-06-01 16:40:29] [INFO ] Deduced a trap composed of 93 places in 79 ms of which 6 ms to minimize.
[2024-06-01 16:40:29] [INFO ] Deduced a trap composed of 83 places in 85 ms of which 1 ms to minimize.
[2024-06-01 16:40:29] [INFO ] Deduced a trap composed of 90 places in 154 ms of which 2 ms to minimize.
[2024-06-01 16:40:29] [INFO ] Deduced a trap composed of 92 places in 84 ms of which 2 ms to minimize.
[2024-06-01 16:40:29] [INFO ] Deduced a trap composed of 89 places in 87 ms of which 1 ms to minimize.
[2024-06-01 16:40:29] [INFO ] Deduced a trap composed of 94 places in 88 ms of which 2 ms to minimize.
[2024-06-01 16:40:29] [INFO ] Deduced a trap composed of 86 places in 88 ms of which 2 ms to minimize.
[2024-06-01 16:40:29] [INFO ] Deduced a trap composed of 86 places in 90 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/288 variables, 20/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 16:40:30] [INFO ] Deduced a trap composed of 93 places in 94 ms of which 2 ms to minimize.
[2024-06-01 16:40:30] [INFO ] Deduced a trap composed of 86 places in 74 ms of which 2 ms to minimize.
[2024-06-01 16:40:30] [INFO ] Deduced a trap composed of 86 places in 74 ms of which 1 ms to minimize.
[2024-06-01 16:40:30] [INFO ] Deduced a trap composed of 89 places in 84 ms of which 1 ms to minimize.
[2024-06-01 16:40:30] [INFO ] Deduced a trap composed of 89 places in 84 ms of which 1 ms to minimize.
[2024-06-01 16:40:30] [INFO ] Deduced a trap composed of 83 places in 124 ms of which 3 ms to minimize.
[2024-06-01 16:40:30] [INFO ] Deduced a trap composed of 102 places in 99 ms of which 2 ms to minimize.
[2024-06-01 16:40:30] [INFO ] Deduced a trap composed of 107 places in 83 ms of which 1 ms to minimize.
[2024-06-01 16:40:30] [INFO ] Deduced a trap composed of 95 places in 105 ms of which 2 ms to minimize.
[2024-06-01 16:40:31] [INFO ] Deduced a trap composed of 85 places in 109 ms of which 2 ms to minimize.
[2024-06-01 16:40:31] [INFO ] Deduced a trap composed of 101 places in 140 ms of which 2 ms to minimize.
[2024-06-01 16:40:31] [INFO ] Deduced a trap composed of 110 places in 80 ms of which 2 ms to minimize.
[2024-06-01 16:40:31] [INFO ] Deduced a trap composed of 99 places in 133 ms of which 2 ms to minimize.
[2024-06-01 16:40:31] [INFO ] Deduced a trap composed of 83 places in 89 ms of which 2 ms to minimize.
[2024-06-01 16:40:32] [INFO ] Deduced a trap composed of 89 places in 107 ms of which 2 ms to minimize.
[2024-06-01 16:40:32] [INFO ] Deduced a trap composed of 89 places in 101 ms of which 1 ms to minimize.
[2024-06-01 16:40:33] [INFO ] Deduced a trap composed of 98 places in 121 ms of which 2 ms to minimize.
[2024-06-01 16:40:34] [INFO ] Deduced a trap composed of 120 places in 153 ms of which 2 ms to minimize.
[2024-06-01 16:40:34] [INFO ] Deduced a trap composed of 106 places in 120 ms of which 2 ms to minimize.
[2024-06-01 16:40:34] [INFO ] Deduced a trap composed of 86 places in 136 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/288 variables, 20/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 16:40:39] [INFO ] Deduced a trap composed of 91 places in 129 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 288/692 variables, and 138 constraints, problems are : Problem set: 0 solved, 1 unsolved in 25556 ms.
Refiners :[Positive P Invariants (semi-flows): 42/43 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 0/290 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 82/82 constraints]
After SMT, in 26150ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 290 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 290/290 places, 406/406 transitions.
Applied a total of 0 rules in 35 ms. Remains 290 /290 variables (removed 0) and now considering 406/406 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 290/290 places, 406/406 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 290/290 places, 406/406 transitions.
Applied a total of 0 rules in 23 ms. Remains 290 /290 variables (removed 0) and now considering 406/406 (removed 0) transitions.
[2024-06-01 16:40:48] [INFO ] Flow matrix only has 402 transitions (discarded 4 similar events)
[2024-06-01 16:40:48] [INFO ] Invariant cache hit.
[2024-06-01 16:40:48] [INFO ] Implicit Places using invariants in 415 ms returned []
[2024-06-01 16:40:48] [INFO ] Flow matrix only has 402 transitions (discarded 4 similar events)
[2024-06-01 16:40:48] [INFO ] Invariant cache hit.
[2024-06-01 16:40:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 16:40:50] [INFO ] Implicit Places using invariants and state equation in 1781 ms returned []
Implicit Place search using SMT with State Equation took 2202 ms to find 0 implicit places.
[2024-06-01 16:40:50] [INFO ] Redundant transitions in 22 ms returned []
Running 400 sub problems to find dead transitions.
[2024-06-01 16:40:50] [INFO ] Flow matrix only has 402 transitions (discarded 4 similar events)
[2024-06-01 16:40:50] [INFO ] Invariant cache hit.
[2024-06-01 16:40:50] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/285 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/285 variables, 9/52 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2024-06-01 16:40:53] [INFO ] Deduced a trap composed of 65 places in 100 ms of which 2 ms to minimize.
[2024-06-01 16:40:53] [INFO ] Deduced a trap composed of 76 places in 126 ms of which 2 ms to minimize.
[2024-06-01 16:40:53] [INFO ] Deduced a trap composed of 89 places in 93 ms of which 2 ms to minimize.
[2024-06-01 16:40:54] [INFO ] Deduced a trap composed of 76 places in 129 ms of which 2 ms to minimize.
[2024-06-01 16:40:54] [INFO ] Deduced a trap composed of 76 places in 97 ms of which 2 ms to minimize.
[2024-06-01 16:40:54] [INFO ] Deduced a trap composed of 76 places in 126 ms of which 3 ms to minimize.
[2024-06-01 16:40:54] [INFO ] Deduced a trap composed of 76 places in 92 ms of which 2 ms to minimize.
[2024-06-01 16:40:54] [INFO ] Deduced a trap composed of 76 places in 126 ms of which 2 ms to minimize.
[2024-06-01 16:40:54] [INFO ] Deduced a trap composed of 76 places in 109 ms of which 2 ms to minimize.
[2024-06-01 16:40:54] [INFO ] Deduced a trap composed of 76 places in 112 ms of which 2 ms to minimize.
[2024-06-01 16:40:54] [INFO ] Deduced a trap composed of 76 places in 127 ms of which 3 ms to minimize.
[2024-06-01 16:40:55] [INFO ] Deduced a trap composed of 76 places in 110 ms of which 2 ms to minimize.
[2024-06-01 16:40:55] [INFO ] Deduced a trap composed of 76 places in 111 ms of which 2 ms to minimize.
[2024-06-01 16:40:55] [INFO ] Deduced a trap composed of 89 places in 117 ms of which 2 ms to minimize.
[2024-06-01 16:40:55] [INFO ] Deduced a trap composed of 76 places in 134 ms of which 2 ms to minimize.
[2024-06-01 16:40:55] [INFO ] Deduced a trap composed of 80 places in 125 ms of which 3 ms to minimize.
[2024-06-01 16:40:55] [INFO ] Deduced a trap composed of 79 places in 99 ms of which 2 ms to minimize.
[2024-06-01 16:40:56] [INFO ] Deduced a trap composed of 81 places in 98 ms of which 1 ms to minimize.
[2024-06-01 16:40:56] [INFO ] Deduced a trap composed of 83 places in 127 ms of which 3 ms to minimize.
[2024-06-01 16:40:56] [INFO ] Deduced a trap composed of 80 places in 134 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/285 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2024-06-01 16:40:56] [INFO ] Deduced a trap composed of 76 places in 132 ms of which 2 ms to minimize.
[2024-06-01 16:40:57] [INFO ] Deduced a trap composed of 76 places in 110 ms of which 2 ms to minimize.
[2024-06-01 16:40:57] [INFO ] Deduced a trap composed of 76 places in 132 ms of which 2 ms to minimize.
[2024-06-01 16:40:57] [INFO ] Deduced a trap composed of 76 places in 116 ms of which 2 ms to minimize.
[2024-06-01 16:40:57] [INFO ] Deduced a trap composed of 76 places in 112 ms of which 2 ms to minimize.
[2024-06-01 16:40:57] [INFO ] Deduced a trap composed of 76 places in 112 ms of which 2 ms to minimize.
[2024-06-01 16:40:57] [INFO ] Deduced a trap composed of 76 places in 128 ms of which 2 ms to minimize.
[2024-06-01 16:40:57] [INFO ] Deduced a trap composed of 76 places in 125 ms of which 2 ms to minimize.
[2024-06-01 16:40:58] [INFO ] Deduced a trap composed of 83 places in 147 ms of which 2 ms to minimize.
[2024-06-01 16:40:58] [INFO ] Deduced a trap composed of 76 places in 104 ms of which 2 ms to minimize.
[2024-06-01 16:40:58] [INFO ] Deduced a trap composed of 77 places in 96 ms of which 1 ms to minimize.
[2024-06-01 16:40:58] [INFO ] Deduced a trap composed of 76 places in 114 ms of which 2 ms to minimize.
[2024-06-01 16:40:58] [INFO ] Deduced a trap composed of 86 places in 141 ms of which 2 ms to minimize.
[2024-06-01 16:40:58] [INFO ] Deduced a trap composed of 76 places in 98 ms of which 1 ms to minimize.
[2024-06-01 16:40:58] [INFO ] Deduced a trap composed of 76 places in 97 ms of which 1 ms to minimize.
[2024-06-01 16:40:59] [INFO ] Deduced a trap composed of 76 places in 106 ms of which 1 ms to minimize.
[2024-06-01 16:40:59] [INFO ] Deduced a trap composed of 76 places in 100 ms of which 2 ms to minimize.
[2024-06-01 16:40:59] [INFO ] Deduced a trap composed of 76 places in 130 ms of which 4 ms to minimize.
[2024-06-01 16:40:59] [INFO ] Deduced a trap composed of 76 places in 109 ms of which 2 ms to minimize.
[2024-06-01 16:40:59] [INFO ] Deduced a trap composed of 76 places in 149 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/285 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2024-06-01 16:41:02] [INFO ] Deduced a trap composed of 76 places in 138 ms of which 4 ms to minimize.
[2024-06-01 16:41:02] [INFO ] Deduced a trap composed of 76 places in 131 ms of which 2 ms to minimize.
[2024-06-01 16:41:02] [INFO ] Deduced a trap composed of 76 places in 94 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/285 variables, 3/95 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2024-06-01 16:41:04] [INFO ] Deduced a trap composed of 76 places in 125 ms of which 2 ms to minimize.
[2024-06-01 16:41:04] [INFO ] Deduced a trap composed of 77 places in 129 ms of which 3 ms to minimize.
[2024-06-01 16:41:04] [INFO ] Deduced a trap composed of 76 places in 135 ms of which 2 ms to minimize.
[2024-06-01 16:41:04] [INFO ] Deduced a trap composed of 76 places in 104 ms of which 2 ms to minimize.
[2024-06-01 16:41:04] [INFO ] Deduced a trap composed of 76 places in 117 ms of which 2 ms to minimize.
[2024-06-01 16:41:05] [INFO ] Deduced a trap composed of 76 places in 130 ms of which 3 ms to minimize.
[2024-06-01 16:41:05] [INFO ] Deduced a trap composed of 97 places in 118 ms of which 2 ms to minimize.
[2024-06-01 16:41:05] [INFO ] Deduced a trap composed of 76 places in 120 ms of which 1 ms to minimize.
[2024-06-01 16:41:05] [INFO ] Deduced a trap composed of 76 places in 110 ms of which 2 ms to minimize.
[2024-06-01 16:41:05] [INFO ] Deduced a trap composed of 76 places in 108 ms of which 2 ms to minimize.
[2024-06-01 16:41:05] [INFO ] Deduced a trap composed of 76 places in 95 ms of which 2 ms to minimize.
[2024-06-01 16:41:05] [INFO ] Deduced a trap composed of 76 places in 109 ms of which 1 ms to minimize.
[2024-06-01 16:41:06] [INFO ] Deduced a trap composed of 76 places in 110 ms of which 2 ms to minimize.
[2024-06-01 16:41:06] [INFO ] Deduced a trap composed of 76 places in 107 ms of which 2 ms to minimize.
[2024-06-01 16:41:06] [INFO ] Deduced a trap composed of 76 places in 112 ms of which 1 ms to minimize.
[2024-06-01 16:41:06] [INFO ] Deduced a trap composed of 76 places in 93 ms of which 17 ms to minimize.
[2024-06-01 16:41:06] [INFO ] Deduced a trap composed of 76 places in 93 ms of which 2 ms to minimize.
[2024-06-01 16:41:06] [INFO ] Deduced a trap composed of 76 places in 93 ms of which 2 ms to minimize.
[2024-06-01 16:41:07] [INFO ] Deduced a trap composed of 76 places in 75 ms of which 2 ms to minimize.
[2024-06-01 16:41:07] [INFO ] Deduced a trap composed of 76 places in 89 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/285 variables, 20/115 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2024-06-01 16:41:07] [INFO ] Deduced a trap composed of 80 places in 95 ms of which 2 ms to minimize.
[2024-06-01 16:41:07] [INFO ] Deduced a trap composed of 80 places in 95 ms of which 2 ms to minimize.
[2024-06-01 16:41:08] [INFO ] Deduced a trap composed of 76 places in 78 ms of which 2 ms to minimize.
[2024-06-01 16:41:08] [INFO ] Deduced a trap composed of 92 places in 88 ms of which 1 ms to minimize.
[2024-06-01 16:41:08] [INFO ] Deduced a trap composed of 76 places in 87 ms of which 4 ms to minimize.
[2024-06-01 16:41:08] [INFO ] Deduced a trap composed of 76 places in 87 ms of which 1 ms to minimize.
[2024-06-01 16:41:08] [INFO ] Deduced a trap composed of 76 places in 83 ms of which 1 ms to minimize.
[2024-06-01 16:41:08] [INFO ] Deduced a trap composed of 89 places in 94 ms of which 1 ms to minimize.
[2024-06-01 16:41:08] [INFO ] Deduced a trap composed of 76 places in 84 ms of which 1 ms to minimize.
[2024-06-01 16:41:08] [INFO ] Deduced a trap composed of 80 places in 96 ms of which 1 ms to minimize.
[2024-06-01 16:41:09] [INFO ] Deduced a trap composed of 76 places in 88 ms of which 1 ms to minimize.
[2024-06-01 16:41:09] [INFO ] Deduced a trap composed of 76 places in 107 ms of which 1 ms to minimize.
[2024-06-01 16:41:09] [INFO ] Deduced a trap composed of 76 places in 103 ms of which 2 ms to minimize.
[2024-06-01 16:41:09] [INFO ] Deduced a trap composed of 76 places in 107 ms of which 2 ms to minimize.
[2024-06-01 16:41:09] [INFO ] Deduced a trap composed of 76 places in 85 ms of which 1 ms to minimize.
[2024-06-01 16:41:09] [INFO ] Deduced a trap composed of 79 places in 103 ms of which 1 ms to minimize.
[2024-06-01 16:41:09] [INFO ] Deduced a trap composed of 76 places in 96 ms of which 1 ms to minimize.
[2024-06-01 16:41:09] [INFO ] Deduced a trap composed of 92 places in 99 ms of which 1 ms to minimize.
[2024-06-01 16:41:10] [INFO ] Deduced a trap composed of 83 places in 98 ms of which 1 ms to minimize.
[2024-06-01 16:41:10] [INFO ] Deduced a trap composed of 80 places in 117 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/285 variables, 20/135 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/285 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 8 (OVERLAPS) 5/290 variables, 5/140 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/290 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 400 unsolved
SMT process timed out in 30474ms, After SMT, problems are : Problem set: 0 solved, 400 unsolved
Search for dead transitions found 0 dead transitions in 30479ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32733 ms. Remains : 290/290 places, 406/406 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 290 transition count 402
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 4 place count 290 transition count 401
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 289 transition count 401
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 289 transition count 400
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 288 transition count 400
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 2 with 5 rules applied. Total rules applied 13 place count 288 transition count 395
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 18 place count 283 transition count 395
Applied a total of 18 rules in 50 ms. Remains 283 /290 variables (removed 7) and now considering 395/406 (removed 11) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 395 rows 283 cols
[2024-06-01 16:41:21] [INFO ] Computed 57 invariants in 7 ms
[2024-06-01 16:41:21] [INFO ] [Real]Absence check using 44 positive place invariants in 25 ms returned sat
[2024-06-01 16:41:21] [INFO ] [Real]Absence check using 44 positive and 13 generalized place invariants in 20 ms returned sat
[2024-06-01 16:41:21] [INFO ] After 458ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 16:41:21] [INFO ] [Nat]Absence check using 44 positive place invariants in 7 ms returned sat
[2024-06-01 16:41:21] [INFO ] [Nat]Absence check using 44 positive and 13 generalized place invariants in 7 ms returned sat
[2024-06-01 16:41:21] [INFO ] After 107ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 16:41:22] [INFO ] Deduced a trap composed of 68 places in 645 ms of which 2 ms to minimize.
[2024-06-01 16:41:23] [INFO ] Deduced a trap composed of 93 places in 621 ms of which 1 ms to minimize.
[2024-06-01 16:41:23] [INFO ] Deduced a trap composed of 81 places in 93 ms of which 1 ms to minimize.
[2024-06-01 16:41:23] [INFO ] Deduced a trap composed of 104 places in 96 ms of which 1 ms to minimize.
[2024-06-01 16:41:23] [INFO ] Deduced a trap composed of 81 places in 100 ms of which 1 ms to minimize.
[2024-06-01 16:41:23] [INFO ] Deduced a trap composed of 104 places in 87 ms of which 2 ms to minimize.
[2024-06-01 16:41:23] [INFO ] Deduced a trap composed of 116 places in 103 ms of which 1 ms to minimize.
[2024-06-01 16:41:23] [INFO ] Deduced a trap composed of 108 places in 88 ms of which 2 ms to minimize.
[2024-06-01 16:41:24] [INFO ] Deduced a trap composed of 87 places in 88 ms of which 2 ms to minimize.
[2024-06-01 16:41:24] [INFO ] Deduced a trap composed of 87 places in 86 ms of which 2 ms to minimize.
[2024-06-01 16:41:24] [INFO ] Deduced a trap composed of 81 places in 99 ms of which 2 ms to minimize.
[2024-06-01 16:41:24] [INFO ] Deduced a trap composed of 81 places in 96 ms of which 1 ms to minimize.
[2024-06-01 16:41:24] [INFO ] Deduced a trap composed of 87 places in 120 ms of which 1 ms to minimize.
[2024-06-01 16:41:24] [INFO ] Deduced a trap composed of 87 places in 125 ms of which 2 ms to minimize.
[2024-06-01 16:41:24] [INFO ] Deduced a trap composed of 93 places in 104 ms of which 1 ms to minimize.
[2024-06-01 16:41:24] [INFO ] Deduced a trap composed of 94 places in 94 ms of which 1 ms to minimize.
[2024-06-01 16:41:25] [INFO ] Deduced a trap composed of 87 places in 100 ms of which 1 ms to minimize.
[2024-06-01 16:41:25] [INFO ] Deduced a trap composed of 90 places in 86 ms of which 2 ms to minimize.
[2024-06-01 16:41:25] [INFO ] Deduced a trap composed of 96 places in 98 ms of which 1 ms to minimize.
[2024-06-01 16:41:34] [INFO ] Deduced a trap composed of 93 places in 136 ms of which 2 ms to minimize.
[2024-06-01 16:41:37] [INFO ] Deduced a trap composed of 84 places in 129 ms of which 1 ms to minimize.
[2024-06-01 16:41:37] [INFO ] Deduced a trap composed of 90 places in 105 ms of which 2 ms to minimize.
[2024-06-01 16:41:39] [INFO ] Deduced a trap composed of 81 places in 115 ms of which 1 ms to minimize.
[2024-06-01 16:41:58] [INFO ] Deduced a trap composed of 97 places in 131 ms of which 2 ms to minimize.
[2024-06-01 16:42:01] [INFO ] Deduced a trap composed of 99 places in 121 ms of which 2 ms to minimize.
[2024-06-01 16:42:08] [INFO ] Deduced a trap composed of 87 places in 139 ms of which 2 ms to minimize.
[2024-06-01 16:42:08] [INFO ] Deduced a trap composed of 114 places in 136 ms of which 2 ms to minimize.
[2024-06-01 16:42:09] [INFO ] Deduced a trap composed of 88 places in 158 ms of which 2 ms to minimize.
[2024-06-01 16:42:09] [INFO ] Deduced a trap composed of 87 places in 129 ms of which 2 ms to minimize.
[2024-06-01 16:42:09] [INFO ] Deduced a trap composed of 88 places in 126 ms of which 2 ms to minimize.
[2024-06-01 16:42:09] [INFO ] Deduced a trap composed of 90 places in 150 ms of which 3 ms to minimize.
[2024-06-01 16:42:10] [INFO ] Deduced a trap composed of 87 places in 146 ms of which 2 ms to minimize.
[2024-06-01 16:42:10] [INFO ] Deduced a trap composed of 93 places in 148 ms of which 3 ms to minimize.
[2024-06-01 16:42:11] [INFO ] Deduced a trap composed of 90 places in 147 ms of which 2 ms to minimize.
[2024-06-01 16:42:11] [INFO ] Deduced a trap composed of 90 places in 149 ms of which 2 ms to minimize.
[2024-06-01 16:42:11] [INFO ] Deduced a trap composed of 78 places in 144 ms of which 2 ms to minimize.
[2024-06-01 16:42:12] [INFO ] Deduced a trap composed of 99 places in 117 ms of which 2 ms to minimize.
[2024-06-01 16:42:12] [INFO ] Deduced a trap composed of 90 places in 151 ms of which 3 ms to minimize.
[2024-06-01 16:42:13] [INFO ] Deduced a trap composed of 84 places in 127 ms of which 2 ms to minimize.
[2024-06-01 16:42:16] [INFO ] Deduced a trap composed of 78 places in 111 ms of which 1 ms to minimize.
[2024-06-01 16:42:16] [INFO ] Deduced a trap composed of 78 places in 122 ms of which 2 ms to minimize.
[2024-06-01 16:42:21] [INFO ] Deduced a trap composed of 91 places in 106 ms of which 1 ms to minimize.
[2024-06-01 16:42:21] [INFO ] Deduced a trap composed of 84 places in 132 ms of which 2 ms to minimize.
[2024-06-01 16:42:22] [INFO ] Deduced a trap composed of 78 places in 114 ms of which 2 ms to minimize.
[2024-06-01 16:42:22] [INFO ] Deduced a trap composed of 90 places in 94 ms of which 2 ms to minimize.
[2024-06-01 16:42:22] [INFO ] Deduced a trap composed of 81 places in 106 ms of which 2 ms to minimize.
[2024-06-01 16:42:22] [INFO ] Deduced a trap composed of 88 places in 118 ms of which 2 ms to minimize.
[2024-06-01 16:42:23] [INFO ] Deduced a trap composed of 93 places in 112 ms of which 1 ms to minimize.
[2024-06-01 16:42:23] [INFO ] Deduced a trap composed of 99 places in 143 ms of which 2 ms to minimize.
[2024-06-01 16:42:23] [INFO ] Deduced a trap composed of 87 places in 105 ms of which 2 ms to minimize.
[2024-06-01 16:42:23] [INFO ] Deduced a trap composed of 90 places in 137 ms of which 2 ms to minimize.
[2024-06-01 16:42:24] [INFO ] Deduced a trap composed of 84 places in 135 ms of which 1 ms to minimize.
[2024-06-01 16:42:24] [INFO ] Deduced a trap composed of 79 places in 118 ms of which 1 ms to minimize.
[2024-06-01 16:42:24] [INFO ] Deduced a trap composed of 81 places in 107 ms of which 2 ms to minimize.
[2024-06-01 16:42:25] [INFO ] Deduced a trap composed of 85 places in 128 ms of which 2 ms to minimize.
[2024-06-01 16:42:25] [INFO ] Deduced a trap composed of 96 places in 132 ms of which 1 ms to minimize.
[2024-06-01 16:42:25] [INFO ] Deduced a trap composed of 87 places in 114 ms of which 1 ms to minimize.
[2024-06-01 16:42:26] [INFO ] Deduced a trap composed of 90 places in 115 ms of which 1 ms to minimize.
[2024-06-01 16:42:26] [INFO ] Deduced a trap composed of 87 places in 123 ms of which 2 ms to minimize.
[2024-06-01 16:42:42] [INFO ] Deduced a trap composed of 81 places in 125 ms of which 2 ms to minimize.
[2024-06-01 16:42:42] [INFO ] Deduced a trap composed of 85 places in 123 ms of which 2 ms to minimize.
[2024-06-01 16:42:43] [INFO ] Deduced a trap composed of 87 places in 96 ms of which 2 ms to minimize.
[2024-06-01 16:42:44] [INFO ] Deduced a trap composed of 87 places in 114 ms of which 1 ms to minimize.
[2024-06-01 16:42:45] [INFO ] Deduced a trap composed of 90 places in 107 ms of which 1 ms to minimize.
[2024-06-01 16:42:46] [INFO ] Deduced a trap composed of 82 places in 117 ms of which 15 ms to minimize.
[2024-06-01 16:42:47] [INFO ] Deduced a trap composed of 102 places in 116 ms of which 2 ms to minimize.
[2024-06-01 16:42:47] [INFO ] Deduced a trap composed of 87 places in 126 ms of which 2 ms to minimize.
[2024-06-01 16:42:48] [INFO ] Deduced a trap composed of 85 places in 91 ms of which 2 ms to minimize.
[2024-06-01 16:42:48] [INFO ] Deduced a trap composed of 97 places in 96 ms of which 2 ms to minimize.
[2024-06-01 16:42:48] [INFO ] Deduced a trap composed of 82 places in 143 ms of which 2 ms to minimize.
[2024-06-01 16:42:49] [INFO ] Deduced a trap composed of 97 places in 98 ms of which 2 ms to minimize.
[2024-06-01 16:42:49] [INFO ] Deduced a trap composed of 90 places in 102 ms of which 2 ms to minimize.
[2024-06-01 16:42:50] [INFO ] Deduced a trap composed of 93 places in 144 ms of which 2 ms to minimize.
[2024-06-01 16:42:51] [INFO ] Deduced a trap composed of 88 places in 102 ms of which 2 ms to minimize.
[2024-06-01 16:42:57] [INFO ] Deduced a trap composed of 89 places in 121 ms of which 3 ms to minimize.
[2024-06-01 16:42:58] [INFO ] Deduced a trap composed of 97 places in 133 ms of which 2 ms to minimize.
[2024-06-01 16:43:03] [INFO ] Deduced a trap composed of 90 places in 125 ms of which 2 ms to minimize.
[2024-06-01 16:43:03] [INFO ] Deduced a trap composed of 72 places in 113 ms of which 2 ms to minimize.
[2024-06-01 16:43:04] [INFO ] Deduced a trap composed of 87 places in 109 ms of which 2 ms to minimize.
[2024-06-01 16:43:05] [INFO ] Deduced a trap composed of 85 places in 123 ms of which 2 ms to minimize.
[2024-06-01 16:43:05] [INFO ] Deduced a trap composed of 79 places in 124 ms of which 2 ms to minimize.
[2024-06-01 16:43:06] [INFO ] Deduced a trap composed of 93 places in 108 ms of which 4 ms to minimize.
[2024-06-01 16:43:06] [INFO ] Deduced a trap composed of 81 places in 133 ms of which 2 ms to minimize.
[2024-06-01 16:43:12] [INFO ] Deduced a trap composed of 96 places in 86 ms of which 1 ms to minimize.
[2024-06-01 16:43:13] [INFO ] Deduced a trap composed of 84 places in 103 ms of which 2 ms to minimize.
[2024-06-01 16:43:13] [INFO ] Deduced a trap composed of 85 places in 132 ms of which 2 ms to minimize.
[2024-06-01 16:43:15] [INFO ] Deduced a trap composed of 93 places in 78 ms of which 2 ms to minimize.
[2024-06-01 16:43:16] [INFO ] Deduced a trap composed of 93 places in 156 ms of which 2 ms to minimize.
[2024-06-01 16:43:16] [INFO ] Deduced a trap composed of 81 places in 95 ms of which 4 ms to minimize.
[2024-06-01 16:43:17] [INFO ] Deduced a trap composed of 88 places in 125 ms of which 2 ms to minimize.
[2024-06-01 16:43:33] [INFO ] Deduced a trap composed of 88 places in 169 ms of which 2 ms to minimize.
[2024-06-01 16:43:34] [INFO ] Deduced a trap composed of 96 places in 136 ms of which 2 ms to minimize.
[2024-06-01 16:43:34] [INFO ] Deduced a trap composed of 88 places in 135 ms of which 2 ms to minimize.
[2024-06-01 16:43:36] [INFO ] Deduced a trap composed of 82 places in 150 ms of which 2 ms to minimize.
[2024-06-01 16:43:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 94 trap constraints in 140134 ms
TRAPS : Iteration 1
[2024-06-01 16:43:42] [INFO ] After 140280ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :0
[2024-06-01 16:43:42] [INFO ] After 140384ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
FORMULA PolyORBNT-PT-S05J20-ReachabilityFireability-2024-07 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT OVER_APPROXIMATION
Over-approximation ignoring read arcs solved -1 properties in 140945 ms.
All properties solved without resorting to model-checking.
Total runtime 248529 ms.
ITS solved all properties within timeout

BK_STOP 1717260222276

--------------------
content from stderr:

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML

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="PolyORBNT-PT-S05J20"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is PolyORBNT-PT-S05J20, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r516-tajo-171654447100447"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-PT-S05J20.tgz
mv PolyORBNT-PT-S05J20 execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;