fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r544-smll-171701111000212
Last Updated
July 7, 2024

About the Execution of LTSMin+red for UtilityControlRoom-PT-Z2T4N10

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
550.527 288991.00 634295.00 1098.80 FFFF?FFFFTFFFTFF normal

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.r544-smll-171701111000212.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 ltsminxred
Input is UtilityControlRoom-PT-Z2T4N10, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r544-smll-171701111000212
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 31K Apr 13 05:43 CTLCardinality.txt
-rw-r--r-- 1 mcc users 164K Apr 13 05:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 47K Apr 13 05:39 CTLFireability.txt
-rw-r--r-- 1 mcc users 216K Apr 13 05:39 CTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 23 08:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 51K Apr 23 08:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 23 08:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 42K Apr 23 08:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 13 05:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 83K Apr 13 05:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 113K Apr 13 05:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 487K Apr 13 05:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.5K Apr 23 08:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.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 116K 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-Z2T4N10-LTLFireability-00
FORMULA_NAME UtilityControlRoom-PT-Z2T4N10-LTLFireability-01
FORMULA_NAME UtilityControlRoom-PT-Z2T4N10-LTLFireability-02
FORMULA_NAME UtilityControlRoom-PT-Z2T4N10-LTLFireability-03
FORMULA_NAME UtilityControlRoom-PT-Z2T4N10-LTLFireability-04
FORMULA_NAME UtilityControlRoom-PT-Z2T4N10-LTLFireability-05
FORMULA_NAME UtilityControlRoom-PT-Z2T4N10-LTLFireability-06
FORMULA_NAME UtilityControlRoom-PT-Z2T4N10-LTLFireability-07
FORMULA_NAME UtilityControlRoom-PT-Z2T4N10-LTLFireability-08
FORMULA_NAME UtilityControlRoom-PT-Z2T4N10-LTLFireability-09
FORMULA_NAME UtilityControlRoom-PT-Z2T4N10-LTLFireability-10
FORMULA_NAME UtilityControlRoom-PT-Z2T4N10-LTLFireability-11
FORMULA_NAME UtilityControlRoom-PT-Z2T4N10-LTLFireability-12
FORMULA_NAME UtilityControlRoom-PT-Z2T4N10-LTLFireability-13
FORMULA_NAME UtilityControlRoom-PT-Z2T4N10-LTLFireability-14
FORMULA_NAME UtilityControlRoom-PT-Z2T4N10-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717274036003

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=UtilityControlRoom-PT-Z2T4N10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 20:33:57] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 20:33:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 20:33:58] [INFO ] Load time of PNML (sax parser for PT used): 118 ms
[2024-06-01 20:33:58] [INFO ] Transformed 174 places.
[2024-06-01 20:33:58] [INFO ] Transformed 270 transitions.
[2024-06-01 20:33:58] [INFO ] Parsed PT model containing 174 places and 270 transitions and 850 arcs in 283 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 21 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
[2024-06-01 20:33:58] [INFO ] Reduced 10 identical enabling conditions.
Ensure Unique test removed 40 transitions
Reduce redundant transitions removed 40 transitions.
FORMULA UtilityControlRoom-PT-Z2T4N10-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-PT-Z2T4N10-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-PT-Z2T4N10-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-PT-Z2T4N10-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 104 out of 174 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 230/230 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 154 transition count 210
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 154 transition count 210
Applied a total of 40 rules in 38 ms. Remains 154 /174 variables (removed 20) and now considering 210/230 (removed 20) transitions.
// Phase 1: matrix 210 rows 154 cols
[2024-06-01 20:33:58] [INFO ] Computed 23 invariants in 29 ms
[2024-06-01 20:33:59] [INFO ] Implicit Places using invariants in 627 ms returned [103]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 676 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 153/174 places, 210/230 transitions.
Applied a total of 0 rules in 5 ms. Remains 153 /153 variables (removed 0) and now considering 210/210 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 757 ms. Remains : 153/174 places, 210/230 transitions.
Support contains 104 out of 153 places after structural reductions.
[2024-06-01 20:33:59] [INFO ] Flatten gal took : 65 ms
[2024-06-01 20:33:59] [INFO ] Flatten gal took : 36 ms
[2024-06-01 20:33:59] [INFO ] Input system was already deterministic with 210 transitions.
Reduction of identical properties reduced properties to check from 20 to 18
RANDOM walk for 40000 steps (8 resets) in 1640 ms. (24 steps per ms) remains 1/18 properties
BEST_FIRST walk for 5124 steps (1 resets) in 17 ms. (284 steps per ms) remains 0/1 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 30 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 210/210 transitions.
Applied a total of 0 rules in 8 ms. Remains 153 /153 variables (removed 0) and now considering 210/210 (removed 0) transitions.
// Phase 1: matrix 210 rows 153 cols
[2024-06-01 20:34:00] [INFO ] Computed 22 invariants in 8 ms
[2024-06-01 20:34:00] [INFO ] Implicit Places using invariants in 159 ms returned []
[2024-06-01 20:34:00] [INFO ] Invariant cache hit.
[2024-06-01 20:34:01] [INFO ] Implicit Places using invariants and state equation in 240 ms returned []
Implicit Place search using SMT with State Equation took 409 ms to find 0 implicit places.
Running 200 sub problems to find dead transitions.
[2024-06-01 20:34:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 10/153 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (OVERLAPS) 210/363 variables, 153/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/363 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (OVERLAPS) 0/363 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Real declared 363/363 variables, and 175 constraints, problems are : Problem set: 0 solved, 200 unsolved in 7531 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 10/153 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (OVERLAPS) 210/363 variables, 153/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/363 variables, 200/375 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/363 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 7 (OVERLAPS) 0/363 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Int declared 363/363 variables, and 375 constraints, problems are : Problem set: 0 solved, 200 unsolved in 9968 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints]
After SMT, in 17813ms problems are : Problem set: 0 solved, 200 unsolved
Search for dead transitions found 0 dead transitions in 17846ms
Finished structural reductions in LTL mode , in 1 iterations and 18269 ms. Remains : 153/153 places, 210/210 transitions.
Stuttering acceptance computed with spot in 258 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z2T4N10-LTLFireability-01
Entered a terminal (fully accepting) state of product in 23 steps with 0 reset in 3 ms.
FORMULA UtilityControlRoom-PT-Z2T4N10-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z2T4N10-LTLFireability-01 finished in 18612 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(X(G(((X(!p1) U ((!p2&&X(!p1))||X(G(!p1))))&&p0))))))'
Support contains 23 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 210/210 transitions.
Applied a total of 0 rules in 7 ms. Remains 153 /153 variables (removed 0) and now considering 210/210 (removed 0) transitions.
[2024-06-01 20:34:19] [INFO ] Invariant cache hit.
[2024-06-01 20:34:19] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-06-01 20:34:19] [INFO ] Invariant cache hit.
[2024-06-01 20:34:19] [INFO ] Implicit Places using invariants and state equation in 190 ms returned []
Implicit Place search using SMT with State Equation took 285 ms to find 0 implicit places.
Running 200 sub problems to find dead transitions.
[2024-06-01 20:34:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 10/153 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (OVERLAPS) 210/363 variables, 153/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/363 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (OVERLAPS) 0/363 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Real declared 363/363 variables, and 175 constraints, problems are : Problem set: 0 solved, 200 unsolved in 7630 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 10/153 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (OVERLAPS) 210/363 variables, 153/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/363 variables, 200/375 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/363 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 7 (OVERLAPS) 0/363 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Int declared 363/363 variables, and 375 constraints, problems are : Problem set: 0 solved, 200 unsolved in 10326 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints]
After SMT, in 18157ms problems are : Problem set: 0 solved, 200 unsolved
Search for dead transitions found 0 dead transitions in 18161ms
Finished structural reductions in LTL mode , in 1 iterations and 18454 ms. Remains : 153/153 places, 210/210 transitions.
Stuttering acceptance computed with spot in 267 ms :[true, (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1)]
Running random walk in product with property : UtilityControlRoom-PT-Z2T4N10-LTLFireability-03
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 1 ms.
FORMULA UtilityControlRoom-PT-Z2T4N10-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z2T4N10-LTLFireability-03 finished in 18745 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))'
Support contains 20 out of 153 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 153/153 places, 210/210 transitions.
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 0 with 80 rules applied. Total rules applied 80 place count 113 transition count 170
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 0 with 20 rules applied. Total rules applied 100 place count 113 transition count 150
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 101 place count 112 transition count 130
Ensure Unique test removed 1 places
Iterating global reduction 0 with 2 rules applied. Total rules applied 103 place count 111 transition count 130
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 113 place count 101 transition count 110
Iterating global reduction 0 with 10 rules applied. Total rules applied 123 place count 101 transition count 110
Applied a total of 123 rules in 67 ms. Remains 101 /153 variables (removed 52) and now considering 110/210 (removed 100) transitions.
// Phase 1: matrix 110 rows 101 cols
[2024-06-01 20:34:38] [INFO ] Computed 21 invariants in 6 ms
[2024-06-01 20:34:38] [INFO ] Implicit Places using invariants in 116 ms returned []
[2024-06-01 20:34:38] [INFO ] Invariant cache hit.
[2024-06-01 20:34:38] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 263 ms to find 0 implicit places.
[2024-06-01 20:34:38] [INFO ] Redundant transitions in 4 ms returned []
Running 90 sub problems to find dead transitions.
[2024-06-01 20:34:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 2 (OVERLAPS) 10/101 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (OVERLAPS) 110/211 variables, 101/122 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/211 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 6 (OVERLAPS) 0/211 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Real declared 211/211 variables, and 122 constraints, problems are : Problem set: 0 solved, 90 unsolved in 2492 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 101/101 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 90 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 2 (OVERLAPS) 10/101 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (OVERLAPS) 110/211 variables, 101/122 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/211 variables, 90/212 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/211 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 7 (OVERLAPS) 0/211 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Int declared 211/211 variables, and 212 constraints, problems are : Problem set: 0 solved, 90 unsolved in 2532 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 101/101 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 0/0 constraints]
After SMT, in 5064ms problems are : Problem set: 0 solved, 90 unsolved
Search for dead transitions found 0 dead transitions in 5067ms
Starting structural reductions in SI_LTL mode, iteration 1 : 101/153 places, 110/210 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5409 ms. Remains : 101/153 places, 110/210 transitions.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z2T4N10-LTLFireability-04
Product exploration explored 100000 steps with 6694 reset in 566 ms.
Product exploration explored 100000 steps with 6718 reset in 458 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), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 87 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
RANDOM walk for 61 steps (0 resets) in 8 ms. (6 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 109 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
[2024-06-01 20:34:44] [INFO ] Invariant cache hit.
[2024-06-01 20:34:44] [INFO ] [Real]Absence check using 21 positive place invariants in 12 ms returned sat
[2024-06-01 20:34:45] [INFO ] [Real]Absence check using state equation in 70 ms returned sat
[2024-06-01 20:34:45] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 20:34:45] [INFO ] [Nat]Absence check using 21 positive place invariants in 13 ms returned sat
[2024-06-01 20:34:45] [INFO ] [Nat]Absence check using state equation in 70 ms returned sat
[2024-06-01 20:34:45] [INFO ] Computed and/alt/rep : 90/150/90 causal constraints (skipped 0 transitions) in 12 ms.
[2024-06-01 20:34:45] [INFO ] Added : 52 causal constraints over 11 iterations in 165 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 20 out of 101 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 101/101 places, 110/110 transitions.
Applied a total of 0 rules in 7 ms. Remains 101 /101 variables (removed 0) and now considering 110/110 (removed 0) transitions.
[2024-06-01 20:34:45] [INFO ] Invariant cache hit.
[2024-06-01 20:34:45] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-06-01 20:34:45] [INFO ] Invariant cache hit.
[2024-06-01 20:34:45] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 226 ms to find 0 implicit places.
[2024-06-01 20:34:45] [INFO ] Redundant transitions in 3 ms returned []
Running 90 sub problems to find dead transitions.
[2024-06-01 20:34:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 2 (OVERLAPS) 10/101 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (OVERLAPS) 110/211 variables, 101/122 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/211 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 6 (OVERLAPS) 0/211 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Real declared 211/211 variables, and 122 constraints, problems are : Problem set: 0 solved, 90 unsolved in 2536 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 101/101 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 90 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 2 (OVERLAPS) 10/101 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (OVERLAPS) 110/211 variables, 101/122 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/211 variables, 90/212 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/211 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 7 (OVERLAPS) 0/211 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Int declared 211/211 variables, and 212 constraints, problems are : Problem set: 0 solved, 90 unsolved in 2513 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 101/101 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 0/0 constraints]
After SMT, in 5085ms problems are : Problem set: 0 solved, 90 unsolved
Search for dead transitions found 0 dead transitions in 5087ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 5330 ms. Remains : 101/101 places, 110/110 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 90 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
RANDOM walk for 59 steps (0 resets) in 4 ms. (11 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 121 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
[2024-06-01 20:34:51] [INFO ] Invariant cache hit.
[2024-06-01 20:34:51] [INFO ] [Real]Absence check using 21 positive place invariants in 10 ms returned sat
[2024-06-01 20:34:51] [INFO ] [Real]Absence check using state equation in 63 ms returned sat
[2024-06-01 20:34:51] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 20:34:51] [INFO ] [Nat]Absence check using 21 positive place invariants in 12 ms returned sat
[2024-06-01 20:34:51] [INFO ] [Nat]Absence check using state equation in 82 ms returned sat
[2024-06-01 20:34:51] [INFO ] Computed and/alt/rep : 90/150/90 causal constraints (skipped 0 transitions) in 12 ms.
[2024-06-01 20:34:51] [INFO ] Added : 52 causal constraints over 11 iterations in 247 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Product exploration explored 100000 steps with 6681 reset in 294 ms.
Product exploration explored 100000 steps with 6718 reset in 316 ms.
Support contains 20 out of 101 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 101/101 places, 110/110 transitions.
Applied a total of 0 rules in 6 ms. Remains 101 /101 variables (removed 0) and now considering 110/110 (removed 0) transitions.
[2024-06-01 20:34:52] [INFO ] Invariant cache hit.
[2024-06-01 20:34:52] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-06-01 20:34:52] [INFO ] Invariant cache hit.
[2024-06-01 20:34:52] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 212 ms to find 0 implicit places.
[2024-06-01 20:34:52] [INFO ] Redundant transitions in 3 ms returned []
Running 90 sub problems to find dead transitions.
[2024-06-01 20:34:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 2 (OVERLAPS) 10/101 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (OVERLAPS) 110/211 variables, 101/122 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/211 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 6 (OVERLAPS) 0/211 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Real declared 211/211 variables, and 122 constraints, problems are : Problem set: 0 solved, 90 unsolved in 2633 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 101/101 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 90 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 2 (OVERLAPS) 10/101 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (OVERLAPS) 110/211 variables, 101/122 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/211 variables, 90/212 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/211 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 7 (OVERLAPS) 0/211 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Int declared 211/211 variables, and 212 constraints, problems are : Problem set: 0 solved, 90 unsolved in 2575 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 101/101 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 0/0 constraints]
After SMT, in 5237ms problems are : Problem set: 0 solved, 90 unsolved
Search for dead transitions found 0 dead transitions in 5240ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 5466 ms. Remains : 101/101 places, 110/110 transitions.
Treatment of property UtilityControlRoom-PT-Z2T4N10-LTLFireability-04 finished in 19938 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)&&X(p1)))'
Support contains 40 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 210/210 transitions.
Applied a total of 0 rules in 3 ms. Remains 153 /153 variables (removed 0) and now considering 210/210 (removed 0) transitions.
// Phase 1: matrix 210 rows 153 cols
[2024-06-01 20:34:57] [INFO ] Computed 22 invariants in 2 ms
[2024-06-01 20:34:58] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-06-01 20:34:58] [INFO ] Invariant cache hit.
[2024-06-01 20:34:58] [INFO ] Implicit Places using invariants and state equation in 182 ms returned []
Implicit Place search using SMT with State Equation took 265 ms to find 0 implicit places.
Running 200 sub problems to find dead transitions.
[2024-06-01 20:34:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 10/153 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (OVERLAPS) 210/363 variables, 153/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/363 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (OVERLAPS) 0/363 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Real declared 363/363 variables, and 175 constraints, problems are : Problem set: 0 solved, 200 unsolved in 7749 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 10/153 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (OVERLAPS) 210/363 variables, 153/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/363 variables, 200/375 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/363 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 7 (OVERLAPS) 0/363 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Int declared 363/363 variables, and 375 constraints, problems are : Problem set: 0 solved, 200 unsolved in 10330 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints]
After SMT, in 18216ms problems are : Problem set: 0 solved, 200 unsolved
Search for dead transitions found 0 dead transitions in 18219ms
Finished structural reductions in LTL mode , in 1 iterations and 18488 ms. Remains : 153/153 places, 210/210 transitions.
Stuttering acceptance computed with spot in 257 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), true]
Running random walk in product with property : UtilityControlRoom-PT-Z2T4N10-LTLFireability-05
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-PT-Z2T4N10-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z2T4N10-LTLFireability-05 finished in 18765 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)||(X(G(!p2))&&p1))))'
Support contains 73 out of 153 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 153/153 places, 210/210 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 20 place count 143 transition count 200
Applied a total of 20 rules in 17 ms. Remains 143 /153 variables (removed 10) and now considering 200/210 (removed 10) transitions.
// Phase 1: matrix 200 rows 143 cols
[2024-06-01 20:35:16] [INFO ] Computed 22 invariants in 2 ms
[2024-06-01 20:35:16] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-06-01 20:35:16] [INFO ] Invariant cache hit.
[2024-06-01 20:35:16] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 193 ms to find 0 implicit places.
[2024-06-01 20:35:16] [INFO ] Redundant transitions in 13 ms returned []
Running 170 sub problems to find dead transitions.
[2024-06-01 20:35:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 2 (OVERLAPS) 10/143 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/143 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 4 (OVERLAPS) 200/343 variables, 143/165 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/343 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 6 (OVERLAPS) 0/343 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 170 unsolved
No progress, stopping.
After SMT solving in domain Real declared 343/343 variables, and 165 constraints, problems are : Problem set: 0 solved, 170 unsolved in 6382 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 143/143 constraints, PredecessorRefiner: 170/170 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 170 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 2 (OVERLAPS) 10/143 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/143 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 4 (OVERLAPS) 200/343 variables, 143/165 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/343 variables, 170/335 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/343 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 7 (OVERLAPS) 0/343 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 170 unsolved
No progress, stopping.
After SMT solving in domain Int declared 343/343 variables, and 335 constraints, problems are : Problem set: 0 solved, 170 unsolved in 8915 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 143/143 constraints, PredecessorRefiner: 170/170 constraints, Known Traps: 0/0 constraints]
After SMT, in 15430ms problems are : Problem set: 0 solved, 170 unsolved
Search for dead transitions found 0 dead transitions in 15434ms
Starting structural reductions in SI_LTL mode, iteration 1 : 143/153 places, 200/210 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 15664 ms. Remains : 143/153 places, 200/210 transitions.
Stuttering acceptance computed with spot in 100 ms :[(OR (AND p0 (NOT p1)) (AND p0 p2)), (AND p0 p2)]
Running random walk in product with property : UtilityControlRoom-PT-Z2T4N10-LTLFireability-06
Product exploration explored 100000 steps with 0 reset in 1292 ms.
Stack based approach found an accepted trace after 13450 steps with 0 reset with depth 13451 and stack size 13451 in 192 ms.
FORMULA UtilityControlRoom-PT-Z2T4N10-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z2T4N10-LTLFireability-06 finished in 17273 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 X(p1))))'
Support contains 20 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 210/210 transitions.
Applied a total of 0 rules in 4 ms. Remains 153 /153 variables (removed 0) and now considering 210/210 (removed 0) transitions.
// Phase 1: matrix 210 rows 153 cols
[2024-06-01 20:35:33] [INFO ] Computed 22 invariants in 2 ms
[2024-06-01 20:35:34] [INFO ] Implicit Places using invariants in 148 ms returned []
[2024-06-01 20:35:34] [INFO ] Invariant cache hit.
[2024-06-01 20:35:34] [INFO ] Implicit Places using invariants and state equation in 243 ms returned []
Implicit Place search using SMT with State Equation took 393 ms to find 0 implicit places.
Running 200 sub problems to find dead transitions.
[2024-06-01 20:35:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 10/153 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (OVERLAPS) 210/363 variables, 153/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/363 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (OVERLAPS) 0/363 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Real declared 363/363 variables, and 175 constraints, problems are : Problem set: 0 solved, 200 unsolved in 8289 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 10/153 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (OVERLAPS) 210/363 variables, 153/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/363 variables, 200/375 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/363 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 7 (OVERLAPS) 0/363 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Int declared 363/363 variables, and 375 constraints, problems are : Problem set: 0 solved, 200 unsolved in 10187 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints]
After SMT, in 18605ms problems are : Problem set: 0 solved, 200 unsolved
Search for dead transitions found 0 dead transitions in 18609ms
Finished structural reductions in LTL mode , in 1 iterations and 19007 ms. Remains : 153/153 places, 210/210 transitions.
Stuttering acceptance computed with spot in 182 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : UtilityControlRoom-PT-Z2T4N10-LTLFireability-07
Entered a terminal (fully accepting) state of product in 1210 steps with 391 reset in 4 ms.
FORMULA UtilityControlRoom-PT-Z2T4N10-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z2T4N10-LTLFireability-07 finished in 19212 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 2 out of 153 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 153/153 places, 210/210 transitions.
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 19 Pre rules applied. Total rules applied 0 place count 153 transition count 191
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 0 with 38 rules applied. Total rules applied 38 place count 134 transition count 191
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 0 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 0 with 120 rules applied. Total rules applied 158 place count 74 transition count 131
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 178 place count 74 transition count 111
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 179 place count 73 transition count 91
Ensure Unique test removed 1 places
Iterating global reduction 1 with 2 rules applied. Total rules applied 181 place count 72 transition count 91
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 190 place count 63 transition count 73
Iterating global reduction 1 with 9 rules applied. Total rules applied 199 place count 63 transition count 73
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 208 place count 54 transition count 64
Iterating global reduction 1 with 9 rules applied. Total rules applied 217 place count 54 transition count 64
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 226 place count 54 transition count 55
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 244 place count 45 transition count 46
Applied a total of 244 rules in 25 ms. Remains 45 /153 variables (removed 108) and now considering 46/210 (removed 164) transitions.
// Phase 1: matrix 46 rows 45 cols
[2024-06-01 20:35:53] [INFO ] Computed 21 invariants in 0 ms
[2024-06-01 20:35:53] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-06-01 20:35:53] [INFO ] Invariant cache hit.
[2024-06-01 20:35:53] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
[2024-06-01 20:35:53] [INFO ] Redundant transitions in 1 ms returned []
Running 26 sub problems to find dead transitions.
[2024-06-01 20:35:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (OVERLAPS) 10/45 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 4 (OVERLAPS) 46/91 variables, 45/66 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 6 (OVERLAPS) 0/91 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Real declared 91/91 variables, and 66 constraints, problems are : Problem set: 0 solved, 26 unsolved in 506 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 45/45 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 26 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (OVERLAPS) 10/45 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 4 (OVERLAPS) 46/91 variables, 45/66 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 26/92 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 7 (OVERLAPS) 0/91 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Int declared 91/91 variables, and 92 constraints, problems are : Problem set: 0 solved, 26 unsolved in 468 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 45/45 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 0/0 constraints]
After SMT, in 986ms problems are : Problem set: 0 solved, 26 unsolved
Search for dead transitions found 0 dead transitions in 987ms
Starting structural reductions in SI_LTL mode, iteration 1 : 45/153 places, 46/210 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1179 ms. Remains : 45/153 places, 46/210 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z2T4N10-LTLFireability-08
Product exploration explored 100000 steps with 0 reset in 291 ms.
Stack based approach found an accepted trace after 172 steps with 0 reset with depth 173 and stack size 169 in 5 ms.
FORMULA UtilityControlRoom-PT-Z2T4N10-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z2T4N10-LTLFireability-08 finished in 1531 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&&F(G(p1)))) U G((p2||F(!p0)))))'
Support contains 5 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 210/210 transitions.
Applied a total of 0 rules in 3 ms. Remains 153 /153 variables (removed 0) and now considering 210/210 (removed 0) transitions.
// Phase 1: matrix 210 rows 153 cols
[2024-06-01 20:35:54] [INFO ] Computed 22 invariants in 2 ms
[2024-06-01 20:35:54] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-06-01 20:35:54] [INFO ] Invariant cache hit.
[2024-06-01 20:35:55] [INFO ] Implicit Places using invariants and state equation in 186 ms returned []
Implicit Place search using SMT with State Equation took 297 ms to find 0 implicit places.
Running 200 sub problems to find dead transitions.
[2024-06-01 20:35:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 10/153 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (OVERLAPS) 210/363 variables, 153/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/363 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (OVERLAPS) 0/363 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Real declared 363/363 variables, and 175 constraints, problems are : Problem set: 0 solved, 200 unsolved in 8280 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 10/153 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (OVERLAPS) 210/363 variables, 153/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/363 variables, 200/375 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/363 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 7 (OVERLAPS) 0/363 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Int declared 363/363 variables, and 375 constraints, problems are : Problem set: 0 solved, 200 unsolved in 10360 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints]
After SMT, in 18772ms problems are : Problem set: 0 solved, 200 unsolved
Search for dead transitions found 0 dead transitions in 18776ms
Finished structural reductions in LTL mode , in 1 iterations and 19076 ms. Remains : 153/153 places, 210/210 transitions.
Stuttering acceptance computed with spot in 335 ms :[(AND p0 (NOT p2)), false, (AND p0 (NOT p1)), (AND p0 (NOT p2)), (AND p0 (NOT p2)), p0]
Running random walk in product with property : UtilityControlRoom-PT-Z2T4N10-LTLFireability-10
Product exploration explored 100000 steps with 9708 reset in 266 ms.
Product exploration explored 100000 steps with 9515 reset in 302 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (NOT (AND (NOT p2) p0 p1))), (X (NOT (AND p0 p1))), (X (NOT p1))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (NOT p0)), (X p0), (X (AND p2 p0)), (X (NOT (AND p2 p0))), (X (AND (NOT p2) p0)), (X (NOT (AND (NOT p2) p0))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X p2)), (X (X (NOT p2))), (X (X (AND p2 p0))), (X (X (NOT (AND p2 p0)))), (X (X (AND (NOT p2) p0 p1))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 887 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter sensitive) to 5 states, 12 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 219 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p1)), (AND p0 (NOT p2)), (AND p0 (NOT p2)), p0]
RANDOM walk for 965 steps (0 resets) in 36 ms. (26 steps per ms) remains 0/8 properties
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (NOT (AND (NOT p2) p0 p1))), (X (NOT (AND p0 p1))), (X (NOT p1))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (NOT p0)), (X p0), (X (AND p2 p0)), (X (NOT (AND p2 p0))), (X (AND (NOT p2) p0)), (X (NOT (AND (NOT p2) p0))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X p2)), (X (X (NOT p2))), (X (X (AND p2 p0))), (X (X (NOT (AND p2 p0)))), (X (X (AND (NOT p2) p0 p1))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (AND p0 (NOT p2)))), (F (NOT p0)), (F (NOT (AND p0 (NOT p1)))), (F p2), (F (NOT (OR (NOT p0) (NOT p1) p2))), (F (NOT (OR (NOT p0) (NOT p2)))), (F p1)]
Knowledge based reduction with 4 factoid took 1111 ms. Reduced automaton from 5 states, 12 edges and 3 AP (stutter insensitive) to 5 states, 12 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 220 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p1)), (AND p0 (NOT p2)), (AND p0 (NOT p2)), p0]
Stuttering acceptance computed with spot in 204 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p1)), (AND p0 (NOT p2)), (AND p0 (NOT p2)), p0]
[2024-06-01 20:36:17] [INFO ] Invariant cache hit.
[2024-06-01 20:36:17] [INFO ] [Real]Absence check using 22 positive place invariants in 11 ms returned unsat
Proved EG (AND p0 (NOT p2))
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (NOT (AND (NOT p2) p0 p1))), (X (NOT (AND p0 p1))), (X (NOT p1))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (NOT p0)), (X p0), (X (AND p2 p0)), (X (NOT (AND p2 p0))), (X (AND (NOT p2) p0)), (X (NOT (AND (NOT p2) p0))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X p2)), (X (X (NOT p2))), (X (X (AND p2 p0))), (X (X (NOT (AND p2 p0)))), (X (X (AND (NOT p2) p0 p1))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (AND p0 (NOT p2)))), (F (NOT p0)), (F (NOT (AND p0 (NOT p1)))), (F p2), (F (NOT (OR (NOT p0) (NOT p1) p2))), (F (NOT (OR (NOT p0) (NOT p2)))), (F p1), (G (AND p0 (NOT p2)))]
Property proved to be false thanks to negative knowledge :(G (AND p0 (NOT p2)))
Knowledge based reduction with 4 factoid took 1113 ms. Reduced automaton from 5 states, 12 edges and 3 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA UtilityControlRoom-PT-Z2T4N10-LTLFireability-10 FALSE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-PT-Z2T4N10-LTLFireability-10 finished in 23983 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||G(p1)))))'
Support contains 2 out of 153 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 153/153 places, 210/210 transitions.
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 20 Pre rules applied. Total rules applied 0 place count 153 transition count 190
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 40 rules applied. Total rules applied 40 place count 133 transition count 190
Performed 57 Post agglomeration using F-continuation condition.Transition count delta: 57
Deduced a syphon composed of 57 places in 0 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 0 with 114 rules applied. Total rules applied 154 place count 76 transition count 133
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 174 place count 76 transition count 113
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 175 place count 75 transition count 93
Iterating global reduction 1 with 1 rules applied. Total rules applied 176 place count 75 transition count 93
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 186 place count 65 transition count 74
Iterating global reduction 1 with 10 rules applied. Total rules applied 196 place count 65 transition count 74
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 206 place count 55 transition count 63
Iterating global reduction 1 with 10 rules applied. Total rules applied 216 place count 55 transition count 63
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 225 place count 55 transition count 54
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 226 place count 54 transition count 53
Iterating global reduction 2 with 1 rules applied. Total rules applied 227 place count 54 transition count 53
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 228 place count 54 transition count 52
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 246 place count 45 transition count 43
Applied a total of 246 rules in 32 ms. Remains 45 /153 variables (removed 108) and now considering 43/210 (removed 167) transitions.
// Phase 1: matrix 43 rows 45 cols
[2024-06-01 20:36:18] [INFO ] Computed 22 invariants in 0 ms
[2024-06-01 20:36:18] [INFO ] Implicit Places using invariants in 59 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 SI_LTL mode, iteration 1 : 44/153 places, 43/210 transitions.
Applied a total of 0 rules in 2 ms. Remains 44 /44 variables (removed 0) and now considering 43/43 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 97 ms. Remains : 44/153 places, 43/210 transitions.
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : UtilityControlRoom-PT-Z2T4N10-LTLFireability-11
Product exploration explored 100000 steps with 457 reset in 212 ms.
Stack based approach found an accepted trace after 3984 steps with 17 reset with depth 217 and stack size 211 in 12 ms.
FORMULA UtilityControlRoom-PT-Z2T4N10-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z2T4N10-LTLFireability-11 finished in 418 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 2 out of 153 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 153/153 places, 210/210 transitions.
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 19 Pre rules applied. Total rules applied 0 place count 153 transition count 191
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 0 with 38 rules applied. Total rules applied 38 place count 134 transition count 191
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: 58
Deduced a syphon composed of 58 places in 0 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 0 with 116 rules applied. Total rules applied 154 place count 76 transition count 133
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 0 with 19 rules applied. Total rules applied 173 place count 76 transition count 114
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 174 place count 76 transition count 113
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 175 place count 75 transition count 93
Ensure Unique test removed 1 places
Iterating global reduction 1 with 2 rules applied. Total rules applied 177 place count 74 transition count 93
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 187 place count 64 transition count 73
Iterating global reduction 1 with 10 rules applied. Total rules applied 197 place count 64 transition count 73
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 206 place count 55 transition count 64
Iterating global reduction 1 with 9 rules applied. Total rules applied 215 place count 55 transition count 64
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 224 place count 55 transition count 55
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 240 place count 47 transition count 47
Applied a total of 240 rules in 30 ms. Remains 47 /153 variables (removed 106) and now considering 47/210 (removed 163) transitions.
// Phase 1: matrix 47 rows 47 cols
[2024-06-01 20:36:19] [INFO ] Computed 21 invariants in 0 ms
[2024-06-01 20:36:19] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-06-01 20:36:19] [INFO ] Invariant cache hit.
[2024-06-01 20:36:19] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 153 ms to find 0 implicit places.
[2024-06-01 20:36:19] [INFO ] Redundant transitions in 0 ms returned []
Running 28 sub problems to find dead transitions.
[2024-06-01 20:36:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (OVERLAPS) 10/47 variables, 12/21 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (OVERLAPS) 47/94 variables, 47/68 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/94 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (OVERLAPS) 0/94 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Real declared 94/94 variables, and 68 constraints, problems are : Problem set: 0 solved, 28 unsolved in 591 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 47/47 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 28 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (OVERLAPS) 10/47 variables, 12/21 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (OVERLAPS) 47/94 variables, 47/68 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/94 variables, 28/96 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/94 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (OVERLAPS) 0/94 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Int declared 94/94 variables, and 96 constraints, problems are : Problem set: 0 solved, 28 unsolved in 501 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 47/47 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints]
After SMT, in 1106ms problems are : Problem set: 0 solved, 28 unsolved
Search for dead transitions found 0 dead transitions in 1108ms
Starting structural reductions in SI_LTL mode, iteration 1 : 47/153 places, 47/210 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1299 ms. Remains : 47/153 places, 47/210 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z2T4N10-LTLFireability-12
Product exploration explored 100000 steps with 230 reset in 211 ms.
Stack based approach found an accepted trace after 11251 steps with 30 reset with depth 619 and stack size 571 in 26 ms.
FORMULA UtilityControlRoom-PT-Z2T4N10-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z2T4N10-LTLFireability-12 finished in 1715 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 3 out of 153 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 153/153 places, 210/210 transitions.
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 20 Pre rules applied. Total rules applied 0 place count 153 transition count 190
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 40 rules applied. Total rules applied 40 place count 133 transition count 190
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 0 with 78 rules applied. Total rules applied 118 place count 94 transition count 151
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 138 place count 94 transition count 131
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 1 with 2 rules applied. Total rules applied 140 place count 93 transition count 130
Applied a total of 140 rules in 18 ms. Remains 93 /153 variables (removed 60) and now considering 130/210 (removed 80) transitions.
// Phase 1: matrix 130 rows 93 cols
[2024-06-01 20:36:20] [INFO ] Computed 22 invariants in 1 ms
[2024-06-01 20:36:20] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-06-01 20:36:20] [INFO ] Invariant cache hit.
[2024-06-01 20:36:21] [INFO ] Implicit Places using invariants and state equation in 184 ms returned []
Implicit Place search using SMT with State Equation took 287 ms to find 0 implicit places.
[2024-06-01 20:36:21] [INFO ] Redundant transitions in 1 ms returned []
Running 109 sub problems to find dead transitions.
[2024-06-01 20:36:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (OVERLAPS) 10/93 variables, 19/22 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (OVERLAPS) 130/223 variables, 93/115 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/223 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (OVERLAPS) 0/223 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Real declared 223/223 variables, and 115 constraints, problems are : Problem set: 0 solved, 109 unsolved in 3124 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 109 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (OVERLAPS) 10/93 variables, 19/22 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (OVERLAPS) 130/223 variables, 93/115 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/223 variables, 109/224 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/223 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (OVERLAPS) 0/223 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Int declared 223/223 variables, and 224 constraints, problems are : Problem set: 0 solved, 109 unsolved in 3734 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 0/0 constraints]
After SMT, in 6934ms problems are : Problem set: 0 solved, 109 unsolved
Search for dead transitions found 0 dead transitions in 6936ms
Starting structural reductions in SI_LTL mode, iteration 1 : 93/153 places, 130/210 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7252 ms. Remains : 93/153 places, 130/210 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z2T4N10-LTLFireability-14
Product exploration explored 100000 steps with 891 reset in 253 ms.
Product exploration explored 100000 steps with 1031 reset in 271 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 179 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 439 steps (0 resets) in 7 ms. (54 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 194 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Support contains 3 out of 93 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 93/93 places, 130/130 transitions.
Applied a total of 0 rules in 5 ms. Remains 93 /93 variables (removed 0) and now considering 130/130 (removed 0) transitions.
[2024-06-01 20:36:29] [INFO ] Invariant cache hit.
[2024-06-01 20:36:29] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-06-01 20:36:29] [INFO ] Invariant cache hit.
[2024-06-01 20:36:29] [INFO ] Implicit Places using invariants and state equation in 156 ms returned []
Implicit Place search using SMT with State Equation took 253 ms to find 0 implicit places.
[2024-06-01 20:36:29] [INFO ] Redundant transitions in 2 ms returned []
Running 109 sub problems to find dead transitions.
[2024-06-01 20:36:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (OVERLAPS) 10/93 variables, 19/22 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (OVERLAPS) 130/223 variables, 93/115 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/223 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (OVERLAPS) 0/223 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Real declared 223/223 variables, and 115 constraints, problems are : Problem set: 0 solved, 109 unsolved in 3064 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 109 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (OVERLAPS) 10/93 variables, 19/22 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (OVERLAPS) 130/223 variables, 93/115 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/223 variables, 109/224 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/223 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (OVERLAPS) 0/223 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Int declared 223/223 variables, and 224 constraints, problems are : Problem set: 0 solved, 109 unsolved in 3629 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 0/0 constraints]
After SMT, in 6767ms problems are : Problem set: 0 solved, 109 unsolved
Search for dead transitions found 0 dead transitions in 6770ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 7035 ms. Remains : 93/93 places, 130/130 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 : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 190 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 539 steps (0 resets) in 7 ms. (67 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 223 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 943 reset in 247 ms.
Product exploration explored 100000 steps with 1033 reset in 274 ms.
Support contains 3 out of 93 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 93/93 places, 130/130 transitions.
Applied a total of 0 rules in 4 ms. Remains 93 /93 variables (removed 0) and now considering 130/130 (removed 0) transitions.
[2024-06-01 20:36:37] [INFO ] Invariant cache hit.
[2024-06-01 20:36:37] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-06-01 20:36:37] [INFO ] Invariant cache hit.
[2024-06-01 20:36:37] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 218 ms to find 0 implicit places.
[2024-06-01 20:36:37] [INFO ] Redundant transitions in 1 ms returned []
Running 109 sub problems to find dead transitions.
[2024-06-01 20:36:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (OVERLAPS) 10/93 variables, 19/22 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (OVERLAPS) 130/223 variables, 93/115 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/223 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (OVERLAPS) 0/223 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Real declared 223/223 variables, and 115 constraints, problems are : Problem set: 0 solved, 109 unsolved in 3093 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 109 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (OVERLAPS) 10/93 variables, 19/22 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (OVERLAPS) 130/223 variables, 93/115 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/223 variables, 109/224 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/223 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (OVERLAPS) 0/223 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Int declared 223/223 variables, and 224 constraints, problems are : Problem set: 0 solved, 109 unsolved in 3483 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 0/0 constraints]
After SMT, in 6642ms problems are : Problem set: 0 solved, 109 unsolved
Search for dead transitions found 0 dead transitions in 6644ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 6874 ms. Remains : 93/93 places, 130/130 transitions.
Treatment of property UtilityControlRoom-PT-Z2T4N10-LTLFireability-14 finished in 23736 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(p0) U (p0&&X(p1))))'
Support contains 6 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 210/210 transitions.
Applied a total of 0 rules in 2 ms. Remains 153 /153 variables (removed 0) and now considering 210/210 (removed 0) transitions.
// Phase 1: matrix 210 rows 153 cols
[2024-06-01 20:36:44] [INFO ] Computed 22 invariants in 3 ms
[2024-06-01 20:36:44] [INFO ] Implicit Places using invariants in 116 ms returned []
[2024-06-01 20:36:44] [INFO ] Invariant cache hit.
[2024-06-01 20:36:44] [INFO ] Implicit Places using invariants and state equation in 222 ms returned []
Implicit Place search using SMT with State Equation took 340 ms to find 0 implicit places.
Running 200 sub problems to find dead transitions.
[2024-06-01 20:36:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 10/153 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (OVERLAPS) 210/363 variables, 153/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/363 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (OVERLAPS) 0/363 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Real declared 363/363 variables, and 175 constraints, problems are : Problem set: 0 solved, 200 unsolved in 7746 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 10/153 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (OVERLAPS) 210/363 variables, 153/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/363 variables, 200/375 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/363 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 7 (OVERLAPS) 0/363 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Int declared 363/363 variables, and 375 constraints, problems are : Problem set: 0 solved, 200 unsolved in 10135 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints]
After SMT, in 18008ms problems are : Problem set: 0 solved, 200 unsolved
Search for dead transitions found 0 dead transitions in 18013ms
Finished structural reductions in LTL mode , in 1 iterations and 18356 ms. Remains : 153/153 places, 210/210 transitions.
Stuttering acceptance computed with spot in 141 ms :[(OR (NOT p0) (NOT p1)), true, (NOT p1), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z2T4N10-LTLFireability-15
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-PT-Z2T4N10-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z2T4N10-LTLFireability-15 finished in 18519 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))'
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)))'
[2024-06-01 20:37:03] [INFO ] Flatten gal took : 21 ms
[2024-06-01 20:37:03] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2024-06-01 20:37:03] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 153 places, 210 transitions and 620 arcs took 9 ms.
Total runtime 185770 ms.
There are residual formulas that ITS could not solve within timeout
Could not compute solution for formula : UtilityControlRoom-PT-Z2T4N10-LTLFireability-04
FORMULA UtilityControlRoom-PT-Z2T4N10-LTLFireability-14 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717274324994

