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.r472-tajo-171620399900603.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 BusinessProcesses-PT-20, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r472-tajo-171620399900603
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 628K
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 36K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 15:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 17:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Apr 11 16:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K Apr 11 16:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Apr 11 16:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K Apr 11 16:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K 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 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 192K 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 BusinessProcesses-PT-20-LTLCardinality-00
FORMULA_NAME BusinessProcesses-PT-20-LTLCardinality-01
FORMULA_NAME BusinessProcesses-PT-20-LTLCardinality-02
FORMULA_NAME BusinessProcesses-PT-20-LTLCardinality-03
FORMULA_NAME BusinessProcesses-PT-20-LTLCardinality-04
FORMULA_NAME BusinessProcesses-PT-20-LTLCardinality-05
FORMULA_NAME BusinessProcesses-PT-20-LTLCardinality-06
FORMULA_NAME BusinessProcesses-PT-20-LTLCardinality-07
FORMULA_NAME BusinessProcesses-PT-20-LTLCardinality-08
FORMULA_NAME BusinessProcesses-PT-20-LTLCardinality-09
FORMULA_NAME BusinessProcesses-PT-20-LTLCardinality-10
FORMULA_NAME BusinessProcesses-PT-20-LTLCardinality-11
FORMULA_NAME BusinessProcesses-PT-20-LTLCardinality-12
FORMULA_NAME BusinessProcesses-PT-20-LTLCardinality-13
FORMULA_NAME BusinessProcesses-PT-20-LTLCardinality-14
FORMULA_NAME BusinessProcesses-PT-20-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717226169891

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-20
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 07:16:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 07:16:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 07:16:11] [INFO ] Load time of PNML (sax parser for PT used): 96 ms
[2024-06-01 07:16:11] [INFO ] Transformed 782 places.
[2024-06-01 07:16:11] [INFO ] Transformed 697 transitions.
[2024-06-01 07:16:11] [INFO ] Found NUPN structural information;
[2024-06-01 07:16:11] [INFO ] Parsed PT model containing 782 places and 697 transitions and 2011 arcs in 230 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Deduced a syphon composed of 63 places in 14 ms
Reduce places removed 63 places and 59 transitions.
FORMULA BusinessProcesses-PT-20-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-20-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-20-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-20-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-20-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-20-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-20-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-20-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-20-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-20-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 18 out of 719 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 719/719 places, 638/638 transitions.
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 705 transition count 638
Discarding 104 places :
Symmetric choice reduction at 1 with 104 rule applications. Total rules 118 place count 601 transition count 534
Iterating global reduction 1 with 104 rules applied. Total rules applied 222 place count 601 transition count 534
Discarding 54 places :
Symmetric choice reduction at 1 with 54 rule applications. Total rules 276 place count 547 transition count 480
Iterating global reduction 1 with 54 rules applied. Total rules applied 330 place count 547 transition count 480
Applied a total of 330 rules in 142 ms. Remains 547 /719 variables (removed 172) and now considering 480/638 (removed 158) transitions.
// Phase 1: matrix 480 rows 547 cols
[2024-06-01 07:16:11] [INFO ] Computed 107 invariants in 43 ms
[2024-06-01 07:16:12] [INFO ] Implicit Places using invariants in 613 ms returned []
[2024-06-01 07:16:12] [INFO ] Invariant cache hit.
[2024-06-01 07:16:12] [INFO ] Implicit Places using invariants and state equation in 599 ms returned []
Implicit Place search using SMT with State Equation took 1246 ms to find 0 implicit places.
Running 479 sub problems to find dead transitions.
[2024-06-01 07:16:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/546 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/546 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 2 (OVERLAPS) 1/547 variables, 65/106 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/547 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-06-01 07:16:24] [INFO ] Deduced a trap composed of 74 places in 148 ms of which 24 ms to minimize.
[2024-06-01 07:16:24] [INFO ] Deduced a trap composed of 73 places in 134 ms of which 4 ms to minimize.
[2024-06-01 07:16:24] [INFO ] Deduced a trap composed of 94 places in 107 ms of which 3 ms to minimize.
[2024-06-01 07:16:25] [INFO ] Deduced a trap composed of 96 places in 104 ms of which 3 ms to minimize.
[2024-06-01 07:16:25] [INFO ] Deduced a trap composed of 75 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:16:25] [INFO ] Deduced a trap composed of 72 places in 104 ms of which 3 ms to minimize.
[2024-06-01 07:16:25] [INFO ] Deduced a trap composed of 92 places in 150 ms of which 2 ms to minimize.
[2024-06-01 07:16:25] [INFO ] Deduced a trap composed of 72 places in 130 ms of which 2 ms to minimize.
[2024-06-01 07:16:25] [INFO ] Deduced a trap composed of 89 places in 105 ms of which 3 ms to minimize.
[2024-06-01 07:16:25] [INFO ] Deduced a trap composed of 86 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:16:25] [INFO ] Deduced a trap composed of 92 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:16:26] [INFO ] Deduced a trap composed of 96 places in 137 ms of which 3 ms to minimize.
[2024-06-01 07:16:26] [INFO ] Deduced a trap composed of 100 places in 99 ms of which 3 ms to minimize.
[2024-06-01 07:16:26] [INFO ] Deduced a trap composed of 93 places in 120 ms of which 2 ms to minimize.
[2024-06-01 07:16:26] [INFO ] Deduced a trap composed of 93 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:16:26] [INFO ] Deduced a trap composed of 89 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:16:26] [INFO ] Deduced a trap composed of 98 places in 134 ms of which 4 ms to minimize.
[2024-06-01 07:16:26] [INFO ] Deduced a trap composed of 100 places in 121 ms of which 2 ms to minimize.
[2024-06-01 07:16:26] [INFO ] Deduced a trap composed of 100 places in 122 ms of which 2 ms to minimize.
[2024-06-01 07:16:27] [INFO ] Deduced a trap composed of 101 places in 161 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/547 variables, 20/127 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-06-01 07:16:27] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:16:27] [INFO ] Deduced a trap composed of 99 places in 145 ms of which 3 ms to minimize.
[2024-06-01 07:16:27] [INFO ] Deduced a trap composed of 74 places in 134 ms of which 3 ms to minimize.
[2024-06-01 07:16:27] [INFO ] Deduced a trap composed of 75 places in 129 ms of which 2 ms to minimize.
[2024-06-01 07:16:27] [INFO ] Deduced a trap composed of 71 places in 130 ms of which 3 ms to minimize.
[2024-06-01 07:16:28] [INFO ] Deduced a trap composed of 92 places in 139 ms of which 3 ms to minimize.
[2024-06-01 07:16:28] [INFO ] Deduced a trap composed of 92 places in 130 ms of which 3 ms to minimize.
[2024-06-01 07:16:28] [INFO ] Deduced a trap composed of 95 places in 124 ms of which 2 ms to minimize.
[2024-06-01 07:16:28] [INFO ] Deduced a trap composed of 90 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:16:28] [INFO ] Deduced a trap composed of 91 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:16:28] [INFO ] Deduced a trap composed of 97 places in 114 ms of which 3 ms to minimize.
[2024-06-01 07:16:28] [INFO ] Deduced a trap composed of 88 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:16:29] [INFO ] Deduced a trap composed of 98 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:16:29] [INFO ] Deduced a trap composed of 100 places in 117 ms of which 6 ms to minimize.
[2024-06-01 07:16:29] [INFO ] Deduced a trap composed of 96 places in 127 ms of which 2 ms to minimize.
[2024-06-01 07:16:29] [INFO ] Deduced a trap composed of 94 places in 154 ms of which 3 ms to minimize.
[2024-06-01 07:16:29] [INFO ] Deduced a trap composed of 90 places in 151 ms of which 2 ms to minimize.
[2024-06-01 07:16:29] [INFO ] Deduced a trap composed of 92 places in 134 ms of which 3 ms to minimize.
[2024-06-01 07:16:29] [INFO ] Deduced a trap composed of 100 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:16:30] [INFO ] Deduced a trap composed of 98 places in 152 ms of which 3 ms to minimize.
Problem TDEAD467 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/547 variables, 20/147 constraints. Problems are: Problem set: 1 solved, 478 unsolved
[2024-06-01 07:16:30] [INFO ] Deduced a trap composed of 92 places in 153 ms of which 3 ms to minimize.
[2024-06-01 07:16:30] [INFO ] Deduced a trap composed of 91 places in 131 ms of which 3 ms to minimize.
[2024-06-01 07:16:30] [INFO ] Deduced a trap composed of 92 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:16:30] [INFO ] Deduced a trap composed of 97 places in 141 ms of which 3 ms to minimize.
[2024-06-01 07:16:31] [INFO ] Deduced a trap composed of 95 places in 153 ms of which 3 ms to minimize.
[2024-06-01 07:16:31] [INFO ] Deduced a trap composed of 101 places in 130 ms of which 3 ms to minimize.
[2024-06-01 07:16:31] [INFO ] Deduced a trap composed of 104 places in 132 ms of which 3 ms to minimize.
[2024-06-01 07:16:31] [INFO ] Deduced a trap composed of 91 places in 156 ms of which 3 ms to minimize.
[2024-06-01 07:16:31] [INFO ] Deduced a trap composed of 105 places in 134 ms of which 3 ms to minimize.
[2024-06-01 07:16:31] [INFO ] Deduced a trap composed of 104 places in 138 ms of which 3 ms to minimize.
[2024-06-01 07:16:31] [INFO ] Deduced a trap composed of 95 places in 132 ms of which 4 ms to minimize.
[2024-06-01 07:16:32] [INFO ] Deduced a trap composed of 90 places in 143 ms of which 4 ms to minimize.
[2024-06-01 07:16:32] [INFO ] Deduced a trap composed of 103 places in 137 ms of which 3 ms to minimize.
[2024-06-01 07:16:32] [INFO ] Deduced a trap composed of 96 places in 154 ms of which 4 ms to minimize.
[2024-06-01 07:16:32] [INFO ] Deduced a trap composed of 88 places in 135 ms of which 3 ms to minimize.
[2024-06-01 07:16:32] [INFO ] Deduced a trap composed of 91 places in 135 ms of which 3 ms to minimize.
[2024-06-01 07:16:32] [INFO ] Deduced a trap composed of 100 places in 134 ms of which 3 ms to minimize.
[2024-06-01 07:16:33] [INFO ] Deduced a trap composed of 94 places in 182 ms of which 3 ms to minimize.
[2024-06-01 07:16:33] [INFO ] Deduced a trap composed of 90 places in 173 ms of which 3 ms to minimize.
[2024-06-01 07:16:33] [INFO ] Deduced a trap composed of 100 places in 146 ms of which 3 ms to minimize.
Problem TDEAD442 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/547 variables, 20/167 constraints. Problems are: Problem set: 2 solved, 477 unsolved
[2024-06-01 07:16:37] [INFO ] Deduced a trap composed of 102 places in 145 ms of which 3 ms to minimize.
[2024-06-01 07:16:37] [INFO ] Deduced a trap composed of 102 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:16:38] [INFO ] Deduced a trap composed of 101 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:16:38] [INFO ] Deduced a trap composed of 98 places in 145 ms of which 3 ms to minimize.
[2024-06-01 07:16:38] [INFO ] Deduced a trap composed of 90 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:16:38] [INFO ] Deduced a trap composed of 98 places in 128 ms of which 3 ms to minimize.
[2024-06-01 07:16:38] [INFO ] Deduced a trap composed of 96 places in 158 ms of which 3 ms to minimize.
[2024-06-01 07:16:38] [INFO ] Deduced a trap composed of 93 places in 138 ms of which 3 ms to minimize.
[2024-06-01 07:16:38] [INFO ] Deduced a trap composed of 91 places in 135 ms of which 3 ms to minimize.
[2024-06-01 07:16:39] [INFO ] Deduced a trap composed of 90 places in 150 ms of which 3 ms to minimize.
[2024-06-01 07:16:39] [INFO ] Deduced a trap composed of 93 places in 150 ms of which 3 ms to minimize.
[2024-06-01 07:16:39] [INFO ] Deduced a trap composed of 95 places in 136 ms of which 3 ms to minimize.
[2024-06-01 07:16:39] [INFO ] Deduced a trap composed of 93 places in 149 ms of which 3 ms to minimize.
[2024-06-01 07:16:39] [INFO ] Deduced a trap composed of 96 places in 152 ms of which 3 ms to minimize.
[2024-06-01 07:16:39] [INFO ] Deduced a trap composed of 97 places in 118 ms of which 2 ms to minimize.
[2024-06-01 07:16:40] [INFO ] Deduced a trap composed of 95 places in 118 ms of which 2 ms to minimize.
[2024-06-01 07:16:40] [INFO ] Deduced a trap composed of 95 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:16:40] [INFO ] Deduced a trap composed of 93 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:16:40] [INFO ] Deduced a trap composed of 92 places in 119 ms of which 3 ms to minimize.
[2024-06-01 07:16:40] [INFO ] Deduced a trap composed of 31 places in 52 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/547 variables, 20/187 constraints. Problems are: Problem set: 2 solved, 477 unsolved
[2024-06-01 07:16:41] [INFO ] Deduced a trap composed of 102 places in 143 ms of which 3 ms to minimize.
[2024-06-01 07:16:41] [INFO ] Deduced a trap composed of 97 places in 153 ms of which 4 ms to minimize.
[2024-06-01 07:16:41] [INFO ] Deduced a trap composed of 96 places in 125 ms of which 3 ms to minimize.
[2024-06-01 07:16:41] [INFO ] Deduced a trap composed of 96 places in 158 ms of which 3 ms to minimize.
[2024-06-01 07:16:41] [INFO ] Deduced a trap composed of 99 places in 141 ms of which 3 ms to minimize.
[2024-06-01 07:16:41] [INFO ] Deduced a trap composed of 92 places in 140 ms of which 3 ms to minimize.
[2024-06-01 07:16:41] [INFO ] Deduced a trap composed of 93 places in 141 ms of which 3 ms to minimize.
[2024-06-01 07:16:42] [INFO ] Deduced a trap composed of 93 places in 135 ms of which 3 ms to minimize.
[2024-06-01 07:16:42] [INFO ] Deduced a trap composed of 86 places in 133 ms of which 3 ms to minimize.
[2024-06-01 07:16:42] [INFO ] Deduced a trap composed of 89 places in 132 ms of which 2 ms to minimize.
[2024-06-01 07:16:42] [INFO ] Deduced a trap composed of 89 places in 137 ms of which 3 ms to minimize.
[2024-06-01 07:16:42] [INFO ] Deduced a trap composed of 91 places in 124 ms of which 3 ms to minimize.
[2024-06-01 07:16:42] [INFO ] Deduced a trap composed of 100 places in 181 ms of which 3 ms to minimize.
[2024-06-01 07:16:43] [INFO ] Deduced a trap composed of 90 places in 160 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 547/1027 variables, and 201 constraints, problems are : Problem set: 2 solved, 477 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 65/65 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 0/547 constraints, PredecessorRefiner: 479/479 constraints, Known Traps: 94/94 constraints]
Escalating to Integer solving :Problem set: 2 solved, 477 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/546 variables, 41/41 constraints. Problems are: Problem set: 2 solved, 477 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/546 variables, 0/41 constraints. Problems are: Problem set: 2 solved, 477 unsolved
At refinement iteration 2 (OVERLAPS) 1/547 variables, 65/106 constraints. Problems are: Problem set: 2 solved, 477 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/547 variables, 1/107 constraints. Problems are: Problem set: 2 solved, 477 unsolved
Problem TDEAD417 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD459 is UNSAT
Problem TDEAD460 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD463 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD469 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/547 variables, 94/201 constraints. Problems are: Problem set: 21 solved, 458 unsolved
[2024-06-01 07:16:47] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:16:48] [INFO ] Deduced a trap composed of 91 places in 151 ms of which 3 ms to minimize.
[2024-06-01 07:16:48] [INFO ] Deduced a trap composed of 93 places in 134 ms of which 4 ms to minimize.
[2024-06-01 07:16:48] [INFO ] Deduced a trap composed of 97 places in 133 ms of which 3 ms to minimize.
[2024-06-01 07:16:48] [INFO ] Deduced a trap composed of 96 places in 155 ms of which 3 ms to minimize.
[2024-06-01 07:16:48] [INFO ] Deduced a trap composed of 113 places in 119 ms of which 3 ms to minimize.
[2024-06-01 07:16:48] [INFO ] Deduced a trap composed of 97 places in 121 ms of which 3 ms to minimize.
[2024-06-01 07:16:49] [INFO ] Deduced a trap composed of 97 places in 146 ms of which 3 ms to minimize.
[2024-06-01 07:16:49] [INFO ] Deduced a trap composed of 97 places in 120 ms of which 3 ms to minimize.
[2024-06-01 07:16:49] [INFO ] Deduced a trap composed of 109 places in 123 ms of which 3 ms to minimize.
[2024-06-01 07:16:49] [INFO ] Deduced a trap composed of 94 places in 123 ms of which 3 ms to minimize.
[2024-06-01 07:16:49] [INFO ] Deduced a trap composed of 98 places in 145 ms of which 3 ms to minimize.
[2024-06-01 07:16:49] [INFO ] Deduced a trap composed of 98 places in 117 ms of which 3 ms to minimize.
[2024-06-01 07:16:49] [INFO ] Deduced a trap composed of 95 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:16:50] [INFO ] Deduced a trap composed of 95 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:16:50] [INFO ] Deduced a trap composed of 113 places in 100 ms of which 3 ms to minimize.
[2024-06-01 07:16:50] [INFO ] Deduced a trap composed of 97 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:16:50] [INFO ] Deduced a trap composed of 96 places in 134 ms of which 3 ms to minimize.
[2024-06-01 07:16:50] [INFO ] Deduced a trap composed of 102 places in 102 ms of which 3 ms to minimize.
[2024-06-01 07:16:50] [INFO ] Deduced a trap composed of 94 places in 126 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/547 variables, 20/221 constraints. Problems are: Problem set: 21 solved, 458 unsolved
[2024-06-01 07:16:51] [INFO ] Deduced a trap composed of 40 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:16:51] [INFO ] Deduced a trap composed of 91 places in 142 ms of which 2 ms to minimize.
[2024-06-01 07:16:51] [INFO ] Deduced a trap composed of 92 places in 133 ms of which 3 ms to minimize.
[2024-06-01 07:16:51] [INFO ] Deduced a trap composed of 88 places in 125 ms of which 2 ms to minimize.
[2024-06-01 07:16:51] [INFO ] Deduced a trap composed of 96 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:16:52] [INFO ] Deduced a trap composed of 92 places in 146 ms of which 3 ms to minimize.
[2024-06-01 07:16:52] [INFO ] Deduced a trap composed of 92 places in 127 ms of which 2 ms to minimize.
[2024-06-01 07:16:52] [INFO ] Deduced a trap composed of 90 places in 173 ms of which 3 ms to minimize.
[2024-06-01 07:16:52] [INFO ] Deduced a trap composed of 90 places in 132 ms of which 3 ms to minimize.
[2024-06-01 07:16:52] [INFO ] Deduced a trap composed of 94 places in 167 ms of which 3 ms to minimize.
[2024-06-01 07:16:53] [INFO ] Deduced a trap composed of 17 places in 166 ms of which 3 ms to minimize.
[2024-06-01 07:16:53] [INFO ] Deduced a trap composed of 90 places in 144 ms of which 3 ms to minimize.
[2024-06-01 07:16:53] [INFO ] Deduced a trap composed of 93 places in 142 ms of which 3 ms to minimize.
[2024-06-01 07:16:53] [INFO ] Deduced a trap composed of 78 places in 146 ms of which 3 ms to minimize.
[2024-06-01 07:16:53] [INFO ] Deduced a trap composed of 103 places in 148 ms of which 3 ms to minimize.
[2024-06-01 07:16:53] [INFO ] Deduced a trap composed of 95 places in 170 ms of which 3 ms to minimize.
[2024-06-01 07:16:54] [INFO ] Deduced a trap composed of 81 places in 151 ms of which 3 ms to minimize.
[2024-06-01 07:16:54] [INFO ] Deduced a trap composed of 74 places in 148 ms of which 3 ms to minimize.
[2024-06-01 07:16:54] [INFO ] Deduced a trap composed of 73 places in 130 ms of which 2 ms to minimize.
[2024-06-01 07:16:54] [INFO ] Deduced a trap composed of 94 places in 132 ms of which 2 ms to minimize.
Problem TDEAD416 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD440 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/547 variables, 20/241 constraints. Problems are: Problem set: 24 solved, 455 unsolved
[2024-06-01 07:16:55] [INFO ] Deduced a trap composed of 91 places in 157 ms of which 3 ms to minimize.
[2024-06-01 07:16:55] [INFO ] Deduced a trap composed of 97 places in 189 ms of which 3 ms to minimize.
[2024-06-01 07:16:55] [INFO ] Deduced a trap composed of 92 places in 155 ms of which 3 ms to minimize.
[2024-06-01 07:16:55] [INFO ] Deduced a trap composed of 95 places in 166 ms of which 3 ms to minimize.
[2024-06-01 07:16:55] [INFO ] Deduced a trap composed of 96 places in 147 ms of which 3 ms to minimize.
[2024-06-01 07:16:55] [INFO ] Deduced a trap composed of 98 places in 158 ms of which 3 ms to minimize.
[2024-06-01 07:16:56] [INFO ] Deduced a trap composed of 94 places in 142 ms of which 3 ms to minimize.
[2024-06-01 07:16:56] [INFO ] Deduced a trap composed of 93 places in 150 ms of which 4 ms to minimize.
[2024-06-01 07:16:56] [INFO ] Deduced a trap composed of 92 places in 127 ms of which 3 ms to minimize.
[2024-06-01 07:16:56] [INFO ] Deduced a trap composed of 94 places in 121 ms of which 2 ms to minimize.
[2024-06-01 07:16:56] [INFO ] Deduced a trap composed of 93 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:16:56] [INFO ] Deduced a trap composed of 92 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:16:56] [INFO ] Deduced a trap composed of 89 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:16:57] [INFO ] Deduced a trap composed of 94 places in 124 ms of which 2 ms to minimize.
[2024-06-01 07:16:57] [INFO ] Deduced a trap composed of 96 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:16:57] [INFO ] Deduced a trap composed of 131 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:16:57] [INFO ] Deduced a trap composed of 121 places in 120 ms of which 2 ms to minimize.
[2024-06-01 07:16:57] [INFO ] Deduced a trap composed of 96 places in 124 ms of which 2 ms to minimize.
[2024-06-01 07:16:57] [INFO ] Deduced a trap composed of 100 places in 128 ms of which 3 ms to minimize.
[2024-06-01 07:16:57] [INFO ] Deduced a trap composed of 60 places in 44 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/547 variables, 20/261 constraints. Problems are: Problem set: 24 solved, 455 unsolved
[2024-06-01 07:16:58] [INFO ] Deduced a trap composed of 93 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:16:58] [INFO ] Deduced a trap composed of 89 places in 125 ms of which 3 ms to minimize.
[2024-06-01 07:16:58] [INFO ] Deduced a trap composed of 89 places in 132 ms of which 3 ms to minimize.
[2024-06-01 07:16:58] [INFO ] Deduced a trap composed of 95 places in 130 ms of which 3 ms to minimize.
[2024-06-01 07:16:58] [INFO ] Deduced a trap composed of 91 places in 121 ms of which 2 ms to minimize.
[2024-06-01 07:16:58] [INFO ] Deduced a trap composed of 92 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:16:59] [INFO ] Deduced a trap composed of 94 places in 118 ms of which 3 ms to minimize.
[2024-06-01 07:16:59] [INFO ] Deduced a trap composed of 100 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:16:59] [INFO ] Deduced a trap composed of 99 places in 114 ms of which 3 ms to minimize.
[2024-06-01 07:16:59] [INFO ] Deduced a trap composed of 97 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:16:59] [INFO ] Deduced a trap composed of 97 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:16:59] [INFO ] Deduced a trap composed of 90 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:16:59] [INFO ] Deduced a trap composed of 95 places in 118 ms of which 3 ms to minimize.
[2024-06-01 07:17:00] [INFO ] Deduced a trap composed of 98 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:17:00] [INFO ] Deduced a trap composed of 103 places in 152 ms of which 3 ms to minimize.
[2024-06-01 07:17:00] [INFO ] Deduced a trap composed of 94 places in 115 ms of which 3 ms to minimize.
[2024-06-01 07:17:00] [INFO ] Deduced a trap composed of 94 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:17:00] [INFO ] Deduced a trap composed of 99 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:17:00] [INFO ] Deduced a trap composed of 96 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:17:00] [INFO ] Deduced a trap composed of 98 places in 109 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/547 variables, 20/281 constraints. Problems are: Problem set: 24 solved, 455 unsolved
[2024-06-01 07:17:01] [INFO ] Deduced a trap composed of 92 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:17:01] [INFO ] Deduced a trap composed of 91 places in 135 ms of which 3 ms to minimize.
[2024-06-01 07:17:01] [INFO ] Deduced a trap composed of 95 places in 122 ms of which 2 ms to minimize.
[2024-06-01 07:17:02] [INFO ] Deduced a trap composed of 93 places in 131 ms of which 3 ms to minimize.
[2024-06-01 07:17:02] [INFO ] Deduced a trap composed of 92 places in 150 ms of which 3 ms to minimize.
[2024-06-01 07:17:02] [INFO ] Deduced a trap composed of 97 places in 127 ms of which 2 ms to minimize.
[2024-06-01 07:17:02] [INFO ] Deduced a trap composed of 92 places in 148 ms of which 3 ms to minimize.
[2024-06-01 07:17:02] [INFO ] Deduced a trap composed of 96 places in 124 ms of which 3 ms to minimize.
[2024-06-01 07:17:02] [INFO ] Deduced a trap composed of 102 places in 139 ms of which 3 ms to minimize.
[2024-06-01 07:17:02] [INFO ] Deduced a trap composed of 93 places in 137 ms of which 3 ms to minimize.
[2024-06-01 07:17:03] [INFO ] Deduced a trap composed of 98 places in 147 ms of which 3 ms to minimize.
[2024-06-01 07:17:03] [INFO ] Deduced a trap composed of 96 places in 136 ms of which 3 ms to minimize.
[2024-06-01 07:17:03] [INFO ] Deduced a trap composed of 93 places in 118 ms of which 2 ms to minimize.
[2024-06-01 07:17:03] [INFO ] Deduced a trap composed of 94 places in 127 ms of which 3 ms to minimize.
[2024-06-01 07:17:03] [INFO ] Deduced a trap composed of 102 places in 137 ms of which 3 ms to minimize.
[2024-06-01 07:17:03] [INFO ] Deduced a trap composed of 102 places in 130 ms of which 3 ms to minimize.
[2024-06-01 07:17:04] [INFO ] Deduced a trap composed of 96 places in 123 ms of which 2 ms to minimize.
[2024-06-01 07:17:04] [INFO ] Deduced a trap composed of 97 places in 128 ms of which 2 ms to minimize.
[2024-06-01 07:17:04] [INFO ] Deduced a trap composed of 94 places in 126 ms of which 3 ms to minimize.
[2024-06-01 07:17:04] [INFO ] Deduced a trap composed of 70 places in 147 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/547 variables, 20/301 constraints. Problems are: Problem set: 24 solved, 455 unsolved
[2024-06-01 07:17:05] [INFO ] Deduced a trap composed of 8 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:17:05] [INFO ] Deduced a trap composed of 61 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:17:05] [INFO ] Deduced a trap composed of 18 places in 169 ms of which 4 ms to minimize.
[2024-06-01 07:17:05] [INFO ] Deduced a trap composed of 76 places in 141 ms of which 4 ms to minimize.
[2024-06-01 07:17:05] [INFO ] Deduced a trap composed of 64 places in 124 ms of which 3 ms to minimize.
[2024-06-01 07:17:06] [INFO ] Deduced a trap composed of 81 places in 155 ms of which 3 ms to minimize.
[2024-06-01 07:17:06] [INFO ] Deduced a trap composed of 80 places in 124 ms of which 2 ms to minimize.
[2024-06-01 07:17:06] [INFO ] Deduced a trap composed of 83 places in 121 ms of which 2 ms to minimize.
[2024-06-01 07:17:06] [INFO ] Deduced a trap composed of 86 places in 145 ms of which 3 ms to minimize.
[2024-06-01 07:17:06] [INFO ] Deduced a trap composed of 102 places in 136 ms of which 3 ms to minimize.
[2024-06-01 07:17:06] [INFO ] Deduced a trap composed of 87 places in 141 ms of which 3 ms to minimize.
[2024-06-01 07:17:06] [INFO ] Deduced a trap composed of 78 places in 137 ms of which 3 ms to minimize.
[2024-06-01 07:17:07] [INFO ] Deduced a trap composed of 83 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:17:07] [INFO ] Deduced a trap composed of 84 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:17:07] [INFO ] Deduced a trap composed of 83 places in 118 ms of which 3 ms to minimize.
[2024-06-01 07:17:07] [INFO ] Deduced a trap composed of 91 places in 169 ms of which 3 ms to minimize.
[2024-06-01 07:17:07] [INFO ] Deduced a trap composed of 96 places in 123 ms of which 3 ms to minimize.
[2024-06-01 07:17:07] [INFO ] Deduced a trap composed of 101 places in 123 ms of which 2 ms to minimize.
[2024-06-01 07:17:07] [INFO ] Deduced a trap composed of 97 places in 121 ms of which 3 ms to minimize.
[2024-06-01 07:17:08] [INFO ] Deduced a trap composed of 99 places in 122 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/547 variables, 20/321 constraints. Problems are: Problem set: 24 solved, 455 unsolved
[2024-06-01 07:17:09] [INFO ] Deduced a trap composed of 31 places in 27 ms of which 0 ms to minimize.
[2024-06-01 07:17:09] [INFO ] Deduced a trap composed of 97 places in 173 ms of which 3 ms to minimize.
[2024-06-01 07:17:09] [INFO ] Deduced a trap composed of 99 places in 145 ms of which 3 ms to minimize.
[2024-06-01 07:17:10] [INFO ] Deduced a trap composed of 92 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:17:10] [INFO ] Deduced a trap composed of 97 places in 150 ms of which 3 ms to minimize.
[2024-06-01 07:17:10] [INFO ] Deduced a trap composed of 98 places in 143 ms of which 3 ms to minimize.
[2024-06-01 07:17:10] [INFO ] Deduced a trap composed of 93 places in 134 ms of which 3 ms to minimize.
[2024-06-01 07:17:10] [INFO ] Deduced a trap composed of 90 places in 124 ms of which 3 ms to minimize.
[2024-06-01 07:17:10] [INFO ] Deduced a trap composed of 86 places in 126 ms of which 3 ms to minimize.
[2024-06-01 07:17:10] [INFO ] Deduced a trap composed of 93 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:17:11] [INFO ] Deduced a trap composed of 91 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:17:11] [INFO ] Deduced a trap composed of 91 places in 138 ms of which 3 ms to minimize.
[2024-06-01 07:17:11] [INFO ] Deduced a trap composed of 94 places in 145 ms of which 3 ms to minimize.
[2024-06-01 07:17:11] [INFO ] Deduced a trap composed of 88 places in 143 ms of which 3 ms to minimize.
[2024-06-01 07:17:11] [INFO ] Deduced a trap composed of 94 places in 132 ms of which 3 ms to minimize.
[2024-06-01 07:17:11] [INFO ] Deduced a trap composed of 88 places in 133 ms of which 3 ms to minimize.
[2024-06-01 07:17:12] [INFO ] Deduced a trap composed of 91 places in 134 ms of which 3 ms to minimize.
[2024-06-01 07:17:12] [INFO ] Deduced a trap composed of 89 places in 158 ms of which 4 ms to minimize.
[2024-06-01 07:17:12] [INFO ] Deduced a trap composed of 97 places in 135 ms of which 3 ms to minimize.
[2024-06-01 07:17:12] [INFO ] Deduced a trap composed of 96 places in 116 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/547 variables, 20/341 constraints. Problems are: Problem set: 24 solved, 455 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 547/1027 variables, and 341 constraints, problems are : Problem set: 24 solved, 455 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 65/65 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 0/547 constraints, PredecessorRefiner: 0/479 constraints, Known Traps: 234/234 constraints]
After SMT, in 60245ms problems are : Problem set: 24 solved, 455 unsolved
Search for dead transitions found 24 dead transitions in 60265ms
Found 24 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 24 transitions
Dead transitions reduction (with SMT) removed 24 transitions
Starting structural reductions in LTL mode, iteration 1 : 547/719 places, 456/638 transitions.
Applied a total of 0 rules in 13 ms. Remains 547 /547 variables (removed 0) and now considering 456/456 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61696 ms. Remains : 547/719 places, 456/638 transitions.
Support contains 18 out of 547 places after structural reductions.
[2024-06-01 07:17:13] [INFO ] Flatten gal took : 65 ms
[2024-06-01 07:17:13] [INFO ] Flatten gal took : 43 ms
[2024-06-01 07:17:13] [INFO ] Input system was already deterministic with 456 transitions.
Reduction of identical properties reduced properties to check from 12 to 11
RANDOM walk for 40000 steps (197 resets) in 1819 ms. (21 steps per ms) remains 4/11 properties
BEST_FIRST walk for 40004 steps (36 resets) in 178 ms. (223 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (45 resets) in 170 ms. (233 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (36 resets) in 125 ms. (317 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (35 resets) in 141 ms. (281 steps per ms) remains 4/4 properties
// Phase 1: matrix 456 rows 547 cols
[2024-06-01 07:17:14] [INFO ] Computed 107 invariants in 10 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 167/174 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/174 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 239/413 variables, 60/65 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/413 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 126/539 variables, 41/106 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/539 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 1/540 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/540 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 451/991 variables, 540/647 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/991 variables, 0/647 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 11/1002 variables, 6/653 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1002 variables, 0/653 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 1/1003 variables, 1/654 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1003 variables, 0/654 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 0/1003 variables, 0/654 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1003/1003 variables, and 654 constraints, problems are : Problem set: 0 solved, 4 unsolved in 506 ms.
Refiners :[Positive P Invariants (semi-flows): 65/65 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 547/547 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 167/174 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/174 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 239/413 variables, 60/65 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 07:17:15] [INFO ] Deduced a trap composed of 8 places in 100 ms of which 3 ms to minimize.
[2024-06-01 07:17:15] [INFO ] Deduced a trap composed of 21 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:17:15] [INFO ] Deduced a trap composed of 18 places in 98 ms of which 3 ms to minimize.
[2024-06-01 07:17:15] [INFO ] Deduced a trap composed of 19 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:17:15] [INFO ] Deduced a trap composed of 67 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:17:15] [INFO ] Deduced a trap composed of 69 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:17:15] [INFO ] Deduced a trap composed of 80 places in 124 ms of which 3 ms to minimize.
[2024-06-01 07:17:15] [INFO ] Deduced a trap composed of 71 places in 107 ms of which 3 ms to minimize.
[2024-06-01 07:17:16] [INFO ] Deduced a trap composed of 80 places in 106 ms of which 3 ms to minimize.
[2024-06-01 07:17:16] [INFO ] Deduced a trap composed of 21 places in 100 ms of which 3 ms to minimize.
[2024-06-01 07:17:16] [INFO ] Deduced a trap composed of 17 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:17:16] [INFO ] Deduced a trap composed of 81 places in 153 ms of which 3 ms to minimize.
[2024-06-01 07:17:16] [INFO ] Deduced a trap composed of 21 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:17:16] [INFO ] Deduced a trap composed of 68 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:17:16] [INFO ] Deduced a trap composed of 68 places in 108 ms of which 3 ms to minimize.
[2024-06-01 07:17:16] [INFO ] Deduced a trap composed of 89 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:17:17] [INFO ] Deduced a trap composed of 16 places in 141 ms of which 3 ms to minimize.
[2024-06-01 07:17:17] [INFO ] Deduced a trap composed of 11 places in 136 ms of which 3 ms to minimize.
[2024-06-01 07:17:17] [INFO ] Deduced a trap composed of 13 places in 133 ms of which 3 ms to minimize.
[2024-06-01 07:17:17] [INFO ] Deduced a trap composed of 21 places in 128 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/413 variables, 20/85 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 07:17:17] [INFO ] Deduced a trap composed of 67 places in 139 ms of which 3 ms to minimize.
[2024-06-01 07:17:17] [INFO ] Deduced a trap composed of 34 places in 133 ms of which 6 ms to minimize.
[2024-06-01 07:17:17] [INFO ] Deduced a trap composed of 32 places in 130 ms of which 3 ms to minimize.
[2024-06-01 07:17:18] [INFO ] Deduced a trap composed of 69 places in 126 ms of which 3 ms to minimize.
[2024-06-01 07:17:18] [INFO ] Deduced a trap composed of 33 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:17:18] [INFO ] Deduced a trap composed of 34 places in 83 ms of which 1 ms to minimize.
[2024-06-01 07:17:18] [INFO ] Deduced a trap composed of 30 places in 84 ms of which 1 ms to minimize.
[2024-06-01 07:17:18] [INFO ] Deduced a trap composed of 32 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:17:18] [INFO ] Deduced a trap composed of 29 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:17:18] [INFO ] Deduced a trap composed of 33 places in 80 ms of which 1 ms to minimize.
[2024-06-01 07:17:18] [INFO ] Deduced a trap composed of 28 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:17:18] [INFO ] Deduced a trap composed of 48 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:17:18] [INFO ] Deduced a trap composed of 32 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:17:19] [INFO ] Deduced a trap composed of 28 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:17:19] [INFO ] Deduced a trap composed of 35 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:17:19] [INFO ] Deduced a trap composed of 30 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:17:19] [INFO ] Deduced a trap composed of 69 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:17:19] [INFO ] Deduced a trap composed of 30 places in 55 ms of which 2 ms to minimize.
[2024-06-01 07:17:19] [INFO ] Deduced a trap composed of 29 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:17:19] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/413 variables, 20/105 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 07:17:19] [INFO ] Deduced a trap composed of 67 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:17:19] [INFO ] Deduced a trap composed of 86 places in 87 ms of which 1 ms to minimize.
[2024-06-01 07:17:19] [INFO ] Deduced a trap composed of 86 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:17:19] [INFO ] Deduced a trap composed of 18 places in 108 ms of which 3 ms to minimize.
SMT process timed out in 5542ms, After SMT, problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 7 out of 547 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 547/547 places, 456/456 transitions.
Graph (trivial) has 254 edges and 547 vertex of which 6 / 547 are part of one of the 1 SCC in 5 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1167 edges and 542 vertex of which 540 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 0 with 71 rules applied. Total rules applied 73 place count 540 transition count 376
Reduce places removed 71 places and 0 transitions.
Iterating post reduction 1 with 71 rules applied. Total rules applied 144 place count 469 transition count 376
Performed 109 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 109 Pre rules applied. Total rules applied 144 place count 469 transition count 267
Deduced a syphon composed of 109 places in 1 ms
Ensure Unique test removed 22 places
Reduce places removed 131 places and 0 transitions.
Iterating global reduction 2 with 240 rules applied. Total rules applied 384 place count 338 transition count 267
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 389 place count 333 transition count 262
Iterating global reduction 2 with 5 rules applied. Total rules applied 394 place count 333 transition count 262
Performed 138 Post agglomeration using F-continuation condition.Transition count delta: 138
Deduced a syphon composed of 138 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 141 places and 0 transitions.
Iterating global reduction 2 with 279 rules applied. Total rules applied 673 place count 192 transition count 124
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 677 place count 190 transition count 131
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 679 place count 190 transition count 129
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 681 place count 188 transition count 129
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 682 place count 188 transition count 129
Applied a total of 682 rules in 141 ms. Remains 188 /547 variables (removed 359) and now considering 129/456 (removed 327) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 141 ms. Remains : 188/547 places, 129/456 transitions.
RANDOM walk for 40000 steps (1715 resets) in 1435 ms. (27 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40000 steps (577 resets) in 171 ms. (232 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (569 resets) in 172 ms. (231 steps per ms) remains 2/2 properties
[2024-06-01 07:17:20] [INFO ] Flow matrix only has 128 transitions (discarded 1 similar events)
// Phase 1: matrix 128 rows 188 cols
[2024-06-01 07:17:20] [INFO ] Computed 82 invariants in 2 ms
[2024-06-01 07:17:20] [INFO ] State equation strengthened by 15 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 49/54 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 96/150 variables, 60/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/150 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 35/185 variables, 17/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/185 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/186 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/186 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 128/314 variables, 186/268 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/314 variables, 15/283 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/314 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 2/316 variables, 2/285 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/316 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/316 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 316/316 variables, and 285 constraints, problems are : Problem set: 0 solved, 2 unsolved in 207 ms.
Refiners :[Positive P Invariants (semi-flows): 64/64 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 188/188 constraints, ReadFeed: 15/15 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/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 49/54 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 96/150 variables, 60/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 07:17:20] [INFO ] Deduced a trap composed of 38 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:17:21] [INFO ] Deduced a trap composed of 40 places in 57 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/150 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/150 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp1 is UNSAT
At refinement iteration 6 (OVERLAPS) 35/185 variables, 17/83 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/185 variables, 0/83 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/186 variables, 1/84 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/186 variables, 0/84 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 128/314 variables, 186/270 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/314 variables, 15/285 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/314 variables, 1/286 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/314 variables, 0/286 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/316 variables, 2/288 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/316 variables, 0/288 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/316 variables, 0/288 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 316/316 variables, and 288 constraints, problems are : Problem set: 1 solved, 1 unsolved in 278 ms.
Refiners :[Positive P Invariants (semi-flows): 64/64 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 188/188 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 505ms problems are : Problem set: 1 solved, 1 unsolved
Finished Parikh walk after 21 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=21 )
Parikh walk visited 1 properties in 7 ms.
Successfully simplified 1 atomic propositions for a total of 6 simplifications.
FORMULA BusinessProcesses-PT-20-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 478 stabilizing places and 397 stable transitions
Graph (complete) has 1174 edges and 547 vertex of which 545 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.18 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 547 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 547/547 places, 456/456 transitions.
Graph (trivial) has 261 edges and 547 vertex of which 6 / 547 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1168 edges and 542 vertex of which 540 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 72 rules applied. Total rules applied 74 place count 539 transition count 375
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 1 with 72 rules applied. Total rules applied 146 place count 467 transition count 375
Performed 111 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 111 Pre rules applied. Total rules applied 146 place count 467 transition count 264
Deduced a syphon composed of 111 places in 0 ms
Ensure Unique test removed 22 places
Reduce places removed 133 places and 0 transitions.
Iterating global reduction 2 with 244 rules applied. Total rules applied 390 place count 334 transition count 264
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 397 place count 327 transition count 257
Iterating global reduction 2 with 7 rules applied. Total rules applied 404 place count 327 transition count 257
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 404 place count 327 transition count 256
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 406 place count 326 transition count 256
Performed 140 Post agglomeration using F-continuation condition.Transition count delta: 140
Deduced a syphon composed of 140 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 144 places and 0 transitions.
Iterating global reduction 2 with 284 rules applied. Total rules applied 690 place count 182 transition count 116
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 694 place count 180 transition count 123
Applied a total of 694 rules in 98 ms. Remains 180 /547 variables (removed 367) and now considering 123/456 (removed 333) transitions.
[2024-06-01 07:17:21] [INFO ] Flow matrix only has 122 transitions (discarded 1 similar events)
// Phase 1: matrix 122 rows 180 cols
[2024-06-01 07:17:21] [INFO ] Computed 81 invariants in 2 ms
[2024-06-01 07:17:21] [INFO ] Implicit Places using invariants in 242 ms returned [27, 28, 29, 30, 31, 36, 37, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57]
Discarding 24 places :
Implicit Place search using SMT only with invariants took 244 ms to find 24 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 156/547 places, 123/456 transitions.
Applied a total of 0 rules in 15 ms. Remains 156 /156 variables (removed 0) and now considering 123/123 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 357 ms. Remains : 156/547 places, 123/456 transitions.
Stuttering acceptance computed with spot in 196 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-20-LTLCardinality-02
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-20-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-20-LTLCardinality-02 finished in 609 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0 U X(X(G(p1)))) U (F(p3)||p2))))'
Support contains 5 out of 547 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 547/547 places, 456/456 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 543 transition count 452
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 543 transition count 452
Applied a total of 8 rules in 179 ms. Remains 543 /547 variables (removed 4) and now considering 452/456 (removed 4) transitions.
// Phase 1: matrix 452 rows 543 cols
[2024-06-01 07:17:22] [INFO ] Computed 107 invariants in 9 ms
[2024-06-01 07:17:22] [INFO ] Implicit Places using invariants in 225 ms returned []
[2024-06-01 07:17:22] [INFO ] Invariant cache hit.
[2024-06-01 07:17:22] [INFO ] Implicit Places using invariants and state equation in 462 ms returned [453, 454, 455]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 690 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 540/547 places, 452/456 transitions.
Applied a total of 0 rules in 14 ms. Remains 540 /540 variables (removed 0) and now considering 452/452 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 883 ms. Remains : 540/547 places, 452/456 transitions.
Stuttering acceptance computed with spot in 270 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p1)), (AND (NOT p3) (NOT p1)), (AND (NOT p1) (NOT p3)), (NOT p3)]
Running random walk in product with property : BusinessProcesses-PT-20-LTLCardinality-04
Product exploration explored 100000 steps with 50000 reset in 337 ms.
Product exploration explored 100000 steps with 50000 reset in 268 ms.
Computed a total of 472 stabilizing places and 394 stable transitions
Graph (complete) has 1155 edges and 540 vertex of which 538 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.12 ms
Computed a total of 472 stabilizing places and 394 stable transitions
Detected a total of 472/540 stabilizing places and 394/452 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/4 atomic propositions.
Knowledge obtained : [(AND p2 p3 p0 p1), (X p2), (X p3), (X (NOT (AND (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p2) (NOT p3) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p3) p0))), (X p0), (X (X p2)), (X (X p3)), (X (X (NOT (AND (NOT p3) p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p3) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p3) p0)))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X (NOT (AND (NOT p3) p0 p1)))), (X (X p0)), (X (X p1)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 20 factoid took 20 ms. Reduced automaton from 6 states, 11 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-20-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-20-LTLCardinality-04 finished in 1846 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||G(p1)))))'
Support contains 3 out of 547 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 547/547 places, 456/456 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 542 transition count 451
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 542 transition count 451
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 540 transition count 449
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 540 transition count 449
Applied a total of 14 rules in 28 ms. Remains 540 /547 variables (removed 7) and now considering 449/456 (removed 7) transitions.
// Phase 1: matrix 449 rows 540 cols
[2024-06-01 07:17:23] [INFO ] Computed 107 invariants in 5 ms
[2024-06-01 07:17:24] [INFO ] Implicit Places using invariants in 180 ms returned []
[2024-06-01 07:17:24] [INFO ] Invariant cache hit.
[2024-06-01 07:17:24] [INFO ] Implicit Places using invariants and state equation in 421 ms returned [449, 450, 451]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 606 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 537/547 places, 449/456 transitions.
Applied a total of 0 rules in 9 ms. Remains 537 /537 variables (removed 0) and now considering 449/449 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 643 ms. Remains : 537/547 places, 449/456 transitions.
Stuttering acceptance computed with spot in 107 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-20-LTLCardinality-09
Entered a terminal (fully accepting) state of product in 3969 steps with 20 reset in 17 ms.
FORMULA BusinessProcesses-PT-20-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-20-LTLCardinality-09 finished in 783 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&X(G(p1))))))'
Support contains 2 out of 547 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 547/547 places, 456/456 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 541 transition count 450
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 541 transition count 450
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 539 transition count 448
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 539 transition count 448
Applied a total of 16 rules in 22 ms. Remains 539 /547 variables (removed 8) and now considering 448/456 (removed 8) transitions.
// Phase 1: matrix 448 rows 539 cols
[2024-06-01 07:17:24] [INFO ] Computed 107 invariants in 5 ms
[2024-06-01 07:17:24] [INFO ] Implicit Places using invariants in 218 ms returned []
[2024-06-01 07:17:24] [INFO ] Invariant cache hit.
[2024-06-01 07:17:25] [INFO ] Implicit Places using invariants and state equation in 617 ms returned [448, 449, 450]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 842 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 536/547 places, 448/456 transitions.
Applied a total of 0 rules in 10 ms. Remains 536 /536 variables (removed 0) and now considering 448/448 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 874 ms. Remains : 536/547 places, 448/456 transitions.
Stuttering acceptance computed with spot in 139 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-20-LTLCardinality-12
Product exploration explored 100000 steps with 504 reset in 281 ms.
Product exploration explored 100000 steps with 508 reset in 318 ms.
Computed a total of 468 stabilizing places and 390 stable transitions
Graph (complete) has 1147 edges and 536 vertex of which 534 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.17 ms
Computed a total of 468 stabilizing places and 390 stable transitions
Detected a total of 468/536 stabilizing places and 390/448 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 246 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 139 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 40000 steps (198 resets) in 359 ms. (111 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (34 resets) in 144 ms. (275 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (34 resets) in 126 ms. (314 steps per ms) remains 1/1 properties
// Phase 1: matrix 448 rows 536 cols
[2024-06-01 07:17:26] [INFO ] Computed 104 invariants in 4 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 158/160 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 277/437 variables, 62/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/437 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 92/529 variables, 37/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/529 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 443/972 variables, 529/633 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/972 variables, 0/633 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 11/983 variables, 6/639 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/983 variables, 0/639 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/984 variables, 1/640 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/984 variables, 0/640 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/984 variables, 0/640 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 984/984 variables, and 640 constraints, problems are : Problem set: 0 solved, 1 unsolved in 335 ms.
Refiners :[Positive P Invariants (semi-flows): 62/62 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 536/536 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 158/160 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 277/437 variables, 62/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:17:27] [INFO ] Deduced a trap composed of 8 places in 127 ms of which 3 ms to minimize.
[2024-06-01 07:17:27] [INFO ] Deduced a trap composed of 91 places in 122 ms of which 2 ms to minimize.
[2024-06-01 07:17:27] [INFO ] Deduced a trap composed of 86 places in 123 ms of which 3 ms to minimize.
[2024-06-01 07:17:27] [INFO ] Deduced a trap composed of 86 places in 135 ms of which 3 ms to minimize.
[2024-06-01 07:17:28] [INFO ] Deduced a trap composed of 93 places in 137 ms of which 2 ms to minimize.
[2024-06-01 07:17:28] [INFO ] Deduced a trap composed of 24 places in 119 ms of which 3 ms to minimize.
[2024-06-01 07:17:28] [INFO ] Deduced a trap composed of 28 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:17:28] [INFO ] Deduced a trap composed of 44 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:17:28] [INFO ] Deduced a trap composed of 32 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:17:28] [INFO ] Deduced a trap composed of 54 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:17:28] [INFO ] Deduced a trap composed of 33 places in 51 ms of which 0 ms to minimize.
[2024-06-01 07:17:28] [INFO ] Deduced a trap composed of 40 places in 50 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/437 variables, 12/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/437 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 92/529 variables, 37/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/529 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf2 is UNSAT
After SMT solving in domain Int declared 972/984 variables, and 645 constraints, problems are : Problem set: 1 solved, 0 unsolved in 1725 ms.
Refiners :[Positive P Invariants (semi-flows): 62/62 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 529/536 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 12/12 constraints]
After SMT, in 2086ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (NOT (OR (NOT p0) p1)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 486 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 43 ms :[(NOT p1)]
Support contains 1 out of 536 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 536/536 places, 448/448 transitions.
Graph (trivial) has 251 edges and 536 vertex of which 6 / 536 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1141 edges and 531 vertex of which 529 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 68 transitions
Trivial Post-agglo rules discarded 68 transitions
Performed 68 trivial Post agglomeration. Transition count delta: 68
Iterating post reduction 0 with 68 rules applied. Total rules applied 70 place count 528 transition count 371
Reduce places removed 68 places and 0 transitions.
Iterating post reduction 1 with 68 rules applied. Total rules applied 138 place count 460 transition count 371
Performed 111 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 111 Pre rules applied. Total rules applied 138 place count 460 transition count 260
Deduced a syphon composed of 111 places in 1 ms
Ensure Unique test removed 22 places
Reduce places removed 133 places and 0 transitions.
Iterating global reduction 2 with 244 rules applied. Total rules applied 382 place count 327 transition count 260
Performed 142 Post agglomeration using F-continuation condition.Transition count delta: 142
Deduced a syphon composed of 142 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 146 places and 0 transitions.
Iterating global reduction 2 with 288 rules applied. Total rules applied 670 place count 181 transition count 118
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 674 place count 179 transition count 125
Applied a total of 674 rules in 38 ms. Remains 179 /536 variables (removed 357) and now considering 125/448 (removed 323) transitions.
[2024-06-01 07:17:29] [INFO ] Flow matrix only has 124 transitions (discarded 1 similar events)
// Phase 1: matrix 124 rows 179 cols
[2024-06-01 07:17:29] [INFO ] Computed 78 invariants in 2 ms
[2024-06-01 07:17:29] [INFO ] Implicit Places using invariants in 92 ms returned [57]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 105 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 178/536 places, 125/448 transitions.
Applied a total of 0 rules in 5 ms. Remains 178 /178 variables (removed 0) and now considering 125/125 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 150 ms. Remains : 178/536 places, 125/448 transitions.
Computed a total of 154 stabilizing places and 105 stable transitions
Computed a total of 154 stabilizing places and 105 stable transitions
Detected a total of 154/178 stabilizing places and 105/125 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p1, (X p1), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 64 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 24 ms :[(NOT p1)]
RANDOM walk for 26326 steps (4703 resets) in 294 ms. (89 steps per ms) remains 0/1 properties
Knowledge obtained : [p1, (X p1), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 4 factoid took 98 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p1)]
Product exploration explored 100000 steps with 15738 reset in 292 ms.
Product exploration explored 100000 steps with 15826 reset in 319 ms.
Support contains 1 out of 178 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 178/178 places, 125/125 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 178 transition count 124
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 177 transition count 124
Applied a total of 2 rules in 7 ms. Remains 177 /178 variables (removed 1) and now considering 124/125 (removed 1) transitions.
[2024-06-01 07:17:30] [INFO ] Flow matrix only has 123 transitions (discarded 1 similar events)
// Phase 1: matrix 123 rows 177 cols
[2024-06-01 07:17:30] [INFO ] Computed 77 invariants in 4 ms
[2024-06-01 07:17:30] [INFO ] Implicit Places using invariants in 205 ms returned []
[2024-06-01 07:17:30] [INFO ] Flow matrix only has 123 transitions (discarded 1 similar events)
[2024-06-01 07:17:30] [INFO ] Invariant cache hit.
[2024-06-01 07:17:31] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-06-01 07:17:31] [INFO ] Implicit Places using invariants and state equation in 317 ms returned [5, 17, 19, 21, 23, 25, 27, 28, 29, 30, 31, 36, 37, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 67, 69, 71, 79, 113, 115, 117, 119, 121, 123, 125, 157, 159]
Discarding 42 places :
Implicit Place search using SMT with State Equation took 526 ms to find 42 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 135/178 places, 124/125 transitions.
Graph (complete) has 435 edges and 135 vertex of which 126 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.0 ms
Discarding 9 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 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 5 place count 126 transition count 116
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 9 place count 122 transition count 116
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 11 place count 120 transition count 113
Iterating global reduction 2 with 2 rules applied. Total rules applied 13 place count 120 transition count 113
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 14 place count 120 transition count 112
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 15 place count 119 transition count 112
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 16 place count 118 transition count 111
Iterating global reduction 4 with 1 rules applied. Total rules applied 17 place count 118 transition count 111
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 19 place count 118 transition count 109
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 20 place count 117 transition count 109
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 24 place count 115 transition count 107
Applied a total of 24 rules in 17 ms. Remains 115 /135 variables (removed 20) and now considering 107/124 (removed 17) transitions.
[2024-06-01 07:17:31] [INFO ] Flow matrix only has 106 transitions (discarded 1 similar events)
// Phase 1: matrix 106 rows 115 cols
[2024-06-01 07:17:31] [INFO ] Computed 34 invariants in 1 ms
[2024-06-01 07:17:31] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-06-01 07:17:31] [INFO ] Flow matrix only has 106 transitions (discarded 1 similar events)
[2024-06-01 07:17:31] [INFO ] Invariant cache hit.
[2024-06-01 07:17:31] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-06-01 07:17:31] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 214 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 115/178 places, 107/125 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 765 ms. Remains : 115/178 places, 107/125 transitions.
Treatment of property BusinessProcesses-PT-20-LTLCardinality-12 finished in 7026 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))&&F(p1))))'
Support contains 3 out of 547 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 547/547 places, 456/456 transitions.
Graph (trivial) has 259 edges and 547 vertex of which 6 / 547 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1168 edges and 542 vertex of which 540 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 0 with 71 rules applied. Total rules applied 73 place count 539 transition count 376
Reduce places removed 71 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 72 rules applied. Total rules applied 145 place count 468 transition count 375
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 146 place count 467 transition count 375
Performed 111 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 111 Pre rules applied. Total rules applied 146 place count 467 transition count 264
Deduced a syphon composed of 111 places in 0 ms
Ensure Unique test removed 22 places
Reduce places removed 133 places and 0 transitions.
Iterating global reduction 3 with 244 rules applied. Total rules applied 390 place count 334 transition count 264
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 396 place count 328 transition count 258
Iterating global reduction 3 with 6 rules applied. Total rules applied 402 place count 328 transition count 258
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 402 place count 328 transition count 257
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 404 place count 327 transition count 257
Performed 137 Post agglomeration using F-continuation condition.Transition count delta: 137
Deduced a syphon composed of 137 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 141 places and 0 transitions.
Iterating global reduction 3 with 278 rules applied. Total rules applied 682 place count 186 transition count 120
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 686 place count 184 transition count 127
Partial Post-agglomeration rule applied 6 times.
Drop transitions (Partial Post agglomeration) removed 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 692 place count 184 transition count 127
Applied a total of 692 rules in 94 ms. Remains 184 /547 variables (removed 363) and now considering 127/456 (removed 329) transitions.
[2024-06-01 07:17:31] [INFO ] Flow matrix only has 126 transitions (discarded 1 similar events)
// Phase 1: matrix 126 rows 184 cols
[2024-06-01 07:17:31] [INFO ] Computed 81 invariants in 14 ms
[2024-06-01 07:17:31] [INFO ] Implicit Places using invariants in 200 ms returned [27, 28, 29, 30, 31, 36, 37, 41, 42, 43, 44, 45, 46, 47, 50, 51, 52, 53, 54, 55, 56, 57, 58]
Discarding 23 places :
Implicit Place search using SMT only with invariants took 202 ms to find 23 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 161/547 places, 127/456 transitions.
Applied a total of 0 rules in 5 ms. Remains 161 /161 variables (removed 0) and now considering 127/127 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 302 ms. Remains : 161/547 places, 127/456 transitions.
Stuttering acceptance computed with spot in 105 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-20-LTLCardinality-15
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-20-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-20-LTLCardinality-15 finished in 434 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&X(G(p1))))))'
Found a Shortening insensitive property : BusinessProcesses-PT-20-LTLCardinality-12
Stuttering acceptance computed with spot in 91 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Support contains 2 out of 547 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 547/547 places, 456/456 transitions.
Graph (trivial) has 259 edges and 547 vertex of which 6 / 547 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1168 edges and 542 vertex of which 540 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 72 rules applied. Total rules applied 74 place count 539 transition count 375
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 1 with 72 rules applied. Total rules applied 146 place count 467 transition count 375
Performed 110 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 110 Pre rules applied. Total rules applied 146 place count 467 transition count 265
Deduced a syphon composed of 110 places in 1 ms
Ensure Unique test removed 22 places
Reduce places removed 132 places and 0 transitions.
Iterating global reduction 2 with 242 rules applied. Total rules applied 388 place count 335 transition count 265
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 394 place count 329 transition count 259
Iterating global reduction 2 with 6 rules applied. Total rules applied 400 place count 329 transition count 259
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 400 place count 329 transition count 258
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 402 place count 328 transition count 258
Performed 140 Post agglomeration using F-continuation condition.Transition count delta: 140
Deduced a syphon composed of 140 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 144 places and 0 transitions.
Iterating global reduction 2 with 284 rules applied. Total rules applied 686 place count 184 transition count 118
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 690 place count 182 transition count 125
Applied a total of 690 rules in 40 ms. Remains 182 /547 variables (removed 365) and now considering 125/456 (removed 331) transitions.
[2024-06-01 07:17:32] [INFO ] Flow matrix only has 124 transitions (discarded 1 similar events)
// Phase 1: matrix 124 rows 182 cols
[2024-06-01 07:17:32] [INFO ] Computed 81 invariants in 2 ms
[2024-06-01 07:17:32] [INFO ] Implicit Places using invariants in 130 ms returned [27, 28, 29, 30, 31, 36, 37, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57]
Discarding 24 places :
Implicit Place search using SMT only with invariants took 131 ms to find 24 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 158/547 places, 125/456 transitions.
Applied a total of 0 rules in 5 ms. Remains 158 /158 variables (removed 0) and now considering 125/125 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 176 ms. Remains : 158/547 places, 125/456 transitions.
Running random walk in product with property : BusinessProcesses-PT-20-LTLCardinality-12
Product exploration explored 100000 steps with 15891 reset in 299 ms.
Product exploration explored 100000 steps with 15593 reset in 471 ms.
Computed a total of 85 stabilizing places and 73 stable transitions
Computed a total of 85 stabilizing places and 73 stable transitions
Detected a total of 85/158 stabilizing places and 73/125 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 205 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 118 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 40000 steps (7035 resets) in 252 ms. (158 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40002 steps (1764 resets) in 91 ms. (434 steps per ms) remains 1/1 properties
[2024-06-01 07:17:33] [INFO ] Flow matrix only has 124 transitions (discarded 1 similar events)
// Phase 1: matrix 124 rows 158 cols
[2024-06-01 07:17:33] [INFO ] Computed 57 invariants in 1 ms
[2024-06-01 07:17:33] [INFO ] State equation strengthened by 7 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 42/44 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 3/47 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 74/121 variables, 37/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 33/154 variables, 15/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/154 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/156 variables, 2/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/156 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 123/279 variables, 156/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/279 variables, 7/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/279 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/281 variables, 2/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/281 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/281 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 281/282 variables, and 222 constraints, problems are : Problem set: 0 solved, 1 unsolved in 96 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 158/158 constraints, ReadFeed: 7/7 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf2 is UNSAT
After SMT solving in domain Int declared 44/282 variables, and 2 constraints, problems are : Problem set: 1 solved, 0 unsolved in 28 ms.
Refiners :[Positive P Invariants (semi-flows): 2/40 constraints, Generalized P Invariants (flows): 0/17 constraints, State Equation: 0/158 constraints, ReadFeed: 0/7 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 154ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (NOT (OR (NOT p0) p1)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 299 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 25 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 25 ms :[(NOT p1)]
Support contains 1 out of 158 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 158/158 places, 125/125 transitions.
Applied a total of 0 rules in 4 ms. Remains 158 /158 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2024-06-01 07:17:34] [INFO ] Flow matrix only has 124 transitions (discarded 1 similar events)
[2024-06-01 07:17:34] [INFO ] Invariant cache hit.
[2024-06-01 07:17:34] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-06-01 07:17:34] [INFO ] Flow matrix only has 124 transitions (discarded 1 similar events)
[2024-06-01 07:17:34] [INFO ] Invariant cache hit.
[2024-06-01 07:17:34] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-06-01 07:17:34] [INFO ] Implicit Places using invariants and state equation in 174 ms returned [5, 17, 19, 21, 23, 25, 44, 46, 48, 56, 90, 92, 94, 96, 98, 100, 102, 107, 108, 109, 137, 139]
Discarding 22 places :
Implicit Place search using SMT with State Equation took 277 ms to find 22 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 136/158 places, 125/125 transitions.
Graph (complete) has 436 edges and 136 vertex of which 127 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.0 ms
Discarding 9 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 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 5 place count 127 transition count 117
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 9 place count 123 transition count 117
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 11 place count 121 transition count 114
Iterating global reduction 2 with 2 rules applied. Total rules applied 13 place count 121 transition count 114
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 14 place count 121 transition count 113
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 15 place count 120 transition count 113
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 16 place count 119 transition count 112
Iterating global reduction 4 with 1 rules applied. Total rules applied 17 place count 119 transition count 112
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 19 place count 119 transition count 110
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 20 place count 118 transition count 110
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 24 place count 116 transition count 108
Applied a total of 24 rules in 12 ms. Remains 116 /136 variables (removed 20) and now considering 108/125 (removed 17) transitions.
[2024-06-01 07:17:34] [INFO ] Flow matrix only has 107 transitions (discarded 1 similar events)
// Phase 1: matrix 107 rows 116 cols
[2024-06-01 07:17:34] [INFO ] Computed 34 invariants in 1 ms
[2024-06-01 07:17:34] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-06-01 07:17:34] [INFO ] Flow matrix only has 107 transitions (discarded 1 similar events)
[2024-06-01 07:17:34] [INFO ] Invariant cache hit.
[2024-06-01 07:17:34] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-06-01 07:17:34] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 193 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 116/158 places, 108/125 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 487 ms. Remains : 116/158 places, 108/125 transitions.
Computed a total of 43 stabilizing places and 56 stable transitions
Computed a total of 43 stabilizing places and 56 stable transitions
Detected a total of 43/116 stabilizing places and 56/108 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p1, (X p1), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 70 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(NOT p1)]
RANDOM walk for 8426 steps (1536 resets) in 37 ms. (221 steps per ms) remains 0/1 properties
Knowledge obtained : [p1, (X p1), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 4 factoid took 88 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 27 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 25 ms :[(NOT p1)]
Product exploration explored 100000 steps with 16313 reset in 162 ms.
Product exploration explored 100000 steps with 16276 reset in 176 ms.
Support contains 1 out of 116 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 116/116 places, 108/108 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 116 transition count 107
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 115 transition count 107
Applied a total of 2 rules in 3 ms. Remains 115 /116 variables (removed 1) and now considering 107/108 (removed 1) transitions.
[2024-06-01 07:17:35] [INFO ] Flow matrix only has 106 transitions (discarded 1 similar events)
// Phase 1: matrix 106 rows 115 cols
[2024-06-01 07:17:35] [INFO ] Computed 34 invariants in 1 ms
[2024-06-01 07:17:35] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-06-01 07:17:35] [INFO ] Flow matrix only has 106 transitions (discarded 1 similar events)
[2024-06-01 07:17:35] [INFO ] Invariant cache hit.
[2024-06-01 07:17:35] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-06-01 07:17:35] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 227 ms to find 0 implicit places.
[2024-06-01 07:17:35] [INFO ] Redundant transitions in 2 ms returned []
Running 100 sub problems to find dead transitions.
[2024-06-01 07:17:35] [INFO ] Flow matrix only has 106 transitions (discarded 1 similar events)
[2024-06-01 07:17:35] [INFO ] Invariant cache hit.
[2024-06-01 07:17:35] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/114 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (OVERLAPS) 1/115 variables, 27/32 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/115 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/115 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 100 unsolved
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
At refinement iteration 5 (OVERLAPS) 105/220 variables, 115/149 constraints. Problems are: Problem set: 12 solved, 88 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/220 variables, 6/155 constraints. Problems are: Problem set: 12 solved, 88 unsolved
[2024-06-01 07:17:37] [INFO ] Deduced a trap composed of 34 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:17:37] [INFO ] Deduced a trap composed of 35 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:17:37] [INFO ] Deduced a trap composed of 36 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:17:37] [INFO ] Deduced a trap composed of 37 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:17:37] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:17:37] [INFO ] Deduced a trap composed of 35 places in 47 ms of which 0 ms to minimize.
[2024-06-01 07:17:37] [INFO ] Deduced a trap composed of 35 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:17:37] [INFO ] Deduced a trap composed of 35 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:17:37] [INFO ] Deduced a trap composed of 35 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:17:37] [INFO ] Deduced a trap composed of 35 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:17:37] [INFO ] Deduced a trap composed of 35 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:17:37] [INFO ] Deduced a trap composed of 35 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:17:37] [INFO ] Deduced a trap composed of 32 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:17:37] [INFO ] Deduced a trap composed of 34 places in 44 ms of which 0 ms to minimize.
[2024-06-01 07:17:38] [INFO ] Deduced a trap composed of 32 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:17:38] [INFO ] Deduced a trap composed of 34 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:17:38] [INFO ] Deduced a trap composed of 34 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:17:38] [INFO ] Deduced a trap composed of 33 places in 53 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/220 variables, 18/173 constraints. Problems are: Problem set: 12 solved, 88 unsolved
[2024-06-01 07:17:38] [INFO ] Deduced a trap composed of 31 places in 30 ms of which 1 ms to minimize.
[2024-06-01 07:17:38] [INFO ] Deduced a trap composed of 35 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:17:38] [INFO ] Deduced a trap composed of 33 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:17:38] [INFO ] Deduced a trap composed of 37 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:17:38] [INFO ] Deduced a trap composed of 34 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:17:38] [INFO ] Deduced a trap composed of 32 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:17:38] [INFO ] Deduced a trap composed of 33 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:17:38] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:17:38] [INFO ] Deduced a trap composed of 34 places in 46 ms of which 0 ms to minimize.
[2024-06-01 07:17:38] [INFO ] Deduced a trap composed of 32 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:17:38] [INFO ] Deduced a trap composed of 32 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:17:38] [INFO ] Deduced a trap composed of 35 places in 31 ms of which 0 ms to minimize.
[2024-06-01 07:17:39] [INFO ] Deduced a trap composed of 33 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:17:39] [INFO ] Deduced a trap composed of 37 places in 31 ms of which 0 ms to minimize.
[2024-06-01 07:17:39] [INFO ] Deduced a trap composed of 32 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:17:39] [INFO ] Deduced a trap composed of 33 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:17:39] [INFO ] Deduced a trap composed of 33 places in 43 ms of which 0 ms to minimize.
[2024-06-01 07:17:39] [INFO ] Deduced a trap composed of 32 places in 30 ms of which 1 ms to minimize.
[2024-06-01 07:17:39] [INFO ] Deduced a trap composed of 33 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:17:39] [INFO ] Deduced a trap composed of 33 places in 45 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/220 variables, 20/193 constraints. Problems are: Problem set: 12 solved, 88 unsolved
[2024-06-01 07:17:39] [INFO ] Deduced a trap composed of 32 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:17:39] [INFO ] Deduced a trap composed of 33 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:17:39] [INFO ] Deduced a trap composed of 35 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:17:39] [INFO ] Deduced a trap composed of 32 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:17:39] [INFO ] Deduced a trap composed of 34 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:17:39] [INFO ] Deduced a trap composed of 34 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:17:39] [INFO ] Deduced a trap composed of 34 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:17:39] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:17:40] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:17:40] [INFO ] Deduced a trap composed of 37 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:17:40] [INFO ] Deduced a trap composed of 37 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:17:40] [INFO ] Deduced a trap composed of 35 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:17:40] [INFO ] Deduced a trap composed of 37 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:17:40] [INFO ] Deduced a trap composed of 35 places in 44 ms of which 0 ms to minimize.
[2024-06-01 07:17:40] [INFO ] Deduced a trap composed of 37 places in 46 ms of which 0 ms to minimize.
[2024-06-01 07:17:40] [INFO ] Deduced a trap composed of 34 places in 45 ms of which 0 ms to minimize.
[2024-06-01 07:17:40] [INFO ] Deduced a trap composed of 37 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:17:40] [INFO ] Deduced a trap composed of 36 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:17:40] [INFO ] Deduced a trap composed of 36 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:17:40] [INFO ] Deduced a trap composed of 34 places in 53 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/220 variables, 20/213 constraints. Problems are: Problem set: 12 solved, 88 unsolved
[2024-06-01 07:17:42] [INFO ] Deduced a trap composed of 37 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:17:42] [INFO ] Deduced a trap composed of 37 places in 52 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/220 variables, 2/215 constraints. Problems are: Problem set: 12 solved, 88 unsolved
[2024-06-01 07:17:42] [INFO ] Deduced a trap composed of 35 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:17:42] [INFO ] Deduced a trap composed of 32 places in 67 ms of which 2 ms to minimize.
[2024-06-01 07:17:42] [INFO ] Deduced a trap composed of 33 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:17:42] [INFO ] Deduced a trap composed of 32 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:17:42] [INFO ] Deduced a trap composed of 34 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:17:42] [INFO ] Deduced a trap composed of 34 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:17:43] [INFO ] Deduced a trap composed of 33 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:17:43] [INFO ] Deduced a trap composed of 34 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:17:43] [INFO ] Deduced a trap composed of 32 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:17:43] [INFO ] Deduced a trap composed of 33 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:17:43] [INFO ] Deduced a trap composed of 32 places in 95 ms of which 1 ms to minimize.
[2024-06-01 07:17:43] [INFO ] Deduced a trap composed of 32 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:17:43] [INFO ] Deduced a trap composed of 32 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:17:43] [INFO ] Deduced a trap composed of 33 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:17:43] [INFO ] Deduced a trap composed of 34 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:17:43] [INFO ] Deduced a trap composed of 35 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:17:43] [INFO ] Deduced a trap composed of 37 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:17:43] [INFO ] Deduced a trap composed of 35 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:17:43] [INFO ] Deduced a trap composed of 35 places in 44 ms of which 2 ms to minimize.
[2024-06-01 07:17:43] [INFO ] Deduced a trap composed of 33 places in 45 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/220 variables, 20/235 constraints. Problems are: Problem set: 12 solved, 88 unsolved
[2024-06-01 07:17:44] [INFO ] Deduced a trap composed of 38 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:17:44] [INFO ] Deduced a trap composed of 36 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:17:44] [INFO ] Deduced a trap composed of 33 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:17:44] [INFO ] Deduced a trap composed of 36 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:17:44] [INFO ] Deduced a trap composed of 37 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:17:44] [INFO ] Deduced a trap composed of 35 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:17:44] [INFO ] Deduced a trap composed of 36 places in 56 ms of which 0 ms to minimize.
[2024-06-01 07:17:44] [INFO ] Deduced a trap composed of 36 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:17:44] [INFO ] Deduced a trap composed of 38 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:17:45] [INFO ] Deduced a trap composed of 38 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:17:45] [INFO ] Deduced a trap composed of 38 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:17:45] [INFO ] Deduced a trap composed of 36 places in 56 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/220 variables, 12/247 constraints. Problems are: Problem set: 12 solved, 88 unsolved
[2024-06-01 07:17:45] [INFO ] Deduced a trap composed of 33 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:17:45] [INFO ] Deduced a trap composed of 35 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:17:45] [INFO ] Deduced a trap composed of 32 places in 48 ms of which 0 ms to minimize.
[2024-06-01 07:17:45] [INFO ] Deduced a trap composed of 32 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:17:45] [INFO ] Deduced a trap composed of 32 places in 47 ms of which 0 ms to minimize.
[2024-06-01 07:17:46] [INFO ] Deduced a trap composed of 36 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:17:46] [INFO ] Deduced a trap composed of 34 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:17:46] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:17:46] [INFO ] Deduced a trap composed of 35 places in 54 ms of which 0 ms to minimize.
[2024-06-01 07:17:46] [INFO ] Deduced a trap composed of 37 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:17:46] [INFO ] Deduced a trap composed of 35 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:17:46] [INFO ] Deduced a trap composed of 36 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:17:46] [INFO ] Deduced a trap composed of 35 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:17:46] [INFO ] Deduced a trap composed of 36 places in 48 ms of which 0 ms to minimize.
[2024-06-01 07:17:46] [INFO ] Deduced a trap composed of 37 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:17:46] [INFO ] Deduced a trap composed of 35 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:17:46] [INFO ] Deduced a trap composed of 34 places in 47 ms of which 0 ms to minimize.
[2024-06-01 07:17:46] [INFO ] Deduced a trap composed of 36 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:17:46] [INFO ] Deduced a trap composed of 36 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:17:46] [INFO ] Deduced a trap composed of 36 places in 55 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/220 variables, 20/267 constraints. Problems are: Problem set: 12 solved, 88 unsolved
[2024-06-01 07:17:47] [INFO ] Deduced a trap composed of 33 places in 43 ms of which 0 ms to minimize.
[2024-06-01 07:17:47] [INFO ] Deduced a trap composed of 35 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:17:47] [INFO ] Deduced a trap composed of 34 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:17:47] [INFO ] Deduced a trap composed of 35 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:17:47] [INFO ] Deduced a trap composed of 37 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:17:47] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:17:47] [INFO ] Deduced a trap composed of 37 places in 46 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/220 variables, 7/274 constraints. Problems are: Problem set: 12 solved, 88 unsolved
[2024-06-01 07:17:47] [INFO ] Deduced a trap composed of 33 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:17:48] [INFO ] Deduced a trap composed of 34 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:17:48] [INFO ] Deduced a trap composed of 33 places in 43 ms of which 0 ms to minimize.
[2024-06-01 07:17:48] [INFO ] Deduced a trap composed of 32 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:17:48] [INFO ] Deduced a trap composed of 32 places in 57 ms of which 0 ms to minimize.
[2024-06-01 07:17:48] [INFO ] Deduced a trap composed of 33 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:17:48] [INFO ] Deduced a trap composed of 33 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:17:48] [INFO ] Deduced a trap composed of 33 places in 45 ms of which 0 ms to minimize.
[2024-06-01 07:17:48] [INFO ] Deduced a trap composed of 34 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:17:48] [INFO ] Deduced a trap composed of 34 places in 50 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/220 variables, 10/284 constraints. Problems are: Problem set: 12 solved, 88 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/220 variables, 0/284 constraints. Problems are: Problem set: 12 solved, 88 unsolved
At refinement iteration 17 (OVERLAPS) 0/220 variables, 0/284 constraints. Problems are: Problem set: 12 solved, 88 unsolved
No progress, stopping.
After SMT solving in domain Real declared 220/221 variables, and 284 constraints, problems are : Problem set: 12 solved, 88 unsolved in 14196 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 115/115 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 129/129 constraints]
Escalating to Integer solving :Problem set: 12 solved, 88 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 5/5 constraints. Problems are: Problem set: 12 solved, 88 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/114 variables, 75/80 constraints. Problems are: Problem set: 12 solved, 88 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 0/80 constraints. Problems are: Problem set: 12 solved, 88 unsolved
At refinement iteration 3 (OVERLAPS) 1/115 variables, 27/107 constraints. Problems are: Problem set: 12 solved, 88 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/115 variables, 2/109 constraints. Problems are: Problem set: 12 solved, 88 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/115 variables, 54/163 constraints. Problems are: Problem set: 12 solved, 88 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/115 variables, 0/163 constraints. Problems are: Problem set: 12 solved, 88 unsolved
At refinement iteration 7 (OVERLAPS) 105/220 variables, 115/278 constraints. Problems are: Problem set: 12 solved, 88 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/220 variables, 6/284 constraints. Problems are: Problem set: 12 solved, 88 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/220 variables, 88/372 constraints. Problems are: Problem set: 12 solved, 88 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/220 variables, 0/372 constraints. Problems are: Problem set: 12 solved, 88 unsolved
[2024-06-01 07:17:54] [INFO ] Deduced a trap composed of 33 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:17:54] [INFO ] Deduced a trap composed of 33 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:17:54] [INFO ] Deduced a trap composed of 33 places in 50 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/220 variables, 3/375 constraints. Problems are: Problem set: 12 solved, 88 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/220 variables, 0/375 constraints. Problems are: Problem set: 12 solved, 88 unsolved
[2024-06-01 07:18:00] [INFO ] Deduced a trap composed of 34 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:18:00] [INFO ] Deduced a trap composed of 33 places in 72 ms of which 1 ms to minimize.
[2024-06-01 07:18:00] [INFO ] Deduced a trap composed of 33 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:18:00] [INFO ] Deduced a trap composed of 33 places in 60 ms of which 2 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/220 variables, 4/379 constraints. Problems are: Problem set: 12 solved, 88 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/220 variables, 0/379 constraints. Problems are: Problem set: 12 solved, 88 unsolved
At refinement iteration 15 (OVERLAPS) 0/220 variables, 0/379 constraints. Problems are: Problem set: 12 solved, 88 unsolved
No progress, stopping.
After SMT solving in domain Int declared 220/221 variables, and 379 constraints, problems are : Problem set: 12 solved, 88 unsolved in 19569 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 115/115 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 88/100 constraints, Known Traps: 136/136 constraints]
After SMT, in 33844ms problems are : Problem set: 12 solved, 88 unsolved
Search for dead transitions found 12 dead transitions in 33845ms
Found 12 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 12 transitions
Dead transitions reduction (with SMT) removed 12 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 115/116 places, 95/108 transitions.
Ensure Unique test removed 2 places
Applied a total of 0 rules in 5 ms. Remains 113 /115 variables (removed 2) and now considering 95/95 (removed 0) transitions.
[2024-06-01 07:18:09] [INFO ] Redundant transitions in 1 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 34095 ms. Remains : 113/116 places, 95/108 transitions.
Treatment of property BusinessProcesses-PT-20-LTLCardinality-12 finished in 37436 ms.
[2024-06-01 07:18:09] [INFO ] Flatten gal took : 24 ms
[2024-06-01 07:18:09] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-06-01 07:18:09] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 547 places, 456 transitions and 1385 arcs took 6 ms.
Total runtime 118458 ms.
There are residual formulas that ITS could not solve within timeout
Could not compute solution for formula : BusinessProcesses-PT-20-LTLCardinality-12

