Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 28K Apr 13 05:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 144K Apr 13 05:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 35K Apr 13 05:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 155K Apr 13 05:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 23 08:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 49K Apr 23 08:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 17K Apr 23 08:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 59K Apr 23 08:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 51K Apr 13 05:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 256K Apr 13 05:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 82K Apr 13 05:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 333K Apr 13 05:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 23 08:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 8.4K Apr 23 08:04 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 8 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 116K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717272512403

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=UtilityControlRoom-PT-Z2T3N10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 20:08:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 20:08:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 20:08:34] [INFO ] Load time of PNML (sax parser for PT used): 111 ms
[2024-06-01 20:08:34] [INFO ] Transformed 174 places.
[2024-06-01 20:08:34] [INFO ] Transformed 270 transitions.
[2024-06-01 20:08:34] [INFO ] Parsed PT model containing 174 places and 270 transitions and 850 arcs in 270 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 23 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Ensure Unique test removed 40 transitions
Reduce redundant transitions removed 40 transitions.
FORMULA UtilityControlRoom-PT-Z2T3N10-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-PT-Z2T3N10-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-PT-Z2T3N10-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-PT-Z2T3N10-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 138 out of 174 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 230/230 transitions.
Applied a total of 0 rules in 15 ms. Remains 174 /174 variables (removed 0) and now considering 230/230 (removed 0) transitions.
// Phase 1: matrix 230 rows 174 cols
[2024-06-01 20:08:34] [INFO ] Computed 23 invariants in 26 ms
[2024-06-01 20:08:35] [INFO ] Implicit Places using invariants in 341 ms returned []
[2024-06-01 20:08:35] [INFO ] Invariant cache hit.
[2024-06-01 20:08:35] [INFO ] Implicit Places using invariants and state equation in 266 ms returned []
Implicit Place search using SMT with State Equation took 656 ms to find 0 implicit places.
Running 220 sub problems to find dead transitions.
[2024-06-01 20:08:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/164 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/164 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (OVERLAPS) 10/174 variables, 21/23 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/174 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (OVERLAPS) 230/404 variables, 174/197 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/404 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 6 (OVERLAPS) 0/404 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 220 unsolved
No progress, stopping.
After SMT solving in domain Real declared 404/404 variables, and 197 constraints, problems are : Problem set: 0 solved, 220 unsolved in 8886 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 174/174 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 220 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/164 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/164 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (OVERLAPS) 10/174 variables, 21/23 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/174 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (OVERLAPS) 230/404 variables, 174/197 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/404 variables, 220/417 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/404 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 7 (OVERLAPS) 0/404 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 220 unsolved
No progress, stopping.
After SMT solving in domain Int declared 404/404 variables, and 417 constraints, problems are : Problem set: 0 solved, 220 unsolved in 10252 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 174/174 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 0/0 constraints]
After SMT, in 19469ms problems are : Problem set: 0 solved, 220 unsolved
Search for dead transitions found 0 dead transitions in 19538ms
Finished structural reductions in LTL mode , in 1 iterations and 20245 ms. Remains : 174/174 places, 230/230 transitions.
Support contains 138 out of 174 places after structural reductions.
[2024-06-01 20:08:55] [INFO ] Flatten gal took : 66 ms
[2024-06-01 20:08:55] [INFO ] Flatten gal took : 36 ms
[2024-06-01 20:08:55] [INFO ] Input system was already deterministic with 230 transitions.
RANDOM walk for 40000 steps (8 resets) in 2249 ms. (17 steps per ms) remains 6/23 properties
BEST_FIRST walk for 40004 steps (8 resets) in 206 ms. (193 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 167 ms. (238 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (8 resets) in 149 ms. (266 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 128 ms. (310 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 91 ms. (434 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 98 ms. (404 steps per ms) remains 5/5 properties
[2024-06-01 20:08:56] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp21 is UNSAT
After SMT solving in domain Real declared 158/404 variables, and 15 constraints, problems are : Problem set: 5 solved, 0 unsolved in 97 ms.
Refiners :[Positive P Invariants (semi-flows): 15/23 constraints, State Equation: 0/174 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 118ms problems are : Problem set: 5 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 5 atomic propositions for a total of 12 simplifications.
FORMULA UtilityControlRoom-PT-Z2T3N10-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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' '!(((G(p0) U p1)&&G(F(!p1))))'
Support contains 22 out of 174 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 174/174 places, 230/230 transitions.
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 174 transition count 190
Reduce places removed 40 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 1 with 60 rules applied. Total rules applied 100 place count 134 transition count 170
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 100 place count 134 transition count 150
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 140 place count 114 transition count 150
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 160 place count 104 transition count 140
Applied a total of 160 rules in 45 ms. Remains 104 /174 variables (removed 70) and now considering 140/230 (removed 90) transitions.
// Phase 1: matrix 140 rows 104 cols
[2024-06-01 20:08:56] [INFO ] Computed 23 invariants in 6 ms
[2024-06-01 20:08:57] [INFO ] Implicit Places using invariants in 165 ms returned [62, 63]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 168 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 102/174 places, 140/230 transitions.
Applied a total of 0 rules in 9 ms. Remains 102 /102 variables (removed 0) and now considering 140/140 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 222 ms. Remains : 102/174 places, 140/230 transitions.
Stuttering acceptance computed with spot in 380 ms :[true, true, (NOT p0), (NOT p1), p1, p1]
Running random walk in product with property : UtilityControlRoom-PT-Z2T3N10-LTLCardinality-00
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 2 ms.
FORMULA UtilityControlRoom-PT-Z2T3N10-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z2T3N10-LTLCardinality-00 finished in 689 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 30 out of 174 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 174/174 places, 230/230 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 174 transition count 190
Reduce places removed 40 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 1 with 60 rules applied. Total rules applied 100 place count 134 transition count 170
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 101 place count 133 transition count 150
Iterating global reduction 2 with 1 rules applied. Total rules applied 102 place count 133 transition count 150
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 112 place count 123 transition count 140
Iterating global reduction 2 with 10 rules applied. Total rules applied 122 place count 123 transition count 140
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 21 rules applied. Total rules applied 143 place count 112 transition count 130
Applied a total of 143 rules in 37 ms. Remains 112 /174 variables (removed 62) and now considering 130/230 (removed 100) transitions.
// Phase 1: matrix 130 rows 112 cols
[2024-06-01 20:08:57] [INFO ] Computed 22 invariants in 1 ms
[2024-06-01 20:08:57] [INFO ] Implicit Places using invariants in 76 ms returned [81]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 77 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 111/174 places, 130/230 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 20 place count 101 transition count 120
Applied a total of 20 rules in 11 ms. Remains 101 /111 variables (removed 10) and now considering 120/130 (removed 10) transitions.
// Phase 1: matrix 120 rows 101 cols
[2024-06-01 20:08:57] [INFO ] Computed 21 invariants in 1 ms
[2024-06-01 20:08:57] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-06-01 20:08:57] [INFO ] Invariant cache hit.
[2024-06-01 20:08:57] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 101/174 places, 120/230 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 313 ms. Remains : 101/174 places, 120/230 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z2T3N10-LTLCardinality-02
Product exploration explored 100000 steps with 0 reset in 877 ms.
Stack based approach found an accepted trace after 5816 steps with 0 reset with depth 5817 and stack size 5817 in 26 ms.
FORMULA UtilityControlRoom-PT-Z2T3N10-LTLCardinality-02 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z2T3N10-LTLCardinality-02 finished in 1272 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 71 out of 174 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 230/230 transitions.
Applied a total of 0 rules in 3 ms. Remains 174 /174 variables (removed 0) and now considering 230/230 (removed 0) transitions.
// Phase 1: matrix 230 rows 174 cols
[2024-06-01 20:08:58] [INFO ] Computed 23 invariants in 2 ms
[2024-06-01 20:08:58] [INFO ] Implicit Places using invariants in 118 ms returned [123]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 122 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 173/174 places, 230/230 transitions.
Applied a total of 0 rules in 12 ms. Remains 173 /173 variables (removed 0) and now considering 230/230 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 137 ms. Remains : 173/174 places, 230/230 transitions.
Stuttering acceptance computed with spot in 90 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z2T3N10-LTLCardinality-03
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-PT-Z2T3N10-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z2T3N10-LTLCardinality-03 finished in 244 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0&&X(X(p1)))))))'
Support contains 21 out of 174 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 230/230 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 154 transition count 210
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 154 transition count 210
Applied a total of 40 rules in 6 ms. Remains 154 /174 variables (removed 20) and now considering 210/230 (removed 20) transitions.
// Phase 1: matrix 210 rows 154 cols
[2024-06-01 20:08:58] [INFO ] Computed 23 invariants in 6 ms
[2024-06-01 20:08:59] [INFO ] Implicit Places using invariants in 159 ms returned []
[2024-06-01 20:08:59] [INFO ] Invariant cache hit.
[2024-06-01 20:08:59] [INFO ] Implicit Places using invariants and state equation in 233 ms returned []
Implicit Place search using SMT with State Equation took 395 ms to find 0 implicit places.
Running 200 sub problems to find dead transitions.
[2024-06-01 20:08:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/144 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 10/154 variables, 21/23 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (OVERLAPS) 210/364 variables, 154/177 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/364 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (OVERLAPS) 0/364 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Real declared 364/364 variables, and 177 constraints, problems are : Problem set: 0 solved, 200 unsolved in 6657 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 154/154 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/144 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/144 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 10/154 variables, 21/23 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (OVERLAPS) 210/364 variables, 154/177 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/364 variables, 200/377 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/364 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 7 (OVERLAPS) 0/364 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Int declared 364/364 variables, and 377 constraints, problems are : Problem set: 0 solved, 200 unsolved in 9184 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints]
After SMT, in 16013ms problems are : Problem set: 0 solved, 200 unsolved
Search for dead transitions found 0 dead transitions in 16021ms
Starting structural reductions in LTL mode, iteration 1 : 154/174 places, 210/230 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16424 ms. Remains : 154/174 places, 210/230 transitions.
Stuttering acceptance computed with spot in 240 ms :[(NOT p1), (NOT p1), (NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : UtilityControlRoom-PT-Z2T3N10-LTLCardinality-04
Product exploration explored 100000 steps with 0 reset in 283 ms.
Stack based approach found an accepted trace after 24271 steps with 0 reset with depth 24272 and stack size 13679 in 141 ms.
FORMULA UtilityControlRoom-PT-Z2T3N10-LTLCardinality-04 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z2T3N10-LTLCardinality-04 finished in 17108 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&X(F(p1)))))'
Support contains 30 out of 174 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 230/230 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 154 transition count 210
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 154 transition count 210
Applied a total of 40 rules in 5 ms. Remains 154 /174 variables (removed 20) and now considering 210/230 (removed 20) transitions.
[2024-06-01 20:09:16] [INFO ] Invariant cache hit.
[2024-06-01 20:09:16] [INFO ] Implicit Places using invariants in 128 ms returned [103]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 130 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 153/174 places, 210/230 transitions.
Applied a total of 0 rules in 2 ms. Remains 153 /153 variables (removed 0) and now considering 210/210 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 137 ms. Remains : 153/174 places, 210/230 transitions.
Stuttering acceptance computed with spot in 151 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : UtilityControlRoom-PT-Z2T3N10-LTLCardinality-07
Product exploration explored 100000 steps with 5482 reset in 289 ms.
Product exploration explored 100000 steps with 5430 reset in 302 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X p1)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 87 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 145 steps (0 resets) in 5 ms. (24 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X p1)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 106 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 110 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0), (NOT p0)]
// Phase 1: matrix 210 rows 153 cols
[2024-06-01 20:09:17] [INFO ] Computed 22 invariants in 2 ms
[2024-06-01 20:09:17] [INFO ] [Real]Absence check using 22 positive place invariants in 17 ms returned sat
[2024-06-01 20:09:17] [INFO ] [Real]Absence check using state equation in 126 ms returned sat
[2024-06-01 20:09:17] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 20:09:17] [INFO ] [Nat]Absence check using 22 positive place invariants in 13 ms returned sat
[2024-06-01 20:09:18] [INFO ] [Nat]Absence check using state equation in 136 ms returned sat
[2024-06-01 20:09:18] [INFO ] Computed and/alt/rep : 200/310/200 causal constraints (skipped 0 transitions) in 18 ms.
[2024-06-01 20:09:18] [INFO ] Added : 56 causal constraints over 12 iterations in 242 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 10 out of 153 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 210/210 transitions.
Applied a total of 0 rules in 2 ms. Remains 153 /153 variables (removed 0) and now considering 210/210 (removed 0) transitions.
[2024-06-01 20:09:18] [INFO ] Invariant cache hit.
[2024-06-01 20:09:18] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-06-01 20:09:18] [INFO ] Invariant cache hit.
[2024-06-01 20:09:18] [INFO ] Implicit Places using invariants and state equation in 177 ms returned []
Implicit Place search using SMT with State Equation took 269 ms to find 0 implicit places.
Running 200 sub problems to find dead transitions.
[2024-06-01 20:09:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 10/153 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (OVERLAPS) 210/363 variables, 153/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/363 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (OVERLAPS) 0/363 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Real declared 363/363 variables, and 175 constraints, problems are : Problem set: 0 solved, 200 unsolved in 6732 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 10/153 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (OVERLAPS) 210/363 variables, 153/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/363 variables, 200/375 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/363 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 7 (OVERLAPS) 0/363 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Int declared 363/363 variables, and 375 constraints, problems are : Problem set: 0 solved, 200 unsolved in 8867 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints]
After SMT, in 15733ms problems are : Problem set: 0 solved, 200 unsolved
Search for dead transitions found 0 dead transitions in 15737ms
Finished structural reductions in LTL mode , in 1 iterations and 16009 ms. Remains : 153/153 places, 210/210 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 (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 76 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 128 steps (0 resets) in 6 ms. (18 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 94 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-06-01 20:09:34] [INFO ] Invariant cache hit.
[2024-06-01 20:09:35] [INFO ] [Real]Absence check using 22 positive place invariants in 14 ms returned sat
[2024-06-01 20:09:35] [INFO ] [Real]Absence check using state equation in 107 ms returned sat
[2024-06-01 20:09:35] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 20:09:35] [INFO ] [Nat]Absence check using 22 positive place invariants in 13 ms returned sat
[2024-06-01 20:09:35] [INFO ] [Nat]Absence check using state equation in 121 ms returned sat
[2024-06-01 20:09:35] [INFO ] Computed and/alt/rep : 200/310/200 causal constraints (skipped 0 transitions) in 17 ms.
[2024-06-01 20:09:35] [INFO ] Added : 74 causal constraints over 15 iterations in 258 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2934 reset in 215 ms.
Product exploration explored 100000 steps with 2944 reset in 237 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 10 out of 153 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 153/153 places, 210/210 transitions.
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 20 Pre rules applied. Total rules applied 0 place count 153 transition count 230
Deduced a syphon composed of 20 places in 0 ms
Iterating global reduction 0 with 20 rules applied. Total rules applied 20 place count 153 transition count 230
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 50 places in 0 ms
Iterating global reduction 0 with 30 rules applied. Total rules applied 50 place count 153 transition count 240
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 70 place count 153 transition count 220
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 71 place count 152 transition count 200
Deduced a syphon composed of 50 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 72 place count 152 transition count 200
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 82 place count 142 transition count 190
Deduced a syphon composed of 50 places in 0 ms
Iterating global reduction 1 with 10 rules applied. Total rules applied 92 place count 142 transition count 190
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 112 place count 122 transition count 150
Deduced a syphon composed of 40 places in 0 ms
Iterating global reduction 1 with 20 rules applied. Total rules applied 132 place count 122 transition count 150
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 152 place count 102 transition count 130
Deduced a syphon composed of 30 places in 0 ms
Iterating global reduction 1 with 20 rules applied. Total rules applied 172 place count 102 transition count 130
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 192 place count 102 transition count 110
Deduced a syphon composed of 30 places in 0 ms
Applied a total of 192 rules in 37 ms. Remains 102 /153 variables (removed 51) and now considering 110/210 (removed 100) transitions.
[2024-06-01 20:09:36] [INFO ] Redundant transitions in 3 ms returned []
Running 100 sub problems to find dead transitions.
// Phase 1: matrix 110 rows 102 cols
[2024-06-01 20:09:36] [INFO ] Computed 22 invariants in 0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (OVERLAPS) 10/102 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 100 unsolved
[2024-06-01 20:09:37] [INFO ] Deduced a trap composed of 5 places in 178 ms of which 11 ms to minimize.
[2024-06-01 20:09:37] [INFO ] Deduced a trap composed of 5 places in 67 ms of which 2 ms to minimize.
[2024-06-01 20:09:37] [INFO ] Deduced a trap composed of 5 places in 53 ms of which 1 ms to minimize.
[2024-06-01 20:09:37] [INFO ] Deduced a trap composed of 5 places in 45 ms of which 1 ms to minimize.
[2024-06-01 20:09:37] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 2 ms to minimize.
[2024-06-01 20:09:37] [INFO ] Deduced a trap composed of 5 places in 45 ms of which 2 ms to minimize.
Problem TDEAD9 is UNSAT
[2024-06-01 20:09:37] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 1 ms to minimize.
[2024-06-01 20:09:37] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 1 ms to minimize.
Problem TDEAD20 is UNSAT
[2024-06-01 20:09:37] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 1 ms to minimize.
Problem TDEAD21 is UNSAT
[2024-06-01 20:09:37] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 0 ms to minimize.
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 10/32 constraints. Problems are: Problem set: 40 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/32 constraints. Problems are: Problem set: 40 solved, 60 unsolved
At refinement iteration 5 (OVERLAPS) 110/212 variables, 102/134 constraints. Problems are: Problem set: 40 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/212 variables, 0/134 constraints. Problems are: Problem set: 40 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 0/212 variables, 0/134 constraints. Problems are: Problem set: 40 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 212/212 variables, and 134 constraints, problems are : Problem set: 40 solved, 60 unsolved in 2621 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 102/102 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 40 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 40 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 40/102 variables, 22/22 constraints. Problems are: Problem set: 40 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 10/32 constraints. Problems are: Problem set: 40 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 0/32 constraints. Problems are: Problem set: 40 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 110/212 variables, 102/134 constraints. Problems are: Problem set: 40 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/212 variables, 60/194 constraints. Problems are: Problem set: 40 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/212 variables, 0/194 constraints. Problems are: Problem set: 40 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 0/212 variables, 0/194 constraints. Problems are: Problem set: 40 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 212/212 variables, and 194 constraints, problems are : Problem set: 40 solved, 60 unsolved in 1651 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 102/102 constraints, PredecessorRefiner: 60/100 constraints, Known Traps: 10/10 constraints]
After SMT, in 4291ms problems are : Problem set: 40 solved, 60 unsolved
Search for dead transitions found 40 dead transitions in 4293ms
Found 40 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 40 transitions
Dead transitions reduction (with SMT) removed 40 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 102/153 places, 70/210 transitions.
Graph (complete) has 130 edges and 102 vertex of which 72 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.1 ms
Discarding 30 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 5 ms. Remains 72 /102 variables (removed 30) and now considering 70/70 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 72/153 places, 70/210 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4344 ms. Remains : 72/153 places, 70/210 transitions.
Support contains 10 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 210/210 transitions.
Applied a total of 0 rules in 2 ms. Remains 153 /153 variables (removed 0) and now considering 210/210 (removed 0) transitions.
// Phase 1: matrix 210 rows 153 cols
[2024-06-01 20:09:40] [INFO ] Computed 22 invariants in 2 ms
[2024-06-01 20:09:41] [INFO ] Implicit Places using invariants in 125 ms returned []
[2024-06-01 20:09:41] [INFO ] Invariant cache hit.
[2024-06-01 20:09:41] [INFO ] Implicit Places using invariants and state equation in 212 ms returned []
Implicit Place search using SMT with State Equation took 339 ms to find 0 implicit places.
Running 200 sub problems to find dead transitions.
[2024-06-01 20:09:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 10/153 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (OVERLAPS) 210/363 variables, 153/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/363 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (OVERLAPS) 0/363 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Real declared 363/363 variables, and 175 constraints, problems are : Problem set: 0 solved, 200 unsolved in 6792 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 10/153 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (OVERLAPS) 210/363 variables, 153/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/363 variables, 200/375 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/363 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 7 (OVERLAPS) 0/363 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Int declared 363/363 variables, and 375 constraints, problems are : Problem set: 0 solved, 200 unsolved in 8798 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints]
After SMT, in 15704ms problems are : Problem set: 0 solved, 200 unsolved
Search for dead transitions found 0 dead transitions in 15708ms
Finished structural reductions in LTL mode , in 1 iterations and 16049 ms. Remains : 153/153 places, 210/210 transitions.
Treatment of property UtilityControlRoom-PT-Z2T3N10-LTLCardinality-07 finished in 41059 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)||F(p1)))'
Support contains 4 out of 174 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 174/174 places, 230/230 transitions.
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 38 place count 174 transition count 192
Reduce places removed 38 places and 0 transitions.
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 1 with 57 rules applied. Total rules applied 95 place count 136 transition count 173
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 95 place count 136 transition count 154
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 133 place count 117 transition count 154
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 134 place count 116 transition count 153
Iterating global reduction 2 with 1 rules applied. Total rules applied 135 place count 116 transition count 153
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 155 place count 106 transition count 143
Applied a total of 155 rules in 18 ms. Remains 106 /174 variables (removed 68) and now considering 143/230 (removed 87) transitions.
// Phase 1: matrix 143 rows 106 cols
[2024-06-01 20:09:57] [INFO ] Computed 23 invariants in 1 ms
[2024-06-01 20:09:57] [INFO ] Implicit Places using invariants in 98 ms returned [55]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 99 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 105/174 places, 143/230 transitions.
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 0 with 38 rules applied. Total rules applied 38 place count 86 transition count 124
Applied a total of 38 rules in 8 ms. Remains 86 /105 variables (removed 19) and now considering 124/143 (removed 19) transitions.
// Phase 1: matrix 124 rows 86 cols
[2024-06-01 20:09:57] [INFO ] Computed 22 invariants in 0 ms
[2024-06-01 20:09:57] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-06-01 20:09:57] [INFO ] Invariant cache hit.
[2024-06-01 20:09:57] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 211 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 86/174 places, 124/230 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 336 ms. Remains : 86/174 places, 124/230 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : UtilityControlRoom-PT-Z2T3N10-LTLCardinality-09
Product exploration explored 100000 steps with 5373 reset in 242 ms.
Stack based approach found an accepted trace after 2273 steps with 121 reset with depth 7 and stack size 7 in 6 ms.
FORMULA UtilityControlRoom-PT-Z2T3N10-LTLCardinality-09 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z2T3N10-LTLCardinality-09 finished in 671 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 174 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 230/230 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 154 transition count 210
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 154 transition count 210
Applied a total of 40 rules in 4 ms. Remains 154 /174 variables (removed 20) and now considering 210/230 (removed 20) transitions.
// Phase 1: matrix 210 rows 154 cols
[2024-06-01 20:09:57] [INFO ] Computed 23 invariants in 2 ms
[2024-06-01 20:09:57] [INFO ] Implicit Places using invariants in 132 ms returned [103]
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 : 153/174 places, 210/230 transitions.
Applied a total of 0 rules in 5 ms. Remains 153 /153 variables (removed 0) and now considering 210/210 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 145 ms. Remains : 153/174 places, 210/230 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z2T3N10-LTLCardinality-10
Product exploration explored 100000 steps with 50000 reset in 124 ms.
Product exploration explored 100000 steps with 50000 reset in 140 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 13 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA UtilityControlRoom-PT-Z2T3N10-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-PT-Z2T3N10-LTLCardinality-10 finished in 510 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0 U X((p1||F(p0))))))'
Support contains 2 out of 174 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 230/230 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 154 transition count 210
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 154 transition count 210
Applied a total of 40 rules in 5 ms. Remains 154 /174 variables (removed 20) and now considering 210/230 (removed 20) transitions.
[2024-06-01 20:09:58] [INFO ] Invariant cache hit.
[2024-06-01 20:09:58] [INFO ] Implicit Places using invariants in 115 ms returned []
[2024-06-01 20:09:58] [INFO ] Invariant cache hit.
[2024-06-01 20:09:58] [INFO ] Implicit Places using invariants and state equation in 212 ms returned []
Implicit Place search using SMT with State Equation took 328 ms to find 0 implicit places.
Running 200 sub problems to find dead transitions.
[2024-06-01 20:09:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/144 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 10/154 variables, 21/23 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (OVERLAPS) 210/364 variables, 154/177 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/364 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (OVERLAPS) 0/364 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Real declared 364/364 variables, and 177 constraints, problems are : Problem set: 0 solved, 200 unsolved in 6616 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 154/154 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/144 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/144 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 10/154 variables, 21/23 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (OVERLAPS) 210/364 variables, 154/177 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/364 variables, 200/377 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/364 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 7 (OVERLAPS) 0/364 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Int declared 364/364 variables, and 377 constraints, problems are : Problem set: 0 solved, 200 unsolved in 9222 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints]
After SMT, in 15965ms problems are : Problem set: 0 solved, 200 unsolved
Search for dead transitions found 0 dead transitions in 15968ms
Starting structural reductions in LTL mode, iteration 1 : 154/174 places, 210/230 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16303 ms. Remains : 154/174 places, 210/230 transitions.
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z2T3N10-LTLCardinality-12
Product exploration explored 100000 steps with 26 reset in 215 ms.
Product exploration explored 100000 steps with 0 reset in 262 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 (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 85 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 179 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
RANDOM walk for 16 steps (0 resets) in 4 ms. (3 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F p1), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 5 factoid took 160 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
[2024-06-01 20:10:15] [INFO ] Invariant cache hit.
[2024-06-01 20:10:16] [INFO ] [Real]Absence check using 23 positive place invariants in 20 ms returned sat
[2024-06-01 20:10:16] [INFO ] [Real]Absence check using state equation in 167 ms returned sat
[2024-06-01 20:10:16] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 20:10:16] [INFO ] [Nat]Absence check using 23 positive place invariants in 15 ms returned sat
[2024-06-01 20:10:16] [INFO ] [Nat]Absence check using state equation in 144 ms returned sat
[2024-06-01 20:10:16] [INFO ] Computed and/alt/rep : 180/270/180 causal constraints (skipped 20 transitions) in 17 ms.
[2024-06-01 20:10:16] [INFO ] Added : 20 causal constraints over 5 iterations in 110 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 2 out of 154 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 154/154 places, 210/210 transitions.
Applied a total of 0 rules in 3 ms. Remains 154 /154 variables (removed 0) and now considering 210/210 (removed 0) transitions.
[2024-06-01 20:10:16] [INFO ] Invariant cache hit.
[2024-06-01 20:10:16] [INFO ] Implicit Places using invariants in 106 ms returned []
[2024-06-01 20:10:16] [INFO ] Invariant cache hit.
[2024-06-01 20:10:17] [INFO ] Implicit Places using invariants and state equation in 227 ms returned []
Implicit Place search using SMT with State Equation took 335 ms to find 0 implicit places.
Running 200 sub problems to find dead transitions.
[2024-06-01 20:10:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/144 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 10/154 variables, 21/23 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (OVERLAPS) 210/364 variables, 154/177 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/364 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (OVERLAPS) 0/364 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Real declared 364/364 variables, and 177 constraints, problems are : Problem set: 0 solved, 200 unsolved in 6657 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 154/154 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/144 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/144 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 10/154 variables, 21/23 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (OVERLAPS) 210/364 variables, 154/177 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/364 variables, 200/377 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/364 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 7 (OVERLAPS) 0/364 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Int declared 364/364 variables, and 377 constraints, problems are : Problem set: 0 solved, 200 unsolved in 9295 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints]
After SMT, in 16061ms problems are : Problem set: 0 solved, 200 unsolved
Search for dead transitions found 0 dead transitions in 16064ms
Finished structural reductions in LTL mode , in 1 iterations and 16403 ms. Remains : 154/154 places, 210/210 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 130 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 118 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
RANDOM walk for 14 steps (0 resets) in 4 ms. (2 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F p1), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 5 factoid took 170 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
[2024-06-01 20:10:33] [INFO ] Invariant cache hit.
[2024-06-01 20:10:33] [INFO ] [Real]Absence check using 23 positive place invariants in 16 ms returned sat
[2024-06-01 20:10:34] [INFO ] [Real]Absence check using state equation in 172 ms returned sat
[2024-06-01 20:10:34] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 20:10:34] [INFO ] [Nat]Absence check using 23 positive place invariants in 14 ms returned sat
[2024-06-01 20:10:34] [INFO ] [Nat]Absence check using state equation in 145 ms returned sat
[2024-06-01 20:10:34] [INFO ] Computed and/alt/rep : 180/270/180 causal constraints (skipped 20 transitions) in 20 ms.
[2024-06-01 20:10:34] [INFO ] Added : 20 causal constraints over 5 iterations in 112 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Product exploration explored 100000 steps with 3 reset in 210 ms.
Product exploration explored 100000 steps with 28 reset in 263 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Support contains 2 out of 154 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 154/154 places, 210/210 transitions.
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 20 Pre rules applied. Total rules applied 0 place count 154 transition count 230
Deduced a syphon composed of 20 places in 0 ms
Iterating global reduction 0 with 20 rules applied. Total rules applied 20 place count 154 transition count 230
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 50 places in 0 ms
Iterating global reduction 0 with 30 rules applied. Total rules applied 50 place count 154 transition count 240
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 70 place count 154 transition count 220
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 71 place count 153 transition count 200
Deduced a syphon composed of 50 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 72 place count 153 transition count 200
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 82 place count 143 transition count 190
Deduced a syphon composed of 50 places in 0 ms
Iterating global reduction 1 with 10 rules applied. Total rules applied 92 place count 143 transition count 190
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 112 place count 123 transition count 150
Deduced a syphon composed of 40 places in 0 ms
Iterating global reduction 1 with 20 rules applied. Total rules applied 132 place count 123 transition count 150
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 152 place count 103 transition count 130
Deduced a syphon composed of 30 places in 0 ms
Iterating global reduction 1 with 20 rules applied. Total rules applied 172 place count 103 transition count 130
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 192 place count 103 transition count 110
Deduced a syphon composed of 30 places in 0 ms
Applied a total of 192 rules in 43 ms. Remains 103 /154 variables (removed 51) and now considering 110/210 (removed 100) transitions.
[2024-06-01 20:10:35] [INFO ] Redundant transitions in 2 ms returned []
Running 100 sub problems to find dead transitions.
// Phase 1: matrix 110 rows 103 cols
[2024-06-01 20:10:35] [INFO ] Computed 23 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (OVERLAPS) 10/103 variables, 21/23 constraints. Problems are: Problem set: 0 solved, 100 unsolved
[2024-06-01 20:10:36] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 2 ms to minimize.
Problem TDEAD2 is UNSAT
[2024-06-01 20:10:36] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-06-01 20:10:36] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 1 ms to minimize.
[2024-06-01 20:10:36] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 0 ms to minimize.
[2024-06-01 20:10:36] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 1 ms to minimize.
[2024-06-01 20:10:36] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 1 ms to minimize.
[2024-06-01 20:10:36] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 0 ms to minimize.
[2024-06-01 20:10:36] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 1 ms to minimize.
[2024-06-01 20:10:36] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 1 ms to minimize.
[2024-06-01 20:10:36] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 1 ms to minimize.
[2024-06-01 20:10:36] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 0 ms to minimize.
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 11/34 constraints. Problems are: Problem set: 40 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/34 constraints. Problems are: Problem set: 40 solved, 60 unsolved
At refinement iteration 5 (OVERLAPS) 110/213 variables, 103/137 constraints. Problems are: Problem set: 40 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/213 variables, 0/137 constraints. Problems are: Problem set: 40 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 0/213 variables, 0/137 constraints. Problems are: Problem set: 40 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 213/213 variables, and 137 constraints, problems are : Problem set: 40 solved, 60 unsolved in 2331 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 40 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 1/1 constraints. Problems are: Problem set: 40 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 0/1 constraints. Problems are: Problem set: 40 solved, 60 unsolved
At refinement iteration 2 (OVERLAPS) 40/103 variables, 23/24 constraints. Problems are: Problem set: 40 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 10/34 constraints. Problems are: Problem set: 40 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/34 constraints. Problems are: Problem set: 40 solved, 60 unsolved
At refinement iteration 5 (OVERLAPS) 110/213 variables, 103/137 constraints. Problems are: Problem set: 40 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/213 variables, 60/197 constraints. Problems are: Problem set: 40 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/213 variables, 0/197 constraints. Problems are: Problem set: 40 solved, 60 unsolved
At refinement iteration 8 (OVERLAPS) 0/213 variables, 0/197 constraints. Problems are: Problem set: 40 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 213/213 variables, and 197 constraints, problems are : Problem set: 40 solved, 60 unsolved in 1805 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 60/100 constraints, Known Traps: 11/11 constraints]
After SMT, in 4168ms problems are : Problem set: 40 solved, 60 unsolved
Search for dead transitions found 40 dead transitions in 4171ms
Found 40 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 40 transitions
Dead transitions reduction (with SMT) removed 40 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 103/154 places, 70/210 transitions.
Graph (complete) has 151 edges and 103 vertex of which 73 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 3 ms. Remains 73 /103 variables (removed 30) and now considering 70/70 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 73/154 places, 70/210 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4226 ms. Remains : 73/154 places, 70/210 transitions.
Support contains 2 out of 154 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 154/154 places, 210/210 transitions.
Applied a total of 0 rules in 6 ms. Remains 154 /154 variables (removed 0) and now considering 210/210 (removed 0) transitions.
// Phase 1: matrix 210 rows 154 cols
[2024-06-01 20:10:39] [INFO ] Computed 23 invariants in 2 ms
[2024-06-01 20:10:39] [INFO ] Implicit Places using invariants in 107 ms returned []
[2024-06-01 20:10:39] [INFO ] Invariant cache hit.
[2024-06-01 20:10:39] [INFO ] Implicit Places using invariants and state equation in 205 ms returned []
Implicit Place search using SMT with State Equation took 337 ms to find 0 implicit places.
Running 200 sub problems to find dead transitions.
[2024-06-01 20:10:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/144 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 10/154 variables, 21/23 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (OVERLAPS) 210/364 variables, 154/177 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/364 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (OVERLAPS) 0/364 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Real declared 364/364 variables, and 177 constraints, problems are : Problem set: 0 solved, 200 unsolved in 6721 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 154/154 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/144 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/144 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 10/154 variables, 21/23 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (OVERLAPS) 210/364 variables, 154/177 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/364 variables, 200/377 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/364 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 7 (OVERLAPS) 0/364 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Int declared 364/364 variables, and 377 constraints, problems are : Problem set: 0 solved, 200 unsolved in 8968 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints]
After SMT, in 15811ms problems are : Problem set: 0 solved, 200 unsolved
Search for dead transitions found 0 dead transitions in 15813ms
Finished structural reductions in LTL mode , in 1 iterations and 16158 ms. Remains : 154/154 places, 210/210 transitions.
Treatment of property UtilityControlRoom-PT-Z2T3N10-LTLCardinality-12 finished in 57489 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(p0)) U p0)))'
Support contains 2 out of 174 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 174/174 places, 230/230 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 38 place count 174 transition count 192
Reduce places removed 38 places and 0 transitions.
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 1 with 57 rules applied. Total rules applied 95 place count 136 transition count 173
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 95 place count 136 transition count 154
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 133 place count 117 transition count 154
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 134 place count 116 transition count 153
Iterating global reduction 2 with 1 rules applied. Total rules applied 135 place count 116 transition count 153
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 175 place count 96 transition count 133
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 176 place count 96 transition count 132
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 177 place count 95 transition count 112
Ensure Unique test removed 1 places
Iterating global reduction 2 with 2 rules applied. Total rules applied 179 place count 94 transition count 112
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 189 place count 84 transition count 102
Iterating global reduction 2 with 10 rules applied. Total rules applied 199 place count 84 transition count 102
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 209 place count 74 transition count 82
Iterating global reduction 2 with 10 rules applied. Total rules applied 219 place count 74 transition count 82
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 228 place count 65 transition count 73
Iterating global reduction 2 with 9 rules applied. Total rules applied 237 place count 65 transition count 73
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 246 place count 65 transition count 64
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 262 place count 57 transition count 56
Applied a total of 262 rules in 27 ms. Remains 57 /174 variables (removed 117) and now considering 56/230 (removed 174) transitions.
// Phase 1: matrix 56 rows 57 cols
[2024-06-01 20:10:55] [INFO ] Computed 22 invariants in 1 ms
[2024-06-01 20:10:55] [INFO ] Implicit Places using invariants in 73 ms returned [26]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 74 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 56/174 places, 56/230 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 20 place count 46 transition count 46
Applied a total of 20 rules in 3 ms. Remains 46 /56 variables (removed 10) and now considering 46/56 (removed 10) transitions.
// Phase 1: matrix 46 rows 46 cols
[2024-06-01 20:10:55] [INFO ] Computed 21 invariants in 1 ms
[2024-06-01 20:10:55] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-06-01 20:10:55] [INFO ] Invariant cache hit.
[2024-06-01 20:10:56] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 46/174 places, 46/230 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 254 ms. Remains : 46/174 places, 46/230 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z2T3N10-LTLCardinality-13
Product exploration explored 100000 steps with 0 reset in 185 ms.
Stack based approach found an accepted trace after 14 steps with 0 reset with depth 15 and stack size 15 in 0 ms.
FORMULA UtilityControlRoom-PT-Z2T3N10-LTLCardinality-13 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z2T3N10-LTLCardinality-13 finished in 498 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 174 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 230/230 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 154 transition count 210
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 154 transition count 210
Applied a total of 40 rules in 10 ms. Remains 154 /174 variables (removed 20) and now considering 210/230 (removed 20) transitions.
// Phase 1: matrix 210 rows 154 cols
[2024-06-01 20:10:56] [INFO ] Computed 23 invariants in 2 ms
[2024-06-01 20:10:56] [INFO ] Implicit Places using invariants in 139 ms returned [103]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 141 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 153/174 places, 210/230 transitions.
Applied a total of 0 rules in 2 ms. Remains 153 /153 variables (removed 0) and now considering 210/210 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 153 ms. Remains : 153/174 places, 210/230 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z2T3N10-LTLCardinality-14
Product exploration explored 100000 steps with 7402 reset in 191 ms.
Product exploration explored 100000 steps with 7302 reset in 217 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 1 factoid took 155 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 66 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 33 steps (0 resets) in 4 ms. (6 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 172 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 66 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
// Phase 1: matrix 210 rows 153 cols
[2024-06-01 20:10:57] [INFO ] Computed 22 invariants in 4 ms
[2024-06-01 20:10:57] [INFO ] [Real]Absence check using 22 positive place invariants in 9 ms returned unsat
Proved EG (NOT p0)
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 1 factoid took 190 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA UtilityControlRoom-PT-Z2T3N10-LTLCardinality-14 FALSE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-PT-Z2T3N10-LTLCardinality-14 finished in 1517 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(p0)))'
Support contains 4 out of 174 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 230/230 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 154 transition count 210
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 154 transition count 210
Applied a total of 40 rules in 3 ms. Remains 154 /174 variables (removed 20) and now considering 210/230 (removed 20) transitions.
// Phase 1: matrix 210 rows 154 cols
[2024-06-01 20:10:57] [INFO ] Computed 23 invariants in 2 ms
[2024-06-01 20:10:57] [INFO ] Implicit Places using invariants in 117 ms returned [103]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 118 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 153/174 places, 210/230 transitions.
Applied a total of 0 rules in 1 ms. Remains 153 /153 variables (removed 0) and now considering 210/210 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 123 ms. Remains : 153/174 places, 210/230 transitions.
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z2T3N10-LTLCardinality-15
Entered a terminal (fully accepting) state of product in 41 steps with 13 reset in 0 ms.
FORMULA UtilityControlRoom-PT-Z2T3N10-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z2T3N10-LTLCardinality-15 finished in 247 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&X(F(p1)))))'
Found a Shortening insensitive property : UtilityControlRoom-PT-Z2T3N10-LTLCardinality-07
Stuttering acceptance computed with spot in 137 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 30 out of 174 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 174/174 places, 230/230 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 174 transition count 190
Reduce places removed 40 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 1 with 60 rules applied. Total rules applied 100 place count 134 transition count 170
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 101 place count 133 transition count 150
Iterating global reduction 2 with 1 rules applied. Total rules applied 102 place count 133 transition count 150
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 112 place count 123 transition count 140
Iterating global reduction 2 with 10 rules applied. Total rules applied 122 place count 123 transition count 140
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 142 place count 113 transition count 130
Applied a total of 142 rules in 20 ms. Remains 113 /174 variables (removed 61) and now considering 130/230 (removed 100) transitions.
// Phase 1: matrix 130 rows 113 cols
[2024-06-01 20:10:58] [INFO ] Computed 23 invariants in 1 ms
[2024-06-01 20:10:58] [INFO ] Implicit Places using invariants in 90 ms returned [72]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 91 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 112/174 places, 130/230 transitions.
Applied a total of 0 rules in 2 ms. Remains 112 /112 variables (removed 0) and now considering 130/130 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 115 ms. Remains : 112/174 places, 130/230 transitions.
Running random walk in product with property : UtilityControlRoom-PT-Z2T3N10-LTLCardinality-07
Product exploration explored 100000 steps with 7359 reset in 207 ms.
Product exploration explored 100000 steps with 7385 reset in 227 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X p1)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 264 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 95 steps (0 resets) in 6 ms. (13 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X p1)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 100 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0), (NOT p0)]
// Phase 1: matrix 130 rows 112 cols
[2024-06-01 20:10:59] [INFO ] Computed 22 invariants in 9 ms
[2024-06-01 20:10:59] [INFO ] [Real]Absence check using 22 positive place invariants in 12 ms returned sat
[2024-06-01 20:10:59] [INFO ] [Real]Absence check using state equation in 79 ms returned sat
[2024-06-01 20:10:59] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 20:10:59] [INFO ] [Nat]Absence check using 22 positive place invariants in 10 ms returned sat
[2024-06-01 20:10:59] [INFO ] [Nat]Absence check using state equation in 79 ms returned sat
[2024-06-01 20:10:59] [INFO ] Computed and/alt/rep : 110/210/110 causal constraints (skipped 0 transitions) in 10 ms.
[2024-06-01 20:11:00] [INFO ] Added : 110 causal constraints over 22 iterations in 280 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 10 out of 112 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 130/130 transitions.
Applied a total of 0 rules in 1 ms. Remains 112 /112 variables (removed 0) and now considering 130/130 (removed 0) transitions.
[2024-06-01 20:11:00] [INFO ] Invariant cache hit.
[2024-06-01 20:11:00] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-06-01 20:11:00] [INFO ] Invariant cache hit.
[2024-06-01 20:11:00] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 197 ms to find 0 implicit places.
Running 110 sub problems to find dead transitions.
[2024-06-01 20:11:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (OVERLAPS) 10/112 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (OVERLAPS) 130/242 variables, 112/134 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/242 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (OVERLAPS) 0/242 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Real declared 242/242 variables, and 134 constraints, problems are : Problem set: 0 solved, 110 unsolved in 2970 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 112/112 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 110 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (OVERLAPS) 10/112 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (OVERLAPS) 130/242 variables, 112/134 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/242 variables, 110/244 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (OVERLAPS) 0/242 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Int declared 242/242 variables, and 244 constraints, problems are : Problem set: 0 solved, 110 unsolved in 3105 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 112/112 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 0/0 constraints]
After SMT, in 6104ms problems are : Problem set: 0 solved, 110 unsolved
Search for dead transitions found 0 dead transitions in 6108ms
Finished structural reductions in LTL mode , in 1 iterations and 6308 ms. Remains : 112/112 places, 130/130 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 81 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 101 steps (0 resets) in 5 ms. (16 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 91 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-06-01 20:11:07] [INFO ] Invariant cache hit.
[2024-06-01 20:11:07] [INFO ] [Real]Absence check using 22 positive place invariants in 10 ms returned sat
[2024-06-01 20:11:07] [INFO ] [Real]Absence check using state equation in 66 ms returned sat
[2024-06-01 20:11:07] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 20:11:07] [INFO ] [Nat]Absence check using 22 positive place invariants in 14 ms returned sat
[2024-06-01 20:11:07] [INFO ] [Nat]Absence check using state equation in 76 ms returned sat
[2024-06-01 20:11:07] [INFO ] Computed and/alt/rep : 110/210/110 causal constraints (skipped 0 transitions) in 11 ms.
[2024-06-01 20:11:07] [INFO ] Added : 110 causal constraints over 22 iterations in 283 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 110 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 4115 reset in 214 ms.
Product exploration explored 100000 steps with 4117 reset in 239 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 10 out of 112 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 112/112 places, 130/130 transitions.
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 112 transition count 130
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 30 place count 102 transition count 110
Deduced a syphon composed of 20 places in 0 ms
Iterating global reduction 1 with 10 rules applied. Total rules applied 40 place count 102 transition count 110
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 60 place count 82 transition count 90
Deduced a syphon composed of 10 places in 0 ms
Iterating global reduction 1 with 20 rules applied. Total rules applied 80 place count 82 transition count 90
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 90 place count 82 transition count 80
Deduced a syphon composed of 10 places in 0 ms
Applied a total of 90 rules in 9 ms. Remains 82 /112 variables (removed 30) and now considering 80/130 (removed 50) transitions.
[2024-06-01 20:11:08] [INFO ] Redundant transitions in 1 ms returned []
Running 70 sub problems to find dead transitions.
// Phase 1: matrix 80 rows 82 cols
[2024-06-01 20:11:08] [INFO ] Computed 22 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 2 (OVERLAPS) 10/82 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 70 unsolved
[2024-06-01 20:11:08] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 1 ms to minimize.
Problem TDEAD1 is UNSAT
[2024-06-01 20:11:08] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 2 ms to minimize.
[2024-06-01 20:11:09] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 2 ms to minimize.
Problem TDEAD3 is UNSAT
[2024-06-01 20:11:09] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 1 ms to minimize.
[2024-06-01 20:11:09] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 1 ms to minimize.
[2024-06-01 20:11:09] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 1 ms to minimize.
[2024-06-01 20:11:09] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 3 ms to minimize.
[2024-06-01 20:11:09] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 7 ms to minimize.
[2024-06-01 20:11:09] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 2 ms to minimize.
[2024-06-01 20:11:09] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 2 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 10/32 constraints. Problems are: Problem set: 10 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 0/32 constraints. Problems are: Problem set: 10 solved, 60 unsolved
At refinement iteration 5 (OVERLAPS) 80/162 variables, 82/114 constraints. Problems are: Problem set: 10 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 0/114 constraints. Problems are: Problem set: 10 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 0/162 variables, 0/114 constraints. Problems are: Problem set: 10 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 162/162 variables, and 114 constraints, problems are : Problem set: 10 solved, 60 unsolved in 1900 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 82/82 constraints, PredecessorRefiner: 70/70 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 10 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 10 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 20/82 variables, 22/22 constraints. Problems are: Problem set: 10 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 10/32 constraints. Problems are: Problem set: 10 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 0/32 constraints. Problems are: Problem set: 10 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 80/162 variables, 82/114 constraints. Problems are: Problem set: 10 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/162 variables, 60/174 constraints. Problems are: Problem set: 10 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 0/174 constraints. Problems are: Problem set: 10 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 0/162 variables, 0/174 constraints. Problems are: Problem set: 10 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 162/162 variables, and 174 constraints, problems are : Problem set: 10 solved, 60 unsolved in 1407 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 82/82 constraints, PredecessorRefiner: 60/70 constraints, Known Traps: 10/10 constraints]
After SMT, in 3322ms problems are : Problem set: 10 solved, 60 unsolved
Search for dead transitions found 10 dead transitions in 3324ms
Found 10 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 10 transitions
Dead transitions reduction (with SMT) removed 10 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 82/112 places, 70/130 transitions.
Graph (complete) has 130 edges and 82 vertex of which 72 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.1 ms
Discarding 10 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 3 ms. Remains 72 /82 variables (removed 10) and now considering 70/70 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 72/112 places, 70/130 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3345 ms. Remains : 72/112 places, 70/130 transitions.
Support contains 10 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 130/130 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 102 transition count 110
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 102 transition count 110
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 30 place count 92 transition count 100
Iterating global reduction 0 with 10 rules applied. Total rules applied 40 place count 92 transition count 100
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 50 place count 82 transition count 90
Iterating global reduction 0 with 10 rules applied. Total rules applied 60 place count 82 transition count 90
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 70 place count 82 transition count 80
Applied a total of 70 rules in 4 ms. Remains 82 /112 variables (removed 30) and now considering 80/130 (removed 50) transitions.
// Phase 1: matrix 80 rows 82 cols
[2024-06-01 20:11:11] [INFO ] Computed 22 invariants in 0 ms
[2024-06-01 20:11:11] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-06-01 20:11:11] [INFO ] Invariant cache hit.
[2024-06-01 20:11:12] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 179 ms to find 0 implicit places.
Running 70 sub problems to find dead transitions.
[2024-06-01 20:11:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 2 (OVERLAPS) 10/82 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 4 (OVERLAPS) 80/162 variables, 82/104 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/162 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 6 (OVERLAPS) 0/162 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Real declared 162/162 variables, and 104 constraints, problems are : Problem set: 0 solved, 70 unsolved in 1485 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 82/82 constraints, PredecessorRefiner: 70/70 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 70 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 2 (OVERLAPS) 10/82 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 4 (OVERLAPS) 80/162 variables, 82/104 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/162 variables, 70/174 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 7 (OVERLAPS) 0/162 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Int declared 162/162 variables, and 174 constraints, problems are : Problem set: 0 solved, 70 unsolved in 1609 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 82/82 constraints, PredecessorRefiner: 70/70 constraints, Known Traps: 0/0 constraints]
After SMT, in 3116ms problems are : Problem set: 0 solved, 70 unsolved
Search for dead transitions found 0 dead transitions in 3118ms
Starting structural reductions in LTL mode, iteration 1 : 82/112 places, 80/130 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3302 ms. Remains : 82/112 places, 80/130 transitions.
Treatment of property UtilityControlRoom-PT-Z2T3N10-LTLCardinality-07 finished in 17124 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0 U X((p1||F(p0))))))'
Found a Lengthening insensitive property : UtilityControlRoom-PT-Z2T3N10-LTLCardinality-12
Stuttering acceptance computed with spot in 203 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Support contains 2 out of 174 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 174/174 places, 230/230 transitions.
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 174 transition count 190
Reduce places removed 40 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 1 with 60 rules applied. Total rules applied 100 place count 134 transition count 170
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 100 place count 134 transition count 150
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 140 place count 114 transition count 150
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 141 place count 113 transition count 130
Iterating global reduction 2 with 1 rules applied. Total rules applied 142 place count 113 transition count 130
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 152 place count 103 transition count 120
Iterating global reduction 2 with 10 rules applied. Total rules applied 162 place count 103 transition count 120
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 172 place count 93 transition count 100
Iterating global reduction 2 with 10 rules applied. Total rules applied 182 place count 93 transition count 100
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 192 place count 83 transition count 90
Iterating global reduction 2 with 10 rules applied. Total rules applied 202 place count 83 transition count 90
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 212 place count 83 transition count 80
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 212 place count 83 transition count 70
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 232 place count 73 transition count 70
Applied a total of 232 rules in 15 ms. Remains 73 /174 variables (removed 101) and now considering 70/230 (removed 160) transitions.
// Phase 1: matrix 70 rows 73 cols
[2024-06-01 20:11:15] [INFO ] Computed 23 invariants in 1 ms
[2024-06-01 20:11:15] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-06-01 20:11:15] [INFO ] Invariant cache hit.
[2024-06-01 20:11:15] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 171 ms to find 0 implicit places.
Running 60 sub problems to find dead transitions.
[2024-06-01 20:11:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (OVERLAPS) 10/73 variables, 21/23 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 70/143 variables, 73/96 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/143 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 0/143 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 143/143 variables, and 96 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1182 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 73/73 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (OVERLAPS) 10/73 variables, 21/23 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 70/143 variables, 73/96 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/143 variables, 60/156 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/143 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 0/143 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 143/143 variables, and 156 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1244 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 73/73 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
After SMT, in 2442ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 2443ms
Starting structural reductions in LI_LTL mode, iteration 1 : 73/174 places, 70/230 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 2629 ms. Remains : 73/174 places, 70/230 transitions.
Running random walk in product with property : UtilityControlRoom-PT-Z2T3N10-LTLCardinality-12
Product exploration explored 100000 steps with 4 reset in 185 ms.
Product exploration explored 100000 steps with 2 reset in 229 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 (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 80 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
RANDOM walk for 13 steps (0 resets) in 4 ms. (2 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F p1), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 5 factoid took 149 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
[2024-06-01 20:11:19] [INFO ] Invariant cache hit.
[2024-06-01 20:11:19] [INFO ] [Real]Absence check using 23 positive place invariants in 14 ms returned sat
[2024-06-01 20:11:19] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2024-06-01 20:11:19] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 20:11:19] [INFO ] [Nat]Absence check using 23 positive place invariants in 11 ms returned sat
[2024-06-01 20:11:19] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2024-06-01 20:11:19] [INFO ] Computed and/alt/rep : 50/70/50 causal constraints (skipped 10 transitions) in 6 ms.
[2024-06-01 20:11:19] [INFO ] Added : 2 causal constraints over 1 iterations in 24 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 2 out of 73 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 73/73 places, 70/70 transitions.
Applied a total of 0 rules in 0 ms. Remains 73 /73 variables (removed 0) and now considering 70/70 (removed 0) transitions.
[2024-06-01 20:11:19] [INFO ] Invariant cache hit.
[2024-06-01 20:11:19] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-06-01 20:11:19] [INFO ] Invariant cache hit.
[2024-06-01 20:11:19] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 152 ms to find 0 implicit places.
Running 60 sub problems to find dead transitions.
[2024-06-01 20:11:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (OVERLAPS) 10/73 variables, 21/23 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 70/143 variables, 73/96 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/143 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 0/143 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 143/143 variables, and 96 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1168 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 73/73 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (OVERLAPS) 10/73 variables, 21/23 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 70/143 variables, 73/96 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/143 variables, 60/156 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/143 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 0/143 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 143/143 variables, and 156 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1323 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 73/73 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
After SMT, in 2519ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 2520ms
Finished structural reductions in LTL mode , in 1 iterations and 2674 ms. Remains : 73/73 places, 70/70 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 86 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
RANDOM walk for 16 steps (0 resets) in 5 ms. (2 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F p1), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 5 factoid took 151 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
[2024-06-01 20:11:22] [INFO ] Invariant cache hit.
[2024-06-01 20:11:22] [INFO ] [Real]Absence check using 23 positive place invariants in 11 ms returned sat
[2024-06-01 20:11:22] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2024-06-01 20:11:22] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 20:11:22] [INFO ] [Nat]Absence check using 23 positive place invariants in 12 ms returned sat
[2024-06-01 20:11:22] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2024-06-01 20:11:22] [INFO ] Computed and/alt/rep : 50/70/50 causal constraints (skipped 10 transitions) in 5 ms.
[2024-06-01 20:11:22] [INFO ] Added : 2 causal constraints over 1 iterations in 21 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 185 ms.
Product exploration explored 100000 steps with 3 reset in 224 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Support contains 2 out of 73 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 73/73 places, 70/70 transitions.
Applied a total of 0 rules in 1 ms. Remains 73 /73 variables (removed 0) and now considering 70/70 (removed 0) transitions.
[2024-06-01 20:11:23] [INFO ] Redundant transitions in 1 ms returned []
Running 60 sub problems to find dead transitions.
[2024-06-01 20:11:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (OVERLAPS) 10/73 variables, 21/23 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 70/143 variables, 73/96 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/143 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 0/143 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 143/143 variables, and 96 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1221 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 73/73 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (OVERLAPS) 10/73 variables, 21/23 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 70/143 variables, 73/96 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/143 variables, 60/156 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/143 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 0/143 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 143/143 variables, and 156 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1311 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 73/73 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
After SMT, in 2547ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 2548ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2556 ms. Remains : 73/73 places, 70/70 transitions.
Support contains 2 out of 73 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 73/73 places, 70/70 transitions.
Applied a total of 0 rules in 1 ms. Remains 73 /73 variables (removed 0) and now considering 70/70 (removed 0) transitions.
[2024-06-01 20:11:26] [INFO ] Invariant cache hit.
[2024-06-01 20:11:26] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-06-01 20:11:26] [INFO ] Invariant cache hit.
[2024-06-01 20:11:26] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 180 ms to find 0 implicit places.
Running 60 sub problems to find dead transitions.
[2024-06-01 20:11:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (OVERLAPS) 10/73 variables, 21/23 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 70/143 variables, 73/96 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/143 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 0/143 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 143/143 variables, and 96 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1219 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 73/73 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (OVERLAPS) 10/73 variables, 21/23 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 70/143 variables, 73/96 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/143 variables, 60/156 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/143 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 0/143 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 143/143 variables, and 156 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1377 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 73/73 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
After SMT, in 2612ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 2612ms
Finished structural reductions in LTL mode , in 1 iterations and 2794 ms. Remains : 73/73 places, 70/70 transitions.
Treatment of property UtilityControlRoom-PT-Z2T3N10-LTLCardinality-12 finished in 13857 ms.
[2024-06-01 20:11:29] [INFO ] Flatten gal took : 20 ms
[2024-06-01 20:11:29] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2024-06-01 20:11:29] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 174 places, 230 transitions and 690 arcs took 7 ms.
Total runtime 175026 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA UtilityControlRoom-PT-Z2T3N10-LTLCardinality-07 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA UtilityControlRoom-PT-Z2T3N10-LTLCardinality-12 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717272893445

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2024
ltl formula name UtilityControlRoom-PT-Z2T3N10-LTLCardinality-07
ltl formula formula --ltl=/tmp/1742/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 174 places, 230 transitions and 690 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.030 real 0.010 user 0.010 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1742/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1742/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1742/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1742/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 176 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 175, there are 238 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4): ~38 levels ~10000 states ~33068 transitions
pnml2lts-mc( 1/ 4): ~38 levels ~20000 states ~72092 transitions
pnml2lts-mc( 2/ 4): ~38 levels ~40000 states ~110612 transitions
pnml2lts-mc( 3/ 4): ~40 levels ~80000 states ~194376 transitions
pnml2lts-mc( 3/ 4): ~40 levels ~160000 states ~416700 transitions
pnml2lts-mc( 3/ 4): ~40 levels ~320000 states ~858704 transitions
pnml2lts-mc( 3/ 4): ~40 levels ~640000 states ~1833100 transitions
pnml2lts-mc( 3/ 4): ~40 levels ~1280000 states ~4306780 transitions
pnml2lts-mc( 3/ 4): ~40 levels ~2560000 states ~9717788 transitions
pnml2lts-mc( 3/ 4): ~40 levels ~5120000 states ~20376676 transitions
pnml2lts-mc( 2/ 4): ~38 levels ~10240000 states ~45076240 transitions
pnml2lts-mc( 2/ 4): ~38 levels ~20480000 states ~93579060 transitions
pnml2lts-mc( 1/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 33553143
pnml2lts-mc( 0/ 4): unique states count: 33553248
pnml2lts-mc( 0/ 4): unique transitions count: 192978989
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 159424586
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 33553252
pnml2lts-mc( 0/ 4): - cum. max stack depth: 155
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 33553252 states 192979034 transitions, fanout: 5.751
pnml2lts-mc( 0/ 4): Total exploration time 203.520 sec (203.480 sec minimum, 203.505 sec on average)
pnml2lts-mc( 0/ 4): States per second: 164865, Transitions per second: 948207
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 305.2MB, 9.5 B/state, compr.: 1.4%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/76.0%
pnml2lts-mc( 0/ 4): Stored 230 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 305.2MB (~256.0MB paged-in)
ltl formula name UtilityControlRoom-PT-Z2T3N10-LTLCardinality-12
ltl formula formula --ltl=/tmp/1742/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 174 places, 230 transitions and 690 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.040 real 0.010 user 0.010 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1742/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1742/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1742/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1742/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 176 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 175, there are 234 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 2/ 4): Accepting cycle FOUND at depth ~19!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 1105
pnml2lts-mc( 0/ 4): unique states count: 1145
pnml2lts-mc( 0/ 4): unique transitions count: 1522
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 58
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 1148
pnml2lts-mc( 0/ 4): - cum. max stack depth: 52
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 1148 states 1586 transitions, fanout: 1.382
pnml2lts-mc( 0/ 4): Total exploration time 0.020 sec (0.020 sec minimum, 0.020 sec on average)
pnml2lts-mc( 0/ 4): States per second: 57400, Transitions per second: 79300
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 27.9 B/state, compr.: 4.0%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 230 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

tar xzf /home/mcc/BenchKit/INPUTS/UtilityControlRoom-PT-Z2T3N10.tgz
mv UtilityControlRoom-PT-Z2T3N10 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;