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-171654446300078.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 PolyORBLF-COL-S02J04T06, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r516-tajo-171654446300078
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 7.3K Apr 11 16:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Apr 11 16:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Apr 11 16:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 11 16:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.2K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 11 17:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 89K Apr 11 17:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Apr 11 16:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 38K Apr 11 16:59 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 154K 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 PolyORBLF-COL-S02J04T06-ReachabilityCardinality-2024-00
FORMULA_NAME PolyORBLF-COL-S02J04T06-ReachabilityCardinality-2024-01
FORMULA_NAME PolyORBLF-COL-S02J04T06-ReachabilityCardinality-2024-02
FORMULA_NAME PolyORBLF-COL-S02J04T06-ReachabilityCardinality-2024-03
FORMULA_NAME PolyORBLF-COL-S02J04T06-ReachabilityCardinality-2024-04
FORMULA_NAME PolyORBLF-COL-S02J04T06-ReachabilityCardinality-2024-05
FORMULA_NAME PolyORBLF-COL-S02J04T06-ReachabilityCardinality-2024-06
FORMULA_NAME PolyORBLF-COL-S02J04T06-ReachabilityCardinality-2024-07
FORMULA_NAME PolyORBLF-COL-S02J04T06-ReachabilityCardinality-2024-08
FORMULA_NAME PolyORBLF-COL-S02J04T06-ReachabilityCardinality-2024-09
FORMULA_NAME PolyORBLF-COL-S02J04T06-ReachabilityCardinality-2024-10
FORMULA_NAME PolyORBLF-COL-S02J04T06-ReachabilityCardinality-2024-11
FORMULA_NAME PolyORBLF-COL-S02J04T06-ReachabilityCardinality-2024-12
FORMULA_NAME PolyORBLF-COL-S02J04T06-ReachabilityCardinality-2024-13
FORMULA_NAME PolyORBLF-COL-S02J04T06-ReachabilityCardinality-2024-14
FORMULA_NAME PolyORBLF-COL-S02J04T06-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717248211194

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-COL-S02J04T06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 13:23:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 13:23:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 13:23:32] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-06-01 13:23:33] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 13:23:33] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 805 ms
[2024-06-01 13:23:33] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 476 PT places and 952.0 transition bindings in 54 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 30 ms.
Working with output stream class java.io.PrintStream
[2024-06-01 13:23:33] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 6 ms.
[2024-06-01 13:23:33] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Remains 16 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
RANDOM walk for 40000 steps (19 resets) in 2690 ms. (14 steps per ms) remains 12/16 properties
BEST_FIRST walk for 40001 steps (8 resets) in 613 ms. (65 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (8 resets) in 342 ms. (116 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (11 resets) in 306 ms. (130 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (14 resets) in 377 ms. (105 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (14 resets) in 346 ms. (115 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (12 resets) in 375 ms. (106 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (12 resets) in 292 ms. (136 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40000 steps (11 resets) in 278 ms. (143 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (13 resets) in 221 ms. (180 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (12 resets) in 764 ms. (52 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (8 resets) in 178 ms. (223 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (61 resets) in 272 ms. (146 steps per ms) remains 12/12 properties
[2024-06-01 13:23:36] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2024-06-01 13:23:36] [INFO ] Computed 26 invariants in 11 ms
[2024-06-01 13:23:36] [INFO ] State equation strengthened by 8 read => feed constraints.
Problem PolyORBLF-COL-S02J04T06-ReachabilityCardinality-2024-07 is UNSAT
Problem PolyORBLF-COL-S02J04T06-ReachabilityCardinality-2024-09 is UNSAT
Problem PolyORBLF-COL-S02J04T06-ReachabilityCardinality-2024-15 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 9/9 constraints. Problems are: Problem set: 3 solved, 9 unsolved
Problem PolyORBLF-COL-S02J04T06-ReachabilityCardinality-2024-04 is UNSAT
Problem PolyORBLF-COL-S02J04T06-ReachabilityCardinality-2024-12 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 10/19 constraints. Problems are: Problem set: 5 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 0/19 constraints. Problems are: Problem set: 5 solved, 7 unsolved
Problem PolyORBLF-COL-S02J04T06-ReachabilityCardinality-2024-02 is UNSAT
Problem PolyORBLF-COL-S02J04T06-ReachabilityCardinality-2024-06 is UNSAT
Problem PolyORBLF-COL-S02J04T06-ReachabilityCardinality-2024-13 is UNSAT
Problem PolyORBLF-COL-S02J04T06-ReachabilityCardinality-2024-14 is UNSAT
At refinement iteration 3 (OVERLAPS) 3/80 variables, 2/21 constraints. Problems are: Problem set: 9 solved, 3 unsolved
Problem PolyORBLF-COL-S02J04T06-ReachabilityCardinality-2024-01 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 4/25 constraints. Problems are: Problem set: 10 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/80 variables, 0/25 constraints. Problems are: Problem set: 10 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 1/81 variables, 1/26 constraints. Problems are: Problem set: 10 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/81 variables, 0/26 constraints. Problems are: Problem set: 10 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 64/145 variables, 81/107 constraints. Problems are: Problem set: 10 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/145 variables, 8/115 constraints. Problems are: Problem set: 10 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/145 variables, 0/115 constraints. Problems are: Problem set: 10 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/145 variables, 0/115 constraints. Problems are: Problem set: 10 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 145/145 variables, and 115 constraints, problems are : Problem set: 10 solved, 2 unsolved in 360 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 81/81 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 10 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 10 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 31/52 variables, 7/7 constraints. Problems are: Problem set: 10 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/7 constraints. Problems are: Problem set: 10 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/54 variables, 2/9 constraints. Problems are: Problem set: 10 solved, 2 unsolved
[2024-06-01 13:23:36] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 8 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 1/10 constraints. Problems are: Problem set: 10 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/10 constraints. Problems are: Problem set: 10 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 19/73 variables, 12/22 constraints. Problems are: Problem set: 10 solved, 2 unsolved
[2024-06-01 13:23:36] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 2 ms to minimize.
Problem PolyORBLF-COL-S02J04T06-ReachabilityCardinality-2024-00 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/73 variables, 1/23 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/73 variables, 0/23 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 5/78 variables, 3/26 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/78 variables, 0/26 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/79 variables, 1/27 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/79 variables, 0/27 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 64/143 variables, 79/106 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/143 variables, 8/114 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/143 variables, 1/115 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/143 variables, 0/115 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/145 variables, 2/117 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/145 variables, 1/118 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/145 variables, 0/118 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/145 variables, 0/118 constraints. Problems are: Problem set: 11 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 145/145 variables, and 118 constraints, problems are : Problem set: 11 solved, 1 unsolved in 263 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 81/81 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 1/12 constraints, Known Traps: 2/2 constraints]
After SMT, in 701ms problems are : Problem set: 11 solved, 1 unsolved
Parikh walk visited 0 properties in 10 ms.
Support contains 8 out of 81 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 65/65 transitions.
Ensure Unique test removed 1 places
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 7 rules applied. Total rules applied 7 place count 80 transition count 59
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 74 transition count 58
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 15 place count 73 transition count 58
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 15 place count 73 transition count 57
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 17 place count 72 transition count 57
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 23 place count 69 transition count 54
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 26 place count 69 transition count 51
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 29 place count 66 transition count 51
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 30 place count 66 transition count 51
Applied a total of 30 rules in 40 ms. Remains 66 /81 variables (removed 15) and now considering 51/65 (removed 14) transitions.
Running 50 sub problems to find dead transitions.
[2024-06-01 13:23:37] [INFO ] Flow matrix only has 50 transitions (discarded 1 similar events)
// Phase 1: matrix 50 rows 66 cols
[2024-06-01 13:23:37] [INFO ] Computed 25 invariants in 4 ms
[2024-06-01 13:23:37] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 15/24 constraints. Problems are: Problem set: 0 solved, 50 unsolved
[2024-06-01 13:23:37] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
[2024-06-01 13:23:37] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
[2024-06-01 13:23:37] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-06-01 13:23:37] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 1 ms to minimize.
[2024-06-01 13:23:37] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-06-01 13:23:37] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 1 ms to minimize.
[2024-06-01 13:23:37] [INFO ] Deduced a trap composed of 22 places in 24 ms of which 1 ms to minimize.
[2024-06-01 13:23:37] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2024-06-01 13:23:37] [INFO ] Deduced a trap composed of 24 places in 24 ms of which 1 ms to minimize.
[2024-06-01 13:23:37] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
[2024-06-01 13:23:37] [INFO ] Deduced a trap composed of 23 places in 25 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 11/35 constraints. Problems are: Problem set: 0 solved, 50 unsolved
[2024-06-01 13:23:37] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 50 unsolved
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
At refinement iteration 5 (OVERLAPS) 1/66 variables, 1/37 constraints. Problems are: Problem set: 2 solved, 48 unsolved
[2024-06-01 13:23:38] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 2 ms to minimize.
[2024-06-01 13:23:38] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 1 ms to minimize.
[2024-06-01 13:23:38] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 1 ms to minimize.
[2024-06-01 13:23:38] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 1 ms to minimize.
[2024-06-01 13:23:38] [INFO ] Deduced a trap composed of 11 places in 18 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 5/42 constraints. Problems are: Problem set: 2 solved, 48 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/66 variables, 0/42 constraints. Problems are: Problem set: 2 solved, 48 unsolved
At refinement iteration 8 (OVERLAPS) 50/116 variables, 66/108 constraints. Problems are: Problem set: 2 solved, 48 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/116 variables, 8/116 constraints. Problems are: Problem set: 2 solved, 48 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/116 variables, 0/116 constraints. Problems are: Problem set: 2 solved, 48 unsolved
At refinement iteration 11 (OVERLAPS) 0/116 variables, 0/116 constraints. Problems are: Problem set: 2 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Real declared 116/116 variables, and 116 constraints, problems are : Problem set: 2 solved, 48 unsolved in 1698 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 66/66 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 50/50 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 2 solved, 48 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 9/9 constraints. Problems are: Problem set: 2 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 15/24 constraints. Problems are: Problem set: 2 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 13/37 constraints. Problems are: Problem set: 2 solved, 48 unsolved
[2024-06-01 13:23:38] [INFO ] Deduced a trap composed of 25 places in 24 ms of which 1 ms to minimize.
[2024-06-01 13:23:38] [INFO ] Deduced a trap composed of 26 places in 23 ms of which 0 ms to minimize.
[2024-06-01 13:23:38] [INFO ] Deduced a trap composed of 24 places in 22 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 3/40 constraints. Problems are: Problem set: 2 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/40 constraints. Problems are: Problem set: 2 solved, 48 unsolved
At refinement iteration 5 (OVERLAPS) 1/66 variables, 1/41 constraints. Problems are: Problem set: 2 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 4/45 constraints. Problems are: Problem set: 2 solved, 48 unsolved
[2024-06-01 13:23:39] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-06-01 13:23:39] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/66 variables, 2/47 constraints. Problems are: Problem set: 2 solved, 48 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/66 variables, 0/47 constraints. Problems are: Problem set: 2 solved, 48 unsolved
At refinement iteration 9 (OVERLAPS) 50/116 variables, 66/113 constraints. Problems are: Problem set: 2 solved, 48 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/116 variables, 8/121 constraints. Problems are: Problem set: 2 solved, 48 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/116 variables, 48/169 constraints. Problems are: Problem set: 2 solved, 48 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/116 variables, 0/169 constraints. Problems are: Problem set: 2 solved, 48 unsolved
At refinement iteration 13 (OVERLAPS) 0/116 variables, 0/169 constraints. Problems are: Problem set: 2 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Int declared 116/116 variables, and 169 constraints, problems are : Problem set: 2 solved, 48 unsolved in 1778 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 66/66 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 48/50 constraints, Known Traps: 22/22 constraints]
After SMT, in 3500ms problems are : Problem set: 2 solved, 48 unsolved
Search for dead transitions found 2 dead transitions in 3501ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 2 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 66/81 places, 49/65 transitions.
Reduce places removed 2 places and 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 64 transition count 47
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 63 transition count 45
Deduced a syphon composed of 1 places in 1 ms
Applied a total of 3 rules in 5 ms. Remains 63 /66 variables (removed 3) and now considering 45/49 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 3561 ms. Remains : 63/81 places, 45/65 transitions.
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
RANDOM walk for 0 steps (0 resets) in 6 ms. (0 steps per ms) remains 0/0 properties
[2024-06-01 13:23:40] [INFO ] Flatten gal took : 34 ms
[2024-06-01 13:23:40] [INFO ] Flatten gal took : 23 ms
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
FORMULA PolyORBLF-COL-S02J04T06-ReachabilityCardinality-2024-00 FALSE TECHNIQUES CPN_APPROX
FORMULA PolyORBLF-COL-S02J04T06-ReachabilityCardinality-2024-01 FALSE TECHNIQUES CPN_APPROX
FORMULA PolyORBLF-COL-S02J04T06-ReachabilityCardinality-2024-02 FALSE TECHNIQUES CPN_APPROX
FORMULA PolyORBLF-COL-S02J04T06-ReachabilityCardinality-2024-03 TRUE TECHNIQUES CPN_APPROX
FORMULA PolyORBLF-COL-S02J04T06-ReachabilityCardinality-2024-04 TRUE TECHNIQUES CPN_APPROX
FORMULA PolyORBLF-COL-S02J04T06-ReachabilityCardinality-2024-06 FALSE TECHNIQUES CPN_APPROX
FORMULA PolyORBLF-COL-S02J04T06-ReachabilityCardinality-2024-07 FALSE TECHNIQUES CPN_APPROX
FORMULA PolyORBLF-COL-S02J04T06-ReachabilityCardinality-2024-09 TRUE TECHNIQUES CPN_APPROX
FORMULA PolyORBLF-COL-S02J04T06-ReachabilityCardinality-2024-12 FALSE TECHNIQUES CPN_APPROX
FORMULA PolyORBLF-COL-S02J04T06-ReachabilityCardinality-2024-13 TRUE TECHNIQUES CPN_APPROX
FORMULA PolyORBLF-COL-S02J04T06-ReachabilityCardinality-2024-14 FALSE TECHNIQUES CPN_APPROX
FORMULA PolyORBLF-COL-S02J04T06-ReachabilityCardinality-2024-15 TRUE TECHNIQUES CPN_APPROX
Transition T_2315 forces synchronizations/join behavior on parameter t of sort Threads
Transition GoPerformWork forces synchronizations/join behavior on parameter j of sort Jobs
Transition T_0376 forces synchronizations/join behavior on parameter s of sort Sources
[2024-06-01 13:23:40] [INFO ] Unfolded HLPN to a Petri net with 476 places and 920 transitions 4242 arcs in 41 ms.
[2024-06-01 13:23:40] [INFO ] Unfolded 16 HLPN properties in 2 ms.
Ensure Unique test removed 96 transitions
Reduce redundant transitions removed 96 transitions.
RANDOM walk for 475 steps (0 resets) in 22 ms. (20 steps per ms) remains 0/4 properties
FORMULA PolyORBLF-COL-S02J04T06-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S02J04T06-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S02J04T06-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S02J04T06-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 8278 ms.
ITS solved all properties within timeout

BK_STOP 1717248220897

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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 ReachabilityCardinality -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="PolyORBLF-COL-S02J04T06"
export BK_EXAMINATION="ReachabilityCardinality"
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 PolyORBLF-COL-S02J04T06, examination is ReachabilityCardinality"
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-171654446300078"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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