Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 20M
-rw-r--r-- 1 mcc users 9.0K May 29 14:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K May 29 14:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 29 14:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 29 14:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 29 14:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.5K May 29 14:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 29 14:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.7K May 29 14:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 75K May 29 14:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 29 14:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K May 29 14:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 29 14:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K May 29 14:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:33 equiv_col
-rw-r--r-- 1 mcc users 11 May 29 14:33 instance
-rw-r--r-- 1 mcc users 6 May 29 14:33 iscolored
-rw-r--r-- 1 mcc users 20M May 29 14:33 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1749303590378

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ViralEpidemic-PT-S04D1C1A06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-06-07 13:39:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-07 13:39:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-07 13:39:53] [INFO ] Load time of PNML (sax parser for PT used): 1117 ms
[2025-06-07 13:39:53] [INFO ] Transformed 32767 places.
[2025-06-07 13:39:53] [INFO ] Transformed 49149 transitions.
[2025-06-07 13:39:53] [INFO ] Found NUPN structural information;
[2025-06-07 13:39:53] [INFO ] Parsed PT model containing 32767 places and 49149 transitions and 114681 arcs in 1498 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 21 ms.
Working with output stream class java.io.PrintStream
FORMULA ViralEpidemic-PT-S04D1C1A06-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ViralEpidemic-PT-S04D1C1A06-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 47 out of 32767 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32767/32767 places, 49149/49149 transitions.
Applied a total of 0 rules in 2742 ms. Remains 32767 /32767 variables (removed 0) and now considering 49149/49149 (removed 0) transitions.
// Phase 1: matrix 49149 rows 32767 cols
[2025-06-07 13:40:05] [INFO ] Invariants computation overflowed in 9205 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 13:40:41] [INFO ] Performed 15974/32767 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2025-06-07 13:41:07] [INFO ] Implicit Places using invariants in 71248 ms returned []
Implicit Place search using SMT only with invariants took 71300 ms to find 0 implicit places.
Running 49148 sub problems to find dead transitions.
// Phase 1: matrix 49149 rows 32767 cols
[2025-06-07 13:41:17] [INFO ] Invariants computation overflowed in 8945 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
SMT process timed out in 255835ms, After SMT, problems are : Problem set: 0 solved, 49148 unsolved
Search for dead transitions found 0 dead transitions in 256047ms
Finished structural reductions in LTL mode , in 1 iterations and 330244 ms. Remains : 32767/32767 places, 49149/49149 transitions.
Support contains 47 out of 32767 places after structural reductions.
[2025-06-07 13:45:25] [INFO ] Flatten gal took : 1457 ms
[2025-06-07 13:45:27] [INFO ] Flatten gal took : 1224 ms
[2025-06-07 13:45:29] [INFO ] Input system was already deterministic with 49149 transitions.
Support contains 43 out of 32767 places (down from 47) after GAL structural reductions.
RANDOM walk for 40000 steps (60 resets) in 10707 ms. (3 steps per ms) remains 9/24 properties
BEST_FIRST walk for 40004 steps (8 resets) in 6158 ms. (6 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 7463 ms. (5 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 5827 ms. (6 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 5503 ms. (7 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 5771 ms. (6 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 5599 ms. (7 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 5406 ms. (7 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 5382 ms. (7 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 5419 ms. (7 steps per ms) remains 9/9 properties
// Phase 1: matrix 49149 rows 32767 cols
[2025-06-07 13:45:55] [INFO ] Invariants computation overflowed in 8434 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem AtomicPropp1 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 18/18 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/18 variables, 0/18 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 65/83 variables, 18/36 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 0/36 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 292/375 variables, 110/146 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/375 variables, 110/256 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/375 variables, 0/256 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 445/820 variables, 152/408 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/820 variables, 152/560 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/820 variables, 0/560 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 943/1763 variables, 320/880 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1763 variables, 320/1200 constraints. Problems are: Problem set: 1 solved, 8 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/1763 variables, 0/1200 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 1790/3553 variables, 600/1800 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3553 variables, 600/2400 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3553 variables, 0/2400 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 16 (OVERLAPS) 3526/7079 variables, 1191/3591 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/7079 variables, 1191/4782 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/7079 variables, 0/4782 constraints. Problems are: Problem set: 1 solved, 8 unsolved
SMT process timed out in 13688ms, After SMT, problems are : Problem set: 1 solved, 8 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 16 out of 32767 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 32767/32767 places, 49149/49149 transitions.
Graph (complete) has 21844 edges and 32767 vertex of which 138 are kept as prefixes of interest. Removing 32629 places using SCC suffix rule.41 ms
Discarding 32629 places :
Also discarding 48792 output transitions
Drop transitions (Output transitions of discarded places.) removed 48792 transitions
Drop transitions (Empty/Sink Transition effects.) removed 232 transitions
Reduce isomorphic transitions removed 232 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 274 rules applied. Total rules applied 275 place count 138 transition count 83
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 317 place count 96 transition count 83
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 317 place count 96 transition count 74
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 335 place count 87 transition count 74
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 365 place count 57 transition count 44
Iterating global reduction 2 with 30 rules applied. Total rules applied 395 place count 57 transition count 44
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 425 place count 42 transition count 29
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 426 place count 41 transition count 28
Ensure Unique test removed 7 places
Iterating post reduction 2 with 7 rules applied. Total rules applied 433 place count 34 transition count 28
Applied a total of 433 rules in 176 ms. Remains 34 /32767 variables (removed 32733) and now considering 28/49149 (removed 49121) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 177 ms. Remains : 34/32767 places, 28/49149 transitions.
RANDOM walk for 262 steps (8 resets) in 10 ms. (23 steps per ms) remains 0/8 properties
FORMULA ViralEpidemic-PT-S04D1C1A06-LTLCardinality-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
Computed a total of 32767 stabilizing places and 49149 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 32767 transition count 49149
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(!p0)))))'
Support contains 2 out of 32767 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32767/32767 places, 49149/49149 transitions.
Applied a total of 0 rules in 2704 ms. Remains 32767 /32767 variables (removed 0) and now considering 49149/49149 (removed 0) transitions.
// Phase 1: matrix 49149 rows 32767 cols
[2025-06-07 13:46:12] [INFO ] Invariants computation overflowed in 8503 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 13:46:47] [INFO ] Performed 16006/32767 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2025-06-07 13:47:17] [INFO ] Performed 32629/32767 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2025-06-07 13:47:17] [INFO ] Implicit Places using invariants in 74149 ms returned []
Implicit Place search using SMT only with invariants took 74153 ms to find 0 implicit places.
Running 49148 sub problems to find dead transitions.
// Phase 1: matrix 49149 rows 32767 cols
[2025-06-07 13:47:26] [INFO ] Invariants computation overflowed in 8737 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
SMT process timed out in 236294ms, After SMT, problems are : Problem set: 0 solved, 49148 unsolved
Search for dead transitions found 0 dead transitions in 236441ms
Finished structural reductions in LTL mode , in 1 iterations and 313394 ms. Remains : 32767/32767 places, 49149/49149 transitions.
Stuttering acceptance computed with spot in 267 ms :[p0, p0, p0, p0]
Running random walk in product with property : ViralEpidemic-PT-S04D1C1A06-LTLCardinality-00
Stuttering criterion allowed to conclude after 687 steps with 0 reset in 122 ms.
FORMULA ViralEpidemic-PT-S04D1C1A06-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S04D1C1A06-LTLCardinality-00 finished in 313933 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((p0||G(p1))))))'
Support contains 4 out of 32767 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32767/32767 places, 49149/49149 transitions.
Applied a total of 0 rules in 1737 ms. Remains 32767 /32767 variables (removed 0) and now considering 49149/49149 (removed 0) transitions.
// Phase 1: matrix 49149 rows 32767 cols
[2025-06-07 13:51:25] [INFO ] Invariants computation overflowed in 8381 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 13:51:59] [INFO ] Performed 17282/32767 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2025-06-07 13:52:21] [INFO ] Implicit Places using invariants in 65231 ms returned []
Implicit Place search using SMT only with invariants took 65233 ms to find 0 implicit places.
Running 49148 sub problems to find dead transitions.
// Phase 1: matrix 49149 rows 32767 cols
[2025-06-07 13:52:30] [INFO ] Invariants computation overflowed in 8525 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
SMT process timed out in 236547ms, After SMT, problems are : Problem set: 0 solved, 49148 unsolved
Search for dead transitions found 0 dead transitions in 236649ms
Finished structural reductions in LTL mode , in 1 iterations and 303718 ms. Remains : 32767/32767 places, 49149/49149 transitions.
Stuttering acceptance computed with spot in 194 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ViralEpidemic-PT-S04D1C1A06-LTLCardinality-01
Entered a terminal (fully accepting) state of product in 6900 steps with 9 reset in 1110 ms.
FORMULA ViralEpidemic-PT-S04D1C1A06-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S04D1C1A06-LTLCardinality-01 finished in 305130 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 32767 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32767/32767 places, 49149/49149 transitions.
Graph (complete) has 21844 edges and 32767 vertex of which 62 are kept as prefixes of interest. Removing 32705 places using SCC suffix rule.38 ms
Discarding 32705 places :
Also discarding 49017 output transitions
Drop transitions (Output transitions of discarded places.) removed 49017 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 61 transition count 113
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 43 place count 37 transition count 52
Iterating global reduction 1 with 24 rules applied. Total rules applied 67 place count 37 transition count 52
Graph (complete) has 21 edges and 37 vertex of which 36 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Iterating post reduction 1 with 1 rules applied. Total rules applied 68 place count 36 transition count 51
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 69 place count 36 transition count 50
Applied a total of 69 rules in 83 ms. Remains 36 /32767 variables (removed 32731) and now considering 50/49149 (removed 49099) transitions.
// Phase 1: matrix 50 rows 36 cols
[2025-06-07 13:56:20] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 13:56:20] [INFO ] Implicit Places using invariants in 111 ms returned []
[2025-06-07 13:56:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 13:56:20] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 153 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 13:56:20] [INFO ] Redundant transitions in 39 ms returned [6, 12, 17, 22]
Found 4 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 4 transitions
Redundant transitions reduction (with SMT) removed 4 transitions.
Running 34 sub problems to find dead transitions.
// Phase 1: matrix 46 rows 36 cols
[2025-06-07 13:56:20] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 1 (OVERLAPS) 43/76 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 3 (OVERLAPS) 4/80 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 5 (OVERLAPS) 2/82 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/82 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 7 (OVERLAPS) 0/82 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 34 unsolved
No progress, stopping.
After SMT solving in domain Real declared 82/82 variables, and 36 constraints, problems are : Problem set: 0 solved, 34 unsolved in 718 ms.
Refiners :[State Equation: 36/36 constraints, PredecessorRefiner: 34/34 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 34 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 1 (OVERLAPS) 43/76 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 34/67 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 4 (OVERLAPS) 4/80 variables, 2/69 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/80 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 6 (OVERLAPS) 2/82 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/82 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 8 (OVERLAPS) 0/82 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 34 unsolved
No progress, stopping.
After SMT solving in domain Int declared 82/82 variables, and 70 constraints, problems are : Problem set: 0 solved, 34 unsolved in 653 ms.
Refiners :[State Equation: 36/36 constraints, PredecessorRefiner: 34/34 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1380ms problems are : Problem set: 0 solved, 34 unsolved
Search for dead transitions found 0 dead transitions in 1381ms
Starting structural reductions in SI_LTL mode, iteration 1 : 36/32767 places, 46/49149 transitions.
Graph (complete) has 21 edges and 36 vertex of which 32 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Applied a total of 1 rules in 5 ms. Remains 32 /36 variables (removed 4) and now considering 42/46 (removed 4) transitions.
// Phase 1: matrix 42 rows 32 cols
[2025-06-07 13:56:21] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 13:56:21] [INFO ] Implicit Places using invariants in 23 ms returned []
[2025-06-07 13:56:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 13:56:21] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 32/32767 places, 42/49149 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1727 ms. Remains : 32/32767 places, 42/49149 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : ViralEpidemic-PT-S04D1C1A06-LTLCardinality-02
Stuttering criterion allowed to conclude after 21 steps with 0 reset in 0 ms.
FORMULA ViralEpidemic-PT-S04D1C1A06-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S04D1C1A06-LTLCardinality-02 finished in 1806 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((F(p1)&&p0))&&X(p1)))'
Support contains 4 out of 32767 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32767/32767 places, 49149/49149 transitions.
Applied a total of 0 rules in 1732 ms. Remains 32767 /32767 variables (removed 0) and now considering 49149/49149 (removed 0) transitions.
// Phase 1: matrix 49149 rows 32767 cols
[2025-06-07 13:56:32] [INFO ] Invariants computation overflowed in 8436 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 13:57:07] [INFO ] Performed 16134/32767 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2025-06-07 13:57:32] [INFO ] Implicit Places using invariants in 68787 ms returned []
Implicit Place search using SMT only with invariants took 68788 ms to find 0 implicit places.
Running 49148 sub problems to find dead transitions.
// Phase 1: matrix 49149 rows 32767 cols
[2025-06-07 13:57:43] [INFO ] Invariants computation overflowed in 11195 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
SMT process timed out in 242803ms, After SMT, problems are : Problem set: 0 solved, 49148 unsolved
Search for dead transitions found 0 dead transitions in 242904ms
Finished structural reductions in LTL mode , in 1 iterations and 313489 ms. Remains : 32767/32767 places, 49149/49149 transitions.
Stuttering acceptance computed with spot in 181 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (OR (NOT p0) (NOT p1)), (NOT p1), true]
Running random walk in product with property : ViralEpidemic-PT-S04D1C1A06-LTLCardinality-03
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 7 ms.
FORMULA ViralEpidemic-PT-S04D1C1A06-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S04D1C1A06-LTLCardinality-03 finished in 313758 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0&&(!p1 U G(p1))))))'
Support contains 4 out of 32767 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32767/32767 places, 49149/49149 transitions.
Graph (complete) has 21844 edges and 32767 vertex of which 117 are kept as prefixes of interest. Removing 32650 places using SCC suffix rule.25 ms
Discarding 32650 places :
Also discarding 48904 output transitions
Drop transitions (Output transitions of discarded places.) removed 48904 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 0 with 26 rules applied. Total rules applied 27 place count 116 transition count 218
Discarding 44 places :
Symmetric choice reduction at 1 with 44 rule applications. Total rules 71 place count 72 transition count 103
Iterating global reduction 1 with 44 rules applied. Total rules applied 115 place count 72 transition count 103
Applied a total of 115 rules in 71 ms. Remains 72 /32767 variables (removed 32695) and now considering 103/49149 (removed 49046) transitions.
// Phase 1: matrix 103 rows 72 cols
[2025-06-07 14:01:35] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 14:01:35] [INFO ] Implicit Places using invariants in 74 ms returned []
[2025-06-07 14:01:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 14:01:35] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 127 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 14:01:35] [INFO ] Redundant transitions in 23 ms returned [12, 17, 30, 43, 51, 68, 71, 79, 83, 87, 91, 101]
Found 12 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 12 transitions
Redundant transitions reduction (with SMT) removed 12 transitions.
Running 70 sub problems to find dead transitions.
// Phase 1: matrix 91 rows 72 cols
[2025-06-07 14:01:35] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 1 (OVERLAPS) 87/155 variables, 68/68 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 3 (OVERLAPS) 6/161 variables, 3/71 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/161 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 5 (OVERLAPS) 2/163 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/163 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 7 (OVERLAPS) 0/163 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Real declared 163/163 variables, and 72 constraints, problems are : Problem set: 0 solved, 70 unsolved in 1059 ms.
Refiners :[State Equation: 72/72 constraints, PredecessorRefiner: 70/70 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 70 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 1 (OVERLAPS) 87/155 variables, 68/68 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 70/138 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 4 (OVERLAPS) 6/161 variables, 3/141 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/161 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 6 (OVERLAPS) 2/163 variables, 1/142 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/163 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 8 (OVERLAPS) 0/163 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Int declared 163/163 variables, and 142 constraints, problems are : Problem set: 0 solved, 70 unsolved in 1791 ms.
Refiners :[State Equation: 72/72 constraints, PredecessorRefiner: 70/70 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2855ms problems are : Problem set: 0 solved, 70 unsolved
Search for dead transitions found 0 dead transitions in 2856ms
Starting structural reductions in SI_LTL mode, iteration 1 : 72/32767 places, 91/49149 transitions.
Graph (complete) has 44 edges and 72 vertex of which 60 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.0 ms
Discarding 12 places :
Also discarding 12 output transitions
Drop transitions (Output transitions of discarded places.) removed 12 transitions
Applied a total of 1 rules in 3 ms. Remains 60 /72 variables (removed 12) and now considering 79/91 (removed 12) transitions.
// Phase 1: matrix 79 rows 60 cols
[2025-06-07 14:01:38] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 14:01:38] [INFO ] Implicit Places using invariants in 25 ms returned []
[2025-06-07 14:01:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 14:01:38] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 60/32767 places, 79/49149 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3162 ms. Remains : 60/32767 places, 79/49149 transitions.
Stuttering acceptance computed with spot in 147 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : ViralEpidemic-PT-S04D1C1A06-LTLCardinality-06
Stuttering criterion allowed to conclude after 913 steps with 19 reset in 6 ms.
FORMULA ViralEpidemic-PT-S04D1C1A06-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S04D1C1A06-LTLCardinality-06 finished in 3351 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Support contains 4 out of 32767 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32767/32767 places, 49149/49149 transitions.
Graph (complete) has 21844 edges and 32767 vertex of which 114 are kept as prefixes of interest. Removing 32653 places using SCC suffix rule.23 ms
Discarding 32653 places :
Also discarding 48915 output transitions
Drop transitions (Output transitions of discarded places.) removed 48915 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 113 transition count 217
Discarding 44 places :
Symmetric choice reduction at 1 with 44 rule applications. Total rules 61 place count 69 transition count 99
Iterating global reduction 1 with 44 rules applied. Total rules applied 105 place count 69 transition count 99
Graph (complete) has 43 edges and 69 vertex of which 67 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Iterating post reduction 1 with 1 rules applied. Total rules applied 106 place count 67 transition count 97
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 107 place count 67 transition count 96
Applied a total of 107 rules in 60 ms. Remains 67 /32767 variables (removed 32700) and now considering 96/49149 (removed 49053) transitions.
// Phase 1: matrix 96 rows 67 cols
[2025-06-07 14:01:39] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 14:01:39] [INFO ] Implicit Places using invariants in 182 ms returned []
[2025-06-07 14:01:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 14:01:39] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 242 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 14:01:39] [INFO ] Redundant transitions in 23 ms returned [11, 15, 19, 32, 36, 46, 60, 72, 84, 86]
Found 10 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 10 transitions
Redundant transitions reduction (with SMT) removed 10 transitions.
Running 68 sub problems to find dead transitions.
// Phase 1: matrix 86 rows 67 cols
[2025-06-07 14:01:39] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 1 (OVERLAPS) 82/145 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/145 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 3 (OVERLAPS) 4/149 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/149 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 5 (OVERLAPS) 2/151 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/151 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 7 (OVERLAPS) 2/153 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/153 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 9 (OVERLAPS) 0/153 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 68 unsolved
No progress, stopping.
After SMT solving in domain Real declared 153/153 variables, and 67 constraints, problems are : Problem set: 0 solved, 68 unsolved in 1443 ms.
Refiners :[State Equation: 67/67 constraints, PredecessorRefiner: 68/68 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 68 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 1 (OVERLAPS) 82/145 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/145 variables, 68/131 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/145 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 4 (OVERLAPS) 4/149 variables, 2/133 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/149 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 6 (OVERLAPS) 2/151 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/151 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 8 (OVERLAPS) 2/153 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/153 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 10 (OVERLAPS) 0/153 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 68 unsolved
No progress, stopping.
After SMT solving in domain Int declared 153/153 variables, and 135 constraints, problems are : Problem set: 0 solved, 68 unsolved in 2058 ms.
Refiners :[State Equation: 67/67 constraints, PredecessorRefiner: 68/68 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3510ms problems are : Problem set: 0 solved, 68 unsolved
Search for dead transitions found 0 dead transitions in 3510ms
Starting structural reductions in SI_LTL mode, iteration 1 : 67/32767 places, 86/49149 transitions.
Graph (complete) has 41 edges and 67 vertex of which 57 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.1 ms
Discarding 10 places :
Also discarding 10 output transitions
Drop transitions (Output transitions of discarded places.) removed 10 transitions
Applied a total of 1 rules in 2 ms. Remains 57 /67 variables (removed 10) and now considering 76/86 (removed 10) transitions.
// Phase 1: matrix 76 rows 57 cols
[2025-06-07 14:01:42] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 14:01:42] [INFO ] Implicit Places using invariants in 25 ms returned []
[2025-06-07 14:01:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 14:01:42] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 57/32767 places, 76/49149 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3931 ms. Remains : 57/32767 places, 76/49149 transitions.
Stuttering acceptance computed with spot in 83 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ViralEpidemic-PT-S04D1C1A06-LTLCardinality-07
Stuttering criterion allowed to conclude after 28 steps with 0 reset in 0 ms.
FORMULA ViralEpidemic-PT-S04D1C1A06-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S04D1C1A06-LTLCardinality-07 finished in 4043 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(X((G(p1)||p0)))))))'
Support contains 3 out of 32767 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32767/32767 places, 49149/49149 transitions.
Applied a total of 0 rules in 2591 ms. Remains 32767 /32767 variables (removed 0) and now considering 49149/49149 (removed 0) transitions.
// Phase 1: matrix 49149 rows 32767 cols
[2025-06-07 14:01:54] [INFO ] Invariants computation overflowed in 8577 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 14:02:29] [INFO ] Performed 16333/32767 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2025-06-07 14:02:54] [INFO ] Implicit Places using invariants in 68467 ms returned []
Implicit Place search using SMT only with invariants took 68469 ms to find 0 implicit places.
Running 49148 sub problems to find dead transitions.
// Phase 1: matrix 49149 rows 32767 cols
[2025-06-07 14:03:03] [INFO ] Invariants computation overflowed in 8734 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
SMT process timed out in 242232ms, After SMT, problems are : Problem set: 0 solved, 49148 unsolved
Search for dead transitions found 0 dead transitions in 242331ms
Finished structural reductions in LTL mode , in 1 iterations and 313457 ms. Remains : 32767/32767 places, 49149/49149 transitions.
Stuttering acceptance computed with spot in 251 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ViralEpidemic-PT-S04D1C1A06-LTLCardinality-08
Product exploration timeout after 52020 steps with 8670 reset in 10001 ms.
Product exploration timeout after 41740 steps with 6956 reset in 10002 ms.
Computed a total of 32767 stabilizing places and 49149 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 32767 transition count 49149
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND p1 p0), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 124 ms. Reduced automaton from 8 states, 10 edges and 2 AP (stutter sensitive) to 8 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 251 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (60 resets) in 7387 ms. (5 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 6011 ms. (6 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 5522 ms. (7 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 5558 ms. (7 steps per ms) remains 3/3 properties
// Phase 1: matrix 49149 rows 32767 cols
[2025-06-07 14:11:34] [INFO ] Invariants computation overflowed in 8644 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 10/13 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/13 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 39/52 variables, 16/22 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 16/38 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 41/93 variables, 14/52 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/93 variables, 14/66 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/93 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 126/219 variables, 42/108 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/219 variables, 42/150 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/219 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 198/417 variables, 66/216 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/417 variables, 66/282 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/417 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 504/921 variables, 168/450 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/921 variables, 168/618 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/921 variables, 0/618 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 786/1707 variables, 263/881 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1707 variables, 263/1144 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1707 variables, 0/1144 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 1957/3664 variables, 655/1799 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/3664 variables, 655/2454 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3664 variables, 0/2454 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (OVERLAPS) 2936/6600 variables, 992/3446 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/6600 variables, 992/4438 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/6600 variables, 0/4438 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (OVERLAPS) 7140/13740 variables, 2436/6874 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/13740 variables, 2436/9310 constraints. Problems are: Problem set: 0 solved, 3 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 13740/81916 variables, and 9310 constraints, problems are : Problem set: 0 solved, 3 unsolved in 5020 ms.
Refiners :[Domain max(s): 4655/32767 constraints, State Equation: 4655/32767 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 10/13 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/13 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 39/52 variables, 16/22 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 16/38 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 3/41 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/52 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 41/93 variables, 14/55 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/93 variables, 14/69 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/93 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 126/219 variables, 42/111 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/219 variables, 42/153 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/219 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 198/417 variables, 66/219 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/417 variables, 66/285 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/417 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 504/921 variables, 168/453 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/921 variables, 168/621 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/921 variables, 0/621 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 786/1707 variables, 263/884 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1707 variables, 263/1147 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1707 variables, 0/1147 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (OVERLAPS) 1957/3664 variables, 655/1802 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3664 variables, 655/2457 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/3664 variables, 0/2457 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (OVERLAPS) 2936/6600 variables, 992/3449 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/6600 variables, 992/4441 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 6600/81916 variables, and 4441 constraints, problems are : Problem set: 0 solved, 3 unsolved in 5014 ms.
Refiners :[Domain max(s): 2219/32767 constraints, State Equation: 2219/32767 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 18795ms problems are : Problem set: 0 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3 out of 32767 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 32767/32767 places, 49149/49149 transitions.
Graph (complete) has 21844 edges and 32767 vertex of which 29 are kept as prefixes of interest. Removing 32738 places using SCC suffix rule.9 ms
Discarding 32738 places :
Also discarding 49073 output transitions
Drop transitions (Output transitions of discarded places.) removed 49073 transitions
Drop transitions (Empty/Sink Transition effects.) removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 61 rules applied. Total rules applied 62 place count 29 transition count 15
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 73 place count 18 transition count 15
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 73 place count 18 transition count 13
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 77 place count 16 transition count 13
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 82 place count 11 transition count 8
Iterating global reduction 2 with 5 rules applied. Total rules applied 87 place count 11 transition count 8
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 91 place count 9 transition count 6
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 92 place count 8 transition count 5
Ensure Unique test removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 93 place count 7 transition count 5
Applied a total of 93 rules in 45 ms. Remains 7 /32767 variables (removed 32760) and now considering 5/49149 (removed 49144) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 7/32767 places, 5/49149 transitions.
RANDOM walk for 113 steps (17 resets) in 5 ms. (18 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p1 p0), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p1)))), (F (NOT p1)), (F (NOT p0)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 3 factoid took 257 ms. Reduced automaton from 8 states, 10 edges and 2 AP (stutter sensitive) to 8 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 314 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 283 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 32767 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32767/32767 places, 49149/49149 transitions.
Applied a total of 0 rules in 2493 ms. Remains 32767 /32767 variables (removed 0) and now considering 49149/49149 (removed 0) transitions.
// Phase 1: matrix 49149 rows 32767 cols
[2025-06-07 14:12:01] [INFO ] Invariants computation overflowed in 12527 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 14:12:36] [INFO ] Performed 16863/32767 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2025-06-07 14:13:02] [INFO ] Implicit Places using invariants in 73473 ms returned []
Implicit Place search using SMT only with invariants took 73476 ms to find 0 implicit places.
Running 49148 sub problems to find dead transitions.
// Phase 1: matrix 49149 rows 32767 cols
[2025-06-07 14:13:10] [INFO ] Invariants computation overflowed in 8544 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
SMT process timed out in 236322ms, After SMT, problems are : Problem set: 0 solved, 49148 unsolved
Search for dead transitions found 0 dead transitions in 236422ms
Finished structural reductions in LTL mode , in 1 iterations and 312461 ms. Remains : 32767/32767 places, 49149/49149 transitions.
Computed a total of 32767 stabilizing places and 49149 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 32767 transition count 49149
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND p1 p0), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 115 ms. Reduced automaton from 8 states, 10 edges and 2 AP (stutter sensitive) to 8 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 322 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (60 resets) in 7460 ms. (5 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 5832 ms. (6 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 5727 ms. (6 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 5704 ms. (7 steps per ms) remains 3/3 properties
// Phase 1: matrix 49149 rows 32767 cols
[2025-06-07 14:21:08] [INFO ] Invariants computation overflowed in 8671 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 10/13 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/13 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 39/52 variables, 16/22 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 16/38 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 41/93 variables, 14/52 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/93 variables, 14/66 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/93 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 126/219 variables, 42/108 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/219 variables, 42/150 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/219 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 198/417 variables, 66/216 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/417 variables, 66/282 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/417 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 504/921 variables, 168/450 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/921 variables, 168/618 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/921 variables, 0/618 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 786/1707 variables, 263/881 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1707 variables, 263/1144 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1707 variables, 0/1144 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 1957/3664 variables, 655/1799 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/3664 variables, 655/2454 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3664 variables, 0/2454 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (OVERLAPS) 2936/6600 variables, 992/3446 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/6600 variables, 992/4438 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/6600 variables, 0/4438 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (OVERLAPS) 7140/13740 variables, 2436/6874 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/13740 variables, 2436/9310 constraints. Problems are: Problem set: 0 solved, 3 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 13740/81916 variables, and 9310 constraints, problems are : Problem set: 0 solved, 3 unsolved in 5018 ms.
Refiners :[Domain max(s): 4655/32767 constraints, State Equation: 4655/32767 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 10/13 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/13 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 39/52 variables, 16/22 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 16/38 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 3/41 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/52 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 41/93 variables, 14/55 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/93 variables, 14/69 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/93 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 126/219 variables, 42/111 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/219 variables, 42/153 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/219 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 198/417 variables, 66/219 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/417 variables, 66/285 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/417 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 504/921 variables, 168/453 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/921 variables, 168/621 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/921 variables, 0/621 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 786/1707 variables, 263/884 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1707 variables, 263/1147 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1707 variables, 0/1147 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (OVERLAPS) 1957/3664 variables, 655/1802 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3664 variables, 655/2457 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/3664 variables, 0/2457 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (OVERLAPS) 2936/6600 variables, 992/3449 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/6600 variables, 992/4441 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 6600/81916 variables, and 4441 constraints, problems are : Problem set: 0 solved, 3 unsolved in 5014 ms.
Refiners :[Domain max(s): 2219/32767 constraints, State Equation: 2219/32767 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 18813ms problems are : Problem set: 0 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3 out of 32767 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 32767/32767 places, 49149/49149 transitions.
Graph (complete) has 21844 edges and 32767 vertex of which 29 are kept as prefixes of interest. Removing 32738 places using SCC suffix rule.13 ms
Discarding 32738 places :
Also discarding 49073 output transitions
Drop transitions (Output transitions of discarded places.) removed 49073 transitions
Drop transitions (Empty/Sink Transition effects.) removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 61 rules applied. Total rules applied 62 place count 29 transition count 15
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 73 place count 18 transition count 15
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 73 place count 18 transition count 13
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 77 place count 16 transition count 13
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 82 place count 11 transition count 8
Iterating global reduction 2 with 5 rules applied. Total rules applied 87 place count 11 transition count 8
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 91 place count 9 transition count 6
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 92 place count 8 transition count 5
Ensure Unique test removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 93 place count 7 transition count 5
Applied a total of 93 rules in 54 ms. Remains 7 /32767 variables (removed 32760) and now considering 5/49149 (removed 49144) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 7/32767 places, 5/49149 transitions.
RANDOM walk for 61 steps (8 resets) in 5 ms. (10 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p1 p0), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p1)))), (F (NOT p1)), (F (NOT p0)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 3 factoid took 239 ms. Reduced automaton from 8 states, 10 edges and 2 AP (stutter sensitive) to 8 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 289 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 339 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 310 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration timeout after 52390 steps with 8731 reset in 10001 ms.
Product exploration timeout after 42800 steps with 7133 reset in 10002 ms.
Applying partial POR strategy [true, true, true, false, false, false, false, false]
Stuttering acceptance computed with spot in 290 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 32767 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32767/32767 places, 49149/49149 transitions.
Graph (complete) has 21844 edges and 32767 vertex of which 88 are kept as prefixes of interest. Removing 32679 places using SCC suffix rule.17 ms
Discarding 32679 places :
Also discarding 48965 output transitions
Drop transitions (Output transitions of discarded places.) removed 48965 transitions
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 23 place count 88 transition count 162
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 57 place count 54 transition count 75
Iterating global reduction 1 with 34 rules applied. Total rules applied 91 place count 54 transition count 75
Applied a total of 91 rules in 57 ms. Remains 54 /32767 variables (removed 32713) and now considering 75/49149 (removed 49074) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 14:21:40] [INFO ] Redundant transitions in 14 ms returned [16, 23, 27, 45, 61]
Found 5 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT only with invariants) removed 5 transitions
Redundant transitions reduction (with SMT) removed 5 transitions.
Running 59 sub problems to find dead transitions.
// Phase 1: matrix 70 rows 54 cols
[2025-06-07 14:21:40] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (OVERLAPS) 70/123 variables, 53/53 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (OVERLAPS) 1/124 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 5 (OVERLAPS) 0/124 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Real declared 124/124 variables, and 54 constraints, problems are : Problem set: 0 solved, 59 unsolved in 847 ms.
Refiners :[State Equation: 54/54 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 59 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (OVERLAPS) 70/123 variables, 53/53 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 59/112 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 4 (OVERLAPS) 1/124 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (OVERLAPS) 0/124 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Int declared 124/124 variables, and 113 constraints, problems are : Problem set: 0 solved, 59 unsolved in 1030 ms.
Refiners :[State Equation: 54/54 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1880ms problems are : Problem set: 0 solved, 59 unsolved
Search for dead transitions found 0 dead transitions in 1881ms
Starting structural reductions in SI_LTL mode, iteration 1 : 54/32767 places, 70/49149 transitions.
Graph (complete) has 34 edges and 54 vertex of which 49 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.0 ms
Discarding 5 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Applied a total of 1 rules in 3 ms. Remains 49 /54 variables (removed 5) and now considering 65/70 (removed 5) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 49/32767 places, 65/49149 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1960 ms. Remains : 49/32767 places, 65/49149 transitions.
Built C files in :
/tmp/ltsmin15899401696625242973
[2025-06-07 14:21:42] [INFO ] Built C files in 431ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15899401696625242973
Running compilation step : cd /tmp/ltsmin15899401696625242973;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15899401696625242973;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15899401696625242973;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 3 out of 32767 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32767/32767 places, 49149/49149 transitions.
Applied a total of 0 rules in 1714 ms. Remains 32767 /32767 variables (removed 0) and now considering 49149/49149 (removed 0) transitions.
// Phase 1: matrix 49149 rows 32767 cols
[2025-06-07 14:21:56] [INFO ] Invariants computation overflowed in 8396 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 14:22:31] [INFO ] Performed 16854/32767 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2025-06-07 14:22:56] [INFO ] Implicit Places using invariants in 67488 ms returned []
Implicit Place search using SMT only with invariants took 67493 ms to find 0 implicit places.
Running 49148 sub problems to find dead transitions.
// Phase 1: matrix 49149 rows 32767 cols
[2025-06-07 14:23:04] [INFO ] Invariants computation overflowed in 8329 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
SMT process timed out in 227599ms, After SMT, problems are : Problem set: 0 solved, 49148 unsolved
Search for dead transitions found 0 dead transitions in 227734ms
Finished structural reductions in LTL mode , in 1 iterations and 297010 ms. Remains : 32767/32767 places, 49149/49149 transitions.
Built C files in :
/tmp/ltsmin5913355663820920105
[2025-06-07 14:26:44] [INFO ] Built C files in 348ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5913355663820920105
Running compilation step : cd /tmp/ltsmin5913355663820920105;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5913355663820920105;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5913355663820920105;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2025-06-07 14:26:49] [INFO ] Flatten gal took : 1076 ms
[2025-06-07 14:26:50] [INFO ] Flatten gal took : 1101 ms
[2025-06-07 14:26:50] [INFO ] Time to serialize gal into /tmp/LTL6323390574950063297.gal : 230 ms
[2025-06-07 14:26:50] [INFO ] Time to serialize properties into /tmp/LTL1937578359404718924.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6323390574950063297.gal' '-t' 'CGAL' '-hoa' '/tmp/aut359351918048051977.hoa' '-atoms' '/tmp/LTL1937578359404718924.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...316
Detected timeout of ITS tools.
[2025-06-07 14:27:07] [INFO ] Flatten gal took : 1044 ms
[2025-06-07 14:27:08] [INFO ] Flatten gal took : 1317 ms
[2025-06-07 14:27:08] [INFO ] Time to serialize gal into /tmp/LTL17939303180752014163.gal : 161 ms
[2025-06-07 14:27:08] [INFO ] Time to serialize properties into /tmp/LTL6079814077900349296.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17939303180752014163.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6079814077900349296.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Detected timeout of ITS tools.
[2025-06-07 14:27:25] [INFO ] Flatten gal took : 1249 ms
[2025-06-07 14:27:25] [INFO ] Applying decomposition
[2025-06-07 14:27:26] [INFO ] Flatten gal took : 1058 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph8642437598275531515.txt' '-o' '/tmp/graph8642437598275531515.bin' '-w' '/tmp/graph8642437598275531515.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph8642437598275531515.bin' '-l' '-1' '-v' '-w' '/tmp/graph8642437598275531515.weights' '-q' '0' '-e' '0.001'
[2025-06-07 14:27:28] [INFO ] Decomposing Gal with order
[2025-06-07 14:27:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 14:37:02] [INFO ] Removed a total of 54889 redundant transitions.
[2025-06-07 14:37:03] [INFO ] Flatten gal took : 2649 ms
[2025-06-07 14:37:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 38878 labels/synchronizations in 13440 ms.
[2025-06-07 14:37:17] [INFO ] Time to serialize gal into /tmp/LTL14273045345114009892.gal : 252 ms
[2025-06-07 14:37:17] [INFO ] Time to serialize properties into /tmp/LTL11865787013373556846.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14273045345114009892.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11865787013373556846.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X(X(X(X(X(("((i4347.u6137.patient1244441==0)||(u6052.cFactor6241324==1))")||(G("(i1046.u1466.patient2232122==0)")))))))))
Formula 0 simplified : XXXXX(!"((i4347.u6137.patient1244441==0)||(u6052.cFactor6241324==1))" & F!"(i1046.u1466.patient2232122==0)")
Detected timeout of ITS tools.
Treatment of property ViralEpidemic-PT-S04D1C1A06-LTLCardinality-08 finished in 2149973 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(p0))&&((F(p1)&&F(p2)) U p3)))'
Support contains 6 out of 32767 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32767/32767 places, 49149/49149 transitions.
Applied a total of 0 rules in 1946 ms. Remains 32767 /32767 variables (removed 0) and now considering 49149/49149 (removed 0) transitions.
// Phase 1: matrix 49149 rows 32767 cols
[2025-06-07 14:37:43] [INFO ] Invariants computation overflowed in 8766 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 14:38:19] [INFO ] Performed 17215/32767 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2025-06-07 14:38:43] [INFO ] Implicit Places using invariants in 68186 ms returned []
Implicit Place search using SMT only with invariants took 68191 ms to find 0 implicit places.
Running 49148 sub problems to find dead transitions.
// Phase 1: matrix 49149 rows 32767 cols
[2025-06-07 14:38:52] [INFO ] Invariants computation overflowed in 8818 ms

BK_TIME_CONFINEMENT_REACHED

--------------------
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="ViralEpidemic-PT-S04D1C1A06"
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 ViralEpidemic-PT-S04D1C1A06, 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 r240-tall-174915590800995"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ViralEpidemic-PT-S04D1C1A06.tgz
mv ViralEpidemic-PT-S04D1C1A06 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 ;