MCC'2024- Execution of r069-tall-171620503600019

About the Execution of GreatSPN+red for CANConstruction-PT-020

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
1495.088	311653.00	398232.00	842.60	FTFFTFFFTFFFFFTT	normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 9.2K 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 7.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.5K 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.9K Apr 22 14:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 12 19:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 111K Apr 12 19:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Apr 12 19:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 49K Apr 12 19:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 641K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716361498135

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANConstruction-PT-020
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 07:04:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-22 07:04:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 07:04:59] [INFO ] Load time of PNML (sax parser for PT used): 138 ms
[2024-05-22 07:04:59] [INFO ] Transformed 1042 places.
[2024-05-22 07:04:59] [INFO ] Transformed 1760 transitions.
[2024-05-22 07:04:59] [INFO ] Parsed PT model containing 1042 places and 1760 transitions and 5200 arcs in 280 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 7 formulas.
FORMULA CANConstruction-PT-020-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-020-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-020-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-020-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-020-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-020-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-020-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 31 out of 1042 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1042/1042 places, 1760/1760 transitions.
Discarding 347 places :
Symmetric choice reduction at 0 with 347 rule applications. Total rules 347 place count 695 transition count 1066
Iterating global reduction 0 with 347 rules applied. Total rules applied 694 place count 695 transition count 1066
Applied a total of 694 rules in 142 ms. Remains 695 /1042 variables (removed 347) and now considering 1066/1760 (removed 694) transitions.
// Phase 1: matrix 1066 rows 695 cols
[2024-05-22 07:05:00] [INFO ] Computed 41 invariants in 35 ms
[2024-05-22 07:05:00] [INFO ] Implicit Places using invariants in 639 ms returned [12, 26, 40, 54, 68, 82, 96, 110, 124, 138, 152, 166, 180, 194, 208, 222, 236, 250, 264, 278]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 670 ms to find 20 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 675/1042 places, 1066/1760 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 657 transition count 1048
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 657 transition count 1048
Applied a total of 36 rules in 33 ms. Remains 657 /675 variables (removed 18) and now considering 1048/1066 (removed 18) transitions.
// Phase 1: matrix 1048 rows 657 cols
[2024-05-22 07:05:00] [INFO ] Computed 21 invariants in 8 ms
[2024-05-22 07:05:01] [INFO ] Implicit Places using invariants in 307 ms returned []
[2024-05-22 07:05:01] [INFO ] Invariant cache hit.
[2024-05-22 07:05:01] [INFO ] State equation strengthened by 780 read => feed constraints.
[2024-05-22 07:05:03] [INFO ] Implicit Places using invariants and state equation in 2196 ms returned []
Implicit Place search using SMT with State Equation took 2506 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 657/1042 places, 1048/1760 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3370 ms. Remains : 657/1042 places, 1048/1760 transitions.
Support contains 31 out of 657 places after structural reductions.
[2024-05-22 07:05:03] [INFO ] Flatten gal took : 85 ms
[2024-05-22 07:05:03] [INFO ] Flatten gal took : 53 ms
[2024-05-22 07:05:03] [INFO ] Input system was already deterministic with 1048 transitions.
Support contains 29 out of 657 places (down from 31) after GAL structural reductions.
RANDOM walk for 40000 steps (112 resets) in 2828 ms. (14 steps per ms) remains 11/22 properties
BEST_FIRST walk for 40004 steps (8 resets) in 187 ms. (212 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 100 ms. (396 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 91 ms. (434 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 148 ms. (268 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 123 ms. (322 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 89 ms. (444 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 91 ms. (434 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 69 ms. (571 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 88 ms. (449 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 98 ms. (404 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 76 ms. (519 steps per ms) remains 11/11 properties
[2024-05-22 07:05:04] [INFO ] Invariant cache hit.
[2024-05-22 07:05:04] [INFO ] State equation strengthened by 780 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp20 is UNSAT
At refinement iteration 1 (OVERLAPS) 631/647 variables, 12/12 constraints. Problems are: Problem set: 10 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/647 variables, 0/12 constraints. Problems are: Problem set: 10 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/656 variables, 9/21 constraints. Problems are: Problem set: 10 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/656 variables, 0/21 constraints. Problems are: Problem set: 10 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1048/1704 variables, 656/677 constraints. Problems are: Problem set: 10 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1704 variables, 780/1457 constraints. Problems are: Problem set: 10 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1704 variables, 0/1457 constraints. Problems are: Problem set: 10 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/1705 variables, 1/1458 constraints. Problems are: Problem set: 10 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1705 variables, 0/1458 constraints. Problems are: Problem set: 10 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/1705 variables, 0/1458 constraints. Problems are: Problem set: 10 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1705/1705 variables, and 1458 constraints, problems are : Problem set: 10 solved, 1 unsolved in 559 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 657/657 constraints, ReadFeed: 780/780 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 10 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 10 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 635/639 variables, 4/4 constraints. Problems are: Problem set: 10 solved, 1 unsolved
[2024-05-22 07:05:05] [INFO ] Deduced a trap composed of 5 places in 285 ms of which 36 ms to minimize.
[2024-05-22 07:05:06] [INFO ] Deduced a trap composed of 5 places in 261 ms of which 5 ms to minimize.
[2024-05-22 07:05:06] [INFO ] Deduced a trap composed of 5 places in 239 ms of which 5 ms to minimize.
[2024-05-22 07:05:06] [INFO ] Deduced a trap composed of 5 places in 253 ms of which 4 ms to minimize.
[2024-05-22 07:05:06] [INFO ] Deduced a trap composed of 5 places in 222 ms of which 4 ms to minimize.
[2024-05-22 07:05:07] [INFO ] Deduced a trap composed of 5 places in 194 ms of which 4 ms to minimize.
[2024-05-22 07:05:07] [INFO ] Deduced a trap composed of 5 places in 215 ms of which 3 ms to minimize.
[2024-05-22 07:05:07] [INFO ] Deduced a trap composed of 5 places in 194 ms of which 9 ms to minimize.
[2024-05-22 07:05:07] [INFO ] Deduced a trap composed of 5 places in 194 ms of which 3 ms to minimize.
[2024-05-22 07:05:08] [INFO ] Deduced a trap composed of 5 places in 190 ms of which 4 ms to minimize.
[2024-05-22 07:05:08] [INFO ] Deduced a trap composed of 5 places in 179 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/639 variables, 11/15 constraints. Problems are: Problem set: 10 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/639 variables, 0/15 constraints. Problems are: Problem set: 10 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 17/656 variables, 17/32 constraints. Problems are: Problem set: 10 solved, 1 unsolved
[2024-05-22 07:05:08] [INFO ] Deduced a trap composed of 37 places in 226 ms of which 4 ms to minimize.
[2024-05-22 07:05:08] [INFO ] Deduced a trap composed of 40 places in 235 ms of which 5 ms to minimize.
[2024-05-22 07:05:08] [INFO ] Deduced a trap composed of 39 places in 217 ms of which 4 ms to minimize.
[2024-05-22 07:05:09] [INFO ] Deduced a trap composed of 35 places in 208 ms of which 4 ms to minimize.
[2024-05-22 07:05:09] [INFO ] Deduced a trap composed of 35 places in 213 ms of which 4 ms to minimize.
[2024-05-22 07:05:09] [INFO ] Deduced a trap composed of 36 places in 215 ms of which 4 ms to minimize.
[2024-05-22 07:05:09] [INFO ] Deduced a trap composed of 35 places in 217 ms of which 4 ms to minimize.
[2024-05-22 07:05:10] [INFO ] Deduced a trap composed of 32 places in 225 ms of which 10 ms to minimize.
[2024-05-22 07:05:10] [INFO ] Deduced a trap composed of 33 places in 187 ms of which 4 ms to minimize.
[2024-05-22 07:05:10] [INFO ] Deduced a trap composed of 36 places in 230 ms of which 4 ms to minimize.
SMT process timed out in 5681ms, After SMT, problems are : Problem set: 10 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 657 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 657/657 places, 1048/1048 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 131 transitions
Trivial Post-agglo rules discarded 131 transitions
Performed 131 trivial Post agglomeration. Transition count delta: 131
Iterating post reduction 0 with 131 rules applied. Total rules applied 131 place count 657 transition count 917
Reduce places removed 131 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 132 rules applied. Total rules applied 263 place count 526 transition count 916
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 264 place count 525 transition count 916
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 20 Pre rules applied. Total rules applied 264 place count 525 transition count 896
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 304 place count 505 transition count 896
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 316 place count 493 transition count 872
Iterating global reduction 3 with 12 rules applied. Total rules applied 328 place count 493 transition count 872
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 3 with 10 rules applied. Total rules applied 338 place count 493 transition count 862
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 348 place count 483 transition count 862
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 5 with 38 rules applied. Total rules applied 386 place count 464 transition count 843
Applied a total of 386 rules in 151 ms. Remains 464 /657 variables (removed 193) and now considering 843/1048 (removed 205) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 152 ms. Remains : 464/657 places, 843/1048 transitions.
RANDOM walk for 40000 steps (299 resets) in 736 ms. (54 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (12 resets) in 86 ms. (459 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 624509 steps, run timeout after 3001 ms. (steps per millisecond=208 ) properties seen :0 out of 1
Probabilistic random walk after 624509 steps, saw 127383 distinct states, run finished after 3005 ms. (steps per millisecond=207 ) properties seen :0
// Phase 1: matrix 843 rows 464 cols
[2024-05-22 07:05:14] [INFO ] Computed 21 invariants in 4 ms
[2024-05-22 07:05:14] [INFO ] State equation strengthened by 780 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 442/446 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/446 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 17/463 variables, 17/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/463 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 843/1306 variables, 463/484 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1306 variables, 780/1264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1306 variables, 0/1264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/1307 variables, 1/1265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1307 variables, 0/1265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/1307 variables, 0/1265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1307/1307 variables, and 1265 constraints, problems are : Problem set: 0 solved, 1 unsolved in 399 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 464/464 constraints, ReadFeed: 780/780 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 442/446 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 07:05:14] [INFO ] Deduced a trap composed of 2 places in 160 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/446 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/446 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 17/463 variables, 17/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 07:05:14] [INFO ] Deduced a trap composed of 23 places in 169 ms of which 3 ms to minimize.
[2024-05-22 07:05:15] [INFO ] Deduced a trap composed of 23 places in 161 ms of which 3 ms to minimize.
[2024-05-22 07:05:15] [INFO ] Deduced a trap composed of 23 places in 166 ms of which 3 ms to minimize.
[2024-05-22 07:05:15] [INFO ] Deduced a trap composed of 23 places in 168 ms of which 3 ms to minimize.
[2024-05-22 07:05:15] [INFO ] Deduced a trap composed of 23 places in 157 ms of which 3 ms to minimize.
[2024-05-22 07:05:15] [INFO ] Deduced a trap composed of 23 places in 154 ms of which 3 ms to minimize.
[2024-05-22 07:05:15] [INFO ] Deduced a trap composed of 24 places in 156 ms of which 3 ms to minimize.
[2024-05-22 07:05:16] [INFO ] Deduced a trap composed of 23 places in 161 ms of which 4 ms to minimize.
[2024-05-22 07:05:16] [INFO ] Deduced a trap composed of 23 places in 153 ms of which 3 ms to minimize.
[2024-05-22 07:05:16] [INFO ] Deduced a trap composed of 23 places in 158 ms of which 4 ms to minimize.
[2024-05-22 07:05:16] [INFO ] Deduced a trap composed of 23 places in 150 ms of which 3 ms to minimize.
[2024-05-22 07:05:16] [INFO ] Deduced a trap composed of 23 places in 156 ms of which 3 ms to minimize.
[2024-05-22 07:05:16] [INFO ] Deduced a trap composed of 23 places in 167 ms of which 4 ms to minimize.
[2024-05-22 07:05:17] [INFO ] Deduced a trap composed of 23 places in 165 ms of which 3 ms to minimize.
[2024-05-22 07:05:17] [INFO ] Deduced a trap composed of 25 places in 158 ms of which 3 ms to minimize.
[2024-05-22 07:05:17] [INFO ] Deduced a trap composed of 24 places in 158 ms of which 3 ms to minimize.
[2024-05-22 07:05:17] [INFO ] Deduced a trap composed of 26 places in 153 ms of which 3 ms to minimize.
[2024-05-22 07:05:17] [INFO ] Deduced a trap composed of 27 places in 155 ms of which 4 ms to minimize.
[2024-05-22 07:05:17] [INFO ] Deduced a trap composed of 27 places in 161 ms of which 4 ms to minimize.
[2024-05-22 07:05:18] [INFO ] Deduced a trap composed of 28 places in 160 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/463 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 07:05:18] [INFO ] Deduced a trap composed of 23 places in 155 ms of which 3 ms to minimize.
[2024-05-22 07:05:18] [INFO ] Deduced a trap composed of 24 places in 157 ms of which 3 ms to minimize.
[2024-05-22 07:05:18] [INFO ] Deduced a trap composed of 24 places in 153 ms of which 3 ms to minimize.
[2024-05-22 07:05:18] [INFO ] Deduced a trap composed of 23 places in 151 ms of which 2 ms to minimize.
[2024-05-22 07:05:18] [INFO ] Deduced a trap composed of 23 places in 137 ms of which 3 ms to minimize.
[2024-05-22 07:05:19] [INFO ] Deduced a trap composed of 23 places in 139 ms of which 3 ms to minimize.
[2024-05-22 07:05:19] [INFO ] Deduced a trap composed of 23 places in 143 ms of which 3 ms to minimize.
[2024-05-22 07:05:19] [INFO ] Deduced a trap composed of 23 places in 143 ms of which 3 ms to minimize.
[2024-05-22 07:05:19] [INFO ] Deduced a trap composed of 23 places in 140 ms of which 3 ms to minimize.
[2024-05-22 07:05:19] [INFO ] Deduced a trap composed of 23 places in 139 ms of which 3 ms to minimize.
[2024-05-22 07:05:19] [INFO ] Deduced a trap composed of 23 places in 141 ms of which 3 ms to minimize.
[2024-05-22 07:05:19] [INFO ] Deduced a trap composed of 23 places in 146 ms of which 4 ms to minimize.
[2024-05-22 07:05:20] [INFO ] Deduced a trap composed of 23 places in 152 ms of which 3 ms to minimize.
[2024-05-22 07:05:20] [INFO ] Deduced a trap composed of 23 places in 146 ms of which 2 ms to minimize.
[2024-05-22 07:05:20] [INFO ] Deduced a trap composed of 23 places in 151 ms of which 5 ms to minimize.
[2024-05-22 07:05:20] [INFO ] Deduced a trap composed of 23 places in 139 ms of which 3 ms to minimize.
[2024-05-22 07:05:20] [INFO ] Deduced a trap composed of 23 places in 141 ms of which 2 ms to minimize.
[2024-05-22 07:05:20] [INFO ] Deduced a trap composed of 23 places in 143 ms of which 3 ms to minimize.
[2024-05-22 07:05:21] [INFO ] Deduced a trap composed of 23 places in 135 ms of which 3 ms to minimize.
[2024-05-22 07:05:21] [INFO ] Deduced a trap composed of 23 places in 133 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/463 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 07:05:21] [INFO ] Deduced a trap composed of 23 places in 135 ms of which 4 ms to minimize.
[2024-05-22 07:05:21] [INFO ] Deduced a trap composed of 24 places in 130 ms of which 3 ms to minimize.
[2024-05-22 07:05:21] [INFO ] Deduced a trap composed of 24 places in 129 ms of which 3 ms to minimize.
[2024-05-22 07:05:21] [INFO ] Deduced a trap composed of 24 places in 130 ms of which 3 ms to minimize.
[2024-05-22 07:05:21] [INFO ] Deduced a trap composed of 26 places in 127 ms of which 3 ms to minimize.
[2024-05-22 07:05:22] [INFO ] Deduced a trap composed of 27 places in 122 ms of which 3 ms to minimize.
[2024-05-22 07:05:22] [INFO ] Deduced a trap composed of 30 places in 133 ms of which 2 ms to minimize.
[2024-05-22 07:05:22] [INFO ] Deduced a trap composed of 26 places in 126 ms of which 2 ms to minimize.
[2024-05-22 07:05:22] [INFO ] Deduced a trap composed of 23 places in 121 ms of which 3 ms to minimize.
[2024-05-22 07:05:22] [INFO ] Deduced a trap composed of 28 places in 122 ms of which 3 ms to minimize.
[2024-05-22 07:05:22] [INFO ] Deduced a trap composed of 28 places in 122 ms of which 2 ms to minimize.
[2024-05-22 07:05:22] [INFO ] Deduced a trap composed of 24 places in 121 ms of which 3 ms to minimize.
[2024-05-22 07:05:22] [INFO ] Deduced a trap composed of 23 places in 120 ms of which 2 ms to minimize.
[2024-05-22 07:05:23] [INFO ] Deduced a trap composed of 23 places in 128 ms of which 3 ms to minimize.
[2024-05-22 07:05:23] [INFO ] Deduced a trap composed of 25 places in 117 ms of which 3 ms to minimize.
[2024-05-22 07:05:23] [INFO ] Deduced a trap composed of 23 places in 109 ms of which 3 ms to minimize.
[2024-05-22 07:05:23] [INFO ] Deduced a trap composed of 23 places in 100 ms of which 2 ms to minimize.
[2024-05-22 07:05:23] [INFO ] Deduced a trap composed of 23 places in 102 ms of which 3 ms to minimize.
[2024-05-22 07:05:23] [INFO ] Deduced a trap composed of 23 places in 104 ms of which 3 ms to minimize.
[2024-05-22 07:05:23] [INFO ] Deduced a trap composed of 23 places in 103 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/463 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/463 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 843/1306 variables, 463/545 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1306 variables, 780/1325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1306 variables, 1/1326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1306 variables, 0/1326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/1307 variables, 1/1327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1307 variables, 0/1327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/1307 variables, 0/1327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1307/1307 variables, and 1327 constraints, problems are : Problem set: 0 solved, 1 unsolved in 10116 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 464/464 constraints, ReadFeed: 780/780 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 61/61 constraints]
After SMT, in 10574ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 711 steps, including 85 resets, run visited all 1 properties in 5 ms. (steps per millisecond=142 )
Parikh walk visited 1 properties in 13 ms.
Successfully simplified 10 atomic propositions for a total of 9 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA CANConstruction-PT-020-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-020-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-020-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 63 stabilizing places and 82 stable transitions
FORMULA CANConstruction-PT-020-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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((p0||X(F((p0&&X(F(p1)))))))))'
Support contains 5 out of 657 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 657/657 places, 1048/1048 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 644 transition count 1024
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 644 transition count 1024
Applied a total of 26 rules in 27 ms. Remains 644 /657 variables (removed 13) and now considering 1024/1048 (removed 24) transitions.
// Phase 1: matrix 1024 rows 644 cols
[2024-05-22 07:05:24] [INFO ] Computed 21 invariants in 9 ms
[2024-05-22 07:05:25] [INFO ] Implicit Places using invariants in 278 ms returned []
[2024-05-22 07:05:25] [INFO ] Invariant cache hit.
[2024-05-22 07:05:25] [INFO ] State equation strengthened by 780 read => feed constraints.
[2024-05-22 07:05:27] [INFO ] Implicit Places using invariants and state equation in 2098 ms returned []
Implicit Place search using SMT with State Equation took 2379 ms to find 0 implicit places.
Running 1004 sub problems to find dead transitions.
[2024-05-22 07:05:27] [INFO ] Invariant cache hit.
[2024-05-22 07:05:27] [INFO ] State equation strengthened by 780 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/643 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 1004 unsolved
[2024-05-22 07:05:40] [INFO ] Deduced a trap composed of 32 places in 144 ms of which 3 ms to minimize.
[2024-05-22 07:05:40] [INFO ] Deduced a trap composed of 32 places in 138 ms of which 3 ms to minimize.
[2024-05-22 07:05:40] [INFO ] Deduced a trap composed of 32 places in 120 ms of which 2 ms to minimize.
[2024-05-22 07:05:40] [INFO ] Deduced a trap composed of 32 places in 124 ms of which 2 ms to minimize.
[2024-05-22 07:05:41] [INFO ] Deduced a trap composed of 32 places in 120 ms of which 3 ms to minimize.
[2024-05-22 07:05:41] [INFO ] Deduced a trap composed of 32 places in 119 ms of which 3 ms to minimize.
[2024-05-22 07:05:41] [INFO ] Deduced a trap composed of 32 places in 109 ms of which 3 ms to minimize.
[2024-05-22 07:05:41] [INFO ] Deduced a trap composed of 32 places in 111 ms of which 3 ms to minimize.
[2024-05-22 07:05:41] [INFO ] Deduced a trap composed of 32 places in 102 ms of which 2 ms to minimize.
[2024-05-22 07:05:41] [INFO ] Deduced a trap composed of 32 places in 107 ms of which 3 ms to minimize.
[2024-05-22 07:05:41] [INFO ] Deduced a trap composed of 32 places in 97 ms of which 2 ms to minimize.
[2024-05-22 07:05:41] [INFO ] Deduced a trap composed of 32 places in 92 ms of which 2 ms to minimize.
[2024-05-22 07:05:42] [INFO ] Deduced a trap composed of 32 places in 105 ms of which 2 ms to minimize.
[2024-05-22 07:05:42] [INFO ] Deduced a trap composed of 32 places in 96 ms of which 3 ms to minimize.
[2024-05-22 07:05:42] [INFO ] Deduced a trap composed of 32 places in 90 ms of which 2 ms to minimize.
[2024-05-22 07:05:42] [INFO ] Deduced a trap composed of 32 places in 85 ms of which 2 ms to minimize.
[2024-05-22 07:05:42] [INFO ] Deduced a trap composed of 32 places in 85 ms of which 3 ms to minimize.
[2024-05-22 07:05:42] [INFO ] Deduced a trap composed of 35 places in 116 ms of which 3 ms to minimize.
[2024-05-22 07:05:42] [INFO ] Deduced a trap composed of 32 places in 111 ms of which 2 ms to minimize.
[2024-05-22 07:05:42] [INFO ] Deduced a trap composed of 35 places in 108 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/643 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 1004 unsolved
[2024-05-22 07:05:46] [INFO ] Deduced a trap composed of 32 places in 91 ms of which 2 ms to minimize.
[2024-05-22 07:05:46] [INFO ] Deduced a trap composed of 32 places in 88 ms of which 3 ms to minimize.
[2024-05-22 07:05:46] [INFO ] Deduced a trap composed of 32 places in 83 ms of which 2 ms to minimize.
[2024-05-22 07:05:46] [INFO ] Deduced a trap composed of 32 places in 78 ms of which 2 ms to minimize.
[2024-05-22 07:05:47] [INFO ] Deduced a trap composed of 32 places in 84 ms of which 2 ms to minimize.
[2024-05-22 07:05:47] [INFO ] Deduced a trap composed of 32 places in 89 ms of which 2 ms to minimize.
[2024-05-22 07:05:47] [INFO ] Deduced a trap composed of 32 places in 88 ms of which 2 ms to minimize.
[2024-05-22 07:05:47] [INFO ] Deduced a trap composed of 32 places in 87 ms of which 2 ms to minimize.
[2024-05-22 07:05:47] [INFO ] Deduced a trap composed of 32 places in 81 ms of which 2 ms to minimize.
[2024-05-22 07:05:47] [INFO ] Deduced a trap composed of 32 places in 117 ms of which 3 ms to minimize.
[2024-05-22 07:05:47] [INFO ] Deduced a trap composed of 32 places in 114 ms of which 3 ms to minimize.
[2024-05-22 07:05:47] [INFO ] Deduced a trap composed of 32 places in 124 ms of which 3 ms to minimize.
[2024-05-22 07:05:47] [INFO ] Deduced a trap composed of 32 places in 116 ms of which 3 ms to minimize.
[2024-05-22 07:05:48] [INFO ] Deduced a trap composed of 32 places in 126 ms of which 3 ms to minimize.
[2024-05-22 07:05:48] [INFO ] Deduced a trap composed of 32 places in 134 ms of which 3 ms to minimize.
[2024-05-22 07:05:48] [INFO ] Deduced a trap composed of 32 places in 128 ms of which 3 ms to minimize.
[2024-05-22 07:05:48] [INFO ] Deduced a trap composed of 32 places in 118 ms of which 3 ms to minimize.
[2024-05-22 07:05:48] [INFO ] Deduced a trap composed of 32 places in 121 ms of which 2 ms to minimize.
[2024-05-22 07:05:48] [INFO ] Deduced a trap composed of 32 places in 118 ms of which 3 ms to minimize.
[2024-05-22 07:05:48] [INFO ] Deduced a trap composed of 32 places in 117 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/643 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 1004 unsolved
[2024-05-22 07:05:49] [INFO ] Deduced a trap composed of 32 places in 140 ms of which 3 ms to minimize.
[2024-05-22 07:05:49] [INFO ] Deduced a trap composed of 32 places in 125 ms of which 3 ms to minimize.
[2024-05-22 07:05:49] [INFO ] Deduced a trap composed of 32 places in 118 ms of which 3 ms to minimize.
[2024-05-22 07:05:49] [INFO ] Deduced a trap composed of 32 places in 125 ms of which 2 ms to minimize.
[2024-05-22 07:05:49] [INFO ] Deduced a trap composed of 32 places in 116 ms of which 3 ms to minimize.
[2024-05-22 07:05:50] [INFO ] Deduced a trap composed of 32 places in 128 ms of which 3 ms to minimize.
[2024-05-22 07:05:50] [INFO ] Deduced a trap composed of 32 places in 115 ms of which 3 ms to minimize.
[2024-05-22 07:05:50] [INFO ] Deduced a trap composed of 32 places in 121 ms of which 3 ms to minimize.
[2024-05-22 07:05:50] [INFO ] Deduced a trap composed of 32 places in 109 ms of which 3 ms to minimize.
[2024-05-22 07:05:50] [INFO ] Deduced a trap composed of 32 places in 98 ms of which 2 ms to minimize.
[2024-05-22 07:05:50] [INFO ] Deduced a trap composed of 32 places in 100 ms of which 2 ms to minimize.
[2024-05-22 07:05:50] [INFO ] Deduced a trap composed of 32 places in 100 ms of which 2 ms to minimize.
[2024-05-22 07:05:50] [INFO ] Deduced a trap composed of 32 places in 102 ms of which 2 ms to minimize.
[2024-05-22 07:05:51] [INFO ] Deduced a trap composed of 32 places in 98 ms of which 2 ms to minimize.
[2024-05-22 07:05:51] [INFO ] Deduced a trap composed of 32 places in 103 ms of which 2 ms to minimize.
[2024-05-22 07:05:51] [INFO ] Deduced a trap composed of 32 places in 97 ms of which 2 ms to minimize.
[2024-05-22 07:05:51] [INFO ] Deduced a trap composed of 32 places in 96 ms of which 2 ms to minimize.
[2024-05-22 07:05:51] [INFO ] Deduced a trap composed of 32 places in 99 ms of which 3 ms to minimize.
[2024-05-22 07:05:51] [INFO ] Deduced a trap composed of 32 places in 104 ms of which 3 ms to minimize.
[2024-05-22 07:05:51] [INFO ] Deduced a trap composed of 32 places in 102 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/643 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 1004 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 643/1668 variables, and 81 constraints, problems are : Problem set: 0 solved, 1004 unsolved in 30048 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 0/644 constraints, ReadFeed: 0/780 constraints, PredecessorRefiner: 1004/1004 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1004 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/643 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 1004 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/643 variables, 60/81 constraints. Problems are: Problem set: 0 solved, 1004 unsolved
[2024-05-22 07:06:00] [INFO ] Deduced a trap composed of 35 places in 147 ms of which 3 ms to minimize.
[2024-05-22 07:06:01] [INFO ] Deduced a trap composed of 32 places in 127 ms of which 3 ms to minimize.
[2024-05-22 07:06:01] [INFO ] Deduced a trap composed of 32 places in 123 ms of which 3 ms to minimize.
[2024-05-22 07:06:01] [INFO ] Deduced a trap composed of 32 places in 121 ms of which 2 ms to minimize.
[2024-05-22 07:06:01] [INFO ] Deduced a trap composed of 32 places in 119 ms of which 3 ms to minimize.
[2024-05-22 07:06:01] [INFO ] Deduced a trap composed of 32 places in 119 ms of which 3 ms to minimize.
[2024-05-22 07:06:01] [INFO ] Deduced a trap composed of 38 places in 127 ms of which 3 ms to minimize.
[2024-05-22 07:06:01] [INFO ] Deduced a trap composed of 37 places in 125 ms of which 3 ms to minimize.
[2024-05-22 07:06:02] [INFO ] Deduced a trap composed of 37 places in 127 ms of which 2 ms to minimize.
[2024-05-22 07:06:02] [INFO ] Deduced a trap composed of 33 places in 132 ms of which 3 ms to minimize.
[2024-05-22 07:06:02] [INFO ] Deduced a trap composed of 32 places in 130 ms of which 3 ms to minimize.
[2024-05-22 07:06:02] [INFO ] Deduced a trap composed of 32 places in 115 ms of which 3 ms to minimize.
[2024-05-22 07:06:02] [INFO ] Deduced a trap composed of 32 places in 108 ms of which 3 ms to minimize.
[2024-05-22 07:06:02] [INFO ] Deduced a trap composed of 32 places in 112 ms of which 2 ms to minimize.
[2024-05-22 07:06:02] [INFO ] Deduced a trap composed of 32 places in 100 ms of which 2 ms to minimize.
[2024-05-22 07:06:02] [INFO ] Deduced a trap composed of 32 places in 102 ms of which 3 ms to minimize.
[2024-05-22 07:06:03] [INFO ] Deduced a trap composed of 32 places in 96 ms of which 3 ms to minimize.
[2024-05-22 07:06:03] [INFO ] Deduced a trap composed of 32 places in 98 ms of which 2 ms to minimize.
[2024-05-22 07:06:03] [INFO ] Deduced a trap composed of 32 places in 101 ms of which 2 ms to minimize.
[2024-05-22 07:06:03] [INFO ] Deduced a trap composed of 32 places in 96 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/643 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 1004 unsolved
[2024-05-22 07:06:04] [INFO ] Deduced a trap composed of 35 places in 219 ms of which 4 ms to minimize.
[2024-05-22 07:06:04] [INFO ] Deduced a trap composed of 32 places in 198 ms of which 4 ms to minimize.
[2024-05-22 07:06:04] [INFO ] Deduced a trap composed of 35 places in 186 ms of which 3 ms to minimize.
[2024-05-22 07:06:04] [INFO ] Deduced a trap composed of 38 places in 182 ms of which 3 ms to minimize.
[2024-05-22 07:06:05] [INFO ] Deduced a trap composed of 35 places in 184 ms of which 4 ms to minimize.
[2024-05-22 07:06:05] [INFO ] Deduced a trap composed of 32 places in 193 ms of which 4 ms to minimize.
[2024-05-22 07:06:05] [INFO ] Deduced a trap composed of 35 places in 168 ms of which 4 ms to minimize.
[2024-05-22 07:06:05] [INFO ] Deduced a trap composed of 35 places in 192 ms of which 4 ms to minimize.
[2024-05-22 07:06:05] [INFO ] Deduced a trap composed of 32 places in 199 ms of which 4 ms to minimize.
[2024-05-22 07:06:06] [INFO ] Deduced a trap composed of 35 places in 196 ms of which 3 ms to minimize.
[2024-05-22 07:06:06] [INFO ] Deduced a trap composed of 35 places in 186 ms of which 3 ms to minimize.
[2024-05-22 07:06:06] [INFO ] Deduced a trap composed of 32 places in 177 ms of which 4 ms to minimize.
[2024-05-22 07:06:06] [INFO ] Deduced a trap composed of 36 places in 173 ms of which 4 ms to minimize.
[2024-05-22 07:06:06] [INFO ] Deduced a trap composed of 39 places in 190 ms of which 3 ms to minimize.
[2024-05-22 07:06:07] [INFO ] Deduced a trap composed of 33 places in 180 ms of which 3 ms to minimize.
[2024-05-22 07:06:07] [INFO ] Deduced a trap composed of 32 places in 174 ms of which 4 ms to minimize.
[2024-05-22 07:06:07] [INFO ] Deduced a trap composed of 37 places in 169 ms of which 3 ms to minimize.
[2024-05-22 07:06:07] [INFO ] Deduced a trap composed of 32 places in 159 ms of which 4 ms to minimize.
[2024-05-22 07:06:07] [INFO ] Deduced a trap composed of 32 places in 160 ms of which 3 ms to minimize.
[2024-05-22 07:06:08] [INFO ] Deduced a trap composed of 32 places in 162 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/643 variables, 20/121 constraints. Problems are: Problem set: 0 solved, 1004 unsolved
[2024-05-22 07:06:08] [INFO ] Deduced a trap composed of 32 places in 144 ms of which 3 ms to minimize.
[2024-05-22 07:06:11] [INFO ] Deduced a trap composed of 32 places in 130 ms of which 3 ms to minimize.
[2024-05-22 07:06:11] [INFO ] Deduced a trap composed of 32 places in 110 ms of which 3 ms to minimize.
[2024-05-22 07:06:11] [INFO ] Deduced a trap composed of 32 places in 110 ms of which 3 ms to minimize.
[2024-05-22 07:06:11] [INFO ] Deduced a trap composed of 32 places in 123 ms of which 2 ms to minimize.
[2024-05-22 07:06:11] [INFO ] Deduced a trap composed of 32 places in 117 ms of which 3 ms to minimize.
[2024-05-22 07:06:11] [INFO ] Deduced a trap composed of 32 places in 118 ms of which 3 ms to minimize.
[2024-05-22 07:06:12] [INFO ] Deduced a trap composed of 32 places in 115 ms of which 2 ms to minimize.
[2024-05-22 07:06:12] [INFO ] Deduced a trap composed of 32 places in 120 ms of which 3 ms to minimize.
[2024-05-22 07:06:12] [INFO ] Deduced a trap composed of 32 places in 108 ms of which 2 ms to minimize.
[2024-05-22 07:06:12] [INFO ] Deduced a trap composed of 32 places in 113 ms of which 2 ms to minimize.
[2024-05-22 07:06:12] [INFO ] Deduced a trap composed of 32 places in 110 ms of which 3 ms to minimize.
[2024-05-22 07:06:12] [INFO ] Deduced a trap composed of 32 places in 116 ms of which 3 ms to minimize.
[2024-05-22 07:06:12] [INFO ] Deduced a trap composed of 32 places in 132 ms of which 2 ms to minimize.
[2024-05-22 07:06:13] [INFO ] Deduced a trap composed of 32 places in 115 ms of which 2 ms to minimize.
[2024-05-22 07:06:13] [INFO ] Deduced a trap composed of 32 places in 115 ms of which 2 ms to minimize.
[2024-05-22 07:06:13] [INFO ] Deduced a trap composed of 32 places in 136 ms of which 3 ms to minimize.
[2024-05-22 07:06:13] [INFO ] Deduced a trap composed of 32 places in 108 ms of which 2 ms to minimize.
[2024-05-22 07:06:13] [INFO ] Deduced a trap composed of 32 places in 101 ms of which 3 ms to minimize.
[2024-05-22 07:06:13] [INFO ] Deduced a trap composed of 32 places in 104 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/643 variables, 20/141 constraints. Problems are: Problem set: 0 solved, 1004 unsolved
[2024-05-22 07:06:14] [INFO ] Deduced a trap composed of 32 places in 104 ms of which 2 ms to minimize.
[2024-05-22 07:06:14] [INFO ] Deduced a trap composed of 32 places in 108 ms of which 3 ms to minimize.
[2024-05-22 07:06:14] [INFO ] Deduced a trap composed of 32 places in 96 ms of which 3 ms to minimize.
[2024-05-22 07:06:14] [INFO ] Deduced a trap composed of 32 places in 120 ms of which 3 ms to minimize.
[2024-05-22 07:06:15] [INFO ] Deduced a trap composed of 32 places in 118 ms of which 3 ms to minimize.
[2024-05-22 07:06:15] [INFO ] Deduced a trap composed of 32 places in 107 ms of which 3 ms to minimize.
[2024-05-22 07:06:15] [INFO ] Deduced a trap composed of 32 places in 117 ms of which 3 ms to minimize.
[2024-05-22 07:06:15] [INFO ] Deduced a trap composed of 32 places in 112 ms of which 3 ms to minimize.
[2024-05-22 07:06:15] [INFO ] Deduced a trap composed of 32 places in 132 ms of which 3 ms to minimize.
[2024-05-22 07:06:15] [INFO ] Deduced a trap composed of 32 places in 126 ms of which 3 ms to minimize.
[2024-05-22 07:06:15] [INFO ] Deduced a trap composed of 32 places in 123 ms of which 3 ms to minimize.
[2024-05-22 07:06:15] [INFO ] Deduced a trap composed of 32 places in 110 ms of which 3 ms to minimize.
[2024-05-22 07:06:16] [INFO ] Deduced a trap composed of 32 places in 102 ms of which 2 ms to minimize.
[2024-05-22 07:06:16] [INFO ] Deduced a trap composed of 32 places in 97 ms of which 2 ms to minimize.
[2024-05-22 07:06:16] [INFO ] Deduced a trap composed of 32 places in 99 ms of which 2 ms to minimize.
[2024-05-22 07:06:16] [INFO ] Deduced a trap composed of 32 places in 86 ms of which 2 ms to minimize.
[2024-05-22 07:06:16] [INFO ] Deduced a trap composed of 32 places in 93 ms of which 2 ms to minimize.
[2024-05-22 07:06:16] [INFO ] Deduced a trap composed of 32 places in 110 ms of which 3 ms to minimize.
[2024-05-22 07:06:16] [INFO ] Deduced a trap composed of 32 places in 89 ms of which 2 ms to minimize.
[2024-05-22 07:06:16] [INFO ] Deduced a trap composed of 32 places in 90 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/643 variables, 20/161 constraints. Problems are: Problem set: 0 solved, 1004 unsolved
[2024-05-22 07:06:21] [INFO ] Deduced a trap composed of 32 places in 116 ms of which 2 ms to minimize.
[2024-05-22 07:06:21] [INFO ] Deduced a trap composed of 32 places in 112 ms of which 3 ms to minimize.
[2024-05-22 07:06:21] [INFO ] Deduced a trap composed of 32 places in 140 ms of which 3 ms to minimize.
[2024-05-22 07:06:21] [INFO ] Deduced a trap composed of 32 places in 126 ms of which 3 ms to minimize.
[2024-05-22 07:06:21] [INFO ] Deduced a trap composed of 32 places in 127 ms of which 3 ms to minimize.
[2024-05-22 07:06:22] [INFO ] Deduced a trap composed of 38 places in 152 ms of which 4 ms to minimize.
[2024-05-22 07:06:22] [INFO ] Deduced a trap composed of 32 places in 143 ms of which 3 ms to minimize.
[2024-05-22 07:06:22] [INFO ] Deduced a trap composed of 39 places in 145 ms of which 3 ms to minimize.
[2024-05-22 07:06:22] [INFO ] Deduced a trap composed of 35 places in 149 ms of which 3 ms to minimize.
[2024-05-22 07:06:22] [INFO ] Deduced a trap composed of 32 places in 138 ms of which 4 ms to minimize.
[2024-05-22 07:06:22] [INFO ] Deduced a trap composed of 35 places in 145 ms of which 3 ms to minimize.
[2024-05-22 07:06:22] [INFO ] Deduced a trap composed of 36 places in 139 ms of which 3 ms to minimize.
[2024-05-22 07:06:23] [INFO ] Deduced a trap composed of 32 places in 128 ms of which 3 ms to minimize.
[2024-05-22 07:06:23] [INFO ] Deduced a trap composed of 38 places in 119 ms of which 3 ms to minimize.
[2024-05-22 07:06:23] [INFO ] Deduced a trap composed of 32 places in 125 ms of which 3 ms to minimize.
[2024-05-22 07:06:23] [INFO ] Deduced a trap composed of 36 places in 131 ms of which 3 ms to minimize.
[2024-05-22 07:06:23] [INFO ] Deduced a trap composed of 32 places in 120 ms of which 3 ms to minimize.
[2024-05-22 07:06:23] [INFO ] Deduced a trap composed of 32 places in 118 ms of which 3 ms to minimize.
[2024-05-22 07:06:23] [INFO ] Deduced a trap composed of 32 places in 124 ms of which 3 ms to minimize.
[2024-05-22 07:06:24] [INFO ] Deduced a trap composed of 35 places in 163 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/643 variables, 20/181 constraints. Problems are: Problem set: 0 solved, 1004 unsolved
[2024-05-22 07:06:27] [INFO ] Deduced a trap composed of 32 places in 166 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 643/1668 variables, and 182 constraints, problems are : Problem set: 0 solved, 1004 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 0/644 constraints, ReadFeed: 0/780 constraints, PredecessorRefiner: 0/1004 constraints, Known Traps: 161/161 constraints]
After SMT, in 60411ms problems are : Problem set: 0 solved, 1004 unsolved
Search for dead transitions found 0 dead transitions in 60426ms
Starting structural reductions in LTL mode, iteration 1 : 644/657 places, 1024/1048 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62846 ms. Remains : 644/657 places, 1024/1048 transitions.
Stuttering acceptance computed with spot in 359 ms :[(NOT p0), (NOT p1), (NOT p0), (NOT p0), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : CANConstruction-PT-020-LTLCardinality-01
Product exploration explored 100000 steps with 33333 reset in 392 ms.
Product exploration explored 100000 steps with 33333 reset in 305 ms.
Computed a total of 61 stabilizing places and 80 stable transitions
Computed a total of 61 stabilizing places and 80 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 20 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CANConstruction-PT-020-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANConstruction-PT-020-LTLCardinality-01 finished in 64021 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(p0))'
Support contains 1 out of 657 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 657/657 places, 1048/1048 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 133 transitions
Trivial Post-agglo rules discarded 133 transitions
Performed 133 trivial Post agglomeration. Transition count delta: 133
Iterating post reduction 0 with 133 rules applied. Total rules applied 133 place count 657 transition count 915
Reduce places removed 133 places and 0 transitions.
Iterating post reduction 1 with 133 rules applied. Total rules applied 266 place count 524 transition count 915
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 266 place count 524 transition count 895
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 306 place count 504 transition count 895
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 319 place count 491 transition count 869
Iterating global reduction 2 with 13 rules applied. Total rules applied 332 place count 491 transition count 869
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 2 with 11 rules applied. Total rules applied 343 place count 491 transition count 858
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 354 place count 480 transition count 858
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 36 rules applied. Total rules applied 390 place count 462 transition count 840
Applied a total of 390 rules in 92 ms. Remains 462 /657 variables (removed 195) and now considering 840/1048 (removed 208) transitions.
// Phase 1: matrix 840 rows 462 cols
[2024-05-22 07:06:28] [INFO ] Computed 21 invariants in 5 ms
[2024-05-22 07:06:29] [INFO ] Implicit Places using invariants in 258 ms returned []
[2024-05-22 07:06:29] [INFO ] Invariant cache hit.
[2024-05-22 07:06:29] [INFO ] State equation strengthened by 780 read => feed constraints.
[2024-05-22 07:06:30] [INFO ] Implicit Places using invariants and state equation in 1625 ms returned []
Implicit Place search using SMT with State Equation took 1885 ms to find 0 implicit places.
[2024-05-22 07:06:30] [INFO ] Redundant transitions in 48 ms returned []
Running 820 sub problems to find dead transitions.
[2024-05-22 07:06:30] [INFO ] Invariant cache hit.
[2024-05-22 07:06:30] [INFO ] State equation strengthened by 780 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/461 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 820 unsolved
[2024-05-22 07:06:37] [INFO ] Deduced a trap composed of 23 places in 174 ms of which 3 ms to minimize.
[2024-05-22 07:06:37] [INFO ] Deduced a trap composed of 23 places in 166 ms of which 3 ms to minimize.
[2024-05-22 07:06:37] [INFO ] Deduced a trap composed of 26 places in 158 ms of which 3 ms to minimize.
[2024-05-22 07:06:38] [INFO ] Deduced a trap composed of 25 places in 159 ms of which 3 ms to minimize.
[2024-05-22 07:06:38] [INFO ] Deduced a trap composed of 28 places in 161 ms of which 3 ms to minimize.
[2024-05-22 07:06:38] [INFO ] Deduced a trap composed of 26 places in 156 ms of which 3 ms to minimize.
[2024-05-22 07:06:38] [INFO ] Deduced a trap composed of 26 places in 152 ms of which 3 ms to minimize.
[2024-05-22 07:06:38] [INFO ] Deduced a trap composed of 23 places in 158 ms of which 2 ms to minimize.
[2024-05-22 07:06:38] [INFO ] Deduced a trap composed of 23 places in 145 ms of which 3 ms to minimize.
[2024-05-22 07:06:39] [INFO ] Deduced a trap composed of 23 places in 136 ms of which 3 ms to minimize.
[2024-05-22 07:06:39] [INFO ] Deduced a trap composed of 23 places in 137 ms of which 3 ms to minimize.
[2024-05-22 07:06:39] [INFO ] Deduced a trap composed of 23 places in 135 ms of which 3 ms to minimize.
[2024-05-22 07:06:39] [INFO ] Deduced a trap composed of 23 places in 137 ms of which 4 ms to minimize.
[2024-05-22 07:06:39] [INFO ] Deduced a trap composed of 28 places in 124 ms of which 3 ms to minimize.
[2024-05-22 07:06:39] [INFO ] Deduced a trap composed of 23 places in 128 ms of which 2 ms to minimize.
[2024-05-22 07:06:39] [INFO ] Deduced a trap composed of 23 places in 128 ms of which 2 ms to minimize.
[2024-05-22 07:06:39] [INFO ] Deduced a trap composed of 23 places in 121 ms of which 3 ms to minimize.
[2024-05-22 07:06:40] [INFO ] Deduced a trap composed of 23 places in 122 ms of which 2 ms to minimize.
[2024-05-22 07:06:40] [INFO ] Deduced a trap composed of 23 places in 114 ms of which 3 ms to minimize.
[2024-05-22 07:06:40] [INFO ] Deduced a trap composed of 23 places in 108 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/461 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 820 unsolved
[2024-05-22 07:06:41] [INFO ] Deduced a trap composed of 23 places in 122 ms of which 3 ms to minimize.
[2024-05-22 07:06:41] [INFO ] Deduced a trap composed of 27 places in 119 ms of which 2 ms to minimize.
[2024-05-22 07:06:41] [INFO ] Deduced a trap composed of 23 places in 110 ms of which 3 ms to minimize.
[2024-05-22 07:06:41] [INFO ] Deduced a trap composed of 23 places in 148 ms of which 3 ms to minimize.
[2024-05-22 07:06:41] [INFO ] Deduced a trap composed of 23 places in 138 ms of which 3 ms to minimize.
[2024-05-22 07:06:42] [INFO ] Deduced a trap composed of 24 places in 141 ms of which 3 ms to minimize.
[2024-05-22 07:06:42] [INFO ] Deduced a trap composed of 26 places in 141 ms of which 3 ms to minimize.
[2024-05-22 07:06:42] [INFO ] Deduced a trap composed of 27 places in 136 ms of which 3 ms to minimize.
[2024-05-22 07:06:42] [INFO ] Deduced a trap composed of 28 places in 140 ms of which 2 ms to minimize.
[2024-05-22 07:06:42] [INFO ] Deduced a trap composed of 23 places in 153 ms of which 3 ms to minimize.
[2024-05-22 07:06:42] [INFO ] Deduced a trap composed of 26 places in 159 ms of which 2 ms to minimize.
[2024-05-22 07:06:43] [INFO ] Deduced a trap composed of 25 places in 131 ms of which 3 ms to minimize.
[2024-05-22 07:06:43] [INFO ] Deduced a trap composed of 23 places in 134 ms of which 3 ms to minimize.
[2024-05-22 07:06:43] [INFO ] Deduced a trap composed of 23 places in 123 ms of which 3 ms to minimize.
[2024-05-22 07:06:43] [INFO ] Deduced a trap composed of 23 places in 124 ms of which 3 ms to minimize.
[2024-05-22 07:06:43] [INFO ] Deduced a trap composed of 23 places in 122 ms of which 3 ms to minimize.
[2024-05-22 07:06:43] [INFO ] Deduced a trap composed of 23 places in 127 ms of which 3 ms to minimize.
[2024-05-22 07:06:43] [INFO ] Deduced a trap composed of 26 places in 122 ms of which 2 ms to minimize.
[2024-05-22 07:06:43] [INFO ] Deduced a trap composed of 23 places in 124 ms of which 2 ms to minimize.
[2024-05-22 07:06:44] [INFO ] Deduced a trap composed of 23 places in 120 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/461 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 820 unsolved
[2024-05-22 07:06:45] [INFO ] Deduced a trap composed of 24 places in 126 ms of which 2 ms to minimize.
[2024-05-22 07:06:45] [INFO ] Deduced a trap composed of 25 places in 114 ms of which 2 ms to minimize.
[2024-05-22 07:06:45] [INFO ] Deduced a trap composed of 23 places in 114 ms of which 2 ms to minimize.
[2024-05-22 07:06:45] [INFO ] Deduced a trap composed of 27 places in 112 ms of which 3 ms to minimize.
[2024-05-22 07:06:45] [INFO ] Deduced a trap composed of 25 places in 112 ms of which 3 ms to minimize.
[2024-05-22 07:06:45] [INFO ] Deduced a trap composed of 23 places in 129 ms of which 2 ms to minimize.
[2024-05-22 07:06:45] [INFO ] Deduced a trap composed of 23 places in 129 ms of which 2 ms to minimize.
[2024-05-22 07:06:46] [INFO ] Deduced a trap composed of 25 places in 124 ms of which 3 ms to minimize.
[2024-05-22 07:06:46] [INFO ] Deduced a trap composed of 23 places in 121 ms of which 3 ms to minimize.
[2024-05-22 07:06:46] [INFO ] Deduced a trap composed of 23 places in 115 ms of which 3 ms to minimize.
[2024-05-22 07:06:46] [INFO ] Deduced a trap composed of 23 places in 115 ms of which 2 ms to minimize.
[2024-05-22 07:06:46] [INFO ] Deduced a trap composed of 25 places in 134 ms of which 3 ms to minimize.
[2024-05-22 07:06:46] [INFO ] Deduced a trap composed of 26 places in 130 ms of which 3 ms to minimize.
[2024-05-22 07:06:46] [INFO ] Deduced a trap composed of 23 places in 131 ms of which 3 ms to minimize.
[2024-05-22 07:06:47] [INFO ] Deduced a trap composed of 23 places in 125 ms of which 2 ms to minimize.
[2024-05-22 07:06:47] [INFO ] Deduced a trap composed of 23 places in 121 ms of which 3 ms to minimize.
[2024-05-22 07:06:47] [INFO ] Deduced a trap composed of 23 places in 115 ms of which 2 ms to minimize.
[2024-05-22 07:06:47] [INFO ] Deduced a trap composed of 26 places in 123 ms of which 3 ms to minimize.
[2024-05-22 07:06:47] [INFO ] Deduced a trap composed of 23 places in 116 ms of which 2 ms to minimize.
[2024-05-22 07:06:47] [INFO ] Deduced a trap composed of 23 places in 109 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/461 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 820 unsolved
[2024-05-22 07:06:53] [INFO ] Deduced a trap composed of 23 places in 173 ms of which 4 ms to minimize.
[2024-05-22 07:06:53] [INFO ] Deduced a trap composed of 23 places in 168 ms of which 3 ms to minimize.
[2024-05-22 07:06:54] [INFO ] Deduced a trap composed of 23 places in 115 ms of which 3 ms to minimize.
[2024-05-22 07:06:54] [INFO ] Deduced a trap composed of 23 places in 115 ms of which 3 ms to minimize.
[2024-05-22 07:06:54] [INFO ] Deduced a trap composed of 23 places in 117 ms of which 3 ms to minimize.
[2024-05-22 07:06:54] [INFO ] Deduced a trap composed of 23 places in 132 ms of which 3 ms to minimize.
[2024-05-22 07:06:55] [INFO ] Deduced a trap composed of 23 places in 132 ms of which 3 ms to minimize.
[2024-05-22 07:06:55] [INFO ] Deduced a trap composed of 23 places in 119 ms of which 3 ms to minimize.
[2024-05-22 07:06:55] [INFO ] Deduced a trap composed of 23 places in 133 ms of which 3 ms to minimize.
[2024-05-22 07:06:55] [INFO ] Deduced a trap composed of 26 places in 140 ms of which 3 ms to minimize.
[2024-05-22 07:06:55] [INFO ] Deduced a trap composed of 26 places in 126 ms of which 3 ms to minimize.
[2024-05-22 07:06:55] [INFO ] Deduced a trap composed of 26 places in 133 ms of which 3 ms to minimize.
[2024-05-22 07:06:56] [INFO ] Deduced a trap composed of 23 places in 124 ms of which 2 ms to minimize.
[2024-05-22 07:06:56] [INFO ] Deduced a trap composed of 25 places in 138 ms of which 3 ms to minimize.
[2024-05-22 07:06:56] [INFO ] Deduced a trap composed of 23 places in 132 ms of which 3 ms to minimize.
[2024-05-22 07:06:56] [INFO ] Deduced a trap composed of 23 places in 124 ms of which 2 ms to minimize.
[2024-05-22 07:06:56] [INFO ] Deduced a trap composed of 28 places in 121 ms of which 3 ms to minimize.
[2024-05-22 07:06:56] [INFO ] Deduced a trap composed of 23 places in 120 ms of which 3 ms to minimize.
[2024-05-22 07:06:56] [INFO ] Deduced a trap composed of 23 places in 122 ms of which 2 ms to minimize.
[2024-05-22 07:06:56] [INFO ] Deduced a trap composed of 23 places in 120 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/461 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 820 unsolved
[2024-05-22 07:06:58] [INFO ] Deduced a trap composed of 23 places in 124 ms of which 3 ms to minimize.
[2024-05-22 07:06:58] [INFO ] Deduced a trap composed of 23 places in 122 ms of which 3 ms to minimize.
[2024-05-22 07:06:58] [INFO ] Deduced a trap composed of 23 places in 106 ms of which 2 ms to minimize.
[2024-05-22 07:06:58] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 3 ms to minimize.
[2024-05-22 07:06:58] [INFO ] Deduced a trap composed of 23 places in 130 ms of which 2 ms to minimize.
[2024-05-22 07:06:58] [INFO ] Deduced a trap composed of 23 places in 128 ms of which 3 ms to minimize.
[2024-05-22 07:06:58] [INFO ] Deduced a trap composed of 23 places in 122 ms of which 3 ms to minimize.
[2024-05-22 07:06:59] [INFO ] Deduced a trap composed of 26 places in 121 ms of which 3 ms to minimize.
[2024-05-22 07:06:59] [INFO ] Deduced a trap composed of 23 places in 122 ms of which 2 ms to minimize.
[2024-05-22 07:06:59] [INFO ] Deduced a trap composed of 26 places in 113 ms of which 3 ms to minimize.
[2024-05-22 07:06:59] [INFO ] Deduced a trap composed of 23 places in 110 ms of which 3 ms to minimize.
[2024-05-22 07:06:59] [INFO ] Deduced a trap composed of 23 places in 106 ms of which 3 ms to minimize.
[2024-05-22 07:06:59] [INFO ] Deduced a trap composed of 23 places in 128 ms of which 3 ms to minimize.
[2024-05-22 07:06:59] [INFO ] Deduced a trap composed of 28 places in 123 ms of which 3 ms to minimize.
[2024-05-22 07:06:59] [INFO ] Deduced a trap composed of 23 places in 125 ms of which 2 ms to minimize.
[2024-05-22 07:07:00] [INFO ] Deduced a trap composed of 23 places in 128 ms of which 4 ms to minimize.
[2024-05-22 07:07:00] [INFO ] Deduced a trap composed of 23 places in 132 ms of which 3 ms to minimize.
[2024-05-22 07:07:00] [INFO ] Deduced a trap composed of 23 places in 124 ms of which 3 ms to minimize.
[2024-05-22 07:07:00] [INFO ] Deduced a trap composed of 24 places in 118 ms of which 3 ms to minimize.
[2024-05-22 07:07:00] [INFO ] Deduced a trap composed of 23 places in 119 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/461 variables, 20/121 constraints. Problems are: Problem set: 0 solved, 820 unsolved
[2024-05-22 07:07:01] [INFO ] Deduced a trap composed of 23 places in 162 ms of which 3 ms to minimize.
SMT process timed out in 30402ms, After SMT, problems are : Problem set: 0 solved, 820 unsolved
Search for dead transitions found 0 dead transitions in 30410ms
Starting structural reductions in SI_LTL mode, iteration 1 : 462/657 places, 840/1048 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 32454 ms. Remains : 462/657 places, 840/1048 transitions.
Stuttering acceptance computed with spot in 68 ms :[true, (NOT p0)]
Running random walk in product with property : CANConstruction-PT-020-LTLCardinality-02
Entered a terminal (fully accepting) state of product in 1586 steps with 11 reset in 11 ms.
FORMULA CANConstruction-PT-020-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-020-LTLCardinality-02 finished in 32551 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 1 out of 657 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 657/657 places, 1048/1048 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 642 transition count 1020
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 642 transition count 1020
Applied a total of 30 rules in 29 ms. Remains 642 /657 variables (removed 15) and now considering 1020/1048 (removed 28) transitions.
// Phase 1: matrix 1020 rows 642 cols
[2024-05-22 07:07:01] [INFO ] Computed 21 invariants in 8 ms
[2024-05-22 07:07:01] [INFO ] Implicit Places using invariants in 288 ms returned []
[2024-05-22 07:07:01] [INFO ] Invariant cache hit.
[2024-05-22 07:07:01] [INFO ] State equation strengthened by 780 read => feed constraints.
[2024-05-22 07:07:03] [INFO ] Implicit Places using invariants and state equation in 1916 ms returned []
Implicit Place search using SMT with State Equation took 2209 ms to find 0 implicit places.
Running 1000 sub problems to find dead transitions.
[2024-05-22 07:07:03] [INFO ] Invariant cache hit.
[2024-05-22 07:07:03] [INFO ] State equation strengthened by 780 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/641 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 1000 unsolved
[2024-05-22 07:07:17] [INFO ] Deduced a trap composed of 32 places in 138 ms of which 4 ms to minimize.
[2024-05-22 07:07:17] [INFO ] Deduced a trap composed of 32 places in 126 ms of which 3 ms to minimize.
[2024-05-22 07:07:17] [INFO ] Deduced a trap composed of 32 places in 122 ms of which 3 ms to minimize.
[2024-05-22 07:07:17] [INFO ] Deduced a trap composed of 32 places in 117 ms of which 3 ms to minimize.
[2024-05-22 07:07:17] [INFO ] Deduced a trap composed of 32 places in 104 ms of which 2 ms to minimize.
[2024-05-22 07:07:17] [INFO ] Deduced a trap composed of 32 places in 98 ms of which 3 ms to minimize.
[2024-05-22 07:07:17] [INFO ] Deduced a trap composed of 32 places in 102 ms of which 2 ms to minimize.
[2024-05-22 07:07:17] [INFO ] Deduced a trap composed of 32 places in 113 ms of which 3 ms to minimize.
[2024-05-22 07:07:18] [INFO ] Deduced a trap composed of 32 places in 96 ms of which 2 ms to minimize.
[2024-05-22 07:07:18] [INFO ] Deduced a trap composed of 32 places in 103 ms of which 3 ms to minimize.
[2024-05-22 07:07:18] [INFO ] Deduced a trap composed of 32 places in 98 ms of which 3 ms to minimize.
[2024-05-22 07:07:18] [INFO ] Deduced a trap composed of 32 places in 91 ms of which 2 ms to minimize.
[2024-05-22 07:07:18] [INFO ] Deduced a trap composed of 32 places in 98 ms of which 2 ms to minimize.
[2024-05-22 07:07:18] [INFO ] Deduced a trap composed of 32 places in 94 ms of which 2 ms to minimize.
[2024-05-22 07:07:18] [INFO ] Deduced a trap composed of 32 places in 92 ms of which 2 ms to minimize.
[2024-05-22 07:07:18] [INFO ] Deduced a trap composed of 32 places in 107 ms of which 3 ms to minimize.
[2024-05-22 07:07:18] [INFO ] Deduced a trap composed of 32 places in 97 ms of which 2 ms to minimize.
[2024-05-22 07:07:19] [INFO ] Deduced a trap composed of 32 places in 94 ms of which 2 ms to minimize.
[2024-05-22 07:07:19] [INFO ] Deduced a trap composed of 32 places in 87 ms of which 3 ms to minimize.
[2024-05-22 07:07:19] [INFO ] Deduced a trap composed of 32 places in 86 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/641 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 1000 unsolved
[2024-05-22 07:07:22] [INFO ] Deduced a trap composed of 32 places in 116 ms of which 2 ms to minimize.
[2024-05-22 07:07:22] [INFO ] Deduced a trap composed of 32 places in 104 ms of which 2 ms to minimize.
[2024-05-22 07:07:23] [INFO ] Deduced a trap composed of 32 places in 103 ms of which 3 ms to minimize.
[2024-05-22 07:07:23] [INFO ] Deduced a trap composed of 32 places in 102 ms of which 2 ms to minimize.
[2024-05-22 07:07:23] [INFO ] Deduced a trap composed of 32 places in 98 ms of which 2 ms to minimize.
[2024-05-22 07:07:23] [INFO ] Deduced a trap composed of 32 places in 123 ms of which 3 ms to minimize.
[2024-05-22 07:07:23] [INFO ] Deduced a trap composed of 32 places in 116 ms of which 3 ms to minimize.
[2024-05-22 07:07:23] [INFO ] Deduced a trap composed of 32 places in 139 ms of which 4 ms to minimize.
[2024-05-22 07:07:23] [INFO ] Deduced a trap composed of 32 places in 129 ms of which 3 ms to minimize.
[2024-05-22 07:07:23] [INFO ] Deduced a trap composed of 32 places in 111 ms of which 2 ms to minimize.
[2024-05-22 07:07:24] [INFO ] Deduced a trap composed of 35 places in 137 ms of which 3 ms to minimize.
[2024-05-22 07:07:24] [INFO ] Deduced a trap composed of 32 places in 141 ms of which 3 ms to minimize.
[2024-05-22 07:07:24] [INFO ] Deduced a trap composed of 32 places in 134 ms of which 3 ms to minimize.
[2024-05-22 07:07:24] [INFO ] Deduced a trap composed of 32 places in 124 ms of which 3 ms to minimize.
[2024-05-22 07:07:24] [INFO ] Deduced a trap composed of 32 places in 126 ms of which 3 ms to minimize.
[2024-05-22 07:07:24] [INFO ] Deduced a trap composed of 32 places in 139 ms of which 3 ms to minimize.
[2024-05-22 07:07:25] [INFO ] Deduced a trap composed of 32 places in 131 ms of which 3 ms to minimize.
[2024-05-22 07:07:25] [INFO ] Deduced a trap composed of 32 places in 134 ms of which 3 ms to minimize.
[2024-05-22 07:07:25] [INFO ] Deduced a trap composed of 37 places in 129 ms of which 3 ms to minimize.
[2024-05-22 07:07:25] [INFO ] Deduced a trap composed of 36 places in 129 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/641 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 1000 unsolved
[2024-05-22 07:07:28] [INFO ] Deduced a trap composed of 32 places in 119 ms of which 2 ms to minimize.
[2024-05-22 07:07:28] [INFO ] Deduced a trap composed of 32 places in 119 ms of which 3 ms to minimize.
[2024-05-22 07:07:28] [INFO ] Deduced a trap composed of 32 places in 118 ms of which 2 ms to minimize.
[2024-05-22 07:07:28] [INFO ] Deduced a trap composed of 32 places in 113 ms of which 2 ms to minimize.
[2024-05-22 07:07:28] [INFO ] Deduced a trap composed of 32 places in 112 ms of which 2 ms to minimize.
[2024-05-22 07:07:28] [INFO ] Deduced a trap composed of 32 places in 121 ms of which 3 ms to minimize.
[2024-05-22 07:07:29] [INFO ] Deduced a trap composed of 32 places in 116 ms of which 3 ms to minimize.
[2024-05-22 07:07:29] [INFO ] Deduced a trap composed of 32 places in 129 ms of which 4 ms to minimize.
[2024-05-22 07:07:29] [INFO ] Deduced a trap composed of 32 places in 126 ms of which 3 ms to minimize.
[2024-05-22 07:07:29] [INFO ] Deduced a trap composed of 32 places in 129 ms of which 3 ms to minimize.
[2024-05-22 07:07:29] [INFO ] Deduced a trap composed of 32 places in 116 ms of which 3 ms to minimize.
[2024-05-22 07:07:30] [INFO ] Deduced a trap composed of 32 places in 114 ms of which 3 ms to minimize.
[2024-05-22 07:07:30] [INFO ] Deduced a trap composed of 32 places in 114 ms of which 3 ms to minimize.
[2024-05-22 07:07:30] [INFO ] Deduced a trap composed of 32 places in 103 ms of which 3 ms to minimize.
[2024-05-22 07:07:30] [INFO ] Deduced a trap composed of 32 places in 97 ms of which 2 ms to minimize.
[2024-05-22 07:07:30] [INFO ] Deduced a trap composed of 32 places in 108 ms of which 3 ms to minimize.
[2024-05-22 07:07:30] [INFO ] Deduced a trap composed of 32 places in 104 ms of which 3 ms to minimize.
[2024-05-22 07:07:30] [INFO ] Deduced a trap composed of 32 places in 100 ms of which 3 ms to minimize.
[2024-05-22 07:07:30] [INFO ] Deduced a trap composed of 32 places in 95 ms of which 2 ms to minimize.
[2024-05-22 07:07:30] [INFO ] Deduced a trap composed of 32 places in 93 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/641 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 1000 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 641/1662 variables, and 81 constraints, problems are : Problem set: 0 solved, 1000 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 0/642 constraints, ReadFeed: 0/780 constraints, PredecessorRefiner: 1000/1000 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1000 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/641 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 1000 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/641 variables, 60/81 constraints. Problems are: Problem set: 0 solved, 1000 unsolved
[2024-05-22 07:07:35] [INFO ] Deduced a trap composed of 32 places in 137 ms of which 3 ms to minimize.
[2024-05-22 07:07:35] [INFO ] Deduced a trap composed of 32 places in 123 ms of which 3 ms to minimize.
[2024-05-22 07:07:35] [INFO ] Deduced a trap composed of 32 places in 124 ms of which 3 ms to minimize.
[2024-05-22 07:07:35] [INFO ] Deduced a trap composed of 32 places in 120 ms of which 3 ms to minimize.
[2024-05-22 07:07:37] [INFO ] Deduced a trap composed of 32 places in 129 ms of which 3 ms to minimize.
[2024-05-22 07:07:37] [INFO ] Deduced a trap composed of 32 places in 119 ms of which 2 ms to minimize.
[2024-05-22 07:07:38] [INFO ] Deduced a trap composed of 32 places in 118 ms of which 2 ms to minimize.
[2024-05-22 07:07:38] [INFO ] Deduced a trap composed of 32 places in 108 ms of which 2 ms to minimize.
[2024-05-22 07:07:38] [INFO ] Deduced a trap composed of 32 places in 105 ms of which 2 ms to minimize.
[2024-05-22 07:07:38] [INFO ] Deduced a trap composed of 32 places in 116 ms of which 3 ms to minimize.
[2024-05-22 07:07:38] [INFO ] Deduced a trap composed of 32 places in 109 ms of which 3 ms to minimize.
[2024-05-22 07:07:38] [INFO ] Deduced a trap composed of 32 places in 108 ms of which 2 ms to minimize.
[2024-05-22 07:07:38] [INFO ] Deduced a trap composed of 32 places in 107 ms of which 3 ms to minimize.
[2024-05-22 07:07:38] [INFO ] Deduced a trap composed of 32 places in 120 ms of which 4 ms to minimize.
[2024-05-22 07:07:39] [INFO ] Deduced a trap composed of 32 places in 109 ms of which 3 ms to minimize.
[2024-05-22 07:07:39] [INFO ] Deduced a trap composed of 32 places in 120 ms of which 3 ms to minimize.
[2024-05-22 07:07:39] [INFO ] Deduced a trap composed of 32 places in 111 ms of which 2 ms to minimize.
[2024-05-22 07:07:39] [INFO ] Deduced a trap composed of 32 places in 114 ms of which 3 ms to minimize.
[2024-05-22 07:07:39] [INFO ] Deduced a trap composed of 32 places in 111 ms of which 3 ms to minimize.
[2024-05-22 07:07:39] [INFO ] Deduced a trap composed of 32 places in 102 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/641 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 1000 unsolved
[2024-05-22 07:07:43] [INFO ] Deduced a trap composed of 32 places in 109 ms of which 2 ms to minimize.
[2024-05-22 07:07:43] [INFO ] Deduced a trap composed of 32 places in 97 ms of which 2 ms to minimize.
[2024-05-22 07:07:43] [INFO ] Deduced a trap composed of 32 places in 90 ms of which 2 ms to minimize.
[2024-05-22 07:07:44] [INFO ] Deduced a trap composed of 32 places in 97 ms of which 3 ms to minimize.
[2024-05-22 07:07:44] [INFO ] Deduced a trap composed of 32 places in 95 ms of which 2 ms to minimize.
[2024-05-22 07:07:44] [INFO ] Deduced a trap composed of 32 places in 92 ms of which 2 ms to minimize.
[2024-05-22 07:07:44] [INFO ] Deduced a trap composed of 32 places in 87 ms of which 2 ms to minimize.
[2024-05-22 07:07:44] [INFO ] Deduced a trap composed of 32 places in 90 ms of which 2 ms to minimize.
[2024-05-22 07:07:44] [INFO ] Deduced a trap composed of 32 places in 86 ms of which 3 ms to minimize.
[2024-05-22 07:07:44] [INFO ] Deduced a trap composed of 32 places in 89 ms of which 2 ms to minimize.
[2024-05-22 07:07:44] [INFO ] Deduced a trap composed of 32 places in 81 ms of which 2 ms to minimize.
[2024-05-22 07:07:44] [INFO ] Deduced a trap composed of 32 places in 78 ms of which 2 ms to minimize.
[2024-05-22 07:07:44] [INFO ] Deduced a trap composed of 32 places in 80 ms of which 2 ms to minimize.
[2024-05-22 07:07:45] [INFO ] Deduced a trap composed of 32 places in 80 ms of which 1 ms to minimize.
[2024-05-22 07:07:45] [INFO ] Deduced a trap composed of 32 places in 91 ms of which 3 ms to minimize.
[2024-05-22 07:07:45] [INFO ] Deduced a trap composed of 32 places in 84 ms of which 2 ms to minimize.
[2024-05-22 07:07:45] [INFO ] Deduced a trap composed of 32 places in 80 ms of which 2 ms to minimize.
[2024-05-22 07:07:45] [INFO ] Deduced a trap composed of 32 places in 75 ms of which 2 ms to minimize.
[2024-05-22 07:07:45] [INFO ] Deduced a trap composed of 32 places in 100 ms of which 2 ms to minimize.
[2024-05-22 07:07:45] [INFO ] Deduced a trap composed of 32 places in 90 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/641 variables, 20/121 constraints. Problems are: Problem set: 0 solved, 1000 unsolved
[2024-05-22 07:07:49] [INFO ] Deduced a trap composed of 32 places in 100 ms of which 3 ms to minimize.
[2024-05-22 07:07:49] [INFO ] Deduced a trap composed of 32 places in 88 ms of which 3 ms to minimize.
[2024-05-22 07:07:50] [INFO ] Deduced a trap composed of 32 places in 89 ms of which 2 ms to minimize.
[2024-05-22 07:07:50] [INFO ] Deduced a trap composed of 32 places in 81 ms of which 2 ms to minimize.
[2024-05-22 07:07:50] [INFO ] Deduced a trap composed of 32 places in 85 ms of which 2 ms to minimize.
[2024-05-22 07:07:50] [INFO ] Deduced a trap composed of 32 places in 82 ms of which 2 ms to minimize.
[2024-05-22 07:07:50] [INFO ] Deduced a trap composed of 32 places in 75 ms of which 2 ms to minimize.
[2024-05-22 07:07:50] [INFO ] Deduced a trap composed of 32 places in 109 ms of which 3 ms to minimize.
[2024-05-22 07:07:50] [INFO ] Deduced a trap composed of 32 places in 114 ms of which 3 ms to minimize.
[2024-05-22 07:07:50] [INFO ] Deduced a trap composed of 32 places in 105 ms of which 2 ms to minimize.
[2024-05-22 07:07:51] [INFO ] Deduced a trap composed of 35 places in 137 ms of which 3 ms to minimize.
[2024-05-22 07:07:51] [INFO ] Deduced a trap composed of 32 places in 132 ms of which 3 ms to minimize.
[2024-05-22 07:07:51] [INFO ] Deduced a trap composed of 32 places in 128 ms of which 3 ms to minimize.
[2024-05-22 07:07:51] [INFO ] Deduced a trap composed of 32 places in 126 ms of which 3 ms to minimize.
[2024-05-22 07:07:51] [INFO ] Deduced a trap composed of 35 places in 118 ms of which 2 ms to minimize.
[2024-05-22 07:07:51] [INFO ] Deduced a trap composed of 32 places in 114 ms of which 3 ms to minimize.
[2024-05-22 07:07:51] [INFO ] Deduced a trap composed of 37 places in 131 ms of which 2 ms to minimize.
[2024-05-22 07:07:52] [INFO ] Deduced a trap composed of 32 places in 121 ms of which 3 ms to minimize.
[2024-05-22 07:07:52] [INFO ] Deduced a trap composed of 32 places in 134 ms of which 2 ms to minimize.
[2024-05-22 07:07:52] [INFO ] Deduced a trap composed of 32 places in 127 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/641 variables, 20/141 constraints. Problems are: Problem set: 0 solved, 1000 unsolved
[2024-05-22 07:07:53] [INFO ] Deduced a trap composed of 32 places in 209 ms of which 4 ms to minimize.
[2024-05-22 07:07:53] [INFO ] Deduced a trap composed of 32 places in 201 ms of which 4 ms to minimize.
[2024-05-22 07:07:53] [INFO ] Deduced a trap composed of 32 places in 197 ms of which 3 ms to minimize.
[2024-05-22 07:07:54] [INFO ] Deduced a trap composed of 32 places in 201 ms of which 3 ms to minimize.
[2024-05-22 07:07:54] [INFO ] Deduced a trap composed of 32 places in 190 ms of which 4 ms to minimize.
[2024-05-22 07:07:54] [INFO ] Deduced a trap composed of 32 places in 192 ms of which 3 ms to minimize.
[2024-05-22 07:07:54] [INFO ] Deduced a trap composed of 35 places in 195 ms of which 4 ms to minimize.
[2024-05-22 07:07:55] [INFO ] Deduced a trap composed of 41 places in 192 ms of which 4 ms to minimize.
[2024-05-22 07:07:55] [INFO ] Deduced a trap composed of 40 places in 197 ms of which 4 ms to minimize.
[2024-05-22 07:07:55] [INFO ] Deduced a trap composed of 39 places in 188 ms of which 3 ms to minimize.
[2024-05-22 07:07:55] [INFO ] Deduced a trap composed of 40 places in 189 ms of which 3 ms to minimize.
[2024-05-22 07:07:55] [INFO ] Deduced a trap composed of 39 places in 188 ms of which 3 ms to minimize.
[2024-05-22 07:07:56] [INFO ] Deduced a trap composed of 43 places in 189 ms of which 3 ms to minimize.
[2024-05-22 07:07:56] [INFO ] Deduced a trap composed of 35 places in 186 ms of which 4 ms to minimize.
[2024-05-22 07:07:56] [INFO ] Deduced a trap composed of 39 places in 188 ms of which 3 ms to minimize.
[2024-05-22 07:07:56] [INFO ] Deduced a trap composed of 36 places in 186 ms of which 3 ms to minimize.
[2024-05-22 07:07:56] [INFO ] Deduced a trap composed of 35 places in 196 ms of which 3 ms to minimize.
[2024-05-22 07:07:57] [INFO ] Deduced a trap composed of 35 places in 197 ms of which 4 ms to minimize.
[2024-05-22 07:07:57] [INFO ] Deduced a trap composed of 37 places in 200 ms of which 3 ms to minimize.
[2024-05-22 07:07:57] [INFO ] Deduced a trap composed of 42 places in 196 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/641 variables, 20/161 constraints. Problems are: Problem set: 0 solved, 1000 unsolved
[2024-05-22 07:08:01] [INFO ] Deduced a trap composed of 32 places in 113 ms of which 2 ms to minimize.
[2024-05-22 07:08:02] [INFO ] Deduced a trap composed of 32 places in 97 ms of which 2 ms to minimize.
[2024-05-22 07:08:02] [INFO ] Deduced a trap composed of 32 places in 94 ms of which 2 ms to minimize.
[2024-05-22 07:08:02] [INFO ] Deduced a trap composed of 32 places in 95 ms of which 2 ms to minimize.
[2024-05-22 07:08:02] [INFO ] Deduced a trap composed of 32 places in 86 ms of which 2 ms to minimize.
[2024-05-22 07:08:02] [INFO ] Deduced a trap composed of 32 places in 85 ms of which 2 ms to minimize.
[2024-05-22 07:08:02] [INFO ] Deduced a trap composed of 32 places in 83 ms of which 2 ms to minimize.
[2024-05-22 07:08:02] [INFO ] Deduced a trap composed of 32 places in 80 ms of which 2 ms to minimize.
[2024-05-22 07:08:02] [INFO ] Deduced a trap composed of 32 places in 96 ms of which 2 ms to minimize.
[2024-05-22 07:08:02] [INFO ] Deduced a trap composed of 32 places in 92 ms of which 2 ms to minimize.
[2024-05-22 07:08:02] [INFO ] Deduced a trap composed of 32 places in 85 ms of which 2 ms to minimize.
[2024-05-22 07:08:03] [INFO ] Deduced a trap composed of 32 places in 93 ms of which 2 ms to minimize.
[2024-05-22 07:08:03] [INFO ] Deduced a trap composed of 32 places in 82 ms of which 2 ms to minimize.
[2024-05-22 07:08:03] [INFO ] Deduced a trap composed of 32 places in 96 ms of which 2 ms to minimize.
[2024-05-22 07:08:03] [INFO ] Deduced a trap composed of 32 places in 81 ms of which 2 ms to minimize.
[2024-05-22 07:08:03] [INFO ] Deduced a trap composed of 32 places in 85 ms of which 2 ms to minimize.
[2024-05-22 07:08:03] [INFO ] Deduced a trap composed of 32 places in 76 ms of which 2 ms to minimize.
[2024-05-22 07:08:03] [INFO ] Deduced a trap composed of 32 places in 76 ms of which 2 ms to minimize.
[2024-05-22 07:08:03] [INFO ] Deduced a trap composed of 32 places in 85 ms of which 2 ms to minimize.
[2024-05-22 07:08:03] [INFO ] Deduced a trap composed of 32 places in 84 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/641 variables, 20/181 constraints. Problems are: Problem set: 0 solved, 1000 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 641/1662 variables, and 181 constraints, problems are : Problem set: 0 solved, 1000 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 0/642 constraints, ReadFeed: 0/780 constraints, PredecessorRefiner: 0/1000 constraints, Known Traps: 160/160 constraints]
After SMT, in 60327ms problems are : Problem set: 0 solved, 1000 unsolved
Search for dead transitions found 0 dead transitions in 60341ms
Starting structural reductions in LTL mode, iteration 1 : 642/657 places, 1020/1048 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62584 ms. Remains : 642/657 places, 1020/1048 transitions.
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-020-LTLCardinality-03
Stuttering criterion allowed to conclude after 328 steps with 0 reset in 3 ms.
FORMULA CANConstruction-PT-020-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-020-LTLCardinality-03 finished in 62699 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 2 out of 657 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 657/657 places, 1048/1048 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 133 transitions
Trivial Post-agglo rules discarded 133 transitions
Performed 133 trivial Post agglomeration. Transition count delta: 133
Iterating post reduction 0 with 133 rules applied. Total rules applied 133 place count 657 transition count 915
Reduce places removed 133 places and 0 transitions.
Iterating post reduction 1 with 133 rules applied. Total rules applied 266 place count 524 transition count 915
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 266 place count 524 transition count 895
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 306 place count 504 transition count 895
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 319 place count 491 transition count 869
Iterating global reduction 2 with 13 rules applied. Total rules applied 332 place count 491 transition count 869
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 2 with 11 rules applied. Total rules applied 343 place count 491 transition count 858
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 354 place count 480 transition count 858
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 36 rules applied. Total rules applied 390 place count 462 transition count 840
Applied a total of 390 rules in 72 ms. Remains 462 /657 variables (removed 195) and now considering 840/1048 (removed 208) transitions.
// Phase 1: matrix 840 rows 462 cols
[2024-05-22 07:08:04] [INFO ] Computed 21 invariants in 3 ms
[2024-05-22 07:08:04] [INFO ] Implicit Places using invariants in 245 ms returned []
[2024-05-22 07:08:04] [INFO ] Invariant cache hit.
[2024-05-22 07:08:04] [INFO ] State equation strengthened by 780 read => feed constraints.
[2024-05-22 07:08:05] [INFO ] Implicit Places using invariants and state equation in 1554 ms returned []
Implicit Place search using SMT with State Equation took 1801 ms to find 0 implicit places.
[2024-05-22 07:08:06] [INFO ] Redundant transitions in 116 ms returned []
Running 820 sub problems to find dead transitions.
[2024-05-22 07:08:06] [INFO ] Invariant cache hit.
[2024-05-22 07:08:06] [INFO ] State equation strengthened by 780 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/461 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 820 unsolved
[2024-05-22 07:08:12] [INFO ] Deduced a trap composed of 23 places in 174 ms of which 3 ms to minimize.
[2024-05-22 07:08:13] [INFO ] Deduced a trap composed of 23 places in 165 ms of which 3 ms to minimize.
[2024-05-22 07:08:13] [INFO ] Deduced a trap composed of 26 places in 177 ms of which 3 ms to minimize.
[2024-05-22 07:08:13] [INFO ] Deduced a trap composed of 25 places in 165 ms of which 3 ms to minimize.
[2024-05-22 07:08:13] [INFO ] Deduced a trap composed of 28 places in 164 ms of which 3 ms to minimize.
[2024-05-22 07:08:13] [INFO ] Deduced a trap composed of 26 places in 160 ms of which 3 ms to minimize.
[2024-05-22 07:08:13] [INFO ] Deduced a trap composed of 26 places in 158 ms of which 2 ms to minimize.
[2024-05-22 07:08:14] [INFO ] Deduced a trap composed of 23 places in 148 ms of which 3 ms to minimize.
[2024-05-22 07:08:14] [INFO ] Deduced a trap composed of 23 places in 140 ms of which 2 ms to minimize.
[2024-05-22 07:08:14] [INFO ] Deduced a trap composed of 23 places in 144 ms of which 3 ms to minimize.
[2024-05-22 07:08:14] [INFO ] Deduced a trap composed of 23 places in 139 ms of which 3 ms to minimize.
[2024-05-22 07:08:14] [INFO ] Deduced a trap composed of 23 places in 137 ms of which 3 ms to minimize.
[2024-05-22 07:08:14] [INFO ] Deduced a trap composed of 23 places in 139 ms of which 2 ms to minimize.
[2024-05-22 07:08:14] [INFO ] Deduced a trap composed of 28 places in 127 ms of which 3 ms to minimize.
[2024-05-22 07:08:15] [INFO ] Deduced a trap composed of 23 places in 135 ms of which 3 ms to minimize.
[2024-05-22 07:08:15] [INFO ] Deduced a trap composed of 23 places in 136 ms of which 2 ms to minimize.
[2024-05-22 07:08:15] [INFO ] Deduced a trap composed of 23 places in 127 ms of which 3 ms to minimize.
[2024-05-22 07:08:15] [INFO ] Deduced a trap composed of 23 places in 119 ms of which 3 ms to minimize.
[2024-05-22 07:08:15] [INFO ] Deduced a trap composed of 23 places in 113 ms of which 3 ms to minimize.
[2024-05-22 07:08:15] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/461 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 820 unsolved
[2024-05-22 07:08:16] [INFO ] Deduced a trap composed of 23 places in 121 ms of which 3 ms to minimize.
[2024-05-22 07:08:16] [INFO ] Deduced a trap composed of 27 places in 121 ms of which 3 ms to minimize.
[2024-05-22 07:08:16] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 2 ms to minimize.
[2024-05-22 07:08:17] [INFO ] Deduced a trap composed of 23 places in 149 ms of which 3 ms to minimize.
[2024-05-22 07:08:17] [INFO ] Deduced a trap composed of 23 places in 139 ms of which 3 ms to minimize.
[2024-05-22 07:08:17] [INFO ] Deduced a trap composed of 24 places in 137 ms of which 3 ms to minimize.
[2024-05-22 07:08:17] [INFO ] Deduced a trap composed of 26 places in 138 ms of which 2 ms to minimize.
[2024-05-22 07:08:17] [INFO ] Deduced a trap composed of 27 places in 148 ms of which 2 ms to minimize.
[2024-05-22 07:08:17] [INFO ] Deduced a trap composed of 28 places in 146 ms of which 2 ms to minimize.
[2024-05-22 07:08:18] [INFO ] Deduced a trap composed of 23 places in 136 ms of which 3 ms to minimize.
[2024-05-22 07:08:18] [INFO ] Deduced a trap composed of 26 places in 138 ms of which 3 ms to minimize.
[2024-05-22 07:08:18] [INFO ] Deduced a trap composed of 25 places in 135 ms of which 3 ms to minimize.
[2024-05-22 07:08:18] [INFO ] Deduced a trap composed of 23 places in 133 ms of which 2 ms to minimize.
[2024-05-22 07:08:18] [INFO ] Deduced a trap composed of 23 places in 134 ms of which 3 ms to minimize.
[2024-05-22 07:08:18] [INFO ] Deduced a trap composed of 23 places in 129 ms of which 2 ms to minimize.
[2024-05-22 07:08:18] [INFO ] Deduced a trap composed of 23 places in 122 ms of which 3 ms to minimize.
[2024-05-22 07:08:19] [INFO ] Deduced a trap composed of 23 places in 125 ms of which 2 ms to minimize.
[2024-05-22 07:08:19] [INFO ] Deduced a trap composed of 26 places in 137 ms of which 3 ms to minimize.
[2024-05-22 07:08:19] [INFO ] Deduced a trap composed of 23 places in 121 ms of which 3 ms to minimize.
[2024-05-22 07:08:19] [INFO ] Deduced a trap composed of 23 places in 119 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/461 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 820 unsolved
[2024-05-22 07:08:20] [INFO ] Deduced a trap composed of 24 places in 125 ms of which 3 ms to minimize.
[2024-05-22 07:08:20] [INFO ] Deduced a trap composed of 25 places in 118 ms of which 2 ms to minimize.
[2024-05-22 07:08:20] [INFO ] Deduced a trap composed of 23 places in 123 ms of which 2 ms to minimize.
[2024-05-22 07:08:20] [INFO ] Deduced a trap composed of 27 places in 109 ms of which 2 ms to minimize.
[2024-05-22 07:08:21] [INFO ] Deduced a trap composed of 25 places in 117 ms of which 2 ms to minimize.
[2024-05-22 07:08:21] [INFO ] Deduced a trap composed of 23 places in 141 ms of which 2 ms to minimize.
[2024-05-22 07:08:21] [INFO ] Deduced a trap composed of 23 places in 130 ms of which 3 ms to minimize.
[2024-05-22 07:08:21] [INFO ] Deduced a trap composed of 25 places in 129 ms of which 3 ms to minimize.
[2024-05-22 07:08:21] [INFO ] Deduced a trap composed of 23 places in 118 ms of which 3 ms to minimize.
[2024-05-22 07:08:21] [INFO ] Deduced a trap composed of 23 places in 115 ms of which 3 ms to minimize.
[2024-05-22 07:08:21] [INFO ] Deduced a trap composed of 23 places in 110 ms of which 2 ms to minimize.
[2024-05-22 07:08:22] [INFO ] Deduced a trap composed of 25 places in 136 ms of which 2 ms to minimize.
[2024-05-22 07:08:22] [INFO ] Deduced a trap composed of 26 places in 129 ms of which 2 ms to minimize.
[2024-05-22 07:08:22] [INFO ] Deduced a trap composed of 23 places in 125 ms of which 2 ms to minimize.
[2024-05-22 07:08:22] [INFO ] Deduced a trap composed of 23 places in 126 ms of which 3 ms to minimize.
[2024-05-22 07:08:22] [INFO ] Deduced a trap composed of 23 places in 121 ms of which 3 ms to minimize.
[2024-05-22 07:08:22] [INFO ] Deduced a trap composed of 23 places in 119 ms of which 2 ms to minimize.
[2024-05-22 07:08:22] [INFO ] Deduced a trap composed of 26 places in 109 ms of which 3 ms to minimize.
[2024-05-22 07:08:23] [INFO ] Deduced a trap composed of 23 places in 120 ms of which 3 ms to minimize.
[2024-05-22 07:08:23] [INFO ] Deduced a trap composed of 23 places in 112 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/461 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 820 unsolved
[2024-05-22 07:08:29] [INFO ] Deduced a trap composed of 23 places in 170 ms of which 3 ms to minimize.
[2024-05-22 07:08:29] [INFO ] Deduced a trap composed of 23 places in 160 ms of which 3 ms to minimize.
[2024-05-22 07:08:29] [INFO ] Deduced a trap composed of 23 places in 113 ms of which 3 ms to minimize.
[2024-05-22 07:08:29] [INFO ] Deduced a trap composed of 23 places in 107 ms of which 3 ms to minimize.
[2024-05-22 07:08:29] [INFO ] Deduced a trap composed of 23 places in 114 ms of which 2 ms to minimize.
[2024-05-22 07:08:30] [INFO ] Deduced a trap composed of 23 places in 122 ms of which 2 ms to minimize.
[2024-05-22 07:08:30] [INFO ] Deduced a trap composed of 23 places in 124 ms of which 3 ms to minimize.
[2024-05-22 07:08:30] [INFO ] Deduced a trap composed of 23 places in 115 ms of which 5 ms to minimize.
[2024-05-22 07:08:30] [INFO ] Deduced a trap composed of 23 places in 124 ms of which 3 ms to minimize.
[2024-05-22 07:08:30] [INFO ] Deduced a trap composed of 26 places in 123 ms of which 2 ms to minimize.
[2024-05-22 07:08:30] [INFO ] Deduced a trap composed of 26 places in 122 ms of which 2 ms to minimize.
[2024-05-22 07:08:31] [INFO ] Deduced a trap composed of 26 places in 122 ms of which 3 ms to minimize.
[2024-05-22 07:08:31] [INFO ] Deduced a trap composed of 23 places in 124 ms of which 3 ms to minimize.
[2024-05-22 07:08:31] [INFO ] Deduced a trap composed of 25 places in 135 ms of which 3 ms to minimize.
[2024-05-22 07:08:31] [INFO ] Deduced a trap composed of 23 places in 136 ms of which 3 ms to minimize.
[2024-05-22 07:08:31] [INFO ] Deduced a trap composed of 23 places in 143 ms of which 3 ms to minimize.
[2024-05-22 07:08:31] [INFO ] Deduced a trap composed of 28 places in 140 ms of which 3 ms to minimize.
[2024-05-22 07:08:31] [INFO ] Deduced a trap composed of 23 places in 125 ms of which 2 ms to minimize.
[2024-05-22 07:08:32] [INFO ] Deduced a trap composed of 23 places in 118 ms of which 2 ms to minimize.
[2024-05-22 07:08:32] [INFO ] Deduced a trap composed of 23 places in 114 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/461 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 820 unsolved
[2024-05-22 07:08:33] [INFO ] Deduced a trap composed of 23 places in 130 ms of which 2 ms to minimize.
[2024-05-22 07:08:33] [INFO ] Deduced a trap composed of 23 places in 119 ms of which 2 ms to minimize.
[2024-05-22 07:08:33] [INFO ] Deduced a trap composed of 23 places in 109 ms of which 3 ms to minimize.
[2024-05-22 07:08:33] [INFO ] Deduced a trap composed of 23 places in 117 ms of which 2 ms to minimize.
[2024-05-22 07:08:33] [INFO ] Deduced a trap composed of 23 places in 134 ms of which 3 ms to minimize.
[2024-05-22 07:08:34] [INFO ] Deduced a trap composed of 23 places in 126 ms of which 3 ms to minimize.
[2024-05-22 07:08:34] [INFO ] Deduced a trap composed of 23 places in 129 ms of which 3 ms to minimize.
[2024-05-22 07:08:34] [INFO ] Deduced a trap composed of 26 places in 119 ms of which 3 ms to minimize.
[2024-05-22 07:08:34] [INFO ] Deduced a trap composed of 23 places in 115 ms of which 2 ms to minimize.
[2024-05-22 07:08:34] [INFO ] Deduced a trap composed of 26 places in 113 ms of which 2 ms to minimize.
[2024-05-22 07:08:34] [INFO ] Deduced a trap composed of 23 places in 115 ms of which 2 ms to minimize.
[2024-05-22 07:08:34] [INFO ] Deduced a trap composed of 23 places in 101 ms of which 3 ms to minimize.
[2024-05-22 07:08:34] [INFO ] Deduced a trap composed of 23 places in 129 ms of which 3 ms to minimize.
[2024-05-22 07:08:35] [INFO ] Deduced a trap composed of 28 places in 120 ms of which 3 ms to minimize.
[2024-05-22 07:08:35] [INFO ] Deduced a trap composed of 23 places in 119 ms of which 2 ms to minimize.
[2024-05-22 07:08:35] [INFO ] Deduced a trap composed of 23 places in 121 ms of which 3 ms to minimize.
[2024-05-22 07:08:35] [INFO ] Deduced a trap composed of 23 places in 130 ms of which 2 ms to minimize.
[2024-05-22 07:08:35] [INFO ] Deduced a trap composed of 23 places in 127 ms of which 2 ms to minimize.
[2024-05-22 07:08:35] [INFO ] Deduced a trap composed of 24 places in 128 ms of which 3 ms to minimize.
[2024-05-22 07:08:36] [INFO ] Deduced a trap composed of 23 places in 125 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/461 variables, 20/121 constraints. Problems are: Problem set: 0 solved, 820 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s2 1.0)
(s3 0.0)
(s4 0.0)
(s5 1.0)
(s6 0.0)
(s7 0.0)
(s8 1.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 1.0)
(s13 0.0)
(s14 1.0)
(s15 0.0)
(s16 0.0)
(s17 1.0)
(s18 0.0)
(s19 0.0)
(s20 1.0)
(s21 0.0)
(s22 0.0)
(s23 1.0)
(s24 0.0)
(s25 0.0)
(s26 1.0)
(s27 0.0)
(s28 0.0)
(s29 1.0)
(s30 0.0)
(s31 0.0)
(s32 1.0)
(s33 0.0)
(s34 0.0)
(s35 1.0)
(s36 0.0)
(s37 0.0)
(s38 1.0)
(s39 0.0)
(s40 0.0)
(s41 1.0)
(s42 0.0)
(s43 0.0)
(s44 1.0)
(s45 0.0)
(s46 0.0)
(s47 1.0)
(s48 0.0)
(s49 0.0)
(s50 1.0)
(s51 0.0)
(s52 0.0)
(s53 1.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 1.0)
(s98 0.0)
(s99 1.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 461/1302 variables, and 121 constraints, problems are : Problem set: 0 solved, 820 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 0/462 constraints, ReadFeed: 0/780 constraints, PredecessorRefiner: 820/820 constraints, Known Traps: 100/100 constraints]
Escalating to Integer solving :Problem set: 0 solved, 820 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/461 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 820 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/461 variables, 100/121 constraints. Problems are: Problem set: 0 solved, 820 unsolved
[2024-05-22 07:08:37] [INFO ] Deduced a trap composed of 23 places in 119 ms of which 3 ms to minimize.
[2024-05-22 07:08:37] [INFO ] Deduced a trap composed of 23 places in 122 ms of which 3 ms to minimize.
[2024-05-22 07:08:38] [INFO ] Deduced a trap composed of 23 places in 115 ms of which 2 ms to minimize.
[2024-05-22 07:08:38] [INFO ] Deduced a trap composed of 23 places in 117 ms of which 2 ms to minimize.
[2024-05-22 07:08:38] [INFO ] Deduced a trap composed of 23 places in 118 ms of which 2 ms to minimize.
[2024-05-22 07:08:38] [INFO ] Deduced a trap composed of 23 places in 108 ms of which 2 ms to minimize.
[2024-05-22 07:08:38] [INFO ] Deduced a trap composed of 23 places in 107 ms of which 2 ms to minimize.
[2024-05-22 07:08:38] [INFO ] Deduced a trap composed of 23 places in 109 ms of which 3 ms to minimize.
[2024-05-22 07:08:38] [INFO ] Deduced a trap composed of 23 places in 123 ms of which 3 ms to minimize.
[2024-05-22 07:08:39] [INFO ] Deduced a trap composed of 23 places in 113 ms of which 2 ms to minimize.
[2024-05-22 07:08:39] [INFO ] Deduced a trap composed of 23 places in 125 ms of which 2 ms to minimize.
[2024-05-22 07:08:39] [INFO ] Deduced a trap composed of 23 places in 113 ms of which 2 ms to minimize.
[2024-05-22 07:08:39] [INFO ] Deduced a trap composed of 23 places in 113 ms of which 3 ms to minimize.
[2024-05-22 07:08:39] [INFO ] Deduced a trap composed of 23 places in 104 ms of which 2 ms to minimize.
[2024-05-22 07:08:39] [INFO ] Deduced a trap composed of 23 places in 108 ms of which 2 ms to minimize.
[2024-05-22 07:08:39] [INFO ] Deduced a trap composed of 23 places in 108 ms of which 3 ms to minimize.
[2024-05-22 07:08:40] [INFO ] Deduced a trap composed of 23 places in 104 ms of which 2 ms to minimize.
[2024-05-22 07:08:40] [INFO ] Deduced a trap composed of 23 places in 108 ms of which 2 ms to minimize.
[2024-05-22 07:08:40] [INFO ] Deduced a trap composed of 23 places in 103 ms of which 2 ms to minimize.
[2024-05-22 07:08:40] [INFO ] Deduced a trap composed of 23 places in 128 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/461 variables, 20/141 constraints. Problems are: Problem set: 0 solved, 820 unsolved
[2024-05-22 07:08:40] [INFO ] Deduced a trap composed of 23 places in 166 ms of which 3 ms to minimize.
[2024-05-22 07:08:41] [INFO ] Deduced a trap composed of 23 places in 164 ms of which 3 ms to minimize.
[2024-05-22 07:08:41] [INFO ] Deduced a trap composed of 23 places in 161 ms of which 3 ms to minimize.
[2024-05-22 07:08:41] [INFO ] Deduced a trap composed of 23 places in 118 ms of which 3 ms to minimize.
[2024-05-22 07:08:42] [INFO ] Deduced a trap composed of 23 places in 117 ms of which 3 ms to minimize.
[2024-05-22 07:08:42] [INFO ] Deduced a trap composed of 25 places in 118 ms of which 2 ms to minimize.
[2024-05-22 07:08:42] [INFO ] Deduced a trap composed of 23 places in 106 ms of which 3 ms to minimize.
[2024-05-22 07:08:42] [INFO ] Deduced a trap composed of 23 places in 101 ms of which 3 ms to minimize.
[2024-05-22 07:08:42] [INFO ] Deduced a trap composed of 23 places in 108 ms of which 3 ms to minimize.
[2024-05-22 07:08:43] [INFO ] Deduced a trap composed of 23 places in 99 ms of which 2 ms to minimize.
[2024-05-22 07:08:43] [INFO ] Deduced a trap composed of 26 places in 129 ms of which 4 ms to minimize.
[2024-05-22 07:08:43] [INFO ] Deduced a trap composed of 23 places in 125 ms of which 3 ms to minimize.
[2024-05-22 07:08:43] [INFO ] Deduced a trap composed of 23 places in 123 ms of which 3 ms to minimize.
[2024-05-22 07:08:43] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 3 ms to minimize.
[2024-05-22 07:08:43] [INFO ] Deduced a trap composed of 23 places in 129 ms of which 3 ms to minimize.
[2024-05-22 07:08:44] [INFO ] Deduced a trap composed of 25 places in 122 ms of which 3 ms to minimize.
[2024-05-22 07:08:44] [INFO ] Deduced a trap composed of 26 places in 123 ms of which 3 ms to minimize.
[2024-05-22 07:08:44] [INFO ] Deduced a trap composed of 23 places in 117 ms of which 3 ms to minimize.
[2024-05-22 07:08:44] [INFO ] Deduced a trap composed of 23 places in 110 ms of which 3 ms to minimize.
[2024-05-22 07:08:44] [INFO ] Deduced a trap composed of 23 places in 108 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/461 variables, 20/161 constraints. Problems are: Problem set: 0 solved, 820 unsolved
[2024-05-22 07:08:45] [INFO ] Deduced a trap composed of 23 places in 106 ms of which 2 ms to minimize.
[2024-05-22 07:08:46] [INFO ] Deduced a trap composed of 23 places in 117 ms of which 3 ms to minimize.
[2024-05-22 07:08:46] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 2 ms to minimize.
[2024-05-22 07:08:46] [INFO ] Deduced a trap composed of 23 places in 101 ms of which 2 ms to minimize.
[2024-05-22 07:08:46] [INFO ] Deduced a trap composed of 23 places in 121 ms of which 3 ms to minimize.
[2024-05-22 07:08:46] [INFO ] Deduced a trap composed of 23 places in 121 ms of which 3 ms to minimize.
[2024-05-22 07:08:46] [INFO ] Deduced a trap composed of 23 places in 107 ms of which 3 ms to minimize.
[2024-05-22 07:08:46] [INFO ] Deduced a trap composed of 23 places in 102 ms of which 3 ms to minimize.
[2024-05-22 07:08:47] [INFO ] Deduced a trap composed of 23 places in 137 ms of which 3 ms to minimize.
[2024-05-22 07:08:47] [INFO ] Deduced a trap composed of 23 places in 139 ms of which 3 ms to minimize.
[2024-05-22 07:08:47] [INFO ] Deduced a trap composed of 26 places in 130 ms of which 3 ms to minimize.
[2024-05-22 07:08:47] [INFO ] Deduced a trap composed of 27 places in 130 ms of which 2 ms to minimize.
[2024-05-22 07:08:47] [INFO ] Deduced a trap composed of 23 places in 130 ms of which 3 ms to minimize.
[2024-05-22 07:08:47] [INFO ] Deduced a trap composed of 23 places in 121 ms of which 3 ms to minimize.
[2024-05-22 07:08:48] [INFO ] Deduced a trap composed of 23 places in 116 ms of which 3 ms to minimize.
[2024-05-22 07:08:48] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 3 ms to minimize.
[2024-05-22 07:08:48] [INFO ] Deduced a trap composed of 27 places in 100 ms of which 2 ms to minimize.
[2024-05-22 07:08:48] [INFO ] Deduced a trap composed of 23 places in 108 ms of which 3 ms to minimize.
[2024-05-22 07:08:48] [INFO ] Deduced a trap composed of 26 places in 131 ms of which 2 ms to minimize.
[2024-05-22 07:08:48] [INFO ] Deduced a trap composed of 25 places in 122 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/461 variables, 20/181 constraints. Problems are: Problem set: 0 solved, 820 unsolved
[2024-05-22 07:08:50] [INFO ] Deduced a trap composed of 24 places in 120 ms of which 2 ms to minimize.
[2024-05-22 07:08:50] [INFO ] Deduced a trap composed of 23 places in 108 ms of which 2 ms to minimize.
[2024-05-22 07:08:50] [INFO ] Deduced a trap composed of 23 places in 108 ms of which 3 ms to minimize.
[2024-05-22 07:08:50] [INFO ] Deduced a trap composed of 23 places in 120 ms of which 3 ms to minimize.
[2024-05-22 07:08:50] [INFO ] Deduced a trap composed of 23 places in 108 ms of which 3 ms to minimize.
[2024-05-22 07:08:51] [INFO ] Deduced a trap composed of 23 places in 123 ms of which 2 ms to minimize.
[2024-05-22 07:08:51] [INFO ] Deduced a trap composed of 23 places in 127 ms of which 3 ms to minimize.
[2024-05-22 07:08:51] [INFO ] Deduced a trap composed of 23 places in 112 ms of which 3 ms to minimize.
[2024-05-22 07:08:51] [INFO ] Deduced a trap composed of 23 places in 128 ms of which 2 ms to minimize.
[2024-05-22 07:08:51] [INFO ] Deduced a trap composed of 23 places in 125 ms of which 2 ms to minimize.
[2024-05-22 07:08:51] [INFO ] Deduced a trap composed of 26 places in 129 ms of which 3 ms to minimize.
[2024-05-22 07:08:51] [INFO ] Deduced a trap composed of 23 places in 124 ms of which 3 ms to minimize.
[2024-05-22 07:08:52] [INFO ] Deduced a trap composed of 23 places in 119 ms of which 3 ms to minimize.
[2024-05-22 07:08:52] [INFO ] Deduced a trap composed of 23 places in 109 ms of which 2 ms to minimize.
[2024-05-22 07:08:52] [INFO ] Deduced a trap composed of 23 places in 120 ms of which 2 ms to minimize.
[2024-05-22 07:08:52] [INFO ] Deduced a trap composed of 23 places in 114 ms of which 3 ms to minimize.
[2024-05-22 07:08:52] [INFO ] Deduced a trap composed of 23 places in 114 ms of which 2 ms to minimize.
[2024-05-22 07:08:52] [INFO ] Deduced a trap composed of 23 places in 106 ms of which 2 ms to minimize.
[2024-05-22 07:08:52] [INFO ] Deduced a trap composed of 23 places in 106 ms of which 3 ms to minimize.
[2024-05-22 07:08:53] [INFO ] Deduced a trap composed of 23 places in 124 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/461 variables, 20/201 constraints. Problems are: Problem set: 0 solved, 820 unsolved
[2024-05-22 07:08:53] [INFO ] Deduced a trap composed of 23 places in 163 ms of which 3 ms to minimize.
[2024-05-22 07:08:53] [INFO ] Deduced a trap composed of 23 places in 159 ms of which 3 ms to minimize.
[2024-05-22 07:08:54] [INFO ] Deduced a trap composed of 23 places in 108 ms of which 3 ms to minimize.
[2024-05-22 07:08:55] [INFO ] Deduced a trap composed of 23 places in 122 ms of which 2 ms to minimize.
[2024-05-22 07:08:55] [INFO ] Deduced a trap composed of 23 places in 107 ms of which 3 ms to minimize.
[2024-05-22 07:08:55] [INFO ] Deduced a trap composed of 23 places in 108 ms of which 3 ms to minimize.
[2024-05-22 07:08:55] [INFO ] Deduced a trap composed of 23 places in 109 ms of which 3 ms to minimize.
[2024-05-22 07:08:55] [INFO ] Deduced a trap composed of 23 places in 125 ms of which 3 ms to minimize.
[2024-05-22 07:08:55] [INFO ] Deduced a trap composed of 23 places in 112 ms of which 3 ms to minimize.
[2024-05-22 07:08:55] [INFO ] Deduced a trap composed of 23 places in 103 ms of which 3 ms to minimize.
[2024-05-22 07:08:56] [INFO ] Deduced a trap composed of 23 places in 113 ms of which 3 ms to minimize.
[2024-05-22 07:08:56] [INFO ] Deduced a trap composed of 23 places in 95 ms of which 3 ms to minimize.
[2024-05-22 07:08:56] [INFO ] Deduced a trap composed of 24 places in 120 ms of which 3 ms to minimize.
[2024-05-22 07:08:56] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 3 ms to minimize.
[2024-05-22 07:08:56] [INFO ] Deduced a trap composed of 25 places in 122 ms of which 2 ms to minimize.
[2024-05-22 07:08:56] [INFO ] Deduced a trap composed of 23 places in 114 ms of which 3 ms to minimize.
[2024-05-22 07:08:57] [INFO ] Deduced a trap composed of 26 places in 150 ms of which 2 ms to minimize.
[2024-05-22 07:08:57] [INFO ] Deduced a trap composed of 25 places in 124 ms of which 2 ms to minimize.
[2024-05-22 07:08:57] [INFO ] Deduced a trap composed of 24 places in 111 ms of which 3 ms to minimize.
[2024-05-22 07:08:57] [INFO ] Deduced a trap composed of 23 places in 106 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/461 variables, 20/221 constraints. Problems are: Problem set: 0 solved, 820 unsolved
[2024-05-22 07:08:58] [INFO ] Deduced a trap composed of 23 places in 161 ms of which 3 ms to minimize.
[2024-05-22 07:08:58] [INFO ] Deduced a trap composed of 23 places in 116 ms of which 3 ms to minimize.
[2024-05-22 07:08:58] [INFO ] Deduced a trap composed of 23 places in 116 ms of which 3 ms to minimize.
[2024-05-22 07:08:58] [INFO ] Deduced a trap composed of 23 places in 107 ms of which 3 ms to minimize.
[2024-05-22 07:08:59] [INFO ] Deduced a trap composed of 23 places in 106 ms of which 2 ms to minimize.
[2024-05-22 07:08:59] [INFO ] Deduced a trap composed of 23 places in 107 ms of which 2 ms to minimize.
[2024-05-22 07:08:59] [INFO ] Deduced a trap composed of 23 places in 99 ms of which 3 ms to minimize.
[2024-05-22 07:08:59] [INFO ] Deduced a trap composed of 23 places in 114 ms of which 3 ms to minimize.
[2024-05-22 07:09:00] [INFO ] Deduced a trap composed of 23 places in 109 ms of which 2 ms to minimize.
[2024-05-22 07:09:00] [INFO ] Deduced a trap composed of 23 places in 112 ms of which 2 ms to minimize.
[2024-05-22 07:09:00] [INFO ] Deduced a trap composed of 24 places in 118 ms of which 3 ms to minimize.
[2024-05-22 07:09:01] [INFO ] Deduced a trap composed of 23 places in 107 ms of which 2 ms to minimize.
[2024-05-22 07:09:01] [INFO ] Deduced a trap composed of 23 places in 102 ms of which 2 ms to minimize.
[2024-05-22 07:09:01] [INFO ] Deduced a trap composed of 23 places in 121 ms of which 3 ms to minimize.
[2024-05-22 07:09:01] [INFO ] Deduced a trap composed of 23 places in 114 ms of which 3 ms to minimize.
[2024-05-22 07:09:01] [INFO ] Deduced a trap composed of 23 places in 103 ms of which 2 ms to minimize.
[2024-05-22 07:09:01] [INFO ] Deduced a trap composed of 23 places in 109 ms of which 3 ms to minimize.
[2024-05-22 07:09:02] [INFO ] Deduced a trap composed of 23 places in 136 ms of which 3 ms to minimize.
[2024-05-22 07:09:02] [INFO ] Deduced a trap composed of 23 places in 129 ms of which 3 ms to minimize.
[2024-05-22 07:09:02] [INFO ] Deduced a trap composed of 23 places in 121 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/461 variables, 20/241 constraints. Problems are: Problem set: 0 solved, 820 unsolved
[2024-05-22 07:09:03] [INFO ] Deduced a trap composed of 23 places in 124 ms of which 3 ms to minimize.
[2024-05-22 07:09:03] [INFO ] Deduced a trap composed of 23 places in 114 ms of which 2 ms to minimize.
[2024-05-22 07:09:03] [INFO ] Deduced a trap composed of 23 places in 116 ms of which 3 ms to minimize.
[2024-05-22 07:09:03] [INFO ] Deduced a trap composed of 23 places in 106 ms of which 3 ms to minimize.
[2024-05-22 07:09:03] [INFO ] Deduced a trap composed of 23 places in 108 ms of which 2 ms to minimize.
[2024-05-22 07:09:04] [INFO ] Deduced a trap composed of 23 places in 104 ms of which 3 ms to minimize.
[2024-05-22 07:09:04] [INFO ] Deduced a trap composed of 23 places in 108 ms of which 2 ms to minimize.
[2024-05-22 07:09:04] [INFO ] Deduced a trap composed of 23 places in 103 ms of which 2 ms to minimize.
[2024-05-22 07:09:04] [INFO ] Deduced a trap composed of 23 places in 101 ms of which 2 ms to minimize.
[2024-05-22 07:09:05] [INFO ] Deduced a trap composed of 23 places in 119 ms of which 3 ms to minimize.
[2024-05-22 07:09:05] [INFO ] Deduced a trap composed of 23 places in 109 ms of which 2 ms to minimize.
[2024-05-22 07:09:05] [INFO ] Deduced a trap composed of 25 places in 111 ms of which 3 ms to minimize.
[2024-05-22 07:09:05] [INFO ] Deduced a trap composed of 23 places in 107 ms of which 3 ms to minimize.
[2024-05-22 07:09:05] [INFO ] Deduced a trap composed of 23 places in 124 ms of which 3 ms to minimize.
[2024-05-22 07:09:05] [INFO ] Deduced a trap composed of 24 places in 119 ms of which 3 ms to minimize.
[2024-05-22 07:09:06] [INFO ] Deduced a trap composed of 23 places in 104 ms of which 3 ms to minimize.
[2024-05-22 07:09:06] [INFO ] Deduced a trap composed of 23 places in 108 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 461/1302 variables, and 258 constraints, problems are : Problem set: 0 solved, 820 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 0/462 constraints, ReadFeed: 0/780 constraints, PredecessorRefiner: 0/820 constraints, Known Traps: 237/237 constraints]
After SMT, in 60295ms problems are : Problem set: 0 solved, 820 unsolved
Search for dead transitions found 0 dead transitions in 60304ms
Starting structural reductions in SI_LTL mode, iteration 1 : 462/657 places, 840/1048 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 62305 ms. Remains : 462/657 places, 840/1048 transitions.
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-020-LTLCardinality-05
Product exploration explored 100000 steps with 769 reset in 469 ms.
Stack based approach found an accepted trace after 1640 steps with 12 reset with depth 136 and stack size 135 in 8 ms.
FORMULA CANConstruction-PT-020-LTLCardinality-05 FALSE TECHNIQUES STACK_TEST
Treatment of property CANConstruction-PT-020-LTLCardinality-05 finished in 62910 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(p0)&&X((p1 U (p2||G(p1))))))'
Support contains 5 out of 657 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 657/657 places, 1048/1048 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 643 transition count 1022
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 643 transition count 1022
Applied a total of 28 rules in 30 ms. Remains 643 /657 variables (removed 14) and now considering 1022/1048 (removed 26) transitions.
// Phase 1: matrix 1022 rows 643 cols
[2024-05-22 07:09:07] [INFO ] Computed 21 invariants in 4 ms
[2024-05-22 07:09:07] [INFO ] Implicit Places using invariants in 292 ms returned []
[2024-05-22 07:09:07] [INFO ] Invariant cache hit.
[2024-05-22 07:09:07] [INFO ] State equation strengthened by 780 read => feed constraints.
[2024-05-22 07:09:09] [INFO ] Implicit Places using invariants and state equation in 1836 ms returned []
Implicit Place search using SMT with State Equation took 2143 ms to find 0 implicit places.
Running 1002 sub problems to find dead transitions.
[2024-05-22 07:09:09] [INFO ] Invariant cache hit.
[2024-05-22 07:09:09] [INFO ] State equation strengthened by 780 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/642 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 1002 unsolved
[2024-05-22 07:09:22] [INFO ] Deduced a trap composed of 32 places in 139 ms of which 3 ms to minimize.
[2024-05-22 07:09:22] [INFO ] Deduced a trap composed of 32 places in 140 ms of which 2 ms to minimize.
[2024-05-22 07:09:22] [INFO ] Deduced a trap composed of 32 places in 139 ms of which 3 ms to minimize.
[2024-05-22 07:09:22] [INFO ] Deduced a trap composed of 33 places in 135 ms of which 3 ms to minimize.
[2024-05-22 07:09:22] [INFO ] Deduced a trap composed of 32 places in 138 ms of which 3 ms to minimize.
[2024-05-22 07:09:23] [INFO ] Deduced a trap composed of 32 places in 139 ms of which 3 ms to minimize.
[2024-05-22 07:09:23] [INFO ] Deduced a trap composed of 35 places in 145 ms of which 3 ms to minimize.
[2024-05-22 07:09:23] [INFO ] Deduced a trap composed of 32 places in 132 ms of which 3 ms to minimize.
[2024-05-22 07:09:23] [INFO ] Deduced a trap composed of 32 places in 124 ms of which 3 ms to minimize.
[2024-05-22 07:09:23] [INFO ] Deduced a trap composed of 32 places in 127 ms of which 2 ms to minimize.
[2024-05-22 07:09:23] [INFO ] Deduced a trap composed of 32 places in 118 ms of which 3 ms to minimize.
[2024-05-22 07:09:23] [INFO ] Deduced a trap composed of 32 places in 110 ms of which 2 ms to minimize.
[2024-05-22 07:09:24] [INFO ] Deduced a trap composed of 32 places in 128 ms of which 3 ms to minimize.
[2024-05-22 07:09:24] [INFO ] Deduced a trap composed of 32 places in 114 ms of which 2 ms to minimize.
[2024-05-22 07:09:24] [INFO ] Deduced a trap composed of 38 places in 117 ms of which 3 ms to minimize.
[2024-05-22 07:09:24] [INFO ] Deduced a trap composed of 37 places in 124 ms of which 2 ms to minimize.
[2024-05-22 07:09:24] [INFO ] Deduced a trap composed of 38 places in 122 ms of which 2 ms to minimize.
[2024-05-22 07:09:24] [INFO ] Deduced a trap composed of 33 places in 134 ms of which 3 ms to minimize.
[2024-05-22 07:09:24] [INFO ] Deduced a trap composed of 33 places in 135 ms of which 4 ms to minimize.
[2024-05-22 07:09:25] [INFO ] Deduced a trap composed of 35 places in 142 ms of which 4 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/642 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 1002 unsolved
[2024-05-22 07:09:28] [INFO ] Deduced a trap composed of 32 places in 133 ms of which 3 ms to minimize.
[2024-05-22 07:09:29] [INFO ] Deduced a trap composed of 32 places in 126 ms of which 2 ms to minimize.
[2024-05-22 07:09:29] [INFO ] Deduced a trap composed of 32 places in 125 ms of which 3 ms to minimize.
[2024-05-22 07:09:29] [INFO ] Deduced a trap composed of 35 places in 142 ms of which 3 ms to minimize.
[2024-05-22 07:09:29] [INFO ] Deduced a trap composed of 32 places in 120 ms of which 3 ms to minimize.
[2024-05-22 07:09:29] [INFO ] Deduced a trap composed of 41 places in 130 ms of which 3 ms to minimize.
[2024-05-22 07:09:29] [INFO ] Deduced a trap composed of 32 places in 123 ms of which 2 ms to minimize.
[2024-05-22 07:09:29] [INFO ] Deduced a trap composed of 32 places in 117 ms of which 2 ms to minimize.
[2024-05-22 07:09:30] [INFO ] Deduced a trap composed of 32 places in 116 ms of which 3 ms to minimize.
[2024-05-22 07:09:30] [INFO ] Deduced a trap composed of 32 places in 121 ms of which 3 ms to minimize.
[2024-05-22 07:09:30] [INFO ] Deduced a trap composed of 32 places in 125 ms of which 3 ms to minimize.
[2024-05-22 07:09:30] [INFO ] Deduced a trap composed of 32 places in 124 ms of which 3 ms to minimize.
[2024-05-22 07:09:30] [INFO ] Deduced a trap composed of 32 places in 137 ms of which 3 ms to minimize.
[2024-05-22 07:09:30] [INFO ] Deduced a trap composed of 32 places in 133 ms of which 3 ms to minimize.
[2024-05-22 07:09:30] [INFO ] Deduced a trap composed of 32 places in 129 ms of which 3 ms to minimize.
[2024-05-22 07:09:31] [INFO ] Deduced a trap composed of 32 places in 126 ms of which 3 ms to minimize.
[2024-05-22 07:09:31] [INFO ] Deduced a trap composed of 32 places in 125 ms of which 3 ms to minimize.
[2024-05-22 07:09:31] [INFO ] Deduced a trap composed of 35 places in 120 ms of which 3 ms to minimize.
[2024-05-22 07:09:31] [INFO ] Deduced a trap composed of 38 places in 122 ms of which 2 ms to minimize.
[2024-05-22 07:09:31] [INFO ] Deduced a trap composed of 32 places in 120 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/642 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 1002 unsolved
[2024-05-22 07:09:35] [INFO ] Deduced a trap composed of 33 places in 130 ms of which 3 ms to minimize.
[2024-05-22 07:09:35] [INFO ] Deduced a trap composed of 32 places in 129 ms of which 3 ms to minimize.
[2024-05-22 07:09:35] [INFO ] Deduced a trap composed of 32 places in 114 ms of which 3 ms to minimize.
[2024-05-22 07:09:36] [INFO ] Deduced a trap composed of 32 places in 112 ms of which 3 ms to minimize.
[2024-05-22 07:09:36] [INFO ] Deduced a trap composed of 32 places in 114 ms of which 3 ms to minimize.
[2024-05-22 07:09:36] [INFO ] Deduced a trap composed of 32 places in 109 ms of which 2 ms to minimize.
[2024-05-22 07:09:36] [INFO ] Deduced a trap composed of 32 places in 114 ms of which 3 ms to minimize.
[2024-05-22 07:09:36] [INFO ] Deduced a trap composed of 32 places in 122 ms of which 2 ms to minimize.
[2024-05-22 07:09:36] [INFO ] Deduced a trap composed of 32 places in 121 ms of which 3 ms to minimize.
[2024-05-22 07:09:36] [INFO ] Deduced a trap composed of 32 places in 119 ms of which 3 ms to minimize.
[2024-05-22 07:09:36] [INFO ] Deduced a trap composed of 32 places in 129 ms of which 3 ms to minimize.
[2024-05-22 07:09:37] [INFO ] Deduced a trap composed of 32 places in 134 ms of which 3 ms to minimize.
[2024-05-22 07:09:37] [INFO ] Deduced a trap composed of 32 places in 137 ms of which 3 ms to minimize.
[2024-05-22 07:09:37] [INFO ] Deduced a trap composed of 32 places in 123 ms of which 3 ms to minimize.
[2024-05-22 07:09:37] [INFO ] Deduced a trap composed of 32 places in 135 ms of which 3 ms to minimize.
[2024-05-22 07:09:37] [INFO ] Deduced a trap composed of 32 places in 128 ms of which 3 ms to minimize.
[2024-05-22 07:09:37] [INFO ] Deduced a trap composed of 32 places in 133 ms of which 3 ms to minimize.
[2024-05-22 07:09:37] [INFO ] Deduced a trap composed of 35 places in 127 ms of which 3 ms to minimize.
[2024-05-22 07:09:38] [INFO ] Deduced a trap composed of 37 places in 123 ms of which 3 ms to minimize.
[2024-05-22 07:09:38] [INFO ] Deduced a trap composed of 32 places in 131 ms of which 3 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 3 (INCLUDED_ONLY) 0/642 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 1002 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 642/1665 variables, and 81 constraints, problems are : Problem set: 0 solved, 1002 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 0/643 constraints, ReadFeed: 0/780 constraints, PredecessorRefiner: 1002/1002 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1002 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/642 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 1002 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/642 variables, 60/81 constraints. Problems are: Problem set: 0 solved, 1002 unsolved
[2024-05-22 07:09:42] [INFO ] Deduced a trap composed of 39 places in 168 ms of which 4 ms to minimize.
[2024-05-22 07:09:42] [INFO ] Deduced a trap composed of 32 places in 143 ms of which 3 ms to minimize.
[2024-05-22 07:09:44] [INFO ] Deduced a trap composed of 32 places in 129 ms of which 3 ms to minimize.
[2024-05-22 07:09:44] [INFO ] Deduced a trap composed of 32 places in 115 ms of which 3 ms to minimize.
[2024-05-22 07:09:44] [INFO ] Deduced a trap composed of 32 places in 115 ms of which 3 ms to minimize.
[2024-05-22 07:09:44] [INFO ] Deduced a trap composed of 32 places in 100 ms of which 3 ms to minimize.
[2024-05-22 07:09:44] [INFO ] Deduced a trap composed of 32 places in 98 ms of which 2 ms to minimize.
[2024-05-22 07:09:44] [INFO ] Deduced a trap composed of 32 places in 112 ms of which 3 ms to minimize.
[2024-05-22 07:09:44] [INFO ] Deduced a trap composed of 32 places in 104 ms of which 2 ms to minimize.
[2024-05-22 07:09:45] [INFO ] Deduced a trap composed of 32 places in 111 ms of which 2 ms to minimize.
[2024-05-22 07:09:45] [INFO ] Deduced a trap composed of 32 places in 109 ms of which 2 ms to minimize.
[2024-05-22 07:09:45] [INFO ] Deduced a trap composed of 32 places in 114 ms of which 3 ms to minimize.
[2024-05-22 07:09:45] [INFO ] Deduced a trap composed of 32 places in 104 ms of which 3 ms to minimize.
[2024-05-22 07:09:45] [INFO ] Deduced a trap composed of 32 places in 102 ms of which 3 ms to minimize.
[2024-05-22 07:09:45] [INFO ] Deduced a trap composed of 32 places in 122 ms of which 2 ms to minimize.
[2024-05-22 07:09:45] [INFO ] Deduced a trap composed of 33 places in 116 ms of which 3 ms to minimize.
[2024-05-22 07:09:45] [INFO ] Deduced a trap composed of 32 places in 109 ms of which 3 ms to minimize.
[2024-05-22 07:09:46] [INFO ] Deduced a trap composed of 32 places in 109 ms of which 3 ms to minimize.
[2024-05-22 07:09:46] [INFO ] Deduced a trap composed of 32 places in 102 ms of which 3 ms to minimize.
[2024-05-22 07:09:46] [INFO ] Deduced a trap composed of 32 places in 96 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/642 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 1002 unsolved
[2024-05-22 07:09:50] [INFO ] Deduced a trap composed of 32 places in 127 ms of which 2 ms to minimize.
[2024-05-22 07:09:50] [INFO ] Deduced a trap composed of 37 places in 126 ms of which 3 ms to minimize.
[2024-05-22 07:09:50] [INFO ] Deduced a trap composed of 32 places in 118 ms of which 3 ms to minimize.
[2024-05-22 07:09:50] [INFO ] Deduced a trap composed of 32 places in 122 ms of which 3 ms to minimize.
[2024-05-22 07:09:50] [INFO ] Deduced a trap composed of 32 places in 127 ms of which 3 ms to minimize.
[2024-05-22 07:09:50] [INFO ] Deduced a trap composed of 32 places in 123 ms of which 3 ms to minimize.
[2024-05-22 07:09:51] [INFO ] Deduced a trap composed of 32 places in 112 ms of which 2 ms to minimize.
[2024-05-22 07:09:51] [INFO ] Deduced a trap composed of 32 places in 105 ms of which 2 ms to minimize.
[2024-05-22 07:09:51] [INFO ] Deduced a trap composed of 32 places in 102 ms of which 3 ms to minimize.
[2024-05-22 07:09:51] [INFO ] Deduced a trap composed of 32 places in 124 ms of which 3 ms to minimize.
[2024-05-22 07:09:51] [INFO ] Deduced a trap composed of 32 places in 139 ms of which 3 ms to minimize.
[2024-05-22 07:09:51] [INFO ] Deduced a trap composed of 32 places in 122 ms of which 3 ms to minimize.
[2024-05-22 07:09:51] [INFO ] Deduced a trap composed of 32 places in 122 ms of which 3 ms to minimize.
[2024-05-22 07:09:52] [INFO ] Deduced a trap composed of 35 places in 133 ms of which 3 ms to minimize.
[2024-05-22 07:09:52] [INFO ] Deduced a trap composed of 36 places in 131 ms of which 2 ms to minimize.
[2024-05-22 07:09:52] [INFO ] Deduced a trap composed of 32 places in 126 ms of which 3 ms to minimize.
[2024-05-22 07:09:52] [INFO ] Deduced a trap composed of 32 places in 121 ms of which 3 ms to minimize.
[2024-05-22 07:09:52] [INFO ] Deduced a trap composed of 32 places in 123 ms of which 3 ms to minimize.
[2024-05-22 07:09:52] [INFO ] Deduced a trap composed of 32 places in 119 ms of which 3 ms to minimize.
[2024-05-22 07:09:52] [INFO ] Deduced a trap composed of 35 places in 137 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/642 variables, 20/121 constraints. Problems are: Problem set: 0 solved, 1002 unsolved
[2024-05-22 07:09:57] [INFO ] Deduced a trap composed of 32 places in 105 ms of which 3 ms to minimize.
[2024-05-22 07:09:57] [INFO ] Deduced a trap composed of 32 places in 93 ms of which 2 ms to minimize.
[2024-05-22 07:09:57] [INFO ] Deduced a trap composed of 32 places in 94 ms of which 3 ms to minimize.
[2024-05-22 07:09:57] [INFO ] Deduced a trap composed of 32 places in 91 ms of which 2 ms to minimize.
[2024-05-22 07:09:57] [INFO ] Deduced a trap composed of 32 places in 87 ms of which 3 ms to minimize.
[2024-05-22 07:09:57] [INFO ] Deduced a trap composed of 32 places in 78 ms of which 2 ms to minimize.
[2024-05-22 07:09:57] [INFO ] Deduced a trap composed of 32 places in 83 ms of which 2 ms to minimize.
[2024-05-22 07:09:57] [INFO ] Deduced a trap composed of 32 places in 77 ms of which 2 ms to minimize.
[2024-05-22 07:09:57] [INFO ] Deduced a trap composed of 32 places in 88 ms of which 2 ms to minimize.
[2024-05-22 07:09:57] [INFO ] Deduced a trap composed of 32 places in 81 ms of which 2 ms to minimize.
[2024-05-22 07:09:58] [INFO ] Deduced a trap composed of 32 places in 82 ms of which 2 ms to minimize.
[2024-05-22 07:09:58] [INFO ] Deduced a trap composed of 32 places in 77 ms of which 2 ms to minimize.
[2024-05-22 07:09:58] [INFO ] Deduced a trap composed of 32 places in 73 ms of which 2 ms to minimize.
[2024-05-22 07:09:58] [INFO ] Deduced a trap composed of 32 places in 68 ms of which 2 ms to minimize.
[2024-05-22 07:09:58] [INFO ] Deduced a trap composed of 32 places in 78 ms of which 2 ms to minimize.
[2024-05-22 07:09:58] [INFO ] Deduced a trap composed of 32 places in 72 ms of which 2 ms to minimize.
[2024-05-22 07:09:58] [INFO ] Deduced a trap composed of 32 places in 133 ms of which 3 ms to minimize.
[2024-05-22 07:09:58] [INFO ] Deduced a trap composed of 32 places in 133 ms of which 2 ms to minimize.
[2024-05-22 07:09:58] [INFO ] Deduced a trap composed of 32 places in 117 ms of which 3 ms to minimize.
[2024-05-22 07:09:59] [INFO ] Deduced a trap composed of 32 places in 107 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/642 variables, 20/141 constraints. Problems are: Problem set: 0 solved, 1002 unsolved
[2024-05-22 07:10:03] [INFO ] Deduced a trap composed of 41 places in 163 ms of which 3 ms to minimize.
[2024-05-22 07:10:03] [INFO ] Deduced a trap composed of 32 places in 153 ms of which 3 ms to minimize.
[2024-05-22 07:10:03] [INFO ] Deduced a trap composed of 32 places in 130 ms of which 3 ms to minimize.
[2024-05-22 07:10:04] [INFO ] Deduced a trap composed of 32 places in 128 ms of which 2 ms to minimize.
[2024-05-22 07:10:04] [INFO ] Deduced a trap composed of 32 places in 125 ms of which 3 ms to minimize.
[2024-05-22 07:10:04] [INFO ] Deduced a trap composed of 33 places in 131 ms of which 2 ms to minimize.
[2024-05-22 07:10:04] [INFO ] Deduced a trap composed of 32 places in 105 ms of which 2 ms to minimize.
[2024-05-22 07:10:04] [INFO ] Deduced a trap composed of 32 places in 102 ms of which 2 ms to minimize.
[2024-05-22 07:10:04] [INFO ] Deduced a trap composed of 32 places in 96 ms of which 2 ms to minimize.
[2024-05-22 07:10:04] [INFO ] Deduced a trap composed of 32 places in 108 ms of which 3 ms to minimize.
[2024-05-22 07:10:05] [INFO ] Deduced a trap composed of 32 places in 115 ms of which 2 ms to minimize.
[2024-05-22 07:10:05] [INFO ] Deduced a trap composed of 33 places in 121 ms of which 2 ms to minimize.
[2024-05-22 07:10:05] [INFO ] Deduced a trap composed of 32 places in 118 ms of which 3 ms to minimize.
[2024-05-22 07:10:05] [INFO ] Deduced a trap composed of 32 places in 114 ms of which 2 ms to minimize.
[2024-05-22 07:10:05] [INFO ] Deduced a trap composed of 32 places in 126 ms of which 2 ms to minimize.
[2024-05-22 07:10:05] [INFO ] Deduced a trap composed of 32 places in 118 ms of which 2 ms to minimize.
[2024-05-22 07:10:05] [INFO ] Deduced a trap composed of 32 places in 102 ms of which 2 ms to minimize.
[2024-05-22 07:10:05] [INFO ] Deduced a trap composed of 32 places in 124 ms of which 3 ms to minimize.
[2024-05-22 07:10:06] [INFO ] Deduced a trap composed of 32 places in 104 ms of which 2 ms to minimize.
[2024-05-22 07:10:06] [INFO ] Deduced a trap composed of 32 places in 120 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/642 variables, 20/161 constraints. Problems are: Problem set: 0 solved, 1002 unsolved
[2024-05-22 07:10:07] [INFO ] Deduced a trap composed of 36 places in 197 ms of which 3 ms to minimize.
[2024-05-22 07:10:07] [INFO ] Deduced a trap composed of 41 places in 197 ms of which 3 ms to minimize.
[2024-05-22 07:10:08] [INFO ] Deduced a trap composed of 38 places in 192 ms of which 3 ms to minimize.
[2024-05-22 07:10:08] [INFO ] Deduced a trap composed of 40 places in 192 ms of which 3 ms to minimize.
[2024-05-22 07:10:08] [INFO ] Deduced a trap composed of 35 places in 184 ms of which 3 ms to minimize.
[2024-05-22 07:10:08] [INFO ] Deduced a trap composed of 41 places in 167 ms of which 3 ms to minimize.
[2024-05-22 07:10:08] [INFO ] Deduced a trap composed of 32 places in 166 ms of which 4 ms to minimize.
[2024-05-22 07:10:09] [INFO ] Deduced a trap composed of 36 places in 176 ms of which 4 ms to minimize.
[2024-05-22 07:10:09] [INFO ] Deduced a trap composed of 35 places in 177 ms of which 3 ms to minimize.
[2024-05-22 07:10:09] [INFO ] Deduced a trap composed of 38 places in 170 ms of which 3 ms to minimize.
[2024-05-22 07:10:09] [INFO ] Deduced a trap composed of 38 places in 163 ms of which 3 ms to minimize.
SMT process timed out in 60403ms, After SMT, problems are : Problem set: 0 solved, 1002 unsolved
Search for dead transitions found 0 dead transitions in 60415ms
Starting structural reductions in LTL mode, iteration 1 : 643/657 places, 1022/1048 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62592 ms. Remains : 643/657 places, 1022/1048 transitions.
Stuttering acceptance computed with spot in 143 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p1)), true]
Running random walk in product with property : CANConstruction-PT-020-LTLCardinality-10
Stuttering criterion allowed to conclude after 576 steps with 1 reset in 6 ms.
FORMULA CANConstruction-PT-020-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-020-LTLCardinality-10 finished in 62763 ms.
All properties solved by simple procedures.
Total runtime 310380 ms.
ITS solved all properties within timeout

BK_STOP 1716361809788

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is CANConstruction-PT-020, 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 r069-tall-171620503600019"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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