Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r496-tall-171640602600079.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is FlexibleBarrier-PT-12b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r496-tall-171640602600079
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 972K
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 52K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.2K Apr 22 14:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Apr 22 14:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:21 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 13 08:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 137K Apr 13 08:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Apr 13 08:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 13 08:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:45 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:45 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 536K 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 FlexibleBarrier-PT-12b-ReachabilityFireability-2024-00
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityFireability-2024-01
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityFireability-2024-02
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityFireability-2024-03
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityFireability-2024-04
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityFireability-2024-05
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityFireability-2024-06
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityFireability-2024-07
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityFireability-2024-08
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityFireability-2024-09
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityFireability-2024-10
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityFireability-2024-11
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityFireability-2024-12
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityFireability-2024-13
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityFireability-2024-14
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717182632114

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FlexibleBarrier-PT-12b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 19:10:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-31 19:10:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 19:10:33] [INFO ] Load time of PNML (sax parser for PT used): 152 ms
[2024-05-31 19:10:33] [INFO ] Transformed 1988 places.
[2024-05-31 19:10:33] [INFO ] Transformed 2289 transitions.
[2024-05-31 19:10:33] [INFO ] Found NUPN structural information;
[2024-05-31 19:10:33] [INFO ] Parsed PT model containing 1988 places and 2289 transitions and 5727 arcs in 260 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (460 resets) in 1859 ms. (21 steps per ms) remains 11/16 properties
FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (35 resets) in 320 ms. (124 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (45 resets) in 78 ms. (506 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (39 resets) in 730 ms. (54 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (47 resets) in 90 ms. (439 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (45 resets) in 82 ms. (481 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (44 resets) in 82 ms. (481 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (43 resets) in 78 ms. (506 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (45 resets) in 100 ms. (396 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (44 resets) in 55 ms. (714 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (44 resets) in 110 ms. (360 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (45 resets) in 66 ms. (597 steps per ms) remains 11/11 properties
// Phase 1: matrix 2289 rows 1988 cols
[2024-05-31 19:10:34] [INFO ] Computed 14 invariants in 44 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 83/83 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 1905/1988 variables, 14/97 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1988 variables, 1905/2002 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1988 variables, 0/2002 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 2289/4277 variables, 1988/3990 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4277 variables, 0/3990 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 0/4277 variables, 0/3990 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4277/4277 variables, and 3990 constraints, problems are : Problem set: 0 solved, 11 unsolved in 2953 ms.
Refiners :[Domain max(s): 1988/1988 constraints, Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 1988/1988 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 83/83 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Problem FlexibleBarrier-PT-12b-ReachabilityFireability-2024-00 is UNSAT
FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-2024-00 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 1905/1988 variables, 14/97 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1988 variables, 1905/2002 constraints. Problems are: Problem set: 1 solved, 10 unsolved
[2024-05-31 19:10:39] [INFO ] Deduced a trap composed of 793 places in 948 ms of which 89 ms to minimize.
[2024-05-31 19:10:40] [INFO ] Deduced a trap composed of 712 places in 857 ms of which 11 ms to minimize.
[2024-05-31 19:10:41] [INFO ] Deduced a trap composed of 778 places in 815 ms of which 10 ms to minimize.
[2024-05-31 19:10:42] [INFO ] Deduced a trap composed of 749 places in 810 ms of which 10 ms to minimize.
[2024-05-31 19:10:42] [INFO ] Deduced a trap composed of 232 places in 721 ms of which 9 ms to minimize.
[2024-05-31 19:10:43] [INFO ] Deduced a trap composed of 125 places in 771 ms of which 10 ms to minimize.
SMT process timed out in 8820ms, After SMT, problems are : Problem set: 1 solved, 10 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 67 out of 1988 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1988/1988 places, 2289/2289 transitions.
Graph (trivial) has 1504 edges and 1988 vertex of which 30 / 1988 are part of one of the 5 SCC in 11 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 347 transitions
Trivial Post-agglo rules discarded 347 transitions
Performed 347 trivial Post agglomeration. Transition count delta: 347
Iterating post reduction 0 with 347 rules applied. Total rules applied 348 place count 1963 transition count 1912
Reduce places removed 347 places and 0 transitions.
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Iterating post reduction 1 with 363 rules applied. Total rules applied 711 place count 1616 transition count 1896
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 727 place count 1600 transition count 1896
Performed 242 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 242 Pre rules applied. Total rules applied 727 place count 1600 transition count 1654
Deduced a syphon composed of 242 places in 3 ms
Reduce places removed 242 places and 0 transitions.
Iterating global reduction 3 with 484 rules applied. Total rules applied 1211 place count 1358 transition count 1654
Discarding 711 places :
Symmetric choice reduction at 3 with 711 rule applications. Total rules 1922 place count 647 transition count 943
Iterating global reduction 3 with 711 rules applied. Total rules applied 2633 place count 647 transition count 943
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 2635 place count 647 transition count 941
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2636 place count 646 transition count 941
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 4 Pre rules applied. Total rules applied 2636 place count 646 transition count 937
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 2644 place count 642 transition count 937
Discarding 100 places :
Symmetric choice reduction at 5 with 100 rule applications. Total rules 2744 place count 542 transition count 837
Iterating global reduction 5 with 100 rules applied. Total rules applied 2844 place count 542 transition count 837
Ensure Unique test removed 86 transitions
Reduce isomorphic transitions removed 86 transitions.
Iterating post reduction 5 with 86 rules applied. Total rules applied 2930 place count 542 transition count 751
Performed 78 Post agglomeration using F-continuation condition.Transition count delta: 78
Deduced a syphon composed of 78 places in 1 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 6 with 156 rules applied. Total rules applied 3086 place count 464 transition count 673
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 6 with 12 rules applied. Total rules applied 3098 place count 458 transition count 673
Free-agglomeration rule applied 101 times.
Iterating global reduction 6 with 101 rules applied. Total rules applied 3199 place count 458 transition count 572
Reduce places removed 101 places and 0 transitions.
Iterating post reduction 6 with 101 rules applied. Total rules applied 3300 place count 357 transition count 572
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 3302 place count 355 transition count 570
Iterating global reduction 7 with 2 rules applied. Total rules applied 3304 place count 355 transition count 570
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 3306 place count 355 transition count 568
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 8 with 12 rules applied. Total rules applied 3318 place count 355 transition count 556
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 8 with 8 rules applied. Total rules applied 3326 place count 355 transition count 556
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 3327 place count 354 transition count 555
Applied a total of 3327 rules in 490 ms. Remains 354 /1988 variables (removed 1634) and now considering 555/2289 (removed 1734) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 509 ms. Remains : 354/1988 places, 555/2289 transitions.
RANDOM walk for 40000 steps (488 resets) in 1426 ms. (28 steps per ms) remains 7/10 properties
FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (57 resets) in 77 ms. (512 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (24 resets) in 89 ms. (444 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (54 resets) in 81 ms. (487 steps per ms) remains 6/7 properties
FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (54 resets) in 52 ms. (754 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (51 resets) in 55 ms. (714 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (58 resets) in 28 ms. (1379 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (57 resets) in 29 ms. (1333 steps per ms) remains 6/6 properties
[2024-05-31 19:10:44] [INFO ] Flow matrix only has 541 transitions (discarded 14 similar events)
// Phase 1: matrix 541 rows 354 cols
[2024-05-31 19:10:44] [INFO ] Computed 14 invariants in 4 ms
[2024-05-31 19:10:44] [INFO ] State equation strengthened by 82 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 308/354 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/354 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 541/895 variables, 354/368 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/895 variables, 82/450 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/895 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/895 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 895/895 variables, and 450 constraints, problems are : Problem set: 0 solved, 6 unsolved in 387 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 354/354 constraints, ReadFeed: 82/82 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 308/354 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-31 19:10:45] [INFO ] Deduced a trap composed of 21 places in 127 ms of which 2 ms to minimize.
[2024-05-31 19:10:45] [INFO ] Deduced a trap composed of 138 places in 148 ms of which 3 ms to minimize.
[2024-05-31 19:10:45] [INFO ] Deduced a trap composed of 137 places in 105 ms of which 2 ms to minimize.
[2024-05-31 19:10:45] [INFO ] Deduced a trap composed of 38 places in 107 ms of which 2 ms to minimize.
[2024-05-31 19:10:46] [INFO ] Deduced a trap composed of 141 places in 107 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/354 variables, 5/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/354 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 541/895 variables, 354/373 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/895 variables, 82/455 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/895 variables, 6/461 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/895 variables, 0/461 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 0/895 variables, 0/461 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 895/895 variables, and 461 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1806 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 354/354 constraints, ReadFeed: 82/82 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 5/5 constraints]
After SMT, in 2240ms problems are : Problem set: 0 solved, 6 unsolved
FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-2024-11 FALSE TECHNIQUES PARIKH_WALK
FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-2024-05 TRUE TECHNIQUES PARIKH_WALK
FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-2024-08 TRUE TECHNIQUES PARIKH_WALK
FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-2024-02 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 4 properties in 1134 ms.
Support contains 39 out of 354 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 354/354 places, 555/555 transitions.
Graph (trivial) has 72 edges and 354 vertex of which 4 / 354 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 352 transition count 545
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 346 transition count 545
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 13 place count 346 transition count 544
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 15 place count 345 transition count 544
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 25 place count 335 transition count 534
Iterating global reduction 2 with 10 rules applied. Total rules applied 35 place count 335 transition count 534
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 65 place count 320 transition count 519
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 66 place count 320 transition count 518
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 76 place count 310 transition count 508
Iterating global reduction 3 with 10 rules applied. Total rules applied 86 place count 310 transition count 508
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 96 place count 310 transition count 498
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 98 place count 310 transition count 496
Free-agglomeration rule applied 27 times.
Iterating global reduction 4 with 27 rules applied. Total rules applied 125 place count 310 transition count 469
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 4 with 27 rules applied. Total rules applied 152 place count 283 transition count 469
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 157 place count 278 transition count 464
Iterating global reduction 5 with 5 rules applied. Total rules applied 162 place count 278 transition count 464
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 167 place count 278 transition count 459
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 170 place count 278 transition count 456
Applied a total of 170 rules in 95 ms. Remains 278 /354 variables (removed 76) and now considering 456/555 (removed 99) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 95 ms. Remains : 278/354 places, 456/555 transitions.
RANDOM walk for 40000 steps (353 resets) in 217 ms. (183 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (20 resets) in 59 ms. (666 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (49 resets) in 53 ms. (740 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 708339 steps, run timeout after 3001 ms. (steps per millisecond=236 ) properties seen :0 out of 2
Probabilistic random walk after 708339 steps, saw 171369 distinct states, run finished after 3010 ms. (steps per millisecond=235 ) properties seen :0
[2024-05-31 19:10:51] [INFO ] Flow matrix only has 439 transitions (discarded 17 similar events)
// Phase 1: matrix 439 rows 278 cols
[2024-05-31 19:10:51] [INFO ] Computed 14 invariants in 7 ms
[2024-05-31 19:10:51] [INFO ] State equation strengthened by 98 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 239/278 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/278 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 439/717 variables, 278/292 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/717 variables, 98/390 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/717 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/717 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 717/717 variables, and 390 constraints, problems are : Problem set: 0 solved, 2 unsolved in 212 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 278/278 constraints, ReadFeed: 98/98 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/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 239/278 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 19:10:51] [INFO ] Deduced a trap composed of 17 places in 80 ms of which 2 ms to minimize.
[2024-05-31 19:10:51] [INFO ] Deduced a trap composed of 130 places in 75 ms of which 2 ms to minimize.
[2024-05-31 19:10:52] [INFO ] Deduced a trap composed of 128 places in 80 ms of which 3 ms to minimize.
[2024-05-31 19:10:52] [INFO ] Deduced a trap composed of 127 places in 74 ms of which 2 ms to minimize.
[2024-05-31 19:10:52] [INFO ] Deduced a trap composed of 130 places in 73 ms of which 2 ms to minimize.
[2024-05-31 19:10:52] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/278 variables, 6/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/278 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 439/717 variables, 278/298 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/717 variables, 98/396 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/717 variables, 2/398 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/717 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/717 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 717/717 variables, and 398 constraints, problems are : Problem set: 0 solved, 2 unsolved in 858 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 278/278 constraints, ReadFeed: 98/98 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 6/6 constraints]
After SMT, in 1099ms problems are : Problem set: 0 solved, 2 unsolved
FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-2024-14 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 55 ms.
Support contains 37 out of 278 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 278/278 places, 456/456 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 278 transition count 455
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 277 transition count 455
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 275 transition count 453
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7 place count 275 transition count 452
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 8 place count 274 transition count 451
Iterating global reduction 3 with 1 rules applied. Total rules applied 9 place count 274 transition count 451
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 10 place count 274 transition count 450
Applied a total of 10 rules in 28 ms. Remains 274 /278 variables (removed 4) and now considering 450/456 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 274/278 places, 450/456 transitions.
RANDOM walk for 40000 steps (357 resets) in 171 ms. (232 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (19 resets) in 58 ms. (678 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1309768 steps, run timeout after 3001 ms. (steps per millisecond=436 ) properties seen :0 out of 1
Probabilistic random walk after 1309768 steps, saw 278569 distinct states, run finished after 3001 ms. (steps per millisecond=436 ) properties seen :0
[2024-05-31 19:10:55] [INFO ] Flow matrix only has 433 transitions (discarded 17 similar events)
// Phase 1: matrix 433 rows 274 cols
[2024-05-31 19:10:55] [INFO ] Computed 14 invariants in 11 ms
[2024-05-31 19:10:55] [INFO ] State equation strengthened by 96 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 237/274 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/274 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 433/707 variables, 274/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/707 variables, 96/384 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/707 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/707 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 707/707 variables, and 384 constraints, problems are : Problem set: 0 solved, 1 unsolved in 172 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 274/274 constraints, ReadFeed: 96/96 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/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 237/274 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/274 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 433/707 variables, 274/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/707 variables, 96/384 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/707 variables, 1/385 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/707 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/707 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 707/707 variables, and 385 constraints, problems are : Problem set: 0 solved, 1 unsolved in 341 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 274/274 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 549ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 16 ms.
Support contains 37 out of 274 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 274/274 places, 450/450 transitions.
Applied a total of 0 rules in 8 ms. Remains 274 /274 variables (removed 0) and now considering 450/450 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 274/274 places, 450/450 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 274/274 places, 450/450 transitions.
Applied a total of 0 rules in 7 ms. Remains 274 /274 variables (removed 0) and now considering 450/450 (removed 0) transitions.
[2024-05-31 19:10:56] [INFO ] Flow matrix only has 433 transitions (discarded 17 similar events)
[2024-05-31 19:10:56] [INFO ] Invariant cache hit.
[2024-05-31 19:10:56] [INFO ] Implicit Places using invariants in 132 ms returned []
[2024-05-31 19:10:56] [INFO ] Flow matrix only has 433 transitions (discarded 17 similar events)
[2024-05-31 19:10:56] [INFO ] Invariant cache hit.
[2024-05-31 19:10:56] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-31 19:10:56] [INFO ] Implicit Places using invariants and state equation in 294 ms returned []
Implicit Place search using SMT with State Equation took 435 ms to find 0 implicit places.
[2024-05-31 19:10:56] [INFO ] Redundant transitions in 23 ms returned []
Running 446 sub problems to find dead transitions.
[2024-05-31 19:10:56] [INFO ] Flow matrix only has 433 transitions (discarded 17 similar events)
[2024-05-31 19:10:56] [INFO ] Invariant cache hit.
[2024-05-31 19:10:56] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/270 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 1 (OVERLAPS) 4/274 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 446 unsolved
[2024-05-31 19:11:01] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 0 ms to minimize.
[2024-05-31 19:11:02] [INFO ] Deduced a trap composed of 125 places in 85 ms of which 1 ms to minimize.
[2024-05-31 19:11:02] [INFO ] Deduced a trap composed of 141 places in 118 ms of which 2 ms to minimize.
[2024-05-31 19:11:02] [INFO ] Deduced a trap composed of 125 places in 95 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/274 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 446 unsolved
[2024-05-31 19:11:05] [INFO ] Deduced a trap composed of 138 places in 90 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/274 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/274 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 5 (OVERLAPS) 433/707 variables, 274/293 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/707 variables, 96/389 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/707 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 8 (OVERLAPS) 0/707 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 446 unsolved
No progress, stopping.
After SMT solving in domain Real declared 707/707 variables, and 389 constraints, problems are : Problem set: 0 solved, 446 unsolved in 24150 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 274/274 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 446/446 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 446 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/270 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 1 (OVERLAPS) 4/274 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/274 variables, 5/19 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/274 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 4 (OVERLAPS) 433/707 variables, 274/293 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/707 variables, 96/389 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/707 variables, 446/835 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/707 variables, 0/835 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 8 (OVERLAPS) 0/707 variables, 0/835 constraints. Problems are: Problem set: 0 solved, 446 unsolved
No progress, stopping.
After SMT solving in domain Int declared 707/707 variables, and 835 constraints, problems are : Problem set: 0 solved, 446 unsolved in 25218 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 274/274 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 446/446 constraints, Known Traps: 5/5 constraints]
After SMT, in 49925ms problems are : Problem set: 0 solved, 446 unsolved
Search for dead transitions found 0 dead transitions in 49930ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50424 ms. Remains : 274/274 places, 450/450 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Iterating post reduction 0 with 37 rules applied. Total rules applied 37 place count 274 transition count 413
Reduce places removed 20 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 1 with 40 rules applied. Total rules applied 77 place count 254 transition count 393
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 119 place count 212 transition count 351
Iterating global reduction 2 with 42 rules applied. Total rules applied 161 place count 212 transition count 351
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 2 with 30 rules applied. Total rules applied 191 place count 212 transition count 321
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 192 place count 212 transition count 320
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 193 place count 212 transition count 320
Applied a total of 193 rules in 21 ms. Remains 212 /274 variables (removed 62) and now considering 320/450 (removed 130) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 320 rows 212 cols
[2024-05-31 19:11:46] [INFO ] Computed 14 invariants in 1 ms
[2024-05-31 19:11:46] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 19:11:46] [INFO ] [Nat]Absence check using 14 positive place invariants in 4 ms returned sat
[2024-05-31 19:11:47] [INFO ] After 130ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-31 19:11:47] [INFO ] After 211ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-31 19:11:47] [INFO ] After 397ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 494 ms.
[2024-05-31 19:11:47] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 3 ms.
[2024-05-31 19:11:47] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 274 places, 450 transitions and 1642 arcs took 5 ms.
[2024-05-31 19:11:47] [INFO ] Flatten gal took : 61 ms
Total runtime 74219 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : FlexibleBarrier-PT-12b-ReachabilityFireability-2024-03

BK_STOP 1717182707779

--------------------
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
mcc2024
rfs formula name FlexibleBarrier-PT-12b-ReachabilityFireability-2024-03
rfs formula type EF
rfs formula formula --invariant=/tmp/632/inv_0_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

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="FlexibleBarrier-PT-12b"
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 FlexibleBarrier-PT-12b, 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 r496-tall-171640602600079"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FlexibleBarrier-PT-12b.tgz
mv FlexibleBarrier-PT-12b 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 ;