BK_STOP 1717226415622

--------------------
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 LTLCardinality -timeout 360 -rebuildPNML
mcc2024
ltl formula name BusinessProcesses-PT-20-LTLCardinality-12
ltl formula formula --ltl=/tmp/2196/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 547 places, 456 transitions and 1385 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.160 real 0.020 user 0.020 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2196/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2196/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2196/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2196/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): There are 548 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 548, there are 474 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4): ~177 levels ~10000 states ~45540 transitions
pnml2lts-mc( 2/ 4): ~252 levels ~20000 states ~90408 transitions
pnml2lts-mc( 2/ 4): ~252 levels ~40000 states ~187536 transitions
pnml2lts-mc( 2/ 4): ~633 levels ~80000 states ~384952 transitions
pnml2lts-mc( 2/ 4): ~633 levels ~160000 states ~808804 transitions
pnml2lts-mc( 2/ 4): ~641 levels ~320000 states ~1667652 transitions
pnml2lts-mc( 2/ 4): ~660 levels ~640000 states ~3427044 transitions
pnml2lts-mc( 2/ 4): ~660 levels ~1280000 states ~7513648 transitions
pnml2lts-mc( 3/ 4): ~177 levels ~2560000 states ~19899528 transitions
pnml2lts-mc( 3/ 4): ~177 levels ~5120000 states ~42145224 transitions
pnml2lts-mc( 3/ 4): ~177 levels ~10240000 states ~89372596 transitions
pnml2lts-mc( 0/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 10063997
pnml2lts-mc( 0/ 4): unique states count: 10584533
pnml2lts-mc( 0/ 4): unique transitions count: 89622330
pnml2lts-mc( 0/ 4): - self-loop count: 126
pnml2lts-mc( 0/ 4): - claim dead count: 78826193
pnml2lts-mc( 0/ 4): - claim found count: 207848
pnml2lts-mc( 0/ 4): - claim success count: 10584543
pnml2lts-mc( 0/ 4): - cum. max stack depth: 1190
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 10584543 states 89622352 transitions, fanout: 8.467
pnml2lts-mc( 0/ 4): Total exploration time 125.180 sec (125.170 sec minimum, 125.175 sec on average)
pnml2lts-mc( 0/ 4): States per second: 84555, Transitions per second: 715948
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 144.8MB, 14.3 B/state, compr.: 0.7%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 31.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 459 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 144.8MB (~256.0MB paged-in)

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="BusinessProcesses-PT-20"
export BK_EXAMINATION="LTLCardinality"
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 BusinessProcesses-PT-20, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r472-tajo-171620399900603"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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