Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r444-smll-171701111100252.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is UtilityControlRoom-PT-Z4T4N04, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r444-smll-171701111100252
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.7M
-rw-r--r-- 1 mcc users 27K Apr 13 05:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 153K Apr 13 05:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 52K Apr 13 05:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 220K Apr 13 05:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 23 08:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 55K Apr 23 08:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 13K Apr 23 08:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 46K Apr 23 08:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 59K Apr 13 05:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 321K Apr 13 05:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 103K Apr 13 05:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 406K Apr 13 05:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 23 08:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 8.3K 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 128K 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-Z4T4N04-LTLFireability-00
FORMULA_NAME UtilityControlRoom-PT-Z4T4N04-LTLFireability-01
FORMULA_NAME UtilityControlRoom-PT-Z4T4N04-LTLFireability-02
FORMULA_NAME UtilityControlRoom-PT-Z4T4N04-LTLFireability-03
FORMULA_NAME UtilityControlRoom-PT-Z4T4N04-LTLFireability-04
FORMULA_NAME UtilityControlRoom-PT-Z4T4N04-LTLFireability-05
FORMULA_NAME UtilityControlRoom-PT-Z4T4N04-LTLFireability-06
FORMULA_NAME UtilityControlRoom-PT-Z4T4N04-LTLFireability-07
FORMULA_NAME UtilityControlRoom-PT-Z4T4N04-LTLFireability-08
FORMULA_NAME UtilityControlRoom-PT-Z4T4N04-LTLFireability-09
FORMULA_NAME UtilityControlRoom-PT-Z4T4N04-LTLFireability-10
FORMULA_NAME UtilityControlRoom-PT-Z4T4N04-LTLFireability-11
FORMULA_NAME UtilityControlRoom-PT-Z4T4N04-LTLFireability-12
FORMULA_NAME UtilityControlRoom-PT-Z4T4N04-LTLFireability-13
FORMULA_NAME UtilityControlRoom-PT-Z4T4N04-LTLFireability-14
FORMULA_NAME UtilityControlRoom-PT-Z4T4N04-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717123551658

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=UtilityControlRoom-PT-Z4T4N04
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-31 02:45:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-31 02:45:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 02:45:54] [INFO ] Load time of PNML (sax parser for PT used): 174 ms
[2024-05-31 02:45:54] [INFO ] Transformed 154 places.
[2024-05-31 02:45:54] [INFO ] Transformed 300 transitions.
[2024-05-31 02:45:54] [INFO ] Parsed PT model containing 154 places and 300 transitions and 964 arcs in 471 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 33 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
[2024-05-31 02:45:54] [INFO ] Reduced 12 identical enabling conditions.
[2024-05-31 02:45:54] [INFO ] Reduced 12 identical enabling conditions.
[2024-05-31 02:45:54] [INFO ] Reduced 12 identical enabling conditions.
Ensure Unique test removed 64 transitions
Reduce redundant transitions removed 64 transitions.
FORMULA UtilityControlRoom-PT-Z4T4N04-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-PT-Z4T4N04-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-PT-Z4T4N04-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 123 out of 154 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 154/154 places, 236/236 transitions.
Applied a total of 0 rules in 39 ms. Remains 154 /154 variables (removed 0) and now considering 236/236 (removed 0) transitions.
// Phase 1: matrix 236 rows 154 cols
[2024-05-31 02:45:55] [INFO ] Computed 11 invariants in 33 ms
[2024-05-31 02:45:55] [INFO ] Implicit Places using invariants in 490 ms returned [125]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 566 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 153/154 places, 236/236 transitions.
Applied a total of 0 rules in 7 ms. Remains 153 /153 variables (removed 0) and now considering 236/236 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 652 ms. Remains : 153/154 places, 236/236 transitions.
Support contains 123 out of 153 places after structural reductions.
[2024-05-31 02:45:56] [INFO ] Flatten gal took : 101 ms
[2024-05-31 02:45:56] [INFO ] Flatten gal took : 52 ms
[2024-05-31 02:45:56] [INFO ] Input system was already deterministic with 236 transitions.
Reduction of identical properties reduced properties to check from 27 to 26
RANDOM walk for 7114 steps (0 resets) in 572 ms. (12 steps per ms) remains 0/26 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(F(p0)))'
Support contains 68 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 236/236 transitions.
Applied a total of 0 rules in 6 ms. Remains 153 /153 variables (removed 0) and now considering 236/236 (removed 0) transitions.
// Phase 1: matrix 236 rows 153 cols
[2024-05-31 02:45:57] [INFO ] Computed 10 invariants in 13 ms
[2024-05-31 02:45:57] [INFO ] Implicit Places using invariants in 308 ms returned [124]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 312 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 152/153 places, 236/236 transitions.
Applied a total of 0 rules in 8 ms. Remains 152 /152 variables (removed 0) and now considering 236/236 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 326 ms. Remains : 152/153 places, 236/236 transitions.
Stuttering acceptance computed with spot in 308 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N04-LTLFireability-00
Product exploration explored 100000 steps with 14913 reset in 832 ms.
Product exploration explored 100000 steps with 14894 reset in 484 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 sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 111 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 36 steps (0 resets) in 4 ms. (7 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 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 80 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
// Phase 1: matrix 236 rows 152 cols
[2024-05-31 02:46:00] [INFO ] Computed 9 invariants in 3 ms
[2024-05-31 02:46:00] [INFO ] [Real]Absence check using 9 positive place invariants in 9 ms returned sat
[2024-05-31 02:46:00] [INFO ] [Real]Absence check using state equation in 133 ms returned sat
[2024-05-31 02:46:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 02:46:00] [INFO ] [Nat]Absence check using 9 positive place invariants in 10 ms returned sat
[2024-05-31 02:46:00] [INFO ] [Nat]Absence check using state equation in 184 ms returned sat
[2024-05-31 02:46:01] [INFO ] Computed and/alt/rep : 232/356/232 causal constraints (skipped 0 transitions) in 43 ms.
[2024-05-31 02:46:02] [INFO ] Added : 232 causal constraints over 47 iterations in 1203 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 68 out of 152 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 152/152 places, 236/236 transitions.
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 16 Pre rules applied. Total rules applied 0 place count 152 transition count 220
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 0 with 32 rules applied. Total rules applied 32 place count 136 transition count 220
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 40 place count 132 transition count 216
Applied a total of 40 rules in 54 ms. Remains 132 /152 variables (removed 20) and now considering 216/236 (removed 20) transitions.
// Phase 1: matrix 216 rows 132 cols
[2024-05-31 02:46:02] [INFO ] Computed 9 invariants in 1 ms
[2024-05-31 02:46:02] [INFO ] Implicit Places using invariants in 107 ms returned []
[2024-05-31 02:46:02] [INFO ] Invariant cache hit.
[2024-05-31 02:46:02] [INFO ] Implicit Places using invariants and state equation in 258 ms returned []
Implicit Place search using SMT with State Equation took 367 ms to find 0 implicit places.
[2024-05-31 02:46:02] [INFO ] Redundant transitions in 11 ms returned []
Running 200 sub problems to find dead transitions.
[2024-05-31 02:46:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/128 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 4/132 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (OVERLAPS) 216/348 variables, 132/141 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/348 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (OVERLAPS) 0/348 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Real declared 348/348 variables, and 141 constraints, problems are : Problem set: 0 solved, 200 unsolved in 8523 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 132/132 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/128 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/128 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 4/132 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (OVERLAPS) 216/348 variables, 132/141 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/348 variables, 200/341 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/348 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 7 (OVERLAPS) 0/348 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Int declared 348/348 variables, and 341 constraints, problems are : Problem set: 0 solved, 200 unsolved in 9443 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 132/132 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints]
After SMT, in 18147ms problems are : Problem set: 0 solved, 200 unsolved
Search for dead transitions found 0 dead transitions in 18161ms
Starting structural reductions in SI_LTL mode, iteration 1 : 132/152 places, 216/236 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 18604 ms. Remains : 132/152 places, 216/236 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))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 129 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 22 steps (0 resets) in 4 ms. (4 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 174 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 86 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0)]
[2024-05-31 02:46:21] [INFO ] Invariant cache hit.
[2024-05-31 02:46:21] [INFO ] [Real]Absence check using 9 positive place invariants in 9 ms returned sat
[2024-05-31 02:46:21] [INFO ] [Real]Absence check using state equation in 137 ms returned sat
[2024-05-31 02:46:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 02:46:22] [INFO ] [Nat]Absence check using 9 positive place invariants in 8 ms returned sat
[2024-05-31 02:46:22] [INFO ] [Nat]Absence check using state equation in 149 ms returned sat
[2024-05-31 02:46:22] [INFO ] Computed and/alt/rep : 200/448/200 causal constraints (skipped 0 transitions) in 25 ms.
[2024-05-31 02:46:22] [INFO ] Added : 111 causal constraints over 23 iterations in 610 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 20518 reset in 675 ms.
Product exploration explored 100000 steps with 20456 reset in 519 ms.
Built C files in :
/tmp/ltsmin17329550551348102668
[2024-05-31 02:46:24] [INFO ] Computing symmetric may disable matrix : 216 transitions.
[2024-05-31 02:46:24] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 02:46:24] [INFO ] Computing symmetric may enable matrix : 216 transitions.
[2024-05-31 02:46:24] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 02:46:24] [INFO ] Computing Do-Not-Accords matrix : 216 transitions.
[2024-05-31 02:46:24] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 02:46:24] [INFO ] Built C files in 88ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17329550551348102668
Running compilation step : cd /tmp/ltsmin17329550551348102668;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1571 ms.
Running link step : cd /tmp/ltsmin17329550551348102668;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 74 ms.
Running LTSmin : cd /tmp/ltsmin17329550551348102668;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased9736278404995299252.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 68 out of 132 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 132/132 places, 216/216 transitions.
Applied a total of 0 rules in 8 ms. Remains 132 /132 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2024-05-31 02:46:39] [INFO ] Invariant cache hit.
[2024-05-31 02:46:39] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-05-31 02:46:39] [INFO ] Invariant cache hit.
[2024-05-31 02:46:39] [INFO ] Implicit Places using invariants and state equation in 172 ms returned []
Implicit Place search using SMT with State Equation took 262 ms to find 0 implicit places.
[2024-05-31 02:46:39] [INFO ] Redundant transitions in 17 ms returned []
Running 200 sub problems to find dead transitions.
[2024-05-31 02:46:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/128 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 4/132 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (OVERLAPS) 216/348 variables, 132/141 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/348 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (OVERLAPS) 0/348 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Real declared 348/348 variables, and 141 constraints, problems are : Problem set: 0 solved, 200 unsolved in 8102 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 132/132 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/128 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/128 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 4/132 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (OVERLAPS) 216/348 variables, 132/141 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/348 variables, 200/341 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/348 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 7 (OVERLAPS) 0/348 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Int declared 348/348 variables, and 341 constraints, problems are : Problem set: 0 solved, 200 unsolved in 8828 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 132/132 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints]
After SMT, in 17010ms problems are : Problem set: 0 solved, 200 unsolved
Search for dead transitions found 0 dead transitions in 17017ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 17311 ms. Remains : 132/132 places, 216/216 transitions.
Built C files in :
/tmp/ltsmin10747909389024616069
[2024-05-31 02:46:56] [INFO ] Computing symmetric may disable matrix : 216 transitions.
[2024-05-31 02:46:56] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 02:46:56] [INFO ] Computing symmetric may enable matrix : 216 transitions.
[2024-05-31 02:46:56] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 02:46:56] [INFO ] Computing Do-Not-Accords matrix : 216 transitions.
[2024-05-31 02:46:56] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 02:46:56] [INFO ] Built C files in 47ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10747909389024616069
Running compilation step : cd /tmp/ltsmin10747909389024616069;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 792 ms.
Running link step : cd /tmp/ltsmin10747909389024616069;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin10747909389024616069;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10657527063738141256.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-31 02:47:11] [INFO ] Flatten gal took : 18 ms
[2024-05-31 02:47:11] [INFO ] Flatten gal took : 15 ms
[2024-05-31 02:47:11] [INFO ] Time to serialize gal into /tmp/LTL2683997524773385810.gal : 7 ms
[2024-05-31 02:47:11] [INFO ] Time to serialize properties into /tmp/LTL6767893938457159330.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2683997524773385810.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1693698345888832692.hoa' '-atoms' '/tmp/LTL6767893938457159330.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL6767893938457159330.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1693698345888832692.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
257 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,2.62884,65932,1,0,71,262134,23,13,3607,206485,151
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA UtilityControlRoom-PT-Z4T4N04-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property UtilityControlRoom-PT-Z4T4N04-LTLFireability-00 finished in 77455 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||G(p1))))'
Support contains 24 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 236/236 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 105 transition count 188
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 105 transition count 188
Applied a total of 96 rules in 12 ms. Remains 105 /153 variables (removed 48) and now considering 188/236 (removed 48) transitions.
// Phase 1: matrix 188 rows 105 cols
[2024-05-31 02:47:14] [INFO ] Computed 10 invariants in 1 ms
[2024-05-31 02:47:14] [INFO ] Implicit Places using invariants in 107 ms returned [76]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 109 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 104/153 places, 188/236 transitions.
Applied a total of 0 rules in 3 ms. Remains 104 /104 variables (removed 0) and now considering 188/188 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 124 ms. Remains : 104/153 places, 188/236 transitions.
Stuttering acceptance computed with spot in 199 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N04-LTLFireability-02
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-PT-Z4T4N04-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z4T4N04-LTLFireability-02 finished in 344 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(G((p0||X(F(p1)))))))'
Support contains 24 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 236/236 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 105 transition count 188
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 105 transition count 188
Applied a total of 96 rules in 14 ms. Remains 105 /153 variables (removed 48) and now considering 188/236 (removed 48) transitions.
[2024-05-31 02:47:15] [INFO ] Invariant cache hit.
[2024-05-31 02:47:15] [INFO ] Implicit Places using invariants in 213 ms returned [76]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 214 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 104/153 places, 188/236 transitions.
Applied a total of 0 rules in 5 ms. Remains 104 /104 variables (removed 0) and now considering 188/188 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 235 ms. Remains : 104/153 places, 188/236 transitions.
Stuttering acceptance computed with spot in 206 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N04-LTLFireability-03
Product exploration explored 100000 steps with 1479 reset in 360 ms.
Product exploration explored 100000 steps with 1504 reset in 478 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 114 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 203 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 451 steps (0 resets) in 11 ms. (37 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 p1), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 178 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 206 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 207 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 24 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 188/188 transitions.
Applied a total of 0 rules in 4 ms. Remains 104 /104 variables (removed 0) and now considering 188/188 (removed 0) transitions.
// Phase 1: matrix 188 rows 104 cols
[2024-05-31 02:47:17] [INFO ] Computed 9 invariants in 2 ms
[2024-05-31 02:47:17] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-05-31 02:47:17] [INFO ] Invariant cache hit.
[2024-05-31 02:47:17] [INFO ] Implicit Places using invariants and state equation in 195 ms returned []
Implicit Place search using SMT with State Equation took 298 ms to find 0 implicit places.
Running 184 sub problems to find dead transitions.
[2024-05-31 02:47:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (OVERLAPS) 4/104 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 4 (OVERLAPS) 188/292 variables, 104/113 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/292 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 6 (OVERLAPS) 0/292 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 184 unsolved
No progress, stopping.
After SMT solving in domain Real declared 292/292 variables, and 113 constraints, problems are : Problem set: 0 solved, 184 unsolved in 7261 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 104/104 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 184 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (OVERLAPS) 4/104 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 4 (OVERLAPS) 188/292 variables, 104/113 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/292 variables, 184/297 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/292 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 7 (OVERLAPS) 0/292 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 184 unsolved
No progress, stopping.
After SMT solving in domain Int declared 292/292 variables, and 297 constraints, problems are : Problem set: 0 solved, 184 unsolved in 8903 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 104/104 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 0/0 constraints]
After SMT, in 16277ms problems are : Problem set: 0 solved, 184 unsolved
Search for dead transitions found 0 dead transitions in 16282ms
Finished structural reductions in LTL mode , in 1 iterations and 16585 ms. Remains : 104/104 places, 188/188 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 86 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 148 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 519 steps (0 resets) in 9 ms. (51 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 p1), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 125 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 151 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 171 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 174 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 1455 reset in 203 ms.
Product exploration explored 100000 steps with 1477 reset in 221 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 267 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 24 out of 104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 188/188 transitions.
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 20 places in 0 ms
Iterating global reduction 0 with 20 rules applied. Total rules applied 20 place count 104 transition count 200
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 36 place count 104 transition count 184
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 39 place count 101 transition count 136
Deduced a syphon composed of 20 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 42 place count 101 transition count 136
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 54 place count 89 transition count 124
Deduced a syphon composed of 20 places in 0 ms
Iterating global reduction 1 with 12 rules applied. Total rules applied 66 place count 89 transition count 124
Deduced a syphon composed of 20 places in 0 ms
Applied a total of 66 rules in 16 ms. Remains 89 /104 variables (removed 15) and now considering 124/188 (removed 64) transitions.
[2024-05-31 02:47:35] [INFO ] Redundant transitions in 1 ms returned []
Running 108 sub problems to find dead transitions.
// Phase 1: matrix 124 rows 89 cols
[2024-05-31 02:47:35] [INFO ] Computed 9 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 4/89 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-05-31 02:47:37] [INFO ] Deduced a trap composed of 15 places in 100 ms of which 40 ms to minimize.
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
[2024-05-31 02:47:37] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 3 ms to minimize.
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
[2024-05-31 02:47:37] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 3/12 constraints. Problems are: Problem set: 24 solved, 84 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/12 constraints. Problems are: Problem set: 24 solved, 84 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
At refinement iteration 5 (OVERLAPS) 124/213 variables, 89/101 constraints. Problems are: Problem set: 32 solved, 76 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/213 variables, 0/101 constraints. Problems are: Problem set: 32 solved, 76 unsolved
At refinement iteration 7 (OVERLAPS) 0/213 variables, 0/101 constraints. Problems are: Problem set: 32 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Real declared 213/213 variables, and 101 constraints, problems are : Problem set: 32 solved, 76 unsolved in 4111 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 89/89 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 32 solved, 76 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 32 solved, 76 unsolved
At refinement iteration 1 (OVERLAPS) 24/89 variables, 9/9 constraints. Problems are: Problem set: 32 solved, 76 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 3/12 constraints. Problems are: Problem set: 32 solved, 76 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/12 constraints. Problems are: Problem set: 32 solved, 76 unsolved
At refinement iteration 4 (OVERLAPS) 124/213 variables, 89/101 constraints. Problems are: Problem set: 32 solved, 76 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/213 variables, 76/177 constraints. Problems are: Problem set: 32 solved, 76 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/213 variables, 0/177 constraints. Problems are: Problem set: 32 solved, 76 unsolved
At refinement iteration 7 (OVERLAPS) 0/213 variables, 0/177 constraints. Problems are: Problem set: 32 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Int declared 213/213 variables, and 177 constraints, problems are : Problem set: 32 solved, 76 unsolved in 2869 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 89/89 constraints, PredecessorRefiner: 76/108 constraints, Known Traps: 3/3 constraints]
After SMT, in 7011ms problems are : Problem set: 32 solved, 76 unsolved
Search for dead transitions found 32 dead transitions in 7018ms
Found 32 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 32 transitions
Dead transitions reduction (with SMT) removed 32 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 89/104 places, 92/188 transitions.
Graph (complete) has 108 edges and 89 vertex of which 69 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.2 ms
Discarding 20 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 10 ms. Remains 69 /89 variables (removed 20) and now considering 92/92 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 69/104 places, 92/188 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 7062 ms. Remains : 69/104 places, 92/188 transitions.
Built C files in :
/tmp/ltsmin6953125663272285340
[2024-05-31 02:47:42] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6953125663272285340
Running compilation step : cd /tmp/ltsmin6953125663272285340;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 761 ms.
Running link step : cd /tmp/ltsmin6953125663272285340;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin6953125663272285340;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased431351747858723884.hoa' '--buchi-type=spotba'
LTSmin run took 6465 ms.
FORMULA UtilityControlRoom-PT-Z4T4N04-LTLFireability-03 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property UtilityControlRoom-PT-Z4T4N04-LTLFireability-03 finished in 35067 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((G(!p1)||p0))||X(X(F((p2&&X(!p3)))))))'
Support contains 28 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 236/236 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 105 transition count 188
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 105 transition count 188
Applied a total of 96 rules in 6 ms. Remains 105 /153 variables (removed 48) and now considering 188/236 (removed 48) transitions.
// Phase 1: matrix 188 rows 105 cols
[2024-05-31 02:47:50] [INFO ] Computed 10 invariants in 2 ms
[2024-05-31 02:47:50] [INFO ] Implicit Places using invariants in 167 ms returned [76]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 172 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 104/153 places, 188/236 transitions.
Applied a total of 0 rules in 1 ms. Remains 104 /104 variables (removed 0) and now considering 188/188 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 179 ms. Remains : 104/153 places, 188/236 transitions.
Stuttering acceptance computed with spot in 673 ms :[(OR (AND p1 (NOT p2)) (AND p1 p3)), (OR (AND p1 (NOT p2)) (AND p1 p3)), (OR (AND (NOT p0) p1 (NOT p2)) (AND (NOT p0) p1 p3)), (AND p1 p3), (AND (NOT p0) p1 p3), (OR (NOT p2) p3), (OR (AND (NOT p0) p1 (NOT p2)) (AND (NOT p0) p1 p3)), (OR (AND (NOT p0) p1 (NOT p2)) (AND (NOT p0) p1 p3)), (OR (NOT p2) p3), p3]
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N04-LTLFireability-04
Product exploration explored 100000 steps with 21465 reset in 229 ms.
Product exploration explored 100000 steps with 21408 reset in 208 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p2 p0 p3), (X (NOT (AND (NOT p0) p1))), (X p1), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X p2)), (X (X (AND p1 p2))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (AND p0 p2))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 18 factoid took 172 ms. Reduced automaton from 10 states, 33 edges and 4 AP (stutter sensitive) to 8 states, 26 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 558 ms :[(OR (NOT p2) p3), p3, (OR (AND p1 (NOT p2)) (AND p1 p3)), (OR (AND (NOT p0) p1 (NOT p2)) (AND (NOT p0) p1 p3)), (AND p1 p3), (AND (NOT p0) p1 p3), (OR (AND (NOT p0) p1 (NOT p2)) (AND (NOT p0) p1 p3)), (OR (AND (NOT p0) p1 (NOT p2)) (AND (NOT p0) p1 p3))]
Reduction of identical properties reduced properties to check from 26 to 21
RANDOM walk for 40000 steps (8 resets) in 1152 ms. (34 steps per ms) remains 6/21 properties
BEST_FIRST walk for 40003 steps (8 resets) in 610 ms. (65 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 150 ms. (264 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 114 ms. (347 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 132 ms. (300 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 156 ms. (254 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 138 ms. (287 steps per ms) remains 6/6 properties
// Phase 1: matrix 188 rows 104 cols
[2024-05-31 02:47:53] [INFO ] Computed 9 invariants in 2 ms
Problem apf4 is UNSAT
Problem apf11 is UNSAT
Problem apf16 is UNSAT
Problem apf17 is UNSAT
Problem apf18 is UNSAT
Problem apf19 is UNSAT
After SMT solving in domain Real declared 28/292 variables, and 0 constraints, problems are : Problem set: 6 solved, 0 unsolved in 28 ms.
Refiners :[Positive P Invariants (semi-flows): 0/9 constraints, State Equation: 0/104 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 49ms problems are : Problem set: 6 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 6 invariant AP formulas.
Knowledge obtained : [(AND p1 p2 p0 p3), (X (NOT (AND (NOT p0) p1))), (X p1), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X p2)), (X (X (AND p1 p2))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (AND p0 p2))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X p0)), (X (X p1)), (G (OR p0 p1 (NOT p2))), (G (OR p0 (NOT p1) (NOT p2))), (G (OR (NOT p0) p2)), (G (OR p0 p1 (NOT p2) (NOT p3))), (G (OR (NOT p0) p2 (NOT p3))), (G (OR p0 (NOT p1) (NOT p2) (NOT p3)))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR (NOT p1) p2))), (F (NOT (AND p0 p2 p3))), (F (NOT (OR p1 (NOT p2)))), (F (NOT p0)), (F (NOT (OR p0 (NOT p1) p2 (NOT p3)))), (F (NOT p3)), (F (NOT (AND p2 p3))), (F (NOT (AND p1 p2 p3))), (F (NOT (OR p0 p1 p2 (NOT p3)))), (F (NOT (OR p1 p2))), (F (NOT (OR p2 (NOT p3)))), (F (NOT (AND p0 p2))), (F (NOT (OR (NOT p1) p2 (NOT p3)))), (F (NOT (OR p1 (NOT p2) (NOT p3)))), (F (NOT (OR p1 p2 (NOT p3)))), (F (NOT (OR p0 p1 p2))), (F (NOT (AND p1 p2))), (F (NOT p2)), (F (NOT (OR p0 (NOT p1) p2)))]
Knowledge based reduction with 24 factoid took 887 ms. Reduced automaton from 8 states, 26 edges and 4 AP (stutter sensitive) to 8 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 385 ms :[(OR (NOT p2) p3), p3, (OR (AND p1 (NOT p2)) (AND p1 p3)), (AND p1 p3), (AND (NOT p2) p3 p1), (AND (NOT p2) p3 p1), (AND (NOT p2) p3 p1), (AND (NOT p2) p3 p1)]
Stuttering acceptance computed with spot in 346 ms :[(OR (NOT p2) p3), p3, (OR (AND p1 (NOT p2)) (AND p1 p3)), (AND p1 p3), (AND (NOT p2) p3 p1), (AND (NOT p2) p3 p1), (AND (NOT p2) p3 p1), (AND (NOT p2) p3 p1)]
Support contains 28 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 188/188 transitions.
Applied a total of 0 rules in 3 ms. Remains 104 /104 variables (removed 0) and now considering 188/188 (removed 0) transitions.
[2024-05-31 02:47:54] [INFO ] Invariant cache hit.
[2024-05-31 02:47:55] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-05-31 02:47:55] [INFO ] Invariant cache hit.
[2024-05-31 02:47:55] [INFO ] Implicit Places using invariants and state equation in 168 ms returned []
Implicit Place search using SMT with State Equation took 266 ms to find 0 implicit places.
Running 184 sub problems to find dead transitions.
[2024-05-31 02:47:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (OVERLAPS) 4/104 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 4 (OVERLAPS) 188/292 variables, 104/113 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/292 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 6 (OVERLAPS) 0/292 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 184 unsolved
No progress, stopping.
After SMT solving in domain Real declared 292/292 variables, and 113 constraints, problems are : Problem set: 0 solved, 184 unsolved in 7188 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 104/104 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 184 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (OVERLAPS) 4/104 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 4 (OVERLAPS) 188/292 variables, 104/113 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/292 variables, 184/297 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/292 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 7 (OVERLAPS) 0/292 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 184 unsolved
No progress, stopping.
After SMT solving in domain Int declared 292/292 variables, and 297 constraints, problems are : Problem set: 0 solved, 184 unsolved in 9393 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 104/104 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 0/0 constraints]
After SMT, in 16703ms problems are : Problem set: 0 solved, 184 unsolved
Search for dead transitions found 0 dead transitions in 16707ms
Finished structural reductions in LTL mode , in 1 iterations and 16978 ms. Remains : 104/104 places, 188/188 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 p3 p1)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 135 ms. Reduced automaton from 8 states, 18 edges and 3 AP (stutter sensitive) to 8 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 324 ms :[(OR (NOT p2) p3), p3, (OR (AND p1 (NOT p2)) (AND p1 p3)), (AND p1 p3), (AND (NOT p2) p3 p1), (AND (NOT p2) p3 p1), (AND (NOT p2) p3 p1), (AND (NOT p2) p3 p1)]
RANDOM walk for 545 steps (0 resets) in 10 ms. (49 steps per ms) remains 0/13 properties
Knowledge obtained : [(AND p2 p3 p1)]
False Knowledge obtained : [(F (NOT (OR p2 (NOT p3)))), (F (NOT (OR p1 (NOT p2)))), (F (NOT (OR (NOT p1) p2 (NOT p3)))), (F (NOT (AND p2 p3))), (F (NOT (AND p1 p2 p3))), (F (NOT (OR (NOT p1) p2))), (F (NOT p1)), (F (NOT (OR p1 p2 (NOT p3)))), (F (NOT p3)), (F (NOT (AND p1 p2))), (F (NOT p2)), (F (NOT (OR p1 p2))), (F (NOT (OR p1 (NOT p2) (NOT p3))))]
Knowledge based reduction with 1 factoid took 591 ms. Reduced automaton from 8 states, 18 edges and 3 AP (stutter sensitive) to 8 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 444 ms :[(OR (NOT p2) p3), p3, (OR (AND p1 (NOT p2)) (AND p1 p3)), (AND p1 p3), (AND (NOT p2) p3 p1), (AND (NOT p2) p3 p1), (AND (NOT p2) p3 p1), (AND (NOT p2) p3 p1)]
Stuttering acceptance computed with spot in 452 ms :[(OR (NOT p2) p3), p3, (OR (AND p1 (NOT p2)) (AND p1 p3)), (AND p1 p3), (AND (NOT p2) p3 p1), (AND (NOT p2) p3 p1), (AND (NOT p2) p3 p1), (AND (NOT p2) p3 p1)]
Stuttering acceptance computed with spot in 375 ms :[(OR (NOT p2) p3), p3, (OR (AND p1 (NOT p2)) (AND p1 p3)), (AND p1 p3), (AND (NOT p2) p3 p1), (AND (NOT p2) p3 p1), (AND (NOT p2) p3 p1), (AND (NOT p2) p3 p1)]
Product exploration explored 100000 steps with 21376 reset in 343 ms.
Product exploration explored 100000 steps with 21468 reset in 371 ms.
Built C files in :
/tmp/ltsmin6057263545448136679
[2024-05-31 02:48:15] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6057263545448136679
Running compilation step : cd /tmp/ltsmin6057263545448136679;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 825 ms.
Running link step : cd /tmp/ltsmin6057263545448136679;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin6057263545448136679;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased5536602208161359525.hoa' '--buchi-type=spotba'
LTSmin run took 315 ms.
FORMULA UtilityControlRoom-PT-Z4T4N04-LTLFireability-04 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property UtilityControlRoom-PT-Z4T4N04-LTLFireability-04 finished in 26117 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)||G(F(p1)))))'
Support contains 41 out of 153 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 153/153 places, 236/236 transitions.
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 153 transition count 172
Reduce places removed 64 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 80 rules applied. Total rules applied 144 place count 89 transition count 156
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 152 place count 85 transition count 152
Applied a total of 152 rules in 12 ms. Remains 85 /153 variables (removed 68) and now considering 152/236 (removed 84) transitions.
// Phase 1: matrix 152 rows 85 cols
[2024-05-31 02:48:16] [INFO ] Computed 10 invariants in 1 ms
[2024-05-31 02:48:16] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-31 02:48:16] [INFO ] Invariant cache hit.
[2024-05-31 02:48:16] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
[2024-05-31 02:48:16] [INFO ] Redundant transitions in 2 ms returned []
Running 132 sub problems to find dead transitions.
[2024-05-31 02:48:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (OVERLAPS) 4/85 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (OVERLAPS) 152/237 variables, 85/95 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 6 (OVERLAPS) 0/237 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Real declared 237/237 variables, and 95 constraints, problems are : Problem set: 0 solved, 132 unsolved in 3998 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 85/85 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 132 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (OVERLAPS) 4/85 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (OVERLAPS) 152/237 variables, 85/95 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 132/227 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 7 (OVERLAPS) 0/237 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Int declared 237/237 variables, and 227 constraints, problems are : Problem set: 0 solved, 132 unsolved in 5260 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 85/85 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 0/0 constraints]
After SMT, in 9380ms problems are : Problem set: 0 solved, 132 unsolved
Search for dead transitions found 0 dead transitions in 9384ms
Starting structural reductions in SI_LTL mode, iteration 1 : 85/153 places, 152/236 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9522 ms. Remains : 85/153 places, 152/236 transitions.
Stuttering acceptance computed with spot in 117 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N04-LTLFireability-05
Product exploration explored 100000 steps with 8607 reset in 432 ms.
Product exploration explored 100000 steps with 8400 reset in 443 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X p1)), (X (X (NOT p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 5 factoid took 346 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 92 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 69 steps (0 resets) in 6 ms. (9 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X p1)), (X (X (NOT p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F p1), (F (NOT (AND (NOT p1) (NOT p0)))), (F p0), (F (NOT (OR p1 (NOT p0))))]
Knowledge based reduction with 5 factoid took 505 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
[2024-05-31 02:48:28] [INFO ] Invariant cache hit.
[2024-05-31 02:48:28] [INFO ] [Real]Absence check using 10 positive place invariants in 40 ms returned sat
[2024-05-31 02:48:28] [INFO ] [Real]Absence check using state equation in 76 ms returned sat
[2024-05-31 02:48:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 02:48:29] [INFO ] [Nat]Absence check using 10 positive place invariants in 12 ms returned sat
[2024-05-31 02:48:29] [INFO ] [Nat]Absence check using state equation in 110 ms returned sat
[2024-05-31 02:48:29] [INFO ] Computed and/alt/rep : 132/224/132 causal constraints (skipped 0 transitions) in 20 ms.
[2024-05-31 02:48:29] [INFO ] Added : 4 causal constraints over 1 iterations in 62 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p0))
Support contains 41 out of 85 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 85/85 places, 152/152 transitions.
Applied a total of 0 rules in 11 ms. Remains 85 /85 variables (removed 0) and now considering 152/152 (removed 0) transitions.
[2024-05-31 02:48:29] [INFO ] Invariant cache hit.
[2024-05-31 02:48:29] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-31 02:48:29] [INFO ] Invariant cache hit.
[2024-05-31 02:48:29] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 195 ms to find 0 implicit places.
[2024-05-31 02:48:30] [INFO ] Redundant transitions in 2 ms returned []
Running 132 sub problems to find dead transitions.
[2024-05-31 02:48:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (OVERLAPS) 4/85 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (OVERLAPS) 152/237 variables, 85/95 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 6 (OVERLAPS) 0/237 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Real declared 237/237 variables, and 95 constraints, problems are : Problem set: 0 solved, 132 unsolved in 4642 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 85/85 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 132 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (OVERLAPS) 4/85 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (OVERLAPS) 152/237 variables, 85/95 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 132/227 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 7 (OVERLAPS) 0/237 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Int declared 237/237 variables, and 227 constraints, problems are : Problem set: 0 solved, 132 unsolved in 5569 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 85/85 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 0/0 constraints]
After SMT, in 10372ms problems are : Problem set: 0 solved, 132 unsolved
Search for dead transitions found 0 dead transitions in 10386ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 10602 ms. Remains : 85/85 places, 152/152 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 5 factoid took 304 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 65 steps (0 resets) in 6 ms. (9 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (X (X (NOT p1))), (F p1), (F (NOT (AND (NOT p1) (NOT p0)))), (F p0), (F (NOT (OR p1 (NOT p0))))]
Knowledge based reduction with 5 factoid took 529 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 95 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 89 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
[2024-05-31 02:48:41] [INFO ] Invariant cache hit.
[2024-05-31 02:48:42] [INFO ] [Real]Absence check using 10 positive place invariants in 11 ms returned sat
[2024-05-31 02:48:42] [INFO ] [Real]Absence check using state equation in 84 ms returned sat
[2024-05-31 02:48:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 02:48:42] [INFO ] [Nat]Absence check using 10 positive place invariants in 11 ms returned sat
[2024-05-31 02:48:43] [INFO ] [Nat]Absence check using state equation in 105 ms returned sat
[2024-05-31 02:48:43] [INFO ] Computed and/alt/rep : 132/224/132 causal constraints (skipped 0 transitions) in 17 ms.
[2024-05-31 02:48:43] [INFO ] Added : 4 causal constraints over 1 iterations in 57 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p0))
Stuttering acceptance computed with spot in 95 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 8499 reset in 877 ms.
Product exploration explored 100000 steps with 8647 reset in 732 ms.
Built C files in :
/tmp/ltsmin16974334841440884881
[2024-05-31 02:48:44] [INFO ] Computing symmetric may disable matrix : 152 transitions.
[2024-05-31 02:48:44] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 02:48:44] [INFO ] Computing symmetric may enable matrix : 152 transitions.
[2024-05-31 02:48:44] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 02:48:44] [INFO ] Computing Do-Not-Accords matrix : 152 transitions.
[2024-05-31 02:48:44] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 02:48:44] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16974334841440884881
Running compilation step : cd /tmp/ltsmin16974334841440884881;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 776 ms.
Running link step : cd /tmp/ltsmin16974334841440884881;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin16974334841440884881;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16562380779816086309.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 41 out of 85 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 85/85 places, 152/152 transitions.
Applied a total of 0 rules in 7 ms. Remains 85 /85 variables (removed 0) and now considering 152/152 (removed 0) transitions.
[2024-05-31 02:48:59] [INFO ] Invariant cache hit.
[2024-05-31 02:49:00] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-31 02:49:00] [INFO ] Invariant cache hit.
[2024-05-31 02:49:00] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 133 ms to find 0 implicit places.
[2024-05-31 02:49:00] [INFO ] Redundant transitions in 1 ms returned []
Running 132 sub problems to find dead transitions.
[2024-05-31 02:49:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (OVERLAPS) 4/85 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (OVERLAPS) 152/237 variables, 85/95 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 6 (OVERLAPS) 0/237 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Real declared 237/237 variables, and 95 constraints, problems are : Problem set: 0 solved, 132 unsolved in 3837 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 85/85 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 132 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (OVERLAPS) 4/85 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (OVERLAPS) 152/237 variables, 85/95 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 132/227 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 7 (OVERLAPS) 0/237 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Int declared 237/237 variables, and 227 constraints, problems are : Problem set: 0 solved, 132 unsolved in 5628 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 85/85 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 0/0 constraints]
After SMT, in 9571ms problems are : Problem set: 0 solved, 132 unsolved
Search for dead transitions found 0 dead transitions in 9574ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 9722 ms. Remains : 85/85 places, 152/152 transitions.
Built C files in :
/tmp/ltsmin9576769395845796171
[2024-05-31 02:49:09] [INFO ] Computing symmetric may disable matrix : 152 transitions.
[2024-05-31 02:49:09] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 02:49:09] [INFO ] Computing symmetric may enable matrix : 152 transitions.
[2024-05-31 02:49:09] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 02:49:09] [INFO ] Computing Do-Not-Accords matrix : 152 transitions.
[2024-05-31 02:49:09] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 02:49:09] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9576769395845796171
Running compilation step : cd /tmp/ltsmin9576769395845796171;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 630 ms.
Running link step : cd /tmp/ltsmin9576769395845796171;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin9576769395845796171;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1274836508183129622.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-31 02:49:24] [INFO ] Flatten gal took : 12 ms
[2024-05-31 02:49:24] [INFO ] Flatten gal took : 11 ms
[2024-05-31 02:49:24] [INFO ] Time to serialize gal into /tmp/LTL1328219165748572254.gal : 4 ms
[2024-05-31 02:49:24] [INFO ] Time to serialize properties into /tmp/LTL18128813801260448320.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1328219165748572254.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4338672628111035760.hoa' '-atoms' '/tmp/LTL18128813801260448320.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL18128813801260448320.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4338672628111035760.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
2 unique states visited
0 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
404 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,4.06532,106268,1,0,121,431789,34,25,2809,397211,287
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA UtilityControlRoom-PT-Z4T4N04-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property UtilityControlRoom-PT-Z4T4N04-LTLFireability-05 finished in 73022 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(((p0 U p1)&&G(p2)))) U p3))'
Support contains 29 out of 153 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 153/153 places, 236/236 transitions.
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 153 transition count 172
Reduce places removed 64 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 80 rules applied. Total rules applied 144 place count 89 transition count 156
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 144 place count 89 transition count 140
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 176 place count 73 transition count 140
Applied a total of 176 rules in 11 ms. Remains 73 /153 variables (removed 80) and now considering 140/236 (removed 96) transitions.
// Phase 1: matrix 140 rows 73 cols
[2024-05-31 02:49:29] [INFO ] Computed 10 invariants in 2 ms
[2024-05-31 02:49:29] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-31 02:49:29] [INFO ] Invariant cache hit.
[2024-05-31 02:49:29] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 151 ms to find 0 implicit places.
[2024-05-31 02:49:29] [INFO ] Redundant transitions in 1 ms returned []
Running 136 sub problems to find dead transitions.
[2024-05-31 02:49:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/69 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (OVERLAPS) 4/73 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 4 (OVERLAPS) 140/213 variables, 73/83 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/213 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (OVERLAPS) 0/213 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Real declared 213/213 variables, and 83 constraints, problems are : Problem set: 0 solved, 136 unsolved in 3433 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 73/73 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 136 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/69 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (OVERLAPS) 4/73 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 4 (OVERLAPS) 140/213 variables, 73/83 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/213 variables, 136/219 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/213 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 7 (OVERLAPS) 0/213 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Int declared 213/213 variables, and 219 constraints, problems are : Problem set: 0 solved, 136 unsolved in 5775 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 73/73 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 0/0 constraints]
After SMT, in 9331ms problems are : Problem set: 0 solved, 136 unsolved
Search for dead transitions found 0 dead transitions in 9333ms
Starting structural reductions in SI_LTL mode, iteration 1 : 73/153 places, 140/236 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9500 ms. Remains : 73/153 places, 140/236 transitions.
Stuttering acceptance computed with spot in 224 ms :[(NOT p3), (OR (NOT p3) (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N04-LTLFireability-06
Product exploration explored 100000 steps with 2587 reset in 573 ms.
Stack based approach found an accepted trace after 6603 steps with 157 reset with depth 51 and stack size 51 in 39 ms.
FORMULA UtilityControlRoom-PT-Z4T4N04-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z4T4N04-LTLFireability-06 finished in 10362 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 153 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 153/153 places, 236/236 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 153 transition count 176
Reduce places removed 60 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 1 with 75 rules applied. Total rules applied 135 place count 93 transition count 161
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 135 place count 93 transition count 146
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 165 place count 78 transition count 146
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 168 place count 75 transition count 143
Iterating global reduction 2 with 3 rules applied. Total rules applied 171 place count 75 transition count 143
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 173 place count 73 transition count 111
Iterating global reduction 2 with 2 rules applied. Total rules applied 175 place count 73 transition count 111
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 183 place count 65 transition count 103
Iterating global reduction 2 with 8 rules applied. Total rules applied 191 place count 65 transition count 103
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 199 place count 57 transition count 87
Iterating global reduction 2 with 8 rules applied. Total rules applied 207 place count 57 transition count 87
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 215 place count 49 transition count 71
Iterating global reduction 2 with 8 rules applied. Total rules applied 223 place count 49 transition count 71
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 231 place count 49 transition count 63
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 263 place count 33 transition count 47
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 264 place count 33 transition count 46
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 265 place count 32 transition count 38
Ensure Unique test removed 1 places
Iterating global reduction 3 with 2 rules applied. Total rules applied 267 place count 31 transition count 38
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 271 place count 27 transition count 30
Iterating global reduction 3 with 4 rules applied. Total rules applied 275 place count 27 transition count 30
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 278 place count 24 transition count 27
Iterating global reduction 3 with 3 rules applied. Total rules applied 281 place count 24 transition count 27
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 284 place count 24 transition count 24
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 290 place count 21 transition count 21
Applied a total of 290 rules in 34 ms. Remains 21 /153 variables (removed 132) and now considering 21/236 (removed 215) transitions.
// Phase 1: matrix 21 rows 21 cols
[2024-05-31 02:49:39] [INFO ] Computed 9 invariants in 1 ms
[2024-05-31 02:49:39] [INFO ] Implicit Places using invariants in 37 ms returned [12]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 39 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 20/153 places, 21/236 transitions.
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 0 place count 20 transition count 17
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 11 rules applied. Total rules applied 11 place count 13 transition count 17
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 14 place count 13 transition count 14
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 25 place count 7 transition count 9
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 27 place count 6 transition count 8
Applied a total of 27 rules in 5 ms. Remains 6 /20 variables (removed 14) and now considering 8/21 (removed 13) transitions.
// Phase 1: matrix 8 rows 6 cols
[2024-05-31 02:49:39] [INFO ] Computed 2 invariants in 0 ms
[2024-05-31 02:49:39] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-31 02:49:39] [INFO ] Invariant cache hit.
[2024-05-31 02:49:39] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 6/153 places, 8/236 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 129 ms. Remains : 6/153 places, 8/236 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N04-LTLFireability-08
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-PT-Z4T4N04-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z4T4N04-LTLFireability-08 finished in 220 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(G((X(((G(p0) U X(p1))||p2)) U p1)))))'
Support contains 6 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 236/236 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 105 transition count 188
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 105 transition count 188
Applied a total of 96 rules in 10 ms. Remains 105 /153 variables (removed 48) and now considering 188/236 (removed 48) transitions.
// Phase 1: matrix 188 rows 105 cols
[2024-05-31 02:49:40] [INFO ] Computed 10 invariants in 1 ms
[2024-05-31 02:49:40] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-31 02:49:40] [INFO ] Invariant cache hit.
[2024-05-31 02:49:40] [INFO ] Implicit Places using invariants and state equation in 172 ms returned []
Implicit Place search using SMT with State Equation took 249 ms to find 0 implicit places.
Running 184 sub problems to find dead transitions.
[2024-05-31 02:49:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (OVERLAPS) 4/105 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 4 (OVERLAPS) 188/293 variables, 105/115 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/293 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 6 (OVERLAPS) 0/293 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 184 unsolved
No progress, stopping.
After SMT solving in domain Real declared 293/293 variables, and 115 constraints, problems are : Problem set: 0 solved, 184 unsolved in 6683 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 184 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (OVERLAPS) 4/105 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 4 (OVERLAPS) 188/293 variables, 105/115 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/293 variables, 184/299 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/293 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 7 (OVERLAPS) 0/293 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 184 unsolved
No progress, stopping.
After SMT solving in domain Int declared 293/293 variables, and 299 constraints, problems are : Problem set: 0 solved, 184 unsolved in 9374 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 0/0 constraints]
After SMT, in 16284ms problems are : Problem set: 0 solved, 184 unsolved
Search for dead transitions found 0 dead transitions in 16289ms
Starting structural reductions in LTL mode, iteration 1 : 105/153 places, 188/236 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16549 ms. Remains : 105/153 places, 188/236 transitions.
Stuttering acceptance computed with spot in 539 ms :[(NOT p1), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N04-LTLFireability-09
Product exploration explored 100000 steps with 450 reset in 219 ms.
Stack based approach found an accepted trace after 15162 steps with 59 reset with depth 472 and stack size 472 in 44 ms.
FORMULA UtilityControlRoom-PT-Z4T4N04-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z4T4N04-LTLFireability-09 finished in 17387 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p0))&&(p1||G(p2)))))'
Support contains 3 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 236/236 transitions.
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 47 place count 106 transition count 189
Iterating global reduction 0 with 47 rules applied. Total rules applied 94 place count 106 transition count 189
Applied a total of 94 rules in 3 ms. Remains 106 /153 variables (removed 47) and now considering 189/236 (removed 47) transitions.
// Phase 1: matrix 189 rows 106 cols
[2024-05-31 02:49:57] [INFO ] Computed 10 invariants in 1 ms
[2024-05-31 02:49:57] [INFO ] Implicit Places using invariants in 135 ms returned [77]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 136 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 105/153 places, 189/236 transitions.
Applied a total of 0 rules in 1 ms. Remains 105 /105 variables (removed 0) and now considering 189/189 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 141 ms. Remains : 105/153 places, 189/236 transitions.
Stuttering acceptance computed with spot in 182 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (NOT p0), (NOT p2)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N04-LTLFireability-11
Entered a terminal (fully accepting) state of product in 27 steps with 0 reset in 1 ms.
FORMULA UtilityControlRoom-PT-Z4T4N04-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z4T4N04-LTLFireability-11 finished in 480 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 (F(!p1)&&(!p1||G(p2)||X(F(!p3)))))))'
Support contains 7 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 236/236 transitions.
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 47 place count 106 transition count 189
Iterating global reduction 0 with 47 rules applied. Total rules applied 94 place count 106 transition count 189
Applied a total of 94 rules in 3 ms. Remains 106 /153 variables (removed 47) and now considering 189/236 (removed 47) transitions.
// Phase 1: matrix 189 rows 106 cols
[2024-05-31 02:49:57] [INFO ] Computed 10 invariants in 1 ms
[2024-05-31 02:49:57] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-31 02:49:57] [INFO ] Invariant cache hit.
[2024-05-31 02:49:58] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 199 ms to find 0 implicit places.
Running 185 sub problems to find dead transitions.
[2024-05-31 02:49:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (OVERLAPS) 4/106 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 4 (OVERLAPS) 189/295 variables, 106/116 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/295 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 6 (OVERLAPS) 0/295 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 185 unsolved
No progress, stopping.
After SMT solving in domain Real declared 295/295 variables, and 116 constraints, problems are : Problem set: 0 solved, 185 unsolved in 4938 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 106/106 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 185 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (OVERLAPS) 4/106 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 4 (OVERLAPS) 189/295 variables, 106/116 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/295 variables, 185/301 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/295 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 7 (OVERLAPS) 0/295 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 185 unsolved
No progress, stopping.
After SMT solving in domain Int declared 295/295 variables, and 301 constraints, problems are : Problem set: 0 solved, 185 unsolved in 9692 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 106/106 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 0/0 constraints]
After SMT, in 14770ms problems are : Problem set: 0 solved, 185 unsolved
Search for dead transitions found 0 dead transitions in 14773ms
Starting structural reductions in LTL mode, iteration 1 : 106/153 places, 189/236 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14977 ms. Remains : 106/153 places, 189/236 transitions.
Stuttering acceptance computed with spot in 420 ms :[(AND p3 (NOT p2)), p1, p3, p1, p1, p1, (OR p1 p3), (OR p1 (AND (NOT p2) p3))]
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N04-LTLFireability-12
Product exploration explored 100000 steps with 50000 reset in 282 ms.
Product exploration explored 100000 steps with 50000 reset in 343 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 p2 (NOT p3) (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X p2), (X (NOT (AND p1 p2 (NOT p0)))), (X (NOT (AND p1 p0))), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND p1 p2 (NOT p0) p3)))), (X (X (NOT (AND p1 p2 p3)))), (X (X (NOT (AND p1 p3)))), (X (X (NOT (AND (NOT p1) (NOT p2) p3)))), (X (X (NOT (AND p1 p0 p3)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0) p3)))), (X (X (NOT (AND p1 (NOT p2) p3))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p3)), (X (X (NOT p3))), (X (X (AND p1 (NOT p3)))), (X (X (NOT (AND p1 (NOT p3))))), (X (X (AND (NOT p1) p3))), (X (X (NOT (AND (NOT p1) p3)))), (X (X (AND (NOT p1) p2 p3))), (X (X (NOT (AND (NOT p1) p2 p3)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 14 factoid took 25 ms. Reduced automaton from 8 states, 20 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA UtilityControlRoom-PT-Z4T4N04-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-PT-Z4T4N04-LTLFireability-12 finished in 16085 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||X(p1))))'
Support contains 5 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 236/236 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 105 transition count 188
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 105 transition count 188
Applied a total of 96 rules in 6 ms. Remains 105 /153 variables (removed 48) and now considering 188/236 (removed 48) transitions.
// Phase 1: matrix 188 rows 105 cols
[2024-05-31 02:50:13] [INFO ] Computed 10 invariants in 2 ms
[2024-05-31 02:50:14] [INFO ] Implicit Places using invariants in 123 ms returned []
[2024-05-31 02:50:14] [INFO ] Invariant cache hit.
[2024-05-31 02:50:14] [INFO ] Implicit Places using invariants and state equation in 229 ms returned []
Implicit Place search using SMT with State Equation took 355 ms to find 0 implicit places.
Running 184 sub problems to find dead transitions.
[2024-05-31 02:50:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (OVERLAPS) 4/105 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 4 (OVERLAPS) 188/293 variables, 105/115 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/293 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 6 (OVERLAPS) 0/293 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 184 unsolved
No progress, stopping.
After SMT solving in domain Real declared 293/293 variables, and 115 constraints, problems are : Problem set: 0 solved, 184 unsolved in 7983 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 184 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (OVERLAPS) 4/105 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 4 (OVERLAPS) 188/293 variables, 105/115 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/293 variables, 184/299 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/293 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 7 (OVERLAPS) 0/293 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 184 unsolved
No progress, stopping.
After SMT solving in domain Int declared 293/293 variables, and 299 constraints, problems are : Problem set: 0 solved, 184 unsolved in 9375 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 0/0 constraints]
After SMT, in 17579ms problems are : Problem set: 0 solved, 184 unsolved
Search for dead transitions found 0 dead transitions in 17583ms
Starting structural reductions in LTL mode, iteration 1 : 105/153 places, 188/236 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17946 ms. Remains : 105/153 places, 188/236 transitions.
Stuttering acceptance computed with spot in 120 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N04-LTLFireability-13
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA UtilityControlRoom-PT-Z4T4N04-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z4T4N04-LTLFireability-13 finished in 18086 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 1 out of 153 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 153/153 places, 236/236 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 0 with 63 rules applied. Total rules applied 63 place count 153 transition count 173
Reduce places removed 63 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 79 rules applied. Total rules applied 142 place count 90 transition count 157
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 142 place count 90 transition count 141
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 174 place count 74 transition count 141
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 176 place count 72 transition count 109
Iterating global reduction 2 with 2 rules applied. Total rules applied 178 place count 72 transition count 109
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 186 place count 64 transition count 101
Iterating global reduction 2 with 8 rules applied. Total rules applied 194 place count 64 transition count 101
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 202 place count 56 transition count 85
Iterating global reduction 2 with 8 rules applied. Total rules applied 210 place count 56 transition count 85
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 217 place count 49 transition count 71
Iterating global reduction 2 with 7 rules applied. Total rules applied 224 place count 49 transition count 71
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 231 place count 49 transition count 64
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 263 place count 33 transition count 48
Applied a total of 263 rules in 25 ms. Remains 33 /153 variables (removed 120) and now considering 48/236 (removed 188) transitions.
// Phase 1: matrix 48 rows 33 cols
[2024-05-31 02:50:32] [INFO ] Computed 10 invariants in 1 ms
[2024-05-31 02:50:32] [INFO ] Implicit Places using invariants in 91 ms returned [24]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 92 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 32/153 places, 48/236 transitions.
Applied a total of 0 rules in 3 ms. Remains 32 /32 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 120 ms. Remains : 32/153 places, 48/236 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N04-LTLFireability-14
Product exploration explored 100000 steps with 1127 reset in 479 ms.
Stack based approach found an accepted trace after 169 steps with 3 reset with depth 12 and stack size 12 in 1 ms.
FORMULA UtilityControlRoom-PT-Z4T4N04-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z4T4N04-LTLFireability-14 finished in 666 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&X((p0&&F(p1)))))))'
Support contains 2 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 236/236 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 105 transition count 188
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 105 transition count 188
Applied a total of 96 rules in 2 ms. Remains 105 /153 variables (removed 48) and now considering 188/236 (removed 48) transitions.
// Phase 1: matrix 188 rows 105 cols
[2024-05-31 02:50:32] [INFO ] Computed 10 invariants in 2 ms
[2024-05-31 02:50:32] [INFO ] Implicit Places using invariants in 133 ms returned [76]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 134 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 104/153 places, 188/236 transitions.
Applied a total of 0 rules in 1 ms. Remains 104 /104 variables (removed 0) and now considering 188/188 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 139 ms. Remains : 104/153 places, 188/236 transitions.
Stuttering acceptance computed with spot in 178 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N04-LTLFireability-15
Product exploration explored 100000 steps with 600 reset in 176 ms.
Stack based approach found an accepted trace after 2828 steps with 18 reset with depth 327 and stack size 327 in 7 ms.
FORMULA UtilityControlRoom-PT-Z4T4N04-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z4T4N04-LTLFireability-15 finished in 521 ms.
All properties solved by simple procedures.
Total runtime 278998 ms.

BK_STOP 1717123833362

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="UtilityControlRoom-PT-Z4T4N04"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is UtilityControlRoom-PT-Z4T4N04, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r444-smll-171701111100252"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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