About the Execution of ITS-Tools for Referendum-PT-0020
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
0.000 | 25470.00 | 0.00 | 0.00 | FFFFFFFFFTFFFFFF | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r170-smll-174889233500195.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool itstools
Input is Referendum-PT-0020, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r170-smll-174889233500195
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 30K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 189K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 13K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 107K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 14K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 57K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 37K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 61K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 403K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 21K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 157K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.9K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.9K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 5 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 23K May 29 14:32 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
echo here is the order used to build the result vector(from xml file)
FORMULA_NAME Referendum-PT-0020-LTLCardinality-00
FORMULA_NAME Referendum-PT-0020-LTLCardinality-01
FORMULA_NAME Referendum-PT-0020-LTLCardinality-02
FORMULA_NAME Referendum-PT-0020-LTLCardinality-03
FORMULA_NAME Referendum-PT-0020-LTLCardinality-04
FORMULA_NAME Referendum-PT-0020-LTLCardinality-05
FORMULA_NAME Referendum-PT-0020-LTLCardinality-06
FORMULA_NAME Referendum-PT-0020-LTLCardinality-07
FORMULA_NAME Referendum-PT-0020-LTLCardinality-08
FORMULA_NAME Referendum-PT-0020-LTLCardinality-09
FORMULA_NAME Referendum-PT-0020-LTLCardinality-10
FORMULA_NAME Referendum-PT-0020-LTLCardinality-11
FORMULA_NAME Referendum-PT-0020-LTLCardinality-12
FORMULA_NAME Referendum-PT-0020-LTLCardinality-13
FORMULA_NAME Referendum-PT-0020-LTLCardinality-14
FORMULA_NAME Referendum-PT-0020-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1748975293841
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Referendum-PT-0020
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-06-03 18:28:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-03 18:28:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-03 18:28:16] [INFO ] Load time of PNML (sax parser for PT used): 65 ms
[2025-06-03 18:28:16] [INFO ] Transformed 61 places.
[2025-06-03 18:28:16] [INFO ] Transformed 41 transitions.
[2025-06-03 18:28:16] [INFO ] Found NUPN structural information;
[2025-06-03 18:28:16] [INFO ] Parsed PT model containing 61 places and 41 transitions and 101 arcs in 220 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 23 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA Referendum-PT-0020-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0020-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0020-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0020-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 61 out of 61 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 61/61 places, 41/41 transitions.
Applied a total of 0 rules in 9 ms. Remains 61 /61 variables (removed 0) and now considering 41/41 (removed 0) transitions.
// Phase 1: matrix 41 rows 61 cols
[2025-06-03 18:28:16] [INFO ] Computed 20 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:28:16] [INFO ] Implicit Places using invariants in 244 ms returned []
[2025-06-03 18:28:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:28:16] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 426 ms to find 0 implicit places.
Running 40 sub problems to find dead transitions.
[2025-06-03 18:28:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 41/61 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 41/81 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (OVERLAPS) 41/102 variables, 61/142 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (OVERLAPS) 0/102 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Real declared 102/102 variables, and 142 constraints, problems are : Problem set: 0 solved, 40 unsolved in 1587 ms.
Refiners :[Domain max(s): 61/61 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 61/61 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 40 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 41/61 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 41/81 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (OVERLAPS) 41/102 variables, 61/142 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 40/182 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/102 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 8 (OVERLAPS) 0/102 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Int declared 102/102 variables, and 182 constraints, problems are : Problem set: 0 solved, 40 unsolved in 2713 ms.
Refiners :[Domain max(s): 61/61 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 61/61 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4351ms problems are : Problem set: 0 solved, 40 unsolved
Search for dead transitions found 0 dead transitions in 4366ms
Finished structural reductions in LTL mode , in 1 iterations and 4830 ms. Remains : 61/61 places, 41/41 transitions.
Support contains 61 out of 61 places after structural reductions.
[2025-06-03 18:28:21] [INFO ] Flatten gal took : 25 ms
[2025-06-03 18:28:21] [INFO ] Flatten gal took : 12 ms
[2025-06-03 18:28:21] [INFO ] Input system was already deterministic with 41 transitions.
Reduction of identical properties reduced properties to check from 23 to 22
RANDOM walk for 477 steps (20 resets) in 71 ms. (6 steps per ms) remains 0/22 properties
Computed a total of 61 stabilizing places and 41 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 61 transition count 41
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 20 out of 61 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 61/61 places, 41/41 transitions.
Graph (complete) has 60 edges and 61 vertex of which 41 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.1 ms
Discarding 20 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Applied a total of 1 rules in 21 ms. Remains 40 /61 variables (removed 21) and now considering 40/41 (removed 1) transitions.
// Phase 1: matrix 40 rows 40 cols
[2025-06-03 18:28:22] [INFO ] Computed 0 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:28:22] [INFO ] Implicit Places using invariants in 37 ms returned []
[2025-06-03 18:28:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:28:22] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 18:28:22] [INFO ] Redundant transitions in 1 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Starting structural reductions in SI_LTL mode, iteration 1 : 40/61 places, 40/41 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 128 ms. Remains : 40/61 places, 40/41 transitions.
Stuttering acceptance computed with spot in 239 ms :[(NOT p0)]
Running random walk in product with property : Referendum-PT-0020-LTLCardinality-01
Product exploration explored 100000 steps with 20096 reset in 681 ms.
Product exploration explored 100000 steps with 20019 reset in 384 ms.
Computed a total of 40 stabilizing places and 40 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 40 transition count 40
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 3 factoid took 139 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
RANDOM walk for 17 steps (0 resets) in 6 ms. (2 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 3 factoid took 157 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
[2025-06-03 18:28:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
Proved EG (NOT p0)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 3 factoid took 181 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA Referendum-PT-0020-LTLCardinality-01 FALSE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-PT-0020-LTLCardinality-01 finished in 2239 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U X(X(X(p1))))))'
Support contains 40 out of 61 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 61/61 places, 41/41 transitions.
Applied a total of 0 rules in 1 ms. Remains 61 /61 variables (removed 0) and now considering 41/41 (removed 0) transitions.
// Phase 1: matrix 41 rows 61 cols
[2025-06-03 18:28:24] [INFO ] Computed 20 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:28:24] [INFO ] Implicit Places using invariants in 56 ms returned []
[2025-06-03 18:28:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:28:24] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 162 ms to find 0 implicit places.
Running 40 sub problems to find dead transitions.
[2025-06-03 18:28:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 41/61 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 41/81 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (OVERLAPS) 41/102 variables, 61/142 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (OVERLAPS) 0/102 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Real declared 102/102 variables, and 142 constraints, problems are : Problem set: 0 solved, 40 unsolved in 1222 ms.
Refiners :[Domain max(s): 61/61 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 61/61 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 40 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 41/61 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 41/81 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (OVERLAPS) 41/102 variables, 61/142 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 40/182 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/102 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 8 (OVERLAPS) 0/102 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Int declared 102/102 variables, and 182 constraints, problems are : Problem set: 0 solved, 40 unsolved in 1350 ms.
Refiners :[Domain max(s): 61/61 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 61/61 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2590ms problems are : Problem set: 0 solved, 40 unsolved
Search for dead transitions found 0 dead transitions in 2591ms
Finished structural reductions in LTL mode , in 1 iterations and 2754 ms. Remains : 61/61 places, 41/41 transitions.
Stuttering acceptance computed with spot in 465 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Running random walk in product with property : Referendum-PT-0020-LTLCardinality-02
Entered a terminal (fully accepting) state of product in 46 steps with 8 reset in 3 ms.
FORMULA Referendum-PT-0020-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0020-LTLCardinality-02 finished in 3251 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(X(G((p1&&F(G(p0))))))))'
Support contains 40 out of 61 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 61/61 places, 41/41 transitions.
Applied a total of 0 rules in 2 ms. Remains 61 /61 variables (removed 0) and now considering 41/41 (removed 0) transitions.
[2025-06-03 18:28:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:28:27] [INFO ] Implicit Places using invariants in 53 ms returned []
[2025-06-03 18:28:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:28:27] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 149 ms to find 0 implicit places.
Running 40 sub problems to find dead transitions.
[2025-06-03 18:28:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 41/61 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 41/81 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (OVERLAPS) 41/102 variables, 61/142 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (OVERLAPS) 0/102 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Real declared 102/102 variables, and 142 constraints, problems are : Problem set: 0 solved, 40 unsolved in 1104 ms.
Refiners :[Domain max(s): 61/61 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 61/61 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 40 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 41/61 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 41/81 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (OVERLAPS) 41/102 variables, 61/142 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 40/182 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/102 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 8 (OVERLAPS) 0/102 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Int declared 102/102 variables, and 182 constraints, problems are : Problem set: 0 solved, 40 unsolved in 862 ms.
Refiners :[Domain max(s): 61/61 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 61/61 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1982ms problems are : Problem set: 0 solved, 40 unsolved
Search for dead transitions found 0 dead transitions in 1984ms
Finished structural reductions in LTL mode , in 1 iterations and 2136 ms. Remains : 61/61 places, 41/41 transitions.
Stuttering acceptance computed with spot in 269 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (NOT p0), (OR (NOT p1) (NOT p0)), true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Referendum-PT-0020-LTLCardinality-04
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA Referendum-PT-0020-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0020-LTLCardinality-04 finished in 2446 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Support contains 40 out of 61 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 61/61 places, 41/41 transitions.
Reduce places removed 1 places and 1 transitions.
Applied a total of 0 rules in 3 ms. Remains 60 /61 variables (removed 1) and now considering 40/41 (removed 1) transitions.
// Phase 1: matrix 40 rows 60 cols
[2025-06-03 18:28:30] [INFO ] Computed 20 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:28:30] [INFO ] Implicit Places using invariants in 40 ms returned []
[2025-06-03 18:28:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:28:30] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 18:28:30] [INFO ] Redundant transitions in 0 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 106 ms. Remains : 60/61 places, 40/41 transitions.
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Referendum-PT-0020-LTLCardinality-05
Stuttering criterion allowed to conclude after 20 steps with 0 reset in 5 ms.
FORMULA Referendum-PT-0020-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0020-LTLCardinality-05 finished in 293 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||(X(G((!p0&&X(p1)))) U (!p1&&X(G((!p0&&X(p1)))))))))'
Support contains 40 out of 61 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 61/61 places, 41/41 transitions.
Applied a total of 0 rules in 1 ms. Remains 61 /61 variables (removed 0) and now considering 41/41 (removed 0) transitions.
// Phase 1: matrix 41 rows 61 cols
[2025-06-03 18:28:30] [INFO ] Computed 20 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:28:30] [INFO ] Implicit Places using invariants in 47 ms returned []
[2025-06-03 18:28:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:28:30] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 126 ms to find 0 implicit places.
Running 40 sub problems to find dead transitions.
[2025-06-03 18:28:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 41/61 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 41/81 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (OVERLAPS) 41/102 variables, 61/142 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (OVERLAPS) 0/102 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Real declared 102/102 variables, and 142 constraints, problems are : Problem set: 0 solved, 40 unsolved in 934 ms.
Refiners :[Domain max(s): 61/61 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 61/61 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 40 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 41/61 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 41/81 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (OVERLAPS) 41/102 variables, 61/142 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 40/182 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/102 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 8 (OVERLAPS) 0/102 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Int declared 102/102 variables, and 182 constraints, problems are : Problem set: 0 solved, 40 unsolved in 1221 ms.
Refiners :[Domain max(s): 61/61 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 61/61 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2166ms problems are : Problem set: 0 solved, 40 unsolved
Search for dead transitions found 0 dead transitions in 2167ms
Finished structural reductions in LTL mode , in 1 iterations and 2304 ms. Remains : 61/61 places, 41/41 transitions.
Stuttering acceptance computed with spot in 192 ms :[(NOT p0), (NOT p0), (OR (NOT p1) p0), true, (OR (NOT p1) p0), true]
Running random walk in product with property : Referendum-PT-0020-LTLCardinality-06
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA Referendum-PT-0020-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0020-LTLCardinality-06 finished in 2522 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||F((!p1&&(!p0 U (p2||G(!p0)))&&X((X(F(p3))||G(!p1)))))))'
Support contains 61 out of 61 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 61/61 places, 41/41 transitions.
Applied a total of 0 rules in 1 ms. Remains 61 /61 variables (removed 0) and now considering 41/41 (removed 0) transitions.
[2025-06-03 18:28:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:28:32] [INFO ] Implicit Places using invariants in 43 ms returned []
[2025-06-03 18:28:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:28:32] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 128 ms to find 0 implicit places.
Running 40 sub problems to find dead transitions.
[2025-06-03 18:28:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 41/61 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 41/81 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (OVERLAPS) 41/102 variables, 61/142 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (OVERLAPS) 0/102 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Real declared 102/102 variables, and 142 constraints, problems are : Problem set: 0 solved, 40 unsolved in 1420 ms.
Refiners :[Domain max(s): 61/61 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 61/61 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 40 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 41/61 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 41/81 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (OVERLAPS) 41/102 variables, 61/142 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 40/182 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/102 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 8 (OVERLAPS) 0/102 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Int declared 102/102 variables, and 182 constraints, problems are : Problem set: 0 solved, 40 unsolved in 1245 ms.
Refiners :[Domain max(s): 61/61 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 61/61 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2676ms problems are : Problem set: 0 solved, 40 unsolved
Search for dead transitions found 0 dead transitions in 2676ms
Finished structural reductions in LTL mode , in 1 iterations and 2806 ms. Remains : 61/61 places, 41/41 transitions.
Stuttering acceptance computed with spot in 499 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1 (NOT p3)), false, (AND (NOT p0) p1), (AND p1 (NOT p3)), (OR (AND p0 (NOT p2) (NOT p3)) (AND p1 (NOT p3))), (AND p0 (NOT p2)), (OR p1 (AND p0 (NOT p2))), (AND p1 (NOT p3)), (AND p0 (NOT p2) (NOT p3))]
Running random walk in product with property : Referendum-PT-0020-LTLCardinality-07
Stuttering criterion allowed to conclude after 54 steps with 9 reset in 2 ms.
FORMULA Referendum-PT-0020-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0020-LTLCardinality-07 finished in 3342 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 61 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 61/61 places, 41/41 transitions.
Reduce places removed 39 places and 0 transitions.
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 0 with 58 rules applied. Total rules applied 58 place count 22 transition count 22
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 76 place count 4 transition count 4
Iterating global reduction 1 with 18 rules applied. Total rules applied 94 place count 4 transition count 4
Applied a total of 94 rules in 10 ms. Remains 4 /61 variables (removed 57) and now considering 4/41 (removed 37) transitions.
// Phase 1: matrix 4 rows 4 cols
[2025-06-03 18:28:36] [INFO ] Computed 0 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:28:36] [INFO ] Implicit Places using invariants in 43 ms returned []
[2025-06-03 18:28:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:28:36] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
Running 3 sub problems to find dead transitions.
[2025-06-03 18:28:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 2/8 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 0/8 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8/8 variables, and 4 constraints, problems are : Problem set: 0 solved, 3 unsolved in 103 ms.
Refiners :[State Equation: 4/4 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 2/8 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/8 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/8 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/8 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 8/8 variables, and 7 constraints, problems are : Problem set: 0 solved, 3 unsolved in 114 ms.
Refiners :[State Equation: 4/4 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 220ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 220ms
Starting structural reductions in LTL mode, iteration 1 : 4/61 places, 4/41 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 333 ms. Remains : 4/61 places, 4/41 transitions.
Stuttering acceptance computed with spot in 88 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Referendum-PT-0020-LTLCardinality-08
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 1 ms.
FORMULA Referendum-PT-0020-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0020-LTLCardinality-08 finished in 435 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(F(p0))))))'
Support contains 1 out of 61 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 61/61 places, 41/41 transitions.
Reduce places removed 40 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 21 transition count 21
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 79 place count 2 transition count 2
Iterating global reduction 1 with 19 rules applied. Total rules applied 98 place count 2 transition count 2
Applied a total of 98 rules in 1 ms. Remains 2 /61 variables (removed 59) and now considering 2/41 (removed 39) transitions.
// Phase 1: matrix 2 rows 2 cols
[2025-06-03 18:28:36] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:28:36] [INFO ] Implicit Places using invariants in 14 ms returned []
[2025-06-03 18:28:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:28:36] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
Running 1 sub problems to find dead transitions.
[2025-06-03 18:28:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 1/4 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4/4 variables, and 2 constraints, problems are : Problem set: 0 solved, 1 unsolved in 27 ms.
Refiners :[State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 1/4 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4/4 variables, and 3 constraints, problems are : Problem set: 0 solved, 1 unsolved in 33 ms.
Refiners :[State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 63ms problems are : Problem set: 0 solved, 1 unsolved
Search for dead transitions found 0 dead transitions in 63ms
Starting structural reductions in LTL mode, iteration 1 : 2/61 places, 2/41 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 101 ms. Remains : 2/61 places, 2/41 transitions.
Stuttering acceptance computed with spot in 189 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Referendum-PT-0020-LTLCardinality-09
Product exploration explored 100000 steps with 20000 reset in 108 ms.
Product exploration explored 100000 steps with 20000 reset in 115 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2 transition count 2
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(NOT p0), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 14 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Referendum-PT-0020-LTLCardinality-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-PT-0020-LTLCardinality-09 finished in 573 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p0))||(G((p1||F(p0)))&&F(p2)))))'
Support contains 4 out of 61 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 61/61 places, 41/41 transitions.
Reduce places removed 37 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 54 rules applied. Total rules applied 54 place count 24 transition count 24
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 69 place count 9 transition count 9
Iterating global reduction 1 with 15 rules applied. Total rules applied 84 place count 9 transition count 9
Applied a total of 84 rules in 1 ms. Remains 9 /61 variables (removed 52) and now considering 9/41 (removed 32) transitions.
// Phase 1: matrix 9 rows 9 cols
[2025-06-03 18:28:37] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:28:37] [INFO ] Implicit Places using invariants in 17 ms returned []
[2025-06-03 18:28:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:28:37] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
Running 8 sub problems to find dead transitions.
[2025-06-03 18:28:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 9/14 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 4/18 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/18 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 0/18 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 18/18 variables, and 9 constraints, problems are : Problem set: 0 solved, 8 unsolved in 131 ms.
Refiners :[State Equation: 9/9 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 9/14 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 4/18 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/18 variables, 6/17 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/18 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 0/18 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 18/18 variables, and 17 constraints, problems are : Problem set: 0 solved, 8 unsolved in 133 ms.
Refiners :[State Equation: 9/9 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 268ms problems are : Problem set: 0 solved, 8 unsolved
Search for dead transitions found 0 dead transitions in 268ms
Starting structural reductions in LTL mode, iteration 1 : 9/61 places, 9/41 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 312 ms. Remains : 9/61 places, 9/41 transitions.
Stuttering acceptance computed with spot in 199 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : Referendum-PT-0020-LTLCardinality-12
Stuttering criterion allowed to conclude after 26 steps with 1 reset in 0 ms.
FORMULA Referendum-PT-0020-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0020-LTLCardinality-12 finished in 535 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F((X(p2)&&p1)))))'
Support contains 3 out of 61 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 61/61 places, 41/41 transitions.
Reduce places removed 39 places and 0 transitions.
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 0 with 58 rules applied. Total rules applied 58 place count 22 transition count 22
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 75 place count 5 transition count 5
Iterating global reduction 1 with 17 rules applied. Total rules applied 92 place count 5 transition count 5
Applied a total of 92 rules in 1 ms. Remains 5 /61 variables (removed 56) and now considering 5/41 (removed 36) transitions.
// Phase 1: matrix 5 rows 5 cols
[2025-06-03 18:28:37] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:28:37] [INFO ] Implicit Places using invariants in 17 ms returned []
[2025-06-03 18:28:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:28:37] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
Running 4 sub problems to find dead transitions.
[2025-06-03 18:28:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 5/8 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 2/10 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 0/10 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 10/10 variables, and 5 constraints, problems are : Problem set: 0 solved, 4 unsolved in 58 ms.
Refiners :[State Equation: 5/5 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 5/8 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 2/10 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/10 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/10 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/10 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 10/10 variables, and 9 constraints, problems are : Problem set: 0 solved, 4 unsolved in 56 ms.
Refiners :[State Equation: 5/5 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 119ms problems are : Problem set: 0 solved, 4 unsolved
Search for dead transitions found 0 dead transitions in 119ms
Starting structural reductions in LTL mode, iteration 1 : 5/61 places, 5/41 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 164 ms. Remains : 5/61 places, 5/41 transitions.
Stuttering acceptance computed with spot in 210 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (OR (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : Referendum-PT-0020-LTLCardinality-13
Stuttering criterion allowed to conclude after 21 steps with 0 reset in 1 ms.
FORMULA Referendum-PT-0020-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0020-LTLCardinality-13 finished in 395 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(p0)&&X(F(((!p1&&X(F(!p2)))||G(F(!p2)))))))))'
Support contains 4 out of 61 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 61/61 places, 41/41 transitions.
Reduce places removed 38 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 56 rules applied. Total rules applied 56 place count 23 transition count 23
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 72 place count 7 transition count 7
Iterating global reduction 1 with 16 rules applied. Total rules applied 88 place count 7 transition count 7
Applied a total of 88 rules in 1 ms. Remains 7 /61 variables (removed 54) and now considering 7/41 (removed 34) transitions.
// Phase 1: matrix 7 rows 7 cols
[2025-06-03 18:28:38] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:28:38] [INFO ] Implicit Places using invariants in 16 ms returned []
[2025-06-03 18:28:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:28:38] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
Running 6 sub problems to find dead transitions.
[2025-06-03 18:28:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 7/11 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 3/14 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 0/14 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 14/14 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 112 ms.
Refiners :[State Equation: 7/7 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 7/11 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 3/14 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/14 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/14 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/14 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 14/14 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 89 ms.
Refiners :[State Equation: 7/7 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 205ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 205ms
Starting structural reductions in LTL mode, iteration 1 : 7/61 places, 7/41 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 254 ms. Remains : 7/61 places, 7/41 transitions.
Stuttering acceptance computed with spot in 247 ms :[(OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), (NOT p0), p2, p2]
Running random walk in product with property : Referendum-PT-0020-LTLCardinality-14
Stuttering criterion allowed to conclude after 21 steps with 0 reset in 0 ms.
FORMULA Referendum-PT-0020-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0020-LTLCardinality-14 finished in 532 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&X(G(p1))&&F(p2))))'
Support contains 5 out of 61 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 61/61 places, 41/41 transitions.
Graph (complete) has 60 edges and 61 vertex of which 8 are kept as prefixes of interest. Removing 53 places using SCC suffix rule.1 ms
Discarding 53 places :
Also discarding 32 output transitions
Drop transitions (Output transitions of discarded places.) removed 32 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 8 transition count 8
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 8 transition count 8
Applied a total of 3 rules in 8 ms. Remains 8 /61 variables (removed 53) and now considering 8/41 (removed 33) transitions.
// Phase 1: matrix 8 rows 8 cols
[2025-06-03 18:28:38] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:28:38] [INFO ] Implicit Places using invariants in 19 ms returned []
[2025-06-03 18:28:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:28:38] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 18:28:38] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2025-06-03 18:28:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 8/12 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 4/16 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/16 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/16 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/16 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 16/16 variables, and 16 constraints, problems are : Problem set: 0 solved, 6 unsolved in 83 ms.
Refiners :[Domain max(s): 8/8 constraints, State Equation: 8/8 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 8/12 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 4/16 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/16 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/16 variables, 5/22 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/16 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 0/16 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 16/16 variables, and 22 constraints, problems are : Problem set: 0 solved, 6 unsolved in 97 ms.
Refiners :[Domain max(s): 8/8 constraints, State Equation: 8/8 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 183ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 183ms
Starting structural reductions in SI_LTL mode, iteration 1 : 8/61 places, 8/41 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 248 ms. Remains : 8/61 places, 8/41 transitions.
Stuttering acceptance computed with spot in 135 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (NOT p2)]
Running random walk in product with property : Referendum-PT-0020-LTLCardinality-15
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA Referendum-PT-0020-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0020-LTLCardinality-15 finished in 400 ms.
All properties solved by simple procedures.
Total runtime 23091 ms.
BK_STOP 1748975319311
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Referendum-PT-0020"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is Referendum-PT-0020, 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 r170-smll-174889233500195"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Referendum-PT-0020.tgz
mv Referendum-PT-0020 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;