Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r066-tall-177946967500115.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-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-5973
Executing tool itstools
Input is CloudReconfiguration-PT-301, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r066-tall-177946967500115
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 6.2K Mar 6 08:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Mar 6 08:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Mar 6 08:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Mar 6 08:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Mar 15 08:21 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 15 08:21 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 15 08:21 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 08:21 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Mar 6 08:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 168K Mar 6 08:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Mar 6 08:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Mar 6 08:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 15 08:21 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 08:21 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 660K Mar 3 18:30 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 CloudReconfiguration-PT-301-LTLCardinality-00
FORMULA_NAME CloudReconfiguration-PT-301-LTLCardinality-01
FORMULA_NAME CloudReconfiguration-PT-301-LTLCardinality-02
FORMULA_NAME CloudReconfiguration-PT-301-LTLCardinality-03
FORMULA_NAME CloudReconfiguration-PT-301-LTLCardinality-04
FORMULA_NAME CloudReconfiguration-PT-301-LTLCardinality-05
FORMULA_NAME CloudReconfiguration-PT-301-LTLCardinality-06
FORMULA_NAME CloudReconfiguration-PT-301-LTLCardinality-07
FORMULA_NAME CloudReconfiguration-PT-301-LTLCardinality-08
FORMULA_NAME CloudReconfiguration-PT-301-LTLCardinality-09
FORMULA_NAME CloudReconfiguration-PT-301-LTLCardinality-10
FORMULA_NAME CloudReconfiguration-PT-301-LTLCardinality-11
FORMULA_NAME CloudReconfiguration-PT-301-LTLCardinality-12
FORMULA_NAME CloudReconfiguration-PT-301-LTLCardinality-13
FORMULA_NAME CloudReconfiguration-PT-301-LTLCardinality-14
FORMULA_NAME CloudReconfiguration-PT-301-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1779496932130

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CloudReconfiguration-PT-301
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202604301425
[2026-05-23 00:42:13] [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]
[2026-05-23 00:42:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 00:42:13] [INFO ] Load time of PNML (sax parser for PT used): 151 ms
[2026-05-23 00:42:13] [INFO ] Transformed 2584 places.
[2026-05-23 00:42:13] [INFO ] Transformed 3094 transitions.
[2026-05-23 00:42:13] [INFO ] Found NUPN structural information;
[2026-05-23 00:42:13] [INFO ] Parsed PT model containing 2584 places and 3094 transitions and 6459 arcs in 251 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA CloudReconfiguration-PT-301-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-301-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-301-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-301-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-301-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-301-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-301-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-301-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 2584 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2584/2584 places, 3094/3094 transitions.
Discarding 515 places :
Symmetric choice reduction at 0 with 515 rule applications. Total rules 515 place count 2069 transition count 2579
Iterating global reduction 0 with 515 rules applied. Total rules applied 1030 place count 2069 transition count 2579
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 0 with 29 rules applied. Total rules applied 1059 place count 2069 transition count 2550
Discarding 237 places :
Symmetric choice reduction at 1 with 237 rule applications. Total rules 1296 place count 1832 transition count 2313
Iterating global reduction 1 with 237 rules applied. Total rules applied 1533 place count 1832 transition count 2313
Discarding 87 places :
Symmetric choice reduction at 1 with 87 rule applications. Total rules 1620 place count 1745 transition count 2226
Iterating global reduction 1 with 87 rules applied. Total rules applied 1707 place count 1745 transition count 2226
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 1725 place count 1745 transition count 2208
Discarding 46 places :
Symmetric choice reduction at 2 with 46 rule applications. Total rules 1771 place count 1699 transition count 2162
Iterating global reduction 2 with 46 rules applied. Total rules applied 1817 place count 1699 transition count 2162
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 1825 place count 1699 transition count 2154
Discarding 36 places :
Symmetric choice reduction at 3 with 36 rule applications. Total rules 1861 place count 1663 transition count 2113
Iterating global reduction 3 with 36 rules applied. Total rules applied 1897 place count 1663 transition count 2113
Discarding 27 places :
Symmetric choice reduction at 3 with 27 rule applications. Total rules 1924 place count 1636 transition count 2086
Iterating global reduction 3 with 27 rules applied. Total rules applied 1951 place count 1636 transition count 2086
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 1975 place count 1612 transition count 2062
Iterating global reduction 3 with 24 rules applied. Total rules applied 1999 place count 1612 transition count 2062
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 2021 place count 1590 transition count 2040
Iterating global reduction 3 with 22 rules applied. Total rules applied 2043 place count 1590 transition count 2040
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 2061 place count 1572 transition count 2011
Iterating global reduction 3 with 18 rules applied. Total rules applied 2079 place count 1572 transition count 2011
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 2086 place count 1565 transition count 1999
Iterating global reduction 3 with 7 rules applied. Total rules applied 2093 place count 1565 transition count 1999
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 2100 place count 1558 transition count 1990
Iterating global reduction 3 with 7 rules applied. Total rules applied 2107 place count 1558 transition count 1990
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 2110 place count 1558 transition count 1987
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 2111 place count 1557 transition count 1986
Iterating global reduction 4 with 1 rules applied. Total rules applied 2112 place count 1557 transition count 1986
Applied a total of 2112 rules in 1650 ms. Remains 1557 /2584 variables (removed 1027) and now considering 1986/3094 (removed 1108) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3317216688234518664.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9522050872454206447.kers'
[2026-05-23 00:42:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3317216688234518664.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9522050872454206447.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1986 rows 1557 cols 4147 entries
Finished phase 1 with 1552 SingleSign rule and 1 generalized
[2026-05-23 00:42:15] [INFO ] Computed 4 invariants in 9 ms
Computed 4 P flows in 10 ms.
Exported basis to /tmp/petrispot-output-9522050872454206447.kers
Total runtime 11 ms.
[2026-05-23 00:42:15] [INFO ] Implicit Places using invariants in 501 ms returned []
[2026-05-23 00:42:15] [INFO ] Invariant cache hit.
[2026-05-23 00:42:17] [INFO ] Implicit Places using invariants and state equation in 1093 ms returned []
Implicit Place search using SMT with State Equation took 1627 ms to find 0 implicit places.
Running 1985 sub problems to find dead transitions.
[2026-05-23 00:42:17] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/1556 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1985 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1556/3543 variables, and 4 constraints, problems are : Problem set: 0 solved, 1985 unsolved in 30067 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1557 constraints, PredecessorRefiner: 1985/1985 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1985 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1556 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1985 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 1556/3543 variables, and 4 constraints, problems are : Problem set: 0 solved, 1985 unsolved in 30038 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1557 constraints, PredecessorRefiner: 0/1985 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60640ms problems are : Problem set: 0 solved, 1985 unsolved
Search for dead transitions found 0 dead transitions in 60661ms
Starting structural reductions in LTL mode, iteration 1 : 1557/2584 places, 1986/3094 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63984 ms. Remains : 1557/2584 places, 1986/3094 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1557/1557 places, 1986/1986 transitions.
Applied a total of 0 rules in 62 ms. Remains 1557 /1557 variables (removed 0) and now considering 1986/1986 (removed 0) transitions.
[2026-05-23 00:43:17] [INFO ] Invariant cache hit.
[2026-05-23 00:43:18] [INFO ] Implicit Places using invariants in 257 ms returned []
[2026-05-23 00:43:18] [INFO ] Invariant cache hit.
[2026-05-23 00:43:19] [INFO ] Implicit Places using invariants and state equation in 1044 ms returned []
Implicit Place search using SMT with State Equation took 1303 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 1366 ms. Remains : 1557/1557 places, 1986/1986 transitions.
Support contains 33 out of 1557 places after structural reductions.
[2026-05-23 00:43:19] [INFO ] Flatten gal took : 120 ms
[2026-05-23 00:43:19] [INFO ] Flatten gal took : 66 ms
[2026-05-23 00:43:19] [INFO ] Input system was already deterministic with 1986 transitions.
Reduction of identical properties reduced properties to check from 18 to 17
RANDOM walk for 40000 steps (305 resets) in 1378 ms. (29 steps per ms) remains 13/17 properties
BEST_FIRST walk for 40004 steps (84 resets) in 263 ms. (151 steps per ms) remains 12/13 properties
BEST_FIRST walk for 40003 steps (77 resets) in 121 ms. (327 steps per ms) remains 11/12 properties
BEST_FIRST walk for 40002 steps (83 resets) in 91 ms. (434 steps per ms) remains 10/11 properties
BEST_FIRST walk for 40001 steps (78 resets) in 119 ms. (333 steps per ms) remains 9/10 properties
BEST_FIRST walk for 40002 steps (80 resets) in 86 ms. (459 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (84 resets) in 88 ms. (449 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (79 resets) in 124 ms. (320 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (82 resets) in 111 ms. (357 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (80 resets) in 96 ms. (412 steps per ms) remains 9/9 properties
[2026-05-23 00:43:20] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 1529/1546 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1546 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 1976/3522 variables, 1546/1550 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3522 variables, 0/1550 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 2/3524 variables, 1/1551 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3524 variables, 0/1551 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 2/3526 variables, 1/1552 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3526 variables, 0/1552 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 2/3528 variables, 1/1553 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3528 variables, 0/1553 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 2/3530 variables, 1/1554 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3530 variables, 0/1554 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (OVERLAPS) 2/3532 variables, 1/1555 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3532 variables, 0/1555 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (OVERLAPS) 2/3534 variables, 1/1556 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3534 variables, 0/1556 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 17 (OVERLAPS) 2/3536 variables, 1/1557 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3536 variables, 0/1557 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 19 (OVERLAPS) 2/3538 variables, 1/1558 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3538 variables, 0/1558 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 21 (OVERLAPS) 2/3540 variables, 1/1559 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3540 variables, 0/1559 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 23 (OVERLAPS) 2/3542 variables, 1/1560 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3542 variables, 0/1560 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 25 (OVERLAPS) 1/3543 variables, 1/1561 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3543/3543 variables, and 1561 constraints, problems are : Problem set: 0 solved, 9 unsolved in 5014 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1557/1557 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 1529/1546 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1546 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 1976/3522 variables, 1546/1550 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3522 variables, 9/1559 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3522 variables, 0/1559 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 2/3524 variables, 1/1560 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3524 variables, 0/1560 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 2/3526 variables, 1/1561 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3526 variables, 0/1561 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 2/3528 variables, 1/1562 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3528 variables, 0/1562 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (OVERLAPS) 2/3530 variables, 1/1563 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3530/3543 variables, and 1563 constraints, problems are : Problem set: 0 solved, 9 unsolved in 5013 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1550/1557 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10042ms problems are : Problem set: 0 solved, 9 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 17 out of 1557 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1557/1557 places, 1986/1986 transitions.
Graph (trivial) has 1864 edges and 1557 vertex of which 674 / 1557 are part of one of the 63 SCC in 13 ms
Free SCC test removed 611 places
Drop transitions (Empty/Sink Transition effects.) removed 770 transitions
Reduce isomorphic transitions removed 770 transitions.
Graph (complete) has 1391 edges and 946 vertex of which 937 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.3 ms
Discarding 9 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 513 transitions
Trivial Post-agglo rules discarded 513 transitions
Performed 513 trivial Post agglomeration. Transition count delta: 513
Iterating post reduction 0 with 520 rules applied. Total rules applied 522 place count 937 transition count 692
Reduce places removed 513 places and 0 transitions.
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 1 with 574 rules applied. Total rules applied 1096 place count 424 transition count 631
Reduce places removed 40 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 44 rules applied. Total rules applied 1140 place count 384 transition count 627
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 1145 place count 380 transition count 626
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 46 Pre rules applied. Total rules applied 1145 place count 380 transition count 580
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 4 with 92 rules applied. Total rules applied 1237 place count 334 transition count 580
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 1245 place count 326 transition count 570
Iterating global reduction 4 with 8 rules applied. Total rules applied 1253 place count 326 transition count 570
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 1259 place count 320 transition count 564
Iterating global reduction 4 with 6 rules applied. Total rules applied 1265 place count 320 transition count 564
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 1271 place count 320 transition count 558
Performed 165 Post agglomeration using F-continuation condition with reduction of 98 identical transitions.
Deduced a syphon composed of 165 places in 1 ms
Reduce places removed 165 places and 0 transitions.
Iterating global reduction 5 with 330 rules applied. Total rules applied 1601 place count 155 transition count 295
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 21 rules applied. Total rules applied 1622 place count 155 transition count 274
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 1624 place count 154 transition count 273
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 1627 place count 151 transition count 270
Iterating global reduction 7 with 3 rules applied. Total rules applied 1630 place count 151 transition count 270
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 7 with 14 rules applied. Total rules applied 1644 place count 144 transition count 263
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 1652 place count 144 transition count 255
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1654 place count 143 transition count 254
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 1657 place count 143 transition count 251
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 1659 place count 142 transition count 250
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 1660 place count 142 transition count 249
Performed 34 Post agglomeration using F-continuation condition with reduction of 10 identical transitions.
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 10 with 68 rules applied. Total rules applied 1728 place count 108 transition count 281
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 35 transitions.
Iterating post reduction 10 with 35 rules applied. Total rules applied 1763 place count 108 transition count 246
Discarding 22 places :
Symmetric choice reduction at 11 with 22 rule applications. Total rules 1785 place count 86 transition count 210
Iterating global reduction 11 with 22 rules applied. Total rules applied 1807 place count 86 transition count 210
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 11 with 10 rules applied. Total rules applied 1817 place count 86 transition count 200
Discarding 3 places :
Symmetric choice reduction at 12 with 3 rule applications. Total rules 1820 place count 83 transition count 194
Iterating global reduction 12 with 3 rules applied. Total rules applied 1823 place count 83 transition count 194
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 1825 place count 83 transition count 192
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 13 with 19 rules applied. Total rules applied 1844 place count 83 transition count 173
Discarding 1 places :
Symmetric choice reduction at 13 with 1 rule applications. Total rules 1845 place count 82 transition count 172
Iterating global reduction 13 with 1 rules applied. Total rules applied 1846 place count 82 transition count 172
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 1848 place count 81 transition count 171
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 1849 place count 81 transition count 170
Free-agglomeration rule applied 9 times.
Iterating global reduction 13 with 9 rules applied. Total rules applied 1858 place count 81 transition count 161
Reduce places removed 9 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 13 with 10 rules applied. Total rules applied 1868 place count 72 transition count 160
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 14 with 4 rules applied. Total rules applied 1872 place count 72 transition count 156
Partial Free-agglomeration rule applied 11 times.
Drop transitions (Partial Free agglomeration) removed 11 transitions
Iterating global reduction 14 with 11 rules applied. Total rules applied 1883 place count 72 transition count 156
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 14 with 6 rules applied. Total rules applied 1889 place count 72 transition count 150
Discarding 1 places :
Symmetric choice reduction at 14 with 1 rule applications. Total rules 1890 place count 71 transition count 149
Iterating global reduction 14 with 1 rules applied. Total rules applied 1891 place count 71 transition count 149
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 14 with 1 rules applied. Total rules applied 1892 place count 70 transition count 148
Applied a total of 1892 rules in 174 ms. Remains 70 /1557 variables (removed 1487) and now considering 148/1986 (removed 1838) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 174 ms. Remains : 70/1557 places, 148/1986 transitions.
RANDOM walk for 22275 steps (298 resets) in 311 ms. (71 steps per ms) remains 0/9 properties
FORMULA CloudReconfiguration-PT-301-LTLCardinality-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 26 stabilizing places and 28 stable transitions
Graph (complete) has 2166 edges and 1557 vertex of which 1548 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.22 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p0) U p1) U (G((G(p0) U p1))||(!p2&&(G(p0) U p1)))))'
Support contains 6 out of 1557 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1557/1557 places, 1986/1986 transitions.
Graph (trivial) has 1885 edges and 1557 vertex of which 689 / 1557 are part of one of the 63 SCC in 3 ms
Free SCC test removed 626 places
Ensure Unique test removed 726 transitions
Reduce isomorphic transitions removed 726 transitions.
Graph (complete) has 1434 edges and 931 vertex of which 922 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.3 ms
Discarding 9 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 504 transitions
Trivial Post-agglo rules discarded 504 transitions
Performed 504 trivial Post agglomeration. Transition count delta: 504
Iterating post reduction 0 with 504 rules applied. Total rules applied 506 place count 921 transition count 750
Reduce places removed 504 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 528 rules applied. Total rules applied 1034 place count 417 transition count 726
Reduce places removed 12 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 14 rules applied. Total rules applied 1048 place count 405 transition count 724
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1050 place count 403 transition count 724
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 45 Pre rules applied. Total rules applied 1050 place count 403 transition count 679
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 4 with 90 rules applied. Total rules applied 1140 place count 358 transition count 679
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 1155 place count 343 transition count 658
Iterating global reduction 4 with 15 rules applied. Total rules applied 1170 place count 343 transition count 658
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 1172 place count 343 transition count 656
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1173 place count 342 transition count 656
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 1183 place count 332 transition count 643
Iterating global reduction 6 with 10 rules applied. Total rules applied 1193 place count 332 transition count 643
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 8 rules applied. Total rules applied 1201 place count 332 transition count 635
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1202 place count 331 transition count 635
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1203 place count 330 transition count 633
Iterating global reduction 8 with 1 rules applied. Total rules applied 1204 place count 330 transition count 633
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1205 place count 329 transition count 631
Iterating global reduction 8 with 1 rules applied. Total rules applied 1206 place count 329 transition count 631
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1207 place count 328 transition count 629
Iterating global reduction 8 with 1 rules applied. Total rules applied 1208 place count 328 transition count 629
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1209 place count 327 transition count 627
Iterating global reduction 8 with 1 rules applied. Total rules applied 1210 place count 327 transition count 627
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1211 place count 326 transition count 625
Iterating global reduction 8 with 1 rules applied. Total rules applied 1212 place count 326 transition count 625
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1213 place count 325 transition count 618
Iterating global reduction 8 with 1 rules applied. Total rules applied 1214 place count 325 transition count 618
Performed 156 Post agglomeration using F-continuation condition with reduction of 86 identical transitions.
Deduced a syphon composed of 156 places in 1 ms
Reduce places removed 156 places and 0 transitions.
Iterating global reduction 8 with 312 rules applied. Total rules applied 1526 place count 169 transition count 376
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 8 with 13 rules applied. Total rules applied 1539 place count 169 transition count 363
Discarding 5 places :
Symmetric choice reduction at 9 with 5 rule applications. Total rules 1544 place count 164 transition count 356
Iterating global reduction 9 with 5 rules applied. Total rules applied 1549 place count 164 transition count 356
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1550 place count 163 transition count 354
Iterating global reduction 9 with 1 rules applied. Total rules applied 1551 place count 163 transition count 354
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1552 place count 162 transition count 352
Iterating global reduction 9 with 1 rules applied. Total rules applied 1553 place count 162 transition count 352
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1554 place count 161 transition count 350
Iterating global reduction 9 with 1 rules applied. Total rules applied 1555 place count 161 transition count 350
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1556 place count 160 transition count 348
Iterating global reduction 9 with 1 rules applied. Total rules applied 1557 place count 160 transition count 348
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1558 place count 159 transition count 341
Iterating global reduction 9 with 1 rules applied. Total rules applied 1559 place count 159 transition count 341
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 9 with 18 rules applied. Total rules applied 1577 place count 150 transition count 332
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 9 with 8 rules applied. Total rules applied 1585 place count 150 transition count 324
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -34
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 10 with 36 rules applied. Total rules applied 1621 place count 132 transition count 358
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 10 with 18 rules applied. Total rules applied 1639 place count 132 transition count 340
Discarding 9 places :
Symmetric choice reduction at 11 with 9 rule applications. Total rules 1648 place count 123 transition count 322
Iterating global reduction 11 with 9 rules applied. Total rules applied 1657 place count 123 transition count 322
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 11 with 4 rules applied. Total rules applied 1661 place count 123 transition count 318
Drop transitions (Redundant composition of simpler transitions.) removed 37 transitions
Redundant transition composition rules discarded 37 transitions
Iterating global reduction 12 with 37 rules applied. Total rules applied 1698 place count 123 transition count 281
Partial Post-agglomeration rule applied 4 times.
Drop transitions (Partial Post agglomeration) removed 4 transitions
Iterating global reduction 12 with 4 rules applied. Total rules applied 1702 place count 123 transition count 281
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 1703 place count 123 transition count 280
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 1704 place count 122 transition count 279
Applied a total of 1704 rules in 163 ms. Remains 122 /1557 variables (removed 1435) and now considering 279/1986 (removed 1707) transitions.
[2026-05-23 00:43:31] [INFO ] Flow matrix only has 222 transitions (discarded 57 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3409741528845777396.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7250908506724856514.kers'
[2026-05-23 00:43:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3409741528845777396.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7250908506724856514.kers]
Normalized transition count is 221 out of 222 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 221 rows 122 cols 632 entries
Finished phase 1 with 122 SingleSign rule and 0 generalized
[2026-05-23 00:43:31] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7250908506724856514.kers
Total runtime 1 ms.
[2026-05-23 00:43:31] [INFO ] Implicit Places using invariants in 56 ms returned []
[2026-05-23 00:43:31] [INFO ] Flow matrix only has 222 transitions (discarded 57 similar events)
[2026-05-23 00:43:31] [INFO ] Invariant cache hit.
[2026-05-23 00:43:31] [INFO ] State equation strengthened by 3 read => feed constraints.
[2026-05-23 00:43:31] [INFO ] Implicit Places using invariants and state equation in 206 ms returned [8, 41, 74]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 266 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 119/1557 places, 279/1986 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 117 transition count 277
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 116 transition count 276
Applied a total of 3 rules in 13 ms. Remains 116 /119 variables (removed 3) and now considering 276/279 (removed 3) transitions.
[2026-05-23 00:43:31] [INFO ] Flow matrix only has 219 transitions (discarded 57 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14615292085622808001.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1603958425420770899.kers'
[2026-05-23 00:43:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14615292085622808001.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1603958425420770899.kers]
Normalized transition count is 218 out of 219 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 218 rows 116 cols 617 entries
Finished phase 1 with 116 SingleSign rule and 0 generalized
[2026-05-23 00:43:31] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-1603958425420770899.kers
Total runtime 1 ms.
[2026-05-23 00:43:31] [INFO ] Implicit Places using invariants in 49 ms returned []
[2026-05-23 00:43:31] [INFO ] Flow matrix only has 219 transitions (discarded 57 similar events)
[2026-05-23 00:43:31] [INFO ] Invariant cache hit.
[2026-05-23 00:43:31] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-23 00:43:31] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 140 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 116/1557 places, 276/1986 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 583 ms. Remains : 116/1557 places, 276/1986 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p0) U p1) U (G((G(p0) U p1))||(!p2&&(G(p0) U p1)))))'
Stuttering acceptance computed with spot in 344 ms :[(NOT p1), true, (NOT p0), (NOT p1)]
Running random walk in product with property : CloudReconfiguration-PT-301-LTLCardinality-00
Stuttering criterion allowed to conclude after 90467 steps with 9180 reset in 258 ms.
FORMULA CloudReconfiguration-PT-301-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-301-LTLCardinality-00 finished in 1253 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 1557 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1557/1557 places, 1986/1986 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 1542 transition count 1971
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 1542 transition count 1971
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 40 place count 1532 transition count 1960
Iterating global reduction 0 with 10 rules applied. Total rules applied 50 place count 1532 transition count 1960
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 56 place count 1526 transition count 1953
Iterating global reduction 0 with 6 rules applied. Total rules applied 62 place count 1526 transition count 1953
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 67 place count 1521 transition count 1947
Iterating global reduction 0 with 5 rules applied. Total rules applied 72 place count 1521 transition count 1947
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 73 place count 1521 transition count 1946
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 76 place count 1518 transition count 1942
Iterating global reduction 1 with 3 rules applied. Total rules applied 79 place count 1518 transition count 1942
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 81 place count 1516 transition count 1940
Iterating global reduction 1 with 2 rules applied. Total rules applied 83 place count 1516 transition count 1940
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 84 place count 1515 transition count 1939
Iterating global reduction 1 with 1 rules applied. Total rules applied 85 place count 1515 transition count 1939
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 86 place count 1514 transition count 1938
Iterating global reduction 1 with 1 rules applied. Total rules applied 87 place count 1514 transition count 1938
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 88 place count 1513 transition count 1936
Iterating global reduction 1 with 1 rules applied. Total rules applied 89 place count 1513 transition count 1936
Applied a total of 89 rules in 598 ms. Remains 1513 /1557 variables (removed 44) and now considering 1936/1986 (removed 50) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12188757958865833842.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9604823559779930501.kers'
[2026-05-23 00:43:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12188757958865833842.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9604823559779930501.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1936 rows 1513 cols 4043 entries
Finished phase 1 with 1508 SingleSign rule and 1 generalized
[2026-05-23 00:43:32] [INFO ] Computed 4 invariants in 9 ms
Computed 4 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-9604823559779930501.kers
Total runtime 11 ms.
[2026-05-23 00:43:33] [INFO ] Implicit Places using invariants in 249 ms returned []
[2026-05-23 00:43:33] [INFO ] Invariant cache hit.
[2026-05-23 00:43:34] [INFO ] Implicit Places using invariants and state equation in 945 ms returned []
Implicit Place search using SMT with State Equation took 1197 ms to find 0 implicit places.
Running 1935 sub problems to find dead transitions.
[2026-05-23 00:43:34] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/1512 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1935 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1512/3449 variables, and 4 constraints, problems are : Problem set: 0 solved, 1935 unsolved in 30038 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1513 constraints, PredecessorRefiner: 1935/1935 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1935 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1512 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1935 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1512/3449 variables, and 4 constraints, problems are : Problem set: 0 solved, 1935 unsolved in 30042 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1513 constraints, PredecessorRefiner: 0/1935 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60478ms problems are : Problem set: 0 solved, 1935 unsolved
Search for dead transitions found 0 dead transitions in 60484ms
Starting structural reductions in LTL mode, iteration 1 : 1513/1557 places, 1936/1986 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62290 ms. Remains : 1513/1557 places, 1936/1986 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Stuttering acceptance computed with spot in 125 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CloudReconfiguration-PT-301-LTLCardinality-03
Product exploration explored 100000 steps with 33333 reset in 318 ms.
Product exploration explored 100000 steps with 33333 reset in 354 ms.
Computed a total of 26 stabilizing places and 28 stable transitions
Graph (complete) has 2112 edges and 1513 vertex of which 1504 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.10 ms
Computed a total of 26 stabilizing places and 28 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 2 factoid took 18 ms. Proved property starting from automaton with 3 states, 3 edges and 1 AP (stutter sensitive
Knowledge-based reduction took 44 ms.
FORMULA CloudReconfiguration-PT-301-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CloudReconfiguration-PT-301-LTLCardinality-03 finished in 63178 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X((F(p0) U X(p1))))&&F(p2)))'
Support contains 6 out of 1557 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1557/1557 places, 1986/1986 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1544 transition count 1973
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1544 transition count 1973
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 35 place count 1535 transition count 1963
Iterating global reduction 0 with 9 rules applied. Total rules applied 44 place count 1535 transition count 1963
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 49 place count 1530 transition count 1957
Iterating global reduction 0 with 5 rules applied. Total rules applied 54 place count 1530 transition count 1957
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 58 place count 1526 transition count 1953
Iterating global reduction 0 with 4 rules applied. Total rules applied 62 place count 1526 transition count 1953
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 63 place count 1526 transition count 1952
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 65 place count 1524 transition count 1950
Iterating global reduction 1 with 2 rules applied. Total rules applied 67 place count 1524 transition count 1950
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 68 place count 1523 transition count 1949
Iterating global reduction 1 with 1 rules applied. Total rules applied 69 place count 1523 transition count 1949
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 70 place count 1522 transition count 1948
Iterating global reduction 1 with 1 rules applied. Total rules applied 71 place count 1522 transition count 1948
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 72 place count 1521 transition count 1946
Iterating global reduction 1 with 1 rules applied. Total rules applied 73 place count 1521 transition count 1946
Applied a total of 73 rules in 571 ms. Remains 1521 /1557 variables (removed 36) and now considering 1946/1986 (removed 40) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5850998935140778949.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8663628453949120920.kers'
[2026-05-23 00:44:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5850998935140778949.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8663628453949120920.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 1946 rows 1521 cols 4063 entries
Finished phase 1 with 1516 SingleSign rule and 1 generalized
[2026-05-23 00:44:36] [INFO ] Computed 4 invariants in 13 ms
Computed 4 P flows in 13 ms.
Exported basis to /tmp/petrispot-output-8663628453949120920.kers
Total runtime 17 ms.
[2026-05-23 00:44:36] [INFO ] Implicit Places using invariants in 257 ms returned []
[2026-05-23 00:44:36] [INFO ] Invariant cache hit.
[2026-05-23 00:44:37] [INFO ] Implicit Places using invariants and state equation in 1024 ms returned []
Implicit Place search using SMT with State Equation took 1287 ms to find 0 implicit places.
Running 1945 sub problems to find dead transitions.
[2026-05-23 00:44:37] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/1520 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1945 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1520/3467 variables, and 4 constraints, problems are : Problem set: 0 solved, 1945 unsolved in 30038 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1521 constraints, PredecessorRefiner: 1945/1945 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1945 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1520 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1945 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1520/3467 variables, and 4 constraints, problems are : Problem set: 0 solved, 1945 unsolved in 30041 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1521 constraints, PredecessorRefiner: 0/1945 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60440ms problems are : Problem set: 0 solved, 1945 unsolved
Search for dead transitions found 0 dead transitions in 60445ms
Starting structural reductions in LTL mode, iteration 1 : 1521/1557 places, 1946/1986 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62312 ms. Remains : 1521/1557 places, 1946/1986 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X((F(p0) U X(p1))))&&F(p2)))'
Stuttering acceptance computed with spot in 277 ms :[(OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : CloudReconfiguration-PT-301-LTLCardinality-06
Product exploration explored 100000 steps with 25000 reset in 351 ms.
Product exploration explored 100000 steps with 25000 reset in 337 ms.
Computed a total of 26 stabilizing places and 28 stable transitions
Graph (complete) has 2123 edges and 1521 vertex of which 1512 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.5 ms
Computed a total of 26 stabilizing places and 28 stable transitions
Knowledge based reduction with 4 factoid took 69 ms. Reduced automaton from 7 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (296 resets) in 405 ms. (98 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (78 resets) in 129 ms. (307 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (84 resets) in 96 ms. (412 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (82 resets) in 99 ms. (400 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 330057 steps, run timeout after 3001 ms. (steps per millisecond=109 ) properties seen :0 out of 3
Probabilistic random walk after 330057 steps, saw 81162 distinct states, run finished after 3010 ms. (steps per millisecond=109 ) properties seen :0
[2026-05-23 00:45:42] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 1506/1510 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1510 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1936/3446 variables, 1510/1514 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3446 variables, 0/1514 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 2/3448 variables, 1/1515 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3448 variables, 0/1515 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 2/3450 variables, 1/1516 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3450 variables, 0/1516 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 2/3452 variables, 1/1517 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3452 variables, 0/1517 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 2/3454 variables, 1/1518 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3454 variables, 0/1518 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 2/3456 variables, 1/1519 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3456 variables, 0/1519 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 2/3458 variables, 1/1520 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3458 variables, 0/1520 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 2/3460 variables, 1/1521 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3460 variables, 0/1521 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 2/3462 variables, 1/1522 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3462 variables, 0/1522 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 2/3464 variables, 1/1523 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3464 variables, 0/1523 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (OVERLAPS) 2/3466 variables, 1/1524 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3466 variables, 0/1524 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (OVERLAPS) 1/3467 variables, 1/1525 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/3467 variables, 0/1525 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (OVERLAPS) 0/3467 variables, 0/1525 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3467/3467 variables, and 1525 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2237 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1521/1521 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
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 1506/1510 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1510 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1936/3446 variables, 1510/1514 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3446 variables, 3/1517 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3446 variables, 0/1517 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 2/3448 variables, 1/1518 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3448 variables, 0/1518 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 2/3450 variables, 1/1519 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3450 variables, 0/1519 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 2/3452 variables, 1/1520 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3452 variables, 0/1520 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 2/3454 variables, 1/1521 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3454 variables, 0/1521 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 2/3456 variables, 1/1522 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3456 variables, 0/1522 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 2/3458 variables, 1/1523 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3458 variables, 0/1523 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 2/3460 variables, 1/1524 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3460 variables, 0/1524 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 2/3462 variables, 1/1525 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3462 variables, 0/1525 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 2/3464 variables, 1/1526 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/3464 variables, 0/1526 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (OVERLAPS) 2/3466 variables, 1/1527 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/3466 variables, 0/1527 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf0 is UNSAT
At refinement iteration 26 (OVERLAPS) 1/3467 variables, 1/1528 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/3467 variables, 0/1528 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 28 (OVERLAPS) 0/3467 variables, 0/1528 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3467/3467 variables, and 1528 constraints, problems are : Problem set: 1 solved, 2 unsolved in 4986 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1521/1521 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7234ms problems are : Problem set: 1 solved, 2 unsolved
Finished Parikh walk after 106 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=106 )
Parikh walk visited 2 properties in 68 ms.
Found 1 invariant AP formulas.
Knowledge based reduction with 5 factoid took 111 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 184 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Knowledge-based reduction took 10924 ms.
Stuttering acceptance computed with spot in 162 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Support contains 2 out of 1521 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 1521/1521 places, 1946/1946 transitions.
Applied a total of 0 rules in 60 ms. Remains 1521 /1521 variables (removed 0) and now considering 1946/1946 (removed 0) transitions.
[2026-05-23 00:45:49] [INFO ] Invariant cache hit.
[2026-05-23 00:45:50] [INFO ] Implicit Places using invariants in 226 ms returned []
[2026-05-23 00:45:50] [INFO ] Invariant cache hit.
[2026-05-23 00:45:51] [INFO ] Implicit Places using invariants and state equation in 992 ms returned []
Implicit Place search using SMT with State Equation took 1221 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 1282 ms. Remains : 1521/1521 places, 1946/1946 transitions.
Computed a total of 26 stabilizing places and 28 stable transitions
Graph (complete) has 2123 edges and 1521 vertex of which 1512 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.6 ms
Computed a total of 26 stabilizing places and 28 stable transitions
Knowledge based reduction with 1 factoid took 50 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
RANDOM walk for 40000 steps (310 resets) in 81 ms. (487 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (78 resets) in 29 ms. (1333 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 393214 steps, run timeout after 3001 ms. (steps per millisecond=131 ) properties seen :0 out of 1
Probabilistic random walk after 393214 steps, saw 96986 distinct states, run finished after 3001 ms. (steps per millisecond=131 ) properties seen :0
[2026-05-23 00:45:54] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1508/1510 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1510 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1936/3446 variables, 1510/1514 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3446 variables, 0/1514 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/3448 variables, 1/1515 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3448 variables, 0/1515 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/3450 variables, 1/1516 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3450 variables, 0/1516 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/3452 variables, 1/1517 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3452 variables, 0/1517 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/3454 variables, 1/1518 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3454 variables, 0/1518 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/3456 variables, 1/1519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3456 variables, 0/1519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/3458 variables, 1/1520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3458 variables, 0/1520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/3460 variables, 1/1521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3460 variables, 0/1521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/3462 variables, 1/1522 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3462 variables, 0/1522 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 2/3464 variables, 1/1523 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3464 variables, 0/1523 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 2/3466 variables, 1/1524 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3466 variables, 0/1524 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 1/3467 variables, 1/1525 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/3467 variables, 0/1525 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/3467 variables, 0/1525 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3467/3467 variables, and 1525 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1274 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1521/1521 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1508/1510 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1510 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1936/3446 variables, 1510/1514 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3446 variables, 1/1515 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3446 variables, 0/1515 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/3448 variables, 1/1516 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3448 variables, 0/1516 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/3450 variables, 1/1517 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3450 variables, 0/1517 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/3452 variables, 1/1518 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3452 variables, 0/1518 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/3454 variables, 1/1519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3454 variables, 0/1519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/3456 variables, 1/1520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3456 variables, 0/1520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/3458 variables, 1/1521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3458 variables, 0/1521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/3460 variables, 1/1522 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3460 variables, 0/1522 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/3462 variables, 1/1523 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3462 variables, 0/1523 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 2/3464 variables, 1/1524 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/3464 variables, 0/1524 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 2/3466 variables, 1/1525 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/3466 variables, 0/1525 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 1/3467 variables, 1/1526 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/3467 variables, 0/1526 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 0/3467 variables, 0/1526 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3467/3467 variables, and 1526 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2215 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1521/1521 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3499ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 156 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=156 )
Parikh walk visited 1 properties in 2 ms.
Knowledge based reduction with 1 factoid took 63 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 183 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Knowledge-based reduction took 6857 ms.
Stuttering acceptance computed with spot in 176 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 148 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 25000 reset in 243 ms.
Product exploration explored 100000 steps with 25000 reset in 244 ms.
Spot run failed in 76 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin13373898011294829424
[2026-05-23 00:45:58] [INFO ] Built C files in 37ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13373898011294829424
Running compilation step : cd /tmp/ltsmin13373898011294829424;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/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/ltsmin13373898011294829424;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/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/ltsmin13373898011294829424;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/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:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 2 out of 1521 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1521/1521 places, 1946/1946 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1519 transition count 1944
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1519 transition count 1944
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 1518 transition count 1943
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 1518 transition count 1943
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 1517 transition count 1942
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 1517 transition count 1942
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 1516 transition count 1940
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 1516 transition count 1940
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 1515 transition count 1938
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 1515 transition count 1938
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 1514 transition count 1937
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 1514 transition count 1937
Applied a total of 14 rules in 393 ms. Remains 1514 /1521 variables (removed 7) and now considering 1937/1946 (removed 9) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-514966519376728717.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12143150993836798562.kers'
[2026-05-23 00:46:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-514966519376728717.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12143150993836798562.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1937 rows 1514 cols 4045 entries
Finished phase 1 with 1509 SingleSign rule and 1 generalized
[2026-05-23 00:46:02] [INFO ] Computed 4 invariants in 11 ms
Computed 4 P flows in 11 ms.
Exported basis to /tmp/petrispot-output-12143150993836798562.kers
Total runtime 15 ms.
[2026-05-23 00:46:02] [INFO ] Implicit Places using invariants in 243 ms returned []
[2026-05-23 00:46:02] [INFO ] Invariant cache hit.
[2026-05-23 00:46:03] [INFO ] Implicit Places using invariants and state equation in 920 ms returned []
Implicit Place search using SMT with State Equation took 1166 ms to find 0 implicit places.
Running 1936 sub problems to find dead transitions.
[2026-05-23 00:46:03] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/1513 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1936 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1513/3451 variables, and 4 constraints, problems are : Problem set: 0 solved, 1936 unsolved in 30036 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1514 constraints, PredecessorRefiner: 1936/1936 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1936 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1513 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1936 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1513/3451 variables, and 4 constraints, problems are : Problem set: 0 solved, 1936 unsolved in 30034 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1514 constraints, PredecessorRefiner: 0/1936 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60524ms problems are : Problem set: 0 solved, 1936 unsolved
Search for dead transitions found 0 dead transitions in 60528ms
Starting structural reductions in LTL mode, iteration 1 : 1514/1521 places, 1937/1946 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62097 ms. Remains : 1514/1521 places, 1937/1946 transitions.
Built C files in :
/tmp/ltsmin5952206274808240624
[2026-05-23 00:47:04] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5952206274808240624
Running compilation step : cd /tmp/ltsmin5952206274808240624;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/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/ltsmin5952206274808240624;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/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/ltsmin5952206274808240624;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/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:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2026-05-23 00:47:07] [INFO ] Flatten gal took : 54 ms
[2026-05-23 00:47:07] [INFO ] Flatten gal took : 55 ms
[2026-05-23 00:47:07] [INFO ] Time to serialize gal into /tmp/LTL17396946578306456398.gal : 13 ms
[2026-05-23 00:47:07] [INFO ] Time to serialize properties into /tmp/LTL8515174222054499997.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.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17396946578306456398.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5472598590382050316.hoa' '-atoms' '/tmp/LTL8515174222054499997.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.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL8515174222054499997.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5472598590382050316.hoa
Detected timeout of ITS tools.
[2026-05-23 00:47:22] [INFO ] Flatten gal took : 41 ms
[2026-05-23 00:47:22] [INFO ] Flatten gal took : 33 ms
[2026-05-23 00:47:22] [INFO ] Time to serialize gal into /tmp/LTL6434984998432172060.gal : 10 ms
[2026-05-23 00:47:22] [INFO ] Time to serialize properties into /tmp/LTL4554237860210986077.ltl : 5 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.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6434984998432172060.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4554237860210986077.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.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !(((X(X((F("((p1091==0)||(p991==1))"))U(X("((p1173==0)||(p319==1))")))))&&(F("((p1317==0)||(p2212==1))"))))
Formula 0 simplified : XX(G!"((p1091==0)||(p991==1))" R X!"((p1173==0)||(p319==1))") | G!"((p1317==0)||(p2212==1))"
Detected timeout of ITS tools.
[2026-05-23 00:47:37] [INFO ] Flatten gal took : 28 ms
[2026-05-23 00:47:37] [INFO ] Applying decomposition
[2026-05-23 00:47:37] [INFO ] Flatten gal took : 43 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph13202413975150123327.txt' '-o' '/tmp/graph13202413975150123327.bin' '-w' '/tmp/graph13202413975150123327.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph13202413975150123327.bin' '-l' '-1' '-v' '-w' '/tmp/graph13202413975150123327.weights' '-q' '0' '-e' '0.001'
[2026-05-23 00:47:37] [INFO ] Decomposing Gal with order
[2026-05-23 00:47:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 00:47:38] [INFO ] Removed a total of 512 redundant transitions.
[2026-05-23 00:47:38] [INFO ] Flatten gal took : 149 ms
[2026-05-23 00:47:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 42 labels/synchronizations in 32 ms.
[2026-05-23 00:47:38] [INFO ] Time to serialize gal into /tmp/LTL11166066484227158112.gal : 21 ms
[2026-05-23 00:47:38] [INFO ] Time to serialize properties into /tmp/LTL15959161415953577411.ltl : 0 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.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11166066484227158112.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15959161415953577411.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !(((X(X((F("((i16.i0.i4.u253.p1091==0)||(i9.u280.p991==1))"))U(X("((i9.u126.p1173==0)||(i3.i1.i0.u55.p319==1))")))))&&(F("((i22.i1.i0....196
Formula 0 simplified : XX(G!"((i16.i0.i4.u253.p1091==0)||(i9.u280.p991==1))" R X!"((i9.u126.p1173==0)||(i3.i1.i0.u55.p319==1))") | G!"((i22.i1.i0.u309.p131...183
Reverse transition relation is NOT exact ! Due to transitions t26, t215, t268, t299, t328, t378, t450, t499, t502, t662, t743, t805, t854, t925, t976, t115...2114
Computing Next relation with stutter on 96096 deadlock states
4 unique states visited
0 strongly connected components in search stack
3 transitions explored
4 items max in DFS search stack
405 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,4.22496,145376,1,0,231788,5412,19321,417927,511,35623,1176225
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA CloudReconfiguration-PT-301-LTLCardinality-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property CloudReconfiguration-PT-301-LTLCardinality-06 finished in 187652 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 1557 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1557/1557 places, 1986/1986 transitions.
Graph (trivial) has 1893 edges and 1557 vertex of which 695 / 1557 are part of one of the 63 SCC in 4 ms
Free SCC test removed 632 places
Ensure Unique test removed 734 transitions
Reduce isomorphic transitions removed 734 transitions.
Graph (complete) has 1426 edges and 925 vertex of which 916 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.3 ms
Discarding 9 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 506 transitions
Trivial Post-agglo rules discarded 506 transitions
Performed 506 trivial Post agglomeration. Transition count delta: 506
Iterating post reduction 0 with 506 rules applied. Total rules applied 508 place count 915 transition count 740
Reduce places removed 506 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 530 rules applied. Total rules applied 1038 place count 409 transition count 716
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 1050 place count 397 transition count 716
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 44 Pre rules applied. Total rules applied 1050 place count 397 transition count 672
Deduced a syphon composed of 44 places in 1 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 88 rules applied. Total rules applied 1138 place count 353 transition count 672
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 1154 place count 337 transition count 650
Iterating global reduction 3 with 16 rules applied. Total rules applied 1170 place count 337 transition count 650
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 1172 place count 337 transition count 648
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1173 place count 336 transition count 648
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 1184 place count 325 transition count 634
Iterating global reduction 5 with 11 rules applied. Total rules applied 1195 place count 325 transition count 634
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 8 rules applied. Total rules applied 1203 place count 325 transition count 626
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1204 place count 324 transition count 626
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1206 place count 322 transition count 622
Iterating global reduction 7 with 2 rules applied. Total rules applied 1208 place count 322 transition count 622
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1210 place count 320 transition count 618
Iterating global reduction 7 with 2 rules applied. Total rules applied 1212 place count 320 transition count 618
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 1 rules applied. Total rules applied 1213 place count 320 transition count 617
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1214 place count 319 transition count 617
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1215 place count 318 transition count 615
Iterating global reduction 9 with 1 rules applied. Total rules applied 1216 place count 318 transition count 615
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1217 place count 317 transition count 613
Iterating global reduction 9 with 1 rules applied. Total rules applied 1218 place count 317 transition count 613
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1219 place count 316 transition count 611
Iterating global reduction 9 with 1 rules applied. Total rules applied 1220 place count 316 transition count 611
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1221 place count 315 transition count 604
Iterating global reduction 9 with 1 rules applied. Total rules applied 1222 place count 315 transition count 604
Performed 152 Post agglomeration using F-continuation condition with reduction of 89 identical transitions.
Deduced a syphon composed of 152 places in 0 ms
Reduce places removed 152 places and 0 transitions.
Iterating global reduction 9 with 304 rules applied. Total rules applied 1526 place count 163 transition count 363
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 9 with 11 rules applied. Total rules applied 1537 place count 163 transition count 352
Discarding 5 places :
Symmetric choice reduction at 10 with 5 rule applications. Total rules 1542 place count 158 transition count 345
Iterating global reduction 10 with 5 rules applied. Total rules applied 1547 place count 158 transition count 345
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 1548 place count 157 transition count 343
Iterating global reduction 10 with 1 rules applied. Total rules applied 1549 place count 157 transition count 343
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 1550 place count 156 transition count 341
Iterating global reduction 10 with 1 rules applied. Total rules applied 1551 place count 156 transition count 341
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 1552 place count 155 transition count 339
Iterating global reduction 10 with 1 rules applied. Total rules applied 1553 place count 155 transition count 339
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 1554 place count 154 transition count 337
Iterating global reduction 10 with 1 rules applied. Total rules applied 1555 place count 154 transition count 337
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 1556 place count 153 transition count 330
Iterating global reduction 10 with 1 rules applied. Total rules applied 1557 place count 153 transition count 330
Performed 11 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 10 with 22 rules applied. Total rules applied 1579 place count 142 transition count 318
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 10 with 11 rules applied. Total rules applied 1590 place count 142 transition count 307
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -34
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 11 with 34 rules applied. Total rules applied 1624 place count 125 transition count 341
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 11 with 16 rules applied. Total rules applied 1640 place count 125 transition count 325
Discarding 9 places :
Symmetric choice reduction at 12 with 9 rule applications. Total rules 1649 place count 116 transition count 307
Iterating global reduction 12 with 9 rules applied. Total rules applied 1658 place count 116 transition count 307
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 12 with 5 rules applied. Total rules applied 1663 place count 116 transition count 302
Drop transitions (Redundant composition of simpler transitions.) removed 36 transitions
Redundant transition composition rules discarded 36 transitions
Iterating global reduction 13 with 36 rules applied. Total rules applied 1699 place count 116 transition count 266
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 13 with 1 rules applied. Total rules applied 1700 place count 115 transition count 265
Applied a total of 1700 rules in 104 ms. Remains 115 /1557 variables (removed 1442) and now considering 265/1986 (removed 1721) transitions.
[2026-05-23 00:47:43] [INFO ] Flow matrix only has 208 transitions (discarded 57 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15789995537811483585.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5022703567587532921.kers'
[2026-05-23 00:47:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15789995537811483585.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5022703567587532921.kers]
Normalized transition count is 207 out of 208 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 207 rows 115 cols 598 entries
Finished phase 1 with 115 SingleSign rule and 0 generalized
[2026-05-23 00:47:43] [INFO ] Computed 0 invariants in 2 ms
Computed 0 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-5022703567587532921.kers
Total runtime 3 ms.
[2026-05-23 00:47:43] [INFO ] Implicit Places using invariants in 58 ms returned []
[2026-05-23 00:47:43] [INFO ] Flow matrix only has 208 transitions (discarded 57 similar events)
[2026-05-23 00:47:43] [INFO ] Invariant cache hit.
[2026-05-23 00:47:43] [INFO ] State equation strengthened by 3 read => feed constraints.
[2026-05-23 00:47:43] [INFO ] Implicit Places using invariants and state equation in 112 ms returned [8, 45, 78]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 174 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 112/1557 places, 265/1986 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 110 transition count 263
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 109 transition count 262
Applied a total of 3 rules in 9 ms. Remains 109 /112 variables (removed 3) and now considering 262/265 (removed 3) transitions.
[2026-05-23 00:47:43] [INFO ] Flow matrix only has 205 transitions (discarded 57 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6923578486249394631.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3184266373629575590.kers'
[2026-05-23 00:47:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6923578486249394631.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3184266373629575590.kers]
Normalized transition count is 204 out of 205 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 204 rows 109 cols 583 entries
Finished phase 1 with 109 SingleSign rule and 0 generalized
[2026-05-23 00:47:43] [INFO ] Computed 0 invariants in 1 ms
Computed 0 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3184266373629575590.kers
Total runtime 1 ms.
[2026-05-23 00:47:43] [INFO ] Implicit Places using invariants in 40 ms returned []
[2026-05-23 00:47:43] [INFO ] Flow matrix only has 205 transitions (discarded 57 similar events)
[2026-05-23 00:47:43] [INFO ] Invariant cache hit.
[2026-05-23 00:47:43] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-23 00:47:43] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 109/1557 places, 262/1986 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 406 ms. Remains : 109/1557 places, 262/1986 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : CloudReconfiguration-PT-301-LTLCardinality-07
Stuttering criterion allowed to conclude after 1691 steps with 178 reset in 6 ms.
FORMULA CloudReconfiguration-PT-301-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-301-LTLCardinality-07 finished in 475 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U X(X(X(G(p1))))) U X(p2)))'
Support contains 6 out of 1557 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1557/1557 places, 1986/1986 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1545 transition count 1974
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1545 transition count 1974
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 32 place count 1537 transition count 1966
Iterating global reduction 0 with 8 rules applied. Total rules applied 40 place count 1537 transition count 1966
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 45 place count 1532 transition count 1960
Iterating global reduction 0 with 5 rules applied. Total rules applied 50 place count 1532 transition count 1960
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 54 place count 1528 transition count 1955
Iterating global reduction 0 with 4 rules applied. Total rules applied 58 place count 1528 transition count 1955
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 61 place count 1525 transition count 1951
Iterating global reduction 0 with 3 rules applied. Total rules applied 64 place count 1525 transition count 1951
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 67 place count 1522 transition count 1948
Iterating global reduction 0 with 3 rules applied. Total rules applied 70 place count 1522 transition count 1948
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 72 place count 1520 transition count 1946
Iterating global reduction 0 with 2 rules applied. Total rules applied 74 place count 1520 transition count 1946
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 76 place count 1518 transition count 1943
Iterating global reduction 0 with 2 rules applied. Total rules applied 78 place count 1518 transition count 1943
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 79 place count 1517 transition count 1941
Iterating global reduction 0 with 1 rules applied. Total rules applied 80 place count 1517 transition count 1941
Applied a total of 80 rules in 568 ms. Remains 1517 /1557 variables (removed 40) and now considering 1941/1986 (removed 45) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13931548385786428061.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5120073550457025308.kers'
[2026-05-23 00:47:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13931548385786428061.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5120073550457025308.kers]
Culled 0 columns in 3 ms.
// Phase 1: matrix 1941 rows 1517 cols 4051 entries
Finished phase 1 with 1512 SingleSign rule and 1 generalized
[2026-05-23 00:47:44] [INFO ] Computed 4 invariants in 16 ms
Computed 4 P flows in 17 ms.
Exported basis to /tmp/petrispot-output-5120073550457025308.kers
Total runtime 21 ms.
[2026-05-23 00:47:44] [INFO ] Implicit Places using invariants in 237 ms returned []
[2026-05-23 00:47:44] [INFO ] Invariant cache hit.
[2026-05-23 00:47:45] [INFO ] Implicit Places using invariants and state equation in 914 ms returned []
Implicit Place search using SMT with State Equation took 1153 ms to find 0 implicit places.
Running 1940 sub problems to find dead transitions.
[2026-05-23 00:47:45] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/1516 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1940 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1516/3458 variables, and 4 constraints, problems are : Problem set: 0 solved, 1940 unsolved in 30037 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1517 constraints, PredecessorRefiner: 1940/1940 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1940 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1516 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1940 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1516/3458 variables, and 4 constraints, problems are : Problem set: 0 solved, 1940 unsolved in 30031 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1517 constraints, PredecessorRefiner: 0/1940 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60432ms problems are : Problem set: 0 solved, 1940 unsolved
Search for dead transitions found 0 dead transitions in 60434ms
Starting structural reductions in LTL mode, iteration 1 : 1517/1557 places, 1941/1986 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62165 ms. Remains : 1517/1557 places, 1941/1986 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U X(X(X(G(p1))))) U X(p2)))'
Stuttering acceptance computed with spot in 355 ms :[(NOT p2), (AND (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1), true, (NOT p1), (NOT p1)]
Running random walk in product with property : CloudReconfiguration-PT-301-LTLCardinality-08
Product exploration explored 100000 steps with 50000 reset in 419 ms.
Product exploration explored 100000 steps with 50000 reset in 427 ms.
Computed a total of 26 stabilizing places and 28 stable transitions
Graph (complete) has 2116 edges and 1517 vertex of which 1508 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.4 ms
Computed a total of 26 stabilizing places and 28 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 12 factoid took 15 ms. Proved property starting from automaton with 9 states, 17 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 26 ms.
FORMULA CloudReconfiguration-PT-301-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CloudReconfiguration-PT-301-LTLCardinality-08 finished in 63449 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 1557 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1557/1557 places, 1986/1986 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 1542 transition count 1971
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 1542 transition count 1971
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 40 place count 1532 transition count 1960
Iterating global reduction 0 with 10 rules applied. Total rules applied 50 place count 1532 transition count 1960
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 57 place count 1525 transition count 1952
Iterating global reduction 0 with 7 rules applied. Total rules applied 64 place count 1525 transition count 1952
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 70 place count 1519 transition count 1945
Iterating global reduction 0 with 6 rules applied. Total rules applied 76 place count 1519 transition count 1945
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 77 place count 1519 transition count 1944
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 81 place count 1515 transition count 1939
Iterating global reduction 1 with 4 rules applied. Total rules applied 85 place count 1515 transition count 1939
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 88 place count 1512 transition count 1936
Iterating global reduction 1 with 3 rules applied. Total rules applied 91 place count 1512 transition count 1936
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 93 place count 1510 transition count 1934
Iterating global reduction 1 with 2 rules applied. Total rules applied 95 place count 1510 transition count 1934
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 97 place count 1508 transition count 1931
Iterating global reduction 1 with 2 rules applied. Total rules applied 99 place count 1508 transition count 1931
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 100 place count 1507 transition count 1929
Iterating global reduction 1 with 1 rules applied. Total rules applied 101 place count 1507 transition count 1929
Applied a total of 101 rules in 594 ms. Remains 1507 /1557 variables (removed 50) and now considering 1929/1986 (removed 57) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16964064312662020164.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3836270963795879243.kers'
[2026-05-23 00:48:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16964064312662020164.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3836270963795879243.kers]
Culled 0 columns in 3 ms.
// Phase 1: matrix 1929 rows 1507 cols 4027 entries
Finished phase 1 with 1502 SingleSign rule and 1 generalized
[2026-05-23 00:48:47] [INFO ] Computed 4 invariants in 17 ms
Computed 4 P flows in 18 ms.
Exported basis to /tmp/petrispot-output-3836270963795879243.kers
Total runtime 22 ms.
[2026-05-23 00:48:47] [INFO ] Implicit Places using invariants in 257 ms returned []
[2026-05-23 00:48:47] [INFO ] Invariant cache hit.
[2026-05-23 00:48:48] [INFO ] Implicit Places using invariants and state equation in 965 ms returned []
Implicit Place search using SMT with State Equation took 1224 ms to find 0 implicit places.
Running 1928 sub problems to find dead transitions.
[2026-05-23 00:48:48] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/1506 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1506/3436 variables, and 4 constraints, problems are : Problem set: 0 solved, 1928 unsolved in 30041 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1507 constraints, PredecessorRefiner: 1928/1928 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1928 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1506 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1506/3436 variables, and 4 constraints, problems are : Problem set: 0 solved, 1928 unsolved in 30035 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1507 constraints, PredecessorRefiner: 0/1928 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60448ms problems are : Problem set: 0 solved, 1928 unsolved
Search for dead transitions found 0 dead transitions in 60451ms
Starting structural reductions in LTL mode, iteration 1 : 1507/1557 places, 1929/1986 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62276 ms. Remains : 1507/1557 places, 1929/1986 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Stuttering acceptance computed with spot in 107 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CloudReconfiguration-PT-301-LTLCardinality-10
Entered a terminal (fully accepting) state of product in 3200 steps with 25 reset in 6 ms.
FORMULA CloudReconfiguration-PT-301-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-301-LTLCardinality-10 finished in 62435 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(p1))||p0)))'
Support contains 4 out of 1557 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1557/1557 places, 1986/1986 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 1542 transition count 1971
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 1542 transition count 1971
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 40 place count 1532 transition count 1960
Iterating global reduction 0 with 10 rules applied. Total rules applied 50 place count 1532 transition count 1960
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 57 place count 1525 transition count 1952
Iterating global reduction 0 with 7 rules applied. Total rules applied 64 place count 1525 transition count 1952
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 70 place count 1519 transition count 1945
Iterating global reduction 0 with 6 rules applied. Total rules applied 76 place count 1519 transition count 1945
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 77 place count 1519 transition count 1944
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 81 place count 1515 transition count 1939
Iterating global reduction 1 with 4 rules applied. Total rules applied 85 place count 1515 transition count 1939
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 88 place count 1512 transition count 1936
Iterating global reduction 1 with 3 rules applied. Total rules applied 91 place count 1512 transition count 1936
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 93 place count 1510 transition count 1934
Iterating global reduction 1 with 2 rules applied. Total rules applied 95 place count 1510 transition count 1934
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 97 place count 1508 transition count 1931
Iterating global reduction 1 with 2 rules applied. Total rules applied 99 place count 1508 transition count 1931
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 100 place count 1507 transition count 1929
Iterating global reduction 1 with 1 rules applied. Total rules applied 101 place count 1507 transition count 1929
Applied a total of 101 rules in 583 ms. Remains 1507 /1557 variables (removed 50) and now considering 1929/1986 (removed 57) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2623125835256197949.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7893287357640608826.kers'
[2026-05-23 00:49:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2623125835256197949.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7893287357640608826.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1929 rows 1507 cols 4027 entries
Finished phase 1 with 1502 SingleSign rule and 1 generalized
[2026-05-23 00:49:50] [INFO ] Computed 4 invariants in 15 ms
Computed 4 P flows in 16 ms.
Exported basis to /tmp/petrispot-output-7893287357640608826.kers
Total runtime 19 ms.
[2026-05-23 00:49:50] [INFO ] Implicit Places using invariants in 230 ms returned []
[2026-05-23 00:49:50] [INFO ] Invariant cache hit.
[2026-05-23 00:49:51] [INFO ] Implicit Places using invariants and state equation in 917 ms returned []
Implicit Place search using SMT with State Equation took 1163 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 1507/1557 places, 1929/1986 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1747 ms. Remains : 1507/1557 places, 1929/1986 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(p1))||p0)))'
Stuttering acceptance computed with spot in 140 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : CloudReconfiguration-PT-301-LTLCardinality-11
Product exploration explored 100000 steps with 50000 reset in 376 ms.
Product exploration explored 100000 steps with 50000 reset in 376 ms.
Computed a total of 26 stabilizing places and 28 stable transitions
Graph (complete) has 2104 edges and 1507 vertex of which 1498 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.4 ms
Computed a total of 26 stabilizing places and 28 stable transitions
Knowledge based reduction with 3 factoid took 63 ms. Proved property starting from automaton with 4 states, 5 edges and 2 AP (stutter sensitive
Knowledge-based reduction took 71 ms.
FORMULA CloudReconfiguration-PT-301-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CloudReconfiguration-PT-301-LTLCardinality-11 finished in 2749 ms.
All properties solved by simple procedures.
Total runtime 458885 ms.

BK_STOP 1779497392226

--------------------
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.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /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="CloudReconfiguration-PT-301"
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-5973"
echo " Executing tool itstools"
echo " Input is CloudReconfiguration-PT-301, 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 r066-tall-177946967500115"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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