Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.0M
-rw-r--r-- 1 mcc users 11K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.9K Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 17:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 20K Apr 12 18:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 164K Apr 12 18:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Apr 12 18:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 104K Apr 12 18:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 2.5M May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717178700219

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANConstruction-PT-040
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 18:05:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-31 18:05:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 18:05:01] [INFO ] Load time of PNML (sax parser for PT used): 250 ms
[2024-05-31 18:05:01] [INFO ] Transformed 3682 places.
[2024-05-31 18:05:01] [INFO ] Transformed 6720 transitions.
[2024-05-31 18:05:01] [INFO ] Parsed PT model containing 3682 places and 6720 transitions and 20000 arcs in 444 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 24 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (55 resets) in 2466 ms. (16 steps per ms) remains 5/16 properties
FORMULA CANConstruction-PT-040-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-040-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-040-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-040-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-040-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-040-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-040-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-040-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-040-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-040-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-040-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 315 ms. (126 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 276 ms. (144 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 83 ms. (476 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 133 ms. (298 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 705 ms. (56 steps per ms) remains 5/5 properties
// Phase 1: matrix 6720 rows 3682 cols
[2024-05-31 18:05:03] [INFO ] Computed 81 invariants in 81 ms
[2024-05-31 18:05:03] [INFO ] State equation strengthened by 3160 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem CANConstruction-PT-040-ReachabilityCardinality-2024-03 is UNSAT
FORMULA CANConstruction-PT-040-ReachabilityCardinality-2024-03 TRUE TECHNIQUES SMT_REFINEMENT
Problem CANConstruction-PT-040-ReachabilityCardinality-2024-10 is UNSAT
FORMULA CANConstruction-PT-040-ReachabilityCardinality-2024-10 FALSE TECHNIQUES SMT_REFINEMENT
Problem CANConstruction-PT-040-ReachabilityCardinality-2024-15 is UNSAT
FORMULA CANConstruction-PT-040-ReachabilityCardinality-2024-15 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 3493/3643 variables, 41/41 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3643 variables, 2/43 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3643 variables, 0/43 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 38/3681 variables, 38/81 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3681 variables, 0/81 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 6720/10401 variables, 3681/3762 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/10401 variables, 3160/6922 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/10401 variables, 0/6922 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1/10402 variables, 1/6923 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/10402 variables, 0/6923 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/10402 variables, 0/6923 constraints. Problems are: Problem set: 3 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 10402/10402 variables, and 6923 constraints, problems are : Problem set: 3 solved, 2 unsolved in 4313 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, Generalized P Invariants (flows): 40/40 constraints, State Equation: 3682/3682 constraints, ReadFeed: 3160/3160 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 3546/3640 variables, 39/39 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3640 variables, 1/40 constraints. Problems are: Problem set: 3 solved, 2 unsolved
[2024-05-31 18:05:11] [INFO ] Deduced a trap composed of 5 places in 3175 ms of which 171 ms to minimize.
[2024-05-31 18:05:14] [INFO ] Deduced a trap composed of 69 places in 2741 ms of which 25 ms to minimize.
SMT process timed out in 11099ms, After SMT, problems are : Problem set: 3 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 94 out of 3682 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3682/3682 places, 6720/6720 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 260 transitions
Trivial Post-agglo rules discarded 260 transitions
Performed 260 trivial Post agglomeration. Transition count delta: 260
Iterating post reduction 0 with 260 rules applied. Total rules applied 260 place count 3682 transition count 6460
Reduce places removed 260 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 265 rules applied. Total rules applied 525 place count 3422 transition count 6455
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 530 place count 3417 transition count 6455
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 530 place count 3417 transition count 6450
Deduced a syphon composed of 5 places in 3 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 540 place count 3412 transition count 6450
Discarding 1468 places :
Symmetric choice reduction at 3 with 1468 rule applications. Total rules 2008 place count 1944 transition count 3514
Iterating global reduction 3 with 1468 rules applied. Total rules applied 3476 place count 1944 transition count 3514
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 3 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 3542 place count 1911 transition count 3481
Free-agglomeration rule applied 11 times.
Iterating global reduction 3 with 11 rules applied. Total rules applied 3553 place count 1911 transition count 3470
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 3564 place count 1900 transition count 3470
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 3567 place count 1900 transition count 3467
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 3570 place count 1897 transition count 3467
Partial Free-agglomeration rule applied 73 times.
Drop transitions (Partial Free agglomeration) removed 73 transitions
Iterating global reduction 5 with 73 rules applied. Total rules applied 3643 place count 1897 transition count 3467
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 5 with 5 rules applied. Total rules applied 3648 place count 1897 transition count 3467
Applied a total of 3648 rules in 1390 ms. Remains 1897 /3682 variables (removed 1785) and now considering 3467/6720 (removed 3253) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1399 ms. Remains : 1897/3682 places, 3467/6720 transitions.
RANDOM walk for 40000 steps (134 resets) in 810 ms. (49 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 240 ms. (165 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 168 ms. (236 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 140168 steps, run timeout after 3016 ms. (steps per millisecond=46 ) properties seen :0 out of 2
Probabilistic random walk after 140168 steps, saw 74652 distinct states, run finished after 3026 ms. (steps per millisecond=46 ) properties seen :0
// Phase 1: matrix 3467 rows 1897 cols
[2024-05-31 18:05:19] [INFO ] Computed 81 invariants in 27 ms
[2024-05-31 18:05:19] [INFO ] State equation strengthened by 3224 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1761/1855 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1855 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1855 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 2/1857 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1857 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 39/1896 variables, 39/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1896 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 3467/5363 variables, 1896/1977 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/5363 variables, 3224/5201 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/5363 variables, 0/5201 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/5364 variables, 1/5202 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/5364 variables, 0/5202 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/5364 variables, 0/5202 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5364/5364 variables, and 5202 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2032 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, Generalized P Invariants (flows): 40/40 constraints, State Equation: 1897/1897 constraints, ReadFeed: 3224/3224 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1761/1855 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1855 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 18:05:22] [INFO ] Deduced a trap composed of 2 places in 1245 ms of which 12 ms to minimize.
[2024-05-31 18:05:24] [INFO ] Deduced a trap composed of 43 places in 1081 ms of which 11 ms to minimize.
[2024-05-31 18:05:25] [INFO ] Deduced a trap composed of 43 places in 1040 ms of which 11 ms to minimize.
[2024-05-31 18:05:26] [INFO ] Deduced a trap composed of 45 places in 971 ms of which 10 ms to minimize.
[2024-05-31 18:05:26] [INFO ] Deduced a trap composed of 46 places in 824 ms of which 10 ms to minimize.
[2024-05-31 18:05:27] [INFO ] Deduced a trap composed of 43 places in 909 ms of which 11 ms to minimize.
[2024-05-31 18:05:28] [INFO ] Deduced a trap composed of 43 places in 945 ms of which 10 ms to minimize.
[2024-05-31 18:05:29] [INFO ] Deduced a trap composed of 43 places in 946 ms of which 11 ms to minimize.
[2024-05-31 18:05:30] [INFO ] Deduced a trap composed of 43 places in 1035 ms of which 10 ms to minimize.
[2024-05-31 18:05:31] [INFO ] Deduced a trap composed of 50 places in 877 ms of which 10 ms to minimize.
[2024-05-31 18:05:32] [INFO ] Deduced a trap composed of 43 places in 839 ms of which 9 ms to minimize.
[2024-05-31 18:05:33] [INFO ] Deduced a trap composed of 43 places in 867 ms of which 11 ms to minimize.
[2024-05-31 18:05:34] [INFO ] Deduced a trap composed of 43 places in 1011 ms of which 11 ms to minimize.
[2024-05-31 18:05:35] [INFO ] Deduced a trap composed of 44 places in 906 ms of which 10 ms to minimize.
[2024-05-31 18:05:36] [INFO ] Deduced a trap composed of 45 places in 930 ms of which 10 ms to minimize.
[2024-05-31 18:05:37] [INFO ] Deduced a trap composed of 47 places in 924 ms of which 14 ms to minimize.
[2024-05-31 18:05:38] [INFO ] Deduced a trap composed of 43 places in 895 ms of which 10 ms to minimize.
[2024-05-31 18:05:39] [INFO ] Deduced a trap composed of 43 places in 812 ms of which 10 ms to minimize.
[2024-05-31 18:05:40] [INFO ] Deduced a trap composed of 46 places in 779 ms of which 9 ms to minimize.
[2024-05-31 18:05:41] [INFO ] Deduced a trap composed of 48 places in 889 ms of which 10 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1855 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 18:05:41] [INFO ] Deduced a trap composed of 43 places in 796 ms of which 9 ms to minimize.
[2024-05-31 18:05:42] [INFO ] Deduced a trap composed of 46 places in 761 ms of which 9 ms to minimize.
[2024-05-31 18:05:43] [INFO ] Deduced a trap composed of 47 places in 753 ms of which 9 ms to minimize.
[2024-05-31 18:05:44] [INFO ] Deduced a trap composed of 44 places in 807 ms of which 9 ms to minimize.
[2024-05-31 18:05:45] [INFO ] Deduced a trap composed of 46 places in 905 ms of which 17 ms to minimize.
[2024-05-31 18:05:46] [INFO ] Deduced a trap composed of 48 places in 783 ms of which 8 ms to minimize.
[2024-05-31 18:05:47] [INFO ] Deduced a trap composed of 51 places in 1546 ms of which 18 ms to minimize.
[2024-05-31 18:05:48] [INFO ] Deduced a trap composed of 48 places in 974 ms of which 14 ms to minimize.
[2024-05-31 18:05:49] [INFO ] Deduced a trap composed of 46 places in 848 ms of which 11 ms to minimize.
[2024-05-31 18:05:50] [INFO ] Deduced a trap composed of 48 places in 888 ms of which 9 ms to minimize.
[2024-05-31 18:05:51] [INFO ] Deduced a trap composed of 43 places in 899 ms of which 10 ms to minimize.
[2024-05-31 18:05:52] [INFO ] Deduced a trap composed of 43 places in 834 ms of which 10 ms to minimize.
[2024-05-31 18:05:53] [INFO ] Deduced a trap composed of 43 places in 728 ms of which 10 ms to minimize.
[2024-05-31 18:05:53] [INFO ] Deduced a trap composed of 48 places in 777 ms of which 9 ms to minimize.
[2024-05-31 18:05:54] [INFO ] Deduced a trap composed of 48 places in 751 ms of which 9 ms to minimize.
[2024-05-31 18:05:55] [INFO ] Deduced a trap composed of 43 places in 745 ms of which 9 ms to minimize.
[2024-05-31 18:05:56] [INFO ] Deduced a trap composed of 43 places in 853 ms of which 9 ms to minimize.
[2024-05-31 18:05:57] [INFO ] Deduced a trap composed of 54 places in 695 ms of which 9 ms to minimize.
[2024-05-31 18:05:57] [INFO ] Deduced a trap composed of 43 places in 872 ms of which 10 ms to minimize.
[2024-05-31 18:05:58] [INFO ] Deduced a trap composed of 43 places in 778 ms of which 9 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1855 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 18:05:59] [INFO ] Deduced a trap composed of 51 places in 766 ms of which 10 ms to minimize.
[2024-05-31 18:06:00] [INFO ] Deduced a trap composed of 46 places in 794 ms of which 9 ms to minimize.
[2024-05-31 18:06:01] [INFO ] Deduced a trap composed of 51 places in 682 ms of which 8 ms to minimize.
[2024-05-31 18:06:01] [INFO ] Deduced a trap composed of 43 places in 646 ms of which 8 ms to minimize.
[2024-05-31 18:06:02] [INFO ] Deduced a trap composed of 46 places in 672 ms of which 9 ms to minimize.
[2024-05-31 18:06:03] [INFO ] Deduced a trap composed of 43 places in 665 ms of which 8 ms to minimize.
[2024-05-31 18:06:04] [INFO ] Deduced a trap composed of 43 places in 676 ms of which 9 ms to minimize.
[2024-05-31 18:06:04] [INFO ] Deduced a trap composed of 47 places in 696 ms of which 9 ms to minimize.
[2024-05-31 18:06:05] [INFO ] Deduced a trap composed of 46 places in 742 ms of which 11 ms to minimize.
[2024-05-31 18:06:06] [INFO ] Deduced a trap composed of 46 places in 754 ms of which 10 ms to minimize.
[2024-05-31 18:06:07] [INFO ] Deduced a trap composed of 43 places in 681 ms of which 9 ms to minimize.
SMT process timed out in 47816ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 94 out of 1897 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1897/1897 places, 3467/3467 transitions.
Applied a total of 0 rules in 115 ms. Remains 1897 /1897 variables (removed 0) and now considering 3467/3467 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 115 ms. Remains : 1897/1897 places, 3467/3467 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1897/1897 places, 3467/3467 transitions.
Applied a total of 0 rules in 117 ms. Remains 1897 /1897 variables (removed 0) and now considering 3467/3467 (removed 0) transitions.
[2024-05-31 18:06:07] [INFO ] Invariant cache hit.
[2024-05-31 18:06:08] [INFO ] Implicit Places using invariants in 1130 ms returned [5, 14, 20, 26, 30, 36, 41, 45, 51, 57, 63, 69, 75, 81, 88, 94, 101, 107, 113, 119, 125, 131, 137, 143, 149, 156, 160, 166, 172, 180, 184, 190, 196, 201, 214, 222, 228, 234, 242]
Discarding 39 places :
Implicit Place search using SMT only with invariants took 1142 ms to find 39 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1858/1897 places, 3467/3467 transitions.
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 39 place count 1858 transition count 3428
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 1 with 39 rules applied. Total rules applied 78 place count 1819 transition count 3428
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 83 place count 1814 transition count 3423
Iterating global reduction 2 with 5 rules applied. Total rules applied 88 place count 1814 transition count 3423
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 128 place count 1794 transition count 3403
Applied a total of 128 rules in 283 ms. Remains 1794 /1858 variables (removed 64) and now considering 3403/3467 (removed 64) transitions.
// Phase 1: matrix 3403 rows 1794 cols
[2024-05-31 18:06:08] [INFO ] Computed 42 invariants in 30 ms
[2024-05-31 18:06:09] [INFO ] Implicit Places using invariants in 1023 ms returned []
[2024-05-31 18:06:09] [INFO ] Invariant cache hit.
[2024-05-31 18:06:10] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2024-05-31 18:06:29] [INFO ] Implicit Places using invariants and state equation in 19654 ms returned []
Implicit Place search using SMT with State Equation took 20682 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1794/1897 places, 3403/3467 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 22224 ms. Remains : 1794/1897 places, 3403/3467 transitions.
RANDOM walk for 40000 steps (133 resets) in 479 ms. (83 steps per ms) remains 1/2 properties
FORMULA CANConstruction-PT-040-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 62 ms. (634 steps per ms) remains 1/1 properties
[2024-05-31 18:06:29] [INFO ] Invariant cache hit.
[2024-05-31 18:06:29] [INFO ] State equation strengthened by 3160 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1746/1769 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1769 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1769 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 24/1793 variables, 24/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1793 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 3403/5196 variables, 1793/1835 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/5196 variables, 3160/4995 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/5196 variables, 0/4995 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/5197 variables, 1/4996 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/5197 variables, 0/4996 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/5197 variables, 0/4996 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5197/5197 variables, and 4996 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1362 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 1794/1794 constraints, ReadFeed: 3160/3160 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/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1746/1769 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1769 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 18:06:32] [INFO ] Deduced a trap composed of 3 places in 909 ms of which 10 ms to minimize.
[2024-05-31 18:06:33] [INFO ] Deduced a trap composed of 2 places in 952 ms of which 9 ms to minimize.
[2024-05-31 18:06:34] [INFO ] Deduced a trap composed of 2 places in 990 ms of which 10 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1769 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 18:06:35] [INFO ] Deduced a trap composed of 2 places in 977 ms of which 20 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1769 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1769 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 24/1793 variables, 24/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 18:06:36] [INFO ] Deduced a trap composed of 43 places in 1255 ms of which 12 ms to minimize.
[2024-05-31 18:06:37] [INFO ] Deduced a trap composed of 43 places in 1284 ms of which 12 ms to minimize.
[2024-05-31 18:06:39] [INFO ] Deduced a trap composed of 43 places in 1300 ms of which 11 ms to minimize.
[2024-05-31 18:06:40] [INFO ] Deduced a trap composed of 44 places in 1256 ms of which 11 ms to minimize.
[2024-05-31 18:06:41] [INFO ] Deduced a trap composed of 44 places in 1292 ms of which 11 ms to minimize.
[2024-05-31 18:06:43] [INFO ] Deduced a trap composed of 44 places in 1234 ms of which 11 ms to minimize.
[2024-05-31 18:06:44] [INFO ] Deduced a trap composed of 46 places in 1292 ms of which 11 ms to minimize.
[2024-05-31 18:06:45] [INFO ] Deduced a trap composed of 44 places in 1273 ms of which 12 ms to minimize.
[2024-05-31 18:06:46] [INFO ] Deduced a trap composed of 49 places in 1213 ms of which 11 ms to minimize.
[2024-05-31 18:06:48] [INFO ] Deduced a trap composed of 47 places in 1243 ms of which 11 ms to minimize.
[2024-05-31 18:06:49] [INFO ] Deduced a trap composed of 43 places in 1181 ms of which 11 ms to minimize.
[2024-05-31 18:06:50] [INFO ] Deduced a trap composed of 43 places in 1250 ms of which 12 ms to minimize.
[2024-05-31 18:06:51] [INFO ] Deduced a trap composed of 49 places in 1262 ms of which 11 ms to minimize.
[2024-05-31 18:06:53] [INFO ] Deduced a trap composed of 44 places in 1232 ms of which 12 ms to minimize.
[2024-05-31 18:06:54] [INFO ] Deduced a trap composed of 50 places in 1200 ms of which 11 ms to minimize.
[2024-05-31 18:06:55] [INFO ] Deduced a trap composed of 44 places in 1251 ms of which 11 ms to minimize.
[2024-05-31 18:06:56] [INFO ] Deduced a trap composed of 44 places in 1188 ms of which 11 ms to minimize.
[2024-05-31 18:06:58] [INFO ] Deduced a trap composed of 46 places in 1224 ms of which 10 ms to minimize.
[2024-05-31 18:06:59] [INFO ] Deduced a trap composed of 46 places in 1232 ms of which 12 ms to minimize.
[2024-05-31 18:07:00] [INFO ] Deduced a trap composed of 43 places in 1188 ms of which 11 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1793 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 18:07:02] [INFO ] Deduced a trap composed of 48 places in 1263 ms of which 11 ms to minimize.
[2024-05-31 18:07:03] [INFO ] Deduced a trap composed of 50 places in 1244 ms of which 11 ms to minimize.
[2024-05-31 18:07:04] [INFO ] Deduced a trap composed of 51 places in 1205 ms of which 10 ms to minimize.
[2024-05-31 18:07:05] [INFO ] Deduced a trap composed of 48 places in 1249 ms of which 11 ms to minimize.
[2024-05-31 18:07:07] [INFO ] Deduced a trap composed of 43 places in 1258 ms of which 11 ms to minimize.
[2024-05-31 18:07:08] [INFO ] Deduced a trap composed of 47 places in 1246 ms of which 12 ms to minimize.
[2024-05-31 18:07:09] [INFO ] Deduced a trap composed of 45 places in 1224 ms of which 11 ms to minimize.
[2024-05-31 18:07:10] [INFO ] Deduced a trap composed of 49 places in 1273 ms of which 12 ms to minimize.
[2024-05-31 18:07:12] [INFO ] Deduced a trap composed of 43 places in 1244 ms of which 12 ms to minimize.
[2024-05-31 18:07:13] [INFO ] Deduced a trap composed of 44 places in 1211 ms of which 11 ms to minimize.
[2024-05-31 18:07:14] [INFO ] Deduced a trap composed of 44 places in 1208 ms of which 12 ms to minimize.
[2024-05-31 18:07:15] [INFO ] Deduced a trap composed of 43 places in 1188 ms of which 11 ms to minimize.
[2024-05-31 18:07:17] [INFO ] Deduced a trap composed of 45 places in 1280 ms of which 12 ms to minimize.
[2024-05-31 18:07:18] [INFO ] Deduced a trap composed of 45 places in 1268 ms of which 12 ms to minimize.
[2024-05-31 18:07:19] [INFO ] Deduced a trap composed of 44 places in 1256 ms of which 11 ms to minimize.
[2024-05-31 18:07:21] [INFO ] Deduced a trap composed of 44 places in 1248 ms of which 11 ms to minimize.
[2024-05-31 18:07:22] [INFO ] Deduced a trap composed of 44 places in 1252 ms of which 11 ms to minimize.
[2024-05-31 18:07:23] [INFO ] Deduced a trap composed of 44 places in 1273 ms of which 12 ms to minimize.
[2024-05-31 18:07:24] [INFO ] Deduced a trap composed of 50 places in 1188 ms of which 11 ms to minimize.
[2024-05-31 18:07:26] [INFO ] Deduced a trap composed of 43 places in 1258 ms of which 11 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1793 variables, 20/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 18:07:27] [INFO ] Deduced a trap composed of 43 places in 1188 ms of which 11 ms to minimize.
[2024-05-31 18:07:28] [INFO ] Deduced a trap composed of 43 places in 1196 ms of which 11 ms to minimize.
[2024-05-31 18:07:29] [INFO ] Deduced a trap composed of 43 places in 1191 ms of which 10 ms to minimize.
[2024-05-31 18:07:31] [INFO ] Deduced a trap composed of 44 places in 1200 ms of which 11 ms to minimize.
[2024-05-31 18:07:32] [INFO ] Deduced a trap composed of 44 places in 1254 ms of which 12 ms to minimize.
[2024-05-31 18:07:33] [INFO ] Deduced a trap composed of 43 places in 1202 ms of which 11 ms to minimize.
[2024-05-31 18:07:34] [INFO ] Deduced a trap composed of 43 places in 1180 ms of which 11 ms to minimize.
[2024-05-31 18:07:35] [INFO ] Deduced a trap composed of 43 places in 1176 ms of which 10 ms to minimize.
[2024-05-31 18:07:37] [INFO ] Deduced a trap composed of 50 places in 1208 ms of which 12 ms to minimize.
[2024-05-31 18:07:38] [INFO ] Deduced a trap composed of 44 places in 1258 ms of which 11 ms to minimize.
[2024-05-31 18:07:39] [INFO ] Deduced a trap composed of 44 places in 1275 ms of which 11 ms to minimize.
[2024-05-31 18:07:41] [INFO ] Deduced a trap composed of 44 places in 1223 ms of which 11 ms to minimize.
[2024-05-31 18:07:42] [INFO ] Deduced a trap composed of 43 places in 1127 ms of which 11 ms to minimize.
[2024-05-31 18:07:43] [INFO ] Deduced a trap composed of 45 places in 1187 ms of which 11 ms to minimize.
[2024-05-31 18:07:44] [INFO ] Deduced a trap composed of 44 places in 1120 ms of which 10 ms to minimize.
[2024-05-31 18:07:45] [INFO ] Deduced a trap composed of 46 places in 1155 ms of which 11 ms to minimize.
[2024-05-31 18:07:47] [INFO ] Deduced a trap composed of 43 places in 1223 ms of which 11 ms to minimize.
SMT process timed out in 77387ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 23 out of 1794 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1794/1794 places, 3403/3403 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 1794 transition count 3399
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 1790 transition count 3399
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 8 place count 1790 transition count 3396
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 14 place count 1787 transition count 3396
Discarding 37 places :
Symmetric choice reduction at 2 with 37 rule applications. Total rules 51 place count 1750 transition count 3322
Iterating global reduction 2 with 37 rules applied. Total rules applied 88 place count 1750 transition count 3322
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 104 place count 1742 transition count 3314
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 106 place count 1740 transition count 3310
Iterating global reduction 2 with 2 rules applied. Total rules applied 108 place count 1740 transition count 3310
Applied a total of 108 rules in 436 ms. Remains 1740 /1794 variables (removed 54) and now considering 3310/3403 (removed 93) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 436 ms. Remains : 1740/1794 places, 3310/3403 transitions.
RANDOM walk for 40000 steps (139 resets) in 686 ms. (58 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 73 ms. (540 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 737356 steps, run timeout after 3001 ms. (steps per millisecond=245 ) properties seen :0 out of 1
Probabilistic random walk after 737356 steps, saw 679530 distinct states, run finished after 3001 ms. (steps per millisecond=245 ) properties seen :0
// Phase 1: matrix 3310 rows 1740 cols
[2024-05-31 18:07:50] [INFO ] Computed 42 invariants in 52 ms
[2024-05-31 18:07:50] [INFO ] State equation strengthened by 3163 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1692/1715 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1715 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1715 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 24/1739 variables, 24/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1739 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 3310/5049 variables, 1739/1781 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/5049 variables, 3163/4944 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/5049 variables, 0/4944 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/5050 variables, 1/4945 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/5050 variables, 0/4945 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/5050 variables, 0/4945 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5050/5050 variables, and 4945 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1346 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 1740/1740 constraints, ReadFeed: 3163/3163 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/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1692/1715 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1715 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 18:07:53] [INFO ] Deduced a trap composed of 2 places in 806 ms of which 8 ms to minimize.
[2024-05-31 18:07:53] [INFO ] Deduced a trap composed of 2 places in 805 ms of which 9 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1715 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1715 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 24/1739 variables, 24/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 18:07:55] [INFO ] Deduced a trap composed of 2 places in 1259 ms of which 11 ms to minimize.
[2024-05-31 18:07:56] [INFO ] Deduced a trap composed of 43 places in 1299 ms of which 11 ms to minimize.
[2024-05-31 18:07:58] [INFO ] Deduced a trap composed of 43 places in 1269 ms of which 11 ms to minimize.
[2024-05-31 18:07:59] [INFO ] Deduced a trap composed of 43 places in 1241 ms of which 11 ms to minimize.
[2024-05-31 18:08:00] [INFO ] Deduced a trap composed of 43 places in 1281 ms of which 10 ms to minimize.
[2024-05-31 18:08:01] [INFO ] Deduced a trap composed of 43 places in 1250 ms of which 10 ms to minimize.
[2024-05-31 18:08:03] [INFO ] Deduced a trap composed of 43 places in 1203 ms of which 11 ms to minimize.
[2024-05-31 18:08:04] [INFO ] Deduced a trap composed of 43 places in 1254 ms of which 11 ms to minimize.
[2024-05-31 18:08:05] [INFO ] Deduced a trap composed of 43 places in 1231 ms of which 12 ms to minimize.
[2024-05-31 18:08:06] [INFO ] Deduced a trap composed of 43 places in 1251 ms of which 11 ms to minimize.
[2024-05-31 18:08:08] [INFO ] Deduced a trap composed of 50 places in 1286 ms of which 11 ms to minimize.
[2024-05-31 18:08:09] [INFO ] Deduced a trap composed of 43 places in 1248 ms of which 11 ms to minimize.
[2024-05-31 18:08:10] [INFO ] Deduced a trap composed of 43 places in 1263 ms of which 11 ms to minimize.
[2024-05-31 18:08:12] [INFO ] Deduced a trap composed of 43 places in 1263 ms of which 11 ms to minimize.
[2024-05-31 18:08:13] [INFO ] Deduced a trap composed of 43 places in 1227 ms of which 10 ms to minimize.
[2024-05-31 18:08:14] [INFO ] Deduced a trap composed of 43 places in 1217 ms of which 11 ms to minimize.
[2024-05-31 18:08:15] [INFO ] Deduced a trap composed of 43 places in 1226 ms of which 12 ms to minimize.
[2024-05-31 18:08:17] [INFO ] Deduced a trap composed of 43 places in 1213 ms of which 11 ms to minimize.
[2024-05-31 18:08:18] [INFO ] Deduced a trap composed of 48 places in 1234 ms of which 11 ms to minimize.
[2024-05-31 18:08:19] [INFO ] Deduced a trap composed of 43 places in 1209 ms of which 11 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1739 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 18:08:20] [INFO ] Deduced a trap composed of 43 places in 1147 ms of which 10 ms to minimize.
[2024-05-31 18:08:21] [INFO ] Deduced a trap composed of 46 places in 1197 ms of which 10 ms to minimize.
[2024-05-31 18:08:23] [INFO ] Deduced a trap composed of 43 places in 1165 ms of which 10 ms to minimize.
[2024-05-31 18:08:24] [INFO ] Deduced a trap composed of 43 places in 1221 ms of which 10 ms to minimize.
[2024-05-31 18:08:25] [INFO ] Deduced a trap composed of 54 places in 1299 ms of which 11 ms to minimize.
[2024-05-31 18:08:27] [INFO ] Deduced a trap composed of 44 places in 1244 ms of which 11 ms to minimize.
[2024-05-31 18:08:28] [INFO ] Deduced a trap composed of 43 places in 1267 ms of which 15 ms to minimize.
[2024-05-31 18:08:29] [INFO ] Deduced a trap composed of 49 places in 1243 ms of which 10 ms to minimize.
[2024-05-31 18:08:30] [INFO ] Deduced a trap composed of 46 places in 1248 ms of which 10 ms to minimize.
[2024-05-31 18:08:32] [INFO ] Deduced a trap composed of 43 places in 1218 ms of which 10 ms to minimize.
[2024-05-31 18:08:33] [INFO ] Deduced a trap composed of 43 places in 1247 ms of which 11 ms to minimize.
[2024-05-31 18:08:34] [INFO ] Deduced a trap composed of 53 places in 1190 ms of which 10 ms to minimize.
[2024-05-31 18:08:35] [INFO ] Deduced a trap composed of 50 places in 1243 ms of which 11 ms to minimize.
[2024-05-31 18:08:37] [INFO ] Deduced a trap composed of 50 places in 1269 ms of which 12 ms to minimize.
[2024-05-31 18:08:38] [INFO ] Deduced a trap composed of 43 places in 1265 ms of which 11 ms to minimize.
[2024-05-31 18:08:39] [INFO ] Deduced a trap composed of 43 places in 1202 ms of which 11 ms to minimize.
[2024-05-31 18:08:40] [INFO ] Deduced a trap composed of 46 places in 1222 ms of which 11 ms to minimize.
[2024-05-31 18:08:42] [INFO ] Deduced a trap composed of 43 places in 1203 ms of which 11 ms to minimize.
[2024-05-31 18:08:43] [INFO ] Deduced a trap composed of 50 places in 1191 ms of which 10 ms to minimize.
[2024-05-31 18:08:44] [INFO ] Deduced a trap composed of 43 places in 1176 ms of which 11 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1739 variables, 20/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 18:08:45] [INFO ] Deduced a trap composed of 47 places in 1276 ms of which 11 ms to minimize.
[2024-05-31 18:08:47] [INFO ] Deduced a trap composed of 43 places in 1225 ms of which 10 ms to minimize.
[2024-05-31 18:08:48] [INFO ] Deduced a trap composed of 43 places in 1274 ms of which 11 ms to minimize.
[2024-05-31 18:08:49] [INFO ] Deduced a trap composed of 43 places in 1253 ms of which 22 ms to minimize.
[2024-05-31 18:08:51] [INFO ] Deduced a trap composed of 43 places in 1248 ms of which 10 ms to minimize.
[2024-05-31 18:08:52] [INFO ] Deduced a trap composed of 43 places in 1245 ms of which 11 ms to minimize.
[2024-05-31 18:08:53] [INFO ] Deduced a trap composed of 43 places in 1252 ms of which 11 ms to minimize.
[2024-05-31 18:08:54] [INFO ] Deduced a trap composed of 43 places in 1230 ms of which 11 ms to minimize.
[2024-05-31 18:08:56] [INFO ] Deduced a trap composed of 43 places in 1133 ms of which 11 ms to minimize.
[2024-05-31 18:08:57] [INFO ] Deduced a trap composed of 49 places in 1220 ms of which 10 ms to minimize.
[2024-05-31 18:08:58] [INFO ] Deduced a trap composed of 43 places in 1196 ms of which 11 ms to minimize.
[2024-05-31 18:08:59] [INFO ] Deduced a trap composed of 43 places in 1216 ms of which 11 ms to minimize.
[2024-05-31 18:09:00] [INFO ] Deduced a trap composed of 46 places in 1145 ms of which 11 ms to minimize.
[2024-05-31 18:09:02] [INFO ] Deduced a trap composed of 48 places in 1225 ms of which 11 ms to minimize.
[2024-05-31 18:09:03] [INFO ] Deduced a trap composed of 46 places in 1164 ms of which 10 ms to minimize.
[2024-05-31 18:09:04] [INFO ] Deduced a trap composed of 43 places in 1168 ms of which 10 ms to minimize.
[2024-05-31 18:09:05] [INFO ] Deduced a trap composed of 43 places in 1167 ms of which 11 ms to minimize.
[2024-05-31 18:09:06] [INFO ] Deduced a trap composed of 43 places in 1103 ms of which 10 ms to minimize.
[2024-05-31 18:09:08] [INFO ] Deduced a trap composed of 43 places in 1121 ms of which 11 ms to minimize.
[2024-05-31 18:09:09] [INFO ] Deduced a trap composed of 43 places in 1195 ms of which 10 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1739 variables, 20/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 18:09:10] [INFO ] Deduced a trap composed of 43 places in 1185 ms of which 10 ms to minimize.
[2024-05-31 18:09:11] [INFO ] Deduced a trap composed of 47 places in 1099 ms of which 11 ms to minimize.
[2024-05-31 18:09:12] [INFO ] Deduced a trap composed of 44 places in 1166 ms of which 11 ms to minimize.
[2024-05-31 18:09:13] [INFO ] Deduced a trap composed of 50 places in 1088 ms of which 11 ms to minimize.
[2024-05-31 18:09:15] [INFO ] Deduced a trap composed of 47 places in 1089 ms of which 10 ms to minimize.
[2024-05-31 18:09:16] [INFO ] Deduced a trap composed of 47 places in 1075 ms of which 10 ms to minimize.
[2024-05-31 18:09:17] [INFO ] Deduced a trap composed of 50 places in 1141 ms of which 11 ms to minimize.
[2024-05-31 18:09:18] [INFO ] Deduced a trap composed of 48 places in 1055 ms of which 10 ms to minimize.
[2024-05-31 18:09:19] [INFO ] Deduced a trap composed of 50 places in 1134 ms of which 11 ms to minimize.
[2024-05-31 18:09:20] [INFO ] Deduced a trap composed of 43 places in 1113 ms of which 11 ms to minimize.
[2024-05-31 18:09:21] [INFO ] Deduced a trap composed of 43 places in 1050 ms of which 9 ms to minimize.
[2024-05-31 18:09:22] [INFO ] Deduced a trap composed of 45 places in 1060 ms of which 10 ms to minimize.
SMT process timed out in 92129ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 23 out of 1740 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1740/1740 places, 3310/3310 transitions.
Applied a total of 0 rules in 227 ms. Remains 1740 /1740 variables (removed 0) and now considering 3310/3310 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 227 ms. Remains : 1740/1740 places, 3310/3310 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1740/1740 places, 3310/3310 transitions.
Applied a total of 0 rules in 227 ms. Remains 1740 /1740 variables (removed 0) and now considering 3310/3310 (removed 0) transitions.
[2024-05-31 18:09:23] [INFO ] Invariant cache hit.
[2024-05-31 18:09:24] [INFO ] Implicit Places using invariants in 989 ms returned []
[2024-05-31 18:09:24] [INFO ] Invariant cache hit.
[2024-05-31 18:09:25] [INFO ] State equation strengthened by 3163 read => feed constraints.
[2024-05-31 18:09:46] [INFO ] Implicit Places using invariants and state equation in 22031 ms returned []
Implicit Place search using SMT with State Equation took 23023 ms to find 0 implicit places.
[2024-05-31 18:09:46] [INFO ] Redundant transitions in 172 ms returned []
Running 3270 sub problems to find dead transitions.
[2024-05-31 18:09:46] [INFO ] Invariant cache hit.
[2024-05-31 18:09:46] [INFO ] State equation strengthened by 3163 read => feed constraints.
(s1483 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 2.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 1.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 1.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 1.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 1.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 1.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 1.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 1.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 1.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 1.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 1.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 1.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 1.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 0.0)
(s534 0.0)
(s535 0.0)
(s536 1.0)
(s537 0.0)
(s538 0.0)
(s539 0.0)
(s540 0.0)
(s541 0.0)
(s542 0.0)
(s543 0.0)
(s544 0.0)
(s545 0.0)
(s546 0.0)
(s547 0.0)
(s548 0.0)
(s549 0.0)
(s550 0.0)
(s551 0.0)
(s552 0.0)
(s553 0.0)
(s554 0.0)
(s555 0.0)
(s556 0.0)
(s557 0.0)
(s558 0.0)
(s559 0.0)
(s560 0.0)
(s561 0.0)
(s562 0.0)
(s563 0.0)
(s564 0.0)
(s565 0.0)
(s566 0.0)
(s567 0.0)
(s568 0.0)
(s569 0.0)
(s570 0.0)
(s571 0.0)
(s572 0.0)
(s573 0.0)
(s574 0.0)
(s575 1.0)
(s576 0.0)
(s577 0.0)
(s578 0.0)
(s579 0.0)
(s580 0.0)
(s581 0.0)
(s582 0.0)
(s583 0.0)
(s584 0.0)
(s585 0.0)
(s586 0.0)
(s587 0.0)
(s588 0.0)
(s589 0.0)
(s590 0.0)
(s591 0.0)
(s592 0.0)
(s593 0.0)
(s594 0.0)
(s595 0.0)
(s596 0.0)
(s597 0.0)
(s598 0.0)
(s599 0.0)
(s600 0.0)
(s601 0.0)
(s602 0.0)
(s603 0.0)
(s604 0.0)
(s605 0.0)
(s606 0.0)
(s607 0.0)
(s608 0.0)
(s609 0.0)
(s610 0.0)
(s611 0.0)
(s612 0.0)
(s613 0.0)
(s614 0.0)
(s615 1.0)
(s616 0.0)
(s617 0.0)
(s618 0.0)
(s619 0.0)
(s620 0.0)
(s621 0.0)
(s622 0.0)
(s623 0.0)
(s624 0.0)
(s625 0.0)
(s626 0.0)
(s627 0.0)
(s628 0.0)
(s629 0.0)
(s630 0.0)
(s631 0.0)
(s632 0.0)
(s633 0.0)
(s634 0.0)
(s635 0.0)
(s636 0.0)
(s637 0.0)
(s638 0.0)
(s639 0.0)
(s640 0.0)
(s641 0.0)
(s642 0.0)
(s643 0.0)
(s644 0.0)
(s645 0.0)
(s646 0.0)
(s647 0.0)
(s648 0.0)
(s649 0.0)
(s650 0.0)
(s651 0.0)
(s652 0.0)
(s653 0.0)
(s654 1.0)
(s655 0.0)
(s656 0.0)
(s657 0.0)
(s658 0.0)
(s659 0.0)
(s660 0.0)
(s661 0.0)
(s662 0.0)
(s663 0.0)
(s664 0.0)
(s665 0.0)
(s666 0.0)
(s667 0.0)
(s668 0.0)
(s669 0.0)
(s670 0.0)
(s671 0.0)
(s672 0.0)
(s673 0.0)
(s674 0.0)
(s675 0.0)
(s676 0.0)
(s677 0.0)
(s678 0.0)
(s679 0.0)
(s680 0.0)
(s681 0.0)
(s682 0.0)
(s683 0.0)
(s684 0.0)
(s685 0.0)
(s686 0.0)
(s687 0.0)
(s688 0.0)
(s689 0.0)
(s690 0.0)
(s691 0.0)
(s692 0.0)
(s693 1.0)
(s694 0.0)
(s695 0.0)
(s696 0.0)
(s697 0.0)
(s698 0.0)
(s699 0.0)
(s700 0.0)
(s701 0.0)
(s702 0.0)
(s703 0.0)
(s704 0.0)
(s705 0.0)
(s706 0.0)
(s707 0.0)
(s708 0.0)
(s709 0.0)
(s710 0.0)
(s711 0.0)
(s712 0.0)
(s713 0.0)
(s714 0.0)
(s715 0.0)
(s716 0.0)
(s717 0.0)
(s718 0.0)
(s719 0.0)
(s720 0.0)
(s721 0.0)
(s722 0.0)
(s723 0.0)
(s724 0.0)
(s725 0.0)
(s726 0.0)
(s727 0.0)
(s728 0.0)
(s729 0.0)
(s730 0.0)
(s731 0.0)
(s732 0.0)
(s733 0.0)
(s734 0.0)
(s735 0.0)
(s736 0.0)
(s737 0.0)
(s738 0.0)
(s739 0.0)
(s740 0.0)
(s741 0.0)
(s742 0.0)
(s743 0.0)
(s744 0.0)
(s745 0.0)
(s746 0.0)
(s747 0.0)
(s748 0.0)
(s749 0.0)
(s750 0.0)
(s751 0.0)
(s752 0.0)
(s753 0.0)
(s754 0.0)
(s755 0.0)
(s756 0.0)
(s757 0.0)
(s758 0.0)
(s759 0.0)
(s760 0.0)
(s761 0.0)
(s762 0.0)
(s763 0.0)
(s764 0.0)
(s765 0.0)
(s766 0.0)
(s767 0.0)
(s768 0.0)
(s769 0.0)
(s770 0.0)
(s771 0.0)
(s772 0.0)
(s773 0.0)
(s774 0.0)
(s775 0.0)
(s776 0.0)
(s777 0.0)
(s778 0.0)
(s779 0.0)
(s780 0.0)
(s781 0.0)
(s782 0.0)
(s783 0.0)
(s784 0.0)
(s785 0.0)
(s786 0.0)
(s787 0.0)
(s788 0.0)
(s789 0.0)
(s790 0.0)
(s791 0.0)
(s792 0.0)
(s793 0.0)
(s794 0.0)
(s795 0.0)
(s796 0.0)
(s797 0.0)
(s798 0.0)
(s799 0.0)
(s800 0.0)
(s801 0.0)
(s802 0.0)
(s803 0.0)
(s804 0.0)
(s805 0.0)
(s806 0.0)
(s807 0.0)
(s808 0.0)
(s809 0.0)
(s810 0.0)
(s811 1.0)
(s812 0.0)
(s813 0.0)
(s814 0.0)
(s815 0.0)
(s816 0.0)
(s817 0.0)
(s818 0.0)
(s819 0.0)
(s820 0.0)
(s821 0.0)
(s822 0.0)
(s823 0.0)
(s824 0.0)
(s825 0.0)
(s826 0.0)
(s827 0.0)
(s828 0.0)
(s829 0.0)
(s830 0.0)
(s831 0.0)
(s832 0.0)
(s833 0.0)
(s834 0.0)
(s835 0.0)
(s836 0.0)
(s837 0.0)
(s838 0.0)
(s839 0.0)
(s840 0.0)
(s841 0.0)
(s842 0.0)
(s843 0.0)
(s844 0.0)
(s845 0.0)
(s846 0.0)
(s847 0.0)
(s848 0.0)
(s849 0.0)
(s850 0.0)
(s851 1.0)
(s852 0.0)
(s853 0.0)
(s854 0.0)
(s855 0.0)
(s856 0.0)
(s857 0.0)
(s858 0.0)
(s859 0.0)
(s860 0.0)
(s861 0.0)
(s862 0.0)
(s863 0.0)
(s864 0.0)
(s865 0.0)
(s866 0.0)
(s867 0.0)
(s868 0.0)
(s869 0.0)
(s870 0.0)
(s871 0.0)
(s872 0.0)
(s873 0.0)
(s874 0.0)
(s875 0.0)
(s876 0.0)
(s877 0.0)
(s878 0.0)
(s879 0.0)
(s880 0.0)
(s881 0.0)
(s882 0.0)
(s883 0.0)
(s884 0.0)
(s885 0.0)
(s886 0.0)
(s887 0.0)
(s888 0.0)
(s889 0.0)
(s890 1.0)
(s891 0.0)
(s892 0.0)
(s893 0.0)
(s894 0.0)
(s895 0.0)
(s896 0.0)
(s897 0.0)
(s898 0.0)
(s899 0.0)
(s900 0.0)
(s901 0.0)
(s902 0.0)
(s903 0.0)
(s904 0.0)
(s905 0.0)
(s906 0.0)
(s907 0.0)
(s908 0.0)
(s909 0.0)
(s910 0.0)
(s911 0.0)
(s912 0.0)
(s913 0.0)
(s914 0.0)
(s915 0.0)
(s916 0.0)
(s917 0.0)
(s918 0.0)
(s919 0.0)
(s920 0.0)
(s921 0.0)
(s922 0.0)
(s923 0.0)
(s924 0.0)
(s925 0.0)
(s926 0.0)
(s927 0.0)
(s928 0.0)
(s929 0.0)
(s930 1.0)
(s931 0.0)
(s932 0.0)
(s933 0.0)
(s934 0.0)
(s935 0.0)
(s936 0.0)
(s937 0.0)
(s938 0.0)
(s939 0.0)
(s940 0.0)
(s941 0.0)
(s942 0.0)
(s943 0.0)
(s944 0.0)
(s945 0.0)
(s946 0.0)
(s947 0.0)
(s948 0.0)
(s949 0.0)
(s950 0.0)
(s951 0.0)
(s952 0.0)
(s953 0.0)
(s954 0.0)
(s955 0.0)
(s956 0.0)
(s957 0.0)
(s958 0.0)
(s959 0.0)
(s960 0.0)
(s961 0.0)
(s962 0.0)
(s963 0.0)
(s964 0.0)
(s965 0.0)
(s966 0.0)
(s967 0.0)
(s968 0.0)
(s969 1.0)
(s970 0.0)
(s971 0.0)
(s972 0.0)
(s973 0.0)
(s974 0.0)
(s975 0.0)
(s976 0.0)
(s977 0.0)
(s978 0.0)
(s979 0.0)
(s980 0.0)
(s981 0.0)
(s982 0.0)
(s983 0.0)
(s984 0.0)
(s985 0.0)
(s986 0.0)
(s987 0.0)
(s988 0.0)
(s989 0.0)
(s990 0.0)
(s991 0.0)
(s992 0.0)
(s993 0.0)
(s994 0.0)
(s995 0.0)
(s996 0.0)
(s997 0.0)
(s998 0.0)
(s999 0.0)
(s1000 0.0)
(s1001 0.0)
(s1002 0.0)
(s1003 0.0)
(s1004 0.0)
(s1005 0.0)
(s1006 0.0)
(s1007 0.0)
(s1008 1.0)
(s1009 0.0)
(s1010 0.0)
(s1011 0.0)
(s1012 0.0)
(s1013 0.0)
(s1014 0.0)
(s1015 0.0)
(s1016 0.0)
(s1017 0.0)
(s1018 0.0)
(s1019 0.0)
(s1020 0.0)
(s1021 0.0)
(s1022 0.0)
(s1023 0.0)
(s1024 0.0)
(s1025 0.0)
(s1026 0.0)
(s1027 0.0)
(s1028 0.0)
(s1029 0.0)
(s1030 0.0)
(s1031 0.0)
(s1032 0.0)
(s1033 0.0)
(s1034 0.0)
(s1035 0.0)
(s1036 0.0)
(s1037 0.0)
(s1038 0.0)
(s1039 0.0)
(s1040 0.0)
(s1041 0.0)
(s1042 0.0)
(s1043 0.0)
(s1044 0.0)
(s1045 0.0)
(s1046 0.0)
(s1047 1.0)
(s1048 0.0)
(s1049 0.0)
(s1050 0.0)
(s1051 0.0)
(s1052 0.0)
(s1053 0.0)
(s1054 0.0)
(s1055 0.0)
(s1056 0.0)
(s1057 0.0)
(s1058 0.0)
(s1059 0.0)
(s1060 0.0)
(s1061 0.0)
(s1062 0.0)
(s1063 0.0)
(s1064 0.0)
(s1065 0.0)
(s1066 0.0)
(s1067 0.0)
(s1068 0.0)
(s1069 0.0)
(s1070 0.0)
(s1071 0.0)
(s1072 0.0)
(s1073 0.0)
(s1074 0.0)
(s1075 0.0)
(s1076 0.0)
(s1077 0.0)
(s1078 0.0)
(s1079 0.0)
(s1080 0.0)
(s1081 0.0)
(s1082 0.0)
(s1083 0.0)
(s1084 0.0)
(s1085 0.0)
(s1086 1.0)
(s1087 0.0)
(s1088 0.0)
(s1089 0.0)
(s1090 0.0)
(s1091 0.0)
(s1092 0.0)
(s1093 0.0)
(s1094 0.0)
(s1095 0.0)
(s1096 0.0)
(s1097 0.0)
(s1098 0.0)
(s1099 0.0)
(s1100 0.0)
(s1101 0.0)
(s1102 0.0)
(s1103 0.0)
(s1104 0.0)
(s1105 0.0)
(s1106 0.0)
(s1107 0.0)
(s1108 0.0)
(s1109 0.0)
(s1110 0.0)
(s1111 0.0)
(s1112 0.0)
(s1113 0.0)
(s1114 0.0)
(s1115 0.0)
(s1116 0.0)
(s1117 0.0)
(s1118 0.0)
(s1119 0.0)
(s1120 0.0)
(s1121 0.0)
(s1122 0.0)
(s1123 0.0)
(s1124 0.0)
(s1125 1.0)
(s1126 0.0)
(s1127 0.0)
(s1128 0.0)
(s1129 0.0)
(s1130 0.0)
(s1131 0.0)
(s1132 0.0)
(s1133 0.0)
(s1134 0.0)
(s1135 0.0)
(s1136 0.0)
(s1137 0.0)
(s1138 0.0)
(s1139 0.0)
(s1140 0.0)
(s1141 0.0)
(s1142 0.0)
(s1143 0.0)
(s1144 0.0)
(s1145 0.0)
(s1146 0.0)
(s1147 0.0)
(s1148 0.0)
(s1149 0.0)
(s1150 0.0)
(s1151 0.0)
(s1152 0.0)
(s1153 0.0)
(s1154 0.0)
(s1155 0.0)
(s1156 0.0)
(s1157 0.0)
(s1158 0.0)
(s1159 0.0)
(s1160 0.0)
(s1161 0.0)
(s1162 0.0)
(s1163 0.0)
(s1164 1.0)
(s1165 0.0)
(s1166 0.0)
(s1167 0.0)
(s1168 0.0)
(s1169 0.0)
(s1170 0.0)
(s1171 0.0)
(s1172 0.0)
(s1173 0.0)
(s1174 0.0)
(s1175 0.0)
(s1176 0.0)
(s1177 0.0)
(s1178 0.0)
(s1179 0.0)
(s1180 0.0)
(s1181 0.0)
(s1182 0.0)
(s1183 0.0)
(s1184 0.0)
(s1185 0.0)
(s1186 0.0)
(s1187 0.0)
(s1188 0.0)
(s1189 0.0)
(s1190 0.0)
(s1191 0.0)
(s1192 0.0)
(s1193 0.0)
(s1194 0.0)
(s1195 0.0)
(s1196 0.0)
(s1197 0.0)
(s1198 0.0)
(s1199 0.0)
(s1200 0.0)
(s1201 0.0)
(s1202 0.0)
(s1203 1.0)
(s1204 0.0)
(s1205 0.0)
(s1206 0.0)
(s1207 0.0)
(s1208 0.0)
(s1209 0.0)
(s1210 0.0)
(s1211 0.0)
(s1212 0.0)
(s1213 0.0)
(s1214 0.0)
(s1215 0.0)
(s1216 0.0)
(s1217 0.0)
(s1218 0.0)
(s1219 0.0)
(s1220 0.0)
(s1221 0.0)
(s1222 0.0)
(s1223 0.0)
(s1224 0.0)
(s1225 0.0)
(s1226 0.0)
(s1227 0.0)
(s1228 0.0)
(s1229 0.0)
(s1230 0.0)
(s1231 0.0)
(s1232 0.0)
(s1233 0.0)
(s1234 0.0)
(s1235 0.0)
(s1236 0.0)
(s1237 0.0)
(s1238 0.0)
(s1239 0.0)
(s1240 0.0)
(s1241 0.0)
(s1242 1.0)
(s1243 0.0)
(s1244 0.0)
(s1245 0.0)
(s1246 0.0)
(s1247 0.0)
(s1248 0.0)
(s1249 0.0)
(s1250 0.0)
(s1251 0.0)
(s1252 0.0)
(s1253 0.0)
(s1254 0.0)
(s1255 0.0)
(s1256 0.0)
(s1257 0.0)
(s1258 0.0)
(s1259 0.0)
(s1260 0.0)
(s1261 0.0)
(s1262 0.0)
(s1263 0.0)
(s1264 0.0)
(s1265 0.0)
(s1266 0.0)
(s1267 0.0)
(s1268 0.0)
(s1269 0.0)
(s1270 0.0)
(s1271 0.0)
(s1272 0.0)
(s1273 0.0)
(s1274 0.0)
(s1275 0.0)
(s1276 0.0)
(s1277 0.0)
(s1278 0.0)
(s1279 0.0)
(s1280 0.0)
(s1281 1.0)
(s1282 0.0)
(s1283 0.0)
(s1284 0.0)
(s1285 0.0)
(s1286 0.0)
(s1287 0.0)
(s1288 0.0)
(s1289 0.0)
(s1290 0.0)
(s1291 0.0)
(s1292 0.0)
(s1293 0.0)
(s1294 0.0)
(s1295 0.0)
(s1296 0.0)
(s1297 0.0)
(s1298 0.0)
(s1299 0.0)
(s1300 0.0)
(s1301 0.0)
(s1302 0.0)
(s1303 0.0)
(s1304 0.0)
(s1305 0.0)
(s1306 0.0)
(s1307 0.0)
(s1308 0.0)
(s1309 0.0)
(s1310 0.0)
(s1311 0.0)
(s1312 0.0)
(s1313 0.0)
(s1314 0.0)
(s1315 0.0)
(s1316 0.0)
(s1317 0.0)
(s1318 0.0)
(s1319 0.0)
(s1320 0.0)
(s1321 1.0)
(s1322 0.0)
(s1323 0.0)
(s1324 0.0)
(s1325 0.0)
(s1326 0.0)
(s1327 0.0)
(s1328 0.0)
(s1329 0.0)
(s1330 0.0)
(s1331 0.0)
(s1332 0.0)
(s1333 0.0)
(s1334 0.0)
(s1335 0.0)
(s1336 0.0)
(s1337 0.0)
(s1338 0.0)
(s1339 0.0)
(s1340 0.0)
(s1341 0.0)
(s1342 0.0)
(s1343 0.0)
(s1344 0.0)
(s1345 0.0)
(s1346 0.0)
(s1347 0.0)
(s1348 0.0)
(s1349 0.0)
(s1350 0.0)
(s1351 0.0)
(s1352 0.0)
(s1353 0.0)
(s1354 0.0)
(s1355 0.0)
(s1356 0.0)
(s1357 0.0)
(s1358 0.0)
(s1359 0.0)
(s1360 0.0)
(s1361 1.0)
(s1362 0.0)
(s1363 0.0)
(s1364 0.0)
(s1365 0.0)
(s1366 0.0)
(s1367 0.0)
(s1368 0.0)
(s1369 0.0)
(s1370 0.0)
(s1371 0.0)
(s1372 0.0)
(s1373 0.0)
(s1374 0.0)
(s1375 0.0)
(s1376 0.0)
(s1377 0.0)
(s1378 0.0)
(s1379 0.0)
(s1380 0.0)
(s1381 0.0)
(s1382 0.0)
(s1383 0.0)
(s1384 0.0)
(s1385 0.0)
(s1386 0.0)
(s1387 0.0)
(s1388 0.0)
(s1389 0.0)
(s1390 0.0)
(s1391 0.0)
(s1392 0.0)
(s1393 0.0)
(s1394 0.0)
(s1395 0.0)
(s1396 0.0)
(s1397 0.0)
(s1398 0.0)
(s1399 0.0)
(s1400 1.0)
(s1401 0.0)
(s1402 0.0)
(s1403 0.0)
(s1404 0.0)
(s1405 0.0)
(s1406 0.0)
(s1407 0.0)
(s1408 0.0)
(s1409 0.0)
(s1410 0.0)
(s1411 0.0)
(s1412 0.0)
(s1413 0.0)
(s1414 0.0)
(s1415 0.0)
(s1416 0.0)
(s1417 0.0)
(s1418 0.0)
(s1419 0.0)
(s1420 0.0)
(s1421 0.0)
(s1422 0.0)
(s1423 0.0)
(s1424 0.0)
(s1425 0.0)
(s1426 0.0)
(s1427 0.0)
(s1428 0.0)
(s1429 0.0)
(s1430 0.0)
(s1431 0.0)
(s1432 0.0)
(s1433 0.0)
(s1434 0.0)
(s1435 0.0)
(s1436 0.0)
(s1437 0.0)
(s1438 0.0)
(s1439 0.0)
(s1440 1.0)
(s1441 0.0)
(s1442 0.0)
(s1443 0.0)
(s1444 0.0)
(s1445 0.0)
(s1446 0.0)
(s1447 0.0)
(s1448 0.0)
(s1449 0.0)
(s1450 0.0)
(s1451 0.0)
(s1452 0.0)
(s1453 0.0)
(s1454 0.0)
(s1455 0.0)
(s1456 0.0)
(s1457 0.0)
(s1458 0.0)
(s1459 0.0)
(s1460 0.0)
(s1461 0.0)
(s1462 0.0)
(s1463 0.0)
(s1464 0.0)
(s1465 0.0)
(s1466 0.0)
(s1467 0.0)
(s1468 0.0)
(s1469 0.0)
(s1470 0.0)
(s1471 0.0)
(s1472 0.0)
(s1473 0.0)
(s1474 0.0)
(s1475 0.0)
(s1476 0.0)
(s1477 0.0)
(s1478 0.0)
(s1479 0.0)
(s1480 1.0)
(s1481 0.0)
(s1482 0.0)
(s1483 0.0timeout
) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1739 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 3270 unsolved
SMT process timed out in 32438ms, After SMT, problems are : Problem set: 0 solved, 3270 unsolved
Search for dead transitions found 0 dead transitions in 32474ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55931 ms. Remains : 1740/1740 places, 3310/3310 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 3169 edges and 1740 vertex of which 1501 / 1740 are part of one of the 37 SCC in 4 ms
Free SCC test removed 1464 places
Drop transitions (Empty/Sink Transition effects.) removed 2891 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2893 transitions.
Graph (complete) has 553 edges and 276 vertex of which 186 are kept as prefixes of interest. Removing 90 places using SCC suffix rule.0 ms
Discarding 90 places :
Also discarding 49 output transitions
Drop transitions (Output transitions of discarded places.) removed 49 transitions
Drop transitions (Empty/Sink Transition effects.) removed 55 transitions
Reduce isomorphic transitions removed 55 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 114 transitions
Trivial Post-agglo rules discarded 114 transitions
Performed 114 trivial Post agglomeration. Transition count delta: 114
Iterating post reduction 0 with 169 rules applied. Total rules applied 171 place count 186 transition count 199
Ensure Unique test removed 1 places
Reduce places removed 115 places and 0 transitions.
Ensure Unique test removed 110 transitions
Reduce isomorphic transitions removed 110 transitions.
Iterating post reduction 1 with 225 rules applied. Total rules applied 396 place count 71 transition count 89
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 396 place count 71 transition count 83
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 408 place count 65 transition count 83
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 409 place count 64 transition count 82
Iterating global reduction 2 with 1 rules applied. Total rules applied 410 place count 64 transition count 82
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 411 place count 64 transition count 81
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 413 place count 63 transition count 80
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 415 place count 63 transition count 78
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 418 place count 63 transition count 75
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 421 place count 60 transition count 75
Partial Free-agglomeration rule applied 11 times.
Drop transitions (Partial Free agglomeration) removed 11 transitions
Iterating global reduction 4 with 11 rules applied. Total rules applied 432 place count 60 transition count 75
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 443 place count 49 transition count 64
Iterating global reduction 4 with 11 rules applied. Total rules applied 454 place count 49 transition count 64
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 458 place count 45 transition count 60
Applied a total of 458 rules in 30 ms. Remains 45 /1740 variables (removed 1695) and now considering 60/3310 (removed 3250) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 60 rows 45 cols
[2024-05-31 18:10:19] [INFO ] Computed 6 invariants in 5 ms
[2024-05-31 18:10:19] [INFO ] After 27ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 18:10:19] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-31 18:10:19] [INFO ] [Nat]Absence check using 5 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 18:10:19] [INFO ] After 21ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-31 18:10:19] [INFO ] After 32ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-31 18:10:19] [INFO ] After 74ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 165 ms.
[2024-05-31 18:10:19] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 9 ms.
[2024-05-31 18:10:19] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1740 places, 3310 transitions and 13084 arcs took 19 ms.
[2024-05-31 18:10:19] [INFO ] Flatten gal took : 224 ms
Total runtime 318259 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : CANConstruction-PT-040-ReachabilityCardinality-2024-13

BK_STOP 1717179019856

--------------------
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:
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
mcc2024
rfs formula name CANConstruction-PT-040-ReachabilityCardinality-2024-13
rfs formula type AG
rfs formula formula --invariant=/tmp/1189/inv_0_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CANConstruction-PT-040"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is CANConstruction-PT-040, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r476-tall-171620505000038"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CANConstruction-PT-040.tgz
mv CANConstruction-PT-040 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;