Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 596K
-rw-r--r-- 1 mcc users 6.0K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 48K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.1K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K 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.1K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K 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 18K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 161K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 17K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 109K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 13 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rwxr-xr-x 1 mcc users 60K May 29 14:32 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-LTLFireability-00
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-LTLFireability-01
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-LTLFireability-02
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-LTLFireability-03
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-LTLFireability-04
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-LTLFireability-05
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-LTLFireability-06
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-LTLFireability-07
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-LTLFireability-08
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-LTLFireability-09
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-LTLFireability-10
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-LTLFireability-11
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-LTLFireability-12
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-LTLFireability-13
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-LTLFireability-14
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1748836402486

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-C03M03P03D03
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-02 03:53:23] [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:53:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 03:53:24] [INFO ] Load time of PNML (sax parser for PT used): 61 ms
[2025-06-02 03:53:24] [INFO ] Transformed 111 places.
[2025-06-02 03:53:24] [INFO ] Transformed 45 transitions.
[2025-06-02 03:53:24] [INFO ] Parsed PT model containing 111 places and 45 transitions and 224 arcs in 170 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 5 formulas.
FORMULA IOTPpurchase-PT-C03M03P03D03-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IOTPpurchase-PT-C03M03P03D03-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IOTPpurchase-PT-C03M03P03D03-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IOTPpurchase-PT-C03M03P03D03-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IOTPpurchase-PT-C03M03P03D03-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 58 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 12 places
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 94 transition count 45
Applied a total of 17 rules in 26 ms. Remains 94 /111 variables (removed 17) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 94 cols
[2025-06-02 03:53:24] [INFO ] Computed 50 invariants in 24 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:53:24] [INFO ] Implicit Places using invariants in 252 ms returned [12, 24]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 291 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 92/111 places, 45/45 transitions.
Applied a total of 0 rules in 1 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 336 ms. Remains : 92/111 places, 45/45 transitions.
Support contains 58 out of 92 places after structural reductions.
[2025-06-02 03:53:24] [INFO ] Flatten gal took : 39 ms
[2025-06-02 03:53:24] [INFO ] Flatten gal took : 9 ms
[2025-06-02 03:53:24] [INFO ] Input system was already deterministic with 45 transitions.
Reduction of identical properties reduced properties to check from 23 to 21
RANDOM walk for 3554 steps (0 resets) in 197 ms. (17 steps per ms) remains 0/21 properties
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((X(((G(p2) U G(p3)) U (!p4&&(G(p2) U G(p3)))))||p1))&&p0)))'
Support contains 11 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 19 places
Discarding 3 places :
Implicit places reduction removed 3 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 3 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:53:25] [INFO ] Computed 26 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:53:25] [INFO ] Implicit Places using invariants in 53 ms returned [17, 19, 25]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 54 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 67/92 places, 45/45 transitions.
Applied a total of 0 rules in 3 ms. Remains 67 /67 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60 ms. Remains : 67/92 places, 45/45 transitions.
Stuttering acceptance computed with spot in 543 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p3)) (AND (NOT p1) p4)), (OR (NOT p0) (AND (NOT p1) (NOT p3)) (AND (NOT p1) p4)), true, (OR (NOT p3) p4), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) p4)), (NOT p2), (NOT p3), (NOT p3)]
Running random walk in product with property : IOTPpurchase-PT-C03M03P03D03-LTLFireability-00
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA IOTPpurchase-PT-C03M03P03D03-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IOTPpurchase-PT-C03M03P03D03-LTLFireability-00 finished in 687 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X((p0||G(p1)))&&(p2||(p1 U X(p3)))))))'
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 24 places
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 27 rules applied. Total rules applied 27 place count 65 transition count 45
Applied a total of 27 rules in 4 ms. Remains 65 /92 variables (removed 27) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 65 cols
[2025-06-02 03:53:26] [INFO ] Computed 21 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:53:26] [INFO ] Implicit Places using invariants in 53 ms returned [14, 15, 20]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 54 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 62/92 places, 45/45 transitions.
Applied a total of 0 rules in 2 ms. Remains 62 /62 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60 ms. Remains : 62/92 places, 45/45 transitions.
Stuttering acceptance computed with spot in 333 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p3))), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3))]
Running random walk in product with property : IOTPpurchase-PT-C03M03P03D03-LTLFireability-01
Product exploration explored 100000 steps with 23850 reset in 340 ms.
Product exploration explored 100000 steps with 23887 reset in 190 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 p2) (NOT p1) p0 (NOT p3)), (X (NOT p2)), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p2) p1))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p2) (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p2) p1 (NOT p3))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND p2 (NOT p1) (NOT p3))))), (X (X p0)), (X (X (NOT p1))), (X (X (NOT (AND p2 p1 (NOT p3)))))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 176 ms. Reduced automaton from 8 states, 27 edges and 4 AP (stutter sensitive) to 8 states, 25 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 334 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3))]
RANDOM walk for 28500 steps (6 resets) in 402 ms. (70 steps per ms) remains 0/18 properties
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0 (NOT p3)), (X (NOT p2)), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p2) p1))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p2) (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p2) p1 (NOT p3))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND p2 (NOT p1) (NOT p3))))), (X (X p0)), (X (X (NOT p1))), (X (X (NOT (AND p2 p1 (NOT p3)))))]
False Knowledge obtained : [(F (NOT (OR (NOT p1) (NOT p2) p3))), (F (NOT (OR p1 p0 p3))), (F (NOT (OR (NOT p1) p2 p0))), (F (NOT (OR p1 p2 p0 p3))), (F (NOT (OR (NOT p1) (NOT p2) p0 p3))), (F (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (F (NOT (OR p1 (NOT p2) p0 p3))), (F (NOT (OR (NOT p1) p0))), (F (NOT (OR p1 p2 p0))), (F (NOT (OR p1 (NOT p2) p3))), (F p3), (F p2), (F p1), (F (NOT (OR p1 p0))), (F (NOT p0)), (F (NOT (OR (NOT p1) p2 p3))), (F (NOT (OR (NOT p1) p0 p3))), (F (NOT (OR (NOT p1) p2 p0 p3)))]
Knowledge based reduction with 17 factoid took 639 ms. Reduced automaton from 8 states, 25 edges and 4 AP (stutter sensitive) to 8 states, 25 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 384 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3))]
Stuttering acceptance computed with spot in 368 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3))]
// Phase 1: matrix 45 rows 62 cols
[2025-06-02 03:53:29] [INFO ] Computed 18 invariants in 4 ms
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 03:53:29] [INFO ] [Real]Absence check using 16 positive place invariants in 5 ms returned sat
[2025-06-02 03:53:29] [INFO ] [Real]Absence check using 16 positive and 2 generalized place invariants in 2 ms returned sat
[2025-06-02 03:53:29] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2025-06-02 03:53:29] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 03:53:29] [INFO ] [Nat]Absence check using 16 positive place invariants in 8 ms returned sat
[2025-06-02 03:53:29] [INFO ] [Nat]Absence check using 16 positive and 2 generalized place invariants in 2 ms returned sat
[2025-06-02 03:53:29] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2025-06-02 03:53:29] [INFO ] Computed and/alt/rep : 44/45/44 causal constraints (skipped 0 transitions) in 15 ms.
[2025-06-02 03:53:29] [INFO ] Added : 30 causal constraints over 6 iterations in 175 ms. Result :sat
Could not prove EG (AND (NOT p2) (NOT p3))
Support contains 4 out of 62 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 45/45 transitions.
Applied a total of 0 rules in 2 ms. Remains 62 /62 variables (removed 0) and now considering 45/45 (removed 0) transitions.
[2025-06-02 03:53:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:53:29] [INFO ] Implicit Places using invariants in 92 ms returned []
[2025-06-02 03:53:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:53:29] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 193 ms to find 0 implicit places.
Running 44 sub problems to find dead transitions.
[2025-06-02 03:53:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (OVERLAPS) 1/62 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (OVERLAPS) 45/107 variables, 62/80 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/107 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (OVERLAPS) 0/107 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Real declared 107/107 variables, and 80 constraints, problems are : Problem set: 0 solved, 44 unsolved in 1392 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 62/62 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 44 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (OVERLAPS) 1/62 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (OVERLAPS) 45/107 variables, 62/80 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/107 variables, 44/124 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/107 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 8 (OVERLAPS) 0/107 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Int declared 107/107 variables, and 124 constraints, problems are : Problem set: 0 solved, 44 unsolved in 847 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 62/62 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2267ms problems are : Problem set: 0 solved, 44 unsolved
Search for dead transitions found 0 dead transitions in 2272ms
Finished structural reductions in LTL mode , in 1 iterations and 2468 ms. Remains : 62/62 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 p1) p0 (NOT p2) (NOT p3)), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X (NOT p3))), (X (X (AND (NOT p1) (NOT p2) (NOT p3)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 111 ms. Reduced automaton from 8 states, 25 edges and 4 AP (stutter sensitive) to 8 states, 25 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 340 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3))]
RANDOM walk for 24450 steps (5 resets) in 141 ms. (172 steps per ms) remains 0/18 properties
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2) (NOT p3)), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X (NOT p3))), (X (X (AND (NOT p1) (NOT p2) (NOT p3)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR (NOT p1) p2 p0))), (F (NOT (OR (NOT p1) (NOT p2) p3))), (F (NOT (OR p1 (NOT p2) p3 p0))), (F (NOT (OR (NOT p1) (NOT p2) p3 p0))), (F (NOT (OR (NOT p1) p2 p3 p0))), (F (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (F (NOT (OR p1 p2 p3 p0))), (F (NOT (OR (NOT p1) p0))), (F (NOT (OR p1 p2 p0))), (F (NOT (OR p1 (NOT p2) p3))), (F p3), (F p2), (F p1), (F (NOT (OR p1 p0))), (F (NOT p0)), (F (NOT (OR (NOT p1) p2 p3))), (F (NOT (OR p1 p3 p0))), (F (NOT (OR (NOT p1) p3 p0)))]
Knowledge based reduction with 6 factoid took 606 ms. Reduced automaton from 8 states, 25 edges and 4 AP (stutter sensitive) to 8 states, 25 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 355 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3))]
Stuttering acceptance computed with spot in 317 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3))]
[2025-06-02 03:53:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 03:53:33] [INFO ] [Real]Absence check using 16 positive place invariants in 4 ms returned sat
[2025-06-02 03:53:33] [INFO ] [Real]Absence check using 16 positive and 2 generalized place invariants in 1 ms returned sat
[2025-06-02 03:53:33] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2025-06-02 03:53:33] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 03:53:33] [INFO ] [Nat]Absence check using 16 positive place invariants in 4 ms returned sat
[2025-06-02 03:53:33] [INFO ] [Nat]Absence check using 16 positive and 2 generalized place invariants in 1 ms returned sat
[2025-06-02 03:53:33] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2025-06-02 03:53:33] [INFO ] Computed and/alt/rep : 44/45/44 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-02 03:53:33] [INFO ] Added : 30 causal constraints over 6 iterations in 48 ms. Result :sat
Could not prove EG (AND (NOT p2) (NOT p3))
Stuttering acceptance computed with spot in 343 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3))]
Product exploration explored 100000 steps with 18549 reset in 117 ms.
Product exploration explored 100000 steps with 18573 reset in 184 ms.
Built C files in :
/tmp/ltsmin8899396400637563254
[2025-06-02 03:53:34] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8899396400637563254
Running compilation step : cd /tmp/ltsmin8899396400637563254;'/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 265 ms.
Running link step : cd /tmp/ltsmin8899396400637563254;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin8899396400637563254;'/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/stateBased13066484235752270728.hoa' '--buchi-type=spotba'
LTSmin run took 105 ms.
FORMULA IOTPpurchase-PT-C03M03P03D03-LTLFireability-01 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property IOTPpurchase-PT-C03M03P03D03-LTLFireability-01 finished in 9252 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Support contains 7 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 21 places
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 69 transition count 37
Reduce places removed 13 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 22 rules applied. Total rules applied 32 place count 56 transition count 28
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 41 place count 47 transition count 28
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 41 place count 47 transition count 19
Deduced a syphon composed of 9 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 23 rules applied. Total rules applied 64 place count 33 transition count 19
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 65 place count 33 transition count 18
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 66 place count 32 transition count 18
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 66 place count 32 transition count 16
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 70 place count 30 transition count 16
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 5 with 17 rules applied. Total rules applied 87 place count 20 transition count 9
Applied a total of 87 rules in 17 ms. Remains 20 /92 variables (removed 72) and now considering 9/45 (removed 36) transitions.
// Phase 1: matrix 9 rows 20 cols
[2025-06-02 03:53:35] [INFO ] Computed 12 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:53:35] [INFO ] Implicit Places using invariants in 28 ms returned [1, 3, 5, 9, 13]
[2025-06-02 03:53:35] [INFO ] Actually due to overlaps returned [9, 1, 3, 13]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 29 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 16/92 places, 9/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 16 transition count 7
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 14 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 2 with 2 rules applied. Total rules applied 6 place count 13 transition count 6
Applied a total of 6 rules in 2 ms. Remains 13 /16 variables (removed 3) and now considering 6/9 (removed 3) transitions.
// Phase 1: matrix 6 rows 13 cols
[2025-06-02 03:53:35] [INFO ] Computed 8 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:53:35] [INFO ] Implicit Places using invariants in 22 ms returned [3]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 23 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 12/92 places, 6/45 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 6/6 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 72 ms. Remains : 12/92 places, 6/45 transitions.
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : IOTPpurchase-PT-C03M03P03D03-LTLFireability-02
Product exploration explored 100000 steps with 5151 reset in 141 ms.
Product exploration explored 100000 steps with 5079 reset in 155 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) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 7 factoid took 190 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 63 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 59 steps (0 resets) in 7 ms. (7 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (F (NOT p1)), (F (NOT (OR p0 p1))), (F p0), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 7 factoid took 258 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 65 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 7 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 6/6 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 6/6 (removed 0) transitions.
// Phase 1: matrix 6 rows 12 cols
[2025-06-02 03:53:36] [INFO ] Computed 7 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:53:36] [INFO ] Implicit Places using invariants in 21 ms returned []
[2025-06-02 03:53:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:53:36] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 03:53:36] [INFO ] Redundant transitions in 0 ms returned []
Running 5 sub problems to find dead transitions.
[2025-06-02 03:53:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/11 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 1/12 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 6/18 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/18 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/18 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 18/18 variables, and 19 constraints, problems are : Problem set: 0 solved, 5 unsolved in 62 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 12/12 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/11 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/11 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 1/12 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 6/18 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/18 variables, 5/24 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/18 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 0/18 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 18/18 variables, and 24 constraints, problems are : Problem set: 0 solved, 5 unsolved in 59 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 12/12 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 124ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 124ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 181 ms. Remains : 12/12 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) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 7 factoid took 200 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 60 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 67 steps (0 resets) in 4 ms. (13 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p0))), (F (NOT p1)), (F (NOT (OR p0 p1))), (F p0), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 7 factoid took 286 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 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 5095 reset in 104 ms.
Product exploration explored 100000 steps with 5120 reset in 110 ms.
Built C files in :
/tmp/ltsmin9285218961136633702
[2025-06-02 03:53:37] [INFO ] Computing symmetric may disable matrix : 6 transitions.
[2025-06-02 03:53:37] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 03:53:37] [INFO ] Computing symmetric may enable matrix : 6 transitions.
[2025-06-02 03:53:37] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 03:53:37] [INFO ] Computing Do-Not-Accords matrix : 6 transitions.
[2025-06-02 03:53:37] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 03:53:37] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9285218961136633702
Running compilation step : cd /tmp/ltsmin9285218961136633702;'/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 64 ms.
Running link step : cd /tmp/ltsmin9285218961136633702;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin9285218961136633702;'/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/stateBased17670200521890378303.hoa' '--buchi-type=spotba'
LTSmin run took 55 ms.
FORMULA IOTPpurchase-PT-C03M03P03D03-LTLFireability-02 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property IOTPpurchase-PT-C03M03P03D03-LTLFireability-02 finished in 2489 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(X(p0))) U ((X(G(!p1))||(!p1 U p2)) U p0))))'
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 18 places
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 71 transition count 45
Applied a total of 21 rules in 5 ms. Remains 71 /92 variables (removed 21) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 71 cols
[2025-06-02 03:53:37] [INFO ] Computed 27 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:53:37] [INFO ] Implicit Places using invariants in 43 ms returned [18]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 45 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 70/92 places, 45/45 transitions.
Applied a total of 0 rules in 1 ms. Remains 70 /70 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 52 ms. Remains : 70/92 places, 45/45 transitions.
Stuttering acceptance computed with spot in 574 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2) p1), (NOT p0), (AND (NOT p0) p1), (NOT p0), (AND (NOT p0) (NOT p2) p1), (NOT p0), true, (NOT p0), (AND (NOT p0) p1), (AND (NOT p2) p1 (NOT p0)), (NOT p0), (AND p1 (NOT p0)), (AND (NOT p2) p1), p1]
Running random walk in product with property : IOTPpurchase-PT-C03M03P03D03-LTLFireability-03
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA IOTPpurchase-PT-C03M03P03D03-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IOTPpurchase-PT-C03M03P03D03-LTLFireability-03 finished in 655 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 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 24 places
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 66 transition count 45
Applied a total of 26 rules in 3 ms. Remains 66 /92 variables (removed 26) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 66 cols
[2025-06-02 03:53:38] [INFO ] Computed 22 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:53:38] [INFO ] Implicit Places using invariants in 42 ms returned [14, 15, 20]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 45 ms to find 3 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 51 ms. Remains : 63/92 places, 45/45 transitions.
Stuttering acceptance computed with spot in 105 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : IOTPpurchase-PT-C03M03P03D03-LTLFireability-04
Entered a terminal (fully accepting) state of product in 6 steps with 0 reset in 0 ms.
FORMULA IOTPpurchase-PT-C03M03P03D03-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IOTPpurchase-PT-C03M03P03D03-LTLFireability-04 finished in 167 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' '!(((!p0 U X(!p0))||F(p1)))'
Support contains 3 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 24 places
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 66 transition count 45
Applied a total of 26 rules in 4 ms. Remains 66 /92 variables (removed 26) and now considering 45/45 (removed 0) transitions.
[2025-06-02 03:53:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:53:38] [INFO ] Implicit Places using invariants in 57 ms returned [14, 15, 20]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 58 ms to find 3 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 64 ms. Remains : 63/92 places, 45/45 transitions.
Stuttering acceptance computed with spot in 136 ms :[(AND p0 (NOT p1)), (NOT p1), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : IOTPpurchase-PT-C03M03P03D03-LTLFireability-05
Product exploration explored 100000 steps with 7095 reset in 153 ms.
Product exploration explored 100000 steps with 7107 reset in 170 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 (AND p0 (NOT p1))), (X p0), (X (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 73 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 78 ms :[(NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 68 steps (0 resets) in 4 ms. (13 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X p0), (X (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 7 factoid took 84 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 88 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 122 ms :[(NOT p1), (NOT p1), (NOT p1)]
// Phase 1: matrix 45 rows 63 cols
[2025-06-02 03:53:39] [INFO ] Computed 19 invariants in 1 ms
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 03:53:39] [INFO ] [Real]Absence check using 15 positive place invariants in 3 ms returned sat
[2025-06-02 03:53:39] [INFO ] [Real]Absence check using 15 positive and 4 generalized place invariants in 2 ms returned sat
[2025-06-02 03:53:39] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2025-06-02 03:53:39] [INFO ] Computed and/alt/rep : 44/46/44 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-02 03:53:39] [INFO ] Added : 5 causal constraints over 1 iterations in 19 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 1 out of 63 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 63/63 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.
[2025-06-02 03:53:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:53:39] [INFO ] Implicit Places using invariants in 49 ms returned []
[2025-06-02 03:53:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:53:39] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
Running 44 sub problems to find dead transitions.
[2025-06-02 03:53:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (OVERLAPS) 1/63 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (OVERLAPS) 45/108 variables, 63/82 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/108 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (OVERLAPS) 0/108 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Real declared 108/108 variables, and 82 constraints, problems are : Problem set: 0 solved, 44 unsolved in 931 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 63/63 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 44 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (OVERLAPS) 1/63 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (OVERLAPS) 45/108 variables, 63/82 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/108 variables, 44/126 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/108 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 8 (OVERLAPS) 0/108 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Int declared 108/108 variables, and 126 constraints, problems are : Problem set: 0 solved, 44 unsolved in 946 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 63/63 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1886ms problems are : Problem set: 0 solved, 44 unsolved
Search for dead transitions found 0 dead transitions in 1886ms
Finished structural reductions in LTL mode , in 1 iterations and 1991 ms. Remains : 63/63 places, 45/45 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p1), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 66 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 111 ms :[(NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 62 steps (0 resets) in 5 ms. (10 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p1), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 2 factoid took 82 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 125 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 101 ms :[(NOT p1), (NOT p1), (NOT p1)]
[2025-06-02 03:53:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 03:53:42] [INFO ] [Real]Absence check using 15 positive place invariants in 2 ms returned sat
[2025-06-02 03:53:42] [INFO ] [Real]Absence check using 15 positive and 4 generalized place invariants in 2 ms returned sat
[2025-06-02 03:53:42] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2025-06-02 03:53:42] [INFO ] Computed and/alt/rep : 44/46/44 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-02 03:53:42] [INFO ] Added : 5 causal constraints over 1 iterations in 12 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 120 ms :[(NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 7150 reset in 107 ms.
Product exploration explored 100000 steps with 7120 reset in 110 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 109 ms :[(NOT p1), (NOT p1), (NOT p1)]
Support contains 1 out of 63 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 places, 45/45 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 62 transition count 45
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 14 Pre rules applied. Total rules applied 9 place count 62 transition count 45
Deduced a syphon composed of 22 places in 0 ms
Iterating global reduction 1 with 14 rules applied. Total rules applied 23 place count 62 transition count 45
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 29 places in 0 ms
Iterating global reduction 1 with 7 rules applied. Total rules applied 30 place count 62 transition count 45
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 61 transition count 44
Deduced a syphon composed of 28 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 61 transition count 44
Deduced a syphon composed of 28 places in 0 ms
Applied a total of 32 rules in 10 ms. Remains 61 /63 variables (removed 2) and now considering 44/45 (removed 1) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 03:53:42] [INFO ] Redundant transitions in 1 ms returned []
Running 43 sub problems to find dead transitions.
// Phase 1: matrix 44 rows 61 cols
[2025-06-02 03:53:42] [INFO ] Computed 18 invariants in 1 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 43 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:53:42] [INFO ] Deduced a trap composed of 1 places in 30 ms of which 9 ms to minimize.
Problem TDEAD1 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:53:43] [INFO ] Deduced a trap composed of 1 places in 22 ms of which 1 ms to minimize.
Problem TDEAD2 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:53:43] [INFO ] Deduced a trap composed of 1 places in 18 ms of which 1 ms to minimize.
Problem TDEAD3 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:53:43] [INFO ] Deduced a trap composed of 1 places in 16 ms of which 2 ms to minimize.
Problem TDEAD4 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:53:43] [INFO ] Deduced a trap composed of 1 places in 15 ms of which 1 ms to minimize.
Problem TDEAD5 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:53:43] [INFO ] Deduced a trap composed of 1 places in 19 ms of which 2 ms to minimize.
Problem TDEAD6 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:53:43] [INFO ] Deduced a trap composed of 1 places in 23 ms of which 2 ms to minimize.
Problem TDEAD7 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:53:43] [INFO ] Deduced a trap composed of 1 places in 21 ms of which 2 ms to minimize.
Problem TDEAD8 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:53:43] [INFO ] Deduced a trap composed of 1 places in 20 ms of which 2 ms to minimize.
Problem TDEAD9 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:53:43] [INFO ] Deduced a trap composed of 1 places in 17 ms of which 1 ms to minimize.
Problem TDEAD10 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:53:43] [INFO ] Deduced a trap composed of 1 places in 28 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:53:43] [INFO ] Deduced a trap composed of 1 places in 23 ms of which 2 ms to minimize.
Problem TDEAD39 is UNSAT
Problem TDEAD11 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 12/29 constraints. Problems are: Problem set: 12 solved, 31 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/29 constraints. Problems are: Problem set: 12 solved, 31 unsolved
At refinement iteration 4 (OVERLAPS) 1/61 variables, 1/30 constraints. Problems are: Problem set: 12 solved, 31 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:53:43] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 1/31 constraints. Problems are: Problem set: 12 solved, 31 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:53:43] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/61 variables, 1/32 constraints. Problems are: Problem set: 12 solved, 31 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/61 variables, 0/32 constraints. Problems are: Problem set: 12 solved, 31 unsolved
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD42 is UNSAT
At refinement iteration 8 (OVERLAPS) 44/105 variables, 61/93 constraints. Problems are: Problem set: 28 solved, 15 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/105 variables, 0/93 constraints. Problems are: Problem set: 28 solved, 15 unsolved
At refinement iteration 10 (OVERLAPS) 0/105 variables, 0/93 constraints. Problems are: Problem set: 28 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 105/105 variables, and 93 constraints, problems are : Problem set: 28 solved, 15 unsolved in 1024 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 61/61 constraints, PredecessorRefiner: 43/43 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 28 solved, 15 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 12/12 constraints. Problems are: Problem set: 28 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/12 constraints. Problems are: Problem set: 28 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 30/60 variables, 15/27 constraints. Problems are: Problem set: 28 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 2/29 constraints. Problems are: Problem set: 28 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 1/30 constraints. Problems are: Problem set: 28 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 0/30 constraints. Problems are: Problem set: 28 solved, 15 unsolved
At refinement iteration 6 (OVERLAPS) 1/61 variables, 1/31 constraints. Problems are: Problem set: 28 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/61 variables, 1/32 constraints. Problems are: Problem set: 28 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/61 variables, 0/32 constraints. Problems are: Problem set: 28 solved, 15 unsolved
At refinement iteration 9 (OVERLAPS) 44/105 variables, 61/93 constraints. Problems are: Problem set: 28 solved, 15 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/105 variables, 15/108 constraints. Problems are: Problem set: 28 solved, 15 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/105 variables, 0/108 constraints. Problems are: Problem set: 28 solved, 15 unsolved
At refinement iteration 12 (OVERLAPS) 0/105 variables, 0/108 constraints. Problems are: Problem set: 28 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 105/105 variables, and 108 constraints, problems are : Problem set: 28 solved, 15 unsolved in 421 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 61/61 constraints, PredecessorRefiner: 15/43 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1451ms problems are : Problem set: 28 solved, 15 unsolved
Search for dead transitions found 28 dead transitions in 1452ms
Found 28 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 28 transitions
Dead transitions reduction (with SMT) removed 28 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 61/63 places, 16/45 transitions.
Graph (complete) has 70 edges and 61 vertex of which 33 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.2 ms
Discarding 28 places :
Also discarding 0 output transitions
Reduce places removed 12 places and 0 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 7 rules applied. Total rules applied 8 place count 20 transition count 16
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 8 place count 20 transition count 16
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 11 place count 20 transition count 16
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 14 place count 17 transition count 13
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 17 place count 17 transition count 13
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 19 place count 17 transition count 13
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 16 transition count 12
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 16 transition count 12
Deduced a syphon composed of 7 places in 0 ms
Applied a total of 21 rules in 9 ms. Remains 16 /61 variables (removed 45) and now considering 12/16 (removed 4) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 16/63 places, 12/45 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1477 ms. Remains : 16/63 places, 12/45 transitions.
Built C files in :
/tmp/ltsmin1554691341678402575
[2025-06-02 03:53:44] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1554691341678402575
Running compilation step : cd /tmp/ltsmin1554691341678402575;'/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 108 ms.
Running link step : cd /tmp/ltsmin1554691341678402575;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin1554691341678402575;'/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/stateBased2020218856603576925.hoa' '--buchi-type=spotba'
LTSmin run took 175 ms.
FORMULA IOTPpurchase-PT-C03M03P03D03-LTLFireability-05 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property IOTPpurchase-PT-C03M03P03D03-LTLFireability-05 finished in 6036 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((G(F(p0)) U p1)&&X(G(!p1)))))'
Support contains 1 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 21 places
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 68 transition count 45
Applied a total of 24 rules in 1 ms. Remains 68 /92 variables (removed 24) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 68 cols
[2025-06-02 03:53:44] [INFO ] Computed 24 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:53:44] [INFO ] Implicit Places using invariants in 57 ms returned [15, 16, 23]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 58 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 65/92 places, 45/45 transitions.
Applied a total of 0 rules in 1 ms. Remains 65 /65 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60 ms. Remains : 65/92 places, 45/45 transitions.
Stuttering acceptance computed with spot in 106 ms :[true, true, p1, true]
Running random walk in product with property : IOTPpurchase-PT-C03M03P03D03-LTLFireability-06
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA IOTPpurchase-PT-C03M03P03D03-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IOTPpurchase-PT-C03M03P03D03-LTLFireability-06 finished in 183 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||X(X(G((p1||G(p2)))))))'
Support contains 15 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 14 places
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 75 transition count 45
Applied a total of 17 rules in 1 ms. Remains 75 /92 variables (removed 17) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 75 cols
[2025-06-02 03:53:44] [INFO ] Computed 31 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:53:44] [INFO ] Implicit Places using invariants in 43 ms returned [19, 22, 30]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 44 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 72/92 places, 45/45 transitions.
Applied a total of 0 rules in 1 ms. Remains 72 /72 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 47 ms. Remains : 72/92 places, 45/45 transitions.
Stuttering acceptance computed with spot in 179 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p0)]
Running random walk in product with property : IOTPpurchase-PT-C03M03P03D03-LTLFireability-07
Product exploration explored 100000 steps with 2540 reset in 114 ms.
Product exploration explored 100000 steps with 2529 reset in 133 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p0)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1) p2))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 86 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 134 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 157 steps (0 resets) in 5 ms. (26 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p0)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1) p2))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 8 factoid took 120 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 141 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 147 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
// Phase 1: matrix 45 rows 72 cols
[2025-06-02 03:53:45] [INFO ] Computed 28 invariants in 0 ms
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 03:53:45] [INFO ] [Real]Absence check using 16 positive place invariants in 4 ms returned sat
[2025-06-02 03:53:45] [INFO ] [Real]Absence check using 16 positive and 12 generalized place invariants in 5 ms returned sat
[2025-06-02 03:53:46] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2025-06-02 03:53:46] [INFO ] Computed and/alt/rep : 44/55/44 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-02 03:53:46] [INFO ] Added : 15 causal constraints over 3 iterations in 48 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 4 out of 72 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 72/72 places, 45/45 transitions.
Applied a total of 0 rules in 0 ms. Remains 72 /72 variables (removed 0) and now considering 45/45 (removed 0) transitions.
[2025-06-02 03:53:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:53:46] [INFO ] Implicit Places using invariants in 56 ms returned []
[2025-06-02 03:53:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:53:46] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
Running 44 sub problems to find dead transitions.
[2025-06-02 03:53:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/71 variables, 12/27 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (OVERLAPS) 1/72 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (OVERLAPS) 45/117 variables, 72/100 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (OVERLAPS) 0/117 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Real declared 117/117 variables, and 100 constraints, problems are : Problem set: 0 solved, 44 unsolved in 1088 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 72/72 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 44 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/71 variables, 12/27 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (OVERLAPS) 1/72 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (OVERLAPS) 45/117 variables, 72/100 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 44/144 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/117 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 8 (OVERLAPS) 0/117 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Int declared 117/117 variables, and 144 constraints, problems are : Problem set: 0 solved, 44 unsolved in 821 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 72/72 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1915ms problems are : Problem set: 0 solved, 44 unsolved
Search for dead transitions found 0 dead transitions in 1916ms
Finished structural reductions in LTL mode , in 1 iterations and 2037 ms. Remains : 72/72 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 : [(NOT p0)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 54 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 145 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 159 steps (0 resets) in 4 ms. (31 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 1 factoid took 73 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 134 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 137 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
[2025-06-02 03:53:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 03:53:48] [INFO ] [Real]Absence check using 16 positive place invariants in 4 ms returned sat
[2025-06-02 03:53:48] [INFO ] [Real]Absence check using 16 positive and 12 generalized place invariants in 4 ms returned sat
[2025-06-02 03:53:48] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2025-06-02 03:53:48] [INFO ] Computed and/alt/rep : 44/55/44 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-02 03:53:48] [INFO ] Added : 15 causal constraints over 3 iterations in 33 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 136 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2544 reset in 107 ms.
Product exploration explored 100000 steps with 2537 reset in 123 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 133 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 4 out of 72 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 72/72 places, 45/45 transitions.
Ensure Unique test removed 8 places
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 64 transition count 45
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 14 Pre rules applied. Total rules applied 8 place count 64 transition count 45
Deduced a syphon composed of 22 places in 0 ms
Iterating global reduction 1 with 14 rules applied. Total rules applied 22 place count 64 transition count 45
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 29 places in 0 ms
Iterating global reduction 1 with 7 rules applied. Total rules applied 29 place count 64 transition count 45
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 63 transition count 44
Deduced a syphon composed of 28 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 63 transition count 44
Deduced a syphon composed of 28 places in 0 ms
Applied a total of 31 rules in 12 ms. Remains 63 /72 variables (removed 9) and now considering 44/45 (removed 1) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 03:53:49] [INFO ] Redundant transitions in 0 ms returned []
Running 43 sub problems to find dead transitions.
// Phase 1: matrix 44 rows 63 cols
[2025-06-02 03:53:49] [INFO ] Computed 20 invariants in 1 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 5/19 constraints. Problems are: Problem set: 0 solved, 43 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:53:49] [INFO ] Deduced a trap composed of 1 places in 20 ms of which 2 ms to minimize.
Problem TDEAD1 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:53:49] [INFO ] Deduced a trap composed of 1 places in 27 ms of which 2 ms to minimize.
Problem TDEAD2 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:53:49] [INFO ] Deduced a trap composed of 1 places in 17 ms of which 2 ms to minimize.
Problem TDEAD3 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:53:49] [INFO ] Deduced a trap composed of 1 places in 16 ms of which 1 ms to minimize.
Problem TDEAD4 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:53:49] [INFO ] Deduced a trap composed of 1 places in 15 ms of which 1 ms to minimize.
Problem TDEAD5 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:53:49] [INFO ] Deduced a trap composed of 1 places in 17 ms of which 1 ms to minimize.
Problem TDEAD6 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:53:49] [INFO ] Deduced a trap composed of 1 places in 17 ms of which 1 ms to minimize.
Problem TDEAD7 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:53:49] [INFO ] Deduced a trap composed of 1 places in 16 ms of which 1 ms to minimize.
Problem TDEAD9 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:53:49] [INFO ] Deduced a trap composed of 1 places in 15 ms of which 2 ms to minimize.
Problem TDEAD10 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:53:49] [INFO ] Deduced a trap composed of 1 places in 19 ms of which 1 ms to minimize.
Problem TDEAD11 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:53:49] [INFO ] Deduced a trap composed of 1 places in 19 ms of which 2 ms to minimize.
Problem TDEAD39 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:53:49] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 12/31 constraints. Problems are: Problem set: 11 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 0/31 constraints. Problems are: Problem set: 11 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 1/63 variables, 1/32 constraints. Problems are: Problem set: 11 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 0/32 constraints. Problems are: Problem set: 11 solved, 32 unsolved
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD42 is UNSAT
At refinement iteration 6 (OVERLAPS) 44/107 variables, 63/95 constraints. Problems are: Problem set: 28 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/107 variables, 0/95 constraints. Problems are: Problem set: 28 solved, 15 unsolved
At refinement iteration 8 (OVERLAPS) 0/107 variables, 0/95 constraints. Problems are: Problem set: 28 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 107/107 variables, and 95 constraints, problems are : Problem set: 28 solved, 15 unsolved in 840 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 63/63 constraints, PredecessorRefiner: 43/43 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 28 solved, 15 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 1/1 constraints. Problems are: Problem set: 28 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 2/3 constraints. Problems are: Problem set: 28 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 11/14 constraints. Problems are: Problem set: 28 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 0/14 constraints. Problems are: Problem set: 28 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 14/46 variables, 12/26 constraints. Problems are: Problem set: 28 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 2/28 constraints. Problems are: Problem set: 28 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/46 variables, 0/28 constraints. Problems are: Problem set: 28 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 16/62 variables, 2/30 constraints. Problems are: Problem set: 28 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/62 variables, 0/30 constraints. Problems are: Problem set: 28 solved, 15 unsolved
At refinement iteration 9 (OVERLAPS) 1/63 variables, 1/31 constraints. Problems are: Problem set: 28 solved, 15 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/63 variables, 1/32 constraints. Problems are: Problem set: 28 solved, 15 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/63 variables, 0/32 constraints. Problems are: Problem set: 28 solved, 15 unsolved
At refinement iteration 12 (OVERLAPS) 44/107 variables, 63/95 constraints. Problems are: Problem set: 28 solved, 15 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/107 variables, 15/110 constraints. Problems are: Problem set: 28 solved, 15 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/107 variables, 0/110 constraints. Problems are: Problem set: 28 solved, 15 unsolved
At refinement iteration 15 (OVERLAPS) 0/107 variables, 0/110 constraints. Problems are: Problem set: 28 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 107/107 variables, and 110 constraints, problems are : Problem set: 28 solved, 15 unsolved in 460 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 63/63 constraints, PredecessorRefiner: 15/43 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1307ms problems are : Problem set: 28 solved, 15 unsolved
Search for dead transitions found 28 dead transitions in 1307ms
Found 28 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 28 transitions
Dead transitions reduction (with SMT) removed 28 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 63/72 places, 16/45 transitions.
Graph (complete) has 73 edges and 63 vertex of which 35 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.1 ms
Discarding 28 places :
Also discarding 0 output transitions
Reduce places removed 11 places and 0 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 7 rules applied. Total rules applied 8 place count 23 transition count 16
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 8 place count 23 transition count 16
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 11 place count 23 transition count 16
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 16 place count 18 transition count 11
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 21 place count 18 transition count 11
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 23 place count 18 transition count 11
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 17 transition count 10
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 17 transition count 10
Deduced a syphon composed of 5 places in 0 ms
Applied a total of 25 rules in 8 ms. Remains 17 /63 variables (removed 46) and now considering 10/16 (removed 6) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 17/72 places, 10/45 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1333 ms. Remains : 17/72 places, 10/45 transitions.
Built C files in :
/tmp/ltsmin18115650433264798576
[2025-06-02 03:53:50] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18115650433264798576
Running compilation step : cd /tmp/ltsmin18115650433264798576;'/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 115 ms.
Running link step : cd /tmp/ltsmin18115650433264798576;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin18115650433264798576;'/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/stateBased18403025305385132828.hoa' '--buchi-type=spotba'
LTSmin run took 453 ms.
FORMULA IOTPpurchase-PT-C03M03P03D03-LTLFireability-07 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property IOTPpurchase-PT-C03M03P03D03-LTLFireability-07 finished in 6543 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 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 24 places
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 66 transition count 38
Reduce places removed 11 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 18 rules applied. Total rules applied 27 place count 55 transition count 31
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 34 place count 48 transition count 31
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 34 place count 48 transition count 21
Deduced a syphon composed of 10 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 25 rules applied. Total rules applied 59 place count 33 transition count 21
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 59 place count 33 transition count 18
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 65 place count 30 transition count 18
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 85 place count 18 transition count 10
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 3 with 1 rules applied. Total rules applied 86 place count 17 transition count 10
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 86 place count 17 transition count 9
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 89 place count 15 transition count 9
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 90 place count 15 transition count 8
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 5 with 3 rules applied. Total rules applied 93 place count 13 transition count 7
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 94 place count 12 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 7 with 2 rules applied. Total rules applied 96 place count 11 transition count 6
Applied a total of 96 rules in 7 ms. Remains 11 /92 variables (removed 81) and now considering 6/45 (removed 39) transitions.
// Phase 1: matrix 6 rows 11 cols
[2025-06-02 03:53:51] [INFO ] Computed 6 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:53:51] [INFO ] Implicit Places using invariants in 21 ms returned [2, 3, 4]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 22 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/92 places, 6/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 8 transition count 4
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 6 transition count 4
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 2 with 2 rules applied. Total rules applied 6 place count 5 transition count 3
Applied a total of 6 rules in 0 ms. Remains 5 /8 variables (removed 3) and now considering 3/6 (removed 3) transitions.
// Phase 1: matrix 3 rows 5 cols
[2025-06-02 03:53:51] [INFO ] Computed 3 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:53:51] [INFO ] Implicit Places using invariants in 17 ms returned []
[2025-06-02 03:53:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:53:51] [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 : 5/92 places, 3/45 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 68 ms. Remains : 5/92 places, 3/45 transitions.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Running random walk in product with property : IOTPpurchase-PT-C03M03P03D03-LTLFireability-10
Product exploration explored 100000 steps with 0 reset in 61 ms.
Stack based approach found an accepted trace after 2 steps with 0 reset with depth 3 and stack size 3 in 0 ms.
FORMULA IOTPpurchase-PT-C03M03P03D03-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property IOTPpurchase-PT-C03M03P03D03-LTLFireability-10 finished in 166 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((p0 U (F(G(p1)) U p2))))))'
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 21 places
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 68 transition count 45
Applied a total of 24 rules in 1 ms. Remains 68 /92 variables (removed 24) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 68 cols
[2025-06-02 03:53:51] [INFO ] Computed 24 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:53:51] [INFO ] Implicit Places using invariants in 44 ms returned [18]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 44 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 67/92 places, 45/45 transitions.
Applied a total of 0 rules in 1 ms. Remains 67 /67 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 46 ms. Remains : 67/92 places, 45/45 transitions.
Stuttering acceptance computed with spot in 225 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p1), (NOT p2), (NOT p2)]
Running random walk in product with property : IOTPpurchase-PT-C03M03P03D03-LTLFireability-13
Product exploration explored 100000 steps with 0 reset in 130 ms.
Stack based approach found an accepted trace after 471 steps with 0 reset with depth 472 and stack size 472 in 1 ms.
FORMULA IOTPpurchase-PT-C03M03P03D03-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property IOTPpurchase-PT-C03M03P03D03-LTLFireability-13 finished in 422 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&X(F(!p1)))))'
Support contains 3 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 24 places
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 66 transition count 45
Applied a total of 26 rules in 1 ms. Remains 66 /92 variables (removed 26) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 66 cols
[2025-06-02 03:53:51] [INFO ] Computed 22 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:53:52] [INFO ] Implicit Places using invariants in 45 ms returned [14, 15, 20]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 46 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 63/92 places, 45/45 transitions.
Applied a total of 0 rules in 0 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 47 ms. Remains : 63/92 places, 45/45 transitions.
Stuttering acceptance computed with spot in 52 ms :[(OR (NOT p0) p1), p1]
Running random walk in product with property : IOTPpurchase-PT-C03M03P03D03-LTLFireability-15
Product exploration explored 100000 steps with 1195 reset in 112 ms.
Product exploration explored 100000 steps with 1195 reset in 128 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), (X (NOT p0)), (X p1), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 81 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 84 ms :[(OR (NOT p0) p1), p1]
RANDOM walk for 356 steps (0 resets) in 6 ms. (50 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X p1), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F p0), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 114 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 71 ms :[(OR (NOT p0) p1), p1]
Stuttering acceptance computed with spot in 56 ms :[(OR (NOT p0) p1), p1]
// Phase 1: matrix 45 rows 63 cols
[2025-06-02 03:53:52] [INFO ] Computed 19 invariants in 1 ms
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 03:53:52] [INFO ] [Real]Absence check using 15 positive place invariants in 4 ms returned sat
[2025-06-02 03:53:52] [INFO ] [Real]Absence check using 15 positive and 4 generalized place invariants in 2 ms returned sat
[2025-06-02 03:53:52] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2025-06-02 03:53:52] [INFO ] Computed and/alt/rep : 44/46/44 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-02 03:53:52] [INFO ] Added : 24 causal constraints over 5 iterations in 46 ms. Result :sat
Could not prove EG (NOT p0)
[2025-06-02 03:53:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 03:53:52] [INFO ] [Real]Absence check using 15 positive place invariants in 3 ms returned sat
[2025-06-02 03:53:52] [INFO ] [Real]Absence check using 15 positive and 4 generalized place invariants in 2 ms returned sat
[2025-06-02 03:53:52] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2025-06-02 03:53:52] [INFO ] Computed and/alt/rep : 44/46/44 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-02 03:53:52] [INFO ] Added : 32 causal constraints over 7 iterations in 79 ms. Result :sat
Could not prove EG p1
Support contains 3 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 45/45 transitions.
Applied a total of 0 rules in 0 ms. Remains 63 /63 variables (removed 0) and now considering 45/45 (removed 0) transitions.
[2025-06-02 03:53:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:53:52] [INFO ] Implicit Places using invariants in 34 ms returned []
[2025-06-02 03:53:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:53:53] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
Running 44 sub problems to find dead transitions.
[2025-06-02 03:53:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (OVERLAPS) 1/63 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (OVERLAPS) 45/108 variables, 63/82 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/108 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (OVERLAPS) 0/108 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Real declared 108/108 variables, and 82 constraints, problems are : Problem set: 0 solved, 44 unsolved in 872 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 63/63 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 44 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (OVERLAPS) 1/63 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (OVERLAPS) 45/108 variables, 63/82 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/108 variables, 44/126 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/108 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 8 (OVERLAPS) 0/108 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Int declared 108/108 variables, and 126 constraints, problems are : Problem set: 0 solved, 44 unsolved in 834 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 63/63 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1710ms problems are : Problem set: 0 solved, 44 unsolved
Search for dead transitions found 0 dead transitions in 1710ms
Finished structural reductions in LTL mode , in 1 iterations and 1809 ms. Remains : 63/63 places, 45/45 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X p1), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 95 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 71 ms :[(OR (NOT p0) p1), p1]
RANDOM walk for 374 steps (0 resets) in 6 ms. (53 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X p1), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F p0), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 104 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 58 ms :[(OR (NOT p0) p1), p1]
Stuttering acceptance computed with spot in 64 ms :[(OR (NOT p0) p1), p1]
[2025-06-02 03:53:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 03:53:55] [INFO ] [Real]Absence check using 15 positive place invariants in 3 ms returned sat
[2025-06-02 03:53:55] [INFO ] [Real]Absence check using 15 positive and 4 generalized place invariants in 1 ms returned sat
[2025-06-02 03:53:55] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2025-06-02 03:53:55] [INFO ] Computed and/alt/rep : 44/46/44 causal constraints (skipped 0 transitions) in 6 ms.
[2025-06-02 03:53:55] [INFO ] Added : 24 causal constraints over 5 iterations in 44 ms. Result :sat
Could not prove EG (NOT p0)
[2025-06-02 03:53:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 03:53:55] [INFO ] [Real]Absence check using 15 positive place invariants in 3 ms returned sat
[2025-06-02 03:53:55] [INFO ] [Real]Absence check using 15 positive and 4 generalized place invariants in 1 ms returned sat
[2025-06-02 03:53:55] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2025-06-02 03:53:55] [INFO ] Computed and/alt/rep : 44/46/44 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-02 03:53:55] [INFO ] Added : 32 causal constraints over 7 iterations in 78 ms. Result :sat
Could not prove EG p1
Stuttering acceptance computed with spot in 62 ms :[(OR (NOT p0) p1), p1]
Product exploration explored 100000 steps with 1201 reset in 119 ms.
Product exploration explored 100000 steps with 1195 reset in 123 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 59 ms :[(OR (NOT p0) p1), p1]
Support contains 3 out of 63 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 places, 45/45 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 63 transition count 45
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 15 Pre rules applied. Total rules applied 8 place count 63 transition count 45
Deduced a syphon composed of 23 places in 0 ms
Iterating global reduction 1 with 15 rules applied. Total rules applied 23 place count 63 transition count 45
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 29 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 29 place count 63 transition count 45
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 62 transition count 44
Deduced a syphon composed of 28 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 62 transition count 44
Deduced a syphon composed of 28 places in 0 ms
Applied a total of 31 rules in 8 ms. Remains 62 /63 variables (removed 1) and now considering 44/45 (removed 1) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 03:53:55] [INFO ] Redundant transitions in 1 ms returned []
Running 43 sub problems to find dead transitions.
// Phase 1: matrix 44 rows 62 cols
[2025-06-02 03:53:55] [INFO ] Computed 19 invariants in 1 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 43 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:53:56] [INFO ] Deduced a trap composed of 1 places in 19 ms of which 1 ms to minimize.
Problem TDEAD0 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:53:56] [INFO ] Deduced a trap composed of 1 places in 35 ms of which 2 ms to minimize.
Problem TDEAD1 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:53:56] [INFO ] Deduced a trap composed of 1 places in 14 ms of which 2 ms to minimize.
Problem TDEAD2 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:53:56] [INFO ] Deduced a trap composed of 1 places in 17 ms of which 2 ms to minimize.
Problem TDEAD4 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:53:56] [INFO ] Deduced a trap composed of 1 places in 26 ms of which 2 ms to minimize.
Problem TDEAD5 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:53:56] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:53:56] [INFO ] Deduced a trap composed of 1 places in 20 ms of which 1 ms to minimize.
Problem TDEAD6 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:53:56] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:53:56] [INFO ] Deduced a trap composed of 1 places in 16 ms of which 1 ms to minimize.
Problem TDEAD7 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:53:56] [INFO ] Deduced a trap composed of 1 places in 22 ms of which 2 ms to minimize.
Problem TDEAD8 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:53:56] [INFO ] Deduced a trap composed of 1 places in 25 ms of which 2 ms to minimize.
Problem TDEAD9 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:53:56] [INFO ] Deduced a trap composed of 1 places in 23 ms of which 2 ms to minimize.
Problem TDEAD10 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:53:56] [INFO ] Deduced a trap composed of 1 places in 14 ms of which 2 ms to minimize.
Problem TDEAD39 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 13/31 constraints. Problems are: Problem set: 11 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 0/31 constraints. Problems are: Problem set: 11 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 1/62 variables, 1/32 constraints. Problems are: Problem set: 11 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/62 variables, 0/32 constraints. Problems are: Problem set: 11 solved, 32 unsolved
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD42 is UNSAT
At refinement iteration 6 (OVERLAPS) 44/106 variables, 62/94 constraints. Problems are: Problem set: 28 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/106 variables, 0/94 constraints. Problems are: Problem set: 28 solved, 15 unsolved
At refinement iteration 8 (OVERLAPS) 0/106 variables, 0/94 constraints. Problems are: Problem set: 28 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 106/106 variables, and 94 constraints, problems are : Problem set: 28 solved, 15 unsolved in 856 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 62/62 constraints, PredecessorRefiner: 43/43 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 28 solved, 15 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 10/10 constraints. Problems are: Problem set: 28 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/10 constraints. Problems are: Problem set: 28 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 30/61 variables, 14/24 constraints. Problems are: Problem set: 28 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 4/28 constraints. Problems are: Problem set: 28 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 2/30 constraints. Problems are: Problem set: 28 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 0/30 constraints. Problems are: Problem set: 28 solved, 15 unsolved
At refinement iteration 6 (OVERLAPS) 1/62 variables, 1/31 constraints. Problems are: Problem set: 28 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/62 variables, 1/32 constraints. Problems are: Problem set: 28 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/62 variables, 0/32 constraints. Problems are: Problem set: 28 solved, 15 unsolved
At refinement iteration 9 (OVERLAPS) 44/106 variables, 62/94 constraints. Problems are: Problem set: 28 solved, 15 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/106 variables, 15/109 constraints. Problems are: Problem set: 28 solved, 15 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/106 variables, 0/109 constraints. Problems are: Problem set: 28 solved, 15 unsolved
At refinement iteration 12 (OVERLAPS) 0/106 variables, 0/109 constraints. Problems are: Problem set: 28 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 106/106 variables, and 109 constraints, problems are : Problem set: 28 solved, 15 unsolved in 418 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 62/62 constraints, PredecessorRefiner: 15/43 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1280ms problems are : Problem set: 28 solved, 15 unsolved
Search for dead transitions found 28 dead transitions in 1281ms
Found 28 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 28 transitions
Dead transitions reduction (with SMT) removed 28 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 62/63 places, 16/45 transitions.
Graph (complete) has 73 edges and 62 vertex of which 34 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.1 ms
Discarding 28 places :
Also discarding 0 output transitions
Reduce places removed 11 places and 0 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 22 transition count 16
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 7 place count 22 transition count 16
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 10 place count 22 transition count 16
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 15 place count 17 transition count 11
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 20 place count 17 transition count 11
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 17 transition count 11
Deduced a syphon composed of 4 places in 0 ms
Applied a total of 21 rules in 4 ms. Remains 17 /62 variables (removed 45) and now considering 11/16 (removed 5) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 17/63 places, 11/45 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1301 ms. Remains : 17/63 places, 11/45 transitions.
Built C files in :
/tmp/ltsmin10060454826042755849
[2025-06-02 03:53:57] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10060454826042755849
Running compilation step : cd /tmp/ltsmin10060454826042755849;'/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 111 ms.
Running link step : cd /tmp/ltsmin10060454826042755849;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin10060454826042755849;'/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/stateBased16404912570601230381.hoa' '--buchi-type=spotba'
LTSmin run took 609 ms.
FORMULA IOTPpurchase-PT-C03M03P03D03-LTLFireability-15 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property IOTPpurchase-PT-C03M03P03D03-LTLFireability-15 finished in 6021 ms.
All properties solved by simple procedures.
Total runtime 34077 ms.

BK_STOP 1748836438014

--------------------
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-C03M03P03D03"
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-C03M03P03D03, 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-174876422600372"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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