--------------------
content from stderr:

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2024
ltl formula name UtilityControlRoom-PT-Z2T4N10-LTLFireability-04
ltl formula formula --ltl=/tmp/1412/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 153 places, 210 transitions and 620 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.020 real 0.010 user 0.010 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1412/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1412/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1412/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1412/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 1 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 155 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 154, there are 211 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): ~34 levels ~10000 states ~20508 transitions
pnml2lts-mc( 0/ 4): ~34 levels ~20000 states ~42632 transitions
pnml2lts-mc( 0/ 4): ~34 levels ~40000 states ~91612 transitions
pnml2lts-mc( 0/ 4): ~34 levels ~80000 states ~191192 transitions
pnml2lts-mc( 0/ 4): ~34 levels ~160000 states ~409672 transitions
pnml2lts-mc( 1/ 4): ~34 levels ~320000 states ~839916 transitions
pnml2lts-mc( 1/ 4): ~34 levels ~640000 states ~1829628 transitions
pnml2lts-mc( 1/ 4): ~34 levels ~1280000 states ~3860328 transitions
pnml2lts-mc( 1/ 4): ~34 levels ~2560000 states ~8044620 transitions
pnml2lts-mc( 1/ 4): ~34 levels ~5120000 states ~16336192 transitions
pnml2lts-mc( 1/ 4): ~34 levels ~10240000 states ~34547472 transitions
pnml2lts-mc( 0/ 4): ~34 levels ~20480000 states ~71339492 transitions
pnml2lts-mc( 1/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 21635274
pnml2lts-mc( 0/ 4): unique states count: 21635365
pnml2lts-mc( 0/ 4): unique transitions count: 77212554
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 55576301
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 21635370
pnml2lts-mc( 0/ 4): - cum. max stack depth: 136
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 21635370 states 77212611 transitions, fanout: 3.569
pnml2lts-mc( 0/ 4): Total exploration time 100.550 sec (100.530 sec minimum, 100.535 sec on average)
pnml2lts-mc( 0/ 4): States per second: 215170, Transitions per second: 767903
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 229.1MB, 11.1 B/state, compr.: 1.8%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 64.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 210 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 229.1MB (~256.0MB paged-in)
ltl formula name UtilityControlRoom-PT-Z2T4N10-LTLFireability-14
ltl formula formula --ltl=/tmp/1412/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 153 places, 210 transitions and 620 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.020 real 0.010 user 0.000 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1412/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1412/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1412/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1412/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 155 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 154, there are 213 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 1/ 4): Accepting cycle FOUND at depth ~41!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 72
pnml2lts-mc( 0/ 4): unique states count: 327
pnml2lts-mc( 0/ 4): unique transitions count: 3152
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 29
pnml2lts-mc( 0/ 4): - claim success count: 331
pnml2lts-mc( 0/ 4): - cum. max stack depth: 259
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 331 states 3198 transitions, fanout: 9.662
pnml2lts-mc( 0/ 4): Total exploration time 0.020 sec (0.020 sec minimum, 0.020 sec on average)
pnml2lts-mc( 0/ 4): States per second: 16550, Transitions per second: 159900
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.1MB, 27.6 B/state, compr.: 4.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 210 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.1MB (~256.0MB paged-in)

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-Z2T4N10"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is UtilityControlRoom-PT-Z2T4N10, 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 r544-smll-171701111000212"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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