Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r444-smll-171701110900180.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-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-5568
Executing tool itstools
Input is UtilityControlRoom-PT-Z2T4N02, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r444-smll-171701110900180
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 620K
-rw-r--r-- 1 mcc users 9.2K Apr 13 05:11 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Apr 13 05:11 CTLCardinality.xml
-rw-r--r-- 1 mcc users 13K Apr 13 05:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 73K Apr 13 05:07 CTLFireability.xml
-rw-r--r-- 1 mcc users 7.2K Apr 23 08:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 36K Apr 23 08:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Apr 23 08:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 23K Apr 23 08:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 23K Apr 13 05:13 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 163K Apr 13 05:13 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 23K Apr 13 05:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 109K Apr 13 05:12 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K Apr 23 08:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K Apr 23 08:04 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 8 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 24K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717106171043

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=UtilityControlRoom-PT-Z2T4N02
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-30 21:56:13] [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]
[2024-05-30 21:56:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 21:56:14] [INFO ] Load time of PNML (sax parser for PT used): 95 ms
[2024-05-30 21:56:14] [INFO ] Transformed 38 places.
[2024-05-30 21:56:14] [INFO ] Transformed 54 transitions.
[2024-05-30 21:56:14] [INFO ] Parsed PT model containing 38 places and 54 transitions and 170 arcs in 468 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 29 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
[2024-05-30 21:56:14] [INFO ] Reduced 2 identical enabling conditions.
[2024-05-30 21:56:14] [INFO ] Reduced 2 identical enabling conditions.
[2024-05-30 21:56:14] [INFO ] Reduced 2 identical enabling conditions.
Ensure Unique test removed 8 transitions
Reduce redundant transitions removed 8 transitions.
FORMULA UtilityControlRoom-PT-Z2T4N02-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 31 out of 38 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 46/46 transitions.
Applied a total of 0 rules in 21 ms. Remains 38 /38 variables (removed 0) and now considering 46/46 (removed 0) transitions.
// Phase 1: matrix 46 rows 38 cols
[2024-05-30 21:56:14] [INFO ] Computed 7 invariants in 10 ms
[2024-05-30 21:56:14] [INFO ] Implicit Places using invariants in 316 ms returned [27]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 384 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 37/38 places, 46/46 transitions.
Applied a total of 0 rules in 2 ms. Remains 37 /37 variables (removed 0) and now considering 46/46 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 444 ms. Remains : 37/38 places, 46/46 transitions.
Support contains 31 out of 37 places after structural reductions.
[2024-05-30 21:56:15] [INFO ] Flatten gal took : 45 ms
[2024-05-30 21:56:15] [INFO ] Flatten gal took : 31 ms
[2024-05-30 21:56:15] [INFO ] Input system was already deterministic with 46 transitions.
Reduction of identical properties reduced properties to check from 29 to 27
RANDOM walk for 1759 steps (0 resets) in 227 ms. (7 steps per ms) remains 0/27 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.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 4 out of 37 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 37/37 places, 46/46 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 33 transition count 42
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 33 transition count 42
Applied a total of 8 rules in 16 ms. Remains 33 /37 variables (removed 4) and now considering 42/46 (removed 4) transitions.
// Phase 1: matrix 42 rows 33 cols
[2024-05-30 21:56:16] [INFO ] Computed 6 invariants in 3 ms
[2024-05-30 21:56:16] [INFO ] Implicit Places using invariants in 109 ms returned [22]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 111 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 32/37 places, 42/46 transitions.
Applied a total of 0 rules in 2 ms. Remains 32 /32 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 129 ms. Remains : 32/37 places, 42/46 transitions.
Stuttering acceptance computed with spot in 351 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z2T4N02-LTLFireability-00
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA UtilityControlRoom-PT-Z2T4N02-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z2T4N02-LTLFireability-00 finished in 597 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!p0 U (G(!p0)||(X(X(G(p2)))&&p1))))'
Support contains 9 out of 37 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 37/37 places, 46/46 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 33 transition count 42
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 33 transition count 42
Applied a total of 8 rules in 4 ms. Remains 33 /37 variables (removed 4) and now considering 42/46 (removed 4) transitions.
[2024-05-30 21:56:16] [INFO ] Invariant cache hit.
[2024-05-30 21:56:16] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-30 21:56:16] [INFO ] Invariant cache hit.
[2024-05-30 21:56:16] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 162 ms to find 0 implicit places.
Running 40 sub problems to find dead transitions.
[2024-05-30 21:56:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 2/33 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (OVERLAPS) 42/75 variables, 33/39 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (OVERLAPS) 0/75 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Real declared 75/75 variables, and 39 constraints, problems are : Problem set: 0 solved, 40 unsolved in 1075 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 40 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 2/33 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (OVERLAPS) 42/75 variables, 33/39 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 40/79 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (OVERLAPS) 0/75 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Int declared 75/75 variables, and 79 constraints, problems are : Problem set: 0 solved, 40 unsolved in 954 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints]
After SMT, in 2113ms problems are : Problem set: 0 solved, 40 unsolved
Search for dead transitions found 0 dead transitions in 2127ms
Starting structural reductions in LTL mode, iteration 1 : 33/37 places, 42/46 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2298 ms. Remains : 33/37 places, 42/46 transitions.
Stuttering acceptance computed with spot in 308 ms :[true, (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (NOT p2), (AND p0 (NOT p2)), (NOT p2), (AND p0 (NOT p2))]
Running random walk in product with property : UtilityControlRoom-PT-Z2T4N02-LTLFireability-01
Entered a terminal (fully accepting) state of product in 9 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-PT-Z2T4N02-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z2T4N02-LTLFireability-01 finished in 2633 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 6 out of 37 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 37/37 places, 46/46 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 33 transition count 42
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 33 transition count 42
Applied a total of 8 rules in 3 ms. Remains 33 /37 variables (removed 4) and now considering 42/46 (removed 4) transitions.
[2024-05-30 21:56:19] [INFO ] Invariant cache hit.
[2024-05-30 21:56:19] [INFO ] Implicit Places using invariants in 61 ms returned [22]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 62 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 32/37 places, 42/46 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 66 ms. Remains : 32/37 places, 42/46 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z2T4N02-LTLFireability-02
Product exploration explored 100000 steps with 1696 reset in 315 ms.
Stack based approach found an accepted trace after 74 steps with 1 reset with depth 36 and stack size 36 in 1 ms.
FORMULA UtilityControlRoom-PT-Z2T4N02-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z2T4N02-LTLFireability-02 finished in 479 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U !p1)))'
Support contains 17 out of 37 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 37/37 places, 46/46 transitions.
Applied a total of 0 rules in 1 ms. Remains 37 /37 variables (removed 0) and now considering 46/46 (removed 0) transitions.
// Phase 1: matrix 46 rows 37 cols
[2024-05-30 21:56:19] [INFO ] Computed 6 invariants in 2 ms
[2024-05-30 21:56:19] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-05-30 21:56:19] [INFO ] Invariant cache hit.
[2024-05-30 21:56:19] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 96 ms to find 0 implicit places.
Running 44 sub problems to find dead transitions.
[2024-05-30 21:56:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (OVERLAPS) 2/37 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (OVERLAPS) 46/83 variables, 37/43 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/83 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (OVERLAPS) 0/83 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Real declared 83/83 variables, and 43 constraints, problems are : Problem set: 0 solved, 44 unsolved in 846 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 37/37 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 44 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (OVERLAPS) 2/37 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (OVERLAPS) 46/83 variables, 37/43 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/83 variables, 44/87 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/83 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (OVERLAPS) 0/83 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Int declared 83/83 variables, and 87 constraints, problems are : Problem set: 0 solved, 44 unsolved in 791 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 37/37 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 0/0 constraints]
After SMT, in 1666ms problems are : Problem set: 0 solved, 44 unsolved
Search for dead transitions found 0 dead transitions in 1668ms
Finished structural reductions in LTL mode , in 1 iterations and 1767 ms. Remains : 37/37 places, 46/46 transitions.
Stuttering acceptance computed with spot in 84 ms :[p1, p1, true]
Running random walk in product with property : UtilityControlRoom-PT-Z2T4N02-LTLFireability-03
Product exploration explored 100000 steps with 50000 reset in 176 ms.
Product exploration explored 100000 steps with 50000 reset in 334 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 26 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA UtilityControlRoom-PT-Z2T4N02-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-PT-Z2T4N02-LTLFireability-03 finished in 2416 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 7 out of 37 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 37/37 places, 46/46 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 33 transition count 42
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 33 transition count 42
Applied a total of 8 rules in 3 ms. Remains 33 /37 variables (removed 4) and now considering 42/46 (removed 4) transitions.
// Phase 1: matrix 42 rows 33 cols
[2024-05-30 21:56:22] [INFO ] Computed 6 invariants in 10 ms
[2024-05-30 21:56:22] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-05-30 21:56:22] [INFO ] Invariant cache hit.
[2024-05-30 21:56:22] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 132 ms to find 0 implicit places.
Running 40 sub problems to find dead transitions.
[2024-05-30 21:56:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 2/33 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (OVERLAPS) 42/75 variables, 33/39 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (OVERLAPS) 0/75 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Real declared 75/75 variables, and 39 constraints, problems are : Problem set: 0 solved, 40 unsolved in 874 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 40 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 2/33 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (OVERLAPS) 42/75 variables, 33/39 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 40/79 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (OVERLAPS) 0/75 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Int declared 75/75 variables, and 79 constraints, problems are : Problem set: 0 solved, 40 unsolved in 977 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints]
After SMT, in 1879ms problems are : Problem set: 0 solved, 40 unsolved
Search for dead transitions found 0 dead transitions in 1880ms
Starting structural reductions in LTL mode, iteration 1 : 33/37 places, 42/46 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2017 ms. Remains : 33/37 places, 42/46 transitions.
Stuttering acceptance computed with spot in 148 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z2T4N02-LTLFireability-04
Product exploration explored 100000 steps with 27023 reset in 155 ms.
Product exploration explored 100000 steps with 26998 reset in 175 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 : [(NOT p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 172 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 151 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 8 steps (0 resets) in 4 ms. (1 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 195 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 144 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 136 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-05-30 21:56:25] [INFO ] Invariant cache hit.
[2024-05-30 21:56:25] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2024-05-30 21:56:25] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-05-30 21:56:25] [INFO ] Computed and/alt/rep : 40/62/40 causal constraints (skipped 0 transitions) in 7 ms.
[2024-05-30 21:56:25] [INFO ] Added : 2 causal constraints over 1 iterations in 26 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 7 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 42/42 transitions.
Applied a total of 0 rules in 1 ms. Remains 33 /33 variables (removed 0) and now considering 42/42 (removed 0) transitions.
[2024-05-30 21:56:25] [INFO ] Invariant cache hit.
[2024-05-30 21:56:25] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-30 21:56:25] [INFO ] Invariant cache hit.
[2024-05-30 21:56:25] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
Running 40 sub problems to find dead transitions.
[2024-05-30 21:56:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 2/33 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (OVERLAPS) 42/75 variables, 33/39 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (OVERLAPS) 0/75 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Real declared 75/75 variables, and 39 constraints, problems are : Problem set: 0 solved, 40 unsolved in 766 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 40 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 2/33 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (OVERLAPS) 42/75 variables, 33/39 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 40/79 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (OVERLAPS) 0/75 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Int declared 75/75 variables, and 79 constraints, problems are : Problem set: 0 solved, 40 unsolved in 799 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints]
After SMT, in 1585ms problems are : Problem set: 0 solved, 40 unsolved
Search for dead transitions found 0 dead transitions in 1587ms
Finished structural reductions in LTL mode , in 1 iterations and 1707 ms. Remains : 33/33 places, 42/42 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 : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 158 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 141 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 13 steps (0 resets) in 4 ms. (2 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 184 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 144 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 147 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-05-30 21:56:28] [INFO ] Invariant cache hit.
[2024-05-30 21:56:28] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2024-05-30 21:56:28] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2024-05-30 21:56:28] [INFO ] Computed and/alt/rep : 40/62/40 causal constraints (skipped 0 transitions) in 7 ms.
[2024-05-30 21:56:28] [INFO ] Added : 2 causal constraints over 1 iterations in 24 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 145 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 26918 reset in 136 ms.
Product exploration explored 100000 steps with 26974 reset in 159 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 146 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 7 out of 33 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 33/33 places, 42/42 transitions.
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 0 place count 33 transition count 46
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 33 transition count 46
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 33 transition count 46
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 12 place count 33 transition count 42
Deduced a syphon composed of 8 places in 0 ms
Applied a total of 12 rules in 23 ms. Remains 33 /33 variables (removed 0) and now considering 42/42 (removed 0) transitions.
[2024-05-30 21:56:29] [INFO ] Redundant transitions in 1 ms returned []
Running 40 sub problems to find dead transitions.
// Phase 1: matrix 42 rows 33 cols
[2024-05-30 21:56:29] [INFO ] Computed 6 invariants in 2 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-05-30 21:56:29] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 12 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (OVERLAPS) 2/33 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-05-30 21:56:30] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 2 ms to minimize.
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
[2024-05-30 21:56:30] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 2 ms to minimize.
Problem TDEAD4 is UNSAT
Problem TDEAD5 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
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 2/9 constraints. Problems are: Problem set: 12 solved, 28 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/9 constraints. Problems are: Problem set: 12 solved, 28 unsolved
At refinement iteration 6 (OVERLAPS) 42/75 variables, 33/42 constraints. Problems are: Problem set: 12 solved, 28 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/75 variables, 0/42 constraints. Problems are: Problem set: 12 solved, 28 unsolved
At refinement iteration 8 (OVERLAPS) 0/75 variables, 0/42 constraints. Problems are: Problem set: 12 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Real declared 75/75 variables, and 42 constraints, problems are : Problem set: 12 solved, 28 unsolved in 955 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 12 solved, 28 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 1/1 constraints. Problems are: Problem set: 12 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 0/1 constraints. Problems are: Problem set: 12 solved, 28 unsolved
At refinement iteration 2 (OVERLAPS) 10/33 variables, 6/7 constraints. Problems are: Problem set: 12 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 2/9 constraints. Problems are: Problem set: 12 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 0/9 constraints. Problems are: Problem set: 12 solved, 28 unsolved
At refinement iteration 5 (OVERLAPS) 42/75 variables, 33/42 constraints. Problems are: Problem set: 12 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 28/70 constraints. Problems are: Problem set: 12 solved, 28 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/75 variables, 0/70 constraints. Problems are: Problem set: 12 solved, 28 unsolved
At refinement iteration 8 (OVERLAPS) 0/75 variables, 0/70 constraints. Problems are: Problem set: 12 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Int declared 75/75 variables, and 70 constraints, problems are : Problem set: 12 solved, 28 unsolved in 444 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 28/40 constraints, Known Traps: 3/3 constraints]
After SMT, in 1418ms problems are : Problem set: 12 solved, 28 unsolved
Search for dead transitions found 12 dead transitions in 1419ms
Found 12 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 12 transitions
Dead transitions reduction (with SMT) removed 12 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 33/33 places, 30/42 transitions.
Graph (complete) has 50 edges and 33 vertex of which 25 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 4 ms. Remains 25 /33 variables (removed 8) and now considering 30/30 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 25/33 places, 30/42 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1456 ms. Remains : 25/33 places, 30/42 transitions.
Built C files in :
/tmp/ltsmin4944258809974645403
[2024-05-30 21:56:30] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4944258809974645403
Running compilation step : cd /tmp/ltsmin4944258809974645403;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 444 ms.
Running link step : cd /tmp/ltsmin4944258809974645403;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 73 ms.
Running LTSmin : cd /tmp/ltsmin4944258809974645403;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased7582143648067188338.hoa' '--buchi-type=spotba'
LTSmin run took 447 ms.
FORMULA UtilityControlRoom-PT-Z2T4N02-LTLFireability-04 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property UtilityControlRoom-PT-Z2T4N02-LTLFireability-04 finished in 9758 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 13 out of 37 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 37/37 places, 46/46 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 37 transition count 38
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 20 place count 29 transition count 34
Applied a total of 20 rules in 10 ms. Remains 29 /37 variables (removed 8) and now considering 34/46 (removed 12) transitions.
// Phase 1: matrix 34 rows 29 cols
[2024-05-30 21:56:31] [INFO ] Computed 6 invariants in 1 ms
[2024-05-30 21:56:32] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-30 21:56:32] [INFO ] Invariant cache hit.
[2024-05-30 21:56:32] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 111 ms to find 0 implicit places.
[2024-05-30 21:56:32] [INFO ] Redundant transitions in 0 ms returned []
Running 32 sub problems to find dead transitions.
[2024-05-30 21:56:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (OVERLAPS) 2/29 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 34/63 variables, 29/35 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (OVERLAPS) 0/63 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Real declared 63/63 variables, and 35 constraints, problems are : Problem set: 0 solved, 32 unsolved in 686 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 29/29 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 32 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (OVERLAPS) 2/29 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 34/63 variables, 29/35 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 32/67 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/63 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (OVERLAPS) 0/63 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Int declared 63/63 variables, and 67 constraints, problems are : Problem set: 0 solved, 32 unsolved in 624 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 29/29 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints]
After SMT, in 1323ms problems are : Problem set: 0 solved, 32 unsolved
Search for dead transitions found 0 dead transitions in 1324ms
Starting structural reductions in SI_LTL mode, iteration 1 : 29/37 places, 34/46 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1454 ms. Remains : 29/37 places, 34/46 transitions.
Stuttering acceptance computed with spot in 152 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : UtilityControlRoom-PT-Z2T4N02-LTLFireability-05
Product exploration explored 100000 steps with 0 reset in 300 ms.
Stack based approach found an accepted trace after 64 steps with 2 reset with depth 24 and stack size 24 in 1 ms.
FORMULA UtilityControlRoom-PT-Z2T4N02-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z2T4N02-LTLFireability-05 finished in 1927 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(F(p1))||p0))))'
Support contains 13 out of 37 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 37/37 places, 46/46 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 33 transition count 42
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 33 transition count 42
Applied a total of 8 rules in 2 ms. Remains 33 /37 variables (removed 4) and now considering 42/46 (removed 4) transitions.
// Phase 1: matrix 42 rows 33 cols
[2024-05-30 21:56:33] [INFO ] Computed 6 invariants in 2 ms
[2024-05-30 21:56:33] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-30 21:56:33] [INFO ] Invariant cache hit.
[2024-05-30 21:56:34] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
Running 40 sub problems to find dead transitions.
[2024-05-30 21:56:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 2/33 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (OVERLAPS) 42/75 variables, 33/39 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (OVERLAPS) 0/75 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Real declared 75/75 variables, and 39 constraints, problems are : Problem set: 0 solved, 40 unsolved in 902 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 40 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 2/33 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (OVERLAPS) 42/75 variables, 33/39 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 40/79 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (OVERLAPS) 0/75 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Int declared 75/75 variables, and 79 constraints, problems are : Problem set: 0 solved, 40 unsolved in 905 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints]
After SMT, in 1824ms problems are : Problem set: 0 solved, 40 unsolved
Search for dead transitions found 0 dead transitions in 1826ms
Starting structural reductions in LTL mode, iteration 1 : 33/37 places, 42/46 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1943 ms. Remains : 33/37 places, 42/46 transitions.
Stuttering acceptance computed with spot in 166 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : UtilityControlRoom-PT-Z2T4N02-LTLFireability-06
Product exploration explored 100000 steps with 28499 reset in 207 ms.
Product exploration explored 100000 steps with 28550 reset in 384 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 (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 325 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 262 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
RANDOM walk for 177 steps (0 resets) in 7 ms. (22 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 p1))), (F p0), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 4 factoid took 503 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 258 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Stuttering acceptance computed with spot in 257 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Support contains 13 out of 33 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 33/33 places, 42/42 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 29 transition count 38
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 12 place count 29 transition count 34
Applied a total of 12 rules in 6 ms. Remains 29 /33 variables (removed 4) and now considering 34/42 (removed 8) transitions.
// Phase 1: matrix 34 rows 29 cols
[2024-05-30 21:56:38] [INFO ] Computed 6 invariants in 1 ms
[2024-05-30 21:56:38] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-30 21:56:38] [INFO ] Invariant cache hit.
[2024-05-30 21:56:38] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
[2024-05-30 21:56:38] [INFO ] Redundant transitions in 1 ms returned []
Running 32 sub problems to find dead transitions.
[2024-05-30 21:56:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (OVERLAPS) 2/29 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 34/63 variables, 29/35 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (OVERLAPS) 0/63 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Real declared 63/63 variables, and 35 constraints, problems are : Problem set: 0 solved, 32 unsolved in 664 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 29/29 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 32 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (OVERLAPS) 2/29 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 34/63 variables, 29/35 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 32/67 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/63 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (OVERLAPS) 0/63 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Int declared 63/63 variables, and 67 constraints, problems are : Problem set: 0 solved, 32 unsolved in 673 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 29/29 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints]
After SMT, in 1348ms problems are : Problem set: 0 solved, 32 unsolved
Search for dead transitions found 0 dead transitions in 1350ms
Starting structural reductions in SI_LTL mode, iteration 1 : 29/33 places, 34/42 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1475 ms. Remains : 29/33 places, 34/42 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 (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 7 factoid took 447 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 259 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
RANDOM walk for 51 steps (0 resets) in 5 ms. (8 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 p1))), (F p0), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 7 factoid took 647 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 261 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Stuttering acceptance computed with spot in 265 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Stuttering acceptance computed with spot in 262 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Product exploration explored 100000 steps with 28499 reset in 243 ms.
Product exploration explored 100000 steps with 28490 reset in 279 ms.
Built C files in :
/tmp/ltsmin4192230808530075420
[2024-05-30 21:56:42] [INFO ] Computing symmetric may disable matrix : 34 transitions.
[2024-05-30 21:56:42] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 21:56:42] [INFO ] Computing symmetric may enable matrix : 34 transitions.
[2024-05-30 21:56:42] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 21:56:42] [INFO ] Computing Do-Not-Accords matrix : 34 transitions.
[2024-05-30 21:56:42] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 21:56:42] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4192230808530075420
Running compilation step : cd /tmp/ltsmin4192230808530075420;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 267 ms.
Running link step : cd /tmp/ltsmin4192230808530075420;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin4192230808530075420;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased18105875375800267073.hoa' '--buchi-type=spotba'
LTSmin run took 219 ms.
FORMULA UtilityControlRoom-PT-Z2T4N02-LTLFireability-06 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property UtilityControlRoom-PT-Z2T4N02-LTLFireability-06 finished in 9128 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&X((F(p2)||p1))&&(p2 U (p3||G(p2))))))'
Support contains 6 out of 37 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 37/37 places, 46/46 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 33 transition count 42
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 33 transition count 42
Applied a total of 8 rules in 2 ms. Remains 33 /37 variables (removed 4) and now considering 42/46 (removed 4) transitions.
// Phase 1: matrix 42 rows 33 cols
[2024-05-30 21:56:43] [INFO ] Computed 6 invariants in 1 ms
[2024-05-30 21:56:43] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-30 21:56:43] [INFO ] Invariant cache hit.
[2024-05-30 21:56:43] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
Running 40 sub problems to find dead transitions.
[2024-05-30 21:56:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 2/33 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (OVERLAPS) 42/75 variables, 33/39 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (OVERLAPS) 0/75 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Real declared 75/75 variables, and 39 constraints, problems are : Problem set: 0 solved, 40 unsolved in 919 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 40 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 2/33 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (OVERLAPS) 42/75 variables, 33/39 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 40/79 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (OVERLAPS) 0/75 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Int declared 75/75 variables, and 79 constraints, problems are : Problem set: 0 solved, 40 unsolved in 920 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints]
After SMT, in 1860ms problems are : Problem set: 0 solved, 40 unsolved
Search for dead transitions found 0 dead transitions in 1861ms
Starting structural reductions in LTL mode, iteration 1 : 33/37 places, 42/46 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1981 ms. Remains : 33/37 places, 42/46 transitions.
Stuttering acceptance computed with spot in 372 ms :[(OR (NOT p0) (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2))), true, (NOT p0), (AND (NOT p2) (NOT p1)), (AND (NOT p3) (NOT p2)), (NOT p2)]
Running random walk in product with property : UtilityControlRoom-PT-Z2T4N02-LTLFireability-08
Product exploration explored 100000 steps with 26928 reset in 203 ms.
Stack based approach found an accepted trace after 25197 steps with 6815 reset with depth 10 and stack size 10 in 50 ms.
FORMULA UtilityControlRoom-PT-Z2T4N02-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z2T4N02-LTLFireability-08 finished in 2638 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(G((p1&&F(p2))))))'
Support contains 6 out of 37 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 37/37 places, 46/46 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 33 transition count 42
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 33 transition count 42
Applied a total of 8 rules in 2 ms. Remains 33 /37 variables (removed 4) and now considering 42/46 (removed 4) transitions.
[2024-05-30 21:56:45] [INFO ] Invariant cache hit.
[2024-05-30 21:56:45] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-30 21:56:45] [INFO ] Invariant cache hit.
[2024-05-30 21:56:45] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
Running 40 sub problems to find dead transitions.
[2024-05-30 21:56:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 2/33 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (OVERLAPS) 42/75 variables, 33/39 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (OVERLAPS) 0/75 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Real declared 75/75 variables, and 39 constraints, problems are : Problem set: 0 solved, 40 unsolved in 867 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 40 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 2/33 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (OVERLAPS) 42/75 variables, 33/39 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 40/79 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (OVERLAPS) 0/75 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Int declared 75/75 variables, and 79 constraints, problems are : Problem set: 0 solved, 40 unsolved in 863 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints]
After SMT, in 1752ms problems are : Problem set: 0 solved, 40 unsolved
Search for dead transitions found 0 dead transitions in 1753ms
Starting structural reductions in LTL mode, iteration 1 : 33/37 places, 42/46 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1886 ms. Remains : 33/37 places, 42/46 transitions.
Stuttering acceptance computed with spot in 251 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), true, (NOT p2)]
Running random walk in product with property : UtilityControlRoom-PT-Z2T4N02-LTLFireability-09
Entered a terminal (fully accepting) state of product in 39 steps with 2 reset in 0 ms.
FORMULA UtilityControlRoom-PT-Z2T4N02-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z2T4N02-LTLFireability-09 finished in 2161 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||(p1&&X(G(p2))))))'
Support contains 6 out of 37 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 37/37 places, 46/46 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 33 transition count 42
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 33 transition count 42
Applied a total of 8 rules in 2 ms. Remains 33 /37 variables (removed 4) and now considering 42/46 (removed 4) transitions.
[2024-05-30 21:56:47] [INFO ] Invariant cache hit.
[2024-05-30 21:56:47] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-30 21:56:47] [INFO ] Invariant cache hit.
[2024-05-30 21:56:47] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
Running 40 sub problems to find dead transitions.
[2024-05-30 21:56:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 2/33 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (OVERLAPS) 42/75 variables, 33/39 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (OVERLAPS) 0/75 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Real declared 75/75 variables, and 39 constraints, problems are : Problem set: 0 solved, 40 unsolved in 834 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 40 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 2/33 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (OVERLAPS) 42/75 variables, 33/39 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 40/79 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (OVERLAPS) 0/75 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Int declared 75/75 variables, and 79 constraints, problems are : Problem set: 0 solved, 40 unsolved in 811 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints]
After SMT, in 1660ms problems are : Problem set: 0 solved, 40 unsolved
Search for dead transitions found 0 dead transitions in 1662ms
Starting structural reductions in LTL mode, iteration 1 : 33/37 places, 42/46 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1784 ms. Remains : 33/37 places, 42/46 transitions.
Stuttering acceptance computed with spot in 286 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : UtilityControlRoom-PT-Z2T4N02-LTLFireability-10
Product exploration explored 100000 steps with 6050 reset in 170 ms.
Stack based approach found an accepted trace after 1705 steps with 102 reset with depth 16 and stack size 16 in 7 ms.
FORMULA UtilityControlRoom-PT-Z2T4N02-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z2T4N02-LTLFireability-10 finished in 2268 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 37 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 37/37 places, 46/46 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 33 transition count 42
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 33 transition count 42
Applied a total of 8 rules in 3 ms. Remains 33 /37 variables (removed 4) and now considering 42/46 (removed 4) transitions.
[2024-05-30 21:56:50] [INFO ] Invariant cache hit.
[2024-05-30 21:56:50] [INFO ] Implicit Places using invariants in 72 ms returned [22]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 78 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 32/37 places, 42/46 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 82 ms. Remains : 32/37 places, 42/46 transitions.
Stuttering acceptance computed with spot in 111 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z2T4N02-LTLFireability-11
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-PT-Z2T4N02-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z2T4N02-LTLFireability-11 finished in 212 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U G((p1&&X(p2)))))'
Support contains 4 out of 37 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 37/37 places, 46/46 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 33 transition count 42
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 33 transition count 42
Applied a total of 8 rules in 2 ms. Remains 33 /37 variables (removed 4) and now considering 42/46 (removed 4) transitions.
[2024-05-30 21:56:50] [INFO ] Invariant cache hit.
[2024-05-30 21:56:50] [INFO ] Implicit Places using invariants in 71 ms returned [22]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 72 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 32/37 places, 42/46 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 75 ms. Remains : 32/37 places, 42/46 transitions.
Stuttering acceptance computed with spot in 216 ms :[(OR (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) p1 (NOT p2)), (NOT p2)]
Running random walk in product with property : UtilityControlRoom-PT-Z2T4N02-LTLFireability-12
Product exploration explored 100000 steps with 13278 reset in 160 ms.
Stack based approach found an accepted trace after 22 steps with 1 reset with depth 21 and stack size 21 in 1 ms.
FORMULA UtilityControlRoom-PT-Z2T4N02-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z2T4N02-LTLFireability-12 finished in 479 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 37 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 37/37 places, 46/46 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 37 transition count 40
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 15 place count 31 transition count 37
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 15 place count 31 transition count 34
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 21 place count 28 transition count 34
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 22 place count 27 transition count 33
Iterating global reduction 2 with 1 rules applied. Total rules applied 23 place count 27 transition count 33
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 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 39 place count 19 transition count 25
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 40 place count 19 transition count 24
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 41 place count 18 transition count 20
Ensure Unique test removed 1 places
Iterating global reduction 2 with 2 rules applied. Total rules applied 43 place count 17 transition count 20
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 45 place count 15 transition count 16
Iterating global reduction 2 with 2 rules applied. Total rules applied 47 place count 15 transition count 16
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 48 place count 14 transition count 15
Iterating global reduction 2 with 1 rules applied. Total rules applied 49 place count 14 transition count 15
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 50 place count 14 transition count 14
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 52 place count 13 transition count 13
Applied a total of 52 rules in 21 ms. Remains 13 /37 variables (removed 24) and now considering 13/46 (removed 33) transitions.
// Phase 1: matrix 13 rows 13 cols
[2024-05-30 21:56:50] [INFO ] Computed 5 invariants in 1 ms
[2024-05-30 21:56:50] [INFO ] Implicit Places using invariants in 45 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 47 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 12/37 places, 13/46 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 12 transition count 11
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 5 rules applied. Total rules applied 5 place count 9 transition count 11
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 6 place count 9 transition count 10
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 9 place count 7 transition count 9
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 11 place count 6 transition count 8
Applied a total of 11 rules in 6 ms. Remains 6 /12 variables (removed 6) and now considering 8/13 (removed 5) transitions.
// Phase 1: matrix 8 rows 6 cols
[2024-05-30 21:56:50] [INFO ] Computed 2 invariants in 0 ms
[2024-05-30 21:56:50] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-05-30 21:56:50] [INFO ] Invariant cache hit.
[2024-05-30 21:56:50] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 6/37 places, 8/46 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 137 ms. Remains : 6/37 places, 8/46 transitions.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z2T4N02-LTLFireability-13
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA UtilityControlRoom-PT-Z2T4N02-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z2T4N02-LTLFireability-13 finished in 204 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 37 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 37/37 places, 46/46 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 37 transition count 40
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 15 place count 31 transition count 37
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 15 place count 31 transition count 34
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 21 place count 28 transition count 34
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 22 place count 27 transition count 33
Iterating global reduction 2 with 1 rules applied. Total rules applied 23 place count 27 transition count 33
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 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 39 place count 19 transition count 25
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 40 place count 19 transition count 24
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 41 place count 18 transition count 20
Ensure Unique test removed 1 places
Iterating global reduction 2 with 2 rules applied. Total rules applied 43 place count 17 transition count 20
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 45 place count 15 transition count 16
Iterating global reduction 2 with 2 rules applied. Total rules applied 47 place count 15 transition count 16
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 48 place count 14 transition count 15
Iterating global reduction 2 with 1 rules applied. Total rules applied 49 place count 14 transition count 15
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 50 place count 14 transition count 14
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 52 place count 13 transition count 13
Applied a total of 52 rules in 17 ms. Remains 13 /37 variables (removed 24) and now considering 13/46 (removed 33) transitions.
// Phase 1: matrix 13 rows 13 cols
[2024-05-30 21:56:51] [INFO ] Computed 5 invariants in 1 ms
[2024-05-30 21:56:51] [INFO ] Implicit Places using invariants in 49 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 50 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 12/37 places, 13/46 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 12 transition count 11
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 5 rules applied. Total rules applied 5 place count 9 transition count 11
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 6 place count 9 transition count 10
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 9 place count 7 transition count 9
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 11 place count 6 transition count 8
Applied a total of 11 rules in 5 ms. Remains 6 /12 variables (removed 6) and now considering 8/13 (removed 5) transitions.
// Phase 1: matrix 8 rows 6 cols
[2024-05-30 21:56:51] [INFO ] Computed 2 invariants in 1 ms
[2024-05-30 21:56:51] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-05-30 21:56:51] [INFO ] Invariant cache hit.
[2024-05-30 21:56:51] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 6/37 places, 8/46 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 131 ms. Remains : 6/37 places, 8/46 transitions.
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z2T4N02-LTLFireability-14
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-PT-Z2T4N02-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z2T4N02-LTLFireability-14 finished in 246 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((!p0 U X(X(p1))) U X(G(p2))))'
Support contains 4 out of 37 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 37/37 places, 46/46 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 34 transition count 43
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 34 transition count 43
Applied a total of 6 rules in 2 ms. Remains 34 /37 variables (removed 3) and now considering 43/46 (removed 3) transitions.
// Phase 1: matrix 43 rows 34 cols
[2024-05-30 21:56:51] [INFO ] Computed 6 invariants in 0 ms
[2024-05-30 21:56:51] [INFO ] Implicit Places using invariants in 62 ms returned [23]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 64 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 33/37 places, 43/46 transitions.
Applied a total of 0 rules in 2 ms. Remains 33 /33 variables (removed 0) and now considering 43/43 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 68 ms. Remains : 33/37 places, 43/46 transitions.
Stuttering acceptance computed with spot in 423 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p2) (NOT p1)), true, (NOT p2)]
Running random walk in product with property : UtilityControlRoom-PT-Z2T4N02-LTLFireability-15
Entered a terminal (fully accepting) state of product in 118 steps with 4 reset in 1 ms.
FORMULA UtilityControlRoom-PT-Z2T4N02-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z2T4N02-LTLFireability-15 finished in 525 ms.
All properties solved by simple procedures.
Total runtime 38198 ms.

BK_STOP 1717106211820

--------------------
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
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ 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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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="UtilityControlRoom-PT-Z2T4N02"
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-5568"
echo " Executing tool itstools"
echo " Input is UtilityControlRoom-PT-Z2T4N02, 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 r444-smll-171701110900180"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/UtilityControlRoom-PT-Z2T4N02.tgz
mv UtilityControlRoom-PT-Z2T4N02 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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -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 ;