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.r550-tall-171734898600123.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 itstools
Input is CO4-PT-16, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r550-tall-171734898600123
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 696K
-rw-r--r-- 1 mcc users 8.6K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 99K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 11K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 121K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 43K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 260K Jun 2 16:33 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 CO4-PT-16-LTLCardinality-00
FORMULA_NAME CO4-PT-16-LTLCardinality-01
FORMULA_NAME CO4-PT-16-LTLCardinality-02
FORMULA_NAME CO4-PT-16-LTLCardinality-03
FORMULA_NAME CO4-PT-16-LTLCardinality-04
FORMULA_NAME CO4-PT-16-LTLCardinality-05
FORMULA_NAME CO4-PT-16-LTLCardinality-06
FORMULA_NAME CO4-PT-16-LTLCardinality-07
FORMULA_NAME CO4-PT-16-LTLCardinality-08
FORMULA_NAME CO4-PT-16-LTLCardinality-09
FORMULA_NAME CO4-PT-16-LTLCardinality-10
FORMULA_NAME CO4-PT-16-LTLCardinality-11
FORMULA_NAME CO4-PT-16-LTLCardinality-12
FORMULA_NAME CO4-PT-16-LTLCardinality-13
FORMULA_NAME CO4-PT-16-LTLCardinality-14
FORMULA_NAME CO4-PT-16-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717352883144

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CO4-PT-16
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-06-02 18:28:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-06-02 18:28:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:28:04] [INFO ] Load time of PNML (sax parser for PT used): 115 ms
[2024-06-02 18:28:04] [INFO ] Transformed 837 places.
[2024-06-02 18:28:04] [INFO ] Transformed 1122 transitions.
[2024-06-02 18:28:04] [INFO ] Found NUPN structural information;
[2024-06-02 18:28:04] [INFO ] Parsed PT model containing 837 places and 1122 transitions and 3052 arcs in 240 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 116 places in 11 ms
Reduce places removed 116 places and 180 transitions.
FORMULA CO4-PT-16-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-16-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-16-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-16-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-16-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-16-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-16-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-16-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-16-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-16-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-16-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-16-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 12 out of 721 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 721/721 places, 942/942 transitions.
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 704 transition count 939
Discarding 163 places :
Symmetric choice reduction at 1 with 163 rule applications. Total rules 183 place count 541 transition count 774
Iterating global reduction 1 with 163 rules applied. Total rules applied 346 place count 541 transition count 774
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 353 place count 541 transition count 767
Discarding 86 places :
Symmetric choice reduction at 2 with 86 rule applications. Total rules 439 place count 455 transition count 662
Iterating global reduction 2 with 86 rules applied. Total rules applied 525 place count 455 transition count 662
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 528 place count 455 transition count 659
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 544 place count 439 transition count 635
Iterating global reduction 3 with 16 rules applied. Total rules applied 560 place count 439 transition count 635
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 563 place count 439 transition count 632
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 571 place count 431 transition count 624
Iterating global reduction 4 with 8 rules applied. Total rules applied 579 place count 431 transition count 624
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 585 place count 425 transition count 618
Iterating global reduction 4 with 6 rules applied. Total rules applied 591 place count 425 transition count 618
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 597 place count 425 transition count 612
Applied a total of 597 rules in 173 ms. Remains 425 /721 variables (removed 296) and now considering 612/942 (removed 330) transitions.
// Phase 1: matrix 612 rows 425 cols
[2024-06-02 18:28:04] [INFO ] Computed 7 invariants in 29 ms
[2024-06-02 18:28:05] [INFO ] Implicit Places using invariants in 280 ms returned [5, 361]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 313 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 423/721 places, 612/942 transitions.
Applied a total of 0 rules in 13 ms. Remains 423 /423 variables (removed 0) and now considering 612/612 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 516 ms. Remains : 423/721 places, 612/942 transitions.
Support contains 12 out of 423 places after structural reductions.
[2024-06-02 18:28:05] [INFO ] Flatten gal took : 62 ms
[2024-06-02 18:28:05] [INFO ] Flatten gal took : 30 ms
[2024-06-02 18:28:05] [INFO ] Input system was already deterministic with 612 transitions.
RANDOM walk for 40000 steps (590 resets) in 869 ms. (45 steps per ms) remains 1/5 properties
BEST_FIRST walk for 40003 steps (125 resets) in 209 ms. (190 steps per ms) remains 1/1 properties
// Phase 1: matrix 612 rows 423 cols
[2024-06-02 18:28:05] [INFO ] Computed 5 invariants in 5 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/13 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 106/119 variables, 11/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 320/439 variables, 96/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/439 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 14/453 variables, 3/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/453 variables, 3/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/453 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 12/465 variables, 2/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/465 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 366/831 variables, 185/304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/831 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 181/1012 variables, 108/412 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1012 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 23/1035 variables, 16/428 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1035 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/1035 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1035/1035 variables, and 428 constraints, problems are : Problem set: 0 solved, 1 unsolved in 336 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 423/423 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/13 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 106/119 variables, 11/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/119 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 320/439 variables, 96/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/439 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 14/453 variables, 3/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/453 variables, 3/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/453 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 12/465 variables, 2/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/465 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 366/831 variables, 185/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/831 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 181/1012 variables, 108/413 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1012 variables, 0/413 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 23/1035 variables, 16/429 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1035 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1035 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1035/1035 variables, and 429 constraints, problems are : Problem set: 0 solved, 1 unsolved in 344 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 423/423 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 710ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 5614 steps, including 118 resets, run visited all 1 properties in 12 ms. (steps per millisecond=467 )
Parikh walk visited 1 properties in 18 ms.
Computed a total of 18 stabilizing places and 33 stable transitions
Graph (complete) has 911 edges and 423 vertex of which 420 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.11 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 423 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 423/423 places, 612/612 transitions.
Graph (trivial) has 457 edges and 423 vertex of which 2 / 423 are part of one of the 1 SCC in 3 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 910 edges and 422 vertex of which 419 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 157 transitions
Trivial Post-agglo rules discarded 157 transitions
Performed 157 trivial Post agglomeration. Transition count delta: 157
Iterating post reduction 0 with 157 rules applied. Total rules applied 159 place count 418 transition count 450
Reduce places removed 157 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 161 rules applied. Total rules applied 320 place count 261 transition count 446
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 323 place count 260 transition count 444
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 324 place count 259 transition count 444
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 50 Pre rules applied. Total rules applied 324 place count 259 transition count 394
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 4 with 100 rules applied. Total rules applied 424 place count 209 transition count 394
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 426 place count 207 transition count 391
Iterating global reduction 4 with 2 rules applied. Total rules applied 428 place count 207 transition count 391
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 429 place count 207 transition count 390
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 430 place count 206 transition count 388
Iterating global reduction 5 with 1 rules applied. Total rules applied 431 place count 206 transition count 388
Performed 60 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 60 places in 0 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 5 with 120 rules applied. Total rules applied 551 place count 146 transition count 313
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 5 with 15 rules applied. Total rules applied 566 place count 146 transition count 298
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 570 place count 144 transition count 296
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 574 place count 140 transition count 288
Iterating global reduction 7 with 4 rules applied. Total rules applied 578 place count 140 transition count 288
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 586 place count 136 transition count 284
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 587 place count 135 transition count 282
Iterating global reduction 7 with 1 rules applied. Total rules applied 588 place count 135 transition count 282
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 589 place count 135 transition count 281
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: -46
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 8 with 82 rules applied. Total rules applied 671 place count 94 transition count 327
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 8 with 21 rules applied. Total rules applied 692 place count 94 transition count 306
Discarding 27 places :
Symmetric choice reduction at 9 with 27 rule applications. Total rules 719 place count 67 transition count 198
Iterating global reduction 9 with 27 rules applied. Total rules applied 746 place count 67 transition count 198
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 9 with 19 rules applied. Total rules applied 765 place count 67 transition count 179
Discarding 6 places :
Symmetric choice reduction at 10 with 6 rule applications. Total rules 771 place count 61 transition count 147
Iterating global reduction 10 with 6 rules applied. Total rules applied 777 place count 61 transition count 147
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 781 place count 61 transition count 143
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 11 with 12 rules applied. Total rules applied 793 place count 61 transition count 131
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 795 place count 59 transition count 129
Applied a total of 795 rules in 145 ms. Remains 59 /423 variables (removed 364) and now considering 129/612 (removed 483) transitions.
[2024-06-02 18:28:06] [INFO ] Flow matrix only has 110 transitions (discarded 19 similar events)
// Phase 1: matrix 110 rows 59 cols
[2024-06-02 18:28:06] [INFO ] Computed 5 invariants in 0 ms
[2024-06-02 18:28:06] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-06-02 18:28:06] [INFO ] Flow matrix only has 110 transitions (discarded 19 similar events)
[2024-06-02 18:28:06] [INFO ] Invariant cache hit.
[2024-06-02 18:28:07] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-02 18:28:07] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
[2024-06-02 18:28:07] [INFO ] Redundant transitions in 3 ms returned []
Running 106 sub problems to find dead transitions.
[2024-06-02 18:28:07] [INFO ] Flow matrix only has 110 transitions (discarded 19 similar events)
[2024-06-02 18:28:07] [INFO ] Invariant cache hit.
[2024-06-02 18:28:07] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (OVERLAPS) 109/168 variables, 59/64 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/168 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (OVERLAPS) 1/169 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/169 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (OVERLAPS) 0/169 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Real declared 169/169 variables, and 66 constraints, problems are : Problem set: 0 solved, 106 unsolved in 1702 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 59/59 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 106 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (OVERLAPS) 109/168 variables, 59/64 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/168 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 106/171 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/168 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (OVERLAPS) 1/169 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/169 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 8 (OVERLAPS) 0/169 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Int declared 169/169 variables, and 172 constraints, problems are : Problem set: 0 solved, 106 unsolved in 2182 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 59/59 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 0/0 constraints]
After SMT, in 3953ms problems are : Problem set: 0 solved, 106 unsolved
Search for dead transitions found 0 dead transitions in 3956ms
Starting structural reductions in SI_LTL mode, iteration 1 : 59/423 places, 129/612 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4223 ms. Remains : 59/423 places, 129/612 transitions.
Stuttering acceptance computed with spot in 210 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-16-LTLCardinality-02
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 1 ms.
FORMULA CO4-PT-16-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-16-LTLCardinality-02 finished in 4482 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G(F(p1)))))'
Support contains 3 out of 423 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 423/423 places, 612/612 transitions.
Graph (trivial) has 452 edges and 423 vertex of which 2 / 423 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 910 edges and 422 vertex of which 419 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 152 transitions
Trivial Post-agglo rules discarded 152 transitions
Performed 152 trivial Post agglomeration. Transition count delta: 152
Iterating post reduction 0 with 152 rules applied. Total rules applied 154 place count 418 transition count 455
Reduce places removed 152 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 156 rules applied. Total rules applied 310 place count 266 transition count 451
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 313 place count 265 transition count 449
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 3 with 3 rules applied. Total rules applied 316 place count 264 transition count 447
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 318 place count 262 transition count 447
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 50 Pre rules applied. Total rules applied 318 place count 262 transition count 397
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 5 with 100 rules applied. Total rules applied 418 place count 212 transition count 397
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 420 place count 210 transition count 394
Iterating global reduction 5 with 2 rules applied. Total rules applied 422 place count 210 transition count 394
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 423 place count 210 transition count 393
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 424 place count 209 transition count 391
Iterating global reduction 6 with 1 rules applied. Total rules applied 425 place count 209 transition count 391
Performed 59 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 59 places in 0 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 6 with 118 rules applied. Total rules applied 543 place count 150 transition count 317
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 6 with 15 rules applied. Total rules applied 558 place count 150 transition count 302
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 562 place count 148 transition count 300
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 566 place count 144 transition count 292
Iterating global reduction 8 with 4 rules applied. Total rules applied 570 place count 144 transition count 292
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 578 place count 140 transition count 288
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 579 place count 139 transition count 286
Iterating global reduction 8 with 1 rules applied. Total rules applied 580 place count 139 transition count 286
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 581 place count 139 transition count 285
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: -46
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 9 with 82 rules applied. Total rules applied 663 place count 98 transition count 331
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 9 with 20 rules applied. Total rules applied 683 place count 98 transition count 311
Discarding 28 places :
Symmetric choice reduction at 10 with 28 rule applications. Total rules 711 place count 70 transition count 199
Iterating global reduction 10 with 28 rules applied. Total rules applied 739 place count 70 transition count 199
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 10 with 18 rules applied. Total rules applied 757 place count 70 transition count 181
Discarding 7 places :
Symmetric choice reduction at 11 with 7 rule applications. Total rules 764 place count 63 transition count 143
Iterating global reduction 11 with 7 rules applied. Total rules applied 771 place count 63 transition count 143
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 11 with 5 rules applied. Total rules applied 776 place count 63 transition count 138
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 778 place count 62 transition count 155
Drop transitions (Redundant composition of simpler transitions.) removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 12 with 17 rules applied. Total rules applied 795 place count 62 transition count 138
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 797 place count 60 transition count 136
Applied a total of 797 rules in 73 ms. Remains 60 /423 variables (removed 363) and now considering 136/612 (removed 476) transitions.
[2024-06-02 18:28:11] [INFO ] Flow matrix only has 108 transitions (discarded 28 similar events)
// Phase 1: matrix 108 rows 60 cols
[2024-06-02 18:28:11] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 18:28:11] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-06-02 18:28:11] [INFO ] Flow matrix only has 108 transitions (discarded 28 similar events)
[2024-06-02 18:28:11] [INFO ] Invariant cache hit.
[2024-06-02 18:28:11] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-06-02 18:28:11] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
[2024-06-02 18:28:11] [INFO ] Redundant transitions in 17 ms returned [83]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 110 sub problems to find dead transitions.
[2024-06-02 18:28:11] [INFO ] Flow matrix only has 108 transitions (discarded 27 similar events)
[2024-06-02 18:28:11] [INFO ] Invariant cache hit.
[2024-06-02 18:28:11] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (OVERLAPS) 107/167 variables, 60/65 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/167 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/167 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (OVERLAPS) 1/168 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/168 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (OVERLAPS) 0/168 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Real declared 168/168 variables, and 68 constraints, problems are : Problem set: 0 solved, 110 unsolved in 1592 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 60/60 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 110 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (OVERLAPS) 107/167 variables, 60/65 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/167 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/167 variables, 110/177 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/167 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (OVERLAPS) 1/168 variables, 1/178 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/168 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 8 (OVERLAPS) 0/168 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Int declared 168/168 variables, and 178 constraints, problems are : Problem set: 0 solved, 110 unsolved in 2154 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 60/60 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 0/0 constraints]
After SMT, in 3792ms problems are : Problem set: 0 solved, 110 unsolved
Search for dead transitions found 0 dead transitions in 3794ms
Starting structural reductions in SI_LTL mode, iteration 1 : 60/423 places, 135/612 transitions.
Applied a total of 0 rules in 9 ms. Remains 60 /60 variables (removed 0) and now considering 135/135 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4020 ms. Remains : 60/423 places, 135/612 transitions.
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CO4-PT-16-LTLCardinality-03
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 1 ms.
FORMULA CO4-PT-16-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-16-LTLCardinality-03 finished in 4114 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 3 out of 423 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 423/423 places, 612/612 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 419 transition count 608
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 419 transition count 608
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 418 transition count 606
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 418 transition count 606
Applied a total of 10 rules in 28 ms. Remains 418 /423 variables (removed 5) and now considering 606/612 (removed 6) transitions.
// Phase 1: matrix 606 rows 418 cols
[2024-06-02 18:28:15] [INFO ] Computed 5 invariants in 3 ms
[2024-06-02 18:28:15] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-06-02 18:28:15] [INFO ] Invariant cache hit.
[2024-06-02 18:28:15] [INFO ] Implicit Places using invariants and state equation in 220 ms returned []
Implicit Place search using SMT with State Equation took 319 ms to find 0 implicit places.
Running 605 sub problems to find dead transitions.
[2024-06-02 18:28:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/417 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 605 unsolved
At refinement iteration 1 (OVERLAPS) 1/418 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 605 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/418 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 605 unsolved
At refinement iteration 3 (OVERLAPS) 606/1024 variables, 418/423 constraints. Problems are: Problem set: 0 solved, 605 unsolved
[2024-06-02 18:28:33] [INFO ] Deduced a trap composed of 16 places in 141 ms of which 20 ms to minimize.
[2024-06-02 18:28:33] [INFO ] Deduced a trap composed of 18 places in 141 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1024 variables, 2/425 constraints. Problems are: Problem set: 0 solved, 605 unsolved
[2024-06-02 18:28:41] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1024/1024 variables, and 426 constraints, problems are : Problem set: 0 solved, 605 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 418/418 constraints, PredecessorRefiner: 605/605 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 605 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/417 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 605 unsolved
At refinement iteration 1 (OVERLAPS) 1/418 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 605 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/418 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 605 unsolved
[2024-06-02 18:28:53] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/418 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 605 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/418 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 605 unsolved
At refinement iteration 5 (OVERLAPS) 606/1024 variables, 418/427 constraints. Problems are: Problem set: 0 solved, 605 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1024 variables, 605/1032 constraints. Problems are: Problem set: 0 solved, 605 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1024 variables, 0/1032 constraints. Problems are: Problem set: 0 solved, 605 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1024/1024 variables, and 1032 constraints, problems are : Problem set: 0 solved, 605 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 418/418 constraints, PredecessorRefiner: 605/605 constraints, Known Traps: 4/4 constraints]
After SMT, in 60280ms problems are : Problem set: 0 solved, 605 unsolved
Search for dead transitions found 0 dead transitions in 60289ms
Starting structural reductions in LTL mode, iteration 1 : 418/423 places, 606/612 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60641 ms. Remains : 418/423 places, 606/612 transitions.
Stuttering acceptance computed with spot in 126 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-16-LTLCardinality-10
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA CO4-PT-16-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-16-LTLCardinality-10 finished in 60781 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 4 out of 423 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 423/423 places, 612/612 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 420 transition count 609
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 420 transition count 609
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 417 transition count 605
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 417 transition count 605
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 415 transition count 603
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 415 transition count 603
Applied a total of 16 rules in 24 ms. Remains 415 /423 variables (removed 8) and now considering 603/612 (removed 9) transitions.
// Phase 1: matrix 603 rows 415 cols
[2024-06-02 18:29:16] [INFO ] Computed 5 invariants in 5 ms
[2024-06-02 18:29:16] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-06-02 18:29:16] [INFO ] Invariant cache hit.
[2024-06-02 18:29:16] [INFO ] Implicit Places using invariants and state equation in 209 ms returned []
Implicit Place search using SMT with State Equation took 303 ms to find 0 implicit places.
Running 602 sub problems to find dead transitions.
[2024-06-02 18:29:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/414 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 602 unsolved
At refinement iteration 1 (OVERLAPS) 1/415 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 602 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/415 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 602 unsolved
At refinement iteration 3 (OVERLAPS) 603/1018 variables, 415/420 constraints. Problems are: Problem set: 0 solved, 602 unsolved
[2024-06-02 18:29:34] [INFO ] Deduced a trap composed of 18 places in 104 ms of which 2 ms to minimize.
[2024-06-02 18:29:34] [INFO ] Deduced a trap composed of 16 places in 98 ms of which 2 ms to minimize.
[2024-06-02 18:29:35] [INFO ] Deduced a trap composed of 152 places in 75 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1018 variables, 3/423 constraints. Problems are: Problem set: 0 solved, 602 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1018/1018 variables, and 423 constraints, problems are : Problem set: 0 solved, 602 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 415/415 constraints, PredecessorRefiner: 602/602 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 602 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/414 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 602 unsolved
At refinement iteration 1 (OVERLAPS) 1/415 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 602 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/415 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 602 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/415 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 602 unsolved
At refinement iteration 4 (OVERLAPS) 603/1018 variables, 415/423 constraints. Problems are: Problem set: 0 solved, 602 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1018 variables, 602/1025 constraints. Problems are: Problem set: 0 solved, 602 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1018 variables, 0/1025 constraints. Problems are: Problem set: 0 solved, 602 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1018/1018 variables, and 1025 constraints, problems are : Problem set: 0 solved, 602 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 415/415 constraints, PredecessorRefiner: 602/602 constraints, Known Traps: 3/3 constraints]
After SMT, in 60241ms problems are : Problem set: 0 solved, 602 unsolved
Search for dead transitions found 0 dead transitions in 60248ms
Starting structural reductions in LTL mode, iteration 1 : 415/423 places, 603/612 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60576 ms. Remains : 415/423 places, 603/612 transitions.
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-16-LTLCardinality-15
Product exploration explored 100000 steps with 50000 reset in 248 ms.
Product exploration explored 100000 steps with 50000 reset in 178 ms.
Computed a total of 18 stabilizing places and 33 stable transitions
Graph (complete) has 902 edges and 415 vertex of which 412 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.5 ms
Computed a total of 18 stabilizing places and 33 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 CO4-PT-16-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CO4-PT-16-LTLCardinality-15 finished in 61208 ms.
All properties solved by simple procedures.
Total runtime 133044 ms.

BK_STOP 1717353017385

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is CO4-PT-16, 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 r550-tall-171734898600123"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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