Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 512K
-rw-r--r-- 1 mcc users 7.8K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.6K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K 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 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.4K 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 14K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 126K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 47K 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 4.0K 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 63K 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-C01M01P01D01-LTLFireability-00
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-LTLFireability-01
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-LTLFireability-02
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-LTLFireability-03
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-LTLFireability-04
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-LTLFireability-05
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-LTLFireability-06
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-LTLFireability-07
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-LTLFireability-08
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-LTLFireability-09
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-LTLFireability-10
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-LTLFireability-11
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-LTLFireability-12
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-LTLFireability-13
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-LTLFireability-14
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1748836335581

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=IOTPpurchase-PT-C01M01P01D01
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-02 03:52:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-02 03:52:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 03:52:17] [INFO ] Load time of PNML (sax parser for PT used): 64 ms
[2025-06-02 03:52:17] [INFO ] Transformed 111 places.
[2025-06-02 03:52:17] [INFO ] Transformed 45 transitions.
[2025-06-02 03:52:17] [INFO ] Found NUPN structural information;
[2025-06-02 03:52:17] [INFO ] Parsed PT model containing 111 places and 45 transitions and 224 arcs in 194 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA IOTPpurchase-PT-C01M01P01D01-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IOTPpurchase-PT-C01M01P01D01-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IOTPpurchase-PT-C01M01P01D01-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IOTPpurchase-PT-C01M01P01D01-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 69 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 11 places
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 98 transition count 45
Applied a total of 13 rules in 21 ms. Remains 98 /111 variables (removed 13) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 98 cols
[2025-06-02 03:52:17] [INFO ] Computed 54 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:52:17] [INFO ] Implicit Places using invariants in 237 ms returned [27, 54, 57, 58, 59, 61, 63]
[2025-06-02 03:52:17] [INFO ] Actually due to overlaps returned [27, 54, 57, 58, 59, 61]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 287 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 92/111 places, 45/45 transitions.
Applied a total of 0 rules in 3 ms. Remains 92 /92 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 333 ms. Remains : 92/111 places, 45/45 transitions.
Support contains 69 out of 92 places after structural reductions.
[2025-06-02 03:52:17] [INFO ] Flatten gal took : 21 ms
[2025-06-02 03:52:17] [INFO ] Flatten gal took : 9 ms
[2025-06-02 03:52:18] [INFO ] Input system was already deterministic with 45 transitions.
Reduction of identical properties reduced properties to check from 31 to 28
RANDOM walk for 175 steps (0 resets) in 60 ms. (2 steps per ms) remains 0/28 properties
FORMULA IOTPpurchase-PT-C01M01P01D01-LTLFireability-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
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((X(F(p0))||G(p1))))'
Support contains 10 out of 92 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 92/92 places, 45/45 transitions.
Ensure Unique test removed 20 places
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 67 transition count 45
Applied a total of 25 rules in 2 ms. Remains 67 /92 variables (removed 25) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 67 cols
[2025-06-02 03:52:18] [INFO ] Computed 23 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:52:18] [INFO ] Implicit Places using invariants in 150 ms returned [13, 18, 20, 26, 30, 32, 33, 34, 35, 36, 37]
[2025-06-02 03:52:18] [INFO ] Actually due to overlaps returned [26, 13, 18, 20, 30, 33, 35, 36]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 155 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 59/92 places, 45/45 transitions.
Applied a total of 0 rules in 2 ms. Remains 59 /59 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 160 ms. Remains : 59/92 places, 45/45 transitions.
Stuttering acceptance computed with spot in 267 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : IOTPpurchase-PT-C01M01P01D01-LTLFireability-00
Product exploration explored 100000 steps with 33333 reset in 428 ms.
Product exploration explored 100000 steps with 33333 reset in 187 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 p1)), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 15 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA IOTPpurchase-PT-C01M01P01D01-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property IOTPpurchase-PT-C01M01P01D01-LTLFireability-00 finished in 1191 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 X((!p0&&X(F(!p2))))))'
Support contains 4 out of 92 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 92/92 places, 45/45 transitions.
Ensure Unique test removed 25 places
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 62 transition count 45
Applied a total of 30 rules in 2 ms. Remains 62 /92 variables (removed 30) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 62 cols
[2025-06-02 03:52:19] [INFO ] Computed 18 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:52:19] [INFO ] Implicit Places using invariants in 129 ms returned [9, 12, 15, 16, 21, 26, 28, 29, 30, 31, 32, 33]
[2025-06-02 03:52:19] [INFO ] Actually due to overlaps returned [21, 9, 12, 15, 16, 26, 29, 31, 32]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 130 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 53/92 places, 45/45 transitions.
Applied a total of 0 rules in 4 ms. Remains 53 /53 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 136 ms. Remains : 53/92 places, 45/45 transitions.
Stuttering acceptance computed with spot in 459 ms :[(OR p0 p2), (OR (AND (NOT p0) p2) (AND p0 (NOT p1))), (OR p0 p2), (NOT p0), (AND (NOT p0) p2), (NOT p1), (AND (NOT p1) p2), p2]
Running random walk in product with property : IOTPpurchase-PT-C01M01P01D01-LTLFireability-01
Product exploration explored 100000 steps with 0 reset in 202 ms.
Stack based approach found an accepted trace after 47 steps with 0 reset with depth 48 and stack size 48 in 2 ms.
FORMULA IOTPpurchase-PT-C01M01P01D01-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property IOTPpurchase-PT-C01M01P01D01-LTLFireability-01 finished in 858 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&X((p1&&F(G(p0)))))))'
Support contains 7 out of 92 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 92/92 places, 45/45 transitions.
Ensure Unique test removed 22 places
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 64 transition count 45
Applied a total of 28 rules in 6 ms. Remains 64 /92 variables (removed 28) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 64 cols
[2025-06-02 03:52:20] [INFO ] Computed 20 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:52:20] [INFO ] Implicit Places using invariants in 140 ms returned [11, 14, 17, 18, 28, 30, 31, 32, 33, 34]
[2025-06-02 03:52:20] [INFO ] Actually due to overlaps returned [11, 14, 17, 18, 28, 31, 33, 34]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 142 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 56/92 places, 45/45 transitions.
Applied a total of 0 rules in 1 ms. Remains 56 /56 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 149 ms. Remains : 56/92 places, 45/45 transitions.
Stuttering acceptance computed with spot in 146 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true, (OR (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : IOTPpurchase-PT-C01M01P01D01-LTLFireability-02
Product exploration explored 100000 steps with 0 reset in 141 ms.
Stack based approach found an accepted trace after 47 steps with 0 reset with depth 48 and stack size 48 in 0 ms.
FORMULA IOTPpurchase-PT-C01M01P01D01-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property IOTPpurchase-PT-C01M01P01D01-LTLFireability-02 finished in 456 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(F(!p0))||(G(p2)&&p1)) U X(X(p3))))'
Support contains 12 out of 92 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 92/92 places, 45/45 transitions.
Ensure Unique test removed 20 places
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 67 transition count 45
Applied a total of 25 rules in 7 ms. Remains 67 /92 variables (removed 25) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 67 cols
[2025-06-02 03:52:21] [INFO ] Computed 23 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:52:21] [INFO ] Implicit Places using invariants in 67 ms returned [11, 14, 19, 20, 33, 34, 35, 36, 37, 38]
[2025-06-02 03:52:21] [INFO ] Actually due to overlaps returned [11, 14, 19, 20, 34, 36, 37, 38]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 68 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 59/92 places, 45/45 transitions.
Applied a total of 0 rules in 2 ms. Remains 59 /59 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 77 ms. Remains : 59/92 places, 45/45 transitions.
Stuttering acceptance computed with spot in 546 ms :[(NOT p3), (AND p0 (NOT p3)), (NOT p3), (AND (NOT p2) p0 (NOT p3)), (AND p0 (NOT p3)), (AND p0 (NOT p3)), (NOT p3), (AND p0 (NOT p3) (NOT p2)), (AND (NOT p2) p0 (NOT p3)), p0, p0, (AND p0 (NOT p2))]
Running random walk in product with property : IOTPpurchase-PT-C01M01P01D01-LTLFireability-05
Product exploration explored 100000 steps with 1250 reset in 133 ms.
Product exploration explored 100000 steps with 1189 reset in 142 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) (NOT p2) (NOT p0) (NOT p3)), (X (NOT p2)), (X (OR (NOT p1) (NOT p2))), (X (NOT (AND p1 p2))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT (AND p0 (NOT p3))))), (X (X (NOT (AND p1 p2 (NOT p3))))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p2) (NOT p3))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 133 ms. Reduced automaton from 12 states, 26 edges and 4 AP (stutter sensitive) to 10 states, 20 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 480 ms :[(NOT p3), (NOT p3), (AND (NOT p3) p0), (AND (NOT p3) p0), (NOT p3), (AND (NOT p3) p0 (NOT p2)), (AND (NOT p3) p0 (NOT p2)), p0, p0, (AND p0 (NOT p2))]
RANDOM walk for 40000 steps (8 resets) in 652 ms. (61 steps per ms) remains 1/11 properties
BEST_FIRST walk for 40001 steps (8 resets) in 234 ms. (170 steps per ms) remains 1/1 properties
// Phase 1: matrix 45 rows 59 cols
[2025-06-02 03:52:22] [INFO ] Computed 15 invariants in 2 ms
[2025-06-02 03:52:22] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 42/52 variables, 4/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 42/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 5/57 variables, 3/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/57 variables, 5/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/57 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/59 variables, 2/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/59 variables, 2/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/59 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 45/104 variables, 59/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/104 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/104 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/104 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 104/104 variables, and 134 constraints, problems are : Problem set: 0 solved, 1 unsolved in 152 ms.
Refiners :[Domain max(s): 59/59 constraints, Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 59/59 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf6 is UNSAT
After SMT solving in domain Int declared 52/104 variables, and 19 constraints, problems are : Problem set: 1 solved, 0 unsolved in 42 ms.
Refiners :[Domain max(s): 10/59 constraints, Positive P Invariants (semi-flows): 4/7 constraints, Generalized P Invariants (flows): 5/8 constraints, State Equation: 0/59 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 219ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0) (NOT p3)), (X (NOT p2)), (X (OR (NOT p1) (NOT p2))), (X (NOT (AND p1 p2))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT (AND p0 (NOT p3))))), (X (X (NOT (AND p1 p2 (NOT p3))))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p2) (NOT p3))))), (X (X (NOT p1))), (G (OR (NOT p1) (NOT p2) p3))]
False Knowledge obtained : [(F (NOT (OR (NOT p2) p3))), (F (NOT (AND (NOT p2) (NOT p3)))), (F (NOT (OR p2 p3 (NOT p0)))), (F p2), (F (NOT (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))))), (F p3), (F (NOT (OR p3 (NOT p0)))), (F p1), (F (NOT (OR p2 (NOT p0)))), (F p0)]
Knowledge based reduction with 16 factoid took 428 ms. Reduced automaton from 10 states, 20 edges and 4 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 290 ms :[(NOT p3), (NOT p3), (AND (NOT p3) p0), (AND (NOT p3) p0), (NOT p3), p0, p0]
Stuttering acceptance computed with spot in 301 ms :[(NOT p3), (NOT p3), (AND (NOT p3) p0), (AND (NOT p3) p0), (NOT p3), p0, p0]
[2025-06-02 03:52:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 03:52:24] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned sat
[2025-06-02 03:52:24] [INFO ] [Real]Absence check using 7 positive and 8 generalized place invariants in 3 ms returned sat
[2025-06-02 03:52:24] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2025-06-02 03:52:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 03:52:24] [INFO ] [Real]Added 1 Read/Feed constraints in 4 ms returned sat
[2025-06-02 03:52:24] [INFO ] Computed and/alt/rep : 44/53/44 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-02 03:52:24] [INFO ] Added : 3 causal constraints over 1 iterations in 21 ms. Result :sat
Could not prove EG (NOT p3)
Support contains 4 out of 59 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 59/59 places, 45/45 transitions.
Applied a total of 0 rules in 2 ms. Remains 59 /59 variables (removed 0) and now considering 45/45 (removed 0) transitions.
[2025-06-02 03:52:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:52:24] [INFO ] Implicit Places using invariants in 46 ms returned [29, 30]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 47 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 57/59 places, 45/45 transitions.
Applied a total of 0 rules in 2 ms. Remains 57 /57 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 51 ms. Remains : 57/59 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 (NOT p3) (NOT p0)), (X (X (NOT p3))), (X (X (NOT (AND (NOT p3) p0)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 84 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 283 ms :[(NOT p3), (NOT p3), (AND (NOT p3) p0), (AND (NOT p3) p0), (NOT p3), p0, p0]
RANDOM walk for 20 steps (0 resets) in 4 ms. (4 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p3) (NOT p0)), (X (X (NOT p3))), (X (X (NOT (AND (NOT p3) p0)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p3), (F p0), (F (NOT (OR p3 (NOT p0))))]
Knowledge based reduction with 4 factoid took 198 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 322 ms :[(NOT p3), (NOT p3), (AND (NOT p3) p0), (AND (NOT p3) p0), (NOT p3), p0, p0]
Stuttering acceptance computed with spot in 280 ms :[(NOT p3), (NOT p3), (AND (NOT p3) p0), (AND (NOT p3) p0), (NOT p3), p0, p0]
// Phase 1: matrix 45 rows 57 cols
[2025-06-02 03:52:25] [INFO ] Computed 13 invariants in 1 ms
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 03:52:25] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2025-06-02 03:52:25] [INFO ] [Real]Absence check using 5 positive and 8 generalized place invariants in 2 ms returned sat
[2025-06-02 03:52:25] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2025-06-02 03:52:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 03:52:25] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
[2025-06-02 03:52:25] [INFO ] Computed and/alt/rep : 44/53/44 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-02 03:52:25] [INFO ] Added : 3 causal constraints over 1 iterations in 15 ms. Result :sat
Could not prove EG (NOT p3)
Stuttering acceptance computed with spot in 290 ms :[(NOT p3), (NOT p3), (AND (NOT p3) p0), (AND (NOT p3) p0), (NOT p3), p0, p0]
Product exploration explored 100000 steps with 1337 reset in 99 ms.
Product exploration explored 100000 steps with 1511 reset in 195 ms.
Applying partial POR strategy [false, false, true, true, true, true, true]
Stuttering acceptance computed with spot in 279 ms :[(NOT p3), (NOT p3), (AND (NOT p3) p0), (AND (NOT p3) p0), (NOT p3), p0, p0]
Support contains 4 out of 57 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 57/57 places, 45/45 transitions.
Ensure Unique test removed 5 places
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 52 transition count 45
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 11 Pre rules applied. Total rules applied 17 place count 52 transition count 45
Deduced a syphon composed of 28 places in 0 ms
Iterating global reduction 1 with 11 rules applied. Total rules applied 28 place count 52 transition count 45
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 2 rules applied. Total rules applied 30 place count 51 transition count 45
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 48 place count 33 transition count 27
Deduced a syphon composed of 11 places in 0 ms
Iterating global reduction 2 with 18 rules applied. Total rules applied 66 place count 33 transition count 27
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 17 places in 0 ms
Iterating global reduction 2 with 6 rules applied. Total rules applied 72 place count 33 transition count 27
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 77 place count 28 transition count 22
Deduced a syphon composed of 12 places in 0 ms
Iterating global reduction 2 with 5 rules applied. Total rules applied 82 place count 28 transition count 22
Deduced a syphon composed of 12 places in 0 ms
Applied a total of 82 rules in 18 ms. Remains 28 /57 variables (removed 29) and now considering 22/45 (removed 23) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 03:52:26] [INFO ] Redundant transitions in 0 ms returned []
Running 21 sub problems to find dead transitions.
// Phase 1: matrix 22 rows 28 cols
[2025-06-02 03:52:26] [INFO ] Computed 7 invariants in 0 ms
[2025-06-02 03:52:26] [INFO ] State equation strengthened by 1 read => feed constraints.
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, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 21 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:52:26] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 9 ms to minimize.
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:52:26] [INFO ] Deduced a trap composed of 1 places in 25 ms of which 2 ms to minimize.
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:52:26] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 2 ms to minimize.
Problem TDEAD9 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD18 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 3/9 constraints. Problems are: Problem set: 9 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 0/9 constraints. Problems are: Problem set: 9 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 1/28 variables, 1/10 constraints. Problems are: Problem set: 9 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:52:27] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 2 ms to minimize.
Problem TDEAD1 is UNSAT
Problem TDEAD13 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/28 variables, 1/11 constraints. Problems are: Problem set: 11 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/28 variables, 0/11 constraints. Problems are: Problem set: 11 solved, 10 unsolved
Problem TDEAD19 is UNSAT
At refinement iteration 7 (OVERLAPS) 22/50 variables, 28/39 constraints. Problems are: Problem set: 12 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/50 variables, 1/40 constraints. Problems are: Problem set: 12 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/50 variables, 0/40 constraints. Problems are: Problem set: 12 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 0/50 variables, 0/40 constraints. Problems are: Problem set: 12 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 50/50 variables, and 40 constraints, problems are : Problem set: 12 solved, 9 unsolved in 373 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 28/28 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 12 solved, 9 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 1/1 constraints. Problems are: Problem set: 12 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/15 variables, 1/2 constraints. Problems are: Problem set: 12 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 3/5 constraints. Problems are: Problem set: 12 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/5 constraints. Problems are: Problem set: 12 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 9/24 variables, 3/8 constraints. Problems are: Problem set: 12 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/24 variables, 1/9 constraints. Problems are: Problem set: 12 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/24 variables, 0/9 constraints. Problems are: Problem set: 12 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 3/27 variables, 1/10 constraints. Problems are: Problem set: 12 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/27 variables, 1/11 constraints. Problems are: Problem set: 12 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/27 variables, 0/11 constraints. Problems are: Problem set: 12 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 22/49 variables, 27/38 constraints. Problems are: Problem set: 12 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/49 variables, 1/39 constraints. Problems are: Problem set: 12 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/49 variables, 9/48 constraints. Problems are: Problem set: 12 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/49 variables, 0/48 constraints. Problems are: Problem set: 12 solved, 9 unsolved
At refinement iteration 14 (OVERLAPS) 1/50 variables, 1/49 constraints. Problems are: Problem set: 12 solved, 9 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/50 variables, 0/49 constraints. Problems are: Problem set: 12 solved, 9 unsolved
At refinement iteration 16 (OVERLAPS) 0/50 variables, 0/49 constraints. Problems are: Problem set: 12 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 50/50 variables, and 49 constraints, problems are : Problem set: 12 solved, 9 unsolved in 234 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 28/28 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 9/21 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 613ms problems are : Problem set: 12 solved, 9 unsolved
Search for dead transitions found 12 dead transitions in 613ms
Found 12 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 12 transitions
Dead transitions reduction (with SMT) removed 12 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 28/57 places, 10/45 transitions.
Graph (complete) has 30 edges and 28 vertex of which 16 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.1 ms
Discarding 12 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 15 transition count 10
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 14 transition count 9
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 14 transition count 9
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 5 rules in 5 ms. Remains 14 /28 variables (removed 14) and now considering 9/10 (removed 1) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 14/57 places, 9/45 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 648 ms. Remains : 14/57 places, 9/45 transitions.
Built C files in :
/tmp/ltsmin1600806152347959985
[2025-06-02 03:52:27] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1600806152347959985
Running compilation step : cd /tmp/ltsmin1600806152347959985;'/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 301 ms.
Running link step : cd /tmp/ltsmin1600806152347959985;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 51 ms.
Running LTSmin : cd /tmp/ltsmin1600806152347959985;'/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/stateBased10591573930280424341.hoa' '--buchi-type=spotba'
LTSmin run took 99 ms.
FORMULA IOTPpurchase-PT-C01M01P01D01-LTLFireability-05 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property IOTPpurchase-PT-C01M01P01D01-LTLFireability-05 finished in 6835 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((F((p0 U (X(!G(p1)) U p2)))&&(X(p3)||p0))))'
Support contains 10 out of 92 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 92/92 places, 45/45 transitions.
Ensure Unique test removed 17 places
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 70 transition count 45
Applied a total of 22 rules in 4 ms. Remains 70 /92 variables (removed 22) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 70 cols
[2025-06-02 03:52:27] [INFO ] Computed 26 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:52:27] [INFO ] Implicit Places using invariants in 73 ms returned [10, 19, 21, 29, 33, 35, 37, 38, 39, 40]
[2025-06-02 03:52:27] [INFO ] Actually due to overlaps returned [29, 10, 19, 21, 33, 38, 39]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 74 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 63/92 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 82 ms. Remains : 63/92 places, 45/45 transitions.
Stuttering acceptance computed with spot in 117 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3))), (NOT p2)]
Running random walk in product with property : IOTPpurchase-PT-C01M01P01D01-LTLFireability-06
Product exploration explored 100000 steps with 12727 reset in 195 ms.
Product exploration explored 100000 steps with 12855 reset in 166 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 p2) (NOT p3)), (X (NOT p2)), (X (NOT p3)), (X (AND (NOT p2) (NOT p3))), (X (NOT p0)), (X (AND (NOT p0) (NOT p3))), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p3))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 11 factoid took 127 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 10 states, 29 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 445 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3))), (NOT p2), (AND (NOT p3) p0 (NOT p2)), false, false, false, false, false, false]
RANDOM walk for 40000 steps (8 resets) in 413 ms. (96 steps per ms) remains 4/12 properties
BEST_FIRST walk for 40000 steps (8 resets) in 259 ms. (153 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (8 resets) in 190 ms. (209 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (8 resets) in 208 ms. (191 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (8 resets) in 165 ms. (240 steps per ms) remains 4/4 properties
// Phase 1: matrix 45 rows 63 cols
[2025-06-02 03:52:29] [INFO ] Computed 19 invariants in 1 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 35/45 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 35/52 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 8/53 variables, 5/57 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/53 variables, 8/65 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/53 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 10/63 variables, 7/72 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/63 variables, 10/82 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/63 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 45/108 variables, 63/145 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/108 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/108 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 108/108 variables, and 145 constraints, problems are : Problem set: 0 solved, 4 unsolved in 188 ms.
Refiners :[Domain max(s): 63/63 constraints, Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 63/63 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 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem apf5 is UNSAT
Problem apf7 is UNSAT
Problem apf9 is UNSAT
Problem apf11 is UNSAT
After SMT solving in domain Int declared 45/108 variables, and 17 constraints, problems are : Problem set: 4 solved, 0 unsolved in 47 ms.
Refiners :[Domain max(s): 10/63 constraints, Positive P Invariants (semi-flows): 7/12 constraints, Generalized P Invariants (flows): 0/7 constraints, State Equation: 0/63 constraints, PredecessorRefiner: 0/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 246ms problems are : Problem set: 4 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 4 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p3)), (X (NOT p2)), (X (NOT p3)), (X (AND (NOT p2) (NOT p3))), (X (NOT p0)), (X (AND (NOT p0) (NOT p3))), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p3)))), (G (OR (NOT p2) (NOT p3) p0)), (G (OR (NOT p2) p3 (NOT p0))), (G (OR p2 (NOT p3) (NOT p0))), (G (OR (NOT p2) (NOT p3) (NOT p0)))]
False Knowledge obtained : [(F (NOT (AND (NOT p3) (NOT p0)))), (F (NOT (OR (NOT p2) p3 p0))), (F (NOT (OR p2 (NOT p3) p0))), (F (NOT (OR p2 p3 (NOT p0)))), (F p2), (F (NOT (AND (NOT p2) (NOT p3)))), (F p3), (F p0)]
Knowledge based reduction with 15 factoid took 379 ms. Reduced automaton from 10 states, 29 edges and 3 AP (stutter insensitive) to 10 states, 29 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 409 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3))), (NOT p2), (AND (NOT p3) p0 (NOT p2)), false, false, false, false, false, false]
Stuttering acceptance computed with spot in 438 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3))), (NOT p2), (AND (NOT p3) p0 (NOT p2)), false, false, false, false, false, false]
[2025-06-02 03:52:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 03:52:31] [INFO ] [Real]Absence check using 12 positive place invariants in 5 ms returned sat
[2025-06-02 03:52:31] [INFO ] [Real]Absence check using 12 positive and 7 generalized place invariants in 3 ms returned sat
[2025-06-02 03:52:31] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2025-06-02 03:52:31] [INFO ] Computed and/alt/rep : 44/54/44 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-02 03:52:31] [INFO ] Added : 2 causal constraints over 1 iterations in 16 ms. Result :sat
Could not prove EG (NOT p2)
[2025-06-02 03:52:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 03:52:31] [INFO ] [Real]Absence check using 12 positive place invariants in 16 ms returned sat
[2025-06-02 03:52:31] [INFO ] [Real]Absence check using 12 positive and 7 generalized place invariants in 9 ms returned sat
[2025-06-02 03:52:31] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2025-06-02 03:52:31] [INFO ] Computed and/alt/rep : 44/54/44 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-02 03:52:31] [INFO ] Added : 32 causal constraints over 7 iterations in 65 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p3))
Support contains 10 out of 63 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 places, 45/45 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 63 transition count 27
Reduce places removed 18 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 19 rules applied. Total rules applied 37 place count 45 transition count 26
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 38 place count 44 transition count 26
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 38 place count 44 transition count 18
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 17 rules applied. Total rules applied 55 place count 35 transition count 18
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 55 place count 35 transition count 17
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 57 place count 34 transition count 17
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 3 with 15 rules applied. Total rules applied 72 place count 25 transition count 11
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 73 place count 25 transition count 10
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 74 place count 24 transition count 10
Applied a total of 74 rules in 10 ms. Remains 24 /63 variables (removed 39) and now considering 10/45 (removed 35) transitions.
// Phase 1: matrix 10 rows 24 cols
[2025-06-02 03:52:31] [INFO ] Computed 15 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:52:31] [INFO ] Implicit Places using invariants in 26 ms returned [3, 9, 20]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 28 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 21/63 places, 10/45 transitions.
Applied a total of 0 rules in 2 ms. Remains 21 /21 variables (removed 0) and now considering 10/10 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 40 ms. Remains : 21/63 places, 10/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 (NOT p2) (NOT p3) (NOT p0)), (X p2), (X (NOT p3)), (X (NOT (AND (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p2) p3 (NOT p0)))), (X (AND p2 (NOT p3) (NOT p0))), (X (NOT (AND (NOT p2) p3 p0))), (X (NOT (AND (NOT p2) (NOT p3) p0))), (X (AND (NOT p3) (NOT p0))), (X (NOT (AND p2 p3 (NOT p0)))), (X (NOT (AND p2 (NOT p3) p0))), (X (NOT p0)), (X (NOT (AND p2 p3 p0))), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p2) p3 (NOT p0))))), (X (X (NOT (AND p2 (NOT p3) (NOT p0))))), (X (X (NOT (AND (NOT p2) p3 p0)))), (X (X (NOT (AND (NOT p2) (NOT p3) p0)))), (X (X (AND (NOT p3) (NOT p0)))), (X (X (NOT (AND p2 p3 (NOT p0))))), (X (X (NOT (AND p2 (NOT p3) p0)))), (X (X (NOT p0))), (X (X (NOT (AND p2 p3 p0))))]
False Knowledge obtained : []
Knowledge based reduction with 25 factoid took 122 ms. Reduced automaton from 10 states, 29 edges and 3 AP (stutter insensitive) to 9 states, 23 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 393 ms :[(OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3))), (NOT p2), false, false, (AND (NOT p3) p0 (NOT p2)), false, false, false]
RANDOM walk for 40000 steps (8 resets) in 507 ms. (78 steps per ms) remains 4/11 properties
BEST_FIRST walk for 40000 steps (8 resets) in 153 ms. (259 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (8 resets) in 115 ms. (344 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (8 resets) in 123 ms. (322 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (8 resets) in 162 ms. (245 steps per ms) remains 4/4 properties
// Phase 1: matrix 10 rows 21 cols
[2025-06-02 03:52:32] [INFO ] Computed 12 invariants in 0 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 6/16 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 6/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1/17 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/17 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/17 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 4/21 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/21 variables, 4/33 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/21 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 10/31 variables, 21/54 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/31 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/31 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 31/31 variables, and 54 constraints, problems are : Problem set: 0 solved, 4 unsolved in 133 ms.
Refiners :[Domain max(s): 21/21 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 21/21 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 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem apf3 is UNSAT
Problem apf4 is UNSAT
Problem apf6 is UNSAT
Problem apf9 is UNSAT
After SMT solving in domain Int declared 16/31 variables, and 17 constraints, problems are : Problem set: 4 solved, 0 unsolved in 33 ms.
Refiners :[Domain max(s): 10/21 constraints, Positive P Invariants (semi-flows): 7/8 constraints, Generalized P Invariants (flows): 0/4 constraints, State Equation: 0/21 constraints, PredecessorRefiner: 0/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 177ms problems are : Problem set: 4 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 4 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p3) (NOT p0)), (X p2), (X (NOT p3)), (X (NOT (AND (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p2) p3 (NOT p0)))), (X (AND p2 (NOT p3) (NOT p0))), (X (NOT (AND (NOT p2) p3 p0))), (X (NOT (AND (NOT p2) (NOT p3) p0))), (X (AND (NOT p3) (NOT p0))), (X (NOT (AND p2 p3 (NOT p0)))), (X (NOT (AND p2 (NOT p3) p0))), (X (NOT p0)), (X (NOT (AND p2 p3 p0))), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p2) p3 (NOT p0))))), (X (X (NOT (AND p2 (NOT p3) (NOT p0))))), (X (X (NOT (AND (NOT p2) p3 p0)))), (X (X (NOT (AND (NOT p2) (NOT p3) p0)))), (X (X (AND (NOT p3) (NOT p0)))), (X (X (NOT (AND p2 p3 (NOT p0))))), (X (X (NOT (AND p2 (NOT p3) p0)))), (X (X (NOT p0))), (X (X (NOT (AND p2 p3 p0)))), (G (OR (NOT p0) (NOT p2) (NOT p3))), (G (OR (NOT p0) p2 (NOT p3))), (G (OR p0 (NOT p2) (NOT p3))), (G (OR (NOT p0) (NOT p2) p3))]
False Knowledge obtained : [(F (NOT (OR p0 p2 (NOT p3)))), (F p2), (F p3), (F (NOT (AND (NOT p2) (NOT p3)))), (F (NOT (OR (NOT p0) p2 p3))), (F (NOT (AND (NOT p0) (NOT p3)))), (F p0)]
Knowledge based reduction with 29 factoid took 379 ms. Reduced automaton from 9 states, 23 edges and 3 AP (stutter insensitive) to 9 states, 23 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 390 ms :[(OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3))), (NOT p2), false, false, (AND (NOT p3) p0 (NOT p2)), false, false, false]
Stuttering acceptance computed with spot in 406 ms :[(OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3))), (NOT p2), false, false, (AND (NOT p3) p0 (NOT p2)), false, false, false]
[2025-06-02 03:52:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 03:52:33] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2025-06-02 03:52:33] [INFO ] [Real]Absence check using 8 positive and 4 generalized place invariants in 1 ms returned sat
[2025-06-02 03:52:33] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2025-06-02 03:52:33] [INFO ] Computed and/alt/rep : 9/18/9 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-02 03:52:33] [INFO ] Added : 6 causal constraints over 2 iterations in 8 ms. Result :sat
Could not prove EG (AND (NOT p2) (NOT p3))
[2025-06-02 03:52:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 03:52:33] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2025-06-02 03:52:33] [INFO ] [Real]Absence check using 8 positive and 4 generalized place invariants in 1 ms returned sat
[2025-06-02 03:52:33] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2025-06-02 03:52:33] [INFO ] Computed and/alt/rep : 9/18/9 causal constraints (skipped 0 transitions) in 0 ms.
[2025-06-02 03:52:33] [INFO ] Added : 6 causal constraints over 2 iterations in 6 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p3))
Stuttering acceptance computed with spot in 416 ms :[(OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3))), (NOT p2), false, false, (AND (NOT p3) p0 (NOT p2)), false, false, false]
Product exploration explored 100000 steps with 14242 reset in 82 ms.
Product exploration explored 100000 steps with 14299 reset in 86 ms.
Built C files in :
/tmp/ltsmin3304613862726484835
[2025-06-02 03:52:34] [INFO ] Computing symmetric may disable matrix : 10 transitions.
[2025-06-02 03:52:34] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 03:52:34] [INFO ] Computing symmetric may enable matrix : 10 transitions.
[2025-06-02 03:52:34] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 03:52:34] [INFO ] Computing Do-Not-Accords matrix : 10 transitions.
[2025-06-02 03:52:34] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 03:52:34] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3304613862726484835
Running compilation step : cd /tmp/ltsmin3304613862726484835;'/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 96 ms.
Running link step : cd /tmp/ltsmin3304613862726484835;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin3304613862726484835;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased2704373033153405182.hoa' '--buchi-type=spotba'
LTSmin run took 47 ms.
FORMULA IOTPpurchase-PT-C01M01P01D01-LTLFireability-06 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property IOTPpurchase-PT-C01M01P01D01-LTLFireability-06 finished in 6508 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((((F(p0)||X(G(p1))) U p2) U p3))))'
Support contains 9 out of 92 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 92/92 places, 45/45 transitions.
Ensure Unique test removed 22 places
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 64 transition count 45
Applied a total of 28 rules in 4 ms. Remains 64 /92 variables (removed 28) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 64 cols
[2025-06-02 03:52:34] [INFO ] Computed 20 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:52:34] [INFO ] Implicit Places using invariants in 51 ms returned [10, 13, 18, 19, 24, 28, 30, 31, 32, 34, 35]
[2025-06-02 03:52:34] [INFO ] Actually due to overlaps returned [24, 10, 13, 18, 19, 28, 31, 34]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 52 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 56/92 places, 45/45 transitions.
Applied a total of 0 rules in 5 ms. Remains 56 /56 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61 ms. Remains : 56/92 places, 45/45 transitions.
Stuttering acceptance computed with spot in 296 ms :[(NOT p3), (NOT p3), (NOT p3), (NOT p2), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : IOTPpurchase-PT-C01M01P01D01-LTLFireability-08
Product exploration explored 100000 steps with 4545 reset in 91 ms.
Product exploration explored 100000 steps with 4545 reset in 86 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 p3) (NOT p2) (NOT p0) (NOT p1)), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (AND (NOT p3) (NOT p2)))), (X (X (AND (NOT p3) (NOT p2) (NOT p0)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 117 ms. Reduced automaton from 6 states, 10 edges and 4 AP (stutter sensitive) to 6 states, 10 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 281 ms :[(NOT p3), (NOT p3), (NOT p3), (NOT p2), (AND (NOT p0) (NOT p1)), (NOT p0)]
RANDOM walk for 164 steps (0 resets) in 7 ms. (20 steps per ms) remains 0/9 properties
Knowledge obtained : [(AND (NOT p3) (NOT p2) (NOT p0) (NOT p1)), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (AND (NOT p3) (NOT p2)))), (X (X (AND (NOT p3) (NOT p2) (NOT p0)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p0)))), (F p3), (F (NOT (AND (NOT p2) (NOT p0)))), (F p0), (F p2), (F (NOT (AND (NOT p2) (NOT p3) (NOT p0)))), (F (NOT (AND (NOT p2) (NOT p3)))), (F p1), (F (NOT (OR (NOT p1) p0)))]
Knowledge based reduction with 6 factoid took 317 ms. Reduced automaton from 6 states, 10 edges and 4 AP (stutter sensitive) to 6 states, 10 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 252 ms :[(NOT p3), (NOT p3), (NOT p3), (NOT p2), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 207 ms :[(NOT p3), (NOT p3), (NOT p3), (NOT p2), (AND (NOT p0) (NOT p1)), (NOT p0)]
// Phase 1: matrix 45 rows 56 cols
[2025-06-02 03:52:36] [INFO ] Computed 12 invariants in 0 ms
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 03:52:36] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2025-06-02 03:52:36] [INFO ] [Real]Absence check using 8 positive and 4 generalized place invariants in 1 ms returned sat
[2025-06-02 03:52:36] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2025-06-02 03:52:36] [INFO ] Computed and/alt/rep : 44/48/44 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-02 03:52:36] [INFO ] Added : 31 causal constraints over 7 iterations in 92 ms. Result :sat
Could not prove EG (NOT p3)
Support contains 9 out of 56 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 56/56 places, 45/45 transitions.
Applied a total of 0 rules in 1 ms. Remains 56 /56 variables (removed 0) and now considering 45/45 (removed 0) transitions.
[2025-06-02 03:52:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:52:36] [INFO ] Implicit Places using invariants in 49 ms returned [24, 25, 27]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 73 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 53/56 places, 45/45 transitions.
Applied a total of 0 rules in 1 ms. Remains 53 /53 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 75 ms. Remains : 53/56 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 (NOT p3) (NOT p2) (NOT p0) (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (AND (NOT p2) (NOT p3) (NOT p0)))), (X (X (NOT p3))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 87 ms. Reduced automaton from 6 states, 10 edges and 4 AP (stutter sensitive) to 6 states, 10 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 251 ms :[(NOT p3), (NOT p3), (NOT p3), (NOT p2), (AND (NOT p0) (NOT p1)), (NOT p0)]
RANDOM walk for 164 steps (0 resets) in 4 ms. (32 steps per ms) remains 0/9 properties
Knowledge obtained : [(AND (NOT p3) (NOT p2) (NOT p0) (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (AND (NOT p2) (NOT p3) (NOT p0)))), (X (X (NOT p3))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p0)))), (F p3), (F (NOT (AND (NOT p2) (NOT p0)))), (F p0), (F p2), (F (NOT (AND (NOT p2) (NOT p3) (NOT p0)))), (F (NOT (AND (NOT p2) (NOT p3)))), (F p1), (F (NOT (OR (NOT p1) p0)))]
Knowledge based reduction with 6 factoid took 310 ms. Reduced automaton from 6 states, 10 edges and 4 AP (stutter sensitive) to 6 states, 10 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 232 ms :[(NOT p3), (NOT p3), (NOT p3), (NOT p2), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 231 ms :[(NOT p3), (NOT p3), (NOT p3), (NOT p2), (AND (NOT p0) (NOT p1)), (NOT p0)]
// Phase 1: matrix 45 rows 53 cols
[2025-06-02 03:52:37] [INFO ] Computed 9 invariants in 0 ms
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 03:52:37] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2025-06-02 03:52:37] [INFO ] [Real]Absence check using 5 positive and 4 generalized place invariants in 2 ms returned sat
[2025-06-02 03:52:37] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2025-06-02 03:52:37] [INFO ] Computed and/alt/rep : 44/48/44 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-02 03:52:37] [INFO ] Added : 31 causal constraints over 7 iterations in 55 ms. Result :sat
Could not prove EG (NOT p3)
Stuttering acceptance computed with spot in 228 ms :[(NOT p3), (NOT p3), (NOT p3), (NOT p2), (AND (NOT p0) (NOT p1)), (NOT p0)]
Product exploration explored 100000 steps with 4545 reset in 77 ms.
Product exploration explored 100000 steps with 4545 reset in 98 ms.
Applying partial POR strategy [false, false, false, false, true, true]
Stuttering acceptance computed with spot in 226 ms :[(NOT p3), (NOT p3), (NOT p3), (NOT p2), (AND (NOT p0) (NOT p1)), (NOT p0)]
Support contains 9 out of 53 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 53/53 places, 45/45 transitions.
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 53 transition count 45
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 11 Pre rules applied. Total rules applied 18 place count 53 transition count 45
Deduced a syphon composed of 29 places in 1 ms
Iterating global reduction 1 with 11 rules applied. Total rules applied 29 place count 53 transition count 45
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 2 rules applied. Total rules applied 31 place count 52 transition count 45
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 50 place count 33 transition count 26
Deduced a syphon composed of 11 places in 0 ms
Iterating global reduction 2 with 19 rules applied. Total rules applied 69 place count 33 transition count 26
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 14 places in 0 ms
Iterating global reduction 2 with 3 rules applied. Total rules applied 72 place count 33 transition count 26
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 75 place count 30 transition count 23
Deduced a syphon composed of 11 places in 0 ms
Iterating global reduction 2 with 3 rules applied. Total rules applied 78 place count 30 transition count 23
Deduced a syphon composed of 11 places in 0 ms
Applied a total of 78 rules in 11 ms. Remains 30 /53 variables (removed 23) and now considering 23/45 (removed 22) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 03:52:38] [INFO ] Redundant transitions in 0 ms returned []
Running 22 sub problems to find dead transitions.
// Phase 1: matrix 23 rows 30 cols
[2025-06-02 03:52:38] [INFO ] Computed 8 invariants in 0 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 22 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:52:38] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 2 ms to minimize.
Problem TDEAD0 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:52:38] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 3 ms to minimize.
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD20 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 2/9 constraints. Problems are: Problem set: 7 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 0/9 constraints. Problems are: Problem set: 7 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 1/30 variables, 1/10 constraints. Problems are: Problem set: 7 solved, 15 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:52:38] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 2 ms to minimize.
Problem TDEAD9 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD18 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 1/11 constraints. Problems are: Problem set: 10 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/11 constraints. Problems are: Problem set: 10 solved, 12 unsolved
Problem TDEAD14 is UNSAT
At refinement iteration 7 (OVERLAPS) 23/53 variables, 30/41 constraints. Problems are: Problem set: 11 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/53 variables, 0/41 constraints. Problems are: Problem set: 11 solved, 11 unsolved
At refinement iteration 9 (OVERLAPS) 0/53 variables, 0/41 constraints. Problems are: Problem set: 11 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 53/53 variables, and 41 constraints, problems are : Problem set: 11 solved, 11 unsolved in 426 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 11 solved, 11 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 1/1 constraints. Problems are: Problem set: 11 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/17 variables, 3/4 constraints. Problems are: Problem set: 11 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 1/5 constraints. Problems are: Problem set: 11 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/17 variables, 0/5 constraints. Problems are: Problem set: 11 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 12/29 variables, 4/9 constraints. Problems are: Problem set: 11 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/29 variables, 2/11 constraints. Problems are: Problem set: 11 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/29 variables, 0/11 constraints. Problems are: Problem set: 11 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 23/52 variables, 29/40 constraints. Problems are: Problem set: 11 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/52 variables, 11/51 constraints. Problems are: Problem set: 11 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/52 variables, 0/51 constraints. Problems are: Problem set: 11 solved, 11 unsolved
At refinement iteration 10 (OVERLAPS) 1/53 variables, 1/52 constraints. Problems are: Problem set: 11 solved, 11 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/53 variables, 0/52 constraints. Problems are: Problem set: 11 solved, 11 unsolved
At refinement iteration 12 (OVERLAPS) 0/53 variables, 0/52 constraints. Problems are: Problem set: 11 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 53/53 variables, and 52 constraints, problems are : Problem set: 11 solved, 11 unsolved in 250 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 11/22 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 702ms problems are : Problem set: 11 solved, 11 unsolved
Search for dead transitions found 11 dead transitions in 702ms
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 : 30/53 places, 12/45 transitions.
Graph (complete) has 31 edges and 30 vertex of which 19 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.0 ms
Discarding 11 places :
Also discarding 0 output transitions
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 1 place count 19 transition count 12
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 19 transition count 12
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 3 rules in 1 ms. Remains 19 /30 variables (removed 11) and now considering 12/12 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 19/53 places, 12/45 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 736 ms. Remains : 19/53 places, 12/45 transitions.
Built C files in :
/tmp/ltsmin6871936013326119085
[2025-06-02 03:52:39] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6871936013326119085
Running compilation step : cd /tmp/ltsmin6871936013326119085;'/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 103 ms.
Running link step : cd /tmp/ltsmin6871936013326119085;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin6871936013326119085;'/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/stateBased4150143386596220395.hoa' '--buchi-type=spotba'
LTSmin run took 2389 ms.
FORMULA IOTPpurchase-PT-C01M01P01D01-LTLFireability-08 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property IOTPpurchase-PT-C01M01P01D01-LTLFireability-08 finished in 7382 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 U (p1||G(!p0))))))'
Support contains 4 out of 92 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 92/92 places, 45/45 transitions.
Ensure Unique test removed 25 places
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 63 transition count 35
Reduce places removed 11 places and 0 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 1 with 13 rules applied. Total rules applied 27 place count 52 transition count 33
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 30 place count 50 transition count 32
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 31 place count 49 transition count 32
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 11 Pre rules applied. Total rules applied 31 place count 49 transition count 21
Deduced a syphon composed of 11 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 27 rules applied. Total rules applied 58 place count 33 transition count 21
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 58 place count 33 transition count 19
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 62 place count 31 transition count 19
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 79 place count 21 transition count 12
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 4 with 2 rules applied. Total rules applied 81 place count 19 transition count 12
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 81 place count 19 transition count 11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 3 rules applied. Total rules applied 84 place count 17 transition count 11
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 1 rules applied. Total rules applied 85 place count 17 transition count 10
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 6 with 3 rules applied. Total rules applied 88 place count 15 transition count 9
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 7 with 2 rules applied. Total rules applied 90 place count 14 transition count 8
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 91 place count 13 transition count 8
Applied a total of 91 rules in 8 ms. Remains 13 /92 variables (removed 79) and now considering 8/45 (removed 37) transitions.
// Phase 1: matrix 8 rows 13 cols
[2025-06-02 03:52:41] [INFO ] Computed 6 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:52:41] [INFO ] Implicit Places using invariants in 31 ms returned [3, 4, 6]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 33 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/92 places, 8/45 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 10 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 1 with 3 rules applied. Total rules applied 5 place count 8 transition count 5
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 7 transition count 5
Applied a total of 6 rules in 2 ms. Remains 7 /10 variables (removed 3) and now considering 5/8 (removed 3) transitions.
// Phase 1: matrix 5 rows 7 cols
[2025-06-02 03:52:41] [INFO ] Computed 3 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:52:41] [INFO ] Implicit Places using invariants in 20 ms returned []
[2025-06-02 03:52:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:52:41] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 7/92 places, 5/45 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 87 ms. Remains : 7/92 places, 5/45 transitions.
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : IOTPpurchase-PT-C01M01P01D01-LTLFireability-10
Product exploration explored 100000 steps with 10926 reset in 72 ms.
Product exploration explored 100000 steps with 11009 reset in 89 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 (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X p1), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 112 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
RANDOM walk for 16 steps (0 resets) in 4 ms. (3 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X p1), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 p1))), (F p0), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 9 factoid took 178 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 79 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Support contains 4 out of 7 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7/7 places, 5/5 transitions.
Applied a total of 0 rules in 1 ms. Remains 7 /7 variables (removed 0) and now considering 5/5 (removed 0) transitions.
[2025-06-02 03:52:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:52:42] [INFO ] Implicit Places using invariants in 19 ms returned []
[2025-06-02 03:52:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:52:42] [INFO ] Implicit Places using invariants and state equation in 22 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:52:42] [INFO ] Redundant transitions in 1 ms returned []
Running 4 sub problems to find dead transitions.
[2025-06-02 03:52:42] [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, 6/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 1/7 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/7 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/7 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 5/12 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/12 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/12 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 12/12 variables, and 17 constraints, problems are : Problem set: 0 solved, 4 unsolved in 51 ms.
Refiners :[Domain max(s): 7/7 constraints, Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 7/7 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, 6/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 1/7 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/7 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/7 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 5/12 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/12 variables, 4/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/12 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 0/12 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 12/12 variables, and 21 constraints, problems are : Problem set: 0 solved, 4 unsolved in 56 ms.
Refiners :[Domain max(s): 7/7 constraints, Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 7/7 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 111ms problems are : Problem set: 0 solved, 4 unsolved
Search for dead transitions found 0 dead transitions in 111ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 161 ms. Remains : 7/7 places, 5/5 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 (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 106 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
RANDOM walk for 16 steps (0 resets) in 4 ms. (3 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 p1))), (F p0), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 9 factoid took 231 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 71 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 73 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 11210 reset in 59 ms.
Product exploration explored 100000 steps with 11127 reset in 69 ms.
Built C files in :
/tmp/ltsmin15856125895384687064
[2025-06-02 03:52:43] [INFO ] Computing symmetric may disable matrix : 5 transitions.
[2025-06-02 03:52:43] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 03:52:43] [INFO ] Computing symmetric may enable matrix : 5 transitions.
[2025-06-02 03:52:43] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 03:52:43] [INFO ] Computing Do-Not-Accords matrix : 5 transitions.
[2025-06-02 03:52:43] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 03:52:43] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15856125895384687064
Running compilation step : cd /tmp/ltsmin15856125895384687064;'/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 75 ms.
Running link step : cd /tmp/ltsmin15856125895384687064;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin15856125895384687064;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased17157509586987012182.hoa' '--buchi-type=spotba'
LTSmin run took 46 ms.
FORMULA IOTPpurchase-PT-C01M01P01D01-LTLFireability-10 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property IOTPpurchase-PT-C01M01P01D01-LTLFireability-10 finished in 2036 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&&X(p2))))'
Support contains 6 out of 92 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 92/92 places, 45/45 transitions.
Ensure Unique test removed 23 places
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 0 with 29 rules applied. Total rules applied 29 place count 63 transition count 45
Applied a total of 29 rules in 1 ms. Remains 63 /92 variables (removed 29) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 63 cols
[2025-06-02 03:52:43] [INFO ] Computed 19 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:52:43] [INFO ] Implicit Places using invariants in 55 ms returned [10, 13, 16, 17, 22, 27, 29, 30, 31, 32, 33, 34]
[2025-06-02 03:52:43] [INFO ] Actually due to overlaps returned [22, 10, 13, 16, 17, 27, 30, 32, 33]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 57 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 54/92 places, 45/45 transitions.
Applied a total of 0 rules in 0 ms. Remains 54 /54 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 59 ms. Remains : 54/92 places, 45/45 transitions.
Stuttering acceptance computed with spot in 166 ms :[(OR (NOT p2) p1), p0, (NOT p2), (AND p0 (NOT p1) (NOT p2))]
Running random walk in product with property : IOTPpurchase-PT-C01M01P01D01-LTLFireability-12
Product exploration explored 100000 steps with 50000 reset in 109 ms.
Product exploration explored 100000 steps with 50000 reset in 127 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) (NOT p0) p2), (X p2), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND p1 p0 (NOT p2)))), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 19 factoid took 117 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA IOTPpurchase-PT-C01M01P01D01-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property IOTPpurchase-PT-C01M01P01D01-LTLFireability-12 finished in 594 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)&&(!p1 U (G(!p1)||(!p1&&G(!p2))))) U X(p1)))'
Support contains 6 out of 92 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 92/92 places, 45/45 transitions.
Ensure Unique test removed 23 places
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 64 transition count 45
Applied a total of 28 rules in 2 ms. Remains 64 /92 variables (removed 28) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 64 cols
[2025-06-02 03:52:44] [INFO ] Computed 20 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:52:44] [INFO ] Implicit Places using invariants in 65 ms returned [10, 13, 16, 17, 22, 27, 29, 30, 31, 32, 33, 34]
[2025-06-02 03:52:44] [INFO ] Actually due to overlaps returned [22, 10, 13, 16, 17, 27, 30, 32, 33]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 68 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 55/92 places, 45/45 transitions.
Applied a total of 0 rules in 0 ms. Remains 55 /55 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 70 ms. Remains : 55/92 places, 45/45 transitions.
Stuttering acceptance computed with spot in 255 ms :[p2, (OR (NOT p1) p2), true, (NOT p1), true, (NOT p1), (NOT p1)]
Running random walk in product with property : IOTPpurchase-PT-C01M01P01D01-LTLFireability-13
Entered a terminal (fully accepting) state of product in 43 steps with 0 reset in 1 ms.
FORMULA IOTPpurchase-PT-C01M01P01D01-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IOTPpurchase-PT-C01M01P01D01-LTLFireability-13 finished in 353 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(F(p0))&&(X(p2)||p1)))))'
Support contains 4 out of 92 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 92/92 places, 45/45 transitions.
Ensure Unique test removed 25 places
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 62 transition count 45
Applied a total of 30 rules in 2 ms. Remains 62 /92 variables (removed 30) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 62 cols
[2025-06-02 03:52:44] [INFO ] Computed 18 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:52:44] [INFO ] Implicit Places using invariants in 63 ms returned [9, 12, 15, 16, 21, 25, 27, 28, 29, 30, 31, 32]
[2025-06-02 03:52:44] [INFO ] Actually due to overlaps returned [21, 9, 12, 15, 16, 25, 28, 30, 31]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 66 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 53/92 places, 45/45 transitions.
Applied a total of 0 rules in 0 ms. Remains 53 /53 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 69 ms. Remains : 53/92 places, 45/45 transitions.
Stuttering acceptance computed with spot in 286 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p0), (NOT p2), true]
Running random walk in product with property : IOTPpurchase-PT-C01M01P01D01-LTLFireability-14
Product exploration explored 100000 steps with 5263 reset in 69 ms.
Product exploration explored 100000 steps with 5263 reset in 91 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) p1 p2), (X (X p1)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 90 ms. Reduced automaton from 7 states, 10 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 72 steps (0 resets) in 4 ms. (14 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (X p1)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 115 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
// Phase 1: matrix 45 rows 53 cols
[2025-06-02 03:52:45] [INFO ] Computed 9 invariants in 1 ms
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 03:52:45] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2025-06-02 03:52:45] [INFO ] [Real]Absence check using 7 positive and 2 generalized place invariants in 1 ms returned sat
[2025-06-02 03:52:45] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2025-06-02 03:52:45] [INFO ] Computed and/alt/rep : 44/46/44 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-02 03:52:45] [INFO ] Added : 16 causal constraints over 4 iterations in 23 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 53 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 53/53 places, 45/45 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 53 transition count 22
Reduce places removed 23 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 24 rules applied. Total rules applied 47 place count 30 transition count 21
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 48 place count 29 transition count 21
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 48 place count 29 transition count 15
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 60 place count 23 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
Ensure Unique test removed 1 places
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 76 place count 13 transition count 9
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 7 rules applied. Total rules applied 83 place count 9 transition count 6
Applied a total of 83 rules in 4 ms. Remains 9 /53 variables (removed 44) and now considering 6/45 (removed 39) transitions.
// Phase 1: matrix 6 rows 9 cols
[2025-06-02 03:52:45] [INFO ] Computed 4 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:52:45] [INFO ] Implicit Places using invariants in 25 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 27 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/53 places, 6/45 transitions.
Applied a total of 0 rules in 0 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 31 ms. Remains : 8/53 places, 6/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 : [(NOT p0), (X (NOT p0)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 91 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 8 steps (0 resets) in 4 ms. (1 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X p0))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 109 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
// Phase 1: matrix 6 rows 8 cols
[2025-06-02 03:52:46] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 03:52:46] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2025-06-02 03:52:46] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2025-06-02 03:52:46] [INFO ] Computed and/alt/rep : 5/6/5 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-02 03:52:46] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22243 reset in 58 ms.
Product exploration explored 100000 steps with 22289 reset in 68 ms.
Built C files in :
/tmp/ltsmin18008288272063107359
[2025-06-02 03:52:46] [INFO ] Computing symmetric may disable matrix : 6 transitions.
[2025-06-02 03:52:46] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 03:52:46] [INFO ] Computing symmetric may enable matrix : 6 transitions.
[2025-06-02 03:52:46] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 03:52:46] [INFO ] Computing Do-Not-Accords matrix : 6 transitions.
[2025-06-02 03:52:46] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 03:52:46] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18008288272063107359
Running compilation step : cd /tmp/ltsmin18008288272063107359;'/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 74 ms.
Running link step : cd /tmp/ltsmin18008288272063107359;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin18008288272063107359;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13345940362862419.hoa' '--buchi-type=spotba'
LTSmin run took 40 ms.
FORMULA IOTPpurchase-PT-C01M01P01D01-LTLFireability-14 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property IOTPpurchase-PT-C01M01P01D01-LTLFireability-14 finished in 2024 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(F((p0&&F(p1))))))))'
Support contains 4 out of 92 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 92/92 places, 45/45 transitions.
Ensure Unique test removed 25 places
Discarding 6 places :
Implicit places reduction removed 6 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 61 transition count 32
Reduce places removed 14 places and 0 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 1 with 16 rules applied. Total rules applied 35 place count 47 transition count 30
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 38 place count 45 transition count 29
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 39 place count 44 transition count 29
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 9 Pre rules applied. Total rules applied 39 place count 44 transition count 20
Deduced a syphon composed of 9 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 61 place count 31 transition count 20
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 61 place count 31 transition count 18
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 65 place count 29 transition count 18
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 8 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 79 place count 21 transition count 12
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 4 with 1 rules applied. Total rules applied 80 place count 20 transition count 12
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 82 place count 19 transition count 11
Applied a total of 82 rules in 6 ms. Remains 19 /92 variables (removed 73) and now considering 11/45 (removed 34) transitions.
// Phase 1: matrix 11 rows 19 cols
[2025-06-02 03:52:46] [INFO ] Computed 9 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:52:46] [INFO ] Implicit Places using invariants in 37 ms returned [1, 2, 6, 8, 10]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 38 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 14/92 places, 11/45 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 14 transition count 8
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 11 transition count 8
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 6 place count 11 transition count 7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 10 transition count 7
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 9 place count 9 transition count 7
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 11 place count 8 transition count 6
Applied a total of 11 rules in 1 ms. Remains 8 /14 variables (removed 6) and now considering 6/11 (removed 5) transitions.
// Phase 1: matrix 6 rows 8 cols
[2025-06-02 03:52:46] [INFO ] Computed 3 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:52:46] [INFO ] Implicit Places using invariants in 17 ms returned []
[2025-06-02 03:52:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:52:46] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 8/92 places, 6/45 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 85 ms. Remains : 8/92 places, 6/45 transitions.
Stuttering acceptance computed with spot in 132 ms :[(NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : IOTPpurchase-PT-C01M01P01D01-LTLFireability-15
Product exploration explored 100000 steps with 21851 reset in 67 ms.
Product exploration explored 100000 steps with 21911 reset in 73 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) (NOT p0)), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 112 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 114 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0)]
RANDOM walk for 16 steps (0 resets) in 4 ms. (3 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 9 factoid took 233 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 130 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 119 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0)]
[2025-06-02 03:52:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 03:52:47] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-02 03:52:47] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2025-06-02 03:52:47] [INFO ] Computed and/alt/rep : 5/6/5 causal constraints (skipped 0 transitions) in 0 ms.
[2025-06-02 03:52:47] [INFO ] Added : 0 causal constraints over 0 iterations in 1 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 4 out of 8 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 0 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2025-06-02 03:52:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:52:47] [INFO ] Implicit Places using invariants in 19 ms returned []
[2025-06-02 03:52:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:52:47] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 03:52:47] [INFO ] Redundant transitions in 0 ms returned []
Running 5 sub problems to find dead transitions.
[2025-06-02 03:52:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 1/8 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/8 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 6/14 variables, 8/19 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/14 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 0/14 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 14/14 variables, and 19 constraints, problems are : Problem set: 0 solved, 5 unsolved in 65 ms.
Refiners :[Domain max(s): 8/8 constraints, Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 8/8 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 1/8 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/8 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 6/14 variables, 8/19 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/14 variables, 5/24 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/14 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 0/14 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 14/14 variables, and 24 constraints, problems are : Problem set: 0 solved, 5 unsolved in 63 ms.
Refiners :[Domain max(s): 8/8 constraints, Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 8/8 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 130ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 130ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 184 ms. Remains : 8/8 places, 6/6 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 (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X p0), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 114 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 114 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0)]
RANDOM walk for 16 steps (0 resets) in 4 ms. (3 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X p0), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 9 factoid took 259 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 127 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 108 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0)]
[2025-06-02 03:52:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 03:52:48] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-02 03:52:48] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2025-06-02 03:52:48] [INFO ] Computed and/alt/rep : 5/6/5 causal constraints (skipped 0 transitions) in 0 ms.
[2025-06-02 03:52:48] [INFO ] Added : 0 causal constraints over 0 iterations in 1 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0)]
Product exploration explored 100000 steps with 21821 reset in 55 ms.
Product exploration explored 100000 steps with 21792 reset in 63 ms.
Built C files in :
/tmp/ltsmin375954764317524244
[2025-06-02 03:52:49] [INFO ] Computing symmetric may disable matrix : 6 transitions.
[2025-06-02 03:52:49] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 03:52:49] [INFO ] Computing symmetric may enable matrix : 6 transitions.
[2025-06-02 03:52:49] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 03:52:49] [INFO ] Computing Do-Not-Accords matrix : 6 transitions.
[2025-06-02 03:52:49] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 03:52:49] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin375954764317524244
Running compilation step : cd /tmp/ltsmin375954764317524244;'/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 61 ms.
Running link step : cd /tmp/ltsmin375954764317524244;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin375954764317524244;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1479208861496969134.hoa' '--buchi-type=spotba'
LTSmin run took 74 ms.
FORMULA IOTPpurchase-PT-C01M01P01D01-LTLFireability-15 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property IOTPpurchase-PT-C01M01P01D01-LTLFireability-15 finished in 2528 ms.
All properties solved by simple procedures.
Total runtime 32262 ms.

BK_STOP 1748836369377

--------------------
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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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 LTLFireability -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-C01M01P01D01"
export BK_EXAMINATION="LTLFireability"
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-C01M01P01D01, examination is LTLFireability"
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-174876422500364"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/IOTPpurchase-PT-C01M01P01D01.tgz
mv IOTPpurchase-PT-C01M01P01D01 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;