fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r496-tall-171640603700571
Last Updated
July 7, 2024

About the Execution of LTSMin+red for GPUForwardProgress-PT-28b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
632.800 491736.00 588975.00 1126.50 TFFTTFFFFFFTFFTF normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 516K
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 55K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 22 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.9K Apr 11 22:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 100K Apr 11 22:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Apr 11 22:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K Apr 11 22:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 22 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 141K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717198487140

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=GPUForwardProgress-PT-28b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 23:34:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-31 23:34:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 23:34:48] [INFO ] Load time of PNML (sax parser for PT used): 104 ms
[2024-05-31 23:34:48] [INFO ] Transformed 568 places.
[2024-05-31 23:34:48] [INFO ] Transformed 597 transitions.
[2024-05-31 23:34:48] [INFO ] Found NUPN structural information;
[2024-05-31 23:34:48] [INFO ] Parsed PT model containing 568 places and 597 transitions and 1477 arcs in 212 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA GPUForwardProgress-PT-28b-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-28b-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-28b-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-28b-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-28b-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-28b-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-28b-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-28b-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 16 out of 568 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 568/568 places, 597/597 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 567 transition count 597
Discarding 57 places :
Symmetric choice reduction at 1 with 57 rule applications. Total rules 58 place count 510 transition count 540
Iterating global reduction 1 with 57 rules applied. Total rules applied 115 place count 510 transition count 540
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 141 place count 484 transition count 514
Iterating global reduction 1 with 26 rules applied. Total rules applied 167 place count 484 transition count 514
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 191 place count 484 transition count 490
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 192 place count 483 transition count 489
Iterating global reduction 2 with 1 rules applied. Total rules applied 193 place count 483 transition count 489
Applied a total of 193 rules in 141 ms. Remains 483 /568 variables (removed 85) and now considering 489/597 (removed 108) transitions.
// Phase 1: matrix 489 rows 483 cols
[2024-05-31 23:34:48] [INFO ] Computed 29 invariants in 22 ms
[2024-05-31 23:34:49] [INFO ] Implicit Places using invariants in 288 ms returned []
[2024-05-31 23:34:49] [INFO ] Invariant cache hit.
[2024-05-31 23:34:49] [INFO ] Implicit Places using invariants and state equation in 414 ms returned []
Implicit Place search using SMT with State Equation took 729 ms to find 0 implicit places.
Running 488 sub problems to find dead transitions.
[2024-05-31 23:34:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/482 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 488 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/482 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 488 unsolved
At refinement iteration 2 (OVERLAPS) 489/971 variables, 482/511 constraints. Problems are: Problem set: 0 solved, 488 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/971 variables, 0/511 constraints. Problems are: Problem set: 0 solved, 488 unsolved
At refinement iteration 4 (OVERLAPS) 1/972 variables, 1/512 constraints. Problems are: Problem set: 0 solved, 488 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/972 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 488 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 972/972 variables, and 512 constraints, problems are : Problem set: 0 solved, 488 unsolved in 30031 ms.
Refiners :[Generalized P Invariants (flows): 29/29 constraints, State Equation: 483/483 constraints, PredecessorRefiner: 488/488 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 488 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/482 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 488 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/482 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 488 unsolved
At refinement iteration 2 (OVERLAPS) 489/971 variables, 482/511 constraints. Problems are: Problem set: 0 solved, 488 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/971 variables, 488/999 constraints. Problems are: Problem set: 0 solved, 488 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/971 variables, 0/999 constraints. Problems are: Problem set: 0 solved, 488 unsolved
At refinement iteration 5 (OVERLAPS) 1/972 variables, 1/1000 constraints. Problems are: Problem set: 0 solved, 488 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/972 variables, 0/1000 constraints. Problems are: Problem set: 0 solved, 488 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 972/972 variables, and 1000 constraints, problems are : Problem set: 0 solved, 488 unsolved in 30015 ms.
Refiners :[Generalized P Invariants (flows): 29/29 constraints, State Equation: 483/483 constraints, PredecessorRefiner: 488/488 constraints, Known Traps: 0/0 constraints]
After SMT, in 60248ms problems are : Problem set: 0 solved, 488 unsolved
Search for dead transitions found 0 dead transitions in 60265ms
Starting structural reductions in LTL mode, iteration 1 : 483/568 places, 489/597 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61157 ms. Remains : 483/568 places, 489/597 transitions.
Support contains 16 out of 483 places after structural reductions.
[2024-05-31 23:35:50] [INFO ] Flatten gal took : 68 ms
[2024-05-31 23:35:50] [INFO ] Flatten gal took : 27 ms
[2024-05-31 23:35:50] [INFO ] Input system was already deterministic with 489 transitions.
RANDOM walk for 40000 steps (165 resets) in 1496 ms. (26 steps per ms) remains 3/10 properties
BEST_FIRST walk for 40004 steps (17 resets) in 108 ms. (367 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (16 resets) in 68 ms. (579 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (18 resets) in 50 ms. (784 steps per ms) remains 1/3 properties
[2024-05-31 23:35:50] [INFO ] Invariant cache hit.
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) 34/35 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 447/482 variables, 28/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/482 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 489/971 variables, 482/511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/971 variables, 0/511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/972 variables, 1/512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/972 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/972 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 972/972 variables, and 512 constraints, problems are : Problem set: 0 solved, 1 unsolved in 253 ms.
Refiners :[Generalized P Invariants (flows): 29/29 constraints, State Equation: 483/483 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 34/35 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 447/482 variables, 28/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/482 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 489/971 variables, 482/511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/971 variables, 1/512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/971 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/972 variables, 1/513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/972 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/972 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 972/972 variables, and 513 constraints, problems are : Problem set: 0 solved, 1 unsolved in 221 ms.
Refiners :[Generalized P Invariants (flows): 29/29 constraints, State Equation: 483/483 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 481ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 57 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=28 )
Parikh walk visited 1 properties in 10 ms.
Computed a total of 90 stabilizing places and 90 stable transitions
Graph (complete) has 750 edges and 483 vertex of which 451 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.20 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(X(X(X(G(p0)))))))))'
Support contains 2 out of 483 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 483/483 places, 489/489 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 477 transition count 483
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 477 transition count 483
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 477 transition count 482
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 16 place count 474 transition count 479
Iterating global reduction 1 with 3 rules applied. Total rules applied 19 place count 474 transition count 479
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 21 place count 474 transition count 477
Applied a total of 21 rules in 68 ms. Remains 474 /483 variables (removed 9) and now considering 477/489 (removed 12) transitions.
// Phase 1: matrix 477 rows 474 cols
[2024-05-31 23:35:51] [INFO ] Computed 29 invariants in 3 ms
[2024-05-31 23:35:51] [INFO ] Implicit Places using invariants in 228 ms returned []
[2024-05-31 23:35:51] [INFO ] Invariant cache hit.
[2024-05-31 23:35:52] [INFO ] Implicit Places using invariants and state equation in 368 ms returned []
Implicit Place search using SMT with State Equation took 598 ms to find 0 implicit places.
Running 476 sub problems to find dead transitions.
[2024-05-31 23:35:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/473 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 476 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/473 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 476 unsolved
At refinement iteration 2 (OVERLAPS) 477/950 variables, 473/502 constraints. Problems are: Problem set: 0 solved, 476 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/950 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 476 unsolved
At refinement iteration 4 (OVERLAPS) 1/951 variables, 1/503 constraints. Problems are: Problem set: 0 solved, 476 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/951 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 476 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 951/951 variables, and 503 constraints, problems are : Problem set: 0 solved, 476 unsolved in 30027 ms.
Refiners :[Generalized P Invariants (flows): 29/29 constraints, State Equation: 474/474 constraints, PredecessorRefiner: 476/476 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 476 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/473 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 476 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/473 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 476 unsolved
At refinement iteration 2 (OVERLAPS) 477/950 variables, 473/502 constraints. Problems are: Problem set: 0 solved, 476 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/950 variables, 476/978 constraints. Problems are: Problem set: 0 solved, 476 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/950 variables, 0/978 constraints. Problems are: Problem set: 0 solved, 476 unsolved
At refinement iteration 5 (OVERLAPS) 1/951 variables, 1/979 constraints. Problems are: Problem set: 0 solved, 476 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/951 variables, 0/979 constraints. Problems are: Problem set: 0 solved, 476 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 951/951 variables, and 979 constraints, problems are : Problem set: 0 solved, 476 unsolved in 30025 ms.
Refiners :[Generalized P Invariants (flows): 29/29 constraints, State Equation: 474/474 constraints, PredecessorRefiner: 476/476 constraints, Known Traps: 0/0 constraints]
After SMT, in 60157ms problems are : Problem set: 0 solved, 476 unsolved
Search for dead transitions found 0 dead transitions in 60169ms
Starting structural reductions in LTL mode, iteration 1 : 474/483 places, 477/489 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60839 ms. Remains : 474/483 places, 477/489 transitions.
Stuttering acceptance computed with spot in 415 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-28b-LTLCardinality-01
Entered a terminal (fully accepting) state of product in 26937 steps with 113 reset in 128 ms.
FORMULA GPUForwardProgress-PT-28b-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-28b-LTLCardinality-01 finished in 61446 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 483 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 483/483 places, 489/489 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 477 transition count 483
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 477 transition count 483
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 477 transition count 482
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 16 place count 474 transition count 479
Iterating global reduction 1 with 3 rules applied. Total rules applied 19 place count 474 transition count 479
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 22 place count 474 transition count 476
Applied a total of 22 rules in 58 ms. Remains 474 /483 variables (removed 9) and now considering 476/489 (removed 13) transitions.
// Phase 1: matrix 476 rows 474 cols
[2024-05-31 23:36:52] [INFO ] Computed 29 invariants in 6 ms
[2024-05-31 23:36:53] [INFO ] Implicit Places using invariants in 164 ms returned []
[2024-05-31 23:36:53] [INFO ] Invariant cache hit.
[2024-05-31 23:36:53] [INFO ] Implicit Places using invariants and state equation in 249 ms returned []
Implicit Place search using SMT with State Equation took 416 ms to find 0 implicit places.
Running 475 sub problems to find dead transitions.
[2024-05-31 23:36:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/473 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 475 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/473 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 475 unsolved
At refinement iteration 2 (OVERLAPS) 476/949 variables, 473/502 constraints. Problems are: Problem set: 0 solved, 475 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/949 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 475 unsolved
At refinement iteration 4 (OVERLAPS) 1/950 variables, 1/503 constraints. Problems are: Problem set: 0 solved, 475 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/950 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 475 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 950/950 variables, and 503 constraints, problems are : Problem set: 0 solved, 475 unsolved in 30014 ms.
Refiners :[Generalized P Invariants (flows): 29/29 constraints, State Equation: 474/474 constraints, PredecessorRefiner: 475/475 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 475 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/473 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 475 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/473 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 475 unsolved
At refinement iteration 2 (OVERLAPS) 476/949 variables, 473/502 constraints. Problems are: Problem set: 0 solved, 475 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/949 variables, 475/977 constraints. Problems are: Problem set: 0 solved, 475 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/949 variables, 0/977 constraints. Problems are: Problem set: 0 solved, 475 unsolved
At refinement iteration 5 (OVERLAPS) 1/950 variables, 1/978 constraints. Problems are: Problem set: 0 solved, 475 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/950 variables, 0/978 constraints. Problems are: Problem set: 0 solved, 475 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 950/950 variables, and 978 constraints, problems are : Problem set: 0 solved, 475 unsolved in 30016 ms.
Refiners :[Generalized P Invariants (flows): 29/29 constraints, State Equation: 474/474 constraints, PredecessorRefiner: 475/475 constraints, Known Traps: 0/0 constraints]
After SMT, in 60131ms problems are : Problem set: 0 solved, 475 unsolved
Search for dead transitions found 0 dead transitions in 60137ms
Starting structural reductions in LTL mode, iteration 1 : 474/483 places, 476/489 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60613 ms. Remains : 474/483 places, 476/489 transitions.
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-28b-LTLCardinality-03
Product exploration explored 100000 steps with 50000 reset in 277 ms.
Product exploration explored 100000 steps with 50000 reset in 225 ms.
Computed a total of 88 stabilizing places and 88 stable transitions
Graph (complete) has 737 edges and 474 vertex of which 442 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.5 ms
Computed a total of 88 stabilizing places and 88 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 86 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA GPUForwardProgress-PT-28b-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property GPUForwardProgress-PT-28b-LTLCardinality-03 finished in 61347 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 2 out of 483 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 483/483 places, 489/489 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 477 transition count 483
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 477 transition count 483
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 477 transition count 482
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 16 place count 474 transition count 479
Iterating global reduction 1 with 3 rules applied. Total rules applied 19 place count 474 transition count 479
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 21 place count 474 transition count 477
Applied a total of 21 rules in 34 ms. Remains 474 /483 variables (removed 9) and now considering 477/489 (removed 12) transitions.
// Phase 1: matrix 477 rows 474 cols
[2024-05-31 23:37:54] [INFO ] Computed 29 invariants in 2 ms
[2024-05-31 23:37:54] [INFO ] Implicit Places using invariants in 109 ms returned []
[2024-05-31 23:37:54] [INFO ] Invariant cache hit.
[2024-05-31 23:37:54] [INFO ] Implicit Places using invariants and state equation in 307 ms returned []
Implicit Place search using SMT with State Equation took 427 ms to find 0 implicit places.
Running 476 sub problems to find dead transitions.
[2024-05-31 23:37:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/473 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 476 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/473 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 476 unsolved
At refinement iteration 2 (OVERLAPS) 477/950 variables, 473/502 constraints. Problems are: Problem set: 0 solved, 476 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/950 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 476 unsolved
At refinement iteration 4 (OVERLAPS) 1/951 variables, 1/503 constraints. Problems are: Problem set: 0 solved, 476 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/951 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 476 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 951/951 variables, and 503 constraints, problems are : Problem set: 0 solved, 476 unsolved in 30013 ms.
Refiners :[Generalized P Invariants (flows): 29/29 constraints, State Equation: 474/474 constraints, PredecessorRefiner: 476/476 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 476 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/473 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 476 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/473 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 476 unsolved
At refinement iteration 2 (OVERLAPS) 477/950 variables, 473/502 constraints. Problems are: Problem set: 0 solved, 476 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/950 variables, 476/978 constraints. Problems are: Problem set: 0 solved, 476 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/950 variables, 0/978 constraints. Problems are: Problem set: 0 solved, 476 unsolved
At refinement iteration 5 (OVERLAPS) 1/951 variables, 1/979 constraints. Problems are: Problem set: 0 solved, 476 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/951 variables, 0/979 constraints. Problems are: Problem set: 0 solved, 476 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 951/951 variables, and 979 constraints, problems are : Problem set: 0 solved, 476 unsolved in 30016 ms.
Refiners :[Generalized P Invariants (flows): 29/29 constraints, State Equation: 474/474 constraints, PredecessorRefiner: 476/476 constraints, Known Traps: 0/0 constraints]
After SMT, in 60118ms problems are : Problem set: 0 solved, 476 unsolved
Search for dead transitions found 0 dead transitions in 60122ms
Starting structural reductions in LTL mode, iteration 1 : 474/483 places, 477/489 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60586 ms. Remains : 474/483 places, 477/489 transitions.
Stuttering acceptance computed with spot in 154 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-28b-LTLCardinality-07
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA GPUForwardProgress-PT-28b-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-28b-LTLCardinality-07 finished in 60756 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(p1))&&F(p2)&&p0)))'
Support contains 6 out of 483 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 483/483 places, 489/489 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 479 transition count 485
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 479 transition count 485
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 479 transition count 484
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 12 place count 476 transition count 481
Iterating global reduction 1 with 3 rules applied. Total rules applied 15 place count 476 transition count 481
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 17 place count 476 transition count 479
Applied a total of 17 rules in 25 ms. Remains 476 /483 variables (removed 7) and now considering 479/489 (removed 10) transitions.
// Phase 1: matrix 479 rows 476 cols
[2024-05-31 23:38:55] [INFO ] Computed 29 invariants in 4 ms
[2024-05-31 23:38:55] [INFO ] Implicit Places using invariants in 109 ms returned []
[2024-05-31 23:38:55] [INFO ] Invariant cache hit.
[2024-05-31 23:38:55] [INFO ] Implicit Places using invariants and state equation in 239 ms returned []
Implicit Place search using SMT with State Equation took 355 ms to find 0 implicit places.
Running 478 sub problems to find dead transitions.
[2024-05-31 23:38:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/475 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 478 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/475 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 478 unsolved
At refinement iteration 2 (OVERLAPS) 479/954 variables, 475/504 constraints. Problems are: Problem set: 0 solved, 478 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/954 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 478 unsolved
At refinement iteration 4 (OVERLAPS) 1/955 variables, 1/505 constraints. Problems are: Problem set: 0 solved, 478 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/955 variables, 0/505 constraints. Problems are: Problem set: 0 solved, 478 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 955/955 variables, and 505 constraints, problems are : Problem set: 0 solved, 478 unsolved in 30024 ms.
Refiners :[Generalized P Invariants (flows): 29/29 constraints, State Equation: 476/476 constraints, PredecessorRefiner: 478/478 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 478 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/475 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 478 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/475 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 478 unsolved
At refinement iteration 2 (OVERLAPS) 479/954 variables, 475/504 constraints. Problems are: Problem set: 0 solved, 478 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/954 variables, 478/982 constraints. Problems are: Problem set: 0 solved, 478 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/954 variables, 0/982 constraints. Problems are: Problem set: 0 solved, 478 unsolved
At refinement iteration 5 (OVERLAPS) 1/955 variables, 1/983 constraints. Problems are: Problem set: 0 solved, 478 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/955 variables, 0/983 constraints. Problems are: Problem set: 0 solved, 478 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 955/955 variables, and 983 constraints, problems are : Problem set: 0 solved, 478 unsolved in 30015 ms.
Refiners :[Generalized P Invariants (flows): 29/29 constraints, State Equation: 476/476 constraints, PredecessorRefiner: 478/478 constraints, Known Traps: 0/0 constraints]
After SMT, in 60129ms problems are : Problem set: 0 solved, 478 unsolved
Search for dead transitions found 0 dead transitions in 60136ms
Starting structural reductions in LTL mode, iteration 1 : 476/483 places, 479/489 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60518 ms. Remains : 476/483 places, 479/489 transitions.
Stuttering acceptance computed with spot in 211 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p1)), true, (NOT p1), (NOT p2), (NOT p1)]
Running random walk in product with property : GPUForwardProgress-PT-28b-LTLCardinality-09
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-28b-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-28b-LTLCardinality-09 finished in 60751 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 out of 483 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 483/483 places, 489/489 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 476 transition count 482
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 476 transition count 482
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 476 transition count 481
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 19 place count 472 transition count 477
Iterating global reduction 1 with 4 rules applied. Total rules applied 23 place count 472 transition count 477
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 26 place count 472 transition count 474
Applied a total of 26 rules in 25 ms. Remains 472 /483 variables (removed 11) and now considering 474/489 (removed 15) transitions.
// Phase 1: matrix 474 rows 472 cols
[2024-05-31 23:39:55] [INFO ] Computed 29 invariants in 8 ms
[2024-05-31 23:39:55] [INFO ] Implicit Places using invariants in 151 ms returned []
[2024-05-31 23:39:55] [INFO ] Invariant cache hit.
[2024-05-31 23:39:56] [INFO ] Implicit Places using invariants and state equation in 296 ms returned []
Implicit Place search using SMT with State Equation took 454 ms to find 0 implicit places.
Running 473 sub problems to find dead transitions.
[2024-05-31 23:39:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/471 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/471 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 2 (OVERLAPS) 474/945 variables, 471/500 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/945 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 4 (OVERLAPS) 1/946 variables, 1/501 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/946 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 473 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 946/946 variables, and 501 constraints, problems are : Problem set: 0 solved, 473 unsolved in 30013 ms.
Refiners :[Generalized P Invariants (flows): 29/29 constraints, State Equation: 472/472 constraints, PredecessorRefiner: 473/473 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 473 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/471 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/471 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 2 (OVERLAPS) 474/945 variables, 471/500 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/945 variables, 473/973 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/945 variables, 0/973 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 5 (OVERLAPS) 1/946 variables, 1/974 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/946 variables, 0/974 constraints. Problems are: Problem set: 0 solved, 473 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 946/946 variables, and 974 constraints, problems are : Problem set: 0 solved, 473 unsolved in 30015 ms.
Refiners :[Generalized P Invariants (flows): 29/29 constraints, State Equation: 472/472 constraints, PredecessorRefiner: 473/473 constraints, Known Traps: 0/0 constraints]
After SMT, in 60127ms problems are : Problem set: 0 solved, 473 unsolved
Search for dead transitions found 0 dead transitions in 60134ms
Starting structural reductions in LTL mode, iteration 1 : 472/483 places, 474/489 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60615 ms. Remains : 472/483 places, 474/489 transitions.
Stuttering acceptance computed with spot in 153 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-28b-LTLCardinality-12
Entered a terminal (fully accepting) state of product in 66231 steps with 272 reset in 120 ms.
FORMULA GPUForwardProgress-PT-28b-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-28b-LTLCardinality-12 finished in 60901 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 483 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 483/483 places, 489/489 transitions.
Graph (trivial) has 401 edges and 483 vertex of which 6 / 483 are part of one of the 1 SCC in 4 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 744 edges and 478 vertex of which 446 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.2 ms
Discarding 32 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 236 transitions
Trivial Post-agglo rules discarded 236 transitions
Performed 236 trivial Post agglomeration. Transition count delta: 236
Iterating post reduction 0 with 236 rules applied. Total rules applied 238 place count 445 transition count 243
Reduce places removed 236 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 241 rules applied. Total rules applied 479 place count 209 transition count 238
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 480 place count 208 transition count 238
Performed 59 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 59 Pre rules applied. Total rules applied 480 place count 208 transition count 179
Deduced a syphon composed of 59 places in 1 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 3 with 118 rules applied. Total rules applied 598 place count 149 transition count 179
Discarding 26 places :
Symmetric choice reduction at 3 with 26 rule applications. Total rules 624 place count 123 transition count 153
Iterating global reduction 3 with 26 rules applied. Total rules applied 650 place count 123 transition count 153
Performed 85 Post agglomeration using F-continuation condition.Transition count delta: 85
Deduced a syphon composed of 85 places in 0 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 3 with 170 rules applied. Total rules applied 820 place count 38 transition count 68
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 821 place count 38 transition count 67
Discarding 27 places :
Symmetric choice reduction at 4 with 27 rule applications. Total rules 848 place count 11 transition count 14
Iterating global reduction 4 with 27 rules applied. Total rules applied 875 place count 11 transition count 14
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 879 place count 9 transition count 13
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 880 place count 8 transition count 12
Applied a total of 880 rules in 57 ms. Remains 8 /483 variables (removed 475) and now considering 12/489 (removed 477) transitions.
[2024-05-31 23:40:56] [INFO ] Flow matrix only has 11 transitions (discarded 1 similar events)
// Phase 1: matrix 11 rows 8 cols
[2024-05-31 23:40:56] [INFO ] Computed 0 invariants in 0 ms
[2024-05-31 23:40:56] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-31 23:40:56] [INFO ] Flow matrix only has 11 transitions (discarded 1 similar events)
[2024-05-31 23:40:56] [INFO ] Invariant cache hit.
[2024-05-31 23:40:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 23:40:56] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
[2024-05-31 23:40:56] [INFO ] Redundant transitions in 12 ms returned []
Running 7 sub problems to find dead transitions.
[2024-05-31 23:40:56] [INFO ] Flow matrix only has 11 transitions (discarded 1 similar events)
[2024-05-31 23:40:56] [INFO ] Invariant cache hit.
[2024-05-31 23:40:56] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 10/16 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 2/18 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/18 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 1/19 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/19 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 0/19 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 19/19 variables, and 9 constraints, problems are : Problem set: 0 solved, 7 unsolved in 85 ms.
Refiners :[State Equation: 8/8 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 10/16 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 2/18 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/18 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/18 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 1/19 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/19 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 0/19 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 19/19 variables, and 16 constraints, problems are : Problem set: 0 solved, 7 unsolved in 66 ms.
Refiners :[State Equation: 8/8 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
After SMT, in 160ms problems are : Problem set: 0 solved, 7 unsolved
Search for dead transitions found 0 dead transitions in 160ms
Starting structural reductions in SI_LTL mode, iteration 1 : 8/483 places, 12/489 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 304 ms. Remains : 8/483 places, 12/489 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-28b-LTLCardinality-13
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-28b-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-28b-LTLCardinality-13 finished in 392 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 1 out of 483 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 483/483 places, 489/489 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 476 transition count 482
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 476 transition count 482
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 476 transition count 481
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 19 place count 472 transition count 477
Iterating global reduction 1 with 4 rules applied. Total rules applied 23 place count 472 transition count 477
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 26 place count 472 transition count 474
Applied a total of 26 rules in 52 ms. Remains 472 /483 variables (removed 11) and now considering 474/489 (removed 15) transitions.
// Phase 1: matrix 474 rows 472 cols
[2024-05-31 23:40:57] [INFO ] Computed 29 invariants in 2 ms
[2024-05-31 23:40:57] [INFO ] Implicit Places using invariants in 213 ms returned []
[2024-05-31 23:40:57] [INFO ] Invariant cache hit.
[2024-05-31 23:40:57] [INFO ] Implicit Places using invariants and state equation in 293 ms returned []
Implicit Place search using SMT with State Equation took 513 ms to find 0 implicit places.
Running 473 sub problems to find dead transitions.
[2024-05-31 23:40:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/471 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/471 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 2 (OVERLAPS) 474/945 variables, 471/500 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/945 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 4 (OVERLAPS) 1/946 variables, 1/501 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/946 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 473 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 946/946 variables, and 501 constraints, problems are : Problem set: 0 solved, 473 unsolved in 30016 ms.
Refiners :[Generalized P Invariants (flows): 29/29 constraints, State Equation: 472/472 constraints, PredecessorRefiner: 473/473 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 473 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/471 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/471 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 2 (OVERLAPS) 474/945 variables, 471/500 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/945 variables, 473/973 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/945 variables, 0/973 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 5 (OVERLAPS) 1/946 variables, 1/974 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/946 variables, 0/974 constraints. Problems are: Problem set: 0 solved, 473 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 946/946 variables, and 974 constraints, problems are : Problem set: 0 solved, 473 unsolved in 30016 ms.
Refiners :[Generalized P Invariants (flows): 29/29 constraints, State Equation: 472/472 constraints, PredecessorRefiner: 473/473 constraints, Known Traps: 0/0 constraints]
After SMT, in 60125ms problems are : Problem set: 0 solved, 473 unsolved
Search for dead transitions found 0 dead transitions in 60134ms
Starting structural reductions in LTL mode, iteration 1 : 472/483 places, 474/489 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60702 ms. Remains : 472/483 places, 474/489 transitions.
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-28b-LTLCardinality-14
Product exploration explored 100000 steps with 33333 reset in 117 ms.
Product exploration explored 100000 steps with 33333 reset in 128 ms.
Computed a total of 87 stabilizing places and 87 stable transitions
Graph (complete) has 735 edges and 472 vertex of which 440 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.4 ms
Computed a total of 87 stabilizing places and 87 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 10 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA GPUForwardProgress-PT-28b-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property GPUForwardProgress-PT-28b-LTLCardinality-14 finished in 61091 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 483 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 483/483 places, 489/489 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 477 transition count 483
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 477 transition count 483
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 16 place count 473 transition count 479
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 473 transition count 479
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 23 place count 473 transition count 476
Applied a total of 23 rules in 29 ms. Remains 473 /483 variables (removed 10) and now considering 476/489 (removed 13) transitions.
// Phase 1: matrix 476 rows 473 cols
[2024-05-31 23:41:58] [INFO ] Computed 29 invariants in 4 ms
[2024-05-31 23:41:58] [INFO ] Implicit Places using invariants in 166 ms returned []
[2024-05-31 23:41:58] [INFO ] Invariant cache hit.
[2024-05-31 23:41:58] [INFO ] Implicit Places using invariants and state equation in 279 ms returned []
Implicit Place search using SMT with State Equation took 447 ms to find 0 implicit places.
Running 475 sub problems to find dead transitions.
[2024-05-31 23:41:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 475 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/472 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 475 unsolved
At refinement iteration 2 (OVERLAPS) 476/948 variables, 472/501 constraints. Problems are: Problem set: 0 solved, 475 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/948 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 475 unsolved
At refinement iteration 4 (OVERLAPS) 1/949 variables, 1/502 constraints. Problems are: Problem set: 0 solved, 475 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/949 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 475 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 949/949 variables, and 502 constraints, problems are : Problem set: 0 solved, 475 unsolved in 30012 ms.
Refiners :[Generalized P Invariants (flows): 29/29 constraints, State Equation: 473/473 constraints, PredecessorRefiner: 475/475 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 475 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 475 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/472 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 475 unsolved
At refinement iteration 2 (OVERLAPS) 476/948 variables, 472/501 constraints. Problems are: Problem set: 0 solved, 475 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/948 variables, 475/976 constraints. Problems are: Problem set: 0 solved, 475 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/948 variables, 0/976 constraints. Problems are: Problem set: 0 solved, 475 unsolved
At refinement iteration 5 (OVERLAPS) 1/949 variables, 1/977 constraints. Problems are: Problem set: 0 solved, 475 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/949 variables, 0/977 constraints. Problems are: Problem set: 0 solved, 475 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 949/949 variables, and 977 constraints, problems are : Problem set: 0 solved, 475 unsolved in 30017 ms.
Refiners :[Generalized P Invariants (flows): 29/29 constraints, State Equation: 473/473 constraints, PredecessorRefiner: 475/475 constraints, Known Traps: 0/0 constraints]
After SMT, in 60121ms problems are : Problem set: 0 solved, 475 unsolved
Search for dead transitions found 0 dead transitions in 60128ms
Starting structural reductions in LTL mode, iteration 1 : 473/483 places, 476/489 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60605 ms. Remains : 473/483 places, 476/489 transitions.
Stuttering acceptance computed with spot in 83 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-28b-LTLCardinality-15
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-28b-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-28b-LTLCardinality-15 finished in 60704 ms.
All properties solved by simple procedures.
Total runtime 490523 ms.
ITS solved all properties within timeout

BK_STOP 1717198978876

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is GPUForwardProgress-PT-28b, 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 r496-tall-171640603700571"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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