fond
Model Checking Contest 2025
15th edition, Paris, France, June 24, 2025
Execution of r002-tall-174853730100835
Last Updated
June 24, 2025

About the Execution of ITS-Tools for BART-PT-005

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
0.000 120163.00 0.00 0.00 TTTTTTTFTFTTTFTF normal

Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r002-tall-174853730100835.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 BART-PT-005, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r002-tall-174853730100835
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 13M
-rw-r--r-- 1 mcc users 493K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 1.8M May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 126K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 438K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 264K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 710K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 174K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 452K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 794K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 2.9M May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 709K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 2.4M May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 55K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 113K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 1.3M 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 BART-PT-005-LTLCardinality-00
FORMULA_NAME BART-PT-005-LTLCardinality-01
FORMULA_NAME BART-PT-005-LTLCardinality-02
FORMULA_NAME BART-PT-005-LTLCardinality-03
FORMULA_NAME BART-PT-005-LTLCardinality-04
FORMULA_NAME BART-PT-005-LTLCardinality-05
FORMULA_NAME BART-PT-005-LTLCardinality-06
FORMULA_NAME BART-PT-005-LTLCardinality-07
FORMULA_NAME BART-PT-005-LTLCardinality-08
FORMULA_NAME BART-PT-005-LTLCardinality-09
FORMULA_NAME BART-PT-005-LTLCardinality-10
FORMULA_NAME BART-PT-005-LTLCardinality-11
FORMULA_NAME BART-PT-005-LTLCardinality-12
FORMULA_NAME BART-PT-005-LTLCardinality-13
FORMULA_NAME BART-PT-005-LTLCardinality-14
FORMULA_NAME BART-PT-005-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1748672466034

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BART-PT-005
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-05-31 06:21:07] [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-05-31 06:21:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-31 06:21:07] [INFO ] Load time of PNML (sax parser for PT used): 168 ms
[2025-05-31 06:21:07] [INFO ] Transformed 870 places.
[2025-05-31 06:21:07] [INFO ] Transformed 1010 transitions.
[2025-05-31 06:21:07] [INFO ] Found NUPN structural information;
[2025-05-31 06:21:07] [INFO ] Parsed PT model containing 870 places and 1010 transitions and 8100 arcs in 267 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 39 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Reduce places removed 210 places and 0 transitions.
Initial state reduction rules removed 2 formulas.
FORMULA BART-PT-005-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-005-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-005-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-005-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-005-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-005-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-005-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-005-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-005-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-005-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-005-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-005-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-005-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-005-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 2 out of 660 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 660/660 places, 1010/1010 transitions.
Discarding 159 places :
Symmetric choice reduction at 0 with 159 rule applications. Total rules 159 place count 501 transition count 851
Iterating global reduction 0 with 159 rules applied. Total rules applied 318 place count 501 transition count 851
Discarding 134 places :
Symmetric choice reduction at 0 with 134 rule applications. Total rules 452 place count 367 transition count 717
Iterating global reduction 0 with 134 rules applied. Total rules applied 586 place count 367 transition count 717
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 606 place count 347 transition count 697
Iterating global reduction 0 with 20 rules applied. Total rules applied 626 place count 347 transition count 697
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 641 place count 332 transition count 682
Iterating global reduction 0 with 15 rules applied. Total rules applied 656 place count 332 transition count 682
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 671 place count 317 transition count 667
Iterating global reduction 0 with 15 rules applied. Total rules applied 686 place count 317 transition count 667
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 701 place count 302 transition count 652
Iterating global reduction 0 with 15 rules applied. Total rules applied 716 place count 302 transition count 652
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 731 place count 287 transition count 637
Iterating global reduction 0 with 15 rules applied. Total rules applied 746 place count 287 transition count 637
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 761 place count 272 transition count 622
Iterating global reduction 0 with 15 rules applied. Total rules applied 776 place count 272 transition count 622
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 786 place count 262 transition count 612
Iterating global reduction 0 with 10 rules applied. Total rules applied 796 place count 262 transition count 612
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 806 place count 252 transition count 602
Iterating global reduction 0 with 10 rules applied. Total rules applied 816 place count 252 transition count 602
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 821 place count 247 transition count 597
Iterating global reduction 0 with 5 rules applied. Total rules applied 826 place count 247 transition count 597
Applied a total of 826 rules in 180 ms. Remains 247 /660 variables (removed 413) and now considering 597/1010 (removed 413) transitions.
// Phase 1: matrix 597 rows 247 cols
[2025-05-31 06:21:08] [INFO ] Computed 5 invariants in 23 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:21:08] [INFO ] Implicit Places using invariants in 188 ms returned []
[2025-05-31 06:21:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:21:08] [INFO ] Implicit Places using invariants and state equation in 221 ms returned []
Implicit Place search using SMT with State Equation took 442 ms to find 0 implicit places.
Running 417 sub problems to find dead transitions.
[2025-05-31 06:21:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 1 (OVERLAPS) 5/247 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/247 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 3 (OVERLAPS) 597/844 variables, 247/252 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/844 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 417 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 844/844 variables, and 252 constraints, problems are : Problem set: 0 solved, 417 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 247/247 constraints, PredecessorRefiner: 417/417 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 417 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 1 (OVERLAPS) 5/247 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/247 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 3 (OVERLAPS) 597/844 variables, 247/252 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/844 variables, 417/669 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/844 variables, 0/669 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 6 (OVERLAPS) 0/844 variables, 0/669 constraints. Problems are: Problem set: 0 solved, 417 unsolved
No progress, stopping.
After SMT solving in domain Int declared 844/844 variables, and 669 constraints, problems are : Problem set: 0 solved, 417 unsolved in 28084 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 247/247 constraints, PredecessorRefiner: 417/417 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 58210ms problems are : Problem set: 0 solved, 417 unsolved
Search for dead transitions found 0 dead transitions in 58224ms
Starting structural reductions in LTL mode, iteration 1 : 247/660 places, 597/1010 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 58869 ms. Remains : 247/660 places, 597/1010 transitions.
Support contains 2 out of 247 places after structural reductions.
[2025-05-31 06:22:06] [INFO ] Flatten gal took : 50 ms
[2025-05-31 06:22:06] [INFO ] Flatten gal took : 22 ms
[2025-05-31 06:22:07] [INFO ] Input system was already deterministic with 597 transitions.
RANDOM walk for 10335 steps (2 resets) in 286 ms. (36 steps per ms) remains 0/3 properties
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 247 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 247/247 places, 597/597 transitions.
Graph (trivial) has 595 edges and 247 vertex of which 245 / 247 are part of one of the 5 SCC in 3 ms
Free SCC test removed 240 places
Ensure Unique test removed 589 transitions
Reduce isomorphic transitions removed 589 transitions.
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 3 transition count 5
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 3 transition count 4
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 5 place count 3 transition count 3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 7 place count 2 transition count 3
Applied a total of 7 rules in 19 ms. Remains 2 /247 variables (removed 245) and now considering 3/597 (removed 594) transitions.
// Phase 1: matrix 3 rows 2 cols
[2025-05-31 06:22:07] [INFO ] Computed 1 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:22:07] [INFO ] Implicit Places using invariants in 16 ms returned []
[2025-05-31 06:22:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:22:07] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 06:22:07] [INFO ] Redundant transitions in 0 ms returned []
Running 1 sub problems to find dead transitions.
[2025-05-31 06:22:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/4 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4/5 variables, and 3 constraints, problems are : Problem set: 0 solved, 1 unsolved in 30 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/4 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4/5 variables, and 4 constraints, problems are : Problem set: 0 solved, 1 unsolved in 36 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 85ms problems are : Problem set: 0 solved, 1 unsolved
Search for dead transitions found 0 dead transitions in 86ms
Starting structural reductions in SI_LTL mode, iteration 1 : 2/247 places, 3/597 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 147 ms. Remains : 2/247 places, 3/597 transitions.
Stuttering acceptance computed with spot in 150 ms :[(NOT p0)]
Running random walk in product with property : BART-PT-005-LTLCardinality-13
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 1 ms.
FORMULA BART-PT-005-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-005-LTLCardinality-13 finished in 363 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((F(G(p0))&&G(p1))))'
Support contains 1 out of 247 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 247/247 places, 597/597 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 246 transition count 596
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 246 transition count 596
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 245 transition count 595
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 245 transition count 595
Applied a total of 4 rules in 10 ms. Remains 245 /247 variables (removed 2) and now considering 595/597 (removed 2) transitions.
// Phase 1: matrix 595 rows 245 cols
[2025-05-31 06:22:07] [INFO ] Computed 5 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:22:07] [INFO ] Implicit Places using invariants in 107 ms returned []
[2025-05-31 06:22:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:22:07] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 271 ms to find 0 implicit places.
Running 415 sub problems to find dead transitions.
[2025-05-31 06:22:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 1 (OVERLAPS) 5/245 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/245 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 3 (OVERLAPS) 595/840 variables, 245/250 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/840 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 5 (OVERLAPS) 0/840 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 415 unsolved
No progress, stopping.
After SMT solving in domain Real declared 840/840 variables, and 250 constraints, problems are : Problem set: 0 solved, 415 unsolved in 29455 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 245/245 constraints, PredecessorRefiner: 415/415 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 415 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 1 (OVERLAPS) 5/245 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/245 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 3 (OVERLAPS) 595/840 variables, 245/250 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/840 variables, 415/665 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/840 variables, 0/665 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 6 (OVERLAPS) 0/840 variables, 0/665 constraints. Problems are: Problem set: 0 solved, 415 unsolved
No progress, stopping.
After SMT solving in domain Int declared 840/840 variables, and 665 constraints, problems are : Problem set: 0 solved, 415 unsolved in 28273 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 245/245 constraints, PredecessorRefiner: 415/415 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 57823ms problems are : Problem set: 0 solved, 415 unsolved
Search for dead transitions found 0 dead transitions in 57824ms
Starting structural reductions in LTL mode, iteration 1 : 245/247 places, 595/597 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 58109 ms. Remains : 245/247 places, 595/597 transitions.
Stuttering acceptance computed with spot in 163 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (NOT p0)]
Running random walk in product with property : BART-PT-005-LTLCardinality-15
Product exploration explored 100000 steps with 0 reset in 236 ms.
Stack based approach found an accepted trace after 1758 steps with 0 reset with depth 1759 and stack size 1759 in 4 ms.
FORMULA BART-PT-005-LTLCardinality-15 FALSE TECHNIQUES STACK_TEST
Treatment of property BART-PT-005-LTLCardinality-15 finished in 58532 ms.
All properties solved by simple procedures.
Total runtime 118817 ms.

BK_STOP 1748672586197

--------------------
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="BART-PT-005"
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 BART-PT-005, 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 r002-tall-174853730100835"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BART-PT-005.tgz
mv BART-PT-005 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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;