Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r516-tajo-171654446800317.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is PolyORBLF-PT-S06J04T04, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r516-tajo-171654446800317
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 11M
-rw-r--r-- 1 mcc users 13K Apr 11 17:34 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K Apr 11 17:34 CTLCardinality.xml
-rw-r--r-- 1 mcc users 221K Apr 11 17:32 CTLFireability.txt
-rw-r--r-- 1 mcc users 912K Apr 11 17:32 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 8.9K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 38K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 112K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 343K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 19K Apr 11 17:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Apr 11 17:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 291K Apr 11 17:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.2M Apr 11 17:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.7K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 6.8M 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 PolyORBLF-PT-S06J04T04-UpperBounds-00
FORMULA_NAME PolyORBLF-PT-S06J04T04-UpperBounds-01
FORMULA_NAME PolyORBLF-PT-S06J04T04-UpperBounds-02
FORMULA_NAME PolyORBLF-PT-S06J04T04-UpperBounds-03
FORMULA_NAME PolyORBLF-PT-S06J04T04-UpperBounds-04
FORMULA_NAME PolyORBLF-PT-S06J04T04-UpperBounds-05
FORMULA_NAME PolyORBLF-PT-S06J04T04-UpperBounds-06
FORMULA_NAME PolyORBLF-PT-S06J04T04-UpperBounds-07
FORMULA_NAME PolyORBLF-PT-S06J04T04-UpperBounds-08
FORMULA_NAME PolyORBLF-PT-S06J04T04-UpperBounds-09
FORMULA_NAME PolyORBLF-PT-S06J04T04-UpperBounds-10
FORMULA_NAME PolyORBLF-PT-S06J04T04-UpperBounds-11
FORMULA_NAME PolyORBLF-PT-S06J04T04-UpperBounds-12
FORMULA_NAME PolyORBLF-PT-S06J04T04-UpperBounds-13
FORMULA_NAME PolyORBLF-PT-S06J04T04-UpperBounds-14
FORMULA_NAME PolyORBLF-PT-S06J04T04-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717255434711

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-PT-S06J04T04
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 15:23:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-01 15:23:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 15:23:56] [INFO ] Load time of PNML (sax parser for PT used): 388 ms
[2024-06-01 15:23:56] [INFO ] Transformed 454 places.
[2024-06-01 15:23:56] [INFO ] Transformed 6994 transitions.
[2024-06-01 15:23:56] [INFO ] Parsed PT model containing 454 places and 6994 transitions and 59152 arcs in 545 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Ensure Unique test removed 5380 transitions
Reduce redundant transitions removed 5380 transitions.
Current structural bounds on expressions (Initially) : Max Seen:[1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 10, 0, 0, 1] Max Struct:[+inf, +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:[1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 10, 0, 0, 1] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-06-01 15:23:56] [INFO ] Flow matrix only has 1590 transitions (discarded 24 similar events)
// Phase 1: matrix 1590 rows 454 cols
[2024-06-01 15:23:56] [INFO ] Computed 50 invariants in 97 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 10, 0, 0, 1] Max Struct:[1, 13392, 6780, 6612, 6780, 1, 33, 6780, 16, 31, 6, 42, 10, 1653, 47, 1695]
FORMULA PolyORBLF-PT-S06J04T04-UpperBounds-12 10 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J04T04-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 10000 steps (55 resets) in 105 ms. (94 steps per ms)
FORMULA PolyORBLF-PT-S06J04T04-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 130007 steps (663 resets) in 476 ms. (272 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4, 1, 4, 1, 6, 3, 1, 1, 1, 1, 4, 1, 1] Max Struct:[13392, 6780, 6612, 6780, 33, 6780, 16, 31, 6, 42, 1653, 47, 1695]
[2024-06-01 15:23:57] [INFO ] Flow matrix only has 1590 transitions (discarded 24 similar events)
[2024-06-01 15:23:57] [INFO ] Invariant cache hit.
[2024-06-01 15:23:57] [INFO ] [Real]Absence check using 19 positive place invariants in 24 ms returned sat
[2024-06-01 15:23:57] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 47 ms returned unsat
[2024-06-01 15:23:57] [INFO ] [Real]Absence check using 19 positive place invariants in 11 ms returned sat
[2024-06-01 15:23:57] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 17 ms returned unsat
[2024-06-01 15:23:58] [INFO ] [Real]Absence check using 19 positive place invariants in 9 ms returned sat
[2024-06-01 15:23:58] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 11 ms returned unsat
[2024-06-01 15:23:58] [INFO ] [Real]Absence check using 19 positive place invariants in 10 ms returned sat
[2024-06-01 15:23:58] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 18 ms returned unsat
[2024-06-01 15:23:58] [INFO ] [Real]Absence check using 19 positive place invariants in 14 ms returned sat
[2024-06-01 15:23:58] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 23 ms returned unsat
[2024-06-01 15:23:58] [INFO ] [Real]Absence check using 19 positive place invariants in 10 ms returned sat
[2024-06-01 15:23:58] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 17 ms returned sat
[2024-06-01 15:23:59] [INFO ] [Real]Absence check using state equation in 796 ms returned sat
[2024-06-01 15:23:59] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 15:23:59] [INFO ] [Nat]Absence check using 19 positive place invariants in 12 ms returned sat
[2024-06-01 15:23:59] [INFO ] [Nat]Absence check using 19 positive and 31 generalized place invariants in 23 ms returned sat
[2024-06-01 15:24:01] [INFO ] [Nat]Absence check using state equation in 1816 ms returned sat
[2024-06-01 15:24:01] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-06-01 15:24:01] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 15:24:02] [INFO ] [Nat]Added 112 Read/Feed constraints in 1026 ms returned unknown
[2024-06-01 15:24:02] [INFO ] [Real]Absence check using 19 positive place invariants in 12 ms returned sat
[2024-06-01 15:24:02] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 11 ms returned unsat
[2024-06-01 15:24:02] [INFO ] [Real]Absence check using 19 positive place invariants in 9 ms returned sat
[2024-06-01 15:24:02] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 8 ms returned unsat
[2024-06-01 15:24:02] [INFO ] [Real]Absence check using 19 positive place invariants in 10 ms returned sat
[2024-06-01 15:24:02] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 13 ms returned unsat
[2024-06-01 15:24:02] [INFO ] [Real]Absence check using 19 positive place invariants in 8 ms returned sat
[2024-06-01 15:24:02] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 5 ms returned unsat
[2024-06-01 15:24:02] [INFO ] [Real]Absence check using 19 positive place invariants in 9 ms returned sat
[2024-06-01 15:24:02] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 19 ms returned unsat
[2024-06-01 15:24:03] [INFO ] [Real]Absence check using 19 positive place invariants in 10 ms returned sat
[2024-06-01 15:24:03] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 23 ms returned unsat
[2024-06-01 15:24:03] [INFO ] [Real]Absence check using 19 positive place invariants in 9 ms returned sat
[2024-06-01 15:24:03] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 15 ms returned sat
[2024-06-01 15:24:04] [INFO ] [Real]Absence check using state equation in 1612 ms returned sat
[2024-06-01 15:24:04] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 15:24:04] [INFO ] [Nat]Absence check using 19 positive place invariants in 8 ms returned sat
[2024-06-01 15:24:04] [INFO ] [Nat]Absence check using 19 positive and 31 generalized place invariants in 15 ms returned sat
[2024-06-01 15:24:06] [INFO ] [Nat]Absence check using state equation in 1301 ms returned sat
[2024-06-01 15:24:06] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 15:24:07] [INFO ] [Nat]Added 112 Read/Feed constraints in 1028 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[4, 1, 4, 1, 6, 3, 1, 1, 1, 1, 4, 1, 1] Max Struct:[4, 1, 4, 1, 6, 6780, 1, 1, 1, 1, 4, 1, 1695]
FORMULA PolyORBLF-PT-S06J04T04-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J04T04-UpperBounds-13 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J04T04-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J04T04-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J04T04-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J04T04-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J04T04-UpperBounds-06 6 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J04T04-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J04T04-UpperBounds-03 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J04T04-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J04T04-UpperBounds-01 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3, 1] Max Struct:[6780, 1695]
Support contains 5 out of 454 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 454/454 places, 1614/1614 transitions.
Ensure Unique test removed 6 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 448 transition count 1578
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 78 place count 412 transition count 1578
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 48 Pre rules applied. Total rules applied 78 place count 412 transition count 1530
Deduced a syphon composed of 48 places in 3 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 174 place count 364 transition count 1530
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Deduced a syphon composed of 47 places in 2 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 2 with 94 rules applied. Total rules applied 268 place count 317 transition count 1483
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 2 with 8 rules applied. Total rules applied 276 place count 317 transition count 1475
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 284 place count 309 transition count 1475
Applied a total of 284 rules in 388 ms. Remains 309 /454 variables (removed 145) and now considering 1475/1614 (removed 139) transitions.
Running 1469 sub problems to find dead transitions.
[2024-06-01 15:24:07] [INFO ] Flow matrix only has 1451 transitions (discarded 24 similar events)
// Phase 1: matrix 1451 rows 309 cols
[2024-06-01 15:24:07] [INFO ] Computed 44 invariants in 55 ms
[2024-06-01 15:24:07] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/303 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1469 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/303 variables, 19/33 constraints. Problems are: Problem set: 0 solved, 1469 unsolved
[2024-06-01 15:24:35] [INFO ] Deduced a trap composed of 3 places in 93 ms of which 8 ms to minimize.
[2024-06-01 15:24:35] [INFO ] Deduced a trap composed of 19 places in 98 ms of which 3 ms to minimize.
[2024-06-01 15:24:35] [INFO ] Deduced a trap composed of 19 places in 103 ms of which 3 ms to minimize.
[2024-06-01 15:24:38] [INFO ] Deduced a trap composed of 79 places in 124 ms of which 2 ms to minimize.
[2024-06-01 15:24:39] [INFO ] Deduced a trap composed of 72 places in 142 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/303 variables, 5/38 constraints. Problems are: Problem set: 0 solved, 1469 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 303/1760 variables, and 38 constraints, problems are : Problem set: 0 solved, 1469 unsolved in 20036 ms.
Refiners :[Positive P Invariants (semi-flows): 14/17 constraints, Generalized P Invariants (flows): 19/27 constraints, State Equation: 0/309 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1469/1469 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1469 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/303 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1469 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/303 variables, 19/33 constraints. Problems are: Problem set: 0 solved, 1469 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/303 variables, 5/38 constraints. Problems are: Problem set: 0 solved, 1469 unsolved
[2024-06-01 15:24:50] [INFO ] Deduced a trap composed of 52 places in 332 ms of which 3 ms to minimize.
[2024-06-01 15:24:50] [INFO ] Deduced a trap composed of 51 places in 74 ms of which 8 ms to minimize.
[2024-06-01 15:24:51] [INFO ] Deduced a trap composed of 23 places in 312 ms of which 3 ms to minimize.
[2024-06-01 15:24:51] [INFO ] Deduced a trap composed of 23 places in 212 ms of which 2 ms to minimize.
[2024-06-01 15:24:51] [INFO ] Deduced a trap composed of 51 places in 50 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/303 variables, 5/43 constraints. Problems are: Problem set: 0 solved, 1469 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/303 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1469 unsolved
Problem TDEAD625 is UNSAT
Problem TDEAD626 is UNSAT
Problem TDEAD627 is UNSAT
Problem TDEAD637 is UNSAT
Problem TDEAD641 is UNSAT
Problem TDEAD645 is UNSAT
Problem TDEAD650 is UNSAT
Problem TDEAD651 is UNSAT
Problem TDEAD655 is UNSAT
Problem TDEAD656 is UNSAT
Problem TDEAD657 is UNSAT
Problem TDEAD658 is UNSAT
Problem TDEAD661 is UNSAT
Problem TDEAD663 is UNSAT
Problem TDEAD666 is UNSAT
Problem TDEAD672 is UNSAT
Problem TDEAD674 is UNSAT
Problem TDEAD675 is UNSAT
Problem TDEAD676 is UNSAT
Problem TDEAD681 is UNSAT
Problem TDEAD682 is UNSAT
Problem TDEAD683 is UNSAT
Problem TDEAD684 is UNSAT
Problem TDEAD689 is UNSAT
Problem TDEAD692 is UNSAT
Problem TDEAD696 is UNSAT
Problem TDEAD700 is UNSAT
Problem TDEAD703 is UNSAT
Problem TDEAD704 is UNSAT
Problem TDEAD707 is UNSAT
Problem TDEAD710 is UNSAT
Problem TDEAD711 is UNSAT
Problem TDEAD712 is UNSAT
Problem TDEAD715 is UNSAT
Problem TDEAD716 is UNSAT
Problem TDEAD719 is UNSAT
Problem TDEAD721 is UNSAT
Problem TDEAD723 is UNSAT
Problem TDEAD728 is UNSAT
Problem TDEAD730 is UNSAT
Problem TDEAD732 is UNSAT
Problem TDEAD734 is UNSAT
Problem TDEAD736 is UNSAT
Problem TDEAD738 is UNSAT
Problem TDEAD739 is UNSAT
Problem TDEAD741 is UNSAT
Problem TDEAD744 is UNSAT
Problem TDEAD749 is UNSAT
Problem TDEAD750 is UNSAT
Problem TDEAD753 is UNSAT
Problem TDEAD756 is UNSAT
Problem TDEAD760 is UNSAT
Problem TDEAD761 is UNSAT
Problem TDEAD762 is UNSAT
Problem TDEAD764 is UNSAT
Problem TDEAD766 is UNSAT
Problem TDEAD767 is UNSAT
Problem TDEAD774 is UNSAT
Problem TDEAD775 is UNSAT
Problem TDEAD776 is UNSAT
Problem TDEAD777 is UNSAT
Problem TDEAD778 is UNSAT
Problem TDEAD783 is UNSAT
Problem TDEAD785 is UNSAT
Problem TDEAD787 is UNSAT
Problem TDEAD789 is UNSAT
Problem TDEAD790 is UNSAT
Problem TDEAD795 is UNSAT
Problem TDEAD796 is UNSAT
Problem TDEAD797 is UNSAT
Problem TDEAD798 is UNSAT
Problem TDEAD802 is UNSAT
Problem TDEAD807 is UNSAT
Problem TDEAD808 is UNSAT
Problem TDEAD810 is UNSAT
Problem TDEAD812 is UNSAT
Problem TDEAD813 is UNSAT
Problem TDEAD818 is UNSAT
Problem TDEAD822 is UNSAT
Problem TDEAD824 is UNSAT
Problem TDEAD828 is UNSAT
Problem TDEAD833 is UNSAT
Problem TDEAD834 is UNSAT
Problem TDEAD840 is UNSAT
Problem TDEAD842 is UNSAT
Problem TDEAD844 is UNSAT
Problem TDEAD845 is UNSAT
Problem TDEAD846 is UNSAT
Problem TDEAD847 is UNSAT
Problem TDEAD849 is UNSAT
Problem TDEAD852 is UNSAT
Problem TDEAD853 is UNSAT
Problem TDEAD854 is UNSAT
Problem TDEAD860 is UNSAT
Problem TDEAD863 is UNSAT
Problem TDEAD865 is UNSAT
Problem TDEAD868 is UNSAT
Problem TDEAD872 is UNSAT
Problem TDEAD874 is UNSAT
Problem TDEAD879 is UNSAT
Problem TDEAD883 is UNSAT
Problem TDEAD885 is UNSAT
Problem TDEAD888 is UNSAT
Problem TDEAD890 is UNSAT
Problem TDEAD891 is UNSAT
Problem TDEAD892 is UNSAT
Problem TDEAD893 is UNSAT
Problem TDEAD894 is UNSAT
Problem TDEAD895 is UNSAT
Problem TDEAD896 is UNSAT
Problem TDEAD898 is UNSAT
Problem TDEAD902 is UNSAT
Problem TDEAD905 is UNSAT
Problem TDEAD907 is UNSAT
Problem TDEAD912 is UNSAT
Problem TDEAD914 is UNSAT
Problem TDEAD917 is UNSAT
Problem TDEAD921 is UNSAT
Problem TDEAD923 is UNSAT
Problem TDEAD924 is UNSAT
Problem TDEAD925 is UNSAT
Problem TDEAD927 is UNSAT
Problem TDEAD930 is UNSAT
Problem TDEAD931 is UNSAT
Problem TDEAD932 is UNSAT
Problem TDEAD935 is UNSAT
Problem TDEAD936 is UNSAT
Problem TDEAD937 is UNSAT
Problem TDEAD938 is UNSAT
Problem TDEAD941 is UNSAT
Problem TDEAD942 is UNSAT
At refinement iteration 5 (OVERLAPS) 3/306 variables, 3/46 constraints. Problems are: Problem set: 131 solved, 1338 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 306/1760 variables, and 46 constraints, problems are : Problem set: 131 solved, 1338 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 19/27 constraints, State Equation: 0/309 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1469 constraints, Known Traps: 10/10 constraints]
After SMT, in 60769ms problems are : Problem set: 131 solved, 1338 unsolved
Search for dead transitions found 131 dead transitions in 60867ms
Found 131 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 131 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 131 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 309/454 places, 1344/1614 transitions.
Applied a total of 0 rules in 27 ms. Remains 309 /309 variables (removed 0) and now considering 1344/1344 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61313 ms. Remains : 309/454 places, 1344/1614 transitions.
[2024-06-01 15:25:08] [INFO ] Flow matrix only has 1320 transitions (discarded 24 similar events)
// Phase 1: matrix 1320 rows 309 cols
[2024-06-01 15:25:08] [INFO ] Computed 44 invariants in 33 ms
Current structural bounds on expressions (after invariants) : Max Seen:[3, 1] Max Struct:[420, 105]
RANDOM walk for 1000000 steps (11176 resets) in 8155 ms. (122 steps per ms)
BEST_FIRST walk for 2000002 steps (12504 resets) in 5272 ms. (379 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3, 1] Max Struct:[420, 105]
[2024-06-01 15:25:22] [INFO ] Flow matrix only has 1320 transitions (discarded 24 similar events)
[2024-06-01 15:25:22] [INFO ] Invariant cache hit.
[2024-06-01 15:25:22] [INFO ] [Real]Absence check using 18 positive place invariants in 7 ms returned sat
[2024-06-01 15:25:22] [INFO ] [Real]Absence check using 18 positive and 26 generalized place invariants in 15 ms returned sat
[2024-06-01 15:25:23] [INFO ] [Real]Absence check using state equation in 1130 ms returned sat
[2024-06-01 15:25:23] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 15:25:23] [INFO ] [Nat]Absence check using 18 positive place invariants in 6 ms returned sat
[2024-06-01 15:25:23] [INFO ] [Nat]Absence check using 18 positive and 26 generalized place invariants in 9 ms returned sat
[2024-06-01 15:25:25] [INFO ] [Nat]Absence check using state equation in 1886 ms returned sat
[2024-06-01 15:25:25] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-06-01 15:25:25] [INFO ] [Nat]Added 112 Read/Feed constraints in 500 ms returned sat
[2024-06-01 15:25:26] [INFO ] Deduced a trap composed of 23 places in 384 ms of which 2 ms to minimize.
[2024-06-01 15:25:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 443 ms
[2024-06-01 15:25:26] [INFO ] [Real]Absence check using 18 positive place invariants in 5 ms returned sat
[2024-06-01 15:25:26] [INFO ] [Real]Absence check using 18 positive and 26 generalized place invariants in 9 ms returned sat
[2024-06-01 15:25:26] [INFO ] [Real]Absence check using state equation in 519 ms returned sat
[2024-06-01 15:25:26] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 15:25:26] [INFO ] [Nat]Absence check using 18 positive place invariants in 6 ms returned sat
[2024-06-01 15:25:26] [INFO ] [Nat]Absence check using 18 positive and 26 generalized place invariants in 11 ms returned sat
[2024-06-01 15:25:28] [INFO ] [Nat]Absence check using state equation in 1236 ms returned sat
[2024-06-01 15:25:28] [INFO ] [Nat]Added 112 Read/Feed constraints in 364 ms returned sat
[2024-06-01 15:25:29] [INFO ] Deduced a trap composed of 18 places in 491 ms of which 3 ms to minimize.
[2024-06-01 15:25:29] [INFO ] Deduced a trap composed of 50 places in 103 ms of which 1 ms to minimize.
[2024-06-01 15:25:29] [INFO ] Deduced a trap composed of 51 places in 142 ms of which 1 ms to minimize.
[2024-06-01 15:25:29] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1288 ms
[2024-06-01 15:25:30] [INFO ] Computed and/alt/rep : 1012/4135/1007 causal constraints (skipped 307 transitions) in 262 ms.
[2024-06-01 15:25:33] [INFO ] Added : 65 causal constraints over 13 iterations in 3392 ms. Result :sat
Minimization took 4994 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3, 1] Max Struct:[3, 105]
FORMULA PolyORBLF-PT-S06J04T04-UpperBounds-07 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[105]
Support contains 1 out of 309 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 309/309 places, 1344/1344 transitions.
Applied a total of 0 rules in 31 ms. Remains 309 /309 variables (removed 0) and now considering 1344/1344 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 309/309 places, 1344/1344 transitions.
[2024-06-01 15:25:38] [INFO ] Flow matrix only has 1320 transitions (discarded 24 similar events)
[2024-06-01 15:25:38] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[105]
RANDOM walk for 1000000 steps (11130 resets) in 7070 ms. (141 steps per ms)
BEST_FIRST walk for 1000001 steps (3587 resets) in 2545 ms. (392 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[105]
[2024-06-01 15:25:47] [INFO ] Flow matrix only has 1320 transitions (discarded 24 similar events)
[2024-06-01 15:25:47] [INFO ] Invariant cache hit.
[2024-06-01 15:25:47] [INFO ] [Real]Absence check using 18 positive place invariants in 8 ms returned sat
[2024-06-01 15:25:47] [INFO ] [Real]Absence check using 18 positive and 26 generalized place invariants in 13 ms returned sat
[2024-06-01 15:25:48] [INFO ] [Real]Absence check using state equation in 605 ms returned sat
[2024-06-01 15:25:48] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 15:25:48] [INFO ] [Nat]Absence check using 18 positive place invariants in 6 ms returned sat
[2024-06-01 15:25:48] [INFO ] [Nat]Absence check using 18 positive and 26 generalized place invariants in 10 ms returned sat
[2024-06-01 15:25:49] [INFO ] [Nat]Absence check using state equation in 946 ms returned sat
[2024-06-01 15:25:49] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-06-01 15:25:49] [INFO ] [Nat]Added 112 Read/Feed constraints in 292 ms returned sat
[2024-06-01 15:25:50] [INFO ] Deduced a trap composed of 18 places in 379 ms of which 2 ms to minimize.
[2024-06-01 15:25:50] [INFO ] Deduced a trap composed of 50 places in 69 ms of which 1 ms to minimize.
[2024-06-01 15:25:50] [INFO ] Deduced a trap composed of 51 places in 86 ms of which 1 ms to minimize.
[2024-06-01 15:25:50] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1023 ms
[2024-06-01 15:25:51] [INFO ] Computed and/alt/rep : 1012/4135/1007 causal constraints (skipped 307 transitions) in 218 ms.
[2024-06-01 15:25:54] [INFO ] Added : 65 causal constraints over 13 iterations in 3086 ms. Result :sat
Minimization took 5205 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[105]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[105]
Support contains 1 out of 309 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 309/309 places, 1344/1344 transitions.
Applied a total of 0 rules in 59 ms. Remains 309 /309 variables (removed 0) and now considering 1344/1344 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59 ms. Remains : 309/309 places, 1344/1344 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 309/309 places, 1344/1344 transitions.
Applied a total of 0 rules in 43 ms. Remains 309 /309 variables (removed 0) and now considering 1344/1344 (removed 0) transitions.
[2024-06-01 15:25:59] [INFO ] Flow matrix only has 1320 transitions (discarded 24 similar events)
[2024-06-01 15:25:59] [INFO ] Invariant cache hit.
[2024-06-01 15:25:59] [INFO ] Implicit Places using invariants in 583 ms returned [29, 202, 241]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 590 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 306/309 places, 1344/1344 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 303 transition count 1341
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 303 transition count 1341
Applied a total of 6 rules in 49 ms. Remains 303 /306 variables (removed 3) and now considering 1341/1344 (removed 3) transitions.
[2024-06-01 15:26:00] [INFO ] Flow matrix only has 1317 transitions (discarded 24 similar events)
// Phase 1: matrix 1317 rows 303 cols
[2024-06-01 15:26:00] [INFO ] Computed 41 invariants in 28 ms
[2024-06-01 15:26:00] [INFO ] Implicit Places using invariants in 547 ms returned []
[2024-06-01 15:26:00] [INFO ] Flow matrix only has 1317 transitions (discarded 24 similar events)
[2024-06-01 15:26:00] [INFO ] Invariant cache hit.
[2024-06-01 15:26:01] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-06-01 15:26:06] [INFO ] Implicit Places using invariants and state equation in 6303 ms returned []
Implicit Place search using SMT with State Equation took 6874 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 303/309 places, 1341/1344 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 7557 ms. Remains : 303/309 places, 1341/1344 transitions.
[2024-06-01 15:26:06] [INFO ] Flow matrix only has 1317 transitions (discarded 24 similar events)
[2024-06-01 15:26:06] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[105]
RANDOM walk for 1000000 steps (11019 resets) in 7548 ms. (132 steps per ms)
BEST_FIRST walk for 1000000 steps (3660 resets) in 2830 ms. (353 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[105]
[2024-06-01 15:26:17] [INFO ] Flow matrix only has 1317 transitions (discarded 24 similar events)
[2024-06-01 15:26:17] [INFO ] Invariant cache hit.
[2024-06-01 15:26:17] [INFO ] [Real]Absence check using 18 positive place invariants in 7 ms returned sat
[2024-06-01 15:26:17] [INFO ] [Real]Absence check using 18 positive and 23 generalized place invariants in 17 ms returned sat
[2024-06-01 15:26:18] [INFO ] [Real]Absence check using state equation in 838 ms returned sat
[2024-06-01 15:26:18] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 15:26:18] [INFO ] [Nat]Absence check using 18 positive place invariants in 4 ms returned sat
[2024-06-01 15:26:18] [INFO ] [Nat]Absence check using 18 positive and 23 generalized place invariants in 11 ms returned sat
[2024-06-01 15:26:19] [INFO ] [Nat]Absence check using state equation in 879 ms returned sat
[2024-06-01 15:26:19] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-06-01 15:26:19] [INFO ] [Nat]Added 112 Read/Feed constraints in 655 ms returned sat
[2024-06-01 15:26:19] [INFO ] Deduced a trap composed of 50 places in 74 ms of which 1 ms to minimize.
[2024-06-01 15:26:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 606 ms
[2024-06-01 15:26:20] [INFO ] Computed and/alt/rep : 1009/4131/1004 causal constraints (skipped 307 transitions) in 96 ms.
[2024-06-01 15:26:22] [INFO ] Added : 65 causal constraints over 13 iterations in 1638 ms. Result :sat
Minimization took 4955 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[105]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[105]
Support contains 1 out of 303 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 303/303 places, 1341/1341 transitions.
Applied a total of 0 rules in 51 ms. Remains 303 /303 variables (removed 0) and now considering 1341/1341 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 303/303 places, 1341/1341 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 303/303 places, 1341/1341 transitions.
Applied a total of 0 rules in 39 ms. Remains 303 /303 variables (removed 0) and now considering 1341/1341 (removed 0) transitions.
[2024-06-01 15:26:27] [INFO ] Flow matrix only has 1317 transitions (discarded 24 similar events)
[2024-06-01 15:26:27] [INFO ] Invariant cache hit.
[2024-06-01 15:26:27] [INFO ] Implicit Places using invariants in 508 ms returned []
[2024-06-01 15:26:27] [INFO ] Flow matrix only has 1317 transitions (discarded 24 similar events)
[2024-06-01 15:26:27] [INFO ] Invariant cache hit.
[2024-06-01 15:26:28] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-06-01 15:26:34] [INFO ] Implicit Places using invariants and state equation in 6521 ms returned []
Implicit Place search using SMT with State Equation took 7045 ms to find 0 implicit places.
[2024-06-01 15:26:34] [INFO ] Redundant transitions in 79 ms returned []
Running 1335 sub problems to find dead transitions.
[2024-06-01 15:26:34] [INFO ] Flow matrix only has 1317 transitions (discarded 24 similar events)
[2024-06-01 15:26:34] [INFO ] Invariant cache hit.
[2024-06-01 15:26:34] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/297 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1335 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/297 variables, 16/30 constraints. Problems are: Problem set: 0 solved, 1335 unsolved
[2024-06-01 15:26:58] [INFO ] Deduced a trap composed of 3 places in 74 ms of which 2 ms to minimize.
[2024-06-01 15:26:58] [INFO ] Deduced a trap composed of 18 places in 105 ms of which 2 ms to minimize.
[2024-06-01 15:27:01] [INFO ] Deduced a trap composed of 72 places in 114 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/297 variables, 3/33 constraints. Problems are: Problem set: 0 solved, 1335 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/297 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1335 unsolved
Problem TDEAD625 is UNSAT
Problem TDEAD628 is UNSAT
Problem TDEAD634 is UNSAT
Problem TDEAD635 is UNSAT
Problem TDEAD641 is UNSAT
Problem TDEAD644 is UNSAT
Problem TDEAD654 is UNSAT
Problem TDEAD665 is UNSAT
Problem TDEAD678 is UNSAT
Problem TDEAD681 is UNSAT
Problem TDEAD690 is UNSAT
Problem TDEAD691 is UNSAT
Problem TDEAD692 is UNSAT
Problem TDEAD696 is UNSAT
Problem TDEAD700 is UNSAT
Problem TDEAD701 is UNSAT
Problem TDEAD711 is UNSAT
Problem TDEAD712 is UNSAT
Problem TDEAD717 is UNSAT
Problem TDEAD718 is UNSAT
Problem TDEAD719 is UNSAT
Problem TDEAD721 is UNSAT
Problem TDEAD734 is UNSAT
Problem TDEAD739 is UNSAT
Problem TDEAD741 is UNSAT
Problem TDEAD759 is UNSAT
Problem TDEAD762 is UNSAT
Problem TDEAD766 is UNSAT
Problem TDEAD768 is UNSAT
Problem TDEAD786 is UNSAT
Problem TDEAD787 is UNSAT
Problem TDEAD795 is UNSAT
Problem TDEAD796 is UNSAT
Problem TDEAD797 is UNSAT
Problem TDEAD798 is UNSAT
Problem TDEAD808 is UNSAT
Problem TDEAD810 is UNSAT
Problem TDEAD811 is UNSAT
Problem TDEAD816 is UNSAT
Problem TDEAD817 is UNSAT
Problem TDEAD820 is UNSAT
Problem TDEAD822 is UNSAT
Problem TDEAD825 is UNSAT
Problem TDEAD826 is UNSAT
Problem TDEAD827 is UNSAT
Problem TDEAD829 is UNSAT
Problem TDEAD831 is UNSAT
Problem TDEAD833 is UNSAT
Problem TDEAD836 is UNSAT
Problem TDEAD837 is UNSAT
Problem TDEAD844 is UNSAT
Problem TDEAD845 is UNSAT
Problem TDEAD846 is UNSAT
Problem TDEAD849 is UNSAT
Problem TDEAD851 is UNSAT
Problem TDEAD852 is UNSAT
Problem TDEAD857 is UNSAT
Problem TDEAD858 is UNSAT
Problem TDEAD859 is UNSAT
Problem TDEAD860 is UNSAT
Problem TDEAD861 is UNSAT
Problem TDEAD862 is UNSAT
Problem TDEAD863 is UNSAT
Problem TDEAD865 is UNSAT
Problem TDEAD868 is UNSAT
Problem TDEAD870 is UNSAT
Problem TDEAD873 is UNSAT
Problem TDEAD877 is UNSAT
Problem TDEAD879 is UNSAT
Problem TDEAD881 is UNSAT
Problem TDEAD883 is UNSAT
Problem TDEAD885 is UNSAT
Problem TDEAD888 is UNSAT
Problem TDEAD889 is UNSAT
Problem TDEAD892 is UNSAT
Problem TDEAD893 is UNSAT
Problem TDEAD896 is UNSAT
Problem TDEAD898 is UNSAT
Problem TDEAD899 is UNSAT
Problem TDEAD901 is UNSAT
Problem TDEAD904 is UNSAT
Problem TDEAD921 is UNSAT
Problem TDEAD924 is UNSAT
Problem TDEAD925 is UNSAT
Problem TDEAD927 is UNSAT
Problem TDEAD928 is UNSAT
Problem TDEAD929 is UNSAT
Problem TDEAD933 is UNSAT
Problem TDEAD935 is UNSAT
Problem TDEAD936 is UNSAT
Problem TDEAD938 is UNSAT
Problem TDEAD940 is UNSAT
Problem TDEAD942 is UNSAT
Problem TDEAD944 is UNSAT
Problem TDEAD947 is UNSAT
Problem TDEAD948 is UNSAT
Problem TDEAD950 is UNSAT
Problem TDEAD951 is UNSAT
Problem TDEAD953 is UNSAT
Problem TDEAD954 is UNSAT
Problem TDEAD956 is UNSAT
Problem TDEAD958 is UNSAT
Problem TDEAD959 is UNSAT
Problem TDEAD960 is UNSAT
Problem TDEAD963 is UNSAT
Problem TDEAD965 is UNSAT
Problem TDEAD966 is UNSAT
Problem TDEAD969 is UNSAT
Problem TDEAD970 is UNSAT
Problem TDEAD972 is UNSAT
Problem TDEAD973 is UNSAT
Problem TDEAD974 is UNSAT
Problem TDEAD975 is UNSAT
Problem TDEAD976 is UNSAT
Problem TDEAD977 is UNSAT
Problem TDEAD979 is UNSAT
Problem TDEAD982 is UNSAT
Problem TDEAD983 is UNSAT
Problem TDEAD989 is UNSAT
Problem TDEAD990 is UNSAT
Problem TDEAD992 is UNSAT
Problem TDEAD994 is UNSAT
Problem TDEAD995 is UNSAT
Problem TDEAD997 is UNSAT
Problem TDEAD998 is UNSAT
Problem TDEAD1000 is UNSAT
Problem TDEAD1001 is UNSAT
Problem TDEAD1002 is UNSAT
Problem TDEAD1003 is UNSAT
Problem TDEAD1004 is UNSAT
Problem TDEAD1008 is UNSAT
Problem TDEAD1009 is UNSAT
Problem TDEAD1010 is UNSAT
Problem TDEAD1011 is UNSAT
Problem TDEAD1016 is UNSAT
Problem TDEAD1017 is UNSAT
Problem TDEAD1018 is UNSAT
Problem TDEAD1020 is UNSAT
Problem TDEAD1021 is UNSAT
Problem TDEAD1022 is UNSAT
Problem TDEAD1024 is UNSAT
Problem TDEAD1025 is UNSAT
Problem TDEAD1026 is UNSAT
Problem TDEAD1028 is UNSAT
Problem TDEAD1030 is UNSAT
Problem TDEAD1033 is UNSAT
Problem TDEAD1035 is UNSAT
Problem TDEAD1036 is UNSAT
Problem TDEAD1039 is UNSAT
Problem TDEAD1044 is UNSAT
Problem TDEAD1045 is UNSAT
Problem TDEAD1047 is UNSAT
Problem TDEAD1048 is UNSAT
Problem TDEAD1050 is UNSAT
Problem TDEAD1051 is UNSAT
Problem TDEAD1053 is UNSAT
Problem TDEAD1058 is UNSAT
Problem TDEAD1062 is UNSAT
Problem TDEAD1065 is UNSAT
Problem TDEAD1067 is UNSAT
Problem TDEAD1068 is UNSAT
Problem TDEAD1071 is UNSAT
Problem TDEAD1072 is UNSAT
Problem TDEAD1074 is UNSAT
Problem TDEAD1075 is UNSAT
Problem TDEAD1076 is UNSAT
Problem TDEAD1077 is UNSAT
Problem TDEAD1078 is UNSAT
Problem TDEAD1080 is UNSAT
Problem TDEAD1087 is UNSAT
Problem TDEAD1088 is UNSAT
Problem TDEAD1091 is UNSAT
Problem TDEAD1092 is UNSAT
Problem TDEAD1096 is UNSAT
Problem TDEAD1102 is UNSAT
Problem TDEAD1103 is UNSAT
Problem TDEAD1104 is UNSAT
Problem TDEAD1105 is UNSAT
Problem TDEAD1107 is UNSAT
Problem TDEAD1108 is UNSAT
Problem TDEAD1111 is UNSAT
Problem TDEAD1112 is UNSAT
Problem TDEAD1115 is UNSAT
Problem TDEAD1118 is UNSAT
Problem TDEAD1119 is UNSAT
Problem TDEAD1122 is UNSAT
Problem TDEAD1123 is UNSAT
Problem TDEAD1128 is UNSAT
Problem TDEAD1129 is UNSAT
Problem TDEAD1132 is UNSAT
Problem TDEAD1133 is UNSAT
Problem TDEAD1134 is UNSAT
Problem TDEAD1139 is UNSAT
Problem TDEAD1141 is UNSAT
Problem TDEAD1142 is UNSAT
Problem TDEAD1144 is UNSAT
Problem TDEAD1151 is UNSAT
Problem TDEAD1152 is UNSAT
Problem TDEAD1153 is UNSAT
Problem TDEAD1156 is UNSAT
Problem TDEAD1157 is UNSAT
Problem TDEAD1159 is UNSAT
Problem TDEAD1161 is UNSAT
Problem TDEAD1163 is UNSAT
Problem TDEAD1164 is UNSAT
Problem TDEAD1167 is UNSAT
Problem TDEAD1168 is UNSAT
Problem TDEAD1169 is UNSAT
Problem TDEAD1170 is UNSAT
Problem TDEAD1171 is UNSAT
Problem TDEAD1173 is UNSAT
Problem TDEAD1174 is UNSAT
Problem TDEAD1176 is UNSAT
Problem TDEAD1177 is UNSAT
Problem TDEAD1185 is UNSAT
Problem TDEAD1188 is UNSAT
Problem TDEAD1189 is UNSAT
Problem TDEAD1191 is UNSAT
Problem TDEAD1192 is UNSAT
Problem TDEAD1196 is UNSAT
Problem TDEAD1197 is UNSAT
Problem TDEAD1199 is UNSAT
Problem TDEAD1200 is UNSAT
Problem TDEAD1202 is UNSAT
Problem TDEAD1206 is UNSAT
Problem TDEAD1207 is UNSAT
Problem TDEAD1208 is UNSAT
Problem TDEAD1209 is UNSAT
Problem TDEAD1210 is UNSAT
Problem TDEAD1212 is UNSAT
Problem TDEAD1213 is UNSAT
Problem TDEAD1217 is UNSAT
Problem TDEAD1218 is UNSAT
Problem TDEAD1220 is UNSAT
Problem TDEAD1222 is UNSAT
Problem TDEAD1224 is UNSAT
Problem TDEAD1225 is UNSAT
Problem TDEAD1227 is UNSAT
Problem TDEAD1229 is UNSAT
Problem TDEAD1230 is UNSAT
Problem TDEAD1233 is UNSAT
Problem TDEAD1234 is UNSAT
Problem TDEAD1236 is UNSAT
Problem TDEAD1237 is UNSAT
Problem TDEAD1239 is UNSAT
Problem TDEAD1240 is UNSAT
Problem TDEAD1241 is UNSAT
Problem TDEAD1242 is UNSAT
Problem TDEAD1248 is UNSAT
Problem TDEAD1249 is UNSAT
Problem TDEAD1252 is UNSAT
Problem TDEAD1253 is UNSAT
Problem TDEAD1258 is UNSAT
Problem TDEAD1261 is UNSAT
Problem TDEAD1262 is UNSAT
Problem TDEAD1263 is UNSAT
Problem TDEAD1265 is UNSAT
Problem TDEAD1266 is UNSAT
Problem TDEAD1268 is UNSAT
Problem TDEAD1272 is UNSAT
Problem TDEAD1273 is UNSAT
Problem TDEAD1277 is UNSAT
Problem TDEAD1278 is UNSAT
Problem TDEAD1279 is UNSAT
Problem TDEAD1280 is UNSAT
Problem TDEAD1283 is UNSAT
Problem TDEAD1284 is UNSAT
Problem TDEAD1285 is UNSAT
Problem TDEAD1291 is UNSAT
Problem TDEAD1297 is UNSAT
Problem TDEAD1298 is UNSAT
Problem TDEAD1299 is UNSAT
Problem TDEAD1300 is UNSAT
Problem TDEAD1301 is UNSAT
Problem TDEAD1302 is UNSAT
Problem TDEAD1303 is UNSAT
Problem TDEAD1306 is UNSAT
Problem TDEAD1307 is UNSAT
Problem TDEAD1308 is UNSAT
Problem TDEAD1309 is UNSAT
Problem TDEAD1310 is UNSAT
Problem TDEAD1311 is UNSAT
Problem TDEAD1313 is UNSAT
Problem TDEAD1315 is UNSAT
Problem TDEAD1318 is UNSAT
Problem TDEAD1321 is UNSAT
Problem TDEAD1322 is UNSAT
Problem TDEAD1323 is UNSAT
Problem TDEAD1327 is UNSAT
Problem TDEAD1329 is UNSAT
Problem TDEAD1332 is UNSAT
Problem TDEAD1333 is UNSAT
Problem TDEAD1334 is UNSAT
At refinement iteration 4 (OVERLAPS) 4/301 variables, 4/37 constraints. Problems are: Problem set: 293 solved, 1042 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 301/1620 variables, and 37 constraints, problems are : Problem set: 293 solved, 1042 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 16/23 constraints, State Equation: 0/303 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1335/1335 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 293 solved, 1042 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/297 variables, 14/14 constraints. Problems are: Problem set: 293 solved, 1042 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/297 variables, 16/30 constraints. Problems are: Problem set: 293 solved, 1042 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/297 variables, 3/33 constraints. Problems are: Problem set: 293 solved, 1042 unsolved
[2024-06-01 15:27:24] [INFO ] Deduced a trap composed of 21 places in 238 ms of which 1 ms to minimize.
[2024-06-01 15:27:24] [INFO ] Deduced a trap composed of 52 places in 56 ms of which 1 ms to minimize.
[2024-06-01 15:27:24] [INFO ] Deduced a trap composed of 50 places in 58 ms of which 0 ms to minimize.
[2024-06-01 15:27:24] [INFO ] Deduced a trap composed of 50 places in 52 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/297 variables, 4/37 constraints. Problems are: Problem set: 293 solved, 1042 unsolved
[2024-06-01 15:27:31] [INFO ] Deduced a trap composed of 50 places in 56 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/297 variables, 1/38 constraints. Problems are: Problem set: 293 solved, 1042 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/297 variables, 0/38 constraints. Problems are: Problem set: 293 solved, 1042 unsolved
At refinement iteration 6 (OVERLAPS) 4/301 variables, 4/42 constraints. Problems are: Problem set: 293 solved, 1042 unsolved
[2024-06-01 15:27:42] [INFO ] Deduced a trap composed of 24 places in 331 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/301 variables, 1/43 constraints. Problems are: Problem set: 293 solved, 1042 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 301/1620 variables, and 43 constraints, problems are : Problem set: 293 solved, 1042 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 16/23 constraints, State Equation: 0/303 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1335 constraints, Known Traps: 9/9 constraints]
After SMT, in 78412ms problems are : Problem set: 293 solved, 1042 unsolved
Search for dead transitions found 293 dead transitions in 78432ms
Found 293 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 293 transitions
Dead transitions reduction (with SMT) removed 293 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 303/303 places, 1048/1341 transitions.
Applied a total of 0 rules in 45 ms. Remains 303 /303 variables (removed 0) and now considering 1048/1048 (removed 0) transitions.
[2024-06-01 15:27:52] [INFO ] Redundant transitions in 40 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 85729 ms. Remains : 303/303 places, 1048/1341 transitions.
[2024-06-01 15:27:52] [INFO ] Flow matrix only has 1024 transitions (discarded 24 similar events)
// Phase 1: matrix 1024 rows 303 cols
[2024-06-01 15:27:52] [INFO ] Computed 41 invariants in 34 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[105]
RANDOM walk for 1000000 steps (10952 resets) in 6182 ms. (161 steps per ms)
BEST_FIRST walk for 1000001 steps (3507 resets) in 2502 ms. (399 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[105]
[2024-06-01 15:28:01] [INFO ] Flow matrix only has 1024 transitions (discarded 24 similar events)
[2024-06-01 15:28:01] [INFO ] Invariant cache hit.
[2024-06-01 15:28:01] [INFO ] [Real]Absence check using 20 positive place invariants in 8 ms returned sat
[2024-06-01 15:28:01] [INFO ] [Real]Absence check using 20 positive and 21 generalized place invariants in 12 ms returned sat
[2024-06-01 15:28:02] [INFO ] [Real]Absence check using state equation in 689 ms returned sat
[2024-06-01 15:28:02] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 15:28:02] [INFO ] [Nat]Absence check using 20 positive place invariants in 9 ms returned sat
[2024-06-01 15:28:02] [INFO ] [Nat]Absence check using 20 positive and 21 generalized place invariants in 11 ms returned sat
[2024-06-01 15:28:03] [INFO ] [Nat]Absence check using state equation in 1120 ms returned sat
[2024-06-01 15:28:03] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-06-01 15:28:04] [INFO ] [Nat]Added 112 Read/Feed constraints in 1331 ms returned sat
[2024-06-01 15:28:05] [INFO ] Deduced a trap composed of 50 places in 80 ms of which 1 ms to minimize.
[2024-06-01 15:28:05] [INFO ] Deduced a trap composed of 50 places in 80 ms of which 1 ms to minimize.
[2024-06-01 15:28:06] [INFO ] Deduced a trap composed of 158 places in 360 ms of which 4 ms to minimize.
[2024-06-01 15:28:06] [INFO ] Deduced a trap composed of 156 places in 330 ms of which 2 ms to minimize.
[2024-06-01 15:28:07] [INFO ] Deduced a trap composed of 149 places in 357 ms of which 3 ms to minimize.
[2024-06-01 15:28:07] [INFO ] Deduced a trap composed of 156 places in 344 ms of which 2 ms to minimize.
[2024-06-01 15:28:07] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2629 ms
[2024-06-01 15:28:07] [INFO ] Computed and/alt/rep : 716/3167/711 causal constraints (skipped 307 transitions) in 104 ms.
[2024-06-01 15:28:09] [INFO ] Added : 61 causal constraints over 13 iterations in 2303 ms. Result :sat
Minimization took 4774 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[105]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[105]
Support contains 1 out of 303 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 303/303 places, 1048/1048 transitions.
Applied a total of 0 rules in 44 ms. Remains 303 /303 variables (removed 0) and now considering 1048/1048 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 303/303 places, 1048/1048 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 303/303 places, 1048/1048 transitions.
Applied a total of 0 rules in 35 ms. Remains 303 /303 variables (removed 0) and now considering 1048/1048 (removed 0) transitions.
[2024-06-01 15:28:14] [INFO ] Flow matrix only has 1024 transitions (discarded 24 similar events)
[2024-06-01 15:28:14] [INFO ] Invariant cache hit.
[2024-06-01 15:28:15] [INFO ] Implicit Places using invariants in 411 ms returned []
[2024-06-01 15:28:15] [INFO ] Flow matrix only has 1024 transitions (discarded 24 similar events)
[2024-06-01 15:28:15] [INFO ] Invariant cache hit.
[2024-06-01 15:28:15] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-06-01 15:28:20] [INFO ] Implicit Places using invariants and state equation in 5794 ms returned []
Implicit Place search using SMT with State Equation took 6210 ms to find 0 implicit places.
[2024-06-01 15:28:20] [INFO ] Redundant transitions in 46 ms returned []
Running 1042 sub problems to find dead transitions.
[2024-06-01 15:28:21] [INFO ] Flow matrix only has 1024 transitions (discarded 24 similar events)
[2024-06-01 15:28:21] [INFO ] Invariant cache hit.
[2024-06-01 15:28:21] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/297 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1042 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/297 variables, 18/34 constraints. Problems are: Problem set: 0 solved, 1042 unsolved
[2024-06-01 15:28:32] [INFO ] Deduced a trap composed of 18 places in 187 ms of which 2 ms to minimize.
[2024-06-01 15:28:32] [INFO ] Deduced a trap composed of 35 places in 145 ms of which 5 ms to minimize.
[2024-06-01 15:28:33] [INFO ] Deduced a trap composed of 11 places in 108 ms of which 2 ms to minimize.
[2024-06-01 15:28:35] [INFO ] Deduced a trap composed of 87 places in 217 ms of which 2 ms to minimize.
[2024-06-01 15:28:36] [INFO ] Deduced a trap composed of 79 places in 199 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/297 variables, 5/39 constraints. Problems are: Problem set: 0 solved, 1042 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/297 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1042 unsolved
At refinement iteration 4 (OVERLAPS) 4/301 variables, 4/43 constraints. Problems are: Problem set: 0 solved, 1042 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 301/1327 variables, and 43 constraints, problems are : Problem set: 0 solved, 1042 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 18/21 constraints, State Equation: 0/303 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1042/1042 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1042 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/297 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1042 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/297 variables, 18/34 constraints. Problems are: Problem set: 0 solved, 1042 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/297 variables, 5/39 constraints. Problems are: Problem set: 0 solved, 1042 unsolved
[2024-06-01 15:28:59] [INFO ] Deduced a trap composed of 50 places in 55 ms of which 2 ms to minimize.
[2024-06-01 15:28:59] [INFO ] Deduced a trap composed of 52 places in 35 ms of which 1 ms to minimize.
[2024-06-01 15:29:00] [INFO ] Deduced a trap composed of 50 places in 45 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/297 variables, 3/42 constraints. Problems are: Problem set: 0 solved, 1042 unsolved
[2024-06-01 15:29:08] [INFO ] Deduced a trap composed of 50 places in 49 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/297 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 1042 unsolved
[2024-06-01 15:29:17] [INFO ] Deduced a trap composed of 35 places in 149 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/297 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 1042 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/297 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1042 unsolved
SMT process timed out in 67153ms, After SMT, problems are : Problem set: 0 solved, 1042 unsolved
Search for dead transitions found 0 dead transitions in 67174ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73479 ms. Remains : 303/303 places, 1048/1048 transitions.
RANDOM walk for 40000 steps (453 resets) in 1087 ms. (36 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (142 resets) in 299 ms. (133 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (164 resets) in 225 ms. (177 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 209161 steps, run timeout after 3001 ms. (steps per millisecond=69 ) properties seen :0 out of 2
Probabilistic random walk after 209161 steps, saw 94088 distinct states, run finished after 3012 ms. (steps per millisecond=69 ) properties seen :0
[2024-06-01 15:29:31] [INFO ] Flow matrix only has 1024 transitions (discarded 24 similar events)
[2024-06-01 15:29:31] [INFO ] Invariant cache hit.
[2024-06-01 15:29:31] [INFO ] State equation strengthened by 112 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) 129/130 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 67/197 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/197 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 22/219 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 5/224 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/224 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
At refinement iteration 9 (OVERLAPS) 77/301 variables, 19/40 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/301 variables, 0/40 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1024/1325 variables, 301/341 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1325 variables, 112/453 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1325 variables, 0/453 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/1327 variables, 2/455 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1327 variables, 1/456 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1327 variables, 0/456 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/1327 variables, 0/456 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1327/1327 variables, and 456 constraints, problems are : Problem set: 1 solved, 1 unsolved in 903 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 303/303 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 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) 129/130 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 67/197 variables, 16/18 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/197 variables, 0/18 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 22/219 variables, 2/20 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 0/20 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 5/224 variables, 1/21 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/224 variables, 0/21 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 77/301 variables, 19/40 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-06-01 15:29:33] [INFO ] Deduced a trap composed of 147 places in 238 ms of which 3 ms to minimize.
[2024-06-01 15:29:33] [INFO ] Deduced a trap composed of 141 places in 245 ms of which 3 ms to minimize.
[2024-06-01 15:29:33] [INFO ] Deduced a trap composed of 150 places in 261 ms of which 2 ms to minimize.
[2024-06-01 15:29:33] [INFO ] Deduced a trap composed of 143 places in 252 ms of which 2 ms to minimize.
[2024-06-01 15:29:34] [INFO ] Deduced a trap composed of 153 places in 257 ms of which 1 ms to minimize.
[2024-06-01 15:29:34] [INFO ] Deduced a trap composed of 134 places in 280 ms of which 2 ms to minimize.
[2024-06-01 15:29:34] [INFO ] Deduced a trap composed of 50 places in 318 ms of which 2 ms to minimize.
[2024-06-01 15:29:34] [INFO ] Deduced a trap composed of 136 places in 254 ms of which 2 ms to minimize.
[2024-06-01 15:29:35] [INFO ] Deduced a trap composed of 50 places in 254 ms of which 2 ms to minimize.
[2024-06-01 15:29:35] [INFO ] Deduced a trap composed of 134 places in 237 ms of which 2 ms to minimize.
[2024-06-01 15:29:35] [INFO ] Deduced a trap composed of 140 places in 231 ms of which 1 ms to minimize.
[2024-06-01 15:29:35] [INFO ] Deduced a trap composed of 140 places in 216 ms of which 2 ms to minimize.
[2024-06-01 15:29:36] [INFO ] Deduced a trap composed of 144 places in 218 ms of which 2 ms to minimize.
[2024-06-01 15:29:36] [INFO ] Deduced a trap composed of 127 places in 256 ms of which 4 ms to minimize.
[2024-06-01 15:29:36] [INFO ] Deduced a trap composed of 154 places in 197 ms of which 2 ms to minimize.
[2024-06-01 15:29:36] [INFO ] Deduced a trap composed of 140 places in 234 ms of which 2 ms to minimize.
[2024-06-01 15:29:37] [INFO ] Deduced a trap composed of 147 places in 196 ms of which 1 ms to minimize.
[2024-06-01 15:29:37] [INFO ] Deduced a trap composed of 138 places in 212 ms of which 2 ms to minimize.
[2024-06-01 15:29:37] [INFO ] Deduced a trap composed of 132 places in 224 ms of which 2 ms to minimize.
[2024-06-01 15:29:37] [INFO ] Deduced a trap composed of 138 places in 302 ms of which 2 ms to minimize.
SMT process timed out in 6043ms, After SMT, problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 303 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 303/303 places, 1048/1048 transitions.
Applied a total of 0 rules in 33 ms. Remains 303 /303 variables (removed 0) and now considering 1048/1048 (removed 0) transitions.
Running 1042 sub problems to find dead transitions.
[2024-06-01 15:29:37] [INFO ] Flow matrix only has 1024 transitions (discarded 24 similar events)
[2024-06-01 15:29:37] [INFO ] Invariant cache hit.
[2024-06-01 15:29:37] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/297 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1042 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/297 variables, 18/34 constraints. Problems are: Problem set: 0 solved, 1042 unsolved
[2024-06-01 15:29:49] [INFO ] Deduced a trap composed of 18 places in 295 ms of which 2 ms to minimize.
[2024-06-01 15:29:49] [INFO ] Deduced a trap composed of 35 places in 149 ms of which 2 ms to minimize.
[2024-06-01 15:29:50] [INFO ] Deduced a trap composed of 11 places in 129 ms of which 2 ms to minimize.
[2024-06-01 15:29:53] [INFO ] Deduced a trap composed of 87 places in 182 ms of which 1 ms to minimize.
[2024-06-01 15:29:53] [INFO ] Deduced a trap composed of 79 places in 190 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/297 variables, 5/39 constraints. Problems are: Problem set: 0 solved, 1042 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 297/1327 variables, and 39 constraints, problems are : Problem set: 0 solved, 1042 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 16/20 constraints, Generalized P Invariants (flows): 18/21 constraints, State Equation: 0/303 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1042/1042 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1042 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/297 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1042 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/297 variables, 18/34 constraints. Problems are: Problem set: 0 solved, 1042 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/297 variables, 5/39 constraints. Problems are: Problem set: 0 solved, 1042 unsolved
[2024-06-01 15:30:06] [INFO ] Deduced a trap composed of 50 places in 93 ms of which 2 ms to minimize.
[2024-06-01 15:30:07] [INFO ] Deduced a trap composed of 52 places in 74 ms of which 1 ms to minimize.
[2024-06-01 15:30:07] [INFO ] Deduced a trap composed of 50 places in 61 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/297 variables, 3/42 constraints. Problems are: Problem set: 0 solved, 1042 unsolved
[2024-06-01 15:30:15] [INFO ] Deduced a trap composed of 50 places in 48 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/297 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 1042 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 297/1327 variables, and 43 constraints, problems are : Problem set: 0 solved, 1042 unsolved in 20042 ms.
Refiners :[Positive P Invariants (semi-flows): 16/20 constraints, Generalized P Invariants (flows): 18/21 constraints, State Equation: 0/303 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1042 constraints, Known Traps: 9/9 constraints]
After SMT, in 46698ms problems are : Problem set: 0 solved, 1042 unsolved
Search for dead transitions found 0 dead transitions in 46717ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46757 ms. Remains : 303/303 places, 1048/1048 transitions.
RANDOM walk for 40000 steps (441 resets) in 369 ms. (108 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (150 resets) in 242 ms. (164 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 284114 steps, run timeout after 3001 ms. (steps per millisecond=94 ) properties seen :0 out of 1
Probabilistic random walk after 284114 steps, saw 134937 distinct states, run finished after 3001 ms. (steps per millisecond=94 ) properties seen :0
[2024-06-01 15:30:27] [INFO ] Flow matrix only has 1024 transitions (discarded 24 similar events)
[2024-06-01 15:30:27] [INFO ] Invariant cache hit.
[2024-06-01 15:30:27] [INFO ] State equation strengthened by 112 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) 129/130 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 67/197 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/197 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 22/219 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 5/224 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 15:30:28] [INFO ] Deduced a trap composed of 23 places in 129 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/224 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/224 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 77/301 variables, 19/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/301 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 1024/1325 variables, 301/342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1325 variables, 112/454 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1325 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/1327 variables, 2/456 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1327 variables, 1/457 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1327 variables, 0/457 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/1327 variables, 0/457 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1327/1327 variables, and 457 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1382 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 303/303 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 129/130 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 67/197 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/197 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 22/219 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 5/224 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/224 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/224 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 77/301 variables, 19/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 15:30:29] [INFO ] Deduced a trap composed of 133 places in 329 ms of which 2 ms to minimize.
[2024-06-01 15:30:29] [INFO ] Deduced a trap composed of 109 places in 300 ms of which 2 ms to minimize.
[2024-06-01 15:30:30] [INFO ] Deduced a trap composed of 118 places in 252 ms of which 1 ms to minimize.
[2024-06-01 15:30:30] [INFO ] Deduced a trap composed of 145 places in 234 ms of which 2 ms to minimize.
[2024-06-01 15:30:30] [INFO ] Deduced a trap composed of 124 places in 276 ms of which 2 ms to minimize.
[2024-06-01 15:30:31] [INFO ] Deduced a trap composed of 132 places in 271 ms of which 2 ms to minimize.
[2024-06-01 15:30:31] [INFO ] Deduced a trap composed of 121 places in 246 ms of which 2 ms to minimize.
[2024-06-01 15:30:31] [INFO ] Deduced a trap composed of 129 places in 223 ms of which 2 ms to minimize.
[2024-06-01 15:30:31] [INFO ] Deduced a trap composed of 50 places in 55 ms of which 1 ms to minimize.
[2024-06-01 15:30:31] [INFO ] Deduced a trap composed of 50 places in 42 ms of which 0 ms to minimize.
[2024-06-01 15:30:31] [INFO ] Deduced a trap composed of 147 places in 242 ms of which 2 ms to minimize.
[2024-06-01 15:30:32] [INFO ] Deduced a trap composed of 125 places in 252 ms of which 2 ms to minimize.
[2024-06-01 15:30:32] [INFO ] Deduced a trap composed of 131 places in 314 ms of which 1 ms to minimize.
[2024-06-01 15:30:32] [INFO ] Deduced a trap composed of 137 places in 277 ms of which 2 ms to minimize.
[2024-06-01 15:30:33] [INFO ] Deduced a trap composed of 121 places in 230 ms of which 2 ms to minimize.
[2024-06-01 15:30:33] [INFO ] Deduced a trap composed of 131 places in 231 ms of which 1 ms to minimize.
[2024-06-01 15:30:33] [INFO ] Deduced a trap composed of 141 places in 234 ms of which 2 ms to minimize.
[2024-06-01 15:30:33] [INFO ] Deduced a trap composed of 134 places in 237 ms of which 2 ms to minimize.
[2024-06-01 15:30:33] [INFO ] Deduced a trap composed of 139 places in 227 ms of which 2 ms to minimize.
[2024-06-01 15:30:34] [INFO ] Deduced a trap composed of 134 places in 223 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/301 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 15:30:34] [INFO ] Deduced a trap composed of 139 places in 224 ms of which 2 ms to minimize.
[2024-06-01 15:30:34] [INFO ] Deduced a trap composed of 125 places in 220 ms of which 2 ms to minimize.
[2024-06-01 15:30:34] [INFO ] Deduced a trap composed of 144 places in 219 ms of which 2 ms to minimize.
[2024-06-01 15:30:35] [INFO ] Deduced a trap composed of 133 places in 228 ms of which 1 ms to minimize.
[2024-06-01 15:30:35] [INFO ] Deduced a trap composed of 126 places in 226 ms of which 2 ms to minimize.
[2024-06-01 15:30:35] [INFO ] Deduced a trap composed of 136 places in 232 ms of which 3 ms to minimize.
[2024-06-01 15:30:35] [INFO ] Deduced a trap composed of 128 places in 269 ms of which 2 ms to minimize.
[2024-06-01 15:30:36] [INFO ] Deduced a trap composed of 128 places in 248 ms of which 2 ms to minimize.
[2024-06-01 15:30:36] [INFO ] Deduced a trap composed of 148 places in 234 ms of which 1 ms to minimize.
[2024-06-01 15:30:36] [INFO ] Deduced a trap composed of 133 places in 237 ms of which 1 ms to minimize.
[2024-06-01 15:30:36] [INFO ] Deduced a trap composed of 131 places in 231 ms of which 2 ms to minimize.
[2024-06-01 15:30:37] [INFO ] Deduced a trap composed of 126 places in 226 ms of which 1 ms to minimize.
[2024-06-01 15:30:37] [INFO ] Deduced a trap composed of 123 places in 261 ms of which 2 ms to minimize.
[2024-06-01 15:30:37] [INFO ] Deduced a trap composed of 132 places in 277 ms of which 3 ms to minimize.
[2024-06-01 15:30:38] [INFO ] Deduced a trap composed of 124 places in 293 ms of which 2 ms to minimize.
[2024-06-01 15:30:38] [INFO ] Deduced a trap composed of 132 places in 250 ms of which 2 ms to minimize.
[2024-06-01 15:30:38] [INFO ] Deduced a trap composed of 133 places in 230 ms of which 2 ms to minimize.
[2024-06-01 15:30:38] [INFO ] Deduced a trap composed of 138 places in 236 ms of which 1 ms to minimize.
[2024-06-01 15:30:39] [INFO ] Deduced a trap composed of 126 places in 273 ms of which 2 ms to minimize.
[2024-06-01 15:30:39] [INFO ] Deduced a trap composed of 126 places in 273 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/301 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 15:30:39] [INFO ] Deduced a trap composed of 120 places in 241 ms of which 2 ms to minimize.
[2024-06-01 15:30:39] [INFO ] Deduced a trap composed of 119 places in 215 ms of which 1 ms to minimize.
[2024-06-01 15:30:40] [INFO ] Deduced a trap composed of 136 places in 297 ms of which 2 ms to minimize.
[2024-06-01 15:30:40] [INFO ] Deduced a trap composed of 128 places in 254 ms of which 1 ms to minimize.
[2024-06-01 15:30:40] [INFO ] Deduced a trap composed of 134 places in 292 ms of which 1 ms to minimize.
[2024-06-01 15:30:41] [INFO ] Deduced a trap composed of 122 places in 511 ms of which 2 ms to minimize.
[2024-06-01 15:30:41] [INFO ] Deduced a trap composed of 127 places in 318 ms of which 2 ms to minimize.
[2024-06-01 15:30:42] [INFO ] Deduced a trap composed of 127 places in 321 ms of which 2 ms to minimize.
[2024-06-01 15:30:42] [INFO ] Deduced a trap composed of 137 places in 290 ms of which 2 ms to minimize.
[2024-06-01 15:30:42] [INFO ] Deduced a trap composed of 139 places in 311 ms of which 2 ms to minimize.
[2024-06-01 15:30:43] [INFO ] Deduced a trap composed of 126 places in 278 ms of which 2 ms to minimize.
[2024-06-01 15:30:43] [INFO ] Deduced a trap composed of 50 places in 48 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/301 variables, 12/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/301 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1024/1325 variables, 301/394 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1325 variables, 112/506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem MIN0 is UNSAT
After SMT solving in domain Int declared 1325/1327 variables, and 507 constraints, problems are : Problem set: 1 solved, 0 unsolved in 16625 ms.
Refiners :[Positive P Invariants (semi-flows): 19/20 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 301/303 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 53/53 constraints]
After SMT, in 18022ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA PolyORBLF-PT-S06J04T04-UpperBounds-15 1 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 409903 ms.
ITS solved all properties within timeout

BK_STOP 1717255845912

--------------------
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="PolyORBLF-PT-S06J04T04"
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 PolyORBLF-PT-S06J04T04, 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 r516-tajo-171654446800317"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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