About the Execution of GreatSPN+red for Anderson-PT-11
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 11027.239 | 3600000.00 | 12619547.00 | 2062.10 | TFFFFTFFTFFT?FF? | 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.r003-smll-171620117600371.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 Anderson-PT-11, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r003-smll-171620117600371
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.1M
-rw-r--r-- 1 mcc users 7.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 22 14:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 19 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 17:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.3K Apr 12 15:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 90K Apr 12 15:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 12 15:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Apr 12 15:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 19 07:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 19 15:23 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1.6M 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 Anderson-PT-11-LTLCardinality-00
FORMULA_NAME Anderson-PT-11-LTLCardinality-01
FORMULA_NAME Anderson-PT-11-LTLCardinality-02
FORMULA_NAME Anderson-PT-11-LTLCardinality-03
FORMULA_NAME Anderson-PT-11-LTLCardinality-04
FORMULA_NAME Anderson-PT-11-LTLCardinality-05
FORMULA_NAME Anderson-PT-11-LTLCardinality-06
FORMULA_NAME Anderson-PT-11-LTLCardinality-07
FORMULA_NAME Anderson-PT-11-LTLCardinality-08
FORMULA_NAME Anderson-PT-11-LTLCardinality-09
FORMULA_NAME Anderson-PT-11-LTLCardinality-10
FORMULA_NAME Anderson-PT-11-LTLCardinality-11
FORMULA_NAME Anderson-PT-11-LTLCardinality-12
FORMULA_NAME Anderson-PT-11-LTLCardinality-13
FORMULA_NAME Anderson-PT-11-LTLCardinality-14
FORMULA_NAME Anderson-PT-11-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1716460813862
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Anderson-PT-11
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 10:40:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-23 10:40:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 10:40:17] [INFO ] Load time of PNML (sax parser for PT used): 726 ms
[2024-05-23 10:40:17] [INFO ] Transformed 749 places.
[2024-05-23 10:40:17] [INFO ] Transformed 3245 transitions.
[2024-05-23 10:40:17] [INFO ] Found NUPN structural information;
[2024-05-23 10:40:17] [INFO ] Parsed PT model containing 749 places and 3245 transitions and 12540 arcs in 987 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 28 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA Anderson-PT-11-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-11-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-11-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-11-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-11-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-11-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-11-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 31 out of 749 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 749/749 places, 3245/3245 transitions.
Discarding 211 places :
Symmetric choice reduction at 0 with 211 rule applications. Total rules 211 place count 538 transition count 914
Iterating global reduction 0 with 211 rules applied. Total rules applied 422 place count 538 transition count 914
Applied a total of 422 rules in 185 ms. Remains 538 /749 variables (removed 211) and now considering 914/3245 (removed 2331) transitions.
// Phase 1: matrix 914 rows 538 cols
[2024-05-23 10:40:17] [INFO ] Computed 25 invariants in 82 ms
[2024-05-23 10:40:19] [INFO ] Implicit Places using invariants in 1650 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1697 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 537/749 places, 914/3245 transitions.
Applied a total of 0 rules in 33 ms. Remains 537 /537 variables (removed 0) and now considering 914/914 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1945 ms. Remains : 537/749 places, 914/3245 transitions.
Support contains 31 out of 537 places after structural reductions.
[2024-05-23 10:40:20] [INFO ] Flatten gal took : 141 ms
[2024-05-23 10:40:20] [INFO ] Flatten gal took : 97 ms
[2024-05-23 10:40:20] [INFO ] Input system was already deterministic with 914 transitions.
Support contains 26 out of 537 places (down from 31) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 14 to 13
RANDOM walk for 40000 steps (8 resets) in 1596 ms. (25 steps per ms) remains 0/13 properties
Computed a total of 0 stabilizing places and 0 stable transitions
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)||X(F(p1))))'
Support contains 4 out of 537 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 537/537 places, 914/914 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 529 transition count 826
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 529 transition count 826
Applied a total of 16 rules in 67 ms. Remains 529 /537 variables (removed 8) and now considering 826/914 (removed 88) transitions.
// Phase 1: matrix 826 rows 529 cols
[2024-05-23 10:40:21] [INFO ] Computed 24 invariants in 22 ms
[2024-05-23 10:40:22] [INFO ] Implicit Places using invariants in 815 ms returned []
[2024-05-23 10:40:22] [INFO ] Invariant cache hit.
[2024-05-23 10:40:22] [INFO ] State equation strengthened by 110 read => feed constraints.
[2024-05-23 10:40:26] [INFO ] Implicit Places using invariants and state equation in 4199 ms returned []
Implicit Place search using SMT with State Equation took 5017 ms to find 0 implicit places.
Running 815 sub problems to find dead transitions.
[2024-05-23 10:40:26] [INFO ] Invariant cache hit.
[2024-05-23 10:40:26] [INFO ] State equation strengthened by 110 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/528 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 815 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/528 variables, 10/23 constraints. Problems are: Problem set: 0 solved, 815 unsolved
[2024-05-23 10:40:47] [INFO ] Deduced a trap composed of 192 places in 449 ms of which 54 ms to minimize.
[2024-05-23 10:40:48] [INFO ] Deduced a trap composed of 108 places in 379 ms of which 6 ms to minimize.
[2024-05-23 10:40:48] [INFO ] Deduced a trap composed of 142 places in 394 ms of which 9 ms to minimize.
[2024-05-23 10:40:49] [INFO ] Deduced a trap composed of 163 places in 725 ms of which 9 ms to minimize.
[2024-05-23 10:40:50] [INFO ] Deduced a trap composed of 290 places in 759 ms of which 9 ms to minimize.
[2024-05-23 10:40:51] [INFO ] Deduced a trap composed of 196 places in 731 ms of which 9 ms to minimize.
[2024-05-23 10:40:51] [INFO ] Deduced a trap composed of 199 places in 662 ms of which 8 ms to minimize.
[2024-05-23 10:40:57] [INFO ] Deduced a trap composed of 316 places in 353 ms of which 5 ms to minimize.
SMT process timed out in 30913ms, After SMT, problems are : Problem set: 0 solved, 815 unsolved
Search for dead transitions found 0 dead transitions in 30954ms
Starting structural reductions in LTL mode, iteration 1 : 529/537 places, 826/914 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36045 ms. Remains : 529/537 places, 826/914 transitions.
Stuttering acceptance computed with spot in 297 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Anderson-PT-11-LTLCardinality-00
Product exploration explored 100000 steps with 50000 reset in 549 ms.
Product exploration explored 100000 steps with 50000 reset in 476 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 22 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Anderson-PT-11-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Anderson-PT-11-LTLCardinality-00 finished in 37498 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 U X(X(p1)))))'
Support contains 4 out of 537 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 537/537 places, 914/914 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 530 transition count 847
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 530 transition count 847
Applied a total of 14 rules in 74 ms. Remains 530 /537 variables (removed 7) and now considering 847/914 (removed 67) transitions.
// Phase 1: matrix 847 rows 530 cols
[2024-05-23 10:40:58] [INFO ] Computed 24 invariants in 11 ms
[2024-05-23 10:40:59] [INFO ] Implicit Places using invariants in 593 ms returned []
[2024-05-23 10:40:59] [INFO ] Invariant cache hit.
[2024-05-23 10:40:59] [INFO ] State equation strengthened by 110 read => feed constraints.
[2024-05-23 10:41:03] [INFO ] Implicit Places using invariants and state equation in 3873 ms returned []
Implicit Place search using SMT with State Equation took 4472 ms to find 0 implicit places.
Running 836 sub problems to find dead transitions.
[2024-05-23 10:41:03] [INFO ] Invariant cache hit.
[2024-05-23 10:41:03] [INFO ] State equation strengthened by 110 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/530 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 836 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/530 variables, 11/24 constraints. Problems are: Problem set: 0 solved, 836 unsolved
[2024-05-23 10:41:16] [INFO ] Deduced a trap composed of 148 places in 474 ms of which 7 ms to minimize.
[2024-05-23 10:41:19] [INFO ] Deduced a trap composed of 173 places in 487 ms of which 5 ms to minimize.
[2024-05-23 10:41:20] [INFO ] Deduced a trap composed of 234 places in 496 ms of which 6 ms to minimize.
[2024-05-23 10:41:20] [INFO ] Deduced a trap composed of 201 places in 486 ms of which 5 ms to minimize.
[2024-05-23 10:41:21] [INFO ] Deduced a trap composed of 251 places in 561 ms of which 8 ms to minimize.
[2024-05-23 10:41:21] [INFO ] Deduced a trap composed of 198 places in 498 ms of which 6 ms to minimize.
[2024-05-23 10:41:22] [INFO ] Deduced a trap composed of 287 places in 497 ms of which 8 ms to minimize.
[2024-05-23 10:41:22] [INFO ] Deduced a trap composed of 340 places in 528 ms of which 5 ms to minimize.
[2024-05-23 10:41:23] [INFO ] Deduced a trap composed of 208 places in 505 ms of which 5 ms to minimize.
[2024-05-23 10:41:24] [INFO ] Deduced a trap composed of 138 places in 540 ms of which 8 ms to minimize.
[2024-05-23 10:41:24] [INFO ] Deduced a trap composed of 287 places in 578 ms of which 5 ms to minimize.
[2024-05-23 10:41:25] [INFO ] Deduced a trap composed of 195 places in 502 ms of which 5 ms to minimize.
[2024-05-23 10:41:25] [INFO ] Deduced a trap composed of 252 places in 480 ms of which 5 ms to minimize.
[2024-05-23 10:41:26] [INFO ] Deduced a trap composed of 288 places in 581 ms of which 9 ms to minimize.
[2024-05-23 10:41:26] [INFO ] Deduced a trap composed of 213 places in 509 ms of which 6 ms to minimize.
[2024-05-23 10:41:27] [INFO ] Deduced a trap composed of 148 places in 592 ms of which 5 ms to minimize.
[2024-05-23 10:41:27] [INFO ] Deduced a trap composed of 166 places in 500 ms of which 8 ms to minimize.
[2024-05-23 10:41:28] [INFO ] Deduced a trap composed of 123 places in 527 ms of which 6 ms to minimize.
[2024-05-23 10:41:29] [INFO ] Deduced a trap composed of 229 places in 588 ms of which 8 ms to minimize.
[2024-05-23 10:41:29] [INFO ] Deduced a trap composed of 129 places in 469 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/530 variables, 20/44 constraints. Problems are: Problem set: 0 solved, 836 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 530/1377 variables, and 44 constraints, problems are : Problem set: 0 solved, 836 unsolved in 30049 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 0/530 constraints, ReadFeed: 0/110 constraints, PredecessorRefiner: 836/836 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 836 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/530 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 836 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/530 variables, 11/24 constraints. Problems are: Problem set: 0 solved, 836 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/530 variables, 20/44 constraints. Problems are: Problem set: 0 solved, 836 unsolved
[2024-05-23 10:41:41] [INFO ] Deduced a trap composed of 261 places in 491 ms of which 6 ms to minimize.
[2024-05-23 10:41:42] [INFO ] Deduced a trap composed of 136 places in 405 ms of which 5 ms to minimize.
[2024-05-23 10:41:42] [INFO ] Deduced a trap composed of 259 places in 492 ms of which 5 ms to minimize.
[2024-05-23 10:41:43] [INFO ] Deduced a trap composed of 290 places in 584 ms of which 8 ms to minimize.
[2024-05-23 10:41:43] [INFO ] Deduced a trap composed of 303 places in 502 ms of which 5 ms to minimize.
[2024-05-23 10:41:44] [INFO ] Deduced a trap composed of 275 places in 488 ms of which 6 ms to minimize.
[2024-05-23 10:41:44] [INFO ] Deduced a trap composed of 123 places in 488 ms of which 9 ms to minimize.
[2024-05-23 10:41:45] [INFO ] Deduced a trap composed of 144 places in 467 ms of which 5 ms to minimize.
[2024-05-23 10:41:46] [INFO ] Deduced a trap composed of 171 places in 484 ms of which 5 ms to minimize.
[2024-05-23 10:41:46] [INFO ] Deduced a trap composed of 175 places in 475 ms of which 6 ms to minimize.
[2024-05-23 10:41:46] [INFO ] Deduced a trap composed of 186 places in 420 ms of which 5 ms to minimize.
[2024-05-23 10:41:47] [INFO ] Deduced a trap composed of 101 places in 481 ms of which 6 ms to minimize.
[2024-05-23 10:41:48] [INFO ] Deduced a trap composed of 185 places in 479 ms of which 5 ms to minimize.
[2024-05-23 10:41:48] [INFO ] Deduced a trap composed of 189 places in 534 ms of which 8 ms to minimize.
[2024-05-23 10:41:49] [INFO ] Deduced a trap composed of 192 places in 545 ms of which 5 ms to minimize.
[2024-05-23 10:41:49] [INFO ] Deduced a trap composed of 273 places in 471 ms of which 5 ms to minimize.
[2024-05-23 10:41:50] [INFO ] Deduced a trap composed of 144 places in 556 ms of which 8 ms to minimize.
[2024-05-23 10:41:50] [INFO ] Deduced a trap composed of 271 places in 518 ms of which 7 ms to minimize.
[2024-05-23 10:41:51] [INFO ] Deduced a trap composed of 224 places in 479 ms of which 5 ms to minimize.
[2024-05-23 10:41:51] [INFO ] Deduced a trap composed of 189 places in 484 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/530 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 836 unsolved
[2024-05-23 10:41:58] [INFO ] Deduced a trap composed of 236 places in 534 ms of which 6 ms to minimize.
[2024-05-23 10:41:58] [INFO ] Deduced a trap composed of 241 places in 505 ms of which 5 ms to minimize.
[2024-05-23 10:41:59] [INFO ] Deduced a trap composed of 232 places in 490 ms of which 6 ms to minimize.
[2024-05-23 10:41:59] [INFO ] Deduced a trap composed of 127 places in 576 ms of which 5 ms to minimize.
[2024-05-23 10:42:00] [INFO ] Deduced a trap composed of 97 places in 509 ms of which 5 ms to minimize.
[2024-05-23 10:42:00] [INFO ] Deduced a trap composed of 218 places in 483 ms of which 6 ms to minimize.
[2024-05-23 10:42:01] [INFO ] Deduced a trap composed of 225 places in 474 ms of which 5 ms to minimize.
[2024-05-23 10:42:02] [INFO ] Deduced a trap composed of 109 places in 426 ms of which 6 ms to minimize.
[2024-05-23 10:42:03] [INFO ] Deduced a trap composed of 162 places in 523 ms of which 6 ms to minimize.
[2024-05-23 10:42:03] [INFO ] Deduced a trap composed of 208 places in 411 ms of which 5 ms to minimize.
SMT process timed out in 60754ms, After SMT, problems are : Problem set: 0 solved, 836 unsolved
Search for dead transitions found 0 dead transitions in 60765ms
Starting structural reductions in LTL mode, iteration 1 : 530/537 places, 847/914 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65314 ms. Remains : 530/537 places, 847/914 transitions.
Stuttering acceptance computed with spot in 269 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1), (NOT p1)]
Running random walk in product with property : Anderson-PT-11-LTLCardinality-03
Product exploration explored 100000 steps with 12 reset in 544 ms.
Stack based approach found an accepted trace after 74 steps with 0 reset with depth 75 and stack size 75 in 1 ms.
FORMULA Anderson-PT-11-LTLCardinality-03 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-11-LTLCardinality-03 finished in 66161 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 537 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 537/537 places, 914/914 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 528 transition count 825
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 528 transition count 825
Applied a total of 18 rules in 30 ms. Remains 528 /537 variables (removed 9) and now considering 825/914 (removed 89) transitions.
// Phase 1: matrix 825 rows 528 cols
[2024-05-23 10:42:04] [INFO ] Computed 24 invariants in 10 ms
[2024-05-23 10:42:05] [INFO ] Implicit Places using invariants in 545 ms returned []
[2024-05-23 10:42:05] [INFO ] Invariant cache hit.
[2024-05-23 10:42:06] [INFO ] State equation strengthened by 110 read => feed constraints.
[2024-05-23 10:42:09] [INFO ] Implicit Places using invariants and state equation in 4397 ms returned []
Implicit Place search using SMT with State Equation took 4947 ms to find 0 implicit places.
Running 814 sub problems to find dead transitions.
[2024-05-23 10:42:09] [INFO ] Invariant cache hit.
[2024-05-23 10:42:09] [INFO ] State equation strengthened by 110 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/527 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 814 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/527 variables, 10/23 constraints. Problems are: Problem set: 0 solved, 814 unsolved
[2024-05-23 10:42:24] [INFO ] Deduced a trap composed of 144 places in 486 ms of which 5 ms to minimize.
[2024-05-23 10:42:25] [INFO ] Deduced a trap composed of 136 places in 476 ms of which 5 ms to minimize.
[2024-05-23 10:42:25] [INFO ] Deduced a trap composed of 232 places in 494 ms of which 6 ms to minimize.
[2024-05-23 10:42:26] [INFO ] Deduced a trap composed of 336 places in 526 ms of which 5 ms to minimize.
[2024-05-23 10:42:27] [INFO ] Deduced a trap composed of 247 places in 529 ms of which 6 ms to minimize.
[2024-05-23 10:42:27] [INFO ] Deduced a trap composed of 251 places in 500 ms of which 5 ms to minimize.
[2024-05-23 10:42:28] [INFO ] Deduced a trap composed of 286 places in 538 ms of which 5 ms to minimize.
[2024-05-23 10:42:28] [INFO ] Deduced a trap composed of 130 places in 471 ms of which 5 ms to minimize.
[2024-05-23 10:42:29] [INFO ] Deduced a trap composed of 113 places in 398 ms of which 5 ms to minimize.
[2024-05-23 10:42:29] [INFO ] Deduced a trap composed of 185 places in 476 ms of which 6 ms to minimize.
[2024-05-23 10:42:30] [INFO ] Deduced a trap composed of 119 places in 507 ms of which 8 ms to minimize.
[2024-05-23 10:42:30] [INFO ] Deduced a trap composed of 275 places in 506 ms of which 5 ms to minimize.
[2024-05-23 10:42:31] [INFO ] Deduced a trap composed of 229 places in 479 ms of which 6 ms to minimize.
[2024-05-23 10:42:31] [INFO ] Deduced a trap composed of 245 places in 476 ms of which 5 ms to minimize.
[2024-05-23 10:42:32] [INFO ] Deduced a trap composed of 189 places in 478 ms of which 6 ms to minimize.
[2024-05-23 10:42:32] [INFO ] Deduced a trap composed of 258 places in 486 ms of which 5 ms to minimize.
[2024-05-23 10:42:33] [INFO ] Deduced a trap composed of 180 places in 482 ms of which 5 ms to minimize.
[2024-05-23 10:42:33] [INFO ] Deduced a trap composed of 157 places in 469 ms of which 5 ms to minimize.
[2024-05-23 10:42:34] [INFO ] Deduced a trap composed of 152 places in 412 ms of which 5 ms to minimize.
[2024-05-23 10:42:34] [INFO ] Deduced a trap composed of 119 places in 484 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/527 variables, 20/43 constraints. Problems are: Problem set: 0 solved, 814 unsolved
[2024-05-23 10:42:40] [INFO ] Deduced a trap composed of 362 places in 495 ms of which 5 ms to minimize.
[2024-05-23 10:42:40] [INFO ] Deduced a trap composed of 167 places in 485 ms of which 5 ms to minimize.
SMT process timed out in 31147ms, After SMT, problems are : Problem set: 0 solved, 814 unsolved
Search for dead transitions found 0 dead transitions in 31162ms
Starting structural reductions in LTL mode, iteration 1 : 528/537 places, 825/914 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36144 ms. Remains : 528/537 places, 825/914 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Anderson-PT-11-LTLCardinality-05
Product exploration explored 100000 steps with 50000 reset in 401 ms.
Product exploration explored 100000 steps with 50000 reset in 427 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 14 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Anderson-PT-11-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Anderson-PT-11-LTLCardinality-05 finished in 37085 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)&&F(G(p1)))))'
Support contains 4 out of 537 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 537/537 places, 914/914 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 120 transitions
Trivial Post-agglo rules discarded 120 transitions
Performed 120 trivial Post agglomeration. Transition count delta: 120
Iterating post reduction 0 with 120 rules applied. Total rules applied 120 place count 537 transition count 794
Reduce places removed 120 places and 0 transitions.
Iterating post reduction 1 with 120 rules applied. Total rules applied 240 place count 417 transition count 794
Performed 109 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 109 Pre rules applied. Total rules applied 240 place count 417 transition count 685
Deduced a syphon composed of 109 places in 0 ms
Reduce places removed 109 places and 0 transitions.
Iterating global reduction 2 with 218 rules applied. Total rules applied 458 place count 308 transition count 685
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 466 place count 300 transition count 617
Iterating global reduction 2 with 8 rules applied. Total rules applied 474 place count 300 transition count 617
Applied a total of 474 rules in 97 ms. Remains 300 /537 variables (removed 237) and now considering 617/914 (removed 297) transitions.
// Phase 1: matrix 617 rows 300 cols
[2024-05-23 10:42:42] [INFO ] Computed 24 invariants in 7 ms
[2024-05-23 10:42:42] [INFO ] Implicit Places using invariants in 475 ms returned []
[2024-05-23 10:42:42] [INFO ] Invariant cache hit.
[2024-05-23 10:42:42] [INFO ] State equation strengthened by 110 read => feed constraints.
[2024-05-23 10:42:43] [INFO ] Implicit Places using invariants and state equation in 1425 ms returned []
Implicit Place search using SMT with State Equation took 1904 ms to find 0 implicit places.
[2024-05-23 10:42:43] [INFO ] Redundant transitions in 43 ms returned []
Running 606 sub problems to find dead transitions.
[2024-05-23 10:42:43] [INFO ] Invariant cache hit.
[2024-05-23 10:42:44] [INFO ] State equation strengthened by 110 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/300 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 606 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/300 variables, 10/24 constraints. Problems are: Problem set: 0 solved, 606 unsolved
[2024-05-23 10:42:50] [INFO ] Deduced a trap composed of 105 places in 268 ms of which 3 ms to minimize.
[2024-05-23 10:42:53] [INFO ] Deduced a trap composed of 113 places in 275 ms of which 3 ms to minimize.
[2024-05-23 10:42:53] [INFO ] Deduced a trap composed of 127 places in 275 ms of which 4 ms to minimize.
[2024-05-23 10:42:54] [INFO ] Deduced a trap composed of 68 places in 278 ms of which 4 ms to minimize.
[2024-05-23 10:42:54] [INFO ] Deduced a trap composed of 92 places in 262 ms of which 3 ms to minimize.
[2024-05-23 10:42:54] [INFO ] Deduced a trap composed of 94 places in 271 ms of which 4 ms to minimize.
[2024-05-23 10:42:54] [INFO ] Deduced a trap composed of 72 places in 276 ms of which 3 ms to minimize.
[2024-05-23 10:42:55] [INFO ] Deduced a trap composed of 137 places in 269 ms of which 4 ms to minimize.
[2024-05-23 10:42:55] [INFO ] Deduced a trap composed of 120 places in 281 ms of which 4 ms to minimize.
[2024-05-23 10:42:55] [INFO ] Deduced a trap composed of 118 places in 292 ms of which 3 ms to minimize.
[2024-05-23 10:42:56] [INFO ] Deduced a trap composed of 128 places in 286 ms of which 3 ms to minimize.
[2024-05-23 10:42:56] [INFO ] Deduced a trap composed of 100 places in 284 ms of which 3 ms to minimize.
[2024-05-23 10:42:56] [INFO ] Deduced a trap composed of 125 places in 284 ms of which 3 ms to minimize.
[2024-05-23 10:42:56] [INFO ] Deduced a trap composed of 124 places in 294 ms of which 3 ms to minimize.
[2024-05-23 10:42:57] [INFO ] Deduced a trap composed of 90 places in 277 ms of which 3 ms to minimize.
[2024-05-23 10:42:57] [INFO ] Deduced a trap composed of 132 places in 264 ms of which 3 ms to minimize.
[2024-05-23 10:42:57] [INFO ] Deduced a trap composed of 114 places in 268 ms of which 4 ms to minimize.
[2024-05-23 10:42:58] [INFO ] Deduced a trap composed of 83 places in 273 ms of which 4 ms to minimize.
[2024-05-23 10:42:58] [INFO ] Deduced a trap composed of 111 places in 271 ms of which 3 ms to minimize.
[2024-05-23 10:42:58] [INFO ] Deduced a trap composed of 112 places in 276 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/300 variables, 20/44 constraints. Problems are: Problem set: 0 solved, 606 unsolved
[2024-05-23 10:43:00] [INFO ] Deduced a trap composed of 113 places in 284 ms of which 4 ms to minimize.
[2024-05-23 10:43:00] [INFO ] Deduced a trap composed of 94 places in 264 ms of which 4 ms to minimize.
[2024-05-23 10:43:02] [INFO ] Deduced a trap composed of 132 places in 268 ms of which 4 ms to minimize.
[2024-05-23 10:43:02] [INFO ] Deduced a trap composed of 90 places in 277 ms of which 3 ms to minimize.
[2024-05-23 10:43:02] [INFO ] Deduced a trap composed of 80 places in 271 ms of which 3 ms to minimize.
[2024-05-23 10:43:03] [INFO ] Deduced a trap composed of 61 places in 391 ms of which 4 ms to minimize.
[2024-05-23 10:43:03] [INFO ] Deduced a trap composed of 128 places in 269 ms of which 3 ms to minimize.
[2024-05-23 10:43:03] [INFO ] Deduced a trap composed of 112 places in 261 ms of which 3 ms to minimize.
[2024-05-23 10:43:04] [INFO ] Deduced a trap composed of 110 places in 278 ms of which 4 ms to minimize.
[2024-05-23 10:43:04] [INFO ] Deduced a trap composed of 92 places in 306 ms of which 5 ms to minimize.
[2024-05-23 10:43:04] [INFO ] Deduced a trap composed of 118 places in 347 ms of which 4 ms to minimize.
[2024-05-23 10:43:05] [INFO ] Deduced a trap composed of 89 places in 295 ms of which 4 ms to minimize.
[2024-05-23 10:43:05] [INFO ] Deduced a trap composed of 104 places in 291 ms of which 3 ms to minimize.
[2024-05-23 10:43:05] [INFO ] Deduced a trap composed of 86 places in 301 ms of which 4 ms to minimize.
[2024-05-23 10:43:06] [INFO ] Deduced a trap composed of 104 places in 296 ms of which 4 ms to minimize.
[2024-05-23 10:43:06] [INFO ] Deduced a trap composed of 115 places in 281 ms of which 3 ms to minimize.
[2024-05-23 10:43:06] [INFO ] Deduced a trap composed of 115 places in 262 ms of which 3 ms to minimize.
[2024-05-23 10:43:06] [INFO ] Deduced a trap composed of 108 places in 290 ms of which 3 ms to minimize.
[2024-05-23 10:43:07] [INFO ] Deduced a trap composed of 110 places in 277 ms of which 4 ms to minimize.
[2024-05-23 10:43:07] [INFO ] Deduced a trap composed of 112 places in 287 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/300 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 606 unsolved
[2024-05-23 10:43:14] [INFO ] Deduced a trap composed of 94 places in 289 ms of which 3 ms to minimize.
[2024-05-23 10:43:14] [INFO ] Deduced a trap composed of 43 places in 293 ms of which 5 ms to minimize.
[2024-05-23 10:43:14] [INFO ] Deduced a trap composed of 74 places in 386 ms of which 5 ms to minimize.
SMT process timed out in 30840ms, After SMT, problems are : Problem set: 0 solved, 606 unsolved
Search for dead transitions found 0 dead transitions in 30849ms
Starting structural reductions in SI_LTL mode, iteration 1 : 300/537 places, 617/914 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 32906 ms. Remains : 300/537 places, 617/914 transitions.
Stuttering acceptance computed with spot in 124 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Anderson-PT-11-LTLCardinality-06
Product exploration explored 100000 steps with 7 reset in 210 ms.
Stack based approach found an accepted trace after 47 steps with 0 reset with depth 48 and stack size 48 in 0 ms.
FORMULA Anderson-PT-11-LTLCardinality-06 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-11-LTLCardinality-06 finished in 33261 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 537 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 537/537 places, 914/914 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 99 transitions
Trivial Post-agglo rules discarded 99 transitions
Performed 99 trivial Post agglomeration. Transition count delta: 99
Iterating post reduction 0 with 99 rules applied. Total rules applied 99 place count 537 transition count 815
Reduce places removed 99 places and 0 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Iterating post reduction 1 with 110 rules applied. Total rules applied 209 place count 438 transition count 804
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 220 place count 427 transition count 804
Performed 110 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 110 Pre rules applied. Total rules applied 220 place count 427 transition count 694
Deduced a syphon composed of 110 places in 1 ms
Reduce places removed 110 places and 0 transitions.
Iterating global reduction 3 with 220 rules applied. Total rules applied 440 place count 317 transition count 694
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 449 place count 308 transition count 605
Iterating global reduction 3 with 9 rules applied. Total rules applied 458 place count 308 transition count 605
Applied a total of 458 rules in 89 ms. Remains 308 /537 variables (removed 229) and now considering 605/914 (removed 309) transitions.
// Phase 1: matrix 605 rows 308 cols
[2024-05-23 10:43:15] [INFO ] Computed 24 invariants in 10 ms
[2024-05-23 10:43:15] [INFO ] Implicit Places using invariants in 461 ms returned []
[2024-05-23 10:43:15] [INFO ] Invariant cache hit.
[2024-05-23 10:43:16] [INFO ] State equation strengthened by 110 read => feed constraints.
[2024-05-23 10:43:17] [INFO ] Implicit Places using invariants and state equation in 1593 ms returned []
Implicit Place search using SMT with State Equation took 2057 ms to find 0 implicit places.
[2024-05-23 10:43:17] [INFO ] Redundant transitions in 7 ms returned []
Running 594 sub problems to find dead transitions.
[2024-05-23 10:43:17] [INFO ] Invariant cache hit.
[2024-05-23 10:43:17] [INFO ] State equation strengthened by 110 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/307 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 594 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/307 variables, 10/23 constraints. Problems are: Problem set: 0 solved, 594 unsolved
[2024-05-23 10:43:25] [INFO ] Deduced a trap composed of 127 places in 281 ms of which 4 ms to minimize.
[2024-05-23 10:43:25] [INFO ] Deduced a trap composed of 91 places in 280 ms of which 3 ms to minimize.
[2024-05-23 10:43:25] [INFO ] Deduced a trap composed of 106 places in 272 ms of which 4 ms to minimize.
[2024-05-23 10:43:26] [INFO ] Deduced a trap composed of 114 places in 337 ms of which 5 ms to minimize.
[2024-05-23 10:43:26] [INFO ] Deduced a trap composed of 79 places in 321 ms of which 3 ms to minimize.
[2024-05-23 10:43:27] [INFO ] Deduced a trap composed of 140 places in 203 ms of which 4 ms to minimize.
[2024-05-23 10:43:27] [INFO ] Deduced a trap composed of 115 places in 284 ms of which 3 ms to minimize.
[2024-05-23 10:43:27] [INFO ] Deduced a trap composed of 93 places in 279 ms of which 3 ms to minimize.
[2024-05-23 10:43:28] [INFO ] Deduced a trap composed of 91 places in 375 ms of which 5 ms to minimize.
[2024-05-23 10:43:28] [INFO ] Deduced a trap composed of 127 places in 324 ms of which 4 ms to minimize.
[2024-05-23 10:43:28] [INFO ] Deduced a trap composed of 87 places in 292 ms of which 4 ms to minimize.
[2024-05-23 10:43:29] [INFO ] Deduced a trap composed of 130 places in 390 ms of which 5 ms to minimize.
[2024-05-23 10:43:29] [INFO ] Deduced a trap composed of 118 places in 308 ms of which 3 ms to minimize.
[2024-05-23 10:43:29] [INFO ] Deduced a trap composed of 85 places in 264 ms of which 3 ms to minimize.
[2024-05-23 10:43:30] [INFO ] Deduced a trap composed of 74 places in 295 ms of which 3 ms to minimize.
[2024-05-23 10:43:31] [INFO ] Deduced a trap composed of 123 places in 281 ms of which 3 ms to minimize.
[2024-05-23 10:43:32] [INFO ] Deduced a trap composed of 107 places in 292 ms of which 3 ms to minimize.
[2024-05-23 10:43:32] [INFO ] Deduced a trap composed of 75 places in 279 ms of which 4 ms to minimize.
[2024-05-23 10:43:32] [INFO ] Deduced a trap composed of 123 places in 285 ms of which 3 ms to minimize.
[2024-05-23 10:43:33] [INFO ] Deduced a trap composed of 106 places in 409 ms of which 7 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/307 variables, 20/43 constraints. Problems are: Problem set: 0 solved, 594 unsolved
[2024-05-23 10:43:36] [INFO ] Deduced a trap composed of 69 places in 272 ms of which 3 ms to minimize.
[2024-05-23 10:43:36] [INFO ] Deduced a trap composed of 105 places in 277 ms of which 3 ms to minimize.
[2024-05-23 10:43:39] [INFO ] Deduced a trap composed of 66 places in 284 ms of which 3 ms to minimize.
[2024-05-23 10:43:39] [INFO ] Deduced a trap composed of 100 places in 294 ms of which 3 ms to minimize.
[2024-05-23 10:43:39] [INFO ] Deduced a trap composed of 93 places in 279 ms of which 3 ms to minimize.
[2024-05-23 10:43:40] [INFO ] Deduced a trap composed of 94 places in 295 ms of which 3 ms to minimize.
[2024-05-23 10:43:40] [INFO ] Deduced a trap composed of 91 places in 296 ms of which 3 ms to minimize.
[2024-05-23 10:43:40] [INFO ] Deduced a trap composed of 91 places in 288 ms of which 4 ms to minimize.
[2024-05-23 10:43:41] [INFO ] Deduced a trap composed of 79 places in 297 ms of which 3 ms to minimize.
[2024-05-23 10:43:41] [INFO ] Deduced a trap composed of 85 places in 302 ms of which 3 ms to minimize.
[2024-05-23 10:43:41] [INFO ] Deduced a trap composed of 88 places in 381 ms of which 5 ms to minimize.
[2024-05-23 10:43:42] [INFO ] Deduced a trap composed of 89 places in 321 ms of which 4 ms to minimize.
[2024-05-23 10:43:42] [INFO ] Deduced a trap composed of 65 places in 293 ms of which 3 ms to minimize.
[2024-05-23 10:43:42] [INFO ] Deduced a trap composed of 70 places in 278 ms of which 4 ms to minimize.
[2024-05-23 10:43:42] [INFO ] Deduced a trap composed of 85 places in 280 ms of which 3 ms to minimize.
[2024-05-23 10:43:43] [INFO ] Deduced a trap composed of 75 places in 286 ms of which 3 ms to minimize.
[2024-05-23 10:43:43] [INFO ] Deduced a trap composed of 82 places in 282 ms of which 4 ms to minimize.
[2024-05-23 10:43:43] [INFO ] Deduced a trap composed of 82 places in 271 ms of which 4 ms to minimize.
[2024-05-23 10:43:44] [INFO ] Deduced a trap composed of 83 places in 381 ms of which 5 ms to minimize.
[2024-05-23 10:43:44] [INFO ] Deduced a trap composed of 66 places in 332 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/307 variables, 20/63 constraints. Problems are: Problem set: 0 solved, 594 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 307/913 variables, and 63 constraints, problems are : Problem set: 0 solved, 594 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 10/11 constraints, State Equation: 0/308 constraints, ReadFeed: 0/110 constraints, PredecessorRefiner: 594/594 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 594 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/307 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 594 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/307 variables, 10/23 constraints. Problems are: Problem set: 0 solved, 594 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/307 variables, 40/63 constraints. Problems are: Problem set: 0 solved, 594 unsolved
[2024-05-23 10:43:57] [INFO ] Deduced a trap composed of 106 places in 257 ms of which 4 ms to minimize.
[2024-05-23 10:43:57] [INFO ] Deduced a trap composed of 108 places in 259 ms of which 3 ms to minimize.
[2024-05-23 10:43:58] [INFO ] Deduced a trap composed of 116 places in 260 ms of which 3 ms to minimize.
[2024-05-23 10:43:58] [INFO ] Deduced a trap composed of 123 places in 254 ms of which 3 ms to minimize.
[2024-05-23 10:43:58] [INFO ] Deduced a trap composed of 128 places in 243 ms of which 3 ms to minimize.
[2024-05-23 10:43:58] [INFO ] Deduced a trap composed of 115 places in 247 ms of which 3 ms to minimize.
[2024-05-23 10:43:59] [INFO ] Deduced a trap composed of 109 places in 243 ms of which 3 ms to minimize.
[2024-05-23 10:43:59] [INFO ] Deduced a trap composed of 104 places in 244 ms of which 3 ms to minimize.
[2024-05-23 10:43:59] [INFO ] Deduced a trap composed of 129 places in 254 ms of which 3 ms to minimize.
[2024-05-23 10:44:00] [INFO ] Deduced a trap composed of 106 places in 253 ms of which 3 ms to minimize.
[2024-05-23 10:44:00] [INFO ] Deduced a trap composed of 95 places in 252 ms of which 4 ms to minimize.
[2024-05-23 10:44:00] [INFO ] Deduced a trap composed of 135 places in 254 ms of which 4 ms to minimize.
[2024-05-23 10:44:00] [INFO ] Deduced a trap composed of 107 places in 245 ms of which 3 ms to minimize.
[2024-05-23 10:44:01] [INFO ] Deduced a trap composed of 99 places in 255 ms of which 4 ms to minimize.
[2024-05-23 10:44:01] [INFO ] Deduced a trap composed of 91 places in 252 ms of which 3 ms to minimize.
[2024-05-23 10:44:01] [INFO ] Deduced a trap composed of 112 places in 252 ms of which 3 ms to minimize.
[2024-05-23 10:44:01] [INFO ] Deduced a trap composed of 102 places in 245 ms of which 3 ms to minimize.
[2024-05-23 10:44:02] [INFO ] Deduced a trap composed of 101 places in 260 ms of which 4 ms to minimize.
[2024-05-23 10:44:02] [INFO ] Deduced a trap composed of 112 places in 254 ms of which 3 ms to minimize.
[2024-05-23 10:44:02] [INFO ] Deduced a trap composed of 113 places in 254 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/307 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 594 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 307/913 variables, and 83 constraints, problems are : Problem set: 0 solved, 594 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 10/11 constraints, State Equation: 0/308 constraints, ReadFeed: 0/110 constraints, PredecessorRefiner: 0/594 constraints, Known Traps: 60/60 constraints]
After SMT, in 60538ms problems are : Problem set: 0 solved, 594 unsolved
Search for dead transitions found 0 dead transitions in 60547ms
Starting structural reductions in SI_LTL mode, iteration 1 : 308/537 places, 605/914 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 62708 ms. Remains : 308/537 places, 605/914 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Anderson-PT-11-LTLCardinality-10
Product exploration explored 100000 steps with 1855 reset in 228 ms.
Stack based approach found an accepted trace after 213 steps with 3 reset with depth 47 and stack size 47 in 1 ms.
FORMULA Anderson-PT-11-LTLCardinality-10 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-11-LTLCardinality-10 finished in 63034 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 537 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 537/537 places, 914/914 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 120 transitions
Trivial Post-agglo rules discarded 120 transitions
Performed 120 trivial Post agglomeration. Transition count delta: 120
Iterating post reduction 0 with 120 rules applied. Total rules applied 120 place count 537 transition count 794
Reduce places removed 120 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 121 rules applied. Total rules applied 241 place count 417 transition count 793
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 242 place count 416 transition count 793
Performed 109 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 109 Pre rules applied. Total rules applied 242 place count 416 transition count 684
Deduced a syphon composed of 109 places in 1 ms
Reduce places removed 109 places and 0 transitions.
Iterating global reduction 3 with 218 rules applied. Total rules applied 460 place count 307 transition count 684
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 468 place count 299 transition count 596
Iterating global reduction 3 with 8 rules applied. Total rules applied 476 place count 299 transition count 596
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 478 place count 298 transition count 595
Applied a total of 478 rules in 58 ms. Remains 298 /537 variables (removed 239) and now considering 595/914 (removed 319) transitions.
// Phase 1: matrix 595 rows 298 cols
[2024-05-23 10:44:18] [INFO ] Computed 24 invariants in 5 ms
[2024-05-23 10:44:18] [INFO ] Implicit Places using invariants in 463 ms returned []
[2024-05-23 10:44:18] [INFO ] Invariant cache hit.
[2024-05-23 10:44:19] [INFO ] State equation strengthened by 110 read => feed constraints.
[2024-05-23 10:44:20] [INFO ] Implicit Places using invariants and state equation in 1303 ms returned []
Implicit Place search using SMT with State Equation took 1768 ms to find 0 implicit places.
[2024-05-23 10:44:20] [INFO ] Redundant transitions in 4 ms returned []
Running 584 sub problems to find dead transitions.
[2024-05-23 10:44:20] [INFO ] Invariant cache hit.
[2024-05-23 10:44:20] [INFO ] State equation strengthened by 110 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/297 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 584 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/297 variables, 10/23 constraints. Problems are: Problem set: 0 solved, 584 unsolved
[2024-05-23 10:44:27] [INFO ] Deduced a trap composed of 138 places in 292 ms of which 3 ms to minimize.
[2024-05-23 10:44:27] [INFO ] Deduced a trap composed of 121 places in 276 ms of which 3 ms to minimize.
[2024-05-23 10:44:27] [INFO ] Deduced a trap composed of 85 places in 265 ms of which 4 ms to minimize.
[2024-05-23 10:44:28] [INFO ] Deduced a trap composed of 98 places in 271 ms of which 4 ms to minimize.
[2024-05-23 10:44:28] [INFO ] Deduced a trap composed of 91 places in 272 ms of which 3 ms to minimize.
[2024-05-23 10:44:28] [INFO ] Deduced a trap composed of 104 places in 255 ms of which 4 ms to minimize.
[2024-05-23 10:44:29] [INFO ] Deduced a trap composed of 130 places in 276 ms of which 4 ms to minimize.
[2024-05-23 10:44:29] [INFO ] Deduced a trap composed of 105 places in 259 ms of which 4 ms to minimize.
[2024-05-23 10:44:29] [INFO ] Deduced a trap composed of 107 places in 300 ms of which 4 ms to minimize.
[2024-05-23 10:44:29] [INFO ] Deduced a trap composed of 92 places in 237 ms of which 3 ms to minimize.
[2024-05-23 10:44:30] [INFO ] Deduced a trap composed of 79 places in 273 ms of which 3 ms to minimize.
[2024-05-23 10:44:30] [INFO ] Deduced a trap composed of 125 places in 238 ms of which 4 ms to minimize.
[2024-05-23 10:44:30] [INFO ] Deduced a trap composed of 83 places in 260 ms of which 4 ms to minimize.
[2024-05-23 10:44:30] [INFO ] Deduced a trap composed of 73 places in 229 ms of which 3 ms to minimize.
[2024-05-23 10:44:31] [INFO ] Deduced a trap composed of 100 places in 266 ms of which 4 ms to minimize.
[2024-05-23 10:44:31] [INFO ] Deduced a trap composed of 71 places in 252 ms of which 3 ms to minimize.
[2024-05-23 10:44:31] [INFO ] Deduced a trap composed of 87 places in 189 ms of which 3 ms to minimize.
[2024-05-23 10:44:31] [INFO ] Deduced a trap composed of 81 places in 268 ms of which 3 ms to minimize.
[2024-05-23 10:44:32] [INFO ] Deduced a trap composed of 73 places in 271 ms of which 3 ms to minimize.
[2024-05-23 10:44:32] [INFO ] Deduced a trap composed of 77 places in 275 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/297 variables, 20/43 constraints. Problems are: Problem set: 0 solved, 584 unsolved
[2024-05-23 10:44:36] [INFO ] Deduced a trap composed of 116 places in 265 ms of which 3 ms to minimize.
[2024-05-23 10:44:36] [INFO ] Deduced a trap composed of 92 places in 285 ms of which 3 ms to minimize.
[2024-05-23 10:44:37] [INFO ] Deduced a trap composed of 106 places in 272 ms of which 4 ms to minimize.
[2024-05-23 10:44:37] [INFO ] Deduced a trap composed of 75 places in 271 ms of which 3 ms to minimize.
[2024-05-23 10:44:37] [INFO ] Deduced a trap composed of 104 places in 269 ms of which 3 ms to minimize.
[2024-05-23 10:44:38] [INFO ] Deduced a trap composed of 73 places in 275 ms of which 3 ms to minimize.
[2024-05-23 10:44:38] [INFO ] Deduced a trap composed of 104 places in 265 ms of which 4 ms to minimize.
[2024-05-23 10:44:38] [INFO ] Deduced a trap composed of 73 places in 364 ms of which 5 ms to minimize.
[2024-05-23 10:44:39] [INFO ] Deduced a trap composed of 71 places in 302 ms of which 3 ms to minimize.
[2024-05-23 10:44:39] [INFO ] Deduced a trap composed of 90 places in 262 ms of which 3 ms to minimize.
[2024-05-23 10:44:39] [INFO ] Deduced a trap composed of 93 places in 287 ms of which 3 ms to minimize.
[2024-05-23 10:44:39] [INFO ] Deduced a trap composed of 85 places in 257 ms of which 3 ms to minimize.
[2024-05-23 10:44:40] [INFO ] Deduced a trap composed of 86 places in 272 ms of which 3 ms to minimize.
[2024-05-23 10:44:40] [INFO ] Deduced a trap composed of 80 places in 271 ms of which 4 ms to minimize.
[2024-05-23 10:44:40] [INFO ] Deduced a trap composed of 94 places in 271 ms of which 3 ms to minimize.
[2024-05-23 10:44:40] [INFO ] Deduced a trap composed of 88 places in 212 ms of which 4 ms to minimize.
[2024-05-23 10:44:41] [INFO ] Deduced a trap composed of 95 places in 282 ms of which 4 ms to minimize.
[2024-05-23 10:44:41] [INFO ] Deduced a trap composed of 80 places in 215 ms of which 3 ms to minimize.
[2024-05-23 10:44:41] [INFO ] Deduced a trap composed of 97 places in 292 ms of which 3 ms to minimize.
[2024-05-23 10:44:42] [INFO ] Deduced a trap composed of 96 places in 272 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/297 variables, 20/63 constraints. Problems are: Problem set: 0 solved, 584 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/297 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 584 unsolved
At refinement iteration 5 (OVERLAPS) 1/298 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 584 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 298/893 variables, and 64 constraints, problems are : Problem set: 0 solved, 584 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 0/298 constraints, ReadFeed: 0/110 constraints, PredecessorRefiner: 584/584 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 584 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/297 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 584 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/297 variables, 10/23 constraints. Problems are: Problem set: 0 solved, 584 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/297 variables, 40/63 constraints. Problems are: Problem set: 0 solved, 584 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 297/893 variables, and 63 constraints, problems are : Problem set: 0 solved, 584 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 10/11 constraints, State Equation: 0/298 constraints, ReadFeed: 0/110 constraints, PredecessorRefiner: 0/584 constraints, Known Traps: 40/40 constraints]
After SMT, in 60501ms problems are : Problem set: 0 solved, 584 unsolved
Search for dead transitions found 0 dead transitions in 60508ms
Starting structural reductions in SI_LTL mode, iteration 1 : 298/537 places, 595/914 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 62347 ms. Remains : 298/537 places, 595/914 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Anderson-PT-11-LTLCardinality-12
Product exploration explored 100000 steps with 42 reset in 208 ms.
Product exploration explored 100000 steps with 36 reset in 281 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 84 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 2865 steps (0 resets) in 21 ms. (130 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 111 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 298 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 298/298 places, 595/595 transitions.
Applied a total of 0 rules in 16 ms. Remains 298 /298 variables (removed 0) and now considering 595/595 (removed 0) transitions.
[2024-05-23 10:45:21] [INFO ] Invariant cache hit.
[2024-05-23 10:45:22] [INFO ] Implicit Places using invariants in 464 ms returned []
[2024-05-23 10:45:22] [INFO ] Invariant cache hit.
[2024-05-23 10:45:22] [INFO ] State equation strengthened by 110 read => feed constraints.
[2024-05-23 10:45:23] [INFO ] Implicit Places using invariants and state equation in 1343 ms returned []
Implicit Place search using SMT with State Equation took 1810 ms to find 0 implicit places.
[2024-05-23 10:45:23] [INFO ] Redundant transitions in 4 ms returned []
Running 584 sub problems to find dead transitions.
[2024-05-23 10:45:23] [INFO ] Invariant cache hit.
[2024-05-23 10:45:23] [INFO ] State equation strengthened by 110 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/297 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 584 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/297 variables, 10/23 constraints. Problems are: Problem set: 0 solved, 584 unsolved
[2024-05-23 10:45:31] [INFO ] Deduced a trap composed of 138 places in 331 ms of which 3 ms to minimize.
[2024-05-23 10:45:31] [INFO ] Deduced a trap composed of 121 places in 269 ms of which 3 ms to minimize.
[2024-05-23 10:45:31] [INFO ] Deduced a trap composed of 85 places in 283 ms of which 3 ms to minimize.
[2024-05-23 10:45:31] [INFO ] Deduced a trap composed of 98 places in 266 ms of which 4 ms to minimize.
[2024-05-23 10:45:32] [INFO ] Deduced a trap composed of 91 places in 273 ms of which 3 ms to minimize.
[2024-05-23 10:45:32] [INFO ] Deduced a trap composed of 104 places in 277 ms of which 3 ms to minimize.
[2024-05-23 10:45:32] [INFO ] Deduced a trap composed of 130 places in 270 ms of which 3 ms to minimize.
[2024-05-23 10:45:33] [INFO ] Deduced a trap composed of 105 places in 358 ms of which 5 ms to minimize.
[2024-05-23 10:45:33] [INFO ] Deduced a trap composed of 107 places in 310 ms of which 5 ms to minimize.
[2024-05-23 10:45:33] [INFO ] Deduced a trap composed of 92 places in 270 ms of which 3 ms to minimize.
[2024-05-23 10:45:34] [INFO ] Deduced a trap composed of 79 places in 292 ms of which 4 ms to minimize.
[2024-05-23 10:45:34] [INFO ] Deduced a trap composed of 125 places in 267 ms of which 4 ms to minimize.
[2024-05-23 10:45:34] [INFO ] Deduced a trap composed of 83 places in 284 ms of which 4 ms to minimize.
[2024-05-23 10:45:34] [INFO ] Deduced a trap composed of 73 places in 281 ms of which 3 ms to minimize.
[2024-05-23 10:45:35] [INFO ] Deduced a trap composed of 100 places in 269 ms of which 3 ms to minimize.
[2024-05-23 10:45:35] [INFO ] Deduced a trap composed of 71 places in 271 ms of which 3 ms to minimize.
[2024-05-23 10:45:35] [INFO ] Deduced a trap composed of 87 places in 269 ms of which 4 ms to minimize.
[2024-05-23 10:45:36] [INFO ] Deduced a trap composed of 81 places in 274 ms of which 3 ms to minimize.
[2024-05-23 10:45:36] [INFO ] Deduced a trap composed of 73 places in 284 ms of which 4 ms to minimize.
[2024-05-23 10:45:36] [INFO ] Deduced a trap composed of 77 places in 288 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/297 variables, 20/43 constraints. Problems are: Problem set: 0 solved, 584 unsolved
[2024-05-23 10:45:40] [INFO ] Deduced a trap composed of 116 places in 278 ms of which 3 ms to minimize.
[2024-05-23 10:45:40] [INFO ] Deduced a trap composed of 92 places in 237 ms of which 3 ms to minimize.
[2024-05-23 10:45:41] [INFO ] Deduced a trap composed of 106 places in 295 ms of which 3 ms to minimize.
[2024-05-23 10:45:41] [INFO ] Deduced a trap composed of 75 places in 268 ms of which 4 ms to minimize.
[2024-05-23 10:45:41] [INFO ] Deduced a trap composed of 104 places in 276 ms of which 3 ms to minimize.
[2024-05-23 10:45:42] [INFO ] Deduced a trap composed of 73 places in 380 ms of which 5 ms to minimize.
[2024-05-23 10:45:42] [INFO ] Deduced a trap composed of 104 places in 318 ms of which 4 ms to minimize.
[2024-05-23 10:45:42] [INFO ] Deduced a trap composed of 73 places in 281 ms of which 4 ms to minimize.
[2024-05-23 10:45:43] [INFO ] Deduced a trap composed of 71 places in 356 ms of which 5 ms to minimize.
[2024-05-23 10:45:43] [INFO ] Deduced a trap composed of 90 places in 325 ms of which 3 ms to minimize.
[2024-05-23 10:45:43] [INFO ] Deduced a trap composed of 93 places in 274 ms of which 3 ms to minimize.
[2024-05-23 10:45:44] [INFO ] Deduced a trap composed of 85 places in 223 ms of which 4 ms to minimize.
[2024-05-23 10:45:44] [INFO ] Deduced a trap composed of 86 places in 291 ms of which 5 ms to minimize.
[2024-05-23 10:45:44] [INFO ] Deduced a trap composed of 80 places in 285 ms of which 3 ms to minimize.
[2024-05-23 10:45:44] [INFO ] Deduced a trap composed of 94 places in 286 ms of which 4 ms to minimize.
[2024-05-23 10:45:45] [INFO ] Deduced a trap composed of 88 places in 288 ms of which 3 ms to minimize.
[2024-05-23 10:45:45] [INFO ] Deduced a trap composed of 95 places in 284 ms of which 3 ms to minimize.
[2024-05-23 10:45:45] [INFO ] Deduced a trap composed of 80 places in 285 ms of which 4 ms to minimize.
[2024-05-23 10:45:46] [INFO ] Deduced a trap composed of 97 places in 216 ms of which 3 ms to minimize.
[2024-05-23 10:45:46] [INFO ] Deduced a trap composed of 96 places in 281 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/297 variables, 20/63 constraints. Problems are: Problem set: 0 solved, 584 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/297 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 584 unsolved
SMT process timed out in 30474ms, After SMT, problems are : Problem set: 0 solved, 584 unsolved
Search for dead transitions found 0 dead transitions in 30482ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 32322 ms. Remains : 298/298 places, 595/595 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 82 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 11402 steps (3 resets) in 49 ms. (228 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 105 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 39 reset in 208 ms.
Product exploration explored 100000 steps with 46 reset in 251 ms.
Support contains 2 out of 298 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 298/298 places, 595/595 transitions.
Applied a total of 0 rules in 16 ms. Remains 298 /298 variables (removed 0) and now considering 595/595 (removed 0) transitions.
[2024-05-23 10:45:54] [INFO ] Invariant cache hit.
[2024-05-23 10:45:55] [INFO ] Implicit Places using invariants in 575 ms returned []
[2024-05-23 10:45:55] [INFO ] Invariant cache hit.
[2024-05-23 10:45:55] [INFO ] State equation strengthened by 110 read => feed constraints.
[2024-05-23 10:45:56] [INFO ] Implicit Places using invariants and state equation in 1338 ms returned []
Implicit Place search using SMT with State Equation took 1915 ms to find 0 implicit places.
[2024-05-23 10:45:56] [INFO ] Redundant transitions in 4 ms returned []
Running 584 sub problems to find dead transitions.
[2024-05-23 10:45:56] [INFO ] Invariant cache hit.
[2024-05-23 10:45:56] [INFO ] State equation strengthened by 110 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/297 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 584 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/297 variables, 10/23 constraints. Problems are: Problem set: 0 solved, 584 unsolved
[2024-05-23 10:46:04] [INFO ] Deduced a trap composed of 138 places in 280 ms of which 4 ms to minimize.
[2024-05-23 10:46:04] [INFO ] Deduced a trap composed of 121 places in 259 ms of which 4 ms to minimize.
[2024-05-23 10:46:05] [INFO ] Deduced a trap composed of 85 places in 262 ms of which 3 ms to minimize.
[2024-05-23 10:46:05] [INFO ] Deduced a trap composed of 98 places in 300 ms of which 3 ms to minimize.
[2024-05-23 10:46:05] [INFO ] Deduced a trap composed of 91 places in 270 ms of which 3 ms to minimize.
[2024-05-23 10:46:05] [INFO ] Deduced a trap composed of 104 places in 269 ms of which 4 ms to minimize.
[2024-05-23 10:46:06] [INFO ] Deduced a trap composed of 130 places in 284 ms of which 4 ms to minimize.
[2024-05-23 10:46:06] [INFO ] Deduced a trap composed of 105 places in 277 ms of which 3 ms to minimize.
[2024-05-23 10:46:06] [INFO ] Deduced a trap composed of 107 places in 279 ms of which 3 ms to minimize.
[2024-05-23 10:46:07] [INFO ] Deduced a trap composed of 92 places in 388 ms of which 5 ms to minimize.
[2024-05-23 10:46:07] [INFO ] Deduced a trap composed of 79 places in 305 ms of which 3 ms to minimize.
[2024-05-23 10:46:07] [INFO ] Deduced a trap composed of 125 places in 260 ms of which 4 ms to minimize.
[2024-05-23 10:46:08] [INFO ] Deduced a trap composed of 83 places in 254 ms of which 4 ms to minimize.
[2024-05-23 10:46:08] [INFO ] Deduced a trap composed of 73 places in 283 ms of which 3 ms to minimize.
[2024-05-23 10:46:08] [INFO ] Deduced a trap composed of 100 places in 266 ms of which 3 ms to minimize.
[2024-05-23 10:46:08] [INFO ] Deduced a trap composed of 71 places in 269 ms of which 3 ms to minimize.
[2024-05-23 10:46:09] [INFO ] Deduced a trap composed of 87 places in 273 ms of which 4 ms to minimize.
[2024-05-23 10:46:09] [INFO ] Deduced a trap composed of 81 places in 271 ms of which 3 ms to minimize.
[2024-05-23 10:46:09] [INFO ] Deduced a trap composed of 73 places in 269 ms of which 3 ms to minimize.
[2024-05-23 10:46:10] [INFO ] Deduced a trap composed of 77 places in 359 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/297 variables, 20/43 constraints. Problems are: Problem set: 0 solved, 584 unsolved
[2024-05-23 10:46:15] [INFO ] Deduced a trap composed of 116 places in 413 ms of which 5 ms to minimize.
[2024-05-23 10:46:16] [INFO ] Deduced a trap composed of 92 places in 397 ms of which 5 ms to minimize.
[2024-05-23 10:46:16] [INFO ] Deduced a trap composed of 106 places in 380 ms of which 5 ms to minimize.
[2024-05-23 10:46:16] [INFO ] Deduced a trap composed of 75 places in 391 ms of which 5 ms to minimize.
[2024-05-23 10:46:17] [INFO ] Deduced a trap composed of 104 places in 386 ms of which 5 ms to minimize.
[2024-05-23 10:46:17] [INFO ] Deduced a trap composed of 73 places in 372 ms of which 5 ms to minimize.
[2024-05-23 10:46:17] [INFO ] Deduced a trap composed of 104 places in 357 ms of which 5 ms to minimize.
[2024-05-23 10:46:18] [INFO ] Deduced a trap composed of 73 places in 390 ms of which 5 ms to minimize.
[2024-05-23 10:46:18] [INFO ] Deduced a trap composed of 71 places in 398 ms of which 5 ms to minimize.
[2024-05-23 10:46:19] [INFO ] Deduced a trap composed of 90 places in 409 ms of which 5 ms to minimize.
[2024-05-23 10:46:19] [INFO ] Deduced a trap composed of 93 places in 309 ms of which 3 ms to minimize.
[2024-05-23 10:46:19] [INFO ] Deduced a trap composed of 85 places in 266 ms of which 4 ms to minimize.
[2024-05-23 10:46:20] [INFO ] Deduced a trap composed of 86 places in 365 ms of which 4 ms to minimize.
[2024-05-23 10:46:20] [INFO ] Deduced a trap composed of 80 places in 322 ms of which 4 ms to minimize.
[2024-05-23 10:46:20] [INFO ] Deduced a trap composed of 94 places in 293 ms of which 4 ms to minimize.
[2024-05-23 10:46:21] [INFO ] Deduced a trap composed of 88 places in 268 ms of which 3 ms to minimize.
[2024-05-23 10:46:21] [INFO ] Deduced a trap composed of 95 places in 222 ms of which 3 ms to minimize.
[2024-05-23 10:46:21] [INFO ] Deduced a trap composed of 80 places in 236 ms of which 3 ms to minimize.
[2024-05-23 10:46:21] [INFO ] Deduced a trap composed of 97 places in 275 ms of which 3 ms to minimize.
[2024-05-23 10:46:22] [INFO ] Deduced a trap composed of 96 places in 264 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 1.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 (/ 7.0 11.0))
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 (/ 3.0 11.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 (/ 4.0 11.0))
(s126 0.0)
(s127 (/ 7.0 11.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 (/ 7.0 11.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 (/ 4.0 11.0))
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 (/ 4.0 11.0))
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/297 variables, 20/63 constraints. Problems are: Problem set: 0 solved, 584 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 297/893 variables, and 63 constraints, problems are : Problem set: 0 solved, 584 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 10/11 constraints, State Equation: 0/298 constraints, ReadFeed: 0/110 constraints, PredecessorRefiner: 584/584 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 584 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/297 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 584 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/297 variables, 10/23 constraints. Problems are: Problem set: 0 solved, 584 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/297 variables, 40/63 constraints. Problems are: Problem set: 0 solved, 584 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 297/893 variables, and 63 constraints, problems are : Problem set: 0 solved, 584 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 10/11 constraints, State Equation: 0/298 constraints, ReadFeed: 0/110 constraints, PredecessorRefiner: 0/584 constraints, Known Traps: 40/40 constraints]
After SMT, in 60507ms problems are : Problem set: 0 solved, 584 unsolved
Search for dead transitions found 0 dead transitions in 60514ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 62456 ms. Remains : 298/298 places, 595/595 transitions.
Treatment of property Anderson-PT-11-LTLCardinality-12 finished in 159326 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 537 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 537/537 places, 914/914 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 120 transitions
Trivial Post-agglo rules discarded 120 transitions
Performed 120 trivial Post agglomeration. Transition count delta: 120
Iterating post reduction 0 with 120 rules applied. Total rules applied 120 place count 537 transition count 794
Reduce places removed 120 places and 0 transitions.
Iterating post reduction 1 with 120 rules applied. Total rules applied 240 place count 417 transition count 794
Performed 109 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 109 Pre rules applied. Total rules applied 240 place count 417 transition count 685
Deduced a syphon composed of 109 places in 1 ms
Reduce places removed 109 places and 0 transitions.
Iterating global reduction 2 with 218 rules applied. Total rules applied 458 place count 308 transition count 685
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 466 place count 300 transition count 617
Iterating global reduction 2 with 8 rules applied. Total rules applied 474 place count 300 transition count 617
Applied a total of 474 rules in 41 ms. Remains 300 /537 variables (removed 237) and now considering 617/914 (removed 297) transitions.
// Phase 1: matrix 617 rows 300 cols
[2024-05-23 10:46:57] [INFO ] Computed 24 invariants in 4 ms
[2024-05-23 10:46:58] [INFO ] Implicit Places using invariants in 542 ms returned []
[2024-05-23 10:46:58] [INFO ] Invariant cache hit.
[2024-05-23 10:46:58] [INFO ] State equation strengthened by 110 read => feed constraints.
[2024-05-23 10:47:00] [INFO ] Implicit Places using invariants and state equation in 2177 ms returned []
Implicit Place search using SMT with State Equation took 2723 ms to find 0 implicit places.
[2024-05-23 10:47:00] [INFO ] Redundant transitions in 7 ms returned []
Running 606 sub problems to find dead transitions.
[2024-05-23 10:47:00] [INFO ] Invariant cache hit.
[2024-05-23 10:47:00] [INFO ] State equation strengthened by 110 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/300 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 606 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/300 variables, 11/24 constraints. Problems are: Problem set: 0 solved, 606 unsolved
[2024-05-23 10:47:11] [INFO ] Deduced a trap composed of 69 places in 407 ms of which 5 ms to minimize.
[2024-05-23 10:47:12] [INFO ] Deduced a trap composed of 148 places in 404 ms of which 5 ms to minimize.
[2024-05-23 10:47:12] [INFO ] Deduced a trap composed of 138 places in 410 ms of which 5 ms to minimize.
[2024-05-23 10:47:13] [INFO ] Deduced a trap composed of 111 places in 411 ms of which 5 ms to minimize.
[2024-05-23 10:47:13] [INFO ] Deduced a trap composed of 101 places in 403 ms of which 5 ms to minimize.
[2024-05-23 10:47:14] [INFO ] Deduced a trap composed of 108 places in 343 ms of which 5 ms to minimize.
[2024-05-23 10:47:14] [INFO ] Deduced a trap composed of 102 places in 421 ms of which 5 ms to minimize.
[2024-05-23 10:47:14] [INFO ] Deduced a trap composed of 90 places in 422 ms of which 5 ms to minimize.
[2024-05-23 10:47:15] [INFO ] Deduced a trap composed of 83 places in 405 ms of which 5 ms to minimize.
[2024-05-23 10:47:15] [INFO ] Deduced a trap composed of 113 places in 398 ms of which 5 ms to minimize.
[2024-05-23 10:47:16] [INFO ] Deduced a trap composed of 130 places in 351 ms of which 4 ms to minimize.
[2024-05-23 10:47:16] [INFO ] Deduced a trap composed of 97 places in 394 ms of which 5 ms to minimize.
[2024-05-23 10:47:16] [INFO ] Deduced a trap composed of 111 places in 386 ms of which 5 ms to minimize.
[2024-05-23 10:47:17] [INFO ] Deduced a trap composed of 106 places in 410 ms of which 5 ms to minimize.
[2024-05-23 10:47:17] [INFO ] Deduced a trap composed of 119 places in 388 ms of which 5 ms to minimize.
[2024-05-23 10:47:18] [INFO ] Deduced a trap composed of 73 places in 355 ms of which 5 ms to minimize.
[2024-05-23 10:47:18] [INFO ] Deduced a trap composed of 77 places in 376 ms of which 5 ms to minimize.
[2024-05-23 10:47:18] [INFO ] Deduced a trap composed of 71 places in 351 ms of which 4 ms to minimize.
[2024-05-23 10:47:19] [INFO ] Deduced a trap composed of 82 places in 366 ms of which 5 ms to minimize.
[2024-05-23 10:47:19] [INFO ] Deduced a trap composed of 70 places in 398 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/300 variables, 20/44 constraints. Problems are: Problem set: 0 solved, 606 unsolved
[2024-05-23 10:47:23] [INFO ] Deduced a trap composed of 68 places in 398 ms of which 5 ms to minimize.
[2024-05-23 10:47:23] [INFO ] Deduced a trap composed of 94 places in 343 ms of which 5 ms to minimize.
[2024-05-23 10:47:25] [INFO ] Deduced a trap composed of 139 places in 423 ms of which 5 ms to minimize.
[2024-05-23 10:47:25] [INFO ] Deduced a trap composed of 106 places in 403 ms of which 5 ms to minimize.
[2024-05-23 10:47:25] [INFO ] Deduced a trap composed of 107 places in 376 ms of which 4 ms to minimize.
[2024-05-23 10:47:26] [INFO ] Deduced a trap composed of 107 places in 431 ms of which 5 ms to minimize.
[2024-05-23 10:47:26] [INFO ] Deduced a trap composed of 108 places in 411 ms of which 5 ms to minimize.
[2024-05-23 10:47:27] [INFO ] Deduced a trap composed of 110 places in 405 ms of which 5 ms to minimize.
[2024-05-23 10:47:27] [INFO ] Deduced a trap composed of 95 places in 430 ms of which 5 ms to minimize.
[2024-05-23 10:47:28] [INFO ] Deduced a trap composed of 107 places in 416 ms of which 6 ms to minimize.
[2024-05-23 10:47:28] [INFO ] Deduced a trap composed of 113 places in 407 ms of which 5 ms to minimize.
[2024-05-23 10:47:28] [INFO ] Deduced a trap composed of 89 places in 404 ms of which 5 ms to minimize.
[2024-05-23 10:47:29] [INFO ] Deduced a trap composed of 104 places in 395 ms of which 5 ms to minimize.
[2024-05-23 10:47:29] [INFO ] Deduced a trap composed of 88 places in 419 ms of which 5 ms to minimize.
[2024-05-23 10:47:30] [INFO ] Deduced a trap composed of 73 places in 413 ms of which 5 ms to minimize.
[2024-05-23 10:47:31] [INFO ] Deduced a trap composed of 63 places in 432 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 300/917 variables, and 60 constraints, problems are : Problem set: 0 solved, 606 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 0/300 constraints, ReadFeed: 0/110 constraints, PredecessorRefiner: 606/606 constraints, Known Traps: 36/36 constraints]
Escalating to Integer solving :Problem set: 0 solved, 606 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/300 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 606 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/300 variables, 11/24 constraints. Problems are: Problem set: 0 solved, 606 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/300 variables, 36/60 constraints. Problems are: Problem set: 0 solved, 606 unsolved
[2024-05-23 10:47:37] [INFO ] Deduced a trap composed of 106 places in 400 ms of which 5 ms to minimize.
[2024-05-23 10:47:38] [INFO ] Deduced a trap composed of 74 places in 410 ms of which 5 ms to minimize.
[2024-05-23 10:47:38] [INFO ] Deduced a trap composed of 113 places in 393 ms of which 5 ms to minimize.
[2024-05-23 10:47:39] [INFO ] Deduced a trap composed of 128 places in 342 ms of which 5 ms to minimize.
[2024-05-23 10:47:39] [INFO ] Deduced a trap composed of 117 places in 400 ms of which 5 ms to minimize.
[2024-05-23 10:47:39] [INFO ] Deduced a trap composed of 86 places in 407 ms of which 5 ms to minimize.
[2024-05-23 10:47:40] [INFO ] Deduced a trap composed of 96 places in 420 ms of which 5 ms to minimize.
[2024-05-23 10:47:40] [INFO ] Deduced a trap composed of 81 places in 421 ms of which 5 ms to minimize.
[2024-05-23 10:47:41] [INFO ] Deduced a trap composed of 114 places in 431 ms of which 5 ms to minimize.
[2024-05-23 10:47:41] [INFO ] Deduced a trap composed of 87 places in 399 ms of which 5 ms to minimize.
[2024-05-23 10:47:42] [INFO ] Deduced a trap composed of 110 places in 424 ms of which 5 ms to minimize.
[2024-05-23 10:47:42] [INFO ] Deduced a trap composed of 87 places in 398 ms of which 5 ms to minimize.
[2024-05-23 10:47:42] [INFO ] Deduced a trap composed of 98 places in 407 ms of which 5 ms to minimize.
[2024-05-23 10:47:43] [INFO ] Deduced a trap composed of 86 places in 417 ms of which 5 ms to minimize.
[2024-05-23 10:47:43] [INFO ] Deduced a trap composed of 80 places in 404 ms of which 5 ms to minimize.
[2024-05-23 10:47:44] [INFO ] Deduced a trap composed of 112 places in 344 ms of which 5 ms to minimize.
[2024-05-23 10:47:44] [INFO ] Deduced a trap composed of 96 places in 397 ms of which 5 ms to minimize.
[2024-05-23 10:47:45] [INFO ] Deduced a trap composed of 106 places in 421 ms of which 5 ms to minimize.
[2024-05-23 10:47:45] [INFO ] Deduced a trap composed of 118 places in 401 ms of which 5 ms to minimize.
[2024-05-23 10:47:45] [INFO ] Deduced a trap composed of 127 places in 429 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/300 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 606 unsolved
[2024-05-23 10:47:51] [INFO ] Deduced a trap composed of 122 places in 399 ms of which 5 ms to minimize.
[2024-05-23 10:47:52] [INFO ] Deduced a trap composed of 63 places in 357 ms of which 4 ms to minimize.
[2024-05-23 10:47:52] [INFO ] Deduced a trap composed of 77 places in 411 ms of which 5 ms to minimize.
[2024-05-23 10:47:52] [INFO ] Deduced a trap composed of 63 places in 418 ms of which 5 ms to minimize.
[2024-05-23 10:47:53] [INFO ] Deduced a trap composed of 63 places in 407 ms of which 5 ms to minimize.
[2024-05-23 10:47:53] [INFO ] Deduced a trap composed of 128 places in 407 ms of which 5 ms to minimize.
[2024-05-23 10:47:54] [INFO ] Deduced a trap composed of 89 places in 382 ms of which 5 ms to minimize.
[2024-05-23 10:47:54] [INFO ] Deduced a trap composed of 106 places in 406 ms of which 5 ms to minimize.
[2024-05-23 10:47:54] [INFO ] Deduced a trap composed of 82 places in 403 ms of which 5 ms to minimize.
[2024-05-23 10:47:55] [INFO ] Deduced a trap composed of 135 places in 409 ms of which 5 ms to minimize.
[2024-05-23 10:47:55] [INFO ] Deduced a trap composed of 98 places in 415 ms of which 5 ms to minimize.
[2024-05-23 10:47:56] [INFO ] Deduced a trap composed of 78 places in 349 ms of which 5 ms to minimize.
[2024-05-23 10:47:56] [INFO ] Deduced a trap composed of 98 places in 403 ms of which 5 ms to minimize.
[2024-05-23 10:47:57] [INFO ] Deduced a trap composed of 84 places in 428 ms of which 5 ms to minimize.
[2024-05-23 10:47:57] [INFO ] Deduced a trap composed of 84 places in 412 ms of which 5 ms to minimize.
[2024-05-23 10:47:57] [INFO ] Deduced a trap composed of 79 places in 414 ms of which 5 ms to minimize.
[2024-05-23 10:47:58] [INFO ] Deduced a trap composed of 82 places in 423 ms of which 5 ms to minimize.
[2024-05-23 10:47:58] [INFO ] Deduced a trap composed of 73 places in 402 ms of which 5 ms to minimize.
[2024-05-23 10:47:59] [INFO ] Deduced a trap composed of 91 places in 398 ms of which 5 ms to minimize.
[2024-05-23 10:47:59] [INFO ] Deduced a trap composed of 89 places in 431 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/300 variables, 20/100 constraints. Problems are: Problem set: 0 solved, 606 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 300/917 variables, and 100 constraints, problems are : Problem set: 0 solved, 606 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 0/300 constraints, ReadFeed: 0/110 constraints, PredecessorRefiner: 0/606 constraints, Known Traps: 76/76 constraints]
After SMT, in 60725ms problems are : Problem set: 0 solved, 606 unsolved
Search for dead transitions found 0 dead transitions in 60737ms
Starting structural reductions in SI_LTL mode, iteration 1 : 300/537 places, 617/914 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 63519 ms. Remains : 300/537 places, 617/914 transitions.
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
Running random walk in product with property : Anderson-PT-11-LTLCardinality-13
Product exploration explored 100000 steps with 0 reset in 296 ms.
Stack based approach found an accepted trace after 50 steps with 0 reset with depth 51 and stack size 51 in 1 ms.
FORMULA Anderson-PT-11-LTLCardinality-13 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-11-LTLCardinality-13 finished in 63887 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 537 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 537/537 places, 914/914 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 120 transitions
Trivial Post-agglo rules discarded 120 transitions
Performed 120 trivial Post agglomeration. Transition count delta: 120
Iterating post reduction 0 with 120 rules applied. Total rules applied 120 place count 537 transition count 794
Reduce places removed 120 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 121 rules applied. Total rules applied 241 place count 417 transition count 793
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 242 place count 416 transition count 793
Performed 109 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 109 Pre rules applied. Total rules applied 242 place count 416 transition count 684
Deduced a syphon composed of 109 places in 0 ms
Reduce places removed 109 places and 0 transitions.
Iterating global reduction 3 with 218 rules applied. Total rules applied 460 place count 307 transition count 684
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 469 place count 298 transition count 595
Iterating global reduction 3 with 9 rules applied. Total rules applied 478 place count 298 transition count 595
Applied a total of 478 rules in 72 ms. Remains 298 /537 variables (removed 239) and now considering 595/914 (removed 319) transitions.
// Phase 1: matrix 595 rows 298 cols
[2024-05-23 10:48:01] [INFO ] Computed 24 invariants in 8 ms
[2024-05-23 10:48:02] [INFO ] Implicit Places using invariants in 681 ms returned []
[2024-05-23 10:48:02] [INFO ] Invariant cache hit.
[2024-05-23 10:48:02] [INFO ] State equation strengthened by 110 read => feed constraints.
[2024-05-23 10:48:04] [INFO ] Implicit Places using invariants and state equation in 2676 ms returned []
Implicit Place search using SMT with State Equation took 3359 ms to find 0 implicit places.
[2024-05-23 10:48:04] [INFO ] Redundant transitions in 6 ms returned []
Running 584 sub problems to find dead transitions.
[2024-05-23 10:48:04] [INFO ] Invariant cache hit.
[2024-05-23 10:48:04] [INFO ] State equation strengthened by 110 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/297 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 584 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/297 variables, 10/23 constraints. Problems are: Problem set: 0 solved, 584 unsolved
[2024-05-23 10:48:15] [INFO ] Deduced a trap composed of 154 places in 412 ms of which 5 ms to minimize.
[2024-05-23 10:48:16] [INFO ] Deduced a trap composed of 92 places in 416 ms of which 5 ms to minimize.
[2024-05-23 10:48:17] [INFO ] Deduced a trap composed of 118 places in 418 ms of which 5 ms to minimize.
[2024-05-23 10:48:17] [INFO ] Deduced a trap composed of 129 places in 411 ms of which 5 ms to minimize.
[2024-05-23 10:48:17] [INFO ] Deduced a trap composed of 111 places in 409 ms of which 5 ms to minimize.
[2024-05-23 10:48:18] [INFO ] Deduced a trap composed of 104 places in 403 ms of which 5 ms to minimize.
[2024-05-23 10:48:18] [INFO ] Deduced a trap composed of 105 places in 422 ms of which 5 ms to minimize.
[2024-05-23 10:48:19] [INFO ] Deduced a trap composed of 106 places in 401 ms of which 5 ms to minimize.
[2024-05-23 10:48:19] [INFO ] Deduced a trap composed of 94 places in 415 ms of which 5 ms to minimize.
[2024-05-23 10:48:20] [INFO ] Deduced a trap composed of 83 places in 404 ms of which 5 ms to minimize.
[2024-05-23 10:48:20] [INFO ] Deduced a trap composed of 121 places in 415 ms of which 5 ms to minimize.
[2024-05-23 10:48:21] [INFO ] Deduced a trap composed of 94 places in 351 ms of which 5 ms to minimize.
[2024-05-23 10:48:21] [INFO ] Deduced a trap composed of 97 places in 413 ms of which 5 ms to minimize.
[2024-05-23 10:48:21] [INFO ] Deduced a trap composed of 87 places in 406 ms of which 5 ms to minimize.
[2024-05-23 10:48:22] [INFO ] Deduced a trap composed of 101 places in 402 ms of which 5 ms to minimize.
[2024-05-23 10:48:22] [INFO ] Deduced a trap composed of 92 places in 403 ms of which 5 ms to minimize.
[2024-05-23 10:48:23] [INFO ] Deduced a trap composed of 83 places in 347 ms of which 5 ms to minimize.
[2024-05-23 10:48:23] [INFO ] Deduced a trap composed of 109 places in 396 ms of which 5 ms to minimize.
[2024-05-23 10:48:23] [INFO ] Deduced a trap composed of 82 places in 406 ms of which 5 ms to minimize.
[2024-05-23 10:48:24] [INFO ] Deduced a trap composed of 119 places in 406 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/297 variables, 20/43 constraints. Problems are: Problem set: 0 solved, 584 unsolved
[2024-05-23 10:48:30] [INFO ] Deduced a trap composed of 112 places in 418 ms of which 5 ms to minimize.
[2024-05-23 10:48:31] [INFO ] Deduced a trap composed of 72 places in 378 ms of which 5 ms to minimize.
[2024-05-23 10:48:31] [INFO ] Deduced a trap composed of 110 places in 425 ms of which 5 ms to minimize.
[2024-05-23 10:48:31] [INFO ] Deduced a trap composed of 89 places in 356 ms of which 4 ms to minimize.
[2024-05-23 10:48:32] [INFO ] Deduced a trap composed of 76 places in 419 ms of which 5 ms to minimize.
[2024-05-23 10:48:32] [INFO ] Deduced a trap composed of 79 places in 413 ms of which 5 ms to minimize.
[2024-05-23 10:48:33] [INFO ] Deduced a trap composed of 90 places in 399 ms of which 5 ms to minimize.
[2024-05-23 10:48:33] [INFO ] Deduced a trap composed of 88 places in 397 ms of which 5 ms to minimize.
[2024-05-23 10:48:34] [INFO ] Deduced a trap composed of 82 places in 412 ms of which 5 ms to minimize.
[2024-05-23 10:48:34] [INFO ] Deduced a trap composed of 113 places in 396 ms of which 5 ms to minimize.
[2024-05-23 10:48:34] [INFO ] Deduced a trap composed of 110 places in 385 ms of which 5 ms to minimize.
[2024-05-23 10:48:35] [INFO ] Deduced a trap composed of 100 places in 425 ms of which 5 ms to minimize.
[2024-05-23 10:48:35] [INFO ] Deduced a trap composed of 90 places in 349 ms of which 5 ms to minimize.
SMT process timed out in 30808ms, After SMT, problems are : Problem set: 0 solved, 584 unsolved
Search for dead transitions found 0 dead transitions in 30819ms
Starting structural reductions in SI_LTL mode, iteration 1 : 298/537 places, 595/914 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 34266 ms. Remains : 298/537 places, 595/914 transitions.
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Running random walk in product with property : Anderson-PT-11-LTLCardinality-14
Product exploration explored 100000 steps with 0 reset in 317 ms.
Stack based approach found an accepted trace after 7889 steps with 0 reset with depth 7890 and stack size 6961 in 30 ms.
FORMULA Anderson-PT-11-LTLCardinality-14 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-11-LTLCardinality-14 finished in 34686 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((p1 U p2)||p0))))'
Support contains 4 out of 537 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 537/537 places, 914/914 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 119 transitions
Trivial Post-agglo rules discarded 119 transitions
Performed 119 trivial Post agglomeration. Transition count delta: 119
Iterating post reduction 0 with 119 rules applied. Total rules applied 119 place count 537 transition count 795
Reduce places removed 119 places and 0 transitions.
Iterating post reduction 1 with 119 rules applied. Total rules applied 238 place count 418 transition count 795
Performed 108 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 108 Pre rules applied. Total rules applied 238 place count 418 transition count 687
Deduced a syphon composed of 108 places in 0 ms
Reduce places removed 108 places and 0 transitions.
Iterating global reduction 2 with 216 rules applied. Total rules applied 454 place count 310 transition count 687
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 460 place count 304 transition count 621
Iterating global reduction 2 with 6 rules applied. Total rules applied 466 place count 304 transition count 621
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 470 place count 302 transition count 619
Applied a total of 470 rules in 65 ms. Remains 302 /537 variables (removed 235) and now considering 619/914 (removed 295) transitions.
// Phase 1: matrix 619 rows 302 cols
[2024-05-23 10:48:36] [INFO ] Computed 24 invariants in 10 ms
[2024-05-23 10:48:36] [INFO ] Implicit Places using invariants in 724 ms returned []
[2024-05-23 10:48:36] [INFO ] Invariant cache hit.
[2024-05-23 10:48:37] [INFO ] State equation strengthened by 110 read => feed constraints.
[2024-05-23 10:48:39] [INFO ] Implicit Places using invariants and state equation in 2198 ms returned []
Implicit Place search using SMT with State Equation took 2925 ms to find 0 implicit places.
[2024-05-23 10:48:39] [INFO ] Redundant transitions in 6 ms returned []
Running 608 sub problems to find dead transitions.
[2024-05-23 10:48:39] [INFO ] Invariant cache hit.
[2024-05-23 10:48:39] [INFO ] State equation strengthened by 110 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/302 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 608 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/302 variables, 11/24 constraints. Problems are: Problem set: 0 solved, 608 unsolved
[2024-05-23 10:48:48] [INFO ] Deduced a trap composed of 105 places in 403 ms of which 6 ms to minimize.
[2024-05-23 10:48:48] [INFO ] Deduced a trap composed of 109 places in 389 ms of which 5 ms to minimize.
[2024-05-23 10:48:53] [INFO ] Deduced a trap composed of 107 places in 412 ms of which 6 ms to minimize.
[2024-05-23 10:48:53] [INFO ] Deduced a trap composed of 89 places in 428 ms of which 5 ms to minimize.
[2024-05-23 10:48:54] [INFO ] Deduced a trap composed of 84 places in 417 ms of which 6 ms to minimize.
[2024-05-23 10:48:54] [INFO ] Deduced a trap composed of 96 places in 403 ms of which 5 ms to minimize.
[2024-05-23 10:48:55] [INFO ] Deduced a trap composed of 77 places in 405 ms of which 5 ms to minimize.
[2024-05-23 10:48:55] [INFO ] Deduced a trap composed of 104 places in 410 ms of which 5 ms to minimize.
[2024-05-23 10:48:55] [INFO ] Deduced a trap composed of 84 places in 392 ms of which 5 ms to minimize.
[2024-05-23 10:48:56] [INFO ] Deduced a trap composed of 116 places in 398 ms of which 5 ms to minimize.
[2024-05-23 10:48:56] [INFO ] Deduced a trap composed of 100 places in 410 ms of which 5 ms to minimize.
[2024-05-23 10:48:57] [INFO ] Deduced a trap composed of 138 places in 409 ms of which 5 ms to minimize.
[2024-05-23 10:48:57] [INFO ] Deduced a trap composed of 72 places in 391 ms of which 5 ms to minimize.
[2024-05-23 10:48:58] [INFO ] Deduced a trap composed of 116 places in 418 ms of which 5 ms to minimize.
[2024-05-23 10:48:58] [INFO ] Deduced a trap composed of 112 places in 400 ms of which 5 ms to minimize.
[2024-05-23 10:48:59] [INFO ] Deduced a trap composed of 96 places in 393 ms of which 5 ms to minimize.
[2024-05-23 10:48:59] [INFO ] Deduced a trap composed of 94 places in 414 ms of which 5 ms to minimize.
[2024-05-23 10:48:59] [INFO ] Deduced a trap composed of 84 places in 412 ms of which 5 ms to minimize.
[2024-05-23 10:49:00] [INFO ] Deduced a trap composed of 71 places in 413 ms of which 5 ms to minimize.
[2024-05-23 10:49:00] [INFO ] Deduced a trap composed of 84 places in 412 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/302 variables, 20/44 constraints. Problems are: Problem set: 0 solved, 608 unsolved
[2024-05-23 10:49:02] [INFO ] Deduced a trap composed of 105 places in 420 ms of which 5 ms to minimize.
[2024-05-23 10:49:03] [INFO ] Deduced a trap composed of 92 places in 413 ms of which 5 ms to minimize.
[2024-05-23 10:49:03] [INFO ] Deduced a trap composed of 74 places in 416 ms of which 5 ms to minimize.
[2024-05-23 10:49:04] [INFO ] Deduced a trap composed of 81 places in 355 ms of which 5 ms to minimize.
[2024-05-23 10:49:04] [INFO ] Deduced a trap composed of 97 places in 397 ms of which 5 ms to minimize.
[2024-05-23 10:49:04] [INFO ] Deduced a trap composed of 80 places in 404 ms of which 5 ms to minimize.
[2024-05-23 10:49:05] [INFO ] Deduced a trap composed of 109 places in 399 ms of which 5 ms to minimize.
[2024-05-23 10:49:05] [INFO ] Deduced a trap composed of 76 places in 392 ms of which 6 ms to minimize.
[2024-05-23 10:49:06] [INFO ] Deduced a trap composed of 102 places in 412 ms of which 5 ms to minimize.
[2024-05-23 10:49:06] [INFO ] Deduced a trap composed of 83 places in 412 ms of which 6 ms to minimize.
[2024-05-23 10:49:06] [INFO ] Deduced a trap composed of 80 places in 392 ms of which 5 ms to minimize.
[2024-05-23 10:49:07] [INFO ] Deduced a trap composed of 114 places in 399 ms of which 5 ms to minimize.
[2024-05-23 10:49:07] [INFO ] Deduced a trap composed of 113 places in 411 ms of which 5 ms to minimize.
[2024-05-23 10:49:08] [INFO ] Deduced a trap composed of 113 places in 410 ms of which 5 ms to minimize.
[2024-05-23 10:49:08] [INFO ] Deduced a trap composed of 81 places in 431 ms of which 5 ms to minimize.
[2024-05-23 10:49:09] [INFO ] Deduced a trap composed of 103 places in 432 ms of which 5 ms to minimize.
[2024-05-23 10:49:09] [INFO ] Deduced a trap composed of 97 places in 399 ms of which 5 ms to minimize.
[2024-05-23 10:49:09] [INFO ] Deduced a trap composed of 116 places in 401 ms of which 5 ms to minimize.
SMT process timed out in 30817ms, After SMT, problems are : Problem set: 0 solved, 608 unsolved
Search for dead transitions found 0 dead transitions in 30838ms
Starting structural reductions in SI_LTL mode, iteration 1 : 302/537 places, 619/914 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 33847 ms. Remains : 302/537 places, 619/914 transitions.
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : Anderson-PT-11-LTLCardinality-15
Product exploration explored 100000 steps with 0 reset in 367 ms.
Product exploration explored 100000 steps with 0 reset in 411 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X p2), (X (NOT (AND p0 (NOT p2) p1))), (X (OR p0 p2 p1)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (X p2)), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (OR p0 p2 p1))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1)))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 13 factoid took 403 ms. Reduced automaton from 2 states, 7 edges and 3 AP (stutter insensitive) to 2 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Reduction of identical properties reduced properties to check from 8 to 6
RANDOM walk for 40000 steps (8 resets) in 628 ms. (63 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 338 ms. (118 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 506 ms. (78 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (8 resets) in 422 ms. (94 steps per ms) remains 2/2 properties
[2024-05-23 10:49:12] [INFO ] Invariant cache hit.
[2024-05-23 10:49:12] [INFO ] State equation strengthened by 110 read => feed constraints.
Problem apf4 is UNSAT
Problem apf5 is UNSAT
After SMT solving in domain Real declared 4/921 variables, and 0 constraints, problems are : Problem set: 2 solved, 0 unsolved in 20 ms.
Refiners :[Positive P Invariants (semi-flows): 0/13 constraints, Generalized P Invariants (flows): 0/11 constraints, State Equation: 0/302 constraints, ReadFeed: 0/110 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 42ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X p2), (X (NOT (AND p0 (NOT p2) p1))), (X (OR p0 p2 p1)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (X p2)), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (OR p0 p2 p1))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (G (OR p0 p2 (NOT p1))), (G (OR (NOT p0) p2 p1))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR p0 p2 p1))), (F p0), (F (NOT p2)), (F (NOT (OR p0 p2 p1))), (F (NOT (OR (NOT p0) p2 (NOT p1)))), (F p1)]
Knowledge based reduction with 15 factoid took 1166 ms. Reduced automaton from 2 states, 7 edges and 3 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 52 ms :[(AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 50 ms :[(AND (NOT p2) (NOT p1))]
Support contains 4 out of 302 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 302/302 places, 619/619 transitions.
Applied a total of 0 rules in 17 ms. Remains 302 /302 variables (removed 0) and now considering 619/619 (removed 0) transitions.
[2024-05-23 10:49:13] [INFO ] Invariant cache hit.
[2024-05-23 10:49:14] [INFO ] Implicit Places using invariants in 698 ms returned []
[2024-05-23 10:49:14] [INFO ] Invariant cache hit.
[2024-05-23 10:49:14] [INFO ] State equation strengthened by 110 read => feed constraints.
[2024-05-23 10:49:16] [INFO ] Implicit Places using invariants and state equation in 2114 ms returned []
Implicit Place search using SMT with State Equation took 2815 ms to find 0 implicit places.
[2024-05-23 10:49:16] [INFO ] Redundant transitions in 6 ms returned []
Running 608 sub problems to find dead transitions.
[2024-05-23 10:49:16] [INFO ] Invariant cache hit.
[2024-05-23 10:49:16] [INFO ] State equation strengthened by 110 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/302 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 608 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/302 variables, 11/24 constraints. Problems are: Problem set: 0 solved, 608 unsolved
[2024-05-23 10:49:25] [INFO ] Deduced a trap composed of 105 places in 412 ms of which 5 ms to minimize.
[2024-05-23 10:49:25] [INFO ] Deduced a trap composed of 109 places in 411 ms of which 5 ms to minimize.
[2024-05-23 10:49:30] [INFO ] Deduced a trap composed of 107 places in 424 ms of which 5 ms to minimize.
[2024-05-23 10:49:30] [INFO ] Deduced a trap composed of 89 places in 427 ms of which 5 ms to minimize.
[2024-05-23 10:49:31] [INFO ] Deduced a trap composed of 84 places in 433 ms of which 5 ms to minimize.
[2024-05-23 10:49:31] [INFO ] Deduced a trap composed of 96 places in 366 ms of which 5 ms to minimize.
[2024-05-23 10:49:32] [INFO ] Deduced a trap composed of 77 places in 414 ms of which 5 ms to minimize.
[2024-05-23 10:49:32] [INFO ] Deduced a trap composed of 104 places in 402 ms of which 5 ms to minimize.
[2024-05-23 10:49:32] [INFO ] Deduced a trap composed of 84 places in 412 ms of which 5 ms to minimize.
[2024-05-23 10:49:33] [INFO ] Deduced a trap composed of 116 places in 396 ms of which 5 ms to minimize.
[2024-05-23 10:49:33] [INFO ] Deduced a trap composed of 100 places in 424 ms of which 5 ms to minimize.
[2024-05-23 10:49:34] [INFO ] Deduced a trap composed of 138 places in 412 ms of which 5 ms to minimize.
[2024-05-23 10:49:34] [INFO ] Deduced a trap composed of 72 places in 415 ms of which 5 ms to minimize.
[2024-05-23 10:49:35] [INFO ] Deduced a trap composed of 116 places in 400 ms of which 5 ms to minimize.
[2024-05-23 10:49:35] [INFO ] Deduced a trap composed of 112 places in 405 ms of which 5 ms to minimize.
[2024-05-23 10:49:36] [INFO ] Deduced a trap composed of 96 places in 378 ms of which 5 ms to minimize.
[2024-05-23 10:49:36] [INFO ] Deduced a trap composed of 94 places in 421 ms of which 5 ms to minimize.
[2024-05-23 10:49:36] [INFO ] Deduced a trap composed of 84 places in 410 ms of which 5 ms to minimize.
[2024-05-23 10:49:37] [INFO ] Deduced a trap composed of 71 places in 408 ms of which 5 ms to minimize.
[2024-05-23 10:49:37] [INFO ] Deduced a trap composed of 84 places in 408 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/302 variables, 20/44 constraints. Problems are: Problem set: 0 solved, 608 unsolved
[2024-05-23 10:49:39] [INFO ] Deduced a trap composed of 105 places in 415 ms of which 5 ms to minimize.
[2024-05-23 10:49:40] [INFO ] Deduced a trap composed of 92 places in 405 ms of which 5 ms to minimize.
[2024-05-23 10:49:40] [INFO ] Deduced a trap composed of 74 places in 398 ms of which 5 ms to minimize.
[2024-05-23 10:49:41] [INFO ] Deduced a trap composed of 81 places in 416 ms of which 5 ms to minimize.
[2024-05-23 10:49:41] [INFO ] Deduced a trap composed of 97 places in 415 ms of which 5 ms to minimize.
[2024-05-23 10:49:42] [INFO ] Deduced a trap composed of 80 places in 406 ms of which 6 ms to minimize.
[2024-05-23 10:49:42] [INFO ] Deduced a trap composed of 109 places in 399 ms of which 6 ms to minimize.
[2024-05-23 10:49:42] [INFO ] Deduced a trap composed of 76 places in 389 ms of which 5 ms to minimize.
[2024-05-23 10:49:43] [INFO ] Deduced a trap composed of 102 places in 401 ms of which 5 ms to minimize.
[2024-05-23 10:49:43] [INFO ] Deduced a trap composed of 83 places in 400 ms of which 5 ms to minimize.
[2024-05-23 10:49:44] [INFO ] Deduced a trap composed of 80 places in 391 ms of which 5 ms to minimize.
[2024-05-23 10:49:44] [INFO ] Deduced a trap composed of 114 places in 401 ms of which 5 ms to minimize.
[2024-05-23 10:49:44] [INFO ] Deduced a trap composed of 113 places in 400 ms of which 5 ms to minimize.
[2024-05-23 10:49:45] [INFO ] Deduced a trap composed of 113 places in 403 ms of which 5 ms to minimize.
[2024-05-23 10:49:45] [INFO ] Deduced a trap composed of 81 places in 386 ms of which 4 ms to minimize.
[2024-05-23 10:49:46] [INFO ] Deduced a trap composed of 103 places in 398 ms of which 5 ms to minimize.
[2024-05-23 10:49:46] [INFO ] Deduced a trap composed of 97 places in 400 ms of which 5 ms to minimize.
[2024-05-23 10:49:46] [INFO ] Deduced a trap composed of 116 places in 394 ms of which 5 ms to minimize.
[2024-05-23 10:49:47] [INFO ] Deduced a trap composed of 91 places in 396 ms of which 5 ms to minimize.
SMT process timed out in 31079ms, After SMT, problems are : Problem set: 0 solved, 608 unsolved
Search for dead transitions found 0 dead transitions in 31089ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 33945 ms. Remains : 302/302 places, 619/619 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 (NOT p1)), (X p2), (X (NOT (AND (NOT p2) (NOT p1)))), (X (OR p2 p1)), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (OR p2 p1)))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 7 factoid took 259 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 54 ms :[(AND (NOT p1) (NOT p2))]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 40000 steps (8 resets) in 207 ms. (192 steps per ms) remains 1/3 properties
BEST_FIRST walk for 6689 steps (0 resets) in 18 ms. (352 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p2 (NOT p1)), (X p2), (X (NOT (AND (NOT p2) (NOT p1)))), (X (OR p2 p1)), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (OR p2 p1)))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X p1)), (X (X (NOT p1))), (F p1), (F (NOT p2)), (F (NOT (OR p1 p2))), (F (NOT (OR p1 p2)))]
Knowledge based reduction with 7 factoid took 428 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 51 ms :[(AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 50 ms :[(AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 0 reset in 331 ms.
Product exploration explored 100000 steps with 0 reset in 375 ms.
Support contains 4 out of 302 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 302/302 places, 619/619 transitions.
Applied a total of 0 rules in 16 ms. Remains 302 /302 variables (removed 0) and now considering 619/619 (removed 0) transitions.
[2024-05-23 10:49:49] [INFO ] Invariant cache hit.
[2024-05-23 10:49:49] [INFO ] Implicit Places using invariants in 652 ms returned []
[2024-05-23 10:49:49] [INFO ] Invariant cache hit.
[2024-05-23 10:49:50] [INFO ] State equation strengthened by 110 read => feed constraints.
[2024-05-23 10:49:51] [INFO ] Implicit Places using invariants and state equation in 1953 ms returned []
Implicit Place search using SMT with State Equation took 2608 ms to find 0 implicit places.
[2024-05-23 10:49:51] [INFO ] Redundant transitions in 6 ms returned []
Running 608 sub problems to find dead transitions.
[2024-05-23 10:49:51] [INFO ] Invariant cache hit.
[2024-05-23 10:49:51] [INFO ] State equation strengthened by 110 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/302 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 608 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/302 variables, 11/24 constraints. Problems are: Problem set: 0 solved, 608 unsolved
[2024-05-23 10:50:00] [INFO ] Deduced a trap composed of 105 places in 420 ms of which 5 ms to minimize.
[2024-05-23 10:50:01] [INFO ] Deduced a trap composed of 109 places in 427 ms of which 5 ms to minimize.
[2024-05-23 10:50:06] [INFO ] Deduced a trap composed of 107 places in 422 ms of which 5 ms to minimize.
[2024-05-23 10:50:06] [INFO ] Deduced a trap composed of 89 places in 439 ms of which 5 ms to minimize.
[2024-05-23 10:50:06] [INFO ] Deduced a trap composed of 84 places in 438 ms of which 5 ms to minimize.
[2024-05-23 10:50:07] [INFO ] Deduced a trap composed of 96 places in 432 ms of which 5 ms to minimize.
[2024-05-23 10:50:07] [INFO ] Deduced a trap composed of 77 places in 417 ms of which 5 ms to minimize.
[2024-05-23 10:50:08] [INFO ] Deduced a trap composed of 104 places in 429 ms of which 5 ms to minimize.
[2024-05-23 10:50:08] [INFO ] Deduced a trap composed of 84 places in 424 ms of which 5 ms to minimize.
[2024-05-23 10:50:09] [INFO ] Deduced a trap composed of 116 places in 445 ms of which 4 ms to minimize.
[2024-05-23 10:50:09] [INFO ] Deduced a trap composed of 100 places in 397 ms of which 5 ms to minimize.
[2024-05-23 10:50:10] [INFO ] Deduced a trap composed of 138 places in 358 ms of which 5 ms to minimize.
[2024-05-23 10:50:10] [INFO ] Deduced a trap composed of 72 places in 401 ms of which 5 ms to minimize.
[2024-05-23 10:50:10] [INFO ] Deduced a trap composed of 116 places in 407 ms of which 5 ms to minimize.
[2024-05-23 10:50:11] [INFO ] Deduced a trap composed of 112 places in 402 ms of which 5 ms to minimize.
[2024-05-23 10:50:11] [INFO ] Deduced a trap composed of 96 places in 408 ms of which 5 ms to minimize.
[2024-05-23 10:50:12] [INFO ] Deduced a trap composed of 94 places in 413 ms of which 5 ms to minimize.
[2024-05-23 10:50:12] [INFO ] Deduced a trap composed of 84 places in 416 ms of which 5 ms to minimize.
[2024-05-23 10:50:13] [INFO ] Deduced a trap composed of 71 places in 415 ms of which 5 ms to minimize.
[2024-05-23 10:50:13] [INFO ] Deduced a trap composed of 84 places in 408 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/302 variables, 20/44 constraints. Problems are: Problem set: 0 solved, 608 unsolved
[2024-05-23 10:50:15] [INFO ] Deduced a trap composed of 105 places in 415 ms of which 5 ms to minimize.
[2024-05-23 10:50:15] [INFO ] Deduced a trap composed of 92 places in 409 ms of which 5 ms to minimize.
[2024-05-23 10:50:16] [INFO ] Deduced a trap composed of 74 places in 426 ms of which 5 ms to minimize.
[2024-05-23 10:50:16] [INFO ] Deduced a trap composed of 81 places in 423 ms of which 5 ms to minimize.
[2024-05-23 10:50:17] [INFO ] Deduced a trap composed of 97 places in 394 ms of which 5 ms to minimize.
[2024-05-23 10:50:17] [INFO ] Deduced a trap composed of 80 places in 393 ms of which 5 ms to minimize.
[2024-05-23 10:50:17] [INFO ] Deduced a trap composed of 109 places in 399 ms of which 5 ms to minimize.
[2024-05-23 10:50:18] [INFO ] Deduced a trap composed of 76 places in 423 ms of which 5 ms to minimize.
[2024-05-23 10:50:18] [INFO ] Deduced a trap composed of 102 places in 399 ms of which 5 ms to minimize.
[2024-05-23 10:50:19] [INFO ] Deduced a trap composed of 83 places in 346 ms of which 5 ms to minimize.
[2024-05-23 10:50:19] [INFO ] Deduced a trap composed of 80 places in 427 ms of which 5 ms to minimize.
[2024-05-23 10:50:20] [INFO ] Deduced a trap composed of 114 places in 418 ms of which 5 ms to minimize.
[2024-05-23 10:50:20] [INFO ] Deduced a trap composed of 113 places in 416 ms of which 5 ms to minimize.
[2024-05-23 10:50:20] [INFO ] Deduced a trap composed of 113 places in 421 ms of which 5 ms to minimize.
[2024-05-23 10:50:21] [INFO ] Deduced a trap composed of 81 places in 396 ms of which 5 ms to minimize.
[2024-05-23 10:50:21] [INFO ] Deduced a trap composed of 103 places in 405 ms of which 5 ms to minimize.
[2024-05-23 10:50:22] [INFO ] Deduced a trap composed of 97 places in 404 ms of which 5 ms to minimize.
[2024-05-23 10:50:22] [INFO ] Deduced a trap composed of 116 places in 409 ms of which 5 ms to minimize.
SMT process timed out in 30820ms, After SMT, problems are : Problem set: 0 solved, 608 unsolved
Search for dead transitions found 0 dead transitions in 30830ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 33469 ms. Remains : 302/302 places, 619/619 transitions.
Treatment of property Anderson-PT-11-LTLCardinality-15 finished in 106528 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)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((p1 U p2)||p0))))'
[2024-05-23 10:50:23] [INFO ] Flatten gal took : 91 ms
[2024-05-23 10:50:23] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 4 ms.
[2024-05-23 10:50:23] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 537 places, 914 transitions and 3184 arcs took 16 ms.
Total runtime 607061 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running Anderson-PT-11
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/414/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 537
TRANSITIONS: 914
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.039s, Sys 0.001s]
SAVING FILE /home/mcc/execution/414/model (.net / .def) ...
EXPORT TIME: [User 0.007s, Sys 0.000s]
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES
Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net
Process ID: 2687
MODEL NAME: /home/mcc/execution/414/model
537 places, 914 transitions.
No place bound informations found.
No place bound informations found.
No place bound informations found.
No place bound informations found.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
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="Anderson-PT-11"
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 Anderson-PT-11, 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 r003-smll-171620117600371"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Anderson-PT-11.tgz
mv Anderson-PT-11 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 '
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 ;