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.r536-tall-171690533400893.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 Szymanski-PT-b10, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r536-tall-171690533400893
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.1M
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 16:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 19:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 11 15:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 141K Apr 11 15:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.5K Apr 11 15:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 29K Apr 11 15:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 19 07:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 19 15:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 3.7M 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 positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME Szymanski-PT-b10-UpperBounds-00
FORMULA_NAME Szymanski-PT-b10-UpperBounds-01
FORMULA_NAME Szymanski-PT-b10-UpperBounds-02
FORMULA_NAME Szymanski-PT-b10-UpperBounds-03
FORMULA_NAME Szymanski-PT-b10-UpperBounds-04
FORMULA_NAME Szymanski-PT-b10-UpperBounds-05
FORMULA_NAME Szymanski-PT-b10-UpperBounds-06
FORMULA_NAME Szymanski-PT-b10-UpperBounds-07
FORMULA_NAME Szymanski-PT-b10-UpperBounds-08
FORMULA_NAME Szymanski-PT-b10-UpperBounds-09
FORMULA_NAME Szymanski-PT-b10-UpperBounds-10
FORMULA_NAME Szymanski-PT-b10-UpperBounds-11
FORMULA_NAME Szymanski-PT-b10-UpperBounds-12
FORMULA_NAME Szymanski-PT-b10-UpperBounds-13
FORMULA_NAME Szymanski-PT-b10-UpperBounds-14
FORMULA_NAME Szymanski-PT-b10-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717284823176

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Szymanski-PT-b10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 23:33:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-01 23:33:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 23:33:44] [INFO ] Load time of PNML (sax parser for PT used): 325 ms
[2024-06-01 23:33:44] [INFO ] Transformed 568 places.
[2024-06-01 23:33:44] [INFO ] Transformed 8320 transitions.
[2024-06-01 23:33:44] [INFO ] Parsed PT model containing 568 places and 8320 transitions and 33408 arcs in 459 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Deduced a syphon composed of 260 places in 19 ms
Reduce places removed 260 places and 256 transitions.
FORMULA Szymanski-PT-b10-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b10-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b10-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b10-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b10-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b10-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b10-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b10-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b10-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-06-01 23:33:44] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
// Phase 1: matrix 2733 rows 308 cols
[2024-06-01 23:33:44] [INFO ] Computed 3 invariants in 57 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 21, 1, 1, 21, 21, 1]
RANDOM walk for 10000 steps (3 resets) in 54 ms. (181 steps per ms)
FORMULA Szymanski-PT-b10-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Szymanski-PT-b10-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Szymanski-PT-b10-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (9 resets) in 155 ms. (256 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[10, 9, 10, 0] Max Struct:[21, 21, 21, 1]
[2024-06-01 23:33:45] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
[2024-06-01 23:33:45] [INFO ] Invariant cache hit.
[2024-06-01 23:33:45] [INFO ] [Real]Absence check using 2 positive place invariants in 7 ms returned sat
[2024-06-01 23:33:45] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 7 ms returned sat
[2024-06-01 23:33:45] [INFO ] [Real]Absence check using state equation in 512 ms returned sat
[2024-06-01 23:33:46] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-06-01 23:33:46] [INFO ] [Real]Added 147 Read/Feed constraints in 157 ms returned sat
[2024-06-01 23:33:46] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 23:33:46] [INFO ] [Nat]Absence check using 2 positive place invariants in 31 ms returned sat
[2024-06-01 23:33:46] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2024-06-01 23:33:46] [INFO ] [Nat]Absence check using state equation in 444 ms returned sat
[2024-06-01 23:33:47] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 23:33:47] [INFO ] [Nat]Added 147 Read/Feed constraints in 1058 ms returned unknown
[2024-06-01 23:33:48] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-06-01 23:33:48] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 23:33:48] [INFO ] [Real]Absence check using state equation in 379 ms returned sat
[2024-06-01 23:33:49] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 23:33:49] [INFO ] [Real]Added 147 Read/Feed constraints in 967 ms returned sat
[2024-06-01 23:33:49] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 23:33:49] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-06-01 23:33:49] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2024-06-01 23:33:49] [INFO ] [Nat]Absence check using state equation in 369 ms returned sat
[2024-06-01 23:33:50] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 23:33:50] [INFO ] [Nat]Added 147 Read/Feed constraints in 1040 ms returned unknown
[2024-06-01 23:33:51] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-06-01 23:33:51] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 23:33:51] [INFO ] [Real]Absence check using state equation in 362 ms returned unsat
[2024-06-01 23:33:51] [INFO ] [Real]Absence check using 2 positive place invariants in 7 ms returned sat
[2024-06-01 23:33:51] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2024-06-01 23:33:51] [INFO ] [Real]Absence check using state equation in 424 ms returned sat
[2024-06-01 23:33:52] [INFO ] [Real]Added 147 Read/Feed constraints in 503 ms returned sat
[2024-06-01 23:33:52] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 23:33:52] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-06-01 23:33:52] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 23:33:52] [INFO ] [Nat]Absence check using state equation in 419 ms returned sat
[2024-06-01 23:33:53] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 23:33:53] [INFO ] [Nat]Added 147 Read/Feed constraints in 823 ms returned sat
[2024-06-01 23:33:54] [INFO ] Deduced a trap composed of 53 places in 606 ms of which 22 ms to minimize.
[2024-06-01 23:33:55] [INFO ] Deduced a trap composed of 146 places in 738 ms of which 2 ms to minimize.
[2024-06-01 23:33:55] [INFO ] Deduced a trap composed of 147 places in 437 ms of which 4 ms to minimize.
[2024-06-01 23:33:56] [INFO ] Deduced a trap composed of 138 places in 369 ms of which 2 ms to minimize.
[2024-06-01 23:33:56] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2471 ms
[2024-06-01 23:33:56] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2722 transitions) in 646 ms.
[2024-06-01 23:33:57] [INFO ] Added : 0 causal constraints over 0 iterations in 831 ms. Result :sat
Minimization took 396 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[10, 9, 10, 0] Max Struct:[21, 21, 10, 1]
FORMULA Szymanski-PT-b10-UpperBounds-12 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[10, 9, 0] Max Struct:[21, 21, 1]
Support contains 3 out of 308 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 8064/8064 transitions.
Graph (complete) has 9195 edges and 308 vertex of which 306 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.18 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 128 transitions
Reduce isomorphic transitions removed 128 transitions.
Iterating post reduction 0 with 128 rules applied. Total rules applied 129 place count 306 transition count 7936
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 130 place count 305 transition count 7808
Iterating global reduction 1 with 1 rules applied. Total rules applied 131 place count 305 transition count 7808
Applied a total of 131 rules in 437 ms. Remains 305 /308 variables (removed 3) and now considering 7808/8064 (removed 256) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 451 ms. Remains : 305/308 places, 7808/8064 transitions.
[2024-06-01 23:33:57] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
// Phase 1: matrix 2604 rows 305 cols
[2024-06-01 23:33:58] [INFO ] Computed 3 invariants in 23 ms
Current structural bounds on expressions (after invariants) : Max Seen:[10, 9, 0] Max Struct:[11, 11, 1]
RANDOM walk for 1000004 steps (2 resets) in 974 ms. (1025 steps per ms)
BEST_FIRST walk for 3000002 steps (6 resets) in 2333 ms. (1285 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[10, 10, 0] Max Struct:[11, 11, 1]
[2024-06-01 23:34:01] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-06-01 23:34:01] [INFO ] Invariant cache hit.
[2024-06-01 23:34:01] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-06-01 23:34:01] [INFO ] [Real]Absence check using state equation in 386 ms returned sat
[2024-06-01 23:34:01] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-06-01 23:34:02] [INFO ] [Real]Added 147 Read/Feed constraints in 804 ms returned sat
[2024-06-01 23:34:02] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 23:34:02] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-06-01 23:34:03] [INFO ] [Nat]Absence check using state equation in 367 ms returned sat
[2024-06-01 23:34:06] [INFO ] [Nat]Added 147 Read/Feed constraints in 3742 ms returned sat
[2024-06-01 23:34:07] [INFO ] Deduced a trap composed of 36 places in 596 ms of which 3 ms to minimize.
[2024-06-01 23:34:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 644 ms
[2024-06-01 23:34:07] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-06-01 23:34:07] [INFO ] [Real]Absence check using state equation in 359 ms returned sat
[2024-06-01 23:34:09] [INFO ] [Real]Added 147 Read/Feed constraints in 1774 ms returned sat
[2024-06-01 23:34:09] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 23:34:09] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-06-01 23:34:10] [INFO ] [Nat]Absence check using state equation in 350 ms returned sat
[2024-06-01 23:34:14] [INFO ] [Nat]Added 147 Read/Feed constraints in 4513 ms returned sat
[2024-06-01 23:34:15] [INFO ] Deduced a trap composed of 31 places in 591 ms of which 4 ms to minimize.
[2024-06-01 23:34:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 663 ms
[2024-06-01 23:34:15] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-06-01 23:34:15] [INFO ] [Real]Absence check using state equation in 402 ms returned sat
[2024-06-01 23:34:16] [INFO ] [Real]Added 147 Read/Feed constraints in 339 ms returned sat
[2024-06-01 23:34:16] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 23:34:16] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-06-01 23:34:16] [INFO ] [Nat]Absence check using state equation in 386 ms returned sat
[2024-06-01 23:34:17] [INFO ] [Nat]Added 147 Read/Feed constraints in 409 ms returned sat
[2024-06-01 23:34:17] [INFO ] Deduced a trap composed of 144 places in 504 ms of which 3 ms to minimize.
[2024-06-01 23:34:18] [INFO ] Deduced a trap composed of 131 places in 504 ms of which 2 ms to minimize.
[2024-06-01 23:34:18] [INFO ] Deduced a trap composed of 132 places in 489 ms of which 2 ms to minimize.
[2024-06-01 23:34:19] [INFO ] Deduced a trap composed of 140 places in 335 ms of which 2 ms to minimize.
[2024-06-01 23:34:19] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2124 ms
[2024-06-01 23:34:19] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2593 transitions) in 486 ms.
[2024-06-01 23:34:19] [INFO ] Added : 0 causal constraints over 0 iterations in 653 ms. Result :sat
Minimization took 4917 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[10, 10, 0] Max Struct:[10, 10, 1]
FORMULA Szymanski-PT-b10-UpperBounds-10 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Szymanski-PT-b10-UpperBounds-05 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 305 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p207) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7807/7807 transitions.
Applied a total of 0 rules in 265 ms. Remains 305 /305 variables (removed 0) and now considering 7807/7807 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 265 ms. Remains : 305/305 places, 7807/7807 transitions.
[2024-06-01 23:34:25] [INFO ] Flow matrix only has 2603 transitions (discarded 5204 similar events)
// Phase 1: matrix 2603 rows 305 cols
[2024-06-01 23:34:25] [INFO ] Computed 3 invariants in 22 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000004 steps (2 resets) in 891 ms. (1121 steps per ms)
BEST_FIRST walk for 1000000 steps (2 resets) in 773 ms. (1291 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-06-01 23:34:26] [INFO ] Flow matrix only has 2603 transitions (discarded 5204 similar events)
[2024-06-01 23:34:26] [INFO ] Invariant cache hit.
[2024-06-01 23:34:26] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-06-01 23:34:27] [INFO ] [Real]Absence check using state equation in 381 ms returned sat
[2024-06-01 23:34:27] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-06-01 23:34:27] [INFO ] [Real]Added 147 Read/Feed constraints in 111 ms returned sat
[2024-06-01 23:34:27] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 23:34:27] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-06-01 23:34:27] [INFO ] [Nat]Absence check using state equation in 403 ms returned sat
[2024-06-01 23:34:28] [INFO ] [Nat]Added 147 Read/Feed constraints in 388 ms returned sat
[2024-06-01 23:34:28] [INFO ] Deduced a trap composed of 78 places in 533 ms of which 2 ms to minimize.
[2024-06-01 23:34:29] [INFO ] Deduced a trap composed of 129 places in 549 ms of which 3 ms to minimize.
[2024-06-01 23:34:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1271 ms
[2024-06-01 23:34:30] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2592 transitions) in 577 ms.
[2024-06-01 23:34:30] [INFO ] Added : 0 causal constraints over 0 iterations in 743 ms. Result :sat
Minimization took 5003 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7807/7807 transitions.
Applied a total of 0 rules in 291 ms. Remains 305 /305 variables (removed 0) and now considering 7807/7807 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 291 ms. Remains : 305/305 places, 7807/7807 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7807/7807 transitions.
Applied a total of 0 rules in 203 ms. Remains 305 /305 variables (removed 0) and now considering 7807/7807 (removed 0) transitions.
[2024-06-01 23:34:35] [INFO ] Flow matrix only has 2603 transitions (discarded 5204 similar events)
[2024-06-01 23:34:35] [INFO ] Invariant cache hit.
[2024-06-01 23:34:36] [INFO ] Implicit Places using invariants in 639 ms returned []
[2024-06-01 23:34:36] [INFO ] Flow matrix only has 2603 transitions (discarded 5204 similar events)
[2024-06-01 23:34:36] [INFO ] Invariant cache hit.
[2024-06-01 23:34:36] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-06-01 23:34:50] [INFO ] Implicit Places using invariants and state equation in 13577 ms returned []
Implicit Place search using SMT with State Equation took 14220 ms to find 0 implicit places.
[2024-06-01 23:34:50] [INFO ] Redundant transitions in 949 ms returned []
Running 7805 sub problems to find dead transitions.
[2024-06-01 23:34:51] [INFO ] Flow matrix only has 2603 transitions (discarded 5204 similar events)
[2024-06-01 23:34:51] [INFO ] Invariant cache hit.
[2024-06-01 23:34:51] [INFO ] State equation strengthened by 147 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/304 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 7805 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 304/2908 variables, and 2 constraints, problems are : Problem set: 0 solved, 7805 unsolved in 30167 ms.
Refiners :[Positive P Invariants (semi-flows): 2/3 constraints, State Equation: 0/305 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 7805/7805 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7805 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/304 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 7805 unsolved
[2024-06-01 23:35:53] [INFO ] Deduced a trap composed of 84 places in 376 ms of which 2 ms to minimize.
[2024-06-01 23:35:53] [INFO ] Deduced a trap composed of 82 places in 350 ms of which 1 ms to minimize.
[2024-06-01 23:35:54] [INFO ] Deduced a trap composed of 81 places in 337 ms of which 1 ms to minimize.
[2024-06-01 23:35:56] [INFO ] Deduced a trap composed of 101 places in 309 ms of which 1 ms to minimize.
[2024-06-01 23:35:57] [INFO ] Deduced a trap composed of 122 places in 342 ms of which 2 ms to minimize.
[2024-06-01 23:35:57] [INFO ] Deduced a trap composed of 42 places in 315 ms of which 2 ms to minimize.
[2024-06-01 23:36:02] [INFO ] Deduced a trap composed of 91 places in 362 ms of which 1 ms to minimize.
[2024-06-01 23:36:04] [INFO ] Deduced a trap composed of 84 places in 311 ms of which 1 ms to minimize.
[2024-06-01 23:36:06] [INFO ] Deduced a trap composed of 42 places in 318 ms of which 1 ms to minimize.
[2024-06-01 23:36:07] [INFO ] Deduced a trap composed of 48 places in 285 ms of which 2 ms to minimize.
[2024-06-01 23:36:07] [INFO ] Deduced a trap composed of 42 places in 239 ms of which 1 ms to minimize.
[2024-06-01 23:36:07] [INFO ] Deduced a trap composed of 47 places in 245 ms of which 1 ms to minimize.
[2024-06-01 23:36:10] [INFO ] Deduced a trap composed of 36 places in 248 ms of which 1 ms to minimize.
[2024-06-01 23:36:14] [INFO ] Deduced a trap composed of 49 places in 253 ms of which 0 ms to minimize.
[2024-06-01 23:36:14] [INFO ] Deduced a trap composed of 57 places in 262 ms of which 1 ms to minimize.
[2024-06-01 23:36:17] [INFO ] Deduced a trap composed of 44 places in 199 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 304/2908 variables, and 18 constraints, problems are : Problem set: 0 solved, 7805 unsolved in 30096 ms.
Refiners :[Positive P Invariants (semi-flows): 2/3 constraints, State Equation: 0/305 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 0/7805 constraints, Known Traps: 16/16 constraints]
After SMT, in 88386ms problems are : Problem set: 0 solved, 7805 unsolved
Search for dead transitions found 0 dead transitions in 88497ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 103920 ms. Remains : 305/305 places, 7807/7807 transitions.
RANDOM walk for 40015 steps (8 resets) in 509 ms. (78 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 144 ms. (275 steps per ms) remains 2/2 properties
BEST_FIRST walk for 34540 steps (8 resets) in 132 ms. (259 steps per ms) remains 0/2 properties
FORMULA Szymanski-PT-b10-UpperBounds-15 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 155539 ms.
ITS solved all properties within timeout

BK_STOP 1717284979972

--------------------
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 UpperBounds -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="Szymanski-PT-b10"
export BK_EXAMINATION="UpperBounds"
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 Szymanski-PT-b10, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r536-tall-171690533400893"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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