About the Execution of ITS-Tools for LeafsetExtension-PT-S16C3
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
0.000 | 196406.00 | 0.00 | 0.00 | TFFTTFFFFTFFFFTF | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r114-tall-174876423300739.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
Input is LeafsetExtension-PT-S16C3, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r114-tall-174876423300739
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 14K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 97K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 66K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.4K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 21K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 127K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.3K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 6 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 905K May 29 14:32 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
echo here is the order used to build the result vector(from xml file)
FORMULA_NAME LeafsetExtension-PT-S16C3-LTLCardinality-00
FORMULA_NAME LeafsetExtension-PT-S16C3-LTLCardinality-01
FORMULA_NAME LeafsetExtension-PT-S16C3-LTLCardinality-02
FORMULA_NAME LeafsetExtension-PT-S16C3-LTLCardinality-03
FORMULA_NAME LeafsetExtension-PT-S16C3-LTLCardinality-04
FORMULA_NAME LeafsetExtension-PT-S16C3-LTLCardinality-05
FORMULA_NAME LeafsetExtension-PT-S16C3-LTLCardinality-06
FORMULA_NAME LeafsetExtension-PT-S16C3-LTLCardinality-07
FORMULA_NAME LeafsetExtension-PT-S16C3-LTLCardinality-08
FORMULA_NAME LeafsetExtension-PT-S16C3-LTLCardinality-09
FORMULA_NAME LeafsetExtension-PT-S16C3-LTLCardinality-10
FORMULA_NAME LeafsetExtension-PT-S16C3-LTLCardinality-11
FORMULA_NAME LeafsetExtension-PT-S16C3-LTLCardinality-12
FORMULA_NAME LeafsetExtension-PT-S16C3-LTLCardinality-13
FORMULA_NAME LeafsetExtension-PT-S16C3-LTLCardinality-14
FORMULA_NAME LeafsetExtension-PT-S16C3-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1748891689592
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LeafsetExtension-PT-S16C3
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-06-02 19:14:51] [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]
[2025-06-02 19:14:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 19:14:51] [INFO ] Load time of PNML (sax parser for PT used): 152 ms
[2025-06-02 19:14:51] [INFO ] Transformed 1542 places.
[2025-06-02 19:14:51] [INFO ] Transformed 1449 transitions.
[2025-06-02 19:14:51] [INFO ] Parsed PT model containing 1542 places and 1449 transitions and 4668 arcs in 276 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA LeafsetExtension-PT-S16C3-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LeafsetExtension-PT-S16C3-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LeafsetExtension-PT-S16C3-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LeafsetExtension-PT-S16C3-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 39 out of 1542 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1542/1542 places, 1449/1449 transitions.
Reduce places removed 283 places and 0 transitions.
Iterating post reduction 0 with 283 rules applied. Total rules applied 283 place count 1259 transition count 1449
Discarding 255 places :
Symmetric choice reduction at 1 with 255 rule applications. Total rules 538 place count 1004 transition count 1194
Iterating global reduction 1 with 255 rules applied. Total rules applied 793 place count 1004 transition count 1194
Discarding 215 places :
Symmetric choice reduction at 1 with 215 rule applications. Total rules 1008 place count 789 transition count 979
Iterating global reduction 1 with 215 rules applied. Total rules applied 1223 place count 789 transition count 979
Discarding 210 places :
Symmetric choice reduction at 1 with 210 rule applications. Total rules 1433 place count 579 transition count 769
Iterating global reduction 1 with 210 rules applied. Total rules applied 1643 place count 579 transition count 769
Discarding 14 places :
Implicit places reduction removed 14 places
Iterating post reduction 1 with 14 rules applied. Total rules applied 1657 place count 565 transition count 769
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 1669 place count 553 transition count 757
Iterating global reduction 2 with 12 rules applied. Total rules applied 1681 place count 553 transition count 757
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 1693 place count 541 transition count 745
Iterating global reduction 2 with 12 rules applied. Total rules applied 1705 place count 541 transition count 745
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 1715 place count 531 transition count 735
Iterating global reduction 2 with 10 rules applied. Total rules applied 1725 place count 531 transition count 735
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 1735 place count 521 transition count 725
Iterating global reduction 2 with 10 rules applied. Total rules applied 1745 place count 521 transition count 725
Discarding 66 places :
Symmetric choice reduction at 2 with 66 rule applications. Total rules 1811 place count 455 transition count 659
Iterating global reduction 2 with 66 rules applied. Total rules applied 1877 place count 455 transition count 659
Applied a total of 1877 rules in 420 ms. Remains 455 /1542 variables (removed 1087) and now considering 659/1449 (removed 790) transitions.
[2025-06-02 19:14:52] [INFO ] Flow matrix only has 594 transitions (discarded 65 similar events)
// Phase 1: matrix 594 rows 455 cols
[2025-06-02 19:14:52] [INFO ] Computed 40 invariants in 43 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 19:14:52] [INFO ] Implicit Places using invariants in 604 ms returned [37, 62, 96, 112, 134, 171, 190, 221, 223, 240, 260, 282, 287, 301, 342, 346, 377, 395, 410, 427]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 645 ms to find 20 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 435/1542 places, 659/1449 transitions.
Discarding 150 places :
Symmetric choice reduction at 0 with 150 rule applications. Total rules 150 place count 285 transition count 509
Iterating global reduction 0 with 150 rules applied. Total rules applied 300 place count 285 transition count 509
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 302 place count 283 transition count 507
Iterating global reduction 0 with 2 rules applied. Total rules applied 304 place count 283 transition count 507
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 306 place count 281 transition count 505
Iterating global reduction 0 with 2 rules applied. Total rules applied 308 place count 281 transition count 505
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 310 place count 279 transition count 503
Iterating global reduction 0 with 2 rules applied. Total rules applied 312 place count 279 transition count 503
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 314 place count 277 transition count 501
Iterating global reduction 0 with 2 rules applied. Total rules applied 316 place count 277 transition count 501
Applied a total of 316 rules in 38 ms. Remains 277 /435 variables (removed 158) and now considering 501/659 (removed 158) transitions.
[2025-06-02 19:14:52] [INFO ] Flow matrix only has 414 transitions (discarded 87 similar events)
// Phase 1: matrix 414 rows 277 cols
[2025-06-02 19:14:52] [INFO ] Computed 20 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 19:14:52] [INFO ] Implicit Places using invariants in 133 ms returned []
[2025-06-02 19:14:52] [INFO ] Flow matrix only has 414 transitions (discarded 87 similar events)
[2025-06-02 19:14:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 19:14:53] [INFO ] Implicit Places using invariants and state equation in 517 ms returned []
Implicit Place search using SMT with State Equation took 654 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 277/1542 places, 501/1449 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1772 ms. Remains : 277/1542 places, 501/1449 transitions.
Support contains 39 out of 277 places after structural reductions.
[2025-06-02 19:14:53] [INFO ] Flatten gal took : 55 ms
[2025-06-02 19:14:53] [INFO ] Flatten gal took : 39 ms
[2025-06-02 19:14:53] [INFO ] Input system was already deterministic with 501 transitions.
Support contains 37 out of 277 places (down from 39) after GAL structural reductions.
RANDOM walk for 40000 steps (1482 resets) in 1663 ms. (24 steps per ms) remains 5/22 properties
BEST_FIRST walk for 40004 steps (191 resets) in 256 ms. (155 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (194 resets) in 262 ms. (152 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (191 resets) in 217 ms. (183 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (190 resets) in 216 ms. (184 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (195 resets) in 167 ms. (238 steps per ms) remains 5/5 properties
[2025-06-02 19:14:54] [INFO ] Flow matrix only has 414 transitions (discarded 87 similar events)
[2025-06-02 19:14:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 222/227 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/227 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 39/266 variables, 17/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/266 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp21 is UNSAT
After SMT solving in domain Real declared 679/691 variables, and 286 constraints, problems are : Problem set: 5 solved, 0 unsolved in 397 ms.
Refiners :[Generalized P Invariants (flows): 20/20 constraints, State Equation: 266/277 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 420ms problems are : Problem set: 5 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA LeafsetExtension-PT-S16C3-LTLCardinality-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 5 atomic propositions for a total of 11 simplifications.
FORMULA LeafsetExtension-PT-S16C3-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LeafsetExtension-PT-S16C3-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LeafsetExtension-PT-S16C3-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 277 stabilizing places and 501 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 277 transition count 501
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
FORMULA LeafsetExtension-PT-S16C3-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X((p0||X(F(p1))))) U (p2||G(!p0))))'
Support contains 5 out of 277 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 277/277 places, 501/501 transitions.
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 268 transition count 501
Discarding 31 places :
Symmetric choice reduction at 1 with 31 rule applications. Total rules 40 place count 237 transition count 470
Iterating global reduction 1 with 31 rules applied. Total rules applied 71 place count 237 transition count 470
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 97 place count 211 transition count 444
Iterating global reduction 1 with 26 rules applied. Total rules applied 123 place count 211 transition count 444
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 1 with 4 rules applied. Total rules applied 127 place count 207 transition count 444
Discarding 26 places :
Symmetric choice reduction at 2 with 26 rule applications. Total rules 153 place count 181 transition count 418
Iterating global reduction 2 with 26 rules applied. Total rules applied 179 place count 181 transition count 418
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 2 with 11 rules applied. Total rules applied 190 place count 170 transition count 418
Discarding 29 places :
Symmetric choice reduction at 3 with 29 rule applications. Total rules 219 place count 141 transition count 389
Iterating global reduction 3 with 29 rules applied. Total rules applied 248 place count 141 transition count 389
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 263 place count 126 transition count 374
Iterating global reduction 3 with 15 rules applied. Total rules applied 278 place count 126 transition count 374
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 293 place count 111 transition count 359
Iterating global reduction 3 with 15 rules applied. Total rules applied 308 place count 111 transition count 359
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 323 place count 96 transition count 344
Iterating global reduction 3 with 15 rules applied. Total rules applied 338 place count 96 transition count 344
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 349 place count 85 transition count 333
Iterating global reduction 3 with 11 rules applied. Total rules applied 360 place count 85 transition count 333
Applied a total of 360 rules in 43 ms. Remains 85 /277 variables (removed 192) and now considering 333/501 (removed 168) transitions.
[2025-06-02 19:14:55] [INFO ] Flow matrix only has 107 transitions (discarded 226 similar events)
// Phase 1: matrix 107 rows 85 cols
[2025-06-02 19:14:55] [INFO ] Computed 5 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 19:14:55] [INFO ] Implicit Places using invariants in 62 ms returned []
[2025-06-02 19:14:55] [INFO ] Flow matrix only has 107 transitions (discarded 226 similar events)
[2025-06-02 19:14:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 19:14:55] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 180 ms to find 0 implicit places.
Running 316 sub problems to find dead transitions.
[2025-06-02 19:14:55] [INFO ] Flow matrix only has 107 transitions (discarded 226 similar events)
[2025-06-02 19:14:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 2 (OVERLAPS) 1/84 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 4 (OVERLAPS) 107/191 variables, 84/89 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 6 (OVERLAPS) 1/192 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 8 (OVERLAPS) 0/192 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 316 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 90 constraints, problems are : Problem set: 0 solved, 316 unsolved in 11209 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 85/85 constraints, PredecessorRefiner: 316/316 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 316 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 2 (OVERLAPS) 1/84 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 4 (OVERLAPS) 107/191 variables, 84/89 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 314/403 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 0/403 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 7 (OVERLAPS) 1/192 variables, 1/404 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/192 variables, 2/406 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/192 variables, 0/406 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 10 (OVERLAPS) 0/192 variables, 0/406 constraints. Problems are: Problem set: 0 solved, 316 unsolved
No progress, stopping.
After SMT solving in domain Int declared 192/192 variables, and 406 constraints, problems are : Problem set: 0 solved, 316 unsolved in 24980 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 85/85 constraints, PredecessorRefiner: 316/316 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 36245ms problems are : Problem set: 0 solved, 316 unsolved
Search for dead transitions found 0 dead transitions in 36248ms
Starting structural reductions in LTL mode, iteration 1 : 85/277 places, 333/501 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36476 ms. Remains : 85/277 places, 333/501 transitions.
Stuttering acceptance computed with spot in 413 ms :[(AND p0 (NOT p2)), (AND (NOT p0) (NOT p1)), false, (AND (NOT p0) (NOT p1)), (NOT p1), false, (AND (NOT p1) p0)]
Running random walk in product with property : LeafsetExtension-PT-S16C3-LTLCardinality-01
Product exploration explored 100000 steps with 24938 reset in 326 ms.
Product exploration explored 100000 steps with 25016 reset in 267 ms.
Computed a total of 85 stabilizing places and 333 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 85 transition count 333
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND (NOT p2) p0 p1), (X (NOT p2)), (X (AND (NOT p2) p0)), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), (X (X (NOT p2))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p0)), (F (G (NOT p2))), (F (G p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 457 ms. Reduced automaton from 7 states, 12 edges and 3 AP (stutter sensitive) to 7 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 287 ms :[(AND p0 (NOT p2)), (AND (NOT p0) (NOT p1)), false, (AND (NOT p0) (NOT p1)), (NOT p1), false, (AND (NOT p1) p0)]
Reduction of identical properties reduced properties to check from 7 to 6
RANDOM walk for 31654 steps (1102 resets) in 244 ms. (129 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p2) p0 p1), (X (NOT p2)), (X (AND (NOT p2) p0)), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), (X (X (NOT p2))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p0)), (F (G (NOT p2))), (F (G p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (OR p0 p2))), (F (NOT p1)), (F (NOT p0)), (F (NOT (OR p0 p1))), (F p2), (F (NOT (AND p0 (NOT p2)))), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 12 factoid took 1497 ms. Reduced automaton from 7 states, 12 edges and 3 AP (stutter sensitive) to 7 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 284 ms :[(AND p0 (NOT p2)), (AND (NOT p0) (NOT p1)), false, (AND (NOT p0) (NOT p1)), (NOT p1), false, (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 245 ms :[(AND p0 (NOT p2)), (AND (NOT p0) (NOT p1)), false, (AND (NOT p0) (NOT p1)), (NOT p1), false, (AND (NOT p1) p0)]
[2025-06-02 19:15:35] [INFO ] Flow matrix only has 107 transitions (discarded 226 similar events)
[2025-06-02 19:15:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 19:15:35] [INFO ] [Real]Absence check using 0 positive and 5 generalized place invariants in 4 ms returned sat
[2025-06-02 19:15:35] [INFO ] [Real]Absence check using state equation in 140 ms returned sat
[2025-06-02 19:15:35] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 19:15:36] [INFO ] [Nat]Absence check using 0 positive and 5 generalized place invariants in 2 ms returned sat
[2025-06-02 19:15:36] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2025-06-02 19:15:36] [INFO ] Computed and/alt/rep : 82/120/72 causal constraints (skipped 18 transitions) in 8 ms.
[2025-06-02 19:15:36] [INFO ] Added : 14 causal constraints over 3 iterations in 100 ms. Result :sat
Could not prove EG (AND p0 (NOT p2))
Support contains 5 out of 85 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 333/333 transitions.
Applied a total of 0 rules in 5 ms. Remains 85 /85 variables (removed 0) and now considering 333/333 (removed 0) transitions.
[2025-06-02 19:15:36] [INFO ] Flow matrix only has 107 transitions (discarded 226 similar events)
[2025-06-02 19:15:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 19:15:36] [INFO ] Implicit Places using invariants in 77 ms returned []
[2025-06-02 19:15:36] [INFO ] Flow matrix only has 107 transitions (discarded 226 similar events)
[2025-06-02 19:15:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 19:15:36] [INFO ] Implicit Places using invariants and state equation in 162 ms returned []
Implicit Place search using SMT with State Equation took 242 ms to find 0 implicit places.
Running 316 sub problems to find dead transitions.
[2025-06-02 19:15:36] [INFO ] Flow matrix only has 107 transitions (discarded 226 similar events)
[2025-06-02 19:15:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 2 (OVERLAPS) 1/84 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 4 (OVERLAPS) 107/191 variables, 84/89 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 6 (OVERLAPS) 1/192 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 8 (OVERLAPS) 0/192 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 316 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 90 constraints, problems are : Problem set: 0 solved, 316 unsolved in 11377 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 85/85 constraints, PredecessorRefiner: 316/316 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 316 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 2 (OVERLAPS) 1/84 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 4 (OVERLAPS) 107/191 variables, 84/89 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 314/403 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 0/403 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 7 (OVERLAPS) 1/192 variables, 1/404 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/192 variables, 2/406 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/192 variables, 0/406 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 10 (OVERLAPS) 0/192 variables, 0/406 constraints. Problems are: Problem set: 0 solved, 316 unsolved
No progress, stopping.
After SMT solving in domain Int declared 192/192 variables, and 406 constraints, problems are : Problem set: 0 solved, 316 unsolved in 25535 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 85/85 constraints, PredecessorRefiner: 316/316 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 36970ms problems are : Problem set: 0 solved, 316 unsolved
Search for dead transitions found 0 dead transitions in 36974ms
Finished structural reductions in LTL mode , in 1 iterations and 37223 ms. Remains : 85/85 places, 333/333 transitions.
Computed a total of 85 stabilizing places and 333 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 85 transition count 333
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT p2)), (X (AND p0 (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X p0), (X (X (NOT p2))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (F (G p0)), (F (G (NOT p2))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 461 ms. Reduced automaton from 7 states, 12 edges and 3 AP (stutter sensitive) to 7 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 300 ms :[(AND p0 (NOT p2)), (AND (NOT p0) (NOT p1)), false, (AND (NOT p0) (NOT p1)), (NOT p1), false, (AND (NOT p1) p0)]
Reduction of identical properties reduced properties to check from 7 to 6
RANDOM walk for 34600 steps (1199 resets) in 188 ms. (183 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT p2)), (X (AND p0 (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X p0), (X (X (NOT p2))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (F (G p0)), (F (G (NOT p2))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (OR p0 p2))), (F (NOT p1)), (F (NOT p0)), (F (NOT (OR p0 p1))), (F p2), (F (NOT (AND p0 (NOT p2)))), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 12 factoid took 1461 ms. Reduced automaton from 7 states, 12 edges and 3 AP (stutter sensitive) to 7 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 274 ms :[(AND p0 (NOT p2)), (AND (NOT p0) (NOT p1)), false, (AND (NOT p0) (NOT p1)), (NOT p1), false, (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 288 ms :[(AND p0 (NOT p2)), (AND (NOT p0) (NOT p1)), false, (AND (NOT p0) (NOT p1)), (NOT p1), false, (AND (NOT p1) p0)]
[2025-06-02 19:16:16] [INFO ] Flow matrix only has 107 transitions (discarded 226 similar events)
[2025-06-02 19:16:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 19:16:16] [INFO ] [Real]Absence check using 0 positive and 5 generalized place invariants in 4 ms returned sat
[2025-06-02 19:16:16] [INFO ] [Real]Absence check using state equation in 145 ms returned sat
[2025-06-02 19:16:16] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 19:16:16] [INFO ] [Nat]Absence check using 0 positive and 5 generalized place invariants in 2 ms returned sat
[2025-06-02 19:16:16] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2025-06-02 19:16:16] [INFO ] Computed and/alt/rep : 82/120/72 causal constraints (skipped 18 transitions) in 10 ms.
[2025-06-02 19:16:16] [INFO ] Added : 14 causal constraints over 3 iterations in 65 ms. Result :sat
Could not prove EG (AND p0 (NOT p2))
Stuttering acceptance computed with spot in 278 ms :[(AND p0 (NOT p2)), (AND (NOT p0) (NOT p1)), false, (AND (NOT p0) (NOT p1)), (NOT p1), false, (AND (NOT p1) p0)]
Product exploration explored 100000 steps with 24946 reset in 216 ms.
Product exploration explored 100000 steps with 25044 reset in 216 ms.
Applying partial POR strategy [false, false, false, false, true, false, true]
Stuttering acceptance computed with spot in 275 ms :[(AND p0 (NOT p2)), (AND (NOT p0) (NOT p1)), false, (AND (NOT p0) (NOT p1)), (NOT p1), false, (AND (NOT p1) p0)]
Support contains 5 out of 85 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 85/85 places, 333/333 transitions.
Graph (complete) has 486 edges and 85 vertex of which 84 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 8 rules applied. Total rules applied 9 place count 84 transition count 332
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 5 Pre rules applied. Total rules applied 9 place count 84 transition count 335
Deduced a syphon composed of 13 places in 0 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 14 place count 84 transition count 335
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 24 places in 0 ms
Iterating global reduction 1 with 11 rules applied. Total rules applied 25 place count 84 transition count 335
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 35 place count 74 transition count 325
Deduced a syphon composed of 14 places in 0 ms
Iterating global reduction 1 with 10 rules applied. Total rules applied 45 place count 74 transition count 325
Deduced a syphon composed of 14 places in 1 ms
Applied a total of 45 rules in 42 ms. Remains 74 /85 variables (removed 11) and now considering 325/333 (removed 8) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 19:16:18] [INFO ] Redundant transitions in 15 ms returned []
Running 308 sub problems to find dead transitions.
[2025-06-02 19:16:18] [INFO ] Flow matrix only has 97 transitions (discarded 228 similar events)
// Phase 1: matrix 97 rows 74 cols
[2025-06-02 19:16:18] [INFO ] Computed 5 invariants in 1 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 2 (OVERLAPS) 1/73 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 308 unsolved
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD322 is UNSAT
At refinement iteration 4 (OVERLAPS) 97/170 variables, 73/78 constraints. Problems are: Problem set: 17 solved, 291 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 0/78 constraints. Problems are: Problem set: 17 solved, 291 unsolved
At refinement iteration 6 (OVERLAPS) 1/171 variables, 1/79 constraints. Problems are: Problem set: 17 solved, 291 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/171 variables, 0/79 constraints. Problems are: Problem set: 17 solved, 291 unsolved
At refinement iteration 8 (OVERLAPS) 0/171 variables, 0/79 constraints. Problems are: Problem set: 17 solved, 291 unsolved
No progress, stopping.
After SMT solving in domain Real declared 171/171 variables, and 79 constraints, problems are : Problem set: 17 solved, 291 unsolved in 8642 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 74/74 constraints, PredecessorRefiner: 308/308 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 17 solved, 291 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 17 solved, 291 unsolved
At refinement iteration 1 (OVERLAPS) 15/73 variables, 5/5 constraints. Problems are: Problem set: 17 solved, 291 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 0/5 constraints. Problems are: Problem set: 17 solved, 291 unsolved
At refinement iteration 3 (OVERLAPS) 97/170 variables, 73/78 constraints. Problems are: Problem set: 17 solved, 291 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 289/367 constraints. Problems are: Problem set: 17 solved, 291 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 0/367 constraints. Problems are: Problem set: 17 solved, 291 unsolved
At refinement iteration 6 (OVERLAPS) 1/171 variables, 1/368 constraints. Problems are: Problem set: 17 solved, 291 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/171 variables, 2/370 constraints. Problems are: Problem set: 17 solved, 291 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/171 variables, 0/370 constraints. Problems are: Problem set: 17 solved, 291 unsolved
At refinement iteration 9 (OVERLAPS) 0/171 variables, 0/370 constraints. Problems are: Problem set: 17 solved, 291 unsolved
No progress, stopping.
After SMT solving in domain Int declared 171/171 variables, and 370 constraints, problems are : Problem set: 17 solved, 291 unsolved in 17923 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 74/74 constraints, PredecessorRefiner: 291/308 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 26593ms problems are : Problem set: 17 solved, 291 unsolved
Search for dead transitions found 17 dead transitions in 26594ms
Found 17 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 17 transitions
Dead transitions reduction (with SMT) removed 17 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 74/85 places, 308/333 transitions.
Graph (complete) has 468 edges and 74 vertex of which 60 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.2 ms
Discarding 14 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 14 ms. Remains 60 /74 variables (removed 14) and now considering 308/308 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 60/85 places, 308/333 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 26677 ms. Remains : 60/85 places, 308/333 transitions.
Built C files in :
/tmp/ltsmin363863623032277056
[2025-06-02 19:16:44] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin363863623032277056
Running compilation step : cd /tmp/ltsmin363863623032277056;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 664 ms.
Running link step : cd /tmp/ltsmin363863623032277056;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin363863623032277056;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased685679077336014180.hoa' '--buchi-type=spotba'
LTSmin run took 158 ms.
FORMULA LeafsetExtension-PT-S16C3-LTLCardinality-01 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property LeafsetExtension-PT-S16C3-LTLCardinality-01 finished in 110598 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 277 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 277/277 places, 501/501 transitions.
Graph (complete) has 930 edges and 277 vertex of which 266 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.3 ms
Discarding 11 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 62 transitions
Trivial Post-agglo rules discarded 62 transitions
Performed 62 trivial Post agglomeration. Transition count delta: 62
Iterating post reduction 0 with 62 rules applied. Total rules applied 63 place count 266 transition count 438
Reduce places removed 62 places and 0 transitions.
Iterating post reduction 1 with 62 rules applied. Total rules applied 125 place count 204 transition count 438
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 125 place count 204 transition count 413
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 175 place count 179 transition count 413
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 195 place count 159 transition count 393
Iterating global reduction 2 with 20 rules applied. Total rules applied 215 place count 159 transition count 393
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 224 place count 150 transition count 384
Iterating global reduction 2 with 9 rules applied. Total rules applied 233 place count 150 transition count 384
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 2 with 4 rules applied. Total rules applied 237 place count 146 transition count 384
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 237 place count 146 transition count 380
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 245 place count 142 transition count 380
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 249 place count 138 transition count 376
Iterating global reduction 3 with 4 rules applied. Total rules applied 253 place count 138 transition count 376
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 257 place count 134 transition count 372
Iterating global reduction 3 with 4 rules applied. Total rules applied 261 place count 134 transition count 372
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 1 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 327 place count 101 transition count 339
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 341 place count 87 transition count 325
Iterating global reduction 3 with 14 rules applied. Total rules applied 355 place count 87 transition count 325
Applied a total of 355 rules in 65 ms. Remains 87 /277 variables (removed 190) and now considering 325/501 (removed 176) transitions.
[2025-06-02 19:16:45] [INFO ] Flow matrix only has 184 transitions (discarded 141 similar events)
// Phase 1: matrix 184 rows 87 cols
[2025-06-02 19:16:45] [INFO ] Computed 16 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 19:16:45] [INFO ] Implicit Places using invariants in 139 ms returned [2, 3, 12, 13, 20, 24, 25, 36, 40, 44, 52, 53, 58, 62]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 140 ms to find 14 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 73/277 places, 325/501 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 61 transition count 313
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 61 transition count 313
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 36 place count 49 transition count 301
Iterating global reduction 0 with 12 rules applied. Total rules applied 48 place count 49 transition count 301
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 52 place count 47 transition count 299
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 54 place count 45 transition count 297
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 45 transition count 297
Applied a total of 56 rules in 33 ms. Remains 45 /73 variables (removed 28) and now considering 297/325 (removed 28) transitions.
[2025-06-02 19:16:45] [INFO ] Flow matrix only has 45 transitions (discarded 252 similar events)
// Phase 1: matrix 45 rows 45 cols
[2025-06-02 19:16:45] [INFO ] Computed 2 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 19:16:46] [INFO ] Implicit Places using invariants in 42 ms returned []
[2025-06-02 19:16:46] [INFO ] Flow matrix only has 45 transitions (discarded 252 similar events)
[2025-06-02 19:16:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 19:16:46] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 45/277 places, 297/501 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 363 ms. Remains : 45/277 places, 297/501 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : LeafsetExtension-PT-S16C3-LTLCardinality-02
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 1 ms.
FORMULA LeafsetExtension-PT-S16C3-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S16C3-LTLCardinality-02 finished in 409 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 277 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 277/277 places, 501/501 transitions.
Graph (complete) has 930 edges and 277 vertex of which 267 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.1 ms
Discarding 10 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 62 transitions
Trivial Post-agglo rules discarded 62 transitions
Performed 62 trivial Post agglomeration. Transition count delta: 62
Iterating post reduction 0 with 62 rules applied. Total rules applied 63 place count 267 transition count 438
Reduce places removed 62 places and 0 transitions.
Iterating post reduction 1 with 62 rules applied. Total rules applied 125 place count 205 transition count 438
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 27 Pre rules applied. Total rules applied 125 place count 205 transition count 411
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 179 place count 178 transition count 411
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 200 place count 157 transition count 390
Iterating global reduction 2 with 21 rules applied. Total rules applied 221 place count 157 transition count 390
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 229 place count 149 transition count 382
Iterating global reduction 2 with 8 rules applied. Total rules applied 237 place count 149 transition count 382
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 2 with 3 rules applied. Total rules applied 240 place count 146 transition count 382
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 240 place count 146 transition count 379
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 246 place count 143 transition count 379
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 249 place count 140 transition count 376
Iterating global reduction 3 with 3 rules applied. Total rules applied 252 place count 140 transition count 376
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 255 place count 137 transition count 373
Iterating global reduction 3 with 3 rules applied. Total rules applied 258 place count 137 transition count 373
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 324 place count 104 transition count 340
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 337 place count 91 transition count 327
Iterating global reduction 3 with 13 rules applied. Total rules applied 350 place count 91 transition count 327
Applied a total of 350 rules in 43 ms. Remains 91 /277 variables (removed 186) and now considering 327/501 (removed 174) transitions.
[2025-06-02 19:16:46] [INFO ] Flow matrix only has 193 transitions (discarded 134 similar events)
// Phase 1: matrix 193 rows 91 cols
[2025-06-02 19:16:46] [INFO ] Computed 17 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 19:16:46] [INFO ] Implicit Places using invariants in 96 ms returned [6, 15, 16, 23, 27, 28, 41, 45, 49, 57, 58, 63, 67]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 97 ms to find 13 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 78/277 places, 327/501 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 67 transition count 316
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 67 transition count 316
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 33 place count 56 transition count 305
Iterating global reduction 0 with 11 rules applied. Total rules applied 44 place count 56 transition count 305
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 48 place count 54 transition count 303
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 50 place count 52 transition count 301
Iterating global reduction 0 with 2 rules applied. Total rules applied 52 place count 52 transition count 301
Applied a total of 52 rules in 16 ms. Remains 52 /78 variables (removed 26) and now considering 301/327 (removed 26) transitions.
[2025-06-02 19:16:46] [INFO ] Flow matrix only has 63 transitions (discarded 238 similar events)
// Phase 1: matrix 63 rows 52 cols
[2025-06-02 19:16:46] [INFO ] Computed 4 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 19:16:46] [INFO ] Implicit Places using invariants in 59 ms returned []
[2025-06-02 19:16:46] [INFO ] Flow matrix only has 63 transitions (discarded 238 similar events)
[2025-06-02 19:16:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 19:16:46] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 157 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 52/277 places, 301/501 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 315 ms. Remains : 52/277 places, 301/501 transitions.
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : LeafsetExtension-PT-S16C3-LTLCardinality-05
Stuttering criterion allowed to conclude after 397 steps with 32 reset in 2 ms.
FORMULA LeafsetExtension-PT-S16C3-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S16C3-LTLCardinality-05 finished in 394 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p0)||(p0&&F(p1)&&X(X(p0)))))))'
Support contains 3 out of 277 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 277/277 places, 501/501 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 269 transition count 501
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 41 place count 236 transition count 468
Iterating global reduction 1 with 33 rules applied. Total rules applied 74 place count 236 transition count 468
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 101 place count 209 transition count 441
Iterating global reduction 1 with 27 rules applied. Total rules applied 128 place count 209 transition count 441
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 1 with 4 rules applied. Total rules applied 132 place count 205 transition count 441
Discarding 26 places :
Symmetric choice reduction at 2 with 26 rule applications. Total rules 158 place count 179 transition count 415
Iterating global reduction 2 with 26 rules applied. Total rules applied 184 place count 179 transition count 415
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 2 with 11 rules applied. Total rules applied 195 place count 168 transition count 415
Discarding 29 places :
Symmetric choice reduction at 3 with 29 rule applications. Total rules 224 place count 139 transition count 386
Iterating global reduction 3 with 29 rules applied. Total rules applied 253 place count 139 transition count 386
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 268 place count 124 transition count 371
Iterating global reduction 3 with 15 rules applied. Total rules applied 283 place count 124 transition count 371
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 298 place count 109 transition count 356
Iterating global reduction 3 with 15 rules applied. Total rules applied 313 place count 109 transition count 356
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 328 place count 94 transition count 341
Iterating global reduction 3 with 15 rules applied. Total rules applied 343 place count 94 transition count 341
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 354 place count 83 transition count 330
Iterating global reduction 3 with 11 rules applied. Total rules applied 365 place count 83 transition count 330
Applied a total of 365 rules in 20 ms. Remains 83 /277 variables (removed 194) and now considering 330/501 (removed 171) transitions.
[2025-06-02 19:16:46] [INFO ] Flow matrix only has 102 transitions (discarded 228 similar events)
// Phase 1: matrix 102 rows 83 cols
[2025-06-02 19:16:46] [INFO ] Computed 5 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 19:16:46] [INFO ] Implicit Places using invariants in 77 ms returned []
[2025-06-02 19:16:46] [INFO ] Flow matrix only has 102 transitions (discarded 228 similar events)
[2025-06-02 19:16:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 19:16:46] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 223 ms to find 0 implicit places.
Running 313 sub problems to find dead transitions.
[2025-06-02 19:16:46] [INFO ] Flow matrix only has 102 transitions (discarded 228 similar events)
[2025-06-02 19:16:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 2 (OVERLAPS) 1/81 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/81 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 4 (OVERLAPS) 102/183 variables, 81/86 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/183 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 6 (OVERLAPS) 2/185 variables, 2/88 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/185 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 8 (OVERLAPS) 0/185 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 313 unsolved
No progress, stopping.
After SMT solving in domain Real declared 185/185 variables, and 88 constraints, problems are : Problem set: 0 solved, 313 unsolved in 10331 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 83/83 constraints, PredecessorRefiner: 313/313 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 313 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 2 (OVERLAPS) 1/81 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/81 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 4 (OVERLAPS) 102/183 variables, 81/86 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/183 variables, 309/395 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/183 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 7 (OVERLAPS) 2/185 variables, 2/397 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/185 variables, 4/401 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/185 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 10 (OVERLAPS) 0/185 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 313 unsolved
No progress, stopping.
After SMT solving in domain Int declared 185/185 variables, and 401 constraints, problems are : Problem set: 0 solved, 313 unsolved in 28240 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 83/83 constraints, PredecessorRefiner: 313/313 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 38602ms problems are : Problem set: 0 solved, 313 unsolved
Search for dead transitions found 0 dead transitions in 38604ms
Starting structural reductions in LTL mode, iteration 1 : 83/277 places, 330/501 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38848 ms. Remains : 83/277 places, 330/501 transitions.
Stuttering acceptance computed with spot in 197 ms :[(NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : LeafsetExtension-PT-S16C3-LTLCardinality-10
Stuttering criterion allowed to conclude after 22 steps with 0 reset in 0 ms.
FORMULA LeafsetExtension-PT-S16C3-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S16C3-LTLCardinality-10 finished in 39068 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((p0||X(p0)))&&F(p1)))'
Support contains 4 out of 277 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 277/277 places, 501/501 transitions.
Graph (complete) has 930 edges and 277 vertex of which 268 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 61 transitions
Trivial Post-agglo rules discarded 61 transitions
Performed 61 trivial Post agglomeration. Transition count delta: 61
Iterating post reduction 0 with 61 rules applied. Total rules applied 62 place count 268 transition count 439
Reduce places removed 61 places and 0 transitions.
Iterating post reduction 1 with 61 rules applied. Total rules applied 123 place count 207 transition count 439
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 26 Pre rules applied. Total rules applied 123 place count 207 transition count 413
Deduced a syphon composed of 26 places in 1 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 175 place count 181 transition count 413
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 196 place count 160 transition count 392
Iterating global reduction 2 with 21 rules applied. Total rules applied 217 place count 160 transition count 392
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 225 place count 152 transition count 384
Iterating global reduction 2 with 8 rules applied. Total rules applied 233 place count 152 transition count 384
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 2 with 3 rules applied. Total rules applied 236 place count 149 transition count 384
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 236 place count 149 transition count 381
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 242 place count 146 transition count 381
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 245 place count 143 transition count 378
Iterating global reduction 3 with 3 rules applied. Total rules applied 248 place count 143 transition count 378
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 251 place count 140 transition count 375
Iterating global reduction 3 with 3 rules applied. Total rules applied 254 place count 140 transition count 375
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 320 place count 107 transition count 342
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 332 place count 95 transition count 330
Iterating global reduction 3 with 12 rules applied. Total rules applied 344 place count 95 transition count 330
Applied a total of 344 rules in 34 ms. Remains 95 /277 variables (removed 182) and now considering 330/501 (removed 171) transitions.
[2025-06-02 19:17:25] [INFO ] Flow matrix only has 196 transitions (discarded 134 similar events)
// Phase 1: matrix 196 rows 95 cols
[2025-06-02 19:17:25] [INFO ] Computed 17 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 19:17:25] [INFO ] Implicit Places using invariants in 75 ms returned [2, 19, 26, 30, 31, 44, 48, 52, 61, 62, 67, 71]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 77 ms to find 12 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 83/277 places, 330/501 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 83 transition count 329
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 82 transition count 329
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 11 place count 73 transition count 320
Iterating global reduction 2 with 9 rules applied. Total rules applied 20 place count 73 transition count 320
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 29 place count 64 transition count 311
Iterating global reduction 2 with 9 rules applied. Total rules applied 38 place count 64 transition count 311
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 42 place count 62 transition count 309
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 44 place count 60 transition count 307
Iterating global reduction 2 with 2 rules applied. Total rules applied 46 place count 60 transition count 307
Applied a total of 46 rules in 11 ms. Remains 60 /83 variables (removed 23) and now considering 307/330 (removed 23) transitions.
[2025-06-02 19:17:25] [INFO ] Flow matrix only has 85 transitions (discarded 222 similar events)
// Phase 1: matrix 85 rows 60 cols
[2025-06-02 19:17:25] [INFO ] Computed 5 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 19:17:25] [INFO ] Implicit Places using invariants in 63 ms returned []
[2025-06-02 19:17:25] [INFO ] Flow matrix only has 85 transitions (discarded 222 similar events)
[2025-06-02 19:17:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 19:17:25] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 174 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 60/277 places, 307/501 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 296 ms. Remains : 60/277 places, 307/501 transitions.
Stuttering acceptance computed with spot in 101 ms :[(NOT p1), (NOT p0), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : LeafsetExtension-PT-S16C3-LTLCardinality-11
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 0 ms.
FORMULA LeafsetExtension-PT-S16C3-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S16C3-LTLCardinality-11 finished in 409 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((p0&&F(p1))))))'
Support contains 4 out of 277 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 277/277 places, 501/501 transitions.
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 268 transition count 501
Discarding 32 places :
Symmetric choice reduction at 1 with 32 rule applications. Total rules 41 place count 236 transition count 469
Iterating global reduction 1 with 32 rules applied. Total rules applied 73 place count 236 transition count 469
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 100 place count 209 transition count 442
Iterating global reduction 1 with 27 rules applied. Total rules applied 127 place count 209 transition count 442
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 1 with 4 rules applied. Total rules applied 131 place count 205 transition count 442
Discarding 26 places :
Symmetric choice reduction at 2 with 26 rule applications. Total rules 157 place count 179 transition count 416
Iterating global reduction 2 with 26 rules applied. Total rules applied 183 place count 179 transition count 416
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 2 with 11 rules applied. Total rules applied 194 place count 168 transition count 416
Discarding 28 places :
Symmetric choice reduction at 3 with 28 rule applications. Total rules 222 place count 140 transition count 388
Iterating global reduction 3 with 28 rules applied. Total rules applied 250 place count 140 transition count 388
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 265 place count 125 transition count 373
Iterating global reduction 3 with 15 rules applied. Total rules applied 280 place count 125 transition count 373
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 295 place count 110 transition count 358
Iterating global reduction 3 with 15 rules applied. Total rules applied 310 place count 110 transition count 358
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 325 place count 95 transition count 343
Iterating global reduction 3 with 15 rules applied. Total rules applied 340 place count 95 transition count 343
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 351 place count 84 transition count 332
Iterating global reduction 3 with 11 rules applied. Total rules applied 362 place count 84 transition count 332
Applied a total of 362 rules in 33 ms. Remains 84 /277 variables (removed 193) and now considering 332/501 (removed 169) transitions.
[2025-06-02 19:17:26] [INFO ] Flow matrix only has 105 transitions (discarded 227 similar events)
// Phase 1: matrix 105 rows 84 cols
[2025-06-02 19:17:26] [INFO ] Computed 5 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 19:17:26] [INFO ] Implicit Places using invariants in 80 ms returned []
[2025-06-02 19:17:26] [INFO ] Flow matrix only has 105 transitions (discarded 227 similar events)
[2025-06-02 19:17:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 19:17:26] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 202 ms to find 0 implicit places.
Running 315 sub problems to find dead transitions.
[2025-06-02 19:17:26] [INFO ] Flow matrix only has 105 transitions (discarded 227 similar events)
[2025-06-02 19:17:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 2 (OVERLAPS) 1/83 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 4 (OVERLAPS) 105/188 variables, 83/88 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 6 (OVERLAPS) 1/189 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 8 (OVERLAPS) 0/189 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 315 unsolved
No progress, stopping.
After SMT solving in domain Real declared 189/189 variables, and 89 constraints, problems are : Problem set: 0 solved, 315 unsolved in 10492 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 84/84 constraints, PredecessorRefiner: 315/315 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 315 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 2 (OVERLAPS) 1/83 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 4 (OVERLAPS) 105/188 variables, 83/88 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 313/401 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/188 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 7 (OVERLAPS) 1/189 variables, 1/402 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 2/404 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/189 variables, 0/404 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 10 (OVERLAPS) 0/189 variables, 0/404 constraints. Problems are: Problem set: 0 solved, 315 unsolved
No progress, stopping.
After SMT solving in domain Int declared 189/189 variables, and 404 constraints, problems are : Problem set: 0 solved, 315 unsolved in 27815 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 84/84 constraints, PredecessorRefiner: 315/315 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 38334ms problems are : Problem set: 0 solved, 315 unsolved
Search for dead transitions found 0 dead transitions in 38335ms
Starting structural reductions in LTL mode, iteration 1 : 84/277 places, 332/501 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38573 ms. Remains : 84/277 places, 332/501 transitions.
Stuttering acceptance computed with spot in 162 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : LeafsetExtension-PT-S16C3-LTLCardinality-12
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA LeafsetExtension-PT-S16C3-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S16C3-LTLCardinality-12 finished in 38751 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 277 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 277/277 places, 501/501 transitions.
Graph (complete) has 930 edges and 277 vertex of which 267 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.2 ms
Discarding 10 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 0 with 63 rules applied. Total rules applied 64 place count 267 transition count 437
Reduce places removed 63 places and 0 transitions.
Iterating post reduction 1 with 63 rules applied. Total rules applied 127 place count 204 transition count 437
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 127 place count 204 transition count 412
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 177 place count 179 transition count 412
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 197 place count 159 transition count 392
Iterating global reduction 2 with 20 rules applied. Total rules applied 217 place count 159 transition count 392
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 225 place count 151 transition count 384
Iterating global reduction 2 with 8 rules applied. Total rules applied 233 place count 151 transition count 384
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 2 with 4 rules applied. Total rules applied 237 place count 147 transition count 384
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 237 place count 147 transition count 380
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 245 place count 143 transition count 380
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 249 place count 139 transition count 376
Iterating global reduction 3 with 4 rules applied. Total rules applied 253 place count 139 transition count 376
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 257 place count 135 transition count 372
Iterating global reduction 3 with 4 rules applied. Total rules applied 261 place count 135 transition count 372
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 3 with 68 rules applied. Total rules applied 329 place count 101 transition count 338
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 343 place count 87 transition count 324
Iterating global reduction 3 with 14 rules applied. Total rules applied 357 place count 87 transition count 324
Applied a total of 357 rules in 32 ms. Remains 87 /277 variables (removed 190) and now considering 324/501 (removed 177) transitions.
[2025-06-02 19:18:04] [INFO ] Flow matrix only has 183 transitions (discarded 141 similar events)
// Phase 1: matrix 183 rows 87 cols
[2025-06-02 19:18:04] [INFO ] Computed 16 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 19:18:04] [INFO ] Implicit Places using invariants in 71 ms returned [2, 3, 12, 13, 20, 24, 25, 34, 38, 42, 55, 60, 64]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 72 ms to find 13 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 74/277 places, 324/501 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 63 transition count 313
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 63 transition count 313
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 33 place count 52 transition count 302
Iterating global reduction 0 with 11 rules applied. Total rules applied 44 place count 52 transition count 302
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 48 place count 50 transition count 300
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 50 place count 48 transition count 298
Iterating global reduction 0 with 2 rules applied. Total rules applied 52 place count 48 transition count 298
Applied a total of 52 rules in 10 ms. Remains 48 /74 variables (removed 26) and now considering 298/324 (removed 26) transitions.
[2025-06-02 19:18:04] [INFO ] Flow matrix only has 53 transitions (discarded 245 similar events)
// Phase 1: matrix 53 rows 48 cols
[2025-06-02 19:18:04] [INFO ] Computed 3 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 19:18:04] [INFO ] Implicit Places using invariants in 61 ms returned []
[2025-06-02 19:18:04] [INFO ] Flow matrix only has 53 transitions (discarded 245 similar events)
[2025-06-02 19:18:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 19:18:05] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 48/277 places, 298/501 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 253 ms. Remains : 48/277 places, 298/501 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : LeafsetExtension-PT-S16C3-LTLCardinality-14
Product exploration explored 100000 steps with 8542 reset in 240 ms.
Product exploration explored 100000 steps with 8530 reset in 255 ms.
Computed a total of 48 stabilizing places and 298 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 48 transition count 298
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [p0, (X p0), (F (G p0))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 10 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA LeafsetExtension-PT-S16C3-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property LeafsetExtension-PT-S16C3-LTLCardinality-14 finished in 855 ms.
All properties solved by simple procedures.
Total runtime 194575 ms.
BK_STOP 1748891885998
--------------------
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
++ 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.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /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="LeafsetExtension-PT-S16C3"
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-5832"
echo " Executing tool itstools"
echo " Input is LeafsetExtension-PT-S16C3, 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 r114-tall-174876423300739"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/LeafsetExtension-PT-S16C3.tgz
mv LeafsetExtension-PT-S16C3 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.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 ;