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.r289-tajo-171654446000485.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 greatspnxred
Input is PolyORBNT-PT-S10J20, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r289-tajo-171654446000485
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 24M
-rw-r--r-- 1 mcc users 23K Apr 12 11:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 131K Apr 12 11:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 958K Apr 12 11:17 CTLFireability.txt
-rw-r--r-- 1 mcc users 3.6M Apr 12 11:17 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 8.6K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 39K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 32K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 114K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 31K Apr 12 14:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 183K Apr 12 14:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 1.3M Apr 12 13:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 4.7M Apr 12 13:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.5K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 13M 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 PolyORBNT-PT-S10J20-UpperBounds-00
FORMULA_NAME PolyORBNT-PT-S10J20-UpperBounds-01
FORMULA_NAME PolyORBNT-PT-S10J20-UpperBounds-02
FORMULA_NAME PolyORBNT-PT-S10J20-UpperBounds-03
FORMULA_NAME PolyORBNT-PT-S10J20-UpperBounds-04
FORMULA_NAME PolyORBNT-PT-S10J20-UpperBounds-05
FORMULA_NAME PolyORBNT-PT-S10J20-UpperBounds-06
FORMULA_NAME PolyORBNT-PT-S10J20-UpperBounds-07
FORMULA_NAME PolyORBNT-PT-S10J20-UpperBounds-08
FORMULA_NAME PolyORBNT-PT-S10J20-UpperBounds-09
FORMULA_NAME PolyORBNT-PT-S10J20-UpperBounds-10
FORMULA_NAME PolyORBNT-PT-S10J20-UpperBounds-11
FORMULA_NAME PolyORBNT-PT-S10J20-UpperBounds-12
FORMULA_NAME PolyORBNT-PT-S10J20-UpperBounds-13
FORMULA_NAME PolyORBNT-PT-S10J20-UpperBounds-14
FORMULA_NAME PolyORBNT-PT-S10J20-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716889579210

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-PT-S10J20
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 09:46:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-28 09:46:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 09:46:21] [INFO ] Load time of PNML (sax parser for PT used): 791 ms
[2024-05-28 09:46:21] [INFO ] Transformed 474 places.
[2024-05-28 09:46:21] [INFO ] Transformed 11760 transitions.
[2024-05-28 09:46:21] [INFO ] Parsed PT model containing 474 places and 11760 transitions and 111119 arcs in 1063 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 18 ms.
Reduction of identical properties reduced properties to check from 16 to 15
Ensure Unique test removed 10110 transitions
Reduce redundant transitions removed 10110 transitions.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 1, 0, 0, 0, 0, 10, 1, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 1, 0, 0, 0, 0, 10, 1, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-28 09:46:22] [INFO ] Flow matrix only has 1641 transitions (discarded 9 similar events)
// Phase 1: matrix 1641 rows 474 cols
[2024-05-28 09:46:22] [INFO ] Computed 72 invariants in 82 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 1, 0, 0, 0, 0, 10, 1, 0, 0, 0, 0, 0] Max Struct:[190, 68, 23, 61, 158, 39, 158, 39, 10, 1, 4, 118, 98, 752, 1]
FORMULA PolyORBNT-PT-S10J20-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S10J20-UpperBounds-09 10 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 10000 steps (560 resets) in 385 ms. (25 steps per ms)
BEST_FIRST walk for 130010 steps (1372 resets) in 533 ms. (243 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[10, 3, 1, 1, 0, 0, 1, 0, 1, 0, 0, 4, 0] Max Struct:[190, 68, 23, 61, 158, 39, 158, 39, 4, 118, 98, 752, 1]
[2024-05-28 09:46:23] [INFO ] Flow matrix only has 1641 transitions (discarded 9 similar events)
[2024-05-28 09:46:23] [INFO ] Invariant cache hit.
[2024-05-28 09:46:23] [INFO ] [Real]Absence check using 45 positive place invariants in 25 ms returned sat
[2024-05-28 09:46:23] [INFO ] [Real]Absence check using 45 positive and 27 generalized place invariants in 11 ms returned unsat
[2024-05-28 09:46:23] [INFO ] [Real]Absence check using 45 positive place invariants in 16 ms returned sat
[2024-05-28 09:46:23] [INFO ] [Real]Absence check using 45 positive and 27 generalized place invariants in 26 ms returned sat
[2024-05-28 09:46:24] [INFO ] [Real]Absence check using state equation in 894 ms returned sat
[2024-05-28 09:46:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 09:46:24] [INFO ] [Nat]Absence check using 45 positive place invariants in 25 ms returned sat
[2024-05-28 09:46:24] [INFO ] [Nat]Absence check using 45 positive and 27 generalized place invariants in 14 ms returned sat
[2024-05-28 09:46:26] [INFO ] [Nat]Absence check using state equation in 1483 ms returned sat
[2024-05-28 09:46:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 09:46:26] [INFO ] [Nat]Added 1 Read/Feed constraints in 131 ms returned sat
[2024-05-28 09:46:27] [INFO ] Computed and/alt/rep : 1307/4443/1307 causal constraints (skipped 323 transitions) in 360 ms.
[2024-05-28 09:46:27] [INFO ] Added : 6 causal constraints over 2 iterations in 844 ms. Result :sat
Minimization took 697 ms.
[2024-05-28 09:46:28] [INFO ] [Real]Absence check using 45 positive place invariants in 15 ms returned sat
[2024-05-28 09:46:28] [INFO ] [Real]Absence check using 45 positive and 27 generalized place invariants in 28 ms returned unsat
[2024-05-28 09:46:28] [INFO ] [Real]Absence check using 45 positive place invariants in 13 ms returned sat
[2024-05-28 09:46:28] [INFO ] [Real]Absence check using 45 positive and 27 generalized place invariants in 21 ms returned unsat
[2024-05-28 09:46:28] [INFO ] [Real]Absence check using 45 positive place invariants in 12 ms returned sat
[2024-05-28 09:46:28] [INFO ] [Real]Absence check using 45 positive and 27 generalized place invariants in 18 ms returned sat
[2024-05-28 09:46:29] [INFO ] [Real]Absence check using state equation in 539 ms returned sat
[2024-05-28 09:46:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 09:46:29] [INFO ] [Nat]Absence check using 45 positive place invariants in 11 ms returned sat
[2024-05-28 09:46:29] [INFO ] [Nat]Absence check using 45 positive and 27 generalized place invariants in 14 ms returned sat
[2024-05-28 09:46:30] [INFO ] [Nat]Absence check using state equation in 953 ms returned sat
[2024-05-28 09:46:30] [INFO ] [Nat]Added 1 Read/Feed constraints in 89 ms returned sat
[2024-05-28 09:46:31] [INFO ] Deduced a trap composed of 141 places in 582 ms of which 32 ms to minimize.
[2024-05-28 09:46:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 829 ms
[2024-05-28 09:46:31] [INFO ] Computed and/alt/rep : 1307/4443/1307 causal constraints (skipped 323 transitions) in 178 ms.
[2024-05-28 09:46:32] [INFO ] Added : 11 causal constraints over 3 iterations in 1472 ms. Result :unknown
[2024-05-28 09:46:32] [INFO ] [Real]Absence check using 45 positive place invariants in 14 ms returned sat
[2024-05-28 09:46:32] [INFO ] [Real]Absence check using 45 positive and 27 generalized place invariants in 27 ms returned sat
[2024-05-28 09:46:33] [INFO ] [Real]Absence check using state equation in 614 ms returned sat
[2024-05-28 09:46:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 09:46:33] [INFO ] [Nat]Absence check using 45 positive place invariants in 24 ms returned sat
[2024-05-28 09:46:33] [INFO ] [Nat]Absence check using 45 positive and 27 generalized place invariants in 15 ms returned sat
[2024-05-28 09:46:34] [INFO ] [Nat]Absence check using state equation in 756 ms returned sat
[2024-05-28 09:46:34] [INFO ] [Nat]Added 1 Read/Feed constraints in 116 ms returned sat
[2024-05-28 09:46:34] [INFO ] Computed and/alt/rep : 1307/4443/1307 causal constraints (skipped 323 transitions) in 175 ms.
[2024-05-28 09:46:36] [INFO ] Deduced a trap composed of 19 places in 629 ms of which 4 ms to minimize.
[2024-05-28 09:46:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 849 ms
[2024-05-28 09:46:37] [INFO ] Deduced a trap composed of 121 places in 570 ms of which 4 ms to minimize.
[2024-05-28 09:46:37] [INFO ] Deduced a trap composed of 105 places in 407 ms of which 7 ms to minimize.
[2024-05-28 09:46:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1211 ms
[2024-05-28 09:46:37] [INFO ] Added : 32 causal constraints over 7 iterations in 3331 ms. Result :sat
Minimization took 574 ms.
[2024-05-28 09:46:38] [INFO ] [Real]Absence check using 45 positive place invariants in 12 ms returned sat
[2024-05-28 09:46:38] [INFO ] [Real]Absence check using 45 positive and 27 generalized place invariants in 14 ms returned sat
[2024-05-28 09:46:39] [INFO ] [Real]Absence check using state equation in 539 ms returned sat
[2024-05-28 09:46:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 09:46:39] [INFO ] [Nat]Absence check using 45 positive place invariants in 41 ms returned sat
[2024-05-28 09:46:39] [INFO ] [Nat]Absence check using 45 positive and 27 generalized place invariants in 50 ms returned sat
[2024-05-28 09:46:39] [INFO ] [Nat]Absence check using state equation in 475 ms returned sat
[2024-05-28 09:46:40] [INFO ] [Nat]Added 1 Read/Feed constraints in 132 ms returned sat
[2024-05-28 09:46:40] [INFO ] Computed and/alt/rep : 1307/4443/1307 causal constraints (skipped 323 transitions) in 158 ms.
[2024-05-28 09:46:41] [INFO ] Added : 10 causal constraints over 2 iterations in 1364 ms. Result :unknown
[2024-05-28 09:46:41] [INFO ] [Real]Absence check using 45 positive place invariants in 11 ms returned sat
[2024-05-28 09:46:41] [INFO ] [Real]Absence check using 45 positive and 27 generalized place invariants in 29 ms returned sat
[2024-05-28 09:46:42] [INFO ] [Real]Absence check using state equation in 759 ms returned sat
[2024-05-28 09:46:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 09:46:42] [INFO ] [Nat]Absence check using 45 positive place invariants in 13 ms returned sat
[2024-05-28 09:46:42] [INFO ] [Nat]Absence check using 45 positive and 27 generalized place invariants in 22 ms returned sat
[2024-05-28 09:46:43] [INFO ] [Nat]Absence check using state equation in 623 ms returned sat
[2024-05-28 09:46:43] [INFO ] [Nat]Added 1 Read/Feed constraints in 152 ms returned sat
[2024-05-28 09:46:43] [INFO ] Computed and/alt/rep : 1307/4443/1307 causal constraints (skipped 323 transitions) in 157 ms.
[2024-05-28 09:46:44] [INFO ] Deduced a trap composed of 19 places in 404 ms of which 3 ms to minimize.
[2024-05-28 09:46:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 660 ms
[2024-05-28 09:46:44] [INFO ] Added : 32 causal constraints over 7 iterations in 1464 ms. Result :sat
Minimization took 743 ms.
[2024-05-28 09:46:45] [INFO ] [Real]Absence check using 45 positive place invariants in 11 ms returned sat
[2024-05-28 09:46:45] [INFO ] [Real]Absence check using 45 positive and 27 generalized place invariants in 14 ms returned unsat
[2024-05-28 09:46:45] [INFO ] [Real]Absence check using 45 positive place invariants in 11 ms returned sat
[2024-05-28 09:46:45] [INFO ] [Real]Absence check using 45 positive and 27 generalized place invariants in 14 ms returned sat
[2024-05-28 09:46:46] [INFO ] [Real]Absence check using state equation in 389 ms returned sat
[2024-05-28 09:46:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 09:46:46] [INFO ] [Nat]Absence check using 45 positive place invariants in 11 ms returned sat
[2024-05-28 09:46:46] [INFO ] [Nat]Absence check using 45 positive and 27 generalized place invariants in 15 ms returned sat
[2024-05-28 09:46:46] [INFO ] [Nat]Absence check using state equation in 505 ms returned sat
[2024-05-28 09:46:47] [INFO ] [Nat]Added 1 Read/Feed constraints in 167 ms returned sat
[2024-05-28 09:46:47] [INFO ] Computed and/alt/rep : 1307/4443/1307 causal constraints (skipped 323 transitions) in 133 ms.
[2024-05-28 09:46:48] [INFO ] Deduced a trap composed of 232 places in 419 ms of which 3 ms to minimize.
[2024-05-28 09:46:48] [INFO ] Trap strengthening (SAT) tested/added 1/1 trap constraints in 951 ms
Maximisation of solution failed !
Minimization took 3 ms.
[2024-05-28 09:46:51] [INFO ] [Real]Absence check using 45 positive place invariants in 14 ms returned sat
[2024-05-28 09:46:51] [INFO ] [Real]Absence check using 45 positive and 27 generalized place invariants in 20 ms returned sat
[2024-05-28 09:46:52] [INFO ] [Real]Absence check using state equation in 620 ms returned sat
[2024-05-28 09:46:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 09:46:52] [INFO ] [Nat]Absence check using 45 positive place invariants in 12 ms returned sat
[2024-05-28 09:46:52] [INFO ] [Nat]Absence check using 45 positive and 27 generalized place invariants in 19 ms returned sat
[2024-05-28 09:46:52] [INFO ] [Nat]Absence check using state equation in 619 ms returned sat
[2024-05-28 09:46:52] [INFO ] [Nat]Added 1 Read/Feed constraints in 6 ms returned sat
[2024-05-28 09:46:53] [INFO ] Computed and/alt/rep : 1307/4443/1307 causal constraints (skipped 323 transitions) in 126 ms.
[2024-05-28 09:46:53] [INFO ] Deduced a trap composed of 19 places in 332 ms of which 4 ms to minimize.
[2024-05-28 09:46:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 503 ms
[2024-05-28 09:46:54] [INFO ] Added : 27 causal constraints over 7 iterations in 1316 ms. Result :sat
Minimization took 898 ms.
[2024-05-28 09:46:55] [INFO ] [Real]Absence check using 45 positive place invariants in 11 ms returned sat
[2024-05-28 09:46:55] [INFO ] [Real]Absence check using 45 positive and 27 generalized place invariants in 13 ms returned unsat
[2024-05-28 09:46:55] [INFO ] [Real]Absence check using 45 positive place invariants in 10 ms returned sat
[2024-05-28 09:46:55] [INFO ] [Real]Absence check using 45 positive and 27 generalized place invariants in 21 ms returned sat
[2024-05-28 09:46:55] [INFO ] [Real]Absence check using state equation in 588 ms returned sat
[2024-05-28 09:46:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 09:46:56] [INFO ] [Nat]Absence check using 45 positive place invariants in 17 ms returned sat
[2024-05-28 09:46:56] [INFO ] [Nat]Absence check using 45 positive and 27 generalized place invariants in 16 ms returned sat
[2024-05-28 09:46:57] [INFO ] [Nat]Absence check using state equation in 1119 ms returned sat
[2024-05-28 09:46:57] [INFO ] [Nat]Added 1 Read/Feed constraints in 187 ms returned sat
[2024-05-28 09:46:57] [INFO ] Computed and/alt/rep : 1307/4443/1307 causal constraints (skipped 323 transitions) in 124 ms.
[2024-05-28 09:46:58] [INFO ] Deduced a trap composed of 19 places in 322 ms of which 1 ms to minimize.
[2024-05-28 09:46:59] [INFO ] Trap strengthening (SAT) tested/added 1/1 trap constraints in 869 ms
Maximisation of solution failed !
Minimization took 1 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[10, 3, 1, 1, 0, 0, 1, 0, 1, 0, 0, 4, 0] Max Struct:[10, 68, 1, 1, 158, 39, 158, 39, 1, 118, 98, 4, 1]
FORMULA PolyORBNT-PT-S10J20-UpperBounds-14 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J20-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J20-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J20-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J20-UpperBounds-00 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3, 0, 1, 1, 0, 0, 0, 0] Max Struct:[68, 158, 39, 158, 39, 118, 98, 1]
Support contains 28 out of 474 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 474/474 places, 1650/1650 transitions.
Ensure Unique test removed 10 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 464 transition count 1626
Reduce places removed 24 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 26 rules applied. Total rules applied 60 place count 440 transition count 1624
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 62 place count 438 transition count 1624
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 24 Pre rules applied. Total rules applied 62 place count 438 transition count 1600
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 110 place count 414 transition count 1600
Applied a total of 110 rules in 371 ms. Remains 414 /474 variables (removed 60) and now considering 1600/1650 (removed 50) transitions.
Running 1589 sub problems to find dead transitions.
[2024-05-28 09:47:01] [INFO ] Flow matrix only has 1591 transitions (discarded 9 similar events)
// Phase 1: matrix 1591 rows 414 cols
[2024-05-28 09:47:01] [INFO ] Computed 62 invariants in 77 ms
[2024-05-28 09:47:01] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/404 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 1589 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/404 variables, 8/52 constraints. Problems are: Problem set: 0 solved, 1589 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/404 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1589 unsolved
Problem TDEAD513 is UNSAT
Problem TDEAD525 is UNSAT
Problem TDEAD527 is UNSAT
Problem TDEAD532 is UNSAT
Problem TDEAD538 is UNSAT
Problem TDEAD562 is UNSAT
Problem TDEAD563 is UNSAT
Problem TDEAD564 is UNSAT
Problem TDEAD576 is UNSAT
Problem TDEAD589 is UNSAT
Problem TDEAD610 is UNSAT
Problem TDEAD619 is UNSAT
Problem TDEAD650 is UNSAT
Problem TDEAD657 is UNSAT
Problem TDEAD658 is UNSAT
Problem TDEAD660 is UNSAT
Problem TDEAD715 is UNSAT
Problem TDEAD717 is UNSAT
Problem TDEAD760 is UNSAT
Problem TDEAD774 is UNSAT
Problem TDEAD776 is UNSAT
Problem TDEAD809 is UNSAT
Problem TDEAD826 is UNSAT
Problem TDEAD835 is UNSAT
Problem TDEAD852 is UNSAT
Problem TDEAD859 is UNSAT
Problem TDEAD861 is UNSAT
Problem TDEAD868 is UNSAT
Problem TDEAD947 is UNSAT
Problem TDEAD980 is UNSAT
Problem TDEAD985 is UNSAT
Problem TDEAD991 is UNSAT
Problem TDEAD1002 is UNSAT
Problem TDEAD1013 is UNSAT
Problem TDEAD1020 is UNSAT
Problem TDEAD1032 is UNSAT
Problem TDEAD1043 is UNSAT
Problem TDEAD1048 is UNSAT
Problem TDEAD1059 is UNSAT
Problem TDEAD1069 is UNSAT
Problem TDEAD1088 is UNSAT
Problem TDEAD1096 is UNSAT
Problem TDEAD1100 is UNSAT
Problem TDEAD1114 is UNSAT
Problem TDEAD1115 is UNSAT
Problem TDEAD1132 is UNSAT
Problem TDEAD1140 is UNSAT
Problem TDEAD1155 is UNSAT
Problem TDEAD1158 is UNSAT
Problem TDEAD1160 is UNSAT
Problem TDEAD1178 is UNSAT
Problem TDEAD1180 is UNSAT
Problem TDEAD1190 is UNSAT
Problem TDEAD1201 is UNSAT
Problem TDEAD1224 is UNSAT
Problem TDEAD1225 is UNSAT
Problem TDEAD1230 is UNSAT
Problem TDEAD1252 is UNSAT
Problem TDEAD1290 is UNSAT
Problem TDEAD1307 is UNSAT
Problem TDEAD1335 is UNSAT
Problem TDEAD1416 is UNSAT
Problem TDEAD1419 is UNSAT
Problem TDEAD1449 is UNSAT
Problem TDEAD1481 is UNSAT
Problem TDEAD1485 is UNSAT
At refinement iteration 3 (OVERLAPS) 1/405 variables, 1/53 constraints. Problems are: Problem set: 66 solved, 1523 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 405/2005 variables, and 53 constraints, problems are : Problem set: 66 solved, 1523 unsolved in 20043 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, Generalized P Invariants (flows): 8/17 constraints, State Equation: 0/414 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1589/589 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 66 solved, 1523 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/404 variables, 44/44 constraints. Problems are: Problem set: 66 solved, 1523 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/404 variables, 8/52 constraints. Problems are: Problem set: 66 solved, 1523 unsolved
[2024-05-28 09:47:41] [INFO ] Deduced a trap composed of 18 places in 280 ms of which 1 ms to minimize.
[2024-05-28 09:47:44] [INFO ] Deduced a trap composed of 10 places in 387 ms of which 3 ms to minimize.
[2024-05-28 09:47:46] [INFO ] Deduced a trap composed of 85 places in 451 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 404/2005 variables, and 55 constraints, problems are : Problem set: 66 solved, 1523 unsolved in 20048 ms.
Refiners :[Positive P Invariants (semi-flows): 44/45 constraints, Generalized P Invariants (flows): 8/17 constraints, State Equation: 0/414 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 934/589 constraints, Known Traps: 3/3 constraints]
After SMT, in 57884ms problems are : Problem set: 66 solved, 1523 unsolved
Search for dead transitions found 66 dead transitions in 58042ms
Found 66 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 66 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 66 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 414/474 places, 1534/1650 transitions.
Applied a total of 0 rules in 103 ms. Remains 414 /414 variables (removed 0) and now considering 1534/1534 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58563 ms. Remains : 414/474 places, 1534/1650 transitions.
[2024-05-28 09:47:59] [INFO ] Flow matrix only has 1525 transitions (discarded 9 similar events)
// Phase 1: matrix 1525 rows 414 cols
[2024-05-28 09:47:59] [INFO ] Computed 62 invariants in 19 ms
Current structural bounds on expressions (after invariants) : Max Seen:[3, 0, 1, 1, 0, 0, 0, 0] Max Struct:[67, 77, 38, 77, 38, 57, 70, 1]
RANDOM walk for 1000000 steps (68713 resets) in 14370 ms. (69 steps per ms)
FORMULA PolyORBNT-PT-S10J20-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 7000007 steps (66436 resets) in 17713 ms. (395 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4, 2, 1, 3, 1, 3, 1] Max Struct:[67, 77, 38, 77, 38, 57, 70]
[2024-05-28 09:48:31] [INFO ] Flow matrix only has 1525 transitions (discarded 9 similar events)
[2024-05-28 09:48:31] [INFO ] Invariant cache hit.
[2024-05-28 09:48:31] [INFO ] [Real]Absence check using 45 positive place invariants in 14 ms returned sat
[2024-05-28 09:48:31] [INFO ] [Real]Absence check using 45 positive and 17 generalized place invariants in 14 ms returned unsat
[2024-05-28 09:48:32] [INFO ] [Real]Absence check using 45 positive place invariants in 12 ms returned sat
[2024-05-28 09:48:32] [INFO ] [Real]Absence check using 45 positive and 17 generalized place invariants in 5 ms returned unsat
[2024-05-28 09:48:32] [INFO ] [Real]Absence check using 45 positive place invariants in 20 ms returned sat
[2024-05-28 09:48:32] [INFO ] [Real]Absence check using 45 positive and 17 generalized place invariants in 10 ms returned unsat
[2024-05-28 09:48:32] [INFO ] [Real]Absence check using 45 positive place invariants in 12 ms returned sat
[2024-05-28 09:48:32] [INFO ] [Real]Absence check using 45 positive and 17 generalized place invariants in 12 ms returned sat
[2024-05-28 09:48:32] [INFO ] [Real]Absence check using state equation in 421 ms returned sat
[2024-05-28 09:48:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 09:48:32] [INFO ] [Nat]Absence check using 45 positive place invariants in 10 ms returned sat
[2024-05-28 09:48:32] [INFO ] [Nat]Absence check using 45 positive and 17 generalized place invariants in 9 ms returned sat
[2024-05-28 09:48:33] [INFO ] [Nat]Absence check using state equation in 371 ms returned sat
[2024-05-28 09:48:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 09:48:33] [INFO ] [Nat]Added 1 Read/Feed constraints in 97 ms returned sat
[2024-05-28 09:48:33] [INFO ] Computed and/alt/rep : 1191/4540/1191 causal constraints (skipped 323 transitions) in 164 ms.
[2024-05-28 09:48:34] [INFO ] Added : 11 causal constraints over 3 iterations in 907 ms. Result :sat
Minimization took 5325 ms.
[2024-05-28 09:48:39] [INFO ] [Real]Absence check using 45 positive place invariants in 12 ms returned sat
[2024-05-28 09:48:39] [INFO ] [Real]Absence check using 45 positive and 17 generalized place invariants in 12 ms returned unsat
[2024-05-28 09:48:39] [INFO ] [Real]Absence check using 45 positive place invariants in 13 ms returned sat
[2024-05-28 09:48:39] [INFO ] [Real]Absence check using 45 positive and 17 generalized place invariants in 5 ms returned unsat
[2024-05-28 09:48:39] [INFO ] [Real]Absence check using 45 positive place invariants in 13 ms returned sat
[2024-05-28 09:48:39] [INFO ] [Real]Absence check using 45 positive and 17 generalized place invariants in 11 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[4, 2, 1, 3, 1, 3, 1] Max Struct:[4, 2, 1, 77, 1, 3, 1]
FORMULA PolyORBNT-PT-S10J20-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J20-UpperBounds-12 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J20-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J20-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J20-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J20-UpperBounds-04 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J20-UpperBounds-01 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[77]
Support contains 1 out of 414 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 414/414 places, 1534/1534 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 413 transition count 1533
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 413 transition count 1533
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 6 place count 411 transition count 1531
Applied a total of 6 rules in 238 ms. Remains 411 /414 variables (removed 3) and now considering 1531/1534 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 238 ms. Remains : 411/414 places, 1531/1534 transitions.
[2024-05-28 09:48:40] [INFO ] Flow matrix only has 1522 transitions (discarded 9 similar events)
// Phase 1: matrix 1522 rows 411 cols
[2024-05-28 09:48:40] [INFO ] Computed 62 invariants in 41 ms
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[77]
RANDOM walk for 1000000 steps (70158 resets) in 13527 ms. (73 steps per ms)
BEST_FIRST walk for 1000001 steps (9618 resets) in 2384 ms. (419 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[77]
[2024-05-28 09:48:56] [INFO ] Flow matrix only has 1522 transitions (discarded 9 similar events)
[2024-05-28 09:48:56] [INFO ] Invariant cache hit.
[2024-05-28 09:48:56] [INFO ] [Real]Absence check using 44 positive place invariants in 13 ms returned sat
[2024-05-28 09:48:56] [INFO ] [Real]Absence check using 44 positive and 18 generalized place invariants in 12 ms returned sat
[2024-05-28 09:48:56] [INFO ] [Real]Absence check using state equation in 321 ms returned sat
[2024-05-28 09:48:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 09:48:56] [INFO ] [Nat]Absence check using 44 positive place invariants in 11 ms returned sat
[2024-05-28 09:48:56] [INFO ] [Nat]Absence check using 44 positive and 18 generalized place invariants in 10 ms returned sat
[2024-05-28 09:48:57] [INFO ] [Nat]Absence check using state equation in 398 ms returned sat
[2024-05-28 09:48:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 09:48:57] [INFO ] [Nat]Added 1 Read/Feed constraints in 142 ms returned sat
[2024-05-28 09:48:57] [INFO ] Deduced a trap composed of 140 places in 507 ms of which 3 ms to minimize.
[2024-05-28 09:48:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 665 ms
[2024-05-28 09:48:58] [INFO ] Computed and/alt/rep : 1189/4535/1189 causal constraints (skipped 322 transitions) in 180 ms.
[2024-05-28 09:48:58] [INFO ] Added : 9 causal constraints over 3 iterations in 693 ms. Result :sat
Minimization took 6201 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[77]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[77]
Support contains 1 out of 411 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 411/411 places, 1531/1531 transitions.
Applied a total of 0 rules in 55 ms. Remains 411 /411 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 411/411 places, 1531/1531 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 411/411 places, 1531/1531 transitions.
Applied a total of 0 rules in 49 ms. Remains 411 /411 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2024-05-28 09:49:04] [INFO ] Flow matrix only has 1522 transitions (discarded 9 similar events)
[2024-05-28 09:49:04] [INFO ] Invariant cache hit.
[2024-05-28 09:49:22] [INFO ] Implicit Places using invariants in 17092 ms returned []
[2024-05-28 09:49:22] [INFO ] Flow matrix only has 1522 transitions (discarded 9 similar events)
[2024-05-28 09:49:22] [INFO ] Invariant cache hit.
[2024-05-28 09:49:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 09:49:30] [INFO ] Implicit Places using invariants and state equation in 8304 ms returned []
Implicit Place search using SMT with State Equation took 25422 ms to find 0 implicit places.
[2024-05-28 09:49:30] [INFO ] Redundant transitions in 91 ms returned []
Running 1520 sub problems to find dead transitions.
[2024-05-28 09:49:30] [INFO ] Flow matrix only has 1522 transitions (discarded 9 similar events)
[2024-05-28 09:49:30] [INFO ] Invariant cache hit.
[2024-05-28 09:49:30] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/401 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 1520 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/401 variables, 9/52 constraints. Problems are: Problem set: 0 solved, 1520 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/401 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1520 unsolved
At refinement iteration 3 (OVERLAPS) 1/402 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 1520 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/402 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1520 unsolved
At refinement iteration 5 (OVERLAPS) 9/411 variables, 9/62 constraints. Problems are: Problem set: 0 solved, 1520 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 411/1933 variables, and 62 constraints, problems are : Problem set: 0 solved, 1520 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 44/44 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 0/411 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1520/1520 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1520 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/401 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 1520 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/401 variables, 9/52 constraints. Problems are: Problem set: 0 solved, 1520 unsolved
[2024-05-28 09:50:35] [INFO ] Deduced a trap composed of 18 places in 533 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 401/1933 variables, and 53 constraints, problems are : Problem set: 0 solved, 1520 unsolved in 30049 ms.
Refiners :[Positive P Invariants (semi-flows): 43/44 constraints, Generalized P Invariants (flows): 9/18 constraints, State Equation: 0/411 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1520 constraints, Known Traps: 1/1 constraints]
After SMT, in 81928ms problems are : Problem set: 0 solved, 1520 unsolved
Search for dead transitions found 0 dead transitions in 81945ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 107538 ms. Remains : 411/411 places, 1531/1531 transitions.
RANDOM walk for 40000 steps (2828 resets) in 2240 ms. (17 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (380 resets) in 332 ms. (120 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (382 resets) in 326 ms. (122 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 228738 steps, run timeout after 3001 ms. (steps per millisecond=76 ) properties seen :0 out of 2
Probabilistic random walk after 228738 steps, saw 38116 distinct states, run finished after 3004 ms. (steps per millisecond=76 ) properties seen :0
[2024-05-28 09:50:56] [INFO ] Flow matrix only has 1522 transitions (discarded 9 similar events)
[2024-05-28 09:50:56] [INFO ] Invariant cache hit.
[2024-05-28 09:50:56] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 123/124 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
At refinement iteration 3 (OVERLAPS) 259/383 variables, 43/46 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/383 variables, 0/46 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 26/409 variables, 15/61 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-28 09:50:57] [INFO ] Deduced a trap composed of 75 places in 350 ms of which 3 ms to minimize.
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/409 variables, 1/62 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/409 variables, 0/62 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/410 variables, 1/63 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/410 variables, 0/63 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1522/1932 variables, 410/473 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1932 variables, 1/474 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1932 variables, 0/474 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/1933 variables, 1/475 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1933 variables, 0/475 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/1933 variables, 0/475 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1933/1933 variables, and 475 constraints, problems are : Problem set: 1 solved, 1 unsolved in 1155 ms.
Refiners :[Positive P Invariants (semi-flows): 44/44 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 411/411 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 123/124 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 259/383 variables, 43/46 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/383 variables, 0/46 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 26/409 variables, 15/61 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/409 variables, 1/62 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-28 09:50:58] [INFO ] Deduced a trap composed of 24 places in 339 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/409 variables, 1/63 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/409 variables, 0/63 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/410 variables, 1/64 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/410 variables, 0/64 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1522/1932 variables, 410/474 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1932 variables, 1/475 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1932 variables, 0/475 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/1933 variables, 1/476 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1933 variables, 1/477 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1933 variables, 0/477 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/1933 variables, 0/477 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1933/1933 variables, and 477 constraints, problems are : Problem set: 1 solved, 1 unsolved in 1173 ms.
Refiners :[Positive P Invariants (semi-flows): 44/44 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 411/411 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 2345ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 97 ms.
Support contains 1 out of 411 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 411/411 places, 1531/1531 transitions.
Applied a total of 0 rules in 46 ms. Remains 411 /411 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
Running 1520 sub problems to find dead transitions.
[2024-05-28 09:50:58] [INFO ] Flow matrix only has 1522 transitions (discarded 9 similar events)
[2024-05-28 09:50:58] [INFO ] Invariant cache hit.
[2024-05-28 09:50:58] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/401 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 1520 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/401 variables, 9/52 constraints. Problems are: Problem set: 0 solved, 1520 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 401/1933 variables, and 52 constraints, problems are : Problem set: 0 solved, 1520 unsolved in 20033 ms.
Refiners :[Positive P Invariants (semi-flows): 43/44 constraints, Generalized P Invariants (flows): 9/18 constraints, State Equation: 0/411 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1520/1520 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1520 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/401 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 1520 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/401 variables, 9/52 constraints. Problems are: Problem set: 0 solved, 1520 unsolved
[2024-05-28 09:51:46] [INFO ] Deduced a trap composed of 18 places in 493 ms of which 1 ms to minimize.
[2024-05-28 09:51:56] [INFO ] Deduced a trap composed of 14 places in 208 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/401 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1520 unsolved
[2024-05-28 09:52:00] [INFO ] Deduced a trap composed of 59 places in 220 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 401/1933 variables, and 55 constraints, problems are : Problem set: 0 solved, 1520 unsolved in 20070 ms.
Refiners :[Positive P Invariants (semi-flows): 43/44 constraints, Generalized P Invariants (flows): 9/18 constraints, State Equation: 0/411 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1520 constraints, Known Traps: 3/3 constraints]
After SMT, in 64565ms problems are : Problem set: 0 solved, 1520 unsolved
Search for dead transitions found 0 dead transitions in 64588ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64643 ms. Remains : 411/411 places, 1531/1531 transitions.
RANDOM walk for 40000 steps (2736 resets) in 1169 ms. (34 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (399 resets) in 349 ms. (114 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 276005 steps, run timeout after 3001 ms. (steps per millisecond=91 ) properties seen :0 out of 1
Probabilistic random walk after 276005 steps, saw 45426 distinct states, run finished after 3001 ms. (steps per millisecond=91 ) properties seen :0
[2024-05-28 09:52:07] [INFO ] Flow matrix only has 1522 transitions (discarded 9 similar events)
[2024-05-28 09:52:07] [INFO ] Invariant cache hit.
[2024-05-28 09:52:07] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 123/124 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 259/383 variables, 43/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/383 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 26/409 variables, 15/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/409 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/410 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/410 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1522/1932 variables, 410/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1932 variables, 1/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1932 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/1933 variables, 1/474 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1933 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/1933 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1933/1933 variables, and 474 constraints, problems are : Problem set: 0 solved, 1 unsolved in 847 ms.
Refiners :[Positive P Invariants (semi-flows): 44/44 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 411/411 constraints, ReadFeed: 1/1 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 123/124 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 259/383 variables, 43/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/383 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 26/409 variables, 15/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 09:52:08] [INFO ] Deduced a trap composed of 24 places in 411 ms of which 7 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/409 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/409 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/410 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/410 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1522/1932 variables, 410/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1932 variables, 1/474 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 09:52:09] [INFO ] Deduced a trap composed of 177 places in 524 ms of which 7 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1932 variables, 1/475 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1932 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/1933 variables, 1/476 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1933 variables, 1/477 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1933 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/1933 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1933/1933 variables, and 477 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2119 ms.
Refiners :[Positive P Invariants (semi-flows): 44/44 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 411/411 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 2993ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 41 ms.
Support contains 1 out of 411 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 411/411 places, 1531/1531 transitions.
Applied a total of 0 rules in 52 ms. Remains 411 /411 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 411/411 places, 1531/1531 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 411/411 places, 1531/1531 transitions.
Applied a total of 0 rules in 46 ms. Remains 411 /411 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2024-05-28 09:52:10] [INFO ] Flow matrix only has 1522 transitions (discarded 9 similar events)
[2024-05-28 09:52:10] [INFO ] Invariant cache hit.
[2024-05-28 09:52:10] [INFO ] Implicit Places using invariants in 777 ms returned []
[2024-05-28 09:52:10] [INFO ] Flow matrix only has 1522 transitions (discarded 9 similar events)
[2024-05-28 09:52:10] [INFO ] Invariant cache hit.
[2024-05-28 09:52:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 09:52:17] [INFO ] Implicit Places using invariants and state equation in 6463 ms returned []
Implicit Place search using SMT with State Equation took 7243 ms to find 0 implicit places.
[2024-05-28 09:52:17] [INFO ] Redundant transitions in 51 ms returned []
Running 1520 sub problems to find dead transitions.
[2024-05-28 09:52:17] [INFO ] Flow matrix only has 1522 transitions (discarded 9 similar events)
[2024-05-28 09:52:17] [INFO ] Invariant cache hit.
[2024-05-28 09:52:17] [INFO ] State equation strengthened by 1 read => feed constraints.
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running PolyORBNT-PT-S10J20

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 474
TRANSITIONS: 11760
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.897s, Sys 0.055s]


SAVING FILE /home/mcc/execution/model (.net / .def) ...
EXPORT TIME: [User 0.122s, Sys 0.004s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 784
MODEL NAME: /home/mcc/execution/model
474 places, 11760 transitions.

No place bound informations found.
No place bound informations found.
No place bound informations found.
No place bound informations found.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.

BK_TIME_CONFINEMENT_REACHED

--------------------
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
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBNT-PT-S10J20"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is PolyORBNT-PT-S10J20, 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 r289-tajo-171654446000485"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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