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

About the Execution of ITS-Tools for DatabaseWithMutex-PT-02

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

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 600K
-rw-r--r-- 1 mcc users 12K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K 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.7K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 6.4K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 34K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.0K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 23K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 20K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 146K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 18K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 117K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K 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 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 15K 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 DatabaseWithMutex-PT-02-LTLCardinality-00
FORMULA_NAME DatabaseWithMutex-PT-02-LTLCardinality-01
FORMULA_NAME DatabaseWithMutex-PT-02-LTLCardinality-02
FORMULA_NAME DatabaseWithMutex-PT-02-LTLCardinality-03
FORMULA_NAME DatabaseWithMutex-PT-02-LTLCardinality-04
FORMULA_NAME DatabaseWithMutex-PT-02-LTLCardinality-05
FORMULA_NAME DatabaseWithMutex-PT-02-LTLCardinality-06
FORMULA_NAME DatabaseWithMutex-PT-02-LTLCardinality-07
FORMULA_NAME DatabaseWithMutex-PT-02-LTLCardinality-08
FORMULA_NAME DatabaseWithMutex-PT-02-LTLCardinality-09
FORMULA_NAME DatabaseWithMutex-PT-02-LTLCardinality-10
FORMULA_NAME DatabaseWithMutex-PT-02-LTLCardinality-11
FORMULA_NAME DatabaseWithMutex-PT-02-LTLCardinality-12
FORMULA_NAME DatabaseWithMutex-PT-02-LTLCardinality-13
FORMULA_NAME DatabaseWithMutex-PT-02-LTLCardinality-14
FORMULA_NAME DatabaseWithMutex-PT-02-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1748668985082

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DatabaseWithMutex-PT-02
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-05-31 05:23:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-05-31 05:23:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-31 05:23:06] [INFO ] Load time of PNML (sax parser for PT used): 38 ms
[2025-05-31 05:23:06] [INFO ] Transformed 38 places.
[2025-05-31 05:23:06] [INFO ] Transformed 32 transitions.
[2025-05-31 05:23:06] [INFO ] Found NUPN structural information;
[2025-05-31 05:23:06] [INFO ] Parsed PT model containing 38 places and 32 transitions and 88 arcs in 163 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 16 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA DatabaseWithMutex-PT-02-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DatabaseWithMutex-PT-02-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DatabaseWithMutex-PT-02-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DatabaseWithMutex-PT-02-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DatabaseWithMutex-PT-02-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DatabaseWithMutex-PT-02-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 38 out of 38 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 32/32 transitions.
Applied a total of 0 rules in 6 ms. Remains 38 /38 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 38 cols
[2025-05-31 05:23:06] [INFO ] Computed 10 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:23:06] [INFO ] Implicit Places using invariants in 141 ms returned []
[2025-05-31 05:23:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:23:06] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 252 ms to find 0 implicit places.
Running 28 sub problems to find dead transitions.
[2025-05-31 05:23:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 4/40 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/36 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (OVERLAPS) 1/37 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/37 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/37 variables, 2/46 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/37 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (OVERLAPS) 1/38 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/38 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/38 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 11 (OVERLAPS) 32/70 variables, 38/86 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/70 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 13 (OVERLAPS) 0/70 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Real declared 70/70 variables, and 86 constraints, problems are : Problem set: 0 solved, 28 unsolved in 793 ms.
Refiners :[Domain max(s): 38/38 constraints, Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 38/38 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 28 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 4/40 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/36 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (OVERLAPS) 1/37 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/37 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/37 variables, 2/46 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/37 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (OVERLAPS) 1/38 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/38 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/38 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 11 (OVERLAPS) 32/70 variables, 38/86 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/70 variables, 28/114 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/70 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 14 (OVERLAPS) 0/70 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Int declared 70/70 variables, and 114 constraints, problems are : Problem set: 0 solved, 28 unsolved in 662 ms.
Refiners :[Domain max(s): 38/38 constraints, Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 38/38 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1479ms problems are : Problem set: 0 solved, 28 unsolved
Search for dead transitions found 0 dead transitions in 1490ms
Finished structural reductions in LTL mode , in 1 iterations and 1763 ms. Remains : 38/38 places, 32/32 transitions.
Support contains 38 out of 38 places after structural reductions.
[2025-05-31 05:23:08] [INFO ] Flatten gal took : 15 ms
[2025-05-31 05:23:08] [INFO ] Flatten gal took : 8 ms
[2025-05-31 05:23:08] [INFO ] Input system was already deterministic with 32 transitions.
RANDOM walk for 40000 steps (8 resets) in 850 ms. (47 steps per ms) remains 2/20 properties
BEST_FIRST walk for 40004 steps (8 resets) in 190 ms. (209 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 241 ms. (165 steps per ms) remains 2/2 properties
[2025-05-31 05:23:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem AtomicPropp0 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 6/6 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 16/22 variables, 3/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/22 variables, 16/25 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 0/25 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 5/27 variables, 3/28 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/27 variables, 5/33 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/27 variables, 0/33 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Problem AtomicPropp6 is UNSAT
After SMT solving in domain Real declared 38/70 variables, and 37 constraints, problems are : Problem set: 2 solved, 0 unsolved in 38 ms.
Refiners :[Domain max(s): 27/38 constraints, Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/38 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA DatabaseWithMutex-PT-02-LTLCardinality-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 9 simplifications.
FORMULA DatabaseWithMutex-PT-02-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||(p1 U (p2||G(p1)))))))'
Support contains 20 out of 38 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 38/38 places, 32/32 transitions.
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 0 place count 38 transition count 28
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 34 transition count 28
Applied a total of 8 rules in 17 ms. Remains 34 /38 variables (removed 4) and now considering 28/32 (removed 4) transitions.
// Phase 1: matrix 28 rows 34 cols
[2025-05-31 05:23:09] [INFO ] Computed 10 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:23:09] [INFO ] Implicit Places using invariants in 31 ms returned [3, 30]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 34 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 32/38 places, 28/32 transitions.
Applied a total of 0 rules in 2 ms. Remains 32 /32 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 53 ms. Remains : 32/38 places, 28/32 transitions.
Stuttering acceptance computed with spot in 176 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Running random walk in product with property : DatabaseWithMutex-PT-02-LTLCardinality-01
Product exploration explored 100000 steps with 17248 reset in 245 ms.
Stack based approach found an accepted trace after 4436 steps with 770 reset with depth 8 and stack size 8 in 16 ms.
FORMULA DatabaseWithMutex-PT-02-LTLCardinality-01 FALSE TECHNIQUES STACK_TEST
Treatment of property DatabaseWithMutex-PT-02-LTLCardinality-01 finished in 612 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)))'
Support contains 8 out of 38 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 38/38 places, 32/32 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 34 transition count 28
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 12 place count 30 transition count 28
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 20 place count 26 transition count 24
Applied a total of 20 rules in 7 ms. Remains 26 /38 variables (removed 12) and now considering 24/32 (removed 8) transitions.
// Phase 1: matrix 24 rows 26 cols
[2025-05-31 05:23:09] [INFO ] Computed 6 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:23:09] [INFO ] Implicit Places using invariants in 31 ms returned [2, 23]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 33 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 24/38 places, 24/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 24/24 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 42 ms. Remains : 24/38 places, 24/32 transitions.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DatabaseWithMutex-PT-02-LTLCardinality-03
Product exploration explored 100000 steps with 17991 reset in 106 ms.
Stack based approach found an accepted trace after 37111 steps with 6708 reset with depth 15 and stack size 15 in 41 ms.
FORMULA DatabaseWithMutex-PT-02-LTLCardinality-03 FALSE TECHNIQUES STACK_TEST
Treatment of property DatabaseWithMutex-PT-02-LTLCardinality-03 finished in 264 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||(G((p1 U p2)) U X(p3))))&&F(p1)))'
Support contains 16 out of 38 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 38 /38 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 38 cols
[2025-05-31 05:23:10] [INFO ] Computed 10 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:23:10] [INFO ] Implicit Places using invariants in 43 ms returned [3, 34]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 45 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 36/38 places, 32/32 transitions.
Applied a total of 0 rules in 0 ms. Remains 36 /36 variables (removed 0) and now considering 32/32 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 46 ms. Remains : 36/38 places, 32/32 transitions.
Stuttering acceptance computed with spot in 357 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3)), (NOT p1), (NOT p3), (NOT p3), true, (NOT p2), (NOT p2)]
Running random walk in product with property : DatabaseWithMutex-PT-02-LTLCardinality-04
Product exploration explored 100000 steps with 50000 reset in 96 ms.
Product exploration explored 100000 steps with 50000 reset in 83 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0 p2 p3), (X (NOT p2)), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (OR (AND p1 (NOT p0)) (AND (NOT p0) p2)))), (X p0), (X p1), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3)))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND p1 (NOT p2) (NOT p3)))), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X (NOT p3))), (X (X p3)), (X (X (OR (AND p1 (NOT p3)) (AND p2 (NOT p3))))), (X (X (NOT (OR (AND p1 (NOT p3)) (AND p2 (NOT p3))))))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 22 ms. Reduced automaton from 8 states, 16 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DatabaseWithMutex-PT-02-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DatabaseWithMutex-PT-02-LTLCardinality-04 finished in 635 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(p0)) U G(p0))))'
Support contains 6 out of 38 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 32/32 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 34 transition count 32
Applied a total of 4 rules in 1 ms. Remains 34 /38 variables (removed 4) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 34 cols
[2025-05-31 05:23:10] [INFO ] Computed 6 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:23:10] [INFO ] Implicit Places using invariants in 33 ms returned [3, 30]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 34 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 32/38 places, 32/32 transitions.
Applied a total of 0 rules in 0 ms. Remains 32 /32 variables (removed 0) and now considering 32/32 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 36 ms. Remains : 32/38 places, 32/32 transitions.
Stuttering acceptance computed with spot in 111 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DatabaseWithMutex-PT-02-LTLCardinality-05
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA DatabaseWithMutex-PT-02-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DatabaseWithMutex-PT-02-LTLCardinality-05 finished in 163 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((p0&&F(p1)))))'
Support contains 12 out of 38 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 32/32 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 34 transition count 32
Applied a total of 4 rules in 1 ms. Remains 34 /38 variables (removed 4) and now considering 32/32 (removed 0) transitions.
[2025-05-31 05:23:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:23:10] [INFO ] Implicit Places using invariants in 27 ms returned []
[2025-05-31 05:23:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:23:11] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
Running 28 sub problems to find dead transitions.
[2025-05-31 05:23:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 4/36 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (OVERLAPS) 2/34 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/34 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (OVERLAPS) 32/66 variables, 34/74 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/66 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (OVERLAPS) 0/66 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Real declared 66/66 variables, and 74 constraints, problems are : Problem set: 0 solved, 28 unsolved in 425 ms.
Refiners :[Domain max(s): 34/34 constraints, Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 34/34 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 28 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 4/36 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (OVERLAPS) 2/34 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/34 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (OVERLAPS) 32/66 variables, 34/74 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/66 variables, 28/102 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/66 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (OVERLAPS) 0/66 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Int declared 66/66 variables, and 102 constraints, problems are : Problem set: 0 solved, 28 unsolved in 484 ms.
Refiners :[Domain max(s): 34/34 constraints, Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 34/34 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 916ms problems are : Problem set: 0 solved, 28 unsolved
Search for dead transitions found 0 dead transitions in 916ms
Starting structural reductions in LTL mode, iteration 1 : 34/38 places, 32/32 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 983 ms. Remains : 34/38 places, 32/32 transitions.
Stuttering acceptance computed with spot in 170 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : DatabaseWithMutex-PT-02-LTLCardinality-06
Product exploration explored 100000 steps with 12719 reset in 73 ms.
Product exploration explored 100000 steps with 12698 reset in 75 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 82 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 155 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 28 steps (0 resets) in 5 ms. (4 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) p0), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 4 factoid took 119 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 165 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 164 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
[2025-05-31 05:23:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-31 05:23:13] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-05-31 05:23:13] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2025-05-31 05:23:13] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-31 05:23:13] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-05-31 05:23:13] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2025-05-31 05:23:13] [INFO ] Computed and/alt/rep : 28/28/28 causal constraints (skipped 0 transitions) in 2 ms.
[2025-05-31 05:23:13] [INFO ] Added : 6 causal constraints over 2 iterations in 13 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 6 out of 34 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 34/34 places, 32/32 transitions.
Applied a total of 0 rules in 0 ms. Remains 34 /34 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2025-05-31 05:23:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:23:13] [INFO ] Implicit Places using invariants in 30 ms returned []
[2025-05-31 05:23:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:23:13] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
Running 28 sub problems to find dead transitions.
[2025-05-31 05:23:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 4/36 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (OVERLAPS) 2/34 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/34 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (OVERLAPS) 32/66 variables, 34/74 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/66 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (OVERLAPS) 0/66 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Real declared 66/66 variables, and 74 constraints, problems are : Problem set: 0 solved, 28 unsolved in 429 ms.
Refiners :[Domain max(s): 34/34 constraints, Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 34/34 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 28 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 4/36 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (OVERLAPS) 2/34 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/34 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (OVERLAPS) 32/66 variables, 34/74 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/66 variables, 28/102 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/66 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (OVERLAPS) 0/66 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Int declared 66/66 variables, and 102 constraints, problems are : Problem set: 0 solved, 28 unsolved in 502 ms.
Refiners :[Domain max(s): 34/34 constraints, Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 34/34 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 937ms problems are : Problem set: 0 solved, 28 unsolved
Search for dead transitions found 0 dead transitions in 938ms
Finished structural reductions in LTL mode , in 1 iterations and 1023 ms. Remains : 34/34 places, 32/32 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p1)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 68 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 137 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 28 steps (0 resets) in 5 ms. (4 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p1)]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 1 factoid took 99 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 163 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 142 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
[2025-05-31 05:23:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-31 05:23:14] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2025-05-31 05:23:14] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2025-05-31 05:23:14] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-31 05:23:14] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-05-31 05:23:14] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2025-05-31 05:23:14] [INFO ] Computed and/alt/rep : 28/28/28 causal constraints (skipped 0 transitions) in 2 ms.
[2025-05-31 05:23:14] [INFO ] Added : 6 causal constraints over 2 iterations in 12 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 144 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 12724 reset in 59 ms.
Product exploration explored 100000 steps with 12708 reset in 178 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 146 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Support contains 6 out of 34 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 34/34 places, 32/32 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 34 transition count 32
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 9 place count 34 transition count 32
Deduced a syphon composed of 12 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 12 place count 34 transition count 32
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 33 transition count 31
Deduced a syphon composed of 11 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 33 transition count 31
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 15 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 18 place count 33 transition count 31
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 22 place count 29 transition count 27
Deduced a syphon composed of 11 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 26 place count 29 transition count 27
Deduced a syphon composed of 11 places in 0 ms
Applied a total of 26 rules in 10 ms. Remains 29 /34 variables (removed 5) and now considering 27/32 (removed 5) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 05:23:15] [INFO ] Redundant transitions in 1 ms returned []
Running 23 sub problems to find dead transitions.
// Phase 1: matrix 27 rows 29 cols
[2025-05-31 05:23:15] [INFO ] Computed 6 invariants in 1 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 23 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:23:15] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 4 ms to minimize.
Problem TDEAD0 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 05:23:15] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 2 ms to minimize.
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 2/6 constraints. Problems are: Problem set: 11 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/6 constraints. Problems are: Problem set: 11 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 2/29 variables, 2/8 constraints. Problems are: Problem set: 11 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/8 constraints. Problems are: Problem set: 11 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 27/56 variables, 29/37 constraints. Problems are: Problem set: 11 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/56 variables, 0/37 constraints. Problems are: Problem set: 11 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 0/56 variables, 0/37 constraints. Problems are: Problem set: 11 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 56/56 variables, and 37 constraints, problems are : Problem set: 11 solved, 12 unsolved in 255 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 29/29 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 11 solved, 12 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 2/2 constraints. Problems are: Problem set: 11 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/16 variables, 2/4 constraints. Problems are: Problem set: 11 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/4 constraints. Problems are: Problem set: 11 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 13/29 variables, 4/8 constraints. Problems are: Problem set: 11 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/8 constraints. Problems are: Problem set: 11 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 27/56 variables, 29/37 constraints. Problems are: Problem set: 11 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/56 variables, 12/49 constraints. Problems are: Problem set: 11 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/56 variables, 0/49 constraints. Problems are: Problem set: 11 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 0/56 variables, 0/49 constraints. Problems are: Problem set: 11 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 56/56 variables, and 49 constraints, problems are : Problem set: 11 solved, 12 unsolved in 184 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 29/29 constraints, PredecessorRefiner: 12/23 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 443ms problems are : Problem set: 11 solved, 12 unsolved
Search for dead transitions found 11 dead transitions in 445ms
Found 11 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 11 transitions
Dead transitions reduction (with SMT) removed 11 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 29/34 places, 16/32 transitions.
Graph (complete) has 32 edges and 29 vertex of which 18 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.1 ms
Discarding 11 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 2 ms. Remains 18 /29 variables (removed 11) and now considering 16/16 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 18/34 places, 16/32 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 464 ms. Remains : 18/34 places, 16/32 transitions.
Built C files in :
/tmp/ltsmin11620870496753358864
[2025-05-31 05:23:16] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11620870496753358864
Running compilation step : cd /tmp/ltsmin11620870496753358864;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 207 ms.
Running link step : cd /tmp/ltsmin11620870496753358864;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin11620870496753358864;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased11756201331987098066.hoa' '--buchi-type=spotba'
LTSmin run took 241 ms.
FORMULA DatabaseWithMutex-PT-02-LTLCardinality-06 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DatabaseWithMutex-PT-02-LTLCardinality-06 finished in 5665 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 38 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 32/32 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 34 transition count 32
Applied a total of 4 rules in 2 ms. Remains 34 /38 variables (removed 4) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 34 cols
[2025-05-31 05:23:16] [INFO ] Computed 6 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:23:16] [INFO ] Implicit Places using invariants in 37 ms returned [3, 30]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 38 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 32/38 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 32/32 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 41 ms. Remains : 32/38 places, 32/32 transitions.
Stuttering acceptance computed with spot in 85 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DatabaseWithMutex-PT-02-LTLCardinality-08
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DatabaseWithMutex-PT-02-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DatabaseWithMutex-PT-02-LTLCardinality-08 finished in 137 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(G((p0 U p1))) U (G(!p0) U p2)))'
Support contains 3 out of 38 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 38/38 places, 32/32 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 34 transition count 21
Reduce places removed 11 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 13 rules applied. Total rules applied 28 place count 23 transition count 19
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 30 place count 21 transition count 19
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 34 place count 19 transition count 17
Applied a total of 34 rules in 5 ms. Remains 19 /38 variables (removed 19) and now considering 17/32 (removed 15) transitions.
// Phase 1: matrix 17 rows 19 cols
[2025-05-31 05:23:16] [INFO ] Computed 6 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:23:16] [INFO ] Implicit Places using invariants in 23 ms returned [17]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 24 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 18/38 places, 17/32 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 18 transition count 15
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 16 transition count 15
Applied a total of 4 rules in 2 ms. Remains 16 /18 variables (removed 2) and now considering 15/17 (removed 2) transitions.
// Phase 1: matrix 15 rows 16 cols
[2025-05-31 05:23:16] [INFO ] Computed 5 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:23:16] [INFO ] Implicit Places using invariants in 22 ms returned []
[2025-05-31 05:23:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:23:16] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 16/38 places, 15/32 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 81 ms. Remains : 16/38 places, 15/32 transitions.
Stuttering acceptance computed with spot in 166 ms :[(NOT p2), (NOT p1), (AND p0 (NOT p1)), (NOT p1)]
Running random walk in product with property : DatabaseWithMutex-PT-02-LTLCardinality-09
Product exploration explored 100000 steps with 6088 reset in 84 ms.
Stack based approach found an accepted trace after 17 steps with 0 reset with depth 18 and stack size 18 in 0 ms.
FORMULA DatabaseWithMutex-PT-02-LTLCardinality-09 FALSE TECHNIQUES STACK_TEST
Treatment of property DatabaseWithMutex-PT-02-LTLCardinality-09 finished in 346 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 38 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 32/32 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 34 transition count 32
Applied a total of 4 rules in 1 ms. Remains 34 /38 variables (removed 4) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 34 cols
[2025-05-31 05:23:17] [INFO ] Computed 6 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:23:17] [INFO ] Implicit Places using invariants in 30 ms returned [3, 30]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 32 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 32/38 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 32/32 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 34 ms. Remains : 32/38 places, 32/32 transitions.
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DatabaseWithMutex-PT-02-LTLCardinality-12
Product exploration explored 100000 steps with 50000 reset in 57 ms.
Product exploration explored 100000 steps with 50000 reset in 49 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 14 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DatabaseWithMutex-PT-02-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DatabaseWithMutex-PT-02-LTLCardinality-12 finished in 230 ms.
All properties solved by simple procedures.
Total runtime 11050 ms.

BK_STOP 1748668997371

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
++ perl -pe 's/.*\.//g'
+ 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="DatabaseWithMutex-PT-02"
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 DatabaseWithMutex-PT-02, 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 r044-tall-174854029200827"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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