Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 616K
-rw-r--r-- 1 mcc users 11K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 106K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.3K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K 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 4.2K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.9K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 73K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 23K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 155K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 13 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rwxr-xr-x 1 mcc users 60K 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 IOTPpurchase-PT-C05M04P03D02-LTLCardinality-00
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-LTLCardinality-01
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-LTLCardinality-02
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-LTLCardinality-03
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-LTLCardinality-04
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-LTLCardinality-05
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-LTLCardinality-06
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-LTLCardinality-07
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-LTLCardinality-08
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-LTLCardinality-09
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-LTLCardinality-10
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-LTLCardinality-11
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-LTLCardinality-12
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-LTLCardinality-13
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-LTLCardinality-14
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1748836450401

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=IOTPpurchase-PT-C05M04P03D02
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-06-02 03:54:11] [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-02 03:54:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 03:54:11] [INFO ] Load time of PNML (sax parser for PT used): 60 ms
[2025-06-02 03:54:11] [INFO ] Transformed 111 places.
[2025-06-02 03:54:11] [INFO ] Transformed 45 transitions.
[2025-06-02 03:54:12] [INFO ] Parsed PT model containing 111 places and 45 transitions and 224 arcs in 166 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA IOTPpurchase-PT-C05M04P03D02-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IOTPpurchase-PT-C05M04P03D02-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IOTPpurchase-PT-C05M04P03D02-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IOTPpurchase-PT-C05M04P03D02-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 34 out of 111 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 45/45 transitions.
Ensure Unique test removed 30 places
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 76 transition count 45
Applied a total of 35 rules in 21 ms. Remains 76 /111 variables (removed 35) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 76 cols
[2025-06-02 03:54:12] [INFO ] Computed 32 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:54:12] [INFO ] Implicit Places using invariants in 224 ms returned [9, 17, 33]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 261 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 73/111 places, 45/45 transitions.
Applied a total of 0 rules in 2 ms. Remains 73 /73 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 299 ms. Remains : 73/111 places, 45/45 transitions.
Support contains 34 out of 73 places after structural reductions.
[2025-06-02 03:54:12] [INFO ] Flatten gal took : 34 ms
[2025-06-02 03:54:12] [INFO ] Flatten gal took : 14 ms
[2025-06-02 03:54:12] [INFO ] Input system was already deterministic with 45 transitions.
RANDOM walk for 40000 steps (8 resets) in 1161 ms. (34 steps per ms) remains 4/26 properties
BEST_FIRST walk for 40001 steps (8 resets) in 293 ms. (136 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 129 ms. (307 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 122 ms. (325 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 143 ms. (277 steps per ms) remains 1/2 properties
// Phase 1: matrix 45 rows 73 cols
[2025-06-02 03:54:13] [INFO ] Computed 29 invariants in 3 ms
Starting Z3 with timeout 5.0 s and query timeout 500.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) 7/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 36/44 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 14/58 variables, 11/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/58 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/59 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/59 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp2 is UNSAT
After SMT solving in domain Real declared 73/118 variables, and 29 constraints, problems are : Problem set: 1 solved, 0 unsolved in 171 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 0/73 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 194ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
FORMULA IOTPpurchase-PT-C05M04P03D02-LTLCardinality-02 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' '!(X(G((p0||X(p1)))))'
Support contains 3 out of 73 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 73/73 places, 45/45 transitions.
Ensure Unique test removed 6 places
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 66 transition count 45
Applied a total of 7 rules in 3 ms. Remains 66 /73 variables (removed 7) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 66 cols
[2025-06-02 03:54:13] [INFO ] Computed 22 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:54:13] [INFO ] Implicit Places using invariants in 50 ms returned [12, 16]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 51 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 64/73 places, 45/45 transitions.
Applied a total of 0 rules in 3 ms. Remains 64 /64 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 57 ms. Remains : 64/73 places, 45/45 transitions.
Stuttering acceptance computed with spot in 258 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : IOTPpurchase-PT-C05M04P03D02-LTLCardinality-00
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA IOTPpurchase-PT-C05M04P03D02-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IOTPpurchase-PT-C05M04P03D02-LTLCardinality-00 finished in 384 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)&&((G(p1)||G(p2)) U X(p3))))'
Support contains 6 out of 73 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 73/73 places, 45/45 transitions.
Ensure Unique test removed 6 places
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 64 transition count 45
Applied a total of 9 rules in 4 ms. Remains 64 /73 variables (removed 9) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 64 cols
[2025-06-02 03:54:14] [INFO ] Computed 20 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:54:14] [INFO ] Implicit Places using invariants in 65 ms returned [14, 19]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 71 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 62/73 places, 45/45 transitions.
Applied a total of 0 rules in 3 ms. Remains 62 /62 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 79 ms. Remains : 62/73 places, 45/45 transitions.
Stuttering acceptance computed with spot in 384 ms :[(OR (NOT p0) (NOT p3)), (NOT p0), (NOT p3), (AND (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), true, (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : IOTPpurchase-PT-C05M04P03D02-LTLCardinality-03
Product exploration explored 100000 steps with 50000 reset in 264 ms.
Product exploration explored 100000 steps with 50000 reset in 186 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 p0 (NOT p1) (NOT p2) p3), (X (NOT p2)), (X (NOT (AND p1 (NOT p2) (NOT p3)))), (X (NOT (OR (AND p1 (NOT p3)) (AND p2 (NOT p3))))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (X p3), (X (NOT (AND (NOT p1) p2 (NOT p3)))), (X p0), (X (NOT (AND (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p2) (NOT p3)))), (X (NOT (AND p2 (NOT p3)))), (X (NOT (AND p1 p2 (NOT p3)))), (X (NOT (AND p1 (NOT p3)))), (X (NOT p1)), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (OR (AND p1 (NOT p3)) (AND p2 (NOT p3)))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X p3)), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT (AND p1 p2 (NOT p3))))), (X (X (NOT (AND p1 (NOT p3))))), (X (X (NOT p2))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 31 factoid took 24 ms. Reduced automaton from 11 states, 30 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA IOTPpurchase-PT-C05M04P03D02-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property IOTPpurchase-PT-C05M04P03D02-LTLCardinality-03 finished in 972 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(G(p1)))))'
Support contains 3 out of 73 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 73/73 places, 45/45 transitions.
Ensure Unique test removed 5 places
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 65 transition count 37
Reduce places removed 13 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 22 rules applied. Total rules applied 33 place count 52 transition count 28
Reduce places removed 9 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 10 rules applied. Total rules applied 43 place count 43 transition count 27
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 46 place count 41 transition count 26
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 47 place count 40 transition count 26
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 8 Pre rules applied. Total rules applied 47 place count 40 transition count 18
Deduced a syphon composed of 8 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 5 with 21 rules applied. Total rules applied 68 place count 27 transition count 18
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 68 place count 27 transition count 15
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 74 place count 24 transition count 15
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 15 rules applied. Total rules applied 89 place count 15 transition count 9
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 2 rules applied. Total rules applied 91 place count 14 transition count 8
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 92 place count 13 transition count 8
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 92 place count 13 transition count 7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 3 rules applied. Total rules applied 95 place count 11 transition count 7
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 1 rules applied. Total rules applied 96 place count 11 transition count 6
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 8 with 3 rules applied. Total rules applied 99 place count 9 transition count 5
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 100 place count 8 transition count 5
Applied a total of 100 rules in 29 ms. Remains 8 /73 variables (removed 65) and now considering 5/45 (removed 40) transitions.
// Phase 1: matrix 5 rows 8 cols
[2025-06-02 03:54:15] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:54:15] [INFO ] Implicit Places using invariants in 165 ms returned []
[2025-06-02 03:54:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:54:15] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 202 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 03:54:15] [INFO ] Redundant transitions in 0 ms returned []
Running 4 sub problems to find dead transitions.
[2025-06-02 03:54:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 2/8 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 5/13 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 12 constraints, problems are : Problem set: 0 solved, 4 unsolved in 67 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 8/8 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/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 2/8 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 5/13 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/13 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 0/13 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 16 constraints, problems are : Problem set: 0 solved, 4 unsolved in 64 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 8/8 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 135ms problems are : Problem set: 0 solved, 4 unsolved
Search for dead transitions found 0 dead transitions in 137ms
Starting structural reductions in SI_LTL mode, iteration 1 : 8/73 places, 5/45 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 385 ms. Remains : 8/73 places, 5/45 transitions.
Stuttering acceptance computed with spot in 107 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : IOTPpurchase-PT-C05M04P03D02-LTLCardinality-04
Product exploration explored 100000 steps with 0 reset in 107 ms.
Stack based approach found an accepted trace after 8 steps with 0 reset with depth 9 and stack size 9 in 0 ms.
FORMULA IOTPpurchase-PT-C05M04P03D02-LTLCardinality-04 FALSE TECHNIQUES STACK_TEST
Treatment of property IOTPpurchase-PT-C05M04P03D02-LTLCardinality-04 finished in 613 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(F((G(p0)||(p0&&F(G(p1))))))||(!p1&&X(X(X(F((G(p0)||(p0&&F(G(p1))))))))))))'
Support contains 4 out of 73 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 73/73 places, 45/45 transitions.
Ensure Unique test removed 6 places
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 64 transition count 45
Applied a total of 9 rules in 4 ms. Remains 64 /73 variables (removed 9) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 64 cols
[2025-06-02 03:54:15] [INFO ] Computed 20 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:54:15] [INFO ] Implicit Places using invariants in 86 ms returned [12, 17]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 87 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 62/73 places, 45/45 transitions.
Applied a total of 0 rules in 2 ms. Remains 62 /62 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 94 ms. Remains : 62/73 places, 45/45 transitions.
Stuttering acceptance computed with spot in 197 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : IOTPpurchase-PT-C05M04P03D02-LTLCardinality-07
Product exploration explored 100000 steps with 3 reset in 181 ms.
Stack based approach found an accepted trace after 1549 steps with 0 reset with depth 1550 and stack size 1550 in 5 ms.
FORMULA IOTPpurchase-PT-C05M04P03D02-LTLCardinality-07 FALSE TECHNIQUES STACK_TEST
Treatment of property IOTPpurchase-PT-C05M04P03D02-LTLCardinality-07 finished in 511 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) U p1)||G(p2)||X(!p1)))'
Support contains 3 out of 73 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 73/73 places, 45/45 transitions.
Ensure Unique test removed 6 places
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 64 transition count 45
Applied a total of 9 rules in 5 ms. Remains 64 /73 variables (removed 9) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 64 cols
[2025-06-02 03:54:16] [INFO ] Computed 20 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:54:16] [INFO ] Implicit Places using invariants in 51 ms returned [12, 16]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 52 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 62/73 places, 45/45 transitions.
Applied a total of 0 rules in 1 ms. Remains 62 /62 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 59 ms. Remains : 62/73 places, 45/45 transitions.
Stuttering acceptance computed with spot in 174 ms :[(NOT p0), (AND (NOT p0) p1), false, (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) p1)]
Running random walk in product with property : IOTPpurchase-PT-C05M04P03D02-LTLCardinality-08
Product exploration explored 100000 steps with 50000 reset in 100 ms.
Product exploration explored 100000 steps with 50000 reset in 118 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 p0) (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT p0)), (X (NOT (AND p1 (NOT p0) p2))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 11 factoid took 19 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA IOTPpurchase-PT-C05M04P03D02-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property IOTPpurchase-PT-C05M04P03D02-LTLCardinality-08 finished in 493 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)) U ((p1&&X(X(p0)))||X(X(G(p0))))))'
Support contains 3 out of 73 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 73/73 places, 45/45 transitions.
Ensure Unique test removed 6 places
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 65 transition count 45
Applied a total of 8 rules in 6 ms. Remains 65 /73 variables (removed 8) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 65 cols
[2025-06-02 03:54:16] [INFO ] Computed 21 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:54:16] [INFO ] Implicit Places using invariants in 63 ms returned [12, 17]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 77 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 63/73 places, 45/45 transitions.
Applied a total of 0 rules in 2 ms. Remains 63 /63 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 85 ms. Remains : 63/73 places, 45/45 transitions.
Stuttering acceptance computed with spot in 120 ms :[(NOT p0), (NOT p0), (NOT p0), true]
Running random walk in product with property : IOTPpurchase-PT-C05M04P03D02-LTLCardinality-09
Product exploration explored 100000 steps with 25101 reset in 113 ms.
Product exploration explored 100000 steps with 25036 reset in 122 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 p0 (NOT p1)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p0)), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (AND (NOT p1) p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 90 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), (NOT p0), (NOT p0), true]
RANDOM walk for 573 steps (0 resets) in 11 ms. (47 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p0)), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (AND (NOT p1) p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT p0)), (F (NOT (OR p0 p1))), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 9 factoid took 191 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 108 ms :[(NOT p0), (NOT p0), (NOT p0), true]
Stuttering acceptance computed with spot in 120 ms :[(NOT p0), (NOT p0), (NOT p0), true]
Support contains 3 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 45/45 transitions.
Applied a total of 0 rules in 4 ms. Remains 63 /63 variables (removed 0) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 63 cols
[2025-06-02 03:54:17] [INFO ] Computed 19 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:54:18] [INFO ] Implicit Places using invariants in 56 ms returned []
[2025-06-02 03:54:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:54:18] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
Running 44 sub problems to find dead transitions.
[2025-06-02 03:54:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (OVERLAPS) 1/63 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (OVERLAPS) 45/108 variables, 63/82 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/108 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (OVERLAPS) 0/108 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Real declared 108/108 variables, and 82 constraints, problems are : Problem set: 0 solved, 44 unsolved in 1218 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 63/63 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 44 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (OVERLAPS) 1/63 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (OVERLAPS) 45/108 variables, 63/82 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/108 variables, 44/126 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/108 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 8 (OVERLAPS) 0/108 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Int declared 108/108 variables, and 126 constraints, problems are : Problem set: 0 solved, 44 unsolved in 920 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 63/63 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2149ms problems are : Problem set: 0 solved, 44 unsolved
Search for dead transitions found 0 dead transitions in 2150ms
Finished structural reductions in LTL mode , in 1 iterations and 2267 ms. Remains : 63/63 places, 45/45 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 : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (X p0)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 95 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 128 ms :[(NOT p0), (NOT p0), (NOT p0), true]
RANDOM walk for 649 steps (0 resets) in 15 ms. (40 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (X p0)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT p0)), (F (NOT (OR p0 p1))), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 9 factoid took 185 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 126 ms :[(NOT p0), (NOT p0), (NOT p0), true]
Stuttering acceptance computed with spot in 113 ms :[(NOT p0), (NOT p0), (NOT p0), true]
Stuttering acceptance computed with spot in 131 ms :[(NOT p0), (NOT p0), (NOT p0), true]
Product exploration explored 100000 steps with 24988 reset in 107 ms.
Product exploration explored 100000 steps with 25044 reset in 181 ms.
Applying partial POR strategy [false, true, false, true]
Stuttering acceptance computed with spot in 120 ms :[(NOT p0), (NOT p0), (NOT p0), true]
Support contains 3 out of 63 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 places, 45/45 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 63 transition count 45
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 14 Pre rules applied. Total rules applied 7 place count 63 transition count 45
Deduced a syphon composed of 21 places in 0 ms
Iterating global reduction 1 with 14 rules applied. Total rules applied 21 place count 63 transition count 45
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 28 places in 0 ms
Iterating global reduction 1 with 7 rules applied. Total rules applied 28 place count 63 transition count 45
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 62 transition count 44
Deduced a syphon composed of 27 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 62 transition count 44
Deduced a syphon composed of 27 places in 0 ms
Applied a total of 30 rules in 14 ms. Remains 62 /63 variables (removed 1) and now considering 44/45 (removed 1) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 03:54:21] [INFO ] Redundant transitions in 0 ms returned []
Running 43 sub problems to find dead transitions.
// Phase 1: matrix 44 rows 62 cols
[2025-06-02 03:54:21] [INFO ] Computed 19 invariants in 1 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 43 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:54:21] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:54:21] [INFO ] Deduced a trap composed of 1 places in 24 ms of which 2 ms to minimize.
Problem TDEAD1 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:54:21] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:54:21] [INFO ] Deduced a trap composed of 1 places in 16 ms of which 2 ms to minimize.
Problem TDEAD2 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:54:21] [INFO ] Deduced a trap composed of 1 places in 18 ms of which 1 ms to minimize.
Problem TDEAD3 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:54:21] [INFO ] Deduced a trap composed of 1 places in 21 ms of which 2 ms to minimize.
Problem TDEAD5 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:54:21] [INFO ] Deduced a trap composed of 1 places in 19 ms of which 2 ms to minimize.
Problem TDEAD6 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:54:21] [INFO ] Deduced a trap composed of 1 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:54:22] [INFO ] Deduced a trap composed of 1 places in 23 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:54:22] [INFO ] Deduced a trap composed of 1 places in 22 ms of which 2 ms to minimize.
Problem TDEAD8 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:54:22] [INFO ] Deduced a trap composed of 1 places in 20 ms of which 2 ms to minimize.
Problem TDEAD10 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:54:22] [INFO ] Deduced a trap composed of 1 places in 16 ms of which 1 ms to minimize.
Problem TDEAD11 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD7 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 12/30 constraints. Problems are: Problem set: 10 solved, 33 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 0/30 constraints. Problems are: Problem set: 10 solved, 33 unsolved
At refinement iteration 4 (OVERLAPS) 1/62 variables, 1/31 constraints. Problems are: Problem set: 10 solved, 33 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/62 variables, 0/31 constraints. Problems are: Problem set: 10 solved, 33 unsolved
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD41 is UNSAT
At refinement iteration 6 (OVERLAPS) 44/106 variables, 62/93 constraints. Problems are: Problem set: 27 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/106 variables, 0/93 constraints. Problems are: Problem set: 27 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 0/106 variables, 0/93 constraints. Problems are: Problem set: 27 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 106/106 variables, and 93 constraints, problems are : Problem set: 27 solved, 16 unsolved in 851 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 62/62 constraints, PredecessorRefiner: 43/43 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 27 solved, 16 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 3/3 constraints. Problems are: Problem set: 27 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 9/12 constraints. Problems are: Problem set: 27 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/12 constraints. Problems are: Problem set: 27 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 29/61 variables, 13/25 constraints. Problems are: Problem set: 27 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 2/27 constraints. Problems are: Problem set: 27 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 2/29 constraints. Problems are: Problem set: 27 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/61 variables, 0/29 constraints. Problems are: Problem set: 27 solved, 16 unsolved
At refinement iteration 7 (OVERLAPS) 1/62 variables, 1/30 constraints. Problems are: Problem set: 27 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/62 variables, 1/31 constraints. Problems are: Problem set: 27 solved, 16 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/62 variables, 0/31 constraints. Problems are: Problem set: 27 solved, 16 unsolved
At refinement iteration 10 (OVERLAPS) 44/106 variables, 62/93 constraints. Problems are: Problem set: 27 solved, 16 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/106 variables, 16/109 constraints. Problems are: Problem set: 27 solved, 16 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/106 variables, 0/109 constraints. Problems are: Problem set: 27 solved, 16 unsolved
At refinement iteration 13 (OVERLAPS) 0/106 variables, 0/109 constraints. Problems are: Problem set: 27 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 106/106 variables, and 109 constraints, problems are : Problem set: 27 solved, 16 unsolved in 431 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 62/62 constraints, PredecessorRefiner: 16/43 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1289ms problems are : Problem set: 27 solved, 16 unsolved
Search for dead transitions found 27 dead transitions in 1291ms
Found 27 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 27 transitions
Dead transitions reduction (with SMT) removed 27 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 62/63 places, 17/45 transitions.
Graph (complete) has 73 edges and 62 vertex of which 35 are kept as prefixes of interest. Removing 27 places using SCC suffix rule.2 ms
Discarding 27 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 places
Reduce places removed 11 places and 0 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 23 transition count 17
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 4 Pre rules applied. Total rules applied 5 place count 23 transition count 17
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 9 place count 23 transition count 17
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 22 transition count 16
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 22 transition count 16
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 13 place count 22 transition count 16
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 21 transition count 15
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 21 transition count 15
Deduced a syphon composed of 7 places in 0 ms
Applied a total of 15 rules in 11 ms. Remains 21 /62 variables (removed 41) and now considering 15/17 (removed 2) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 21/63 places, 15/45 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1322 ms. Remains : 21/63 places, 15/45 transitions.
Built C files in :
/tmp/ltsmin11723394354438478565
[2025-06-02 03:54:22] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11723394354438478565
Running compilation step : cd /tmp/ltsmin11723394354438478565;'/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 261 ms.
Running link step : cd /tmp/ltsmin11723394354438478565;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin11723394354438478565;'/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/stateBased5866993283720111269.hoa' '--buchi-type=spotba'
LTSmin run took 145 ms.
FORMULA IOTPpurchase-PT-C05M04P03D02-LTLCardinality-09 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property IOTPpurchase-PT-C05M04P03D02-LTLCardinality-09 finished in 6633 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)))'
Support contains 3 out of 73 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 73/73 places, 45/45 transitions.
Ensure Unique test removed 6 places
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 64 transition count 37
Reduce places removed 14 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 1 with 25 rules applied. Total rules applied 36 place count 50 transition count 26
Reduce places removed 11 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 12 rules applied. Total rules applied 48 place count 39 transition count 25
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 49 place count 38 transition count 25
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 49 place count 38 transition count 17
Deduced a syphon composed of 8 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 21 rules applied. Total rules applied 70 place count 25 transition count 17
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 71 place count 25 transition count 16
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 72 place count 24 transition count 16
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 72 place count 24 transition count 15
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 74 place count 23 transition count 15
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 6 places and 0 transitions.
Iterating global reduction 6 with 10 rules applied. Total rules applied 84 place count 17 transition count 11
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 6 with 1 rules applied. Total rules applied 85 place count 16 transition count 11
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 85 place count 16 transition count 10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 3 rules applied. Total rules applied 88 place count 14 transition count 10
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 1 rules applied. Total rules applied 89 place count 14 transition count 9
Reduce places removed 2 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 8 with 3 rules applied. Total rules applied 92 place count 12 transition count 8
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 9 with 2 rules applied. Total rules applied 94 place count 11 transition count 7
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 95 place count 10 transition count 7
Applied a total of 95 rules in 9 ms. Remains 10 /73 variables (removed 63) and now considering 7/45 (removed 38) transitions.
// Phase 1: matrix 7 rows 10 cols
[2025-06-02 03:54:23] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:54:23] [INFO ] Implicit Places using invariants in 21 ms returned []
[2025-06-02 03:54:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:54:23] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 03:54:23] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2025-06-02 03:54:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 2/10 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 7/17 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/17 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/17 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 17/17 variables, and 14 constraints, problems are : Problem set: 0 solved, 6 unsolved in 82 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 10/10 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/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 2/10 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 7/17 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/17 variables, 6/20 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/17 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/17 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 17/17 variables, and 20 constraints, problems are : Problem set: 0 solved, 6 unsolved in 56 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 10/10 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 141ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 141ms
Starting structural reductions in SI_LTL mode, iteration 1 : 10/73 places, 7/45 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 197 ms. Remains : 10/73 places, 7/45 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : IOTPpurchase-PT-C05M04P03D02-LTLCardinality-11
Product exploration explored 100000 steps with 0 reset in 125 ms.
Stack based approach found an accepted trace after 55 steps with 0 reset with depth 56 and stack size 56 in 0 ms.
FORMULA IOTPpurchase-PT-C05M04P03D02-LTLCardinality-11 FALSE TECHNIQUES STACK_TEST
Treatment of property IOTPpurchase-PT-C05M04P03D02-LTLCardinality-11 finished in 363 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((X((!p1 U (G(!p1)||(!p1&&G(p2)))))||p0)))'
Support contains 5 out of 73 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 73/73 places, 45/45 transitions.
Ensure Unique test removed 6 places
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 65 transition count 45
Applied a total of 8 rules in 1 ms. Remains 65 /73 variables (removed 8) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 65 cols
[2025-06-02 03:54:23] [INFO ] Computed 21 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:54:23] [INFO ] Implicit Places using invariants in 48 ms returned [12, 16]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 49 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 63/73 places, 45/45 transitions.
Applied a total of 0 rules in 1 ms. Remains 63 /63 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 51 ms. Remains : 63/73 places, 45/45 transitions.
Stuttering acceptance computed with spot in 136 ms :[(AND (NOT p0) p1), p1, true, (AND p1 (NOT p2)), (NOT p2)]
Running random walk in product with property : IOTPpurchase-PT-C05M04P03D02-LTLCardinality-12
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA IOTPpurchase-PT-C05M04P03D02-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IOTPpurchase-PT-C05M04P03D02-LTLCardinality-12 finished in 212 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(G(p1)))))'
Support contains 4 out of 73 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 73/73 places, 45/45 transitions.
Ensure Unique test removed 6 places
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 64 transition count 38
Reduce places removed 12 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 20 rules applied. Total rules applied 30 place count 52 transition count 30
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 9 rules applied. Total rules applied 39 place count 44 transition count 29
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 40 place count 43 transition count 29
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 40 place count 43 transition count 21
Deduced a syphon composed of 8 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 21 rules applied. Total rules applied 61 place count 30 transition count 21
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 61 place count 30 transition count 18
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 67 place count 27 transition count 18
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 17 rules applied. Total rules applied 84 place count 17 transition count 11
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 86 place count 16 transition count 10
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 87 place count 15 transition count 10
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 3 rules applied. Total rules applied 90 place count 13 transition count 9
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 6 with 1 rules applied. Total rules applied 91 place count 13 transition count 8
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 92 place count 12 transition count 8
Applied a total of 92 rules in 11 ms. Remains 12 /73 variables (removed 61) and now considering 8/45 (removed 37) transitions.
// Phase 1: matrix 8 rows 12 cols
[2025-06-02 03:54:24] [INFO ] Computed 5 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:54:24] [INFO ] Implicit Places using invariants in 19 ms returned []
[2025-06-02 03:54:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:54:24] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 03:54:24] [INFO ] Redundant transitions in 0 ms returned []
Running 7 sub problems to find dead transitions.
[2025-06-02 03:54: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/9 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/9 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 3/12 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 8/20 variables, 12/17 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/20 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 0/20 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 20/20 variables, and 17 constraints, problems are : Problem set: 0 solved, 7 unsolved in 65 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 12/12 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/9 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 3/12 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 8/20 variables, 12/17 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/20 variables, 7/24 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/20 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 0/20 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 20/20 variables, and 24 constraints, problems are : Problem set: 0 solved, 7 unsolved in 64 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 12/12 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 132ms problems are : Problem set: 0 solved, 7 unsolved
Search for dead transitions found 0 dead transitions in 132ms
Starting structural reductions in SI_LTL mode, iteration 1 : 12/73 places, 8/45 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 194 ms. Remains : 12/73 places, 8/45 transitions.
Stuttering acceptance computed with spot in 102 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : IOTPpurchase-PT-C05M04P03D02-LTLCardinality-13
Product exploration explored 100000 steps with 3 reset in 149 ms.
Stack based approach found an accepted trace after 20 steps with 2 reset with depth 13 and stack size 13 in 1 ms.
FORMULA IOTPpurchase-PT-C05M04P03D02-LTLCardinality-13 FALSE TECHNIQUES STACK_TEST
Treatment of property IOTPpurchase-PT-C05M04P03D02-LTLCardinality-13 finished in 458 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((F(p1)&&F(!p0))))))'
Support contains 4 out of 73 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 73/73 places, 45/45 transitions.
Ensure Unique test removed 6 places
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 65 transition count 45
Applied a total of 8 rules in 2 ms. Remains 65 /73 variables (removed 8) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 65 cols
[2025-06-02 03:54:24] [INFO ] Computed 21 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:54:24] [INFO ] Implicit Places using invariants in 44 ms returned [16]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 44 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 64/73 places, 45/45 transitions.
Applied a total of 0 rules in 1 ms. Remains 64 /64 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 47 ms. Remains : 64/73 places, 45/45 transitions.
Stuttering acceptance computed with spot in 151 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p1) p0), p0]
Running random walk in product with property : IOTPpurchase-PT-C05M04P03D02-LTLCardinality-14
Product exploration explored 100000 steps with 50000 reset in 122 ms.
Product exploration explored 100000 steps with 50000 reset in 109 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 p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 16 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA IOTPpurchase-PT-C05M04P03D02-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property IOTPpurchase-PT-C05M04P03D02-LTLCardinality-14 finished in 469 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||X(p1)))))'
Support contains 3 out of 73 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 73/73 places, 45/45 transitions.
Ensure Unique test removed 6 places
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 64 transition count 45
Applied a total of 9 rules in 2 ms. Remains 64 /73 variables (removed 9) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 64 cols
[2025-06-02 03:54:24] [INFO ] Computed 20 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:54:25] [INFO ] Implicit Places using invariants in 50 ms returned [12, 16]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 51 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 62/73 places, 45/45 transitions.
Applied a total of 0 rules in 1 ms. Remains 62 /62 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 54 ms. Remains : 62/73 places, 45/45 transitions.
Stuttering acceptance computed with spot in 57 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : IOTPpurchase-PT-C05M04P03D02-LTLCardinality-15
Product exploration explored 100000 steps with 0 reset in 190 ms.
Stack based approach found an accepted trace after 20527 steps with 0 reset with depth 20528 and stack size 20259 in 48 ms.
FORMULA IOTPpurchase-PT-C05M04P03D02-LTLCardinality-15 FALSE TECHNIQUES STACK_TEST
Treatment of property IOTPpurchase-PT-C05M04P03D02-LTLCardinality-15 finished in 360 ms.
All properties solved by simple procedures.
Total runtime 13519 ms.

BK_STOP 1748836465383

--------------------
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="IOTPpurchase-PT-C05M04P03D02"
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 IOTPpurchase-PT-C05M04P03D02, 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 r114-tall-174876422600379"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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