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.r048-tajo-171620399700507.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 itstools
Input is BusinessProcesses-PT-08, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r048-tajo-171620399700507
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 588K
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K 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.7K Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 11 16:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 161K Apr 11 16:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Apr 11 16:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Apr 11 16:26 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 91K 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-08-LTLCardinality-00
FORMULA_NAME BusinessProcesses-PT-08-LTLCardinality-01
FORMULA_NAME BusinessProcesses-PT-08-LTLCardinality-02
FORMULA_NAME BusinessProcesses-PT-08-LTLCardinality-03
FORMULA_NAME BusinessProcesses-PT-08-LTLCardinality-04
FORMULA_NAME BusinessProcesses-PT-08-LTLCardinality-05
FORMULA_NAME BusinessProcesses-PT-08-LTLCardinality-06
FORMULA_NAME BusinessProcesses-PT-08-LTLCardinality-07
FORMULA_NAME BusinessProcesses-PT-08-LTLCardinality-08
FORMULA_NAME BusinessProcesses-PT-08-LTLCardinality-09
FORMULA_NAME BusinessProcesses-PT-08-LTLCardinality-10
FORMULA_NAME BusinessProcesses-PT-08-LTLCardinality-11
FORMULA_NAME BusinessProcesses-PT-08-LTLCardinality-12
FORMULA_NAME BusinessProcesses-PT-08-LTLCardinality-13
FORMULA_NAME BusinessProcesses-PT-08-LTLCardinality-14
FORMULA_NAME BusinessProcesses-PT-08-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716334270351

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-08
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-05-21 23:31:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 23:31:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 23:31:11] [INFO ] Load time of PNML (sax parser for PT used): 72 ms
[2024-05-21 23:31:11] [INFO ] Transformed 393 places.
[2024-05-21 23:31:11] [INFO ] Transformed 344 transitions.
[2024-05-21 23:31:11] [INFO ] Found NUPN structural information;
[2024-05-21 23:31:11] [INFO ] Parsed PT model containing 393 places and 344 transitions and 911 arcs in 171 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 13 places in 11 ms
Reduce places removed 13 places and 13 transitions.
FORMULA BusinessProcesses-PT-08-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-08-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-08-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-08-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-08-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-08-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-08-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-08-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-08-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-08-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 14 out of 380 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 380/380 places, 331/331 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 372 transition count 331
Discarding 66 places :
Symmetric choice reduction at 1 with 66 rule applications. Total rules 74 place count 306 transition count 265
Iterating global reduction 1 with 66 rules applied. Total rules applied 140 place count 306 transition count 265
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 141 place count 306 transition count 264
Discarding 38 places :
Symmetric choice reduction at 2 with 38 rule applications. Total rules 179 place count 268 transition count 226
Iterating global reduction 2 with 38 rules applied. Total rules applied 217 place count 268 transition count 226
Applied a total of 217 rules in 88 ms. Remains 268 /380 variables (removed 112) and now considering 226/331 (removed 105) transitions.
// Phase 1: matrix 226 rows 268 cols
[2024-05-21 23:31:12] [INFO ] Computed 50 invariants in 17 ms
[2024-05-21 23:31:12] [INFO ] Implicit Places using invariants in 227 ms returned []
[2024-05-21 23:31:12] [INFO ] Invariant cache hit.
[2024-05-21 23:31:12] [INFO ] Implicit Places using invariants and state equation in 200 ms returned []
Implicit Place search using SMT with State Equation took 456 ms to find 0 implicit places.
Running 225 sub problems to find dead transitions.
[2024-05-21 23:31:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/267 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 1 (OVERLAPS) 1/268 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-21 23:31:14] [INFO ] Deduced a trap composed of 13 places in 137 ms of which 20 ms to minimize.
[2024-05-21 23:31:14] [INFO ] Deduced a trap composed of 17 places in 119 ms of which 2 ms to minimize.
[2024-05-21 23:31:14] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:31:15] [INFO ] Deduced a trap composed of 16 places in 331 ms of which 2 ms to minimize.
[2024-05-21 23:31:15] [INFO ] Deduced a trap composed of 14 places in 184 ms of which 3 ms to minimize.
[2024-05-21 23:31:15] [INFO ] Deduced a trap composed of 15 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:31:15] [INFO ] Deduced a trap composed of 18 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:31:15] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:31:15] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 2 ms to minimize.
[2024-05-21 23:31:15] [INFO ] Deduced a trap composed of 24 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:31:15] [INFO ] Deduced a trap composed of 30 places in 50 ms of which 2 ms to minimize.
[2024-05-21 23:31:15] [INFO ] Deduced a trap composed of 22 places in 78 ms of which 1 ms to minimize.
[2024-05-21 23:31:16] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:31:16] [INFO ] Deduced a trap composed of 29 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:31:16] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:31:16] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:31:16] [INFO ] Deduced a trap composed of 18 places in 94 ms of which 1 ms to minimize.
[2024-05-21 23:31:17] [INFO ] Deduced a trap composed of 33 places in 344 ms of which 1 ms to minimize.
[2024-05-21 23:31:17] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:31:17] [INFO ] Deduced a trap composed of 41 places in 60 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/268 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-21 23:31:17] [INFO ] Deduced a trap composed of 44 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:31:18] [INFO ] Deduced a trap composed of 36 places in 98 ms of which 14 ms to minimize.
[2024-05-21 23:31:18] [INFO ] Deduced a trap composed of 38 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:31:18] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:31:18] [INFO ] Deduced a trap composed of 26 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:31:18] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 2 ms to minimize.
[2024-05-21 23:31:18] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:31:18] [INFO ] Deduced a trap composed of 36 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:31:18] [INFO ] Deduced a trap composed of 27 places in 65 ms of which 2 ms to minimize.
[2024-05-21 23:31:18] [INFO ] Deduced a trap composed of 31 places in 38 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/268 variables, 10/80 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-21 23:31:20] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:31:20] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/268 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/268 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 6 (OVERLAPS) 226/494 variables, 268/350 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-21 23:31:24] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 2 ms to minimize.
[2024-05-21 23:31:24] [INFO ] Deduced a trap composed of 11 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:31:24] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 5 ms to minimize.
[2024-05-21 23:31:24] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:31:25] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 1 ms to minimize.
[2024-05-21 23:31:25] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 2 ms to minimize.
[2024-05-21 23:31:25] [INFO ] Deduced a trap composed of 15 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:31:25] [INFO ] Deduced a trap composed of 27 places in 35 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/494 variables, 8/358 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/494 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 9 (OVERLAPS) 0/494 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 225 unsolved
No progress, stopping.
After SMT solving in domain Real declared 494/494 variables, and 358 constraints, problems are : Problem set: 0 solved, 225 unsolved in 17858 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 268/268 constraints, PredecessorRefiner: 225/225 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 225 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/267 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 1 (OVERLAPS) 1/268 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/268 variables, 40/90 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/268 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 4 (OVERLAPS) 226/494 variables, 268/358 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/494 variables, 225/583 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/494 variables, 0/583 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-21 23:31:39] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:31:39] [INFO ] Deduced a trap composed of 32 places in 30 ms of which 1 ms to minimize.
[2024-05-21 23:31:39] [INFO ] Deduced a trap composed of 24 places in 21 ms of which 1 ms to minimize.
[2024-05-21 23:31:41] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/494 variables, 4/587 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-21 23:31:46] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/494 variables, 1/588 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/494 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-05-21 23:31:59] [INFO ] Deduced a trap composed of 28 places in 64 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 494/494 variables, and 589 constraints, problems are : Problem set: 0 solved, 225 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 268/268 constraints, PredecessorRefiner: 225/225 constraints, Known Traps: 46/46 constraints]
After SMT, in 47953ms problems are : Problem set: 0 solved, 225 unsolved
Search for dead transitions found 0 dead transitions in 47968ms
Starting structural reductions in LTL mode, iteration 1 : 268/380 places, 226/331 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48531 ms. Remains : 268/380 places, 226/331 transitions.
Support contains 14 out of 268 places after structural reductions.
[2024-05-21 23:32:00] [INFO ] Flatten gal took : 51 ms
[2024-05-21 23:32:00] [INFO ] Flatten gal took : 39 ms
[2024-05-21 23:32:00] [INFO ] Input system was already deterministic with 226 transitions.
RANDOM walk for 40000 steps (343 resets) in 1413 ms. (28 steps per ms) remains 2/7 properties
BEST_FIRST walk for 40002 steps (62 resets) in 173 ms. (229 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (60 resets) in 78 ms. (506 steps per ms) remains 2/2 properties
[2024-05-21 23:32:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 22/24 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 220/244 variables, 48/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 23:32:02] [INFO ] Deduced a trap composed of 17 places in 345 ms of which 1 ms to minimize.
[2024-05-21 23:32:02] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:32:02] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/244 variables, 3/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/244 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 204/448 variables, 244/297 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/448 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 35/483 variables, 15/312 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 23:32:02] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/483 variables, 1/313 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/483 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 11/494 variables, 9/322 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/494 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/494 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 494/494 variables, and 322 constraints, problems are : Problem set: 0 solved, 2 unsolved in 880 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 268/268 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 22/24 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 220/244 variables, 48/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/244 variables, 4/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 23:32:02] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 0 ms to minimize.
[2024-05-21 23:32:02] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 4 ms to minimize.
[2024-05-21 23:32:02] [INFO ] Deduced a trap composed of 26 places in 28 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/244 variables, 3/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/244 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 204/448 variables, 244/301 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/448 variables, 1/302 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/448 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 35/483 variables, 15/317 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/483 variables, 1/318 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/483 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 11/494 variables, 9/327 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/494 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/494 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 494/494 variables, and 327 constraints, problems are : Problem set: 0 solved, 2 unsolved in 376 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 268/268 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 7/7 constraints]
After SMT, in 1261ms problems are : Problem set: 0 solved, 2 unsolved
Finished Parikh walk after 9118 steps, including 71 resets, run visited all 2 properties in 32 ms. (steps per millisecond=284 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 2 properties in 48 ms.
FORMULA BusinessProcesses-PT-08-LTLCardinality-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA BusinessProcesses-PT-08-LTLCardinality-13 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 90 stabilizing places and 86 stable transitions
Graph (complete) has 566 edges and 268 vertex of which 267 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 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)))'
Support contains 2 out of 268 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 268/268 places, 226/226 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 264 transition count 222
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 264 transition count 222
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 261 transition count 219
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 261 transition count 219
Applied a total of 14 rules in 21 ms. Remains 261 /268 variables (removed 7) and now considering 219/226 (removed 7) transitions.
// Phase 1: matrix 219 rows 261 cols
[2024-05-21 23:32:03] [INFO ] Computed 50 invariants in 2 ms
[2024-05-21 23:32:03] [INFO ] Implicit Places using invariants in 173 ms returned []
[2024-05-21 23:32:03] [INFO ] Invariant cache hit.
[2024-05-21 23:32:03] [INFO ] Implicit Places using invariants and state equation in 179 ms returned []
Implicit Place search using SMT with State Equation took 366 ms to find 0 implicit places.
Running 218 sub problems to find dead transitions.
[2024-05-21 23:32:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/260 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (OVERLAPS) 1/261 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-21 23:32:05] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 2 ms to minimize.
[2024-05-21 23:32:05] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:32:05] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 8 ms to minimize.
[2024-05-21 23:32:05] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:32:05] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:32:05] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 2 ms to minimize.
[2024-05-21 23:32:05] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:32:05] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:32:05] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:32:05] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:32:05] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 2 ms to minimize.
[2024-05-21 23:32:05] [INFO ] Deduced a trap composed of 39 places in 43 ms of which 2 ms to minimize.
[2024-05-21 23:32:05] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:32:05] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 2 ms to minimize.
[2024-05-21 23:32:06] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:32:06] [INFO ] Deduced a trap composed of 36 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:32:06] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:32:06] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:32:06] [INFO ] Deduced a trap composed of 34 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:32:06] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/261 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-21 23:32:07] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:32:07] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/261 variables, 2/72 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-21 23:32:08] [INFO ] Deduced a trap composed of 16 places in 82 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/261 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/261 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 6 (OVERLAPS) 219/480 variables, 261/334 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-21 23:32:12] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:32:12] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 0 ms to minimize.
[2024-05-21 23:32:12] [INFO ] Deduced a trap composed of 34 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:32:12] [INFO ] Deduced a trap composed of 8 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:32:12] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:32:12] [INFO ] Deduced a trap composed of 12 places in 112 ms of which 3 ms to minimize.
[2024-05-21 23:32:13] [INFO ] Deduced a trap composed of 34 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:32:13] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:32:13] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 2 ms to minimize.
[2024-05-21 23:32:13] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/480 variables, 10/344 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/480 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 9 (OVERLAPS) 0/480 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Real declared 480/480 variables, and 344 constraints, problems are : Problem set: 0 solved, 218 unsolved in 14551 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 261/261 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 33/33 constraints]
Escalating to Integer solving :Problem set: 0 solved, 218 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/260 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (OVERLAPS) 1/261 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/261 variables, 33/83 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/261 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (OVERLAPS) 219/480 variables, 261/344 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/480 variables, 218/562 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-21 23:32:20] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 1 ms to minimize.
[2024-05-21 23:32:21] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:32:21] [INFO ] Deduced a trap composed of 33 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:32:23] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/480 variables, 4/566 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-21 23:32:26] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/480 variables, 1/567 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/480 variables, 0/567 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 9 (OVERLAPS) 0/480 variables, 0/567 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Int declared 480/480 variables, and 567 constraints, problems are : Problem set: 0 solved, 218 unsolved in 24862 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 261/261 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 38/38 constraints]
After SMT, in 39453ms problems are : Problem set: 0 solved, 218 unsolved
Search for dead transitions found 0 dead transitions in 39456ms
Starting structural reductions in LTL mode, iteration 1 : 261/268 places, 219/226 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39844 ms. Remains : 261/268 places, 219/226 transitions.
Stuttering acceptance computed with spot in 288 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-08-LTLCardinality-00
Product exploration explored 100000 steps with 50000 reset in 290 ms.
Product exploration explored 100000 steps with 50000 reset in 182 ms.
Computed a total of 90 stabilizing places and 86 stable transitions
Graph (complete) has 555 edges and 261 vertex of which 260 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.7 ms
Computed a total of 90 stabilizing places and 86 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 32 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-08-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-08-LTLCardinality-00 finished in 40710 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' '!(F(G(p0)))'
Support contains 2 out of 268 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 268/268 places, 226/226 transitions.
Graph (complete) has 566 edges and 268 vertex of which 267 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 33 place count 266 transition count 192
Reduce places removed 32 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 34 rules applied. Total rules applied 67 place count 234 transition count 190
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 69 place count 232 transition count 190
Performed 55 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 55 Pre rules applied. Total rules applied 69 place count 232 transition count 135
Deduced a syphon composed of 55 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 3 with 120 rules applied. Total rules applied 189 place count 167 transition count 135
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 194 place count 162 transition count 130
Iterating global reduction 3 with 5 rules applied. Total rules applied 199 place count 162 transition count 130
Performed 79 Post agglomeration using F-continuation condition.Transition count delta: 79
Deduced a syphon composed of 79 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 82 places and 0 transitions.
Iterating global reduction 3 with 161 rules applied. Total rules applied 360 place count 80 transition count 51
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 361 place count 80 transition count 50
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 362 place count 79 transition count 49
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 363 place count 78 transition count 49
Applied a total of 363 rules in 110 ms. Remains 78 /268 variables (removed 190) and now considering 49/226 (removed 177) transitions.
// Phase 1: matrix 49 rows 78 cols
[2024-05-21 23:32:43] [INFO ] Computed 36 invariants in 0 ms
[2024-05-21 23:32:44] [INFO ] Implicit Places using invariants in 304 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 312 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 77/268 places, 49/226 transitions.
Applied a total of 0 rules in 2 ms. Remains 77 /77 variables (removed 0) and now considering 49/49 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 424 ms. Remains : 77/268 places, 49/226 transitions.
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-08-LTLCardinality-02
Stuttering criterion allowed to conclude after 20 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-08-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-08-LTLCardinality-02 finished in 507 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(X(F(p0))))'
Support contains 2 out of 268 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 268/268 places, 226/226 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 264 transition count 222
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 264 transition count 222
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 261 transition count 219
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 261 transition count 219
Applied a total of 14 rules in 7 ms. Remains 261 /268 variables (removed 7) and now considering 219/226 (removed 7) transitions.
// Phase 1: matrix 219 rows 261 cols
[2024-05-21 23:32:44] [INFO ] Computed 50 invariants in 1 ms
[2024-05-21 23:32:44] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-05-21 23:32:44] [INFO ] Invariant cache hit.
[2024-05-21 23:32:44] [INFO ] Implicit Places using invariants and state equation in 242 ms returned []
Implicit Place search using SMT with State Equation took 330 ms to find 0 implicit places.
Running 218 sub problems to find dead transitions.
[2024-05-21 23:32:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/260 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (OVERLAPS) 1/261 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-21 23:32:46] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 1 ms to minimize.
[2024-05-21 23:32:46] [INFO ] Deduced a trap composed of 12 places in 71 ms of which 1 ms to minimize.
[2024-05-21 23:32:46] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:32:46] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:32:46] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 2 ms to minimize.
[2024-05-21 23:32:46] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:32:46] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:32:46] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 2 ms to minimize.
[2024-05-21 23:32:46] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 3 ms to minimize.
[2024-05-21 23:32:46] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:32:47] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 2 ms to minimize.
[2024-05-21 23:32:47] [INFO ] Deduced a trap composed of 39 places in 59 ms of which 2 ms to minimize.
[2024-05-21 23:32:47] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:32:47] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:32:47] [INFO ] Deduced a trap composed of 18 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:32:47] [INFO ] Deduced a trap composed of 32 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:32:47] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:32:47] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 7 ms to minimize.
[2024-05-21 23:32:47] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:32:48] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/261 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-21 23:32:48] [INFO ] Deduced a trap composed of 40 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:32:48] [INFO ] Deduced a trap composed of 38 places in 74 ms of which 1 ms to minimize.
[2024-05-21 23:32:48] [INFO ] Deduced a trap composed of 24 places in 68 ms of which 1 ms to minimize.
[2024-05-21 23:32:49] [INFO ] Deduced a trap composed of 38 places in 71 ms of which 1 ms to minimize.
[2024-05-21 23:32:49] [INFO ] Deduced a trap composed of 37 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:32:49] [INFO ] Deduced a trap composed of 26 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:32:49] [INFO ] Deduced a trap composed of 30 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:32:49] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/261 variables, 8/78 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-21 23:32:51] [INFO ] Deduced a trap composed of 27 places in 26 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/261 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/261 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 6 (OVERLAPS) 219/480 variables, 261/340 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-21 23:32:54] [INFO ] Deduced a trap composed of 8 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:32:54] [INFO ] Deduced a trap composed of 11 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:32:54] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:32:55] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:32:55] [INFO ] Deduced a trap composed of 13 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:32:55] [INFO ] Deduced a trap composed of 12 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:32:55] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/480 variables, 7/347 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/480 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 9 (OVERLAPS) 0/480 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Real declared 480/480 variables, and 347 constraints, problems are : Problem set: 0 solved, 218 unsolved in 16858 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 261/261 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 36/36 constraints]
Escalating to Integer solving :Problem set: 0 solved, 218 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/260 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (OVERLAPS) 1/261 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/261 variables, 36/86 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/261 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (OVERLAPS) 219/480 variables, 261/347 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/480 variables, 218/565 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-21 23:33:06] [INFO ] Deduced a trap composed of 30 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:33:06] [INFO ] Deduced a trap composed of 30 places in 73 ms of which 1 ms to minimize.
[2024-05-21 23:33:07] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/480 variables, 3/568 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-21 23:33:10] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/480 variables, 1/569 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-21 23:33:16] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/480 variables, 1/570 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-21 23:33:21] [INFO ] Deduced a trap composed of 29 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:33:21] [INFO ] Deduced a trap composed of 34 places in 63 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/480 variables, 2/572 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-21 23:33:27] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/480 variables, 1/573 constraints. Problems are: Problem set: 0 solved, 218 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 480/480 variables, and 573 constraints, problems are : Problem set: 0 solved, 218 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 261/261 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 44/44 constraints]
After SMT, in 46926ms problems are : Problem set: 0 solved, 218 unsolved
Search for dead transitions found 0 dead transitions in 46934ms
Starting structural reductions in LTL mode, iteration 1 : 261/268 places, 219/226 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47274 ms. Remains : 261/268 places, 219/226 transitions.
Stuttering acceptance computed with spot in 152 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-08-LTLCardinality-10
Product exploration explored 100000 steps with 33333 reset in 122 ms.
Product exploration explored 100000 steps with 33333 reset in 123 ms.
Computed a total of 90 stabilizing places and 86 stable transitions
Graph (complete) has 557 edges and 261 vertex of which 260 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 90 stabilizing places and 86 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 26 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-08-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-08-LTLCardinality-10 finished in 47715 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' '!(F(G(X((X(p0) U p1)))))'
Support contains 3 out of 268 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 268/268 places, 226/226 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 264 transition count 222
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 264 transition count 222
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 261 transition count 219
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 261 transition count 219
Applied a total of 14 rules in 15 ms. Remains 261 /268 variables (removed 7) and now considering 219/226 (removed 7) transitions.
// Phase 1: matrix 219 rows 261 cols
[2024-05-21 23:33:31] [INFO ] Computed 50 invariants in 6 ms
[2024-05-21 23:33:32] [INFO ] Implicit Places using invariants in 155 ms returned []
[2024-05-21 23:33:32] [INFO ] Invariant cache hit.
[2024-05-21 23:33:32] [INFO ] Implicit Places using invariants and state equation in 243 ms returned []
Implicit Place search using SMT with State Equation took 401 ms to find 0 implicit places.
Running 218 sub problems to find dead transitions.
[2024-05-21 23:33:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/260 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (OVERLAPS) 1/261 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-21 23:33:34] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:33:34] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 1 ms to minimize.
[2024-05-21 23:33:34] [INFO ] Deduced a trap composed of 14 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:33:34] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:33:34] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 1 ms to minimize.
[2024-05-21 23:33:34] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:33:34] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 3 ms to minimize.
[2024-05-21 23:33:34] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:33:34] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 2 ms to minimize.
[2024-05-21 23:33:34] [INFO ] Deduced a trap composed of 24 places in 62 ms of which 2 ms to minimize.
[2024-05-21 23:33:34] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 2 ms to minimize.
[2024-05-21 23:33:35] [INFO ] Deduced a trap composed of 39 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:33:35] [INFO ] Deduced a trap composed of 30 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:33:35] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:33:35] [INFO ] Deduced a trap composed of 18 places in 65 ms of which 2 ms to minimize.
[2024-05-21 23:33:35] [INFO ] Deduced a trap composed of 37 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:33:35] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:33:35] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:33:36] [INFO ] Deduced a trap composed of 21 places in 69 ms of which 1 ms to minimize.
[2024-05-21 23:33:36] [INFO ] Deduced a trap composed of 34 places in 55 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/261 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-21 23:33:36] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 2 ms to minimize.
[2024-05-21 23:33:37] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:33:37] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/261 variables, 3/73 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/261 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (OVERLAPS) 219/480 variables, 261/334 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-21 23:33:39] [INFO ] Deduced a trap composed of 11 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:33:39] [INFO ] Deduced a trap composed of 8 places in 17 ms of which 1 ms to minimize.
[2024-05-21 23:33:39] [INFO ] Deduced a trap composed of 34 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:33:39] [INFO ] Deduced a trap composed of 8 places in 62 ms of which 2 ms to minimize.
[2024-05-21 23:33:39] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:33:40] [INFO ] Deduced a trap composed of 12 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:33:40] [INFO ] Deduced a trap composed of 12 places in 71 ms of which 1 ms to minimize.
[2024-05-21 23:33:40] [INFO ] Deduced a trap composed of 16 places in 91 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/480 variables, 8/342 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/480 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 8 (OVERLAPS) 0/480 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Real declared 480/480 variables, and 342 constraints, problems are : Problem set: 0 solved, 218 unsolved in 12928 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 261/261 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 31/31 constraints]
Escalating to Integer solving :Problem set: 0 solved, 218 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/260 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (OVERLAPS) 1/261 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/261 variables, 31/81 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-21 23:33:46] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/261 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/261 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (OVERLAPS) 219/480 variables, 261/343 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/480 variables, 218/561 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/480 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-21 23:33:54] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/480 variables, 1/562 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-21 23:33:57] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
[2024-05-21 23:33:58] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/480 variables, 2/564 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/480 variables, 0/564 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 11 (OVERLAPS) 0/480 variables, 0/564 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Int declared 480/480 variables, and 564 constraints, problems are : Problem set: 0 solved, 218 unsolved in 28928 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 261/261 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 35/35 constraints]
After SMT, in 41895ms problems are : Problem set: 0 solved, 218 unsolved
Search for dead transitions found 0 dead transitions in 41899ms
Starting structural reductions in LTL mode, iteration 1 : 261/268 places, 219/226 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42315 ms. Remains : 261/268 places, 219/226 transitions.
Stuttering acceptance computed with spot in 123 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-08-LTLCardinality-14
Product exploration explored 100000 steps with 857 reset in 141 ms.
Stack based approach found an accepted trace after 21875 steps with 186 reset with depth 217 and stack size 201 in 52 ms.
FORMULA BusinessProcesses-PT-08-LTLCardinality-14 FALSE TECHNIQUES STACK_TEST
Treatment of property BusinessProcesses-PT-08-LTLCardinality-14 finished in 42658 ms.
All properties solved by simple procedures.
Total runtime 182966 ms.

BK_STOP 1716334454637

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-08"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
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 itstools"
echo " Input is BusinessProcesses-PT-08, 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 r048-tajo-171620399700507"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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