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.r070-tall-171620505000020.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is CANConstruction-PT-020, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r070-tall-171620505000020
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 9.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.5K Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 22 14:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 12 19:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 111K Apr 12 19:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Apr 12 19:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 49K Apr 12 19:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 641K May 18 16:42 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 CANConstruction-PT-020-LTLFireability-00
FORMULA_NAME CANConstruction-PT-020-LTLFireability-01
FORMULA_NAME CANConstruction-PT-020-LTLFireability-02
FORMULA_NAME CANConstruction-PT-020-LTLFireability-03
FORMULA_NAME CANConstruction-PT-020-LTLFireability-04
FORMULA_NAME CANConstruction-PT-020-LTLFireability-05
FORMULA_NAME CANConstruction-PT-020-LTLFireability-06
FORMULA_NAME CANConstruction-PT-020-LTLFireability-07
FORMULA_NAME CANConstruction-PT-020-LTLFireability-08
FORMULA_NAME CANConstruction-PT-020-LTLFireability-09
FORMULA_NAME CANConstruction-PT-020-LTLFireability-10
FORMULA_NAME CANConstruction-PT-020-LTLFireability-11
FORMULA_NAME CANConstruction-PT-020-LTLFireability-12
FORMULA_NAME CANConstruction-PT-020-LTLFireability-13
FORMULA_NAME CANConstruction-PT-020-LTLFireability-14
FORMULA_NAME CANConstruction-PT-020-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716213466039

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANConstruction-PT-020
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-20 13:57:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-20 13:57:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-20 13:57:47] [INFO ] Load time of PNML (sax parser for PT used): 122 ms
[2024-05-20 13:57:47] [INFO ] Transformed 1042 places.
[2024-05-20 13:57:47] [INFO ] Transformed 1760 transitions.
[2024-05-20 13:57:47] [INFO ] Parsed PT model containing 1042 places and 1760 transitions and 5200 arcs in 233 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA CANConstruction-PT-020-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-020-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-020-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 45 out of 1042 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1042/1042 places, 1760/1760 transitions.
Discarding 350 places :
Symmetric choice reduction at 0 with 350 rule applications. Total rules 350 place count 692 transition count 1060
Iterating global reduction 0 with 350 rules applied. Total rules applied 700 place count 692 transition count 1060
Applied a total of 700 rules in 136 ms. Remains 692 /1042 variables (removed 350) and now considering 1060/1760 (removed 700) transitions.
// Phase 1: matrix 1060 rows 692 cols
[2024-05-20 13:57:47] [INFO ] Computed 41 invariants in 20 ms
[2024-05-20 13:57:48] [INFO ] Implicit Places using invariants in 559 ms returned [12, 26, 40, 54, 68, 82, 96, 124, 138, 152, 180, 194, 208, 222, 236, 250, 264, 278]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 588 ms to find 18 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 674/1042 places, 1060/1760 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 656 transition count 1042
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 656 transition count 1042
Applied a total of 36 rules in 32 ms. Remains 656 /674 variables (removed 18) and now considering 1042/1060 (removed 18) transitions.
// Phase 1: matrix 1042 rows 656 cols
[2024-05-20 13:57:48] [INFO ] Computed 23 invariants in 13 ms
[2024-05-20 13:57:48] [INFO ] Implicit Places using invariants in 280 ms returned []
[2024-05-20 13:57:48] [INFO ] Invariant cache hit.
[2024-05-20 13:57:49] [INFO ] State equation strengthened by 780 read => feed constraints.
[2024-05-20 13:57:50] [INFO ] Implicit Places using invariants and state equation in 1651 ms returned []
Implicit Place search using SMT with State Equation took 1933 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 656/1042 places, 1042/1760 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2705 ms. Remains : 656/1042 places, 1042/1760 transitions.
Support contains 45 out of 656 places after structural reductions.
[2024-05-20 13:57:50] [INFO ] Flatten gal took : 83 ms
[2024-05-20 13:57:50] [INFO ] Flatten gal took : 46 ms
[2024-05-20 13:57:50] [INFO ] Input system was already deterministic with 1042 transitions.
RANDOM walk for 36548 steps (103 resets) in 1691 ms. (21 steps per ms) remains 0/25 properties
FORMULA CANConstruction-PT-020-LTLFireability-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 63 stabilizing places and 82 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||G(F(p1))))))'
Support contains 4 out of 656 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 656/656 places, 1042/1042 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 646 transition count 1022
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 646 transition count 1022
Applied a total of 20 rules in 33 ms. Remains 646 /656 variables (removed 10) and now considering 1022/1042 (removed 20) transitions.
// Phase 1: matrix 1022 rows 646 cols
[2024-05-20 13:57:51] [INFO ] Computed 23 invariants in 19 ms
[2024-05-20 13:57:52] [INFO ] Implicit Places using invariants in 489 ms returned [96, 146]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 492 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 644/656 places, 1022/1042 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 642 transition count 1020
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 642 transition count 1020
Applied a total of 4 rules in 21 ms. Remains 642 /644 variables (removed 2) and now considering 1020/1022 (removed 2) transitions.
// Phase 1: matrix 1020 rows 642 cols
[2024-05-20 13:57:52] [INFO ] Computed 21 invariants in 14 ms
[2024-05-20 13:57:52] [INFO ] Implicit Places using invariants in 255 ms returned []
[2024-05-20 13:57:52] [INFO ] Invariant cache hit.
[2024-05-20 13:57:52] [INFO ] State equation strengthened by 780 read => feed constraints.
[2024-05-20 13:57:54] [INFO ] Implicit Places using invariants and state equation in 1755 ms returned []
Implicit Place search using SMT with State Equation took 2015 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 642/656 places, 1020/1042 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2562 ms. Remains : 642/656 places, 1020/1042 transitions.
Stuttering acceptance computed with spot in 241 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CANConstruction-PT-020-LTLFireability-00
Product exploration explored 100000 steps with 301 reset in 575 ms.
Product exploration explored 100000 steps with 305 reset in 334 ms.
Computed a total of 61 stabilizing places and 80 stable transitions
Computed a total of 61 stabilizing places and 80 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 88 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 170 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Reduction of identical properties reduced properties to check from 5 to 4
RANDOM walk for 40000 steps (114 resets) in 267 ms. (149 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 102 ms. (388 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 387 ms. (103 steps per ms) remains 2/2 properties
[2024-05-20 13:57:55] [INFO ] Invariant cache hit.
[2024-05-20 13:57:56] [INFO ] State equation strengthened by 780 read => feed constraints.
Problem apf0 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 621/625 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-20 13:57:56] [INFO ] Deduced a trap composed of 5 places in 226 ms of which 9 ms to minimize.
[2024-05-20 13:57:56] [INFO ] Deduced a trap composed of 5 places in 282 ms of which 8 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/625 variables, 2/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/625 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 16/641 variables, 16/23 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-20 13:57:57] [INFO ] Deduced a trap composed of 39 places in 221 ms of which 5 ms to minimize.
[2024-05-20 13:57:57] [INFO ] Deduced a trap composed of 35 places in 216 ms of which 4 ms to minimize.
[2024-05-20 13:57:57] [INFO ] Deduced a trap composed of 39 places in 260 ms of which 4 ms to minimize.
[2024-05-20 13:57:57] [INFO ] Deduced a trap composed of 38 places in 194 ms of which 3 ms to minimize.
[2024-05-20 13:57:58] [INFO ] Deduced a trap composed of 35 places in 294 ms of which 6 ms to minimize.
[2024-05-20 13:57:58] [INFO ] Deduced a trap composed of 42 places in 185 ms of which 3 ms to minimize.
[2024-05-20 13:57:58] [INFO ] Deduced a trap composed of 32 places in 269 ms of which 3 ms to minimize.
[2024-05-20 13:57:58] [INFO ] Deduced a trap composed of 32 places in 326 ms of which 3 ms to minimize.
[2024-05-20 13:57:59] [INFO ] Deduced a trap composed of 32 places in 158 ms of which 3 ms to minimize.
[2024-05-20 13:57:59] [INFO ] Deduced a trap composed of 37 places in 167 ms of which 3 ms to minimize.
[2024-05-20 13:57:59] [INFO ] Deduced a trap composed of 35 places in 152 ms of which 3 ms to minimize.
[2024-05-20 13:57:59] [INFO ] Deduced a trap composed of 32 places in 149 ms of which 3 ms to minimize.
[2024-05-20 13:57:59] [INFO ] Deduced a trap composed of 32 places in 148 ms of which 4 ms to minimize.
[2024-05-20 13:58:00] [INFO ] Deduced a trap composed of 38 places in 141 ms of which 4 ms to minimize.
[2024-05-20 13:58:00] [INFO ] Deduced a trap composed of 32 places in 136 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/641 variables, 15/38 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/641 variables, 0/38 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1020/1661 variables, 641/679 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1661 variables, 780/1459 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/1661 variables, 0/1459 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/1662 variables, 1/1460 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1662 variables, 0/1460 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/1662 variables, 0/1460 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1662/1662 variables, and 1460 constraints, problems are : Problem set: 1 solved, 1 unsolved in 4539 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 642/642 constraints, ReadFeed: 780/780 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 621/625 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/625 variables, 2/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-20 13:58:00] [INFO ] Deduced a trap composed of 5 places in 196 ms of which 4 ms to minimize.
[2024-05-20 13:58:01] [INFO ] Deduced a trap composed of 5 places in 221 ms of which 4 ms to minimize.
[2024-05-20 13:58:01] [INFO ] Deduced a trap composed of 5 places in 212 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/625 variables, 3/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/625 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 16/641 variables, 16/26 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/641 variables, 15/41 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-20 13:58:01] [INFO ] Deduced a trap composed of 32 places in 294 ms of which 6 ms to minimize.
[2024-05-20 13:58:01] [INFO ] Deduced a trap composed of 32 places in 248 ms of which 3 ms to minimize.
[2024-05-20 13:58:02] [INFO ] Deduced a trap composed of 32 places in 256 ms of which 6 ms to minimize.
[2024-05-20 13:58:02] [INFO ] Deduced a trap composed of 39 places in 252 ms of which 6 ms to minimize.
[2024-05-20 13:58:02] [INFO ] Deduced a trap composed of 38 places in 249 ms of which 7 ms to minimize.
[2024-05-20 13:58:03] [INFO ] Deduced a trap composed of 35 places in 232 ms of which 7 ms to minimize.
[2024-05-20 13:58:03] [INFO ] Deduced a trap composed of 32 places in 221 ms of which 5 ms to minimize.
[2024-05-20 13:58:03] [INFO ] Deduced a trap composed of 32 places in 198 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/641 variables, 8/49 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/641 variables, 0/49 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1020/1661 variables, 641/690 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1661 variables, 780/1470 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1661 variables, 1/1471 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1661 variables, 0/1471 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/1662 variables, 1/1472 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1662 variables, 0/1472 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/1662 variables, 0/1472 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1662/1662 variables, and 1472 constraints, problems are : Problem set: 1 solved, 1 unsolved in 3363 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 642/642 constraints, ReadFeed: 780/780 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 28/28 constraints]
After SMT, in 7965ms problems are : Problem set: 1 solved, 1 unsolved
Finished Parikh walk after 2149 steps, including 81 resets, run visited all 1 properties in 6 ms. (steps per millisecond=358 )
Parikh walk visited 1 properties in 11 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (G (OR (NOT p0) (NOT p1)))]
False Knowledge obtained : [(F (NOT p1)), (F p0), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 8 factoid took 267 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 222 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Stuttering acceptance computed with spot in 188 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Support contains 4 out of 642 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 642/642 places, 1020/1020 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 140 transitions
Trivial Post-agglo rules discarded 140 transitions
Performed 140 trivial Post agglomeration. Transition count delta: 140
Iterating post reduction 0 with 140 rules applied. Total rules applied 140 place count 642 transition count 880
Reduce places removed 140 places and 0 transitions.
Iterating post reduction 1 with 140 rules applied. Total rules applied 280 place count 502 transition count 880
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 280 place count 502 transition count 860
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 320 place count 482 transition count 860
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 356 place count 464 transition count 842
Applied a total of 356 rules in 108 ms. Remains 464 /642 variables (removed 178) and now considering 842/1020 (removed 178) transitions.
// Phase 1: matrix 842 rows 464 cols
[2024-05-20 13:58:04] [INFO ] Computed 21 invariants in 12 ms
[2024-05-20 13:58:05] [INFO ] Implicit Places using invariants in 258 ms returned []
[2024-05-20 13:58:05] [INFO ] Invariant cache hit.
[2024-05-20 13:58:05] [INFO ] State equation strengthened by 780 read => feed constraints.
[2024-05-20 13:58:06] [INFO ] Implicit Places using invariants and state equation in 1586 ms returned []
Implicit Place search using SMT with State Equation took 1848 ms to find 0 implicit places.
[2024-05-20 13:58:06] [INFO ] Redundant transitions in 51 ms returned []
Running 822 sub problems to find dead transitions.
[2024-05-20 13:58:06] [INFO ] Invariant cache hit.
[2024-05-20 13:58:06] [INFO ] State equation strengthened by 780 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/463 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2024-05-20 13:58:13] [INFO ] Deduced a trap composed of 23 places in 160 ms of which 3 ms to minimize.
[2024-05-20 13:58:13] [INFO ] Deduced a trap composed of 23 places in 147 ms of which 3 ms to minimize.
[2024-05-20 13:58:13] [INFO ] Deduced a trap composed of 23 places in 154 ms of which 3 ms to minimize.
[2024-05-20 13:58:13] [INFO ] Deduced a trap composed of 24 places in 155 ms of which 3 ms to minimize.
[2024-05-20 13:58:13] [INFO ] Deduced a trap composed of 23 places in 187 ms of which 2 ms to minimize.
[2024-05-20 13:58:14] [INFO ] Deduced a trap composed of 23 places in 135 ms of which 3 ms to minimize.
[2024-05-20 13:58:14] [INFO ] Deduced a trap composed of 23 places in 151 ms of which 6 ms to minimize.
[2024-05-20 13:58:14] [INFO ] Deduced a trap composed of 23 places in 152 ms of which 3 ms to minimize.
[2024-05-20 13:58:14] [INFO ] Deduced a trap composed of 23 places in 137 ms of which 3 ms to minimize.
[2024-05-20 13:58:14] [INFO ] Deduced a trap composed of 23 places in 135 ms of which 3 ms to minimize.
[2024-05-20 13:58:14] [INFO ] Deduced a trap composed of 23 places in 130 ms of which 3 ms to minimize.
[2024-05-20 13:58:14] [INFO ] Deduced a trap composed of 24 places in 117 ms of which 2 ms to minimize.
[2024-05-20 13:58:15] [INFO ] Deduced a trap composed of 28 places in 131 ms of which 2 ms to minimize.
[2024-05-20 13:58:15] [INFO ] Deduced a trap composed of 23 places in 131 ms of which 3 ms to minimize.
[2024-05-20 13:58:15] [INFO ] Deduced a trap composed of 23 places in 127 ms of which 2 ms to minimize.
[2024-05-20 13:58:15] [INFO ] Deduced a trap composed of 23 places in 140 ms of which 2 ms to minimize.
[2024-05-20 13:58:15] [INFO ] Deduced a trap composed of 23 places in 113 ms of which 3 ms to minimize.
[2024-05-20 13:58:15] [INFO ] Deduced a trap composed of 23 places in 107 ms of which 3 ms to minimize.
[2024-05-20 13:58:15] [INFO ] Deduced a trap composed of 24 places in 106 ms of which 2 ms to minimize.
[2024-05-20 13:58:16] [INFO ] Deduced a trap composed of 23 places in 141 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/463 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2024-05-20 13:58:17] [INFO ] Deduced a trap composed of 24 places in 145 ms of which 3 ms to minimize.
[2024-05-20 13:58:17] [INFO ] Deduced a trap composed of 23 places in 134 ms of which 3 ms to minimize.
[2024-05-20 13:58:17] [INFO ] Deduced a trap composed of 26 places in 133 ms of which 2 ms to minimize.
[2024-05-20 13:58:17] [INFO ] Deduced a trap composed of 23 places in 138 ms of which 3 ms to minimize.
[2024-05-20 13:58:17] [INFO ] Deduced a trap composed of 23 places in 138 ms of which 3 ms to minimize.
[2024-05-20 13:58:17] [INFO ] Deduced a trap composed of 23 places in 132 ms of which 3 ms to minimize.
[2024-05-20 13:58:17] [INFO ] Deduced a trap composed of 23 places in 140 ms of which 2 ms to minimize.
[2024-05-20 13:58:18] [INFO ] Deduced a trap composed of 24 places in 135 ms of which 3 ms to minimize.
[2024-05-20 13:58:18] [INFO ] Deduced a trap composed of 24 places in 126 ms of which 3 ms to minimize.
[2024-05-20 13:58:18] [INFO ] Deduced a trap composed of 23 places in 118 ms of which 3 ms to minimize.
[2024-05-20 13:58:18] [INFO ] Deduced a trap composed of 24 places in 129 ms of which 3 ms to minimize.
[2024-05-20 13:58:18] [INFO ] Deduced a trap composed of 24 places in 126 ms of which 3 ms to minimize.
[2024-05-20 13:58:18] [INFO ] Deduced a trap composed of 24 places in 127 ms of which 3 ms to minimize.
[2024-05-20 13:58:18] [INFO ] Deduced a trap composed of 24 places in 135 ms of which 3 ms to minimize.
[2024-05-20 13:58:19] [INFO ] Deduced a trap composed of 24 places in 133 ms of which 3 ms to minimize.
[2024-05-20 13:58:19] [INFO ] Deduced a trap composed of 24 places in 128 ms of which 3 ms to minimize.
[2024-05-20 13:58:19] [INFO ] Deduced a trap composed of 26 places in 122 ms of which 3 ms to minimize.
[2024-05-20 13:58:19] [INFO ] Deduced a trap composed of 23 places in 120 ms of which 2 ms to minimize.
[2024-05-20 13:58:19] [INFO ] Deduced a trap composed of 23 places in 118 ms of which 2 ms to minimize.
[2024-05-20 13:58:19] [INFO ] Deduced a trap composed of 23 places in 119 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/463 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2024-05-20 13:58:20] [INFO ] Deduced a trap composed of 23 places in 131 ms of which 3 ms to minimize.
[2024-05-20 13:58:20] [INFO ] Deduced a trap composed of 23 places in 135 ms of which 2 ms to minimize.
[2024-05-20 13:58:20] [INFO ] Deduced a trap composed of 23 places in 124 ms of which 2 ms to minimize.
[2024-05-20 13:58:21] [INFO ] Deduced a trap composed of 23 places in 118 ms of which 3 ms to minimize.
[2024-05-20 13:58:21] [INFO ] Deduced a trap composed of 26 places in 128 ms of which 3 ms to minimize.
[2024-05-20 13:58:21] [INFO ] Deduced a trap composed of 23 places in 119 ms of which 2 ms to minimize.
[2024-05-20 13:58:21] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 3 ms to minimize.
[2024-05-20 13:58:21] [INFO ] Deduced a trap composed of 23 places in 119 ms of which 2 ms to minimize.
[2024-05-20 13:58:21] [INFO ] Deduced a trap composed of 23 places in 112 ms of which 2 ms to minimize.
[2024-05-20 13:58:21] [INFO ] Deduced a trap composed of 23 places in 114 ms of which 2 ms to minimize.
[2024-05-20 13:58:21] [INFO ] Deduced a trap composed of 23 places in 108 ms of which 2 ms to minimize.
[2024-05-20 13:58:22] [INFO ] Deduced a trap composed of 23 places in 105 ms of which 3 ms to minimize.
[2024-05-20 13:58:22] [INFO ] Deduced a trap composed of 23 places in 104 ms of which 3 ms to minimize.
[2024-05-20 13:58:22] [INFO ] Deduced a trap composed of 25 places in 131 ms of which 3 ms to minimize.
[2024-05-20 13:58:22] [INFO ] Deduced a trap composed of 23 places in 133 ms of which 3 ms to minimize.
[2024-05-20 13:58:22] [INFO ] Deduced a trap composed of 23 places in 129 ms of which 3 ms to minimize.
[2024-05-20 13:58:22] [INFO ] Deduced a trap composed of 23 places in 123 ms of which 3 ms to minimize.
[2024-05-20 13:58:22] [INFO ] Deduced a trap composed of 23 places in 117 ms of which 3 ms to minimize.
[2024-05-20 13:58:23] [INFO ] Deduced a trap composed of 23 places in 121 ms of which 7 ms to minimize.
[2024-05-20 13:58:23] [INFO ] Deduced a trap composed of 23 places in 138 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/463 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2024-05-20 13:58:29] [INFO ] Deduced a trap composed of 23 places in 115 ms of which 3 ms to minimize.
[2024-05-20 13:58:29] [INFO ] Deduced a trap composed of 23 places in 117 ms of which 3 ms to minimize.
[2024-05-20 13:58:29] [INFO ] Deduced a trap composed of 23 places in 117 ms of which 3 ms to minimize.
[2024-05-20 13:58:29] [INFO ] Deduced a trap composed of 23 places in 113 ms of which 3 ms to minimize.
[2024-05-20 13:58:30] [INFO ] Deduced a trap composed of 24 places in 106 ms of which 3 ms to minimize.
[2024-05-20 13:58:30] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 2 ms to minimize.
[2024-05-20 13:58:30] [INFO ] Deduced a trap composed of 23 places in 137 ms of which 2 ms to minimize.
[2024-05-20 13:58:30] [INFO ] Deduced a trap composed of 24 places in 126 ms of which 3 ms to minimize.
[2024-05-20 13:58:30] [INFO ] Deduced a trap composed of 23 places in 130 ms of which 3 ms to minimize.
[2024-05-20 13:58:31] [INFO ] Deduced a trap composed of 23 places in 130 ms of which 3 ms to minimize.
[2024-05-20 13:58:31] [INFO ] Deduced a trap composed of 24 places in 142 ms of which 3 ms to minimize.
[2024-05-20 13:58:31] [INFO ] Deduced a trap composed of 24 places in 128 ms of which 3 ms to minimize.
[2024-05-20 13:58:31] [INFO ] Deduced a trap composed of 23 places in 120 ms of which 2 ms to minimize.
[2024-05-20 13:58:31] [INFO ] Deduced a trap composed of 23 places in 114 ms of which 3 ms to minimize.
[2024-05-20 13:58:31] [INFO ] Deduced a trap composed of 23 places in 113 ms of which 2 ms to minimize.
[2024-05-20 13:58:31] [INFO ] Deduced a trap composed of 26 places in 106 ms of which 2 ms to minimize.
[2024-05-20 13:58:31] [INFO ] Deduced a trap composed of 23 places in 104 ms of which 2 ms to minimize.
[2024-05-20 13:58:32] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 2 ms to minimize.
[2024-05-20 13:58:32] [INFO ] Deduced a trap composed of 23 places in 112 ms of which 3 ms to minimize.
[2024-05-20 13:58:32] [INFO ] Deduced a trap composed of 26 places in 113 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/463 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2024-05-20 13:58:33] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 2 ms to minimize.
[2024-05-20 13:58:33] [INFO ] Deduced a trap composed of 24 places in 138 ms of which 2 ms to minimize.
[2024-05-20 13:58:33] [INFO ] Deduced a trap composed of 24 places in 131 ms of which 3 ms to minimize.
[2024-05-20 13:58:33] [INFO ] Deduced a trap composed of 23 places in 124 ms of which 2 ms to minimize.
[2024-05-20 13:58:34] [INFO ] Deduced a trap composed of 29 places in 128 ms of which 3 ms to minimize.
[2024-05-20 13:58:34] [INFO ] Deduced a trap composed of 26 places in 120 ms of which 4 ms to minimize.
[2024-05-20 13:58:34] [INFO ] Deduced a trap composed of 23 places in 119 ms of which 3 ms to minimize.
[2024-05-20 13:58:34] [INFO ] Deduced a trap composed of 23 places in 125 ms of which 2 ms to minimize.
[2024-05-20 13:58:34] [INFO ] Deduced a trap composed of 29 places in 123 ms of which 3 ms to minimize.
[2024-05-20 13:58:34] [INFO ] Deduced a trap composed of 27 places in 123 ms of which 3 ms to minimize.
[2024-05-20 13:58:34] [INFO ] Deduced a trap composed of 23 places in 123 ms of which 3 ms to minimize.
[2024-05-20 13:58:35] [INFO ] Deduced a trap composed of 23 places in 116 ms of which 2 ms to minimize.
[2024-05-20 13:58:35] [INFO ] Deduced a trap composed of 23 places in 124 ms of which 2 ms to minimize.
[2024-05-20 13:58:35] [INFO ] Deduced a trap composed of 26 places in 113 ms of which 3 ms to minimize.
[2024-05-20 13:58:35] [INFO ] Deduced a trap composed of 24 places in 117 ms of which 3 ms to minimize.
[2024-05-20 13:58:35] [INFO ] Deduced a trap composed of 23 places in 108 ms of which 2 ms to minimize.
[2024-05-20 13:58:35] [INFO ] Deduced a trap composed of 24 places in 98 ms of which 3 ms to minimize.
[2024-05-20 13:58:35] [INFO ] Deduced a trap composed of 24 places in 102 ms of which 2 ms to minimize.
[2024-05-20 13:58:35] [INFO ] Deduced a trap composed of 24 places in 108 ms of which 3 ms to minimize.
[2024-05-20 13:58:35] [INFO ] Deduced a trap composed of 24 places in 103 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/463 variables, 20/121 constraints. Problems are: Problem set: 0 solved, 822 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 463/1306 variables, and 121 constraints, problems are : Problem set: 0 solved, 822 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 0/464 constraints, ReadFeed: 0/780 constraints, PredecessorRefiner: 822/822 constraints, Known Traps: 100/100 constraints]
Escalating to Integer solving :Problem set: 0 solved, 822 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/463 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/463 variables, 100/121 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2024-05-20 13:58:38] [INFO ] Deduced a trap composed of 23 places in 105 ms of which 2 ms to minimize.
[2024-05-20 13:58:38] [INFO ] Deduced a trap composed of 23 places in 123 ms of which 3 ms to minimize.
[2024-05-20 13:58:38] [INFO ] Deduced a trap composed of 23 places in 115 ms of which 3 ms to minimize.
[2024-05-20 13:58:38] [INFO ] Deduced a trap composed of 23 places in 108 ms of which 3 ms to minimize.
[2024-05-20 13:58:39] [INFO ] Deduced a trap composed of 23 places in 142 ms of which 3 ms to minimize.
[2024-05-20 13:58:39] [INFO ] Deduced a trap composed of 24 places in 140 ms of which 3 ms to minimize.
[2024-05-20 13:58:39] [INFO ] Deduced a trap composed of 23 places in 137 ms of which 3 ms to minimize.
[2024-05-20 13:58:39] [INFO ] Deduced a trap composed of 23 places in 131 ms of which 3 ms to minimize.
[2024-05-20 13:58:39] [INFO ] Deduced a trap composed of 28 places in 125 ms of which 2 ms to minimize.
[2024-05-20 13:58:39] [INFO ] Deduced a trap composed of 23 places in 121 ms of which 2 ms to minimize.
[2024-05-20 13:58:39] [INFO ] Deduced a trap composed of 23 places in 122 ms of which 2 ms to minimize.
[2024-05-20 13:58:40] [INFO ] Deduced a trap composed of 23 places in 121 ms of which 3 ms to minimize.
[2024-05-20 13:58:40] [INFO ] Deduced a trap composed of 29 places in 119 ms of which 3 ms to minimize.
[2024-05-20 13:58:40] [INFO ] Deduced a trap composed of 23 places in 116 ms of which 3 ms to minimize.
[2024-05-20 13:58:40] [INFO ] Deduced a trap composed of 23 places in 130 ms of which 4 ms to minimize.
[2024-05-20 13:58:40] [INFO ] Deduced a trap composed of 27 places in 134 ms of which 4 ms to minimize.
[2024-05-20 13:58:40] [INFO ] Deduced a trap composed of 26 places in 122 ms of which 2 ms to minimize.
[2024-05-20 13:58:41] [INFO ] Deduced a trap composed of 26 places in 126 ms of which 2 ms to minimize.
[2024-05-20 13:58:41] [INFO ] Deduced a trap composed of 27 places in 129 ms of which 3 ms to minimize.
[2024-05-20 13:58:41] [INFO ] Deduced a trap composed of 23 places in 119 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/463 variables, 20/141 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2024-05-20 13:58:42] [INFO ] Deduced a trap composed of 23 places in 104 ms of which 3 ms to minimize.
[2024-05-20 13:58:42] [INFO ] Deduced a trap composed of 23 places in 126 ms of which 3 ms to minimize.
[2024-05-20 13:58:42] [INFO ] Deduced a trap composed of 26 places in 126 ms of which 3 ms to minimize.
[2024-05-20 13:58:42] [INFO ] Deduced a trap composed of 23 places in 123 ms of which 2 ms to minimize.
[2024-05-20 13:58:43] [INFO ] Deduced a trap composed of 23 places in 117 ms of which 3 ms to minimize.
[2024-05-20 13:58:43] [INFO ] Deduced a trap composed of 24 places in 111 ms of which 3 ms to minimize.
[2024-05-20 13:58:43] [INFO ] Deduced a trap composed of 23 places in 110 ms of which 3 ms to minimize.
[2024-05-20 13:58:43] [INFO ] Deduced a trap composed of 23 places in 110 ms of which 3 ms to minimize.
[2024-05-20 13:58:43] [INFO ] Deduced a trap composed of 23 places in 97 ms of which 3 ms to minimize.
[2024-05-20 13:58:43] [INFO ] Deduced a trap composed of 23 places in 102 ms of which 3 ms to minimize.
[2024-05-20 13:58:43] [INFO ] Deduced a trap composed of 23 places in 105 ms of which 3 ms to minimize.
[2024-05-20 13:58:43] [INFO ] Deduced a trap composed of 23 places in 127 ms of which 3 ms to minimize.
[2024-05-20 13:58:44] [INFO ] Deduced a trap composed of 24 places in 113 ms of which 3 ms to minimize.
[2024-05-20 13:58:44] [INFO ] Deduced a trap composed of 23 places in 115 ms of which 3 ms to minimize.
[2024-05-20 13:58:44] [INFO ] Deduced a trap composed of 27 places in 115 ms of which 3 ms to minimize.
[2024-05-20 13:58:44] [INFO ] Deduced a trap composed of 23 places in 113 ms of which 3 ms to minimize.
[2024-05-20 13:58:44] [INFO ] Deduced a trap composed of 26 places in 114 ms of which 3 ms to minimize.
[2024-05-20 13:58:44] [INFO ] Deduced a trap composed of 23 places in 118 ms of which 3 ms to minimize.
[2024-05-20 13:58:44] [INFO ] Deduced a trap composed of 23 places in 102 ms of which 2 ms to minimize.
[2024-05-20 13:58:45] [INFO ] Deduced a trap composed of 24 places in 139 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/463 variables, 20/161 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2024-05-20 13:58:46] [INFO ] Deduced a trap composed of 23 places in 121 ms of which 3 ms to minimize.
[2024-05-20 13:58:46] [INFO ] Deduced a trap composed of 23 places in 114 ms of which 2 ms to minimize.
[2024-05-20 13:58:46] [INFO ] Deduced a trap composed of 24 places in 100 ms of which 3 ms to minimize.
[2024-05-20 13:58:46] [INFO ] Deduced a trap composed of 23 places in 121 ms of which 2 ms to minimize.
[2024-05-20 13:58:46] [INFO ] Deduced a trap composed of 23 places in 110 ms of which 2 ms to minimize.
[2024-05-20 13:58:47] [INFO ] Deduced a trap composed of 23 places in 110 ms of which 3 ms to minimize.
[2024-05-20 13:58:47] [INFO ] Deduced a trap composed of 25 places in 111 ms of which 3 ms to minimize.
[2024-05-20 13:58:47] [INFO ] Deduced a trap composed of 24 places in 110 ms of which 3 ms to minimize.
[2024-05-20 13:58:47] [INFO ] Deduced a trap composed of 24 places in 106 ms of which 3 ms to minimize.
[2024-05-20 13:58:47] [INFO ] Deduced a trap composed of 23 places in 128 ms of which 3 ms to minimize.
[2024-05-20 13:58:47] [INFO ] Deduced a trap composed of 24 places in 123 ms of which 3 ms to minimize.
[2024-05-20 13:58:48] [INFO ] Deduced a trap composed of 23 places in 123 ms of which 2 ms to minimize.
[2024-05-20 13:58:48] [INFO ] Deduced a trap composed of 23 places in 120 ms of which 3 ms to minimize.
[2024-05-20 13:58:48] [INFO ] Deduced a trap composed of 23 places in 118 ms of which 2 ms to minimize.
[2024-05-20 13:58:48] [INFO ] Deduced a trap composed of 23 places in 117 ms of which 3 ms to minimize.
[2024-05-20 13:58:48] [INFO ] Deduced a trap composed of 24 places in 123 ms of which 2 ms to minimize.
[2024-05-20 13:58:48] [INFO ] Deduced a trap composed of 23 places in 99 ms of which 3 ms to minimize.
[2024-05-20 13:58:48] [INFO ] Deduced a trap composed of 23 places in 102 ms of which 2 ms to minimize.
[2024-05-20 13:58:49] [INFO ] Deduced a trap composed of 23 places in 129 ms of which 3 ms to minimize.
[2024-05-20 13:58:49] [INFO ] Deduced a trap composed of 23 places in 131 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/463 variables, 20/181 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2024-05-20 13:58:50] [INFO ] Deduced a trap composed of 23 places in 108 ms of which 3 ms to minimize.
[2024-05-20 13:58:50] [INFO ] Deduced a trap composed of 23 places in 117 ms of which 3 ms to minimize.
[2024-05-20 13:58:51] [INFO ] Deduced a trap composed of 24 places in 120 ms of which 2 ms to minimize.
[2024-05-20 13:58:51] [INFO ] Deduced a trap composed of 23 places in 102 ms of which 2 ms to minimize.
[2024-05-20 13:58:51] [INFO ] Deduced a trap composed of 23 places in 107 ms of which 2 ms to minimize.
[2024-05-20 13:58:51] [INFO ] Deduced a trap composed of 23 places in 122 ms of which 2 ms to minimize.
[2024-05-20 13:58:51] [INFO ] Deduced a trap composed of 25 places in 116 ms of which 3 ms to minimize.
[2024-05-20 13:58:51] [INFO ] Deduced a trap composed of 23 places in 105 ms of which 3 ms to minimize.
[2024-05-20 13:58:51] [INFO ] Deduced a trap composed of 23 places in 103 ms of which 3 ms to minimize.
[2024-05-20 13:58:52] [INFO ] Deduced a trap composed of 23 places in 101 ms of which 3 ms to minimize.
[2024-05-20 13:58:52] [INFO ] Deduced a trap composed of 23 places in 102 ms of which 2 ms to minimize.
[2024-05-20 13:58:52] [INFO ] Deduced a trap composed of 23 places in 100 ms of which 2 ms to minimize.
[2024-05-20 13:58:52] [INFO ] Deduced a trap composed of 23 places in 98 ms of which 2 ms to minimize.
[2024-05-20 13:58:52] [INFO ] Deduced a trap composed of 23 places in 121 ms of which 2 ms to minimize.
[2024-05-20 13:58:52] [INFO ] Deduced a trap composed of 23 places in 120 ms of which 2 ms to minimize.
[2024-05-20 13:58:52] [INFO ] Deduced a trap composed of 25 places in 117 ms of which 3 ms to minimize.
[2024-05-20 13:58:53] [INFO ] Deduced a trap composed of 23 places in 121 ms of which 2 ms to minimize.
[2024-05-20 13:58:53] [INFO ] Deduced a trap composed of 25 places in 107 ms of which 2 ms to minimize.
[2024-05-20 13:58:53] [INFO ] Deduced a trap composed of 23 places in 105 ms of which 3 ms to minimize.
[2024-05-20 13:58:53] [INFO ] Deduced a trap composed of 23 places in 91 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/463 variables, 20/201 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2024-05-20 13:58:54] [INFO ] Deduced a trap composed of 23 places in 109 ms of which 2 ms to minimize.
[2024-05-20 13:58:54] [INFO ] Deduced a trap composed of 23 places in 101 ms of which 3 ms to minimize.
[2024-05-20 13:58:54] [INFO ] Deduced a trap composed of 23 places in 103 ms of which 3 ms to minimize.
[2024-05-20 13:58:55] [INFO ] Deduced a trap composed of 23 places in 122 ms of which 2 ms to minimize.
[2024-05-20 13:58:55] [INFO ] Deduced a trap composed of 24 places in 119 ms of which 2 ms to minimize.
[2024-05-20 13:58:55] [INFO ] Deduced a trap composed of 23 places in 102 ms of which 2 ms to minimize.
[2024-05-20 13:58:55] [INFO ] Deduced a trap composed of 23 places in 94 ms of which 2 ms to minimize.
[2024-05-20 13:58:55] [INFO ] Deduced a trap composed of 23 places in 100 ms of which 2 ms to minimize.
[2024-05-20 13:58:56] [INFO ] Deduced a trap composed of 23 places in 103 ms of which 3 ms to minimize.
[2024-05-20 13:58:56] [INFO ] Deduced a trap composed of 23 places in 107 ms of which 3 ms to minimize.
[2024-05-20 13:58:56] [INFO ] Deduced a trap composed of 23 places in 93 ms of which 2 ms to minimize.
[2024-05-20 13:58:56] [INFO ] Deduced a trap composed of 23 places in 107 ms of which 3 ms to minimize.
[2024-05-20 13:58:56] [INFO ] Deduced a trap composed of 23 places in 123 ms of which 3 ms to minimize.
[2024-05-20 13:58:56] [INFO ] Deduced a trap composed of 23 places in 115 ms of which 3 ms to minimize.
[2024-05-20 13:58:57] [INFO ] Deduced a trap composed of 24 places in 98 ms of which 2 ms to minimize.
[2024-05-20 13:58:57] [INFO ] Deduced a trap composed of 23 places in 121 ms of which 2 ms to minimize.
[2024-05-20 13:58:57] [INFO ] Deduced a trap composed of 23 places in 116 ms of which 2 ms to minimize.
[2024-05-20 13:58:57] [INFO ] Deduced a trap composed of 23 places in 110 ms of which 2 ms to minimize.
[2024-05-20 13:58:57] [INFO ] Deduced a trap composed of 23 places in 102 ms of which 3 ms to minimize.
[2024-05-20 13:58:57] [INFO ] Deduced a trap composed of 25 places in 111 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/463 variables, 20/221 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2024-05-20 13:58:59] [INFO ] Deduced a trap composed of 23 places in 98 ms of which 2 ms to minimize.
[2024-05-20 13:58:59] [INFO ] Deduced a trap composed of 23 places in 107 ms of which 2 ms to minimize.
[2024-05-20 13:58:59] [INFO ] Deduced a trap composed of 23 places in 100 ms of which 3 ms to minimize.
[2024-05-20 13:58:59] [INFO ] Deduced a trap composed of 23 places in 114 ms of which 3 ms to minimize.
[2024-05-20 13:59:00] [INFO ] Deduced a trap composed of 23 places in 101 ms of which 2 ms to minimize.
[2024-05-20 13:59:00] [INFO ] Deduced a trap composed of 23 places in 100 ms of which 3 ms to minimize.
[2024-05-20 13:59:00] [INFO ] Deduced a trap composed of 25 places in 115 ms of which 2 ms to minimize.
[2024-05-20 13:59:00] [INFO ] Deduced a trap composed of 23 places in 108 ms of which 3 ms to minimize.
[2024-05-20 13:59:00] [INFO ] Deduced a trap composed of 23 places in 100 ms of which 3 ms to minimize.
[2024-05-20 13:59:01] [INFO ] Deduced a trap composed of 24 places in 109 ms of which 2 ms to minimize.
[2024-05-20 13:59:01] [INFO ] Deduced a trap composed of 23 places in 115 ms of which 3 ms to minimize.
[2024-05-20 13:59:01] [INFO ] Deduced a trap composed of 23 places in 104 ms of which 3 ms to minimize.
[2024-05-20 13:59:01] [INFO ] Deduced a trap composed of 23 places in 119 ms of which 3 ms to minimize.
[2024-05-20 13:59:02] [INFO ] Deduced a trap composed of 23 places in 109 ms of which 3 ms to minimize.
[2024-05-20 13:59:02] [INFO ] Deduced a trap composed of 23 places in 107 ms of which 3 ms to minimize.
[2024-05-20 13:59:02] [INFO ] Deduced a trap composed of 23 places in 114 ms of which 2 ms to minimize.
[2024-05-20 13:59:02] [INFO ] Deduced a trap composed of 23 places in 105 ms of which 2 ms to minimize.
[2024-05-20 13:59:03] [INFO ] Deduced a trap composed of 23 places in 118 ms of which 2 ms to minimize.
[2024-05-20 13:59:03] [INFO ] Deduced a trap composed of 23 places in 106 ms of which 2 ms to minimize.
[2024-05-20 13:59:03] [INFO ] Deduced a trap composed of 23 places in 94 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/463 variables, 20/241 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2024-05-20 13:59:04] [INFO ] Deduced a trap composed of 23 places in 118 ms of which 4 ms to minimize.
[2024-05-20 13:59:05] [INFO ] Deduced a trap composed of 23 places in 108 ms of which 2 ms to minimize.
[2024-05-20 13:59:05] [INFO ] Deduced a trap composed of 23 places in 117 ms of which 3 ms to minimize.
[2024-05-20 13:59:05] [INFO ] Deduced a trap composed of 23 places in 104 ms of which 3 ms to minimize.
[2024-05-20 13:59:06] [INFO ] Deduced a trap composed of 23 places in 104 ms of which 2 ms to minimize.
[2024-05-20 13:59:06] [INFO ] Deduced a trap composed of 23 places in 115 ms of which 2 ms to minimize.
[2024-05-20 13:59:06] [INFO ] Deduced a trap composed of 23 places in 104 ms of which 3 ms to minimize.
[2024-05-20 13:59:06] [INFO ] Deduced a trap composed of 23 places in 114 ms of which 5 ms to minimize.
[2024-05-20 13:59:07] [INFO ] Deduced a trap composed of 23 places in 118 ms of which 2 ms to minimize.
[2024-05-20 13:59:07] [INFO ] Deduced a trap composed of 23 places in 109 ms of which 2 ms to minimize.
SMT process timed out in 60456ms, After SMT, problems are : Problem set: 0 solved, 822 unsolved
Search for dead transitions found 0 dead transitions in 60471ms
Starting structural reductions in SI_LTL mode, iteration 1 : 464/642 places, 842/1020 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 62490 ms. Remains : 464/642 places, 842/1020 transitions.
Computed a total of 21 stabilizing places and 40 stable transitions
Computed a total of 21 stabilizing places and 40 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 117 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 203 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Reduction of identical properties reduced properties to check from 5 to 4
RANDOM walk for 40000 steps (290 resets) in 316 ms. (126 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (12 resets) in 53 ms. (740 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (12 resets) in 91 ms. (434 steps per ms) remains 2/2 properties
[2024-05-20 13:59:07] [INFO ] Invariant cache hit.
[2024-05-20 13:59:07] [INFO ] State equation strengthened by 780 read => feed constraints.
Problem apf0 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 443/447 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-20 13:59:07] [INFO ] Deduced a trap composed of 2 places in 133 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/447 variables, 1/6 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/447 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 16/463 variables, 16/22 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/463 variables, 0/22 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 842/1305 variables, 463/485 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1305 variables, 780/1265 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1305 variables, 0/1265 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 1/1306 variables, 1/1266 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1306 variables, 0/1266 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1306 variables, 0/1266 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1306/1306 variables, and 1266 constraints, problems are : Problem set: 1 solved, 1 unsolved in 544 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 464/464 constraints, ReadFeed: 780/780 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 443/447 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/447 variables, 1/6 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/447 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 16/463 variables, 16/22 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-20 13:59:08] [INFO ] Deduced a trap composed of 23 places in 150 ms of which 3 ms to minimize.
[2024-05-20 13:59:08] [INFO ] Deduced a trap composed of 26 places in 147 ms of which 2 ms to minimize.
[2024-05-20 13:59:08] [INFO ] Deduced a trap composed of 23 places in 138 ms of which 3 ms to minimize.
[2024-05-20 13:59:09] [INFO ] Deduced a trap composed of 23 places in 156 ms of which 3 ms to minimize.
[2024-05-20 13:59:09] [INFO ] Deduced a trap composed of 23 places in 143 ms of which 3 ms to minimize.
[2024-05-20 13:59:09] [INFO ] Deduced a trap composed of 23 places in 141 ms of which 3 ms to minimize.
[2024-05-20 13:59:09] [INFO ] Deduced a trap composed of 23 places in 135 ms of which 3 ms to minimize.
[2024-05-20 13:59:09] [INFO ] Deduced a trap composed of 23 places in 141 ms of which 2 ms to minimize.
[2024-05-20 13:59:09] [INFO ] Deduced a trap composed of 23 places in 141 ms of which 3 ms to minimize.
[2024-05-20 13:59:09] [INFO ] Deduced a trap composed of 23 places in 131 ms of which 3 ms to minimize.
[2024-05-20 13:59:10] [INFO ] Deduced a trap composed of 23 places in 129 ms of which 2 ms to minimize.
[2024-05-20 13:59:10] [INFO ] Deduced a trap composed of 23 places in 125 ms of which 3 ms to minimize.
[2024-05-20 13:59:10] [INFO ] Deduced a trap composed of 24 places in 126 ms of which 2 ms to minimize.
[2024-05-20 13:59:10] [INFO ] Deduced a trap composed of 25 places in 127 ms of which 2 ms to minimize.
[2024-05-20 13:59:10] [INFO ] Deduced a trap composed of 23 places in 119 ms of which 2 ms to minimize.
[2024-05-20 13:59:10] [INFO ] Deduced a trap composed of 23 places in 127 ms of which 3 ms to minimize.
[2024-05-20 13:59:10] [INFO ] Deduced a trap composed of 23 places in 118 ms of which 2 ms to minimize.
[2024-05-20 13:59:11] [INFO ] Deduced a trap composed of 23 places in 122 ms of which 2 ms to minimize.
[2024-05-20 13:59:11] [INFO ] Deduced a trap composed of 23 places in 121 ms of which 3 ms to minimize.
[2024-05-20 13:59:11] [INFO ] Deduced a trap composed of 23 places in 117 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/463 variables, 20/42 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-20 13:59:11] [INFO ] Deduced a trap composed of 26 places in 118 ms of which 3 ms to minimize.
[2024-05-20 13:59:11] [INFO ] Deduced a trap composed of 27 places in 127 ms of which 3 ms to minimize.
[2024-05-20 13:59:11] [INFO ] Deduced a trap composed of 25 places in 118 ms of which 3 ms to minimize.
[2024-05-20 13:59:11] [INFO ] Deduced a trap composed of 23 places in 119 ms of which 2 ms to minimize.
[2024-05-20 13:59:11] [INFO ] Deduced a trap composed of 25 places in 113 ms of which 2 ms to minimize.
[2024-05-20 13:59:12] [INFO ] Deduced a trap composed of 23 places in 121 ms of which 3 ms to minimize.
[2024-05-20 13:59:12] [INFO ] Deduced a trap composed of 23 places in 113 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/463 variables, 7/49 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/463 variables, 0/49 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 842/1305 variables, 463/512 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1305 variables, 780/1292 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1305 variables, 1/1293 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1305 variables, 0/1293 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/1306 variables, 1/1294 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1306 variables, 0/1294 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/1306 variables, 0/1294 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1306/1306 variables, and 1294 constraints, problems are : Problem set: 1 solved, 1 unsolved in 4428 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 464/464 constraints, ReadFeed: 780/780 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 28/28 constraints]
After SMT, in 4990ms problems are : Problem set: 1 solved, 1 unsolved
Finished Parikh walk after 734 steps, including 88 resets, run visited all 1 properties in 4 ms. (steps per millisecond=183 )
Parikh walk visited 1 properties in 4 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (G (OR (NOT p0) (NOT p1)))]
False Knowledge obtained : [(F (NOT p1)), (F p0), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 12 factoid took 265 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 203 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Stuttering acceptance computed with spot in 202 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Stuttering acceptance computed with spot in 204 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Product exploration explored 100000 steps with 767 reset in 376 ms.
Product exploration explored 100000 steps with 755 reset in 384 ms.
Built C files in :
/tmp/ltsmin6123215832398937778
[2024-05-20 13:59:14] [INFO ] Computing symmetric may disable matrix : 842 transitions.
[2024-05-20 13:59:14] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-20 13:59:14] [INFO ] Computing symmetric may enable matrix : 842 transitions.
[2024-05-20 13:59:14] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-20 13:59:14] [INFO ] Computing Do-Not-Accords matrix : 842 transitions.
[2024-05-20 13:59:14] [INFO ] Computation of Completed DNA matrix. took 24 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-20 13:59:14] [INFO ] Built C files in 165ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6123215832398937778
Running compilation step : cd /tmp/ltsmin6123215832398937778;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2600 ms.
Running link step : cd /tmp/ltsmin6123215832398937778;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 73 ms.
Running LTSmin : cd /tmp/ltsmin6123215832398937778;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1641743806346174960.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 464 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 464/464 places, 842/842 transitions.
Applied a total of 0 rules in 26 ms. Remains 464 /464 variables (removed 0) and now considering 842/842 (removed 0) transitions.
[2024-05-20 13:59:29] [INFO ] Invariant cache hit.
[2024-05-20 13:59:29] [INFO ] Implicit Places using invariants in 283 ms returned []
[2024-05-20 13:59:29] [INFO ] Invariant cache hit.
[2024-05-20 13:59:29] [INFO ] State equation strengthened by 780 read => feed constraints.
[2024-05-20 13:59:31] [INFO ] Implicit Places using invariants and state equation in 1565 ms returned []
Implicit Place search using SMT with State Equation took 1890 ms to find 0 implicit places.
[2024-05-20 13:59:31] [INFO ] Redundant transitions in 105 ms returned []
Running 822 sub problems to find dead transitions.
[2024-05-20 13:59:31] [INFO ] Invariant cache hit.
[2024-05-20 13:59:31] [INFO ] State equation strengthened by 780 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/463 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2024-05-20 13:59:38] [INFO ] Deduced a trap composed of 23 places in 178 ms of which 3 ms to minimize.
[2024-05-20 13:59:38] [INFO ] Deduced a trap composed of 23 places in 173 ms of which 3 ms to minimize.
[2024-05-20 13:59:38] [INFO ] Deduced a trap composed of 23 places in 177 ms of which 3 ms to minimize.
[2024-05-20 13:59:38] [INFO ] Deduced a trap composed of 24 places in 157 ms of which 2 ms to minimize.
[2024-05-20 13:59:38] [INFO ] Deduced a trap composed of 23 places in 152 ms of which 3 ms to minimize.
[2024-05-20 13:59:38] [INFO ] Deduced a trap composed of 23 places in 154 ms of which 2 ms to minimize.
[2024-05-20 13:59:39] [INFO ] Deduced a trap composed of 23 places in 172 ms of which 3 ms to minimize.
[2024-05-20 13:59:39] [INFO ] Deduced a trap composed of 23 places in 150 ms of which 3 ms to minimize.
[2024-05-20 13:59:39] [INFO ] Deduced a trap composed of 23 places in 147 ms of which 3 ms to minimize.
[2024-05-20 13:59:39] [INFO ] Deduced a trap composed of 23 places in 151 ms of which 2 ms to minimize.
[2024-05-20 13:59:39] [INFO ] Deduced a trap composed of 23 places in 165 ms of which 2 ms to minimize.
[2024-05-20 13:59:39] [INFO ] Deduced a trap composed of 24 places in 148 ms of which 3 ms to minimize.
[2024-05-20 13:59:40] [INFO ] Deduced a trap composed of 28 places in 139 ms of which 2 ms to minimize.
[2024-05-20 13:59:40] [INFO ] Deduced a trap composed of 23 places in 135 ms of which 2 ms to minimize.
[2024-05-20 13:59:40] [INFO ] Deduced a trap composed of 23 places in 143 ms of which 3 ms to minimize.
[2024-05-20 13:59:40] [INFO ] Deduced a trap composed of 23 places in 159 ms of which 2 ms to minimize.
[2024-05-20 13:59:40] [INFO ] Deduced a trap composed of 23 places in 151 ms of which 3 ms to minimize.
[2024-05-20 13:59:40] [INFO ] Deduced a trap composed of 23 places in 130 ms of which 3 ms to minimize.
[2024-05-20 13:59:40] [INFO ] Deduced a trap composed of 24 places in 119 ms of which 2 ms to minimize.
[2024-05-20 13:59:41] [INFO ] Deduced a trap composed of 23 places in 145 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/463 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2024-05-20 13:59:42] [INFO ] Deduced a trap composed of 24 places in 141 ms of which 3 ms to minimize.
[2024-05-20 13:59:42] [INFO ] Deduced a trap composed of 23 places in 164 ms of which 3 ms to minimize.
[2024-05-20 13:59:42] [INFO ] Deduced a trap composed of 26 places in 151 ms of which 3 ms to minimize.
[2024-05-20 13:59:42] [INFO ] Deduced a trap composed of 23 places in 160 ms of which 19 ms to minimize.
[2024-05-20 13:59:43] [INFO ] Deduced a trap composed of 23 places in 151 ms of which 2 ms to minimize.
[2024-05-20 13:59:43] [INFO ] Deduced a trap composed of 23 places in 167 ms of which 3 ms to minimize.
[2024-05-20 13:59:43] [INFO ] Deduced a trap composed of 23 places in 150 ms of which 3 ms to minimize.
[2024-05-20 13:59:43] [INFO ] Deduced a trap composed of 24 places in 142 ms of which 2 ms to minimize.
[2024-05-20 13:59:43] [INFO ] Deduced a trap composed of 24 places in 130 ms of which 3 ms to minimize.
[2024-05-20 13:59:43] [INFO ] Deduced a trap composed of 23 places in 141 ms of which 2 ms to minimize.
[2024-05-20 13:59:43] [INFO ] Deduced a trap composed of 24 places in 137 ms of which 3 ms to minimize.
[2024-05-20 13:59:44] [INFO ] Deduced a trap composed of 24 places in 139 ms of which 3 ms to minimize.
[2024-05-20 13:59:44] [INFO ] Deduced a trap composed of 24 places in 143 ms of which 3 ms to minimize.
[2024-05-20 13:59:44] [INFO ] Deduced a trap composed of 24 places in 141 ms of which 3 ms to minimize.
[2024-05-20 13:59:44] [INFO ] Deduced a trap composed of 24 places in 155 ms of which 3 ms to minimize.
[2024-05-20 13:59:44] [INFO ] Deduced a trap composed of 24 places in 149 ms of which 3 ms to minimize.
[2024-05-20 13:59:44] [INFO ] Deduced a trap composed of 26 places in 137 ms of which 3 ms to minimize.
[2024-05-20 13:59:44] [INFO ] Deduced a trap composed of 23 places in 134 ms of which 2 ms to minimize.
[2024-05-20 13:59:45] [INFO ] Deduced a trap composed of 23 places in 141 ms of which 3 ms to minimize.
[2024-05-20 13:59:45] [INFO ] Deduced a trap composed of 23 places in 146 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/463 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2024-05-20 13:59:46] [INFO ] Deduced a trap composed of 23 places in 134 ms of which 2 ms to minimize.
[2024-05-20 13:59:46] [INFO ] Deduced a trap composed of 23 places in 142 ms of which 3 ms to minimize.
[2024-05-20 13:59:46] [INFO ] Deduced a trap composed of 23 places in 142 ms of which 3 ms to minimize.
[2024-05-20 13:59:46] [INFO ] Deduced a trap composed of 23 places in 146 ms of which 3 ms to minimize.
[2024-05-20 13:59:46] [INFO ] Deduced a trap composed of 26 places in 137 ms of which 3 ms to minimize.
[2024-05-20 13:59:47] [INFO ] Deduced a trap composed of 23 places in 121 ms of which 3 ms to minimize.
[2024-05-20 13:59:47] [INFO ] Deduced a trap composed of 23 places in 147 ms of which 2 ms to minimize.
[2024-05-20 13:59:47] [INFO ] Deduced a trap composed of 23 places in 133 ms of which 2 ms to minimize.
[2024-05-20 13:59:47] [INFO ] Deduced a trap composed of 23 places in 125 ms of which 2 ms to minimize.
[2024-05-20 13:59:47] [INFO ] Deduced a trap composed of 23 places in 122 ms of which 2 ms to minimize.
[2024-05-20 13:59:47] [INFO ] Deduced a trap composed of 23 places in 112 ms of which 2 ms to minimize.
[2024-05-20 13:59:47] [INFO ] Deduced a trap composed of 23 places in 120 ms of which 3 ms to minimize.
[2024-05-20 13:59:47] [INFO ] Deduced a trap composed of 23 places in 136 ms of which 2 ms to minimize.
[2024-05-20 13:59:48] [INFO ] Deduced a trap composed of 25 places in 132 ms of which 3 ms to minimize.
[2024-05-20 13:59:48] [INFO ] Deduced a trap composed of 23 places in 135 ms of which 2 ms to minimize.
[2024-05-20 13:59:48] [INFO ] Deduced a trap composed of 23 places in 137 ms of which 2 ms to minimize.
[2024-05-20 13:59:48] [INFO ] Deduced a trap composed of 23 places in 134 ms of which 3 ms to minimize.
[2024-05-20 13:59:48] [INFO ] Deduced a trap composed of 23 places in 126 ms of which 3 ms to minimize.
[2024-05-20 13:59:48] [INFO ] Deduced a trap composed of 23 places in 127 ms of which 3 ms to minimize.
[2024-05-20 13:59:49] [INFO ] Deduced a trap composed of 23 places in 155 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/463 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2024-05-20 13:59:55] [INFO ] Deduced a trap composed of 23 places in 136 ms of which 3 ms to minimize.
[2024-05-20 13:59:55] [INFO ] Deduced a trap composed of 23 places in 124 ms of which 3 ms to minimize.
[2024-05-20 13:59:55] [INFO ] Deduced a trap composed of 23 places in 115 ms of which 3 ms to minimize.
[2024-05-20 13:59:55] [INFO ] Deduced a trap composed of 23 places in 124 ms of which 2 ms to minimize.
[2024-05-20 13:59:55] [INFO ] Deduced a trap composed of 24 places in 115 ms of which 2 ms to minimize.
[2024-05-20 13:59:56] [INFO ] Deduced a trap composed of 23 places in 129 ms of which 2 ms to minimize.
[2024-05-20 13:59:56] [INFO ] Deduced a trap composed of 23 places in 150 ms of which 3 ms to minimize.
[2024-05-20 13:59:56] [INFO ] Deduced a trap composed of 24 places in 155 ms of which 3 ms to minimize.
[2024-05-20 13:59:56] [INFO ] Deduced a trap composed of 23 places in 140 ms of which 3 ms to minimize.
[2024-05-20 13:59:56] [INFO ] Deduced a trap composed of 23 places in 137 ms of which 3 ms to minimize.
[2024-05-20 13:59:56] [INFO ] Deduced a trap composed of 24 places in 135 ms of which 2 ms to minimize.
[2024-05-20 13:59:57] [INFO ] Deduced a trap composed of 24 places in 142 ms of which 2 ms to minimize.
[2024-05-20 13:59:57] [INFO ] Deduced a trap composed of 23 places in 134 ms of which 3 ms to minimize.
[2024-05-20 13:59:57] [INFO ] Deduced a trap composed of 23 places in 136 ms of which 2 ms to minimize.
[2024-05-20 13:59:57] [INFO ] Deduced a trap composed of 23 places in 134 ms of which 2 ms to minimize.
[2024-05-20 13:59:57] [INFO ] Deduced a trap composed of 26 places in 125 ms of which 2 ms to minimize.
[2024-05-20 13:59:57] [INFO ] Deduced a trap composed of 23 places in 121 ms of which 3 ms to minimize.
[2024-05-20 13:59:57] [INFO ] Deduced a trap composed of 23 places in 121 ms of which 2 ms to minimize.
[2024-05-20 13:59:58] [INFO ] Deduced a trap composed of 23 places in 116 ms of which 2 ms to minimize.
[2024-05-20 13:59:58] [INFO ] Deduced a trap composed of 26 places in 118 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/463 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2024-05-20 13:59:59] [INFO ] Deduced a trap composed of 23 places in 143 ms of which 2 ms to minimize.
[2024-05-20 13:59:59] [INFO ] Deduced a trap composed of 24 places in 157 ms of which 2 ms to minimize.
[2024-05-20 13:59:59] [INFO ] Deduced a trap composed of 24 places in 145 ms of which 3 ms to minimize.
[2024-05-20 13:59:59] [INFO ] Deduced a trap composed of 23 places in 137 ms of which 3 ms to minimize.
[2024-05-20 14:00:00] [INFO ] Deduced a trap composed of 29 places in 152 ms of which 3 ms to minimize.
[2024-05-20 14:00:00] [INFO ] Deduced a trap composed of 26 places in 155 ms of which 3 ms to minimize.
[2024-05-20 14:00:00] [INFO ] Deduced a trap composed of 23 places in 134 ms of which 2 ms to minimize.
[2024-05-20 14:00:00] [INFO ] Deduced a trap composed of 23 places in 125 ms of which 3 ms to minimize.
[2024-05-20 14:00:00] [INFO ] Deduced a trap composed of 29 places in 144 ms of which 2 ms to minimize.
[2024-05-20 14:00:00] [INFO ] Deduced a trap composed of 27 places in 134 ms of which 3 ms to minimize.
[2024-05-20 14:00:01] [INFO ] Deduced a trap composed of 23 places in 135 ms of which 3 ms to minimize.
[2024-05-20 14:00:01] [INFO ] Deduced a trap composed of 23 places in 130 ms of which 2 ms to minimize.
[2024-05-20 14:00:01] [INFO ] Deduced a trap composed of 23 places in 131 ms of which 3 ms to minimize.
[2024-05-20 14:00:01] [INFO ] Deduced a trap composed of 26 places in 128 ms of which 3 ms to minimize.
[2024-05-20 14:00:01] [INFO ] Deduced a trap composed of 24 places in 137 ms of which 4 ms to minimize.
[2024-05-20 14:00:01] [INFO ] Deduced a trap composed of 23 places in 113 ms of which 2 ms to minimize.
SMT process timed out in 30303ms, After SMT, problems are : Problem set: 0 solved, 822 unsolved
Search for dead transitions found 0 dead transitions in 30310ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 32338 ms. Remains : 464/464 places, 842/842 transitions.
Built C files in :
/tmp/ltsmin15547103731508299787
[2024-05-20 14:00:01] [INFO ] Computing symmetric may disable matrix : 842 transitions.
[2024-05-20 14:00:01] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-20 14:00:01] [INFO ] Computing symmetric may enable matrix : 842 transitions.
[2024-05-20 14:00:01] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-20 14:00:01] [INFO ] Computing Do-Not-Accords matrix : 842 transitions.
[2024-05-20 14:00:01] [INFO ] Computation of Completed DNA matrix. took 46 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-20 14:00:01] [INFO ] Built C files in 176ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15547103731508299787
Running compilation step : cd /tmp/ltsmin15547103731508299787;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2542 ms.
Running link step : cd /tmp/ltsmin15547103731508299787;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin15547103731508299787;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased8629706331965175531.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-20 14:00:16] [INFO ] Flatten gal took : 51 ms
[2024-05-20 14:00:16] [INFO ] Flatten gal took : 33 ms
[2024-05-20 14:00:16] [INFO ] Time to serialize gal into /tmp/LTL5951805688501330151.gal : 7 ms
[2024-05-20 14:00:16] [INFO ] Time to serialize properties into /tmp/LTL11891417677558615595.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5951805688501330151.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16311777755581591218.hoa' '-atoms' '/tmp/LTL11891417677558615595.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL11891417677558615595.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16311777755581591218.hoa
Detected timeout of ITS tools.
[2024-05-20 14:00:32] [INFO ] Flatten gal took : 29 ms
[2024-05-20 14:00:32] [INFO ] Flatten gal took : 26 ms
[2024-05-20 14:00:32] [INFO ] Time to serialize gal into /tmp/LTL17883134476067416482.gal : 6 ms
[2024-05-20 14:00:32] [INFO ] Time to serialize properties into /tmp/LTL7953628177845728076.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17883134476067416482.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7953628177845728076.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(F((G(F("((Node7IsInserted<1)||(Node2requestsent7<1))")))||("(((Node7IsInserted>=1)&&(Node2requestsent7>=1))&&(((Node7IsInserted<1...237
Formula 0 simplified : XG(!"(((Node7IsInserted>=1)&&(Node2requestsent7>=1))&&(((Node7IsInserted<1)||(Node2requestsent7<1))||((Node15IsInserted<1)||(Node17r...227
Detected timeout of ITS tools.
[2024-05-20 14:00:47] [INFO ] Flatten gal took : 28 ms
[2024-05-20 14:00:47] [INFO ] Applying decomposition
[2024-05-20 14:00:47] [INFO ] Flatten gal took : 25 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph13426598148611266873.txt' '-o' '/tmp/graph13426598148611266873.bin' '-w' '/tmp/graph13426598148611266873.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13426598148611266873.bin' '-l' '-1' '-v' '-w' '/tmp/graph13426598148611266873.weights' '-q' '0' '-e' '0.001'
[2024-05-20 14:00:47] [INFO ] Decomposing Gal with order
[2024-05-20 14:00:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 14:00:47] [INFO ] Removed a total of 769 redundant transitions.
[2024-05-20 14:00:47] [INFO ] Flatten gal took : 170 ms
[2024-05-20 14:00:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 720 labels/synchronizations in 31 ms.
[2024-05-20 14:00:47] [INFO ] Time to serialize gal into /tmp/LTL15668320699682833651.gal : 7 ms
[2024-05-20 14:00:47] [INFO ] Time to serialize properties into /tmp/LTL6069125039997874456.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15668320699682833651.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6069125039997874456.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(F((G(F("((u12.Node7IsInserted<1)||(u3.Node2requestsent7<1))")))||("(((u12.Node7IsInserted>=1)&&(u3.Node2requestsent7>=1))&&(((u12...266
Formula 0 simplified : XG(!"(((u12.Node7IsInserted>=1)&&(u3.Node2requestsent7>=1))&&(((u12.Node7IsInserted<1)||(u3.Node2requestsent7<1))||((u14.Node15IsIns...256
Detected timeout of ITS tools.
Treatment of property CANConstruction-PT-020-LTLFireability-00 finished in 191089 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 4 out of 656 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 656/656 places, 1042/1042 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 131 transitions
Trivial Post-agglo rules discarded 131 transitions
Performed 131 trivial Post agglomeration. Transition count delta: 131
Iterating post reduction 0 with 131 rules applied. Total rules applied 131 place count 656 transition count 911
Reduce places removed 131 places and 0 transitions.
Iterating post reduction 1 with 131 rules applied. Total rules applied 262 place count 525 transition count 911
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 262 place count 525 transition count 893
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 298 place count 507 transition count 893
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 308 place count 497 transition count 873
Iterating global reduction 2 with 10 rules applied. Total rules applied 318 place count 497 transition count 873
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 2 with 9 rules applied. Total rules applied 327 place count 497 transition count 864
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 336 place count 488 transition count 864
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 36 rules applied. Total rules applied 372 place count 470 transition count 846
Applied a total of 372 rules in 83 ms. Remains 470 /656 variables (removed 186) and now considering 846/1042 (removed 196) transitions.
// Phase 1: matrix 846 rows 470 cols
[2024-05-20 14:01:02] [INFO ] Computed 23 invariants in 3 ms
[2024-05-20 14:01:03] [INFO ] Implicit Places using invariants in 254 ms returned [28, 43]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 256 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 468/656 places, 846/1042 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 468 transition count 842
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 464 transition count 842
Applied a total of 8 rules in 28 ms. Remains 464 /468 variables (removed 4) and now considering 842/846 (removed 4) transitions.
// Phase 1: matrix 842 rows 464 cols
[2024-05-20 14:01:03] [INFO ] Computed 21 invariants in 4 ms
[2024-05-20 14:01:03] [INFO ] Implicit Places using invariants in 242 ms returned []
[2024-05-20 14:01:03] [INFO ] Invariant cache hit.
[2024-05-20 14:01:03] [INFO ] State equation strengthened by 780 read => feed constraints.
[2024-05-20 14:01:04] [INFO ] Implicit Places using invariants and state equation in 1587 ms returned []
Implicit Place search using SMT with State Equation took 1832 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 464/656 places, 842/1042 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2200 ms. Remains : 464/656 places, 842/1042 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Running random walk in product with property : CANConstruction-PT-020-LTLFireability-02
Stuttering criterion allowed to conclude after 121 steps with 0 reset in 1 ms.
FORMULA CANConstruction-PT-020-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-020-LTLFireability-02 finished in 2277 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(F(p0))||G(p1))))'
Support contains 5 out of 656 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 656/656 places, 1042/1042 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 647 transition count 1024
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 647 transition count 1024
Applied a total of 18 rules in 41 ms. Remains 647 /656 variables (removed 9) and now considering 1024/1042 (removed 18) transitions.
// Phase 1: matrix 1024 rows 647 cols
[2024-05-20 14:01:04] [INFO ] Computed 23 invariants in 8 ms
[2024-05-20 14:01:05] [INFO ] Implicit Places using invariants in 274 ms returned [146]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 276 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 646/656 places, 1024/1042 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 645 transition count 1023
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 645 transition count 1023
Applied a total of 2 rules in 24 ms. Remains 645 /646 variables (removed 1) and now considering 1023/1024 (removed 1) transitions.
// Phase 1: matrix 1023 rows 645 cols
[2024-05-20 14:01:05] [INFO ] Computed 22 invariants in 8 ms
[2024-05-20 14:01:05] [INFO ] Implicit Places using invariants in 277 ms returned []
[2024-05-20 14:01:05] [INFO ] Invariant cache hit.
[2024-05-20 14:01:05] [INFO ] State equation strengthened by 780 read => feed constraints.
[2024-05-20 14:01:07] [INFO ] Implicit Places using invariants and state equation in 1910 ms returned []
Implicit Place search using SMT with State Equation took 2189 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 645/656 places, 1023/1042 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2530 ms. Remains : 645/656 places, 1023/1042 transitions.
Stuttering acceptance computed with spot in 164 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-020-LTLFireability-03
Stuttering criterion allowed to conclude after 1887 steps with 4 reset in 8 ms.
FORMULA CANConstruction-PT-020-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-020-LTLFireability-03 finished in 2730 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 656 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 656/656 places, 1042/1042 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 646 transition count 1022
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 646 transition count 1022
Applied a total of 20 rules in 29 ms. Remains 646 /656 variables (removed 10) and now considering 1022/1042 (removed 20) transitions.
// Phase 1: matrix 1022 rows 646 cols
[2024-05-20 14:01:07] [INFO ] Computed 23 invariants in 11 ms
[2024-05-20 14:01:07] [INFO ] Implicit Places using invariants in 282 ms returned [96, 146]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 283 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 644/656 places, 1022/1042 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 642 transition count 1020
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 642 transition count 1020
Applied a total of 4 rules in 25 ms. Remains 642 /644 variables (removed 2) and now considering 1020/1022 (removed 2) transitions.
// Phase 1: matrix 1020 rows 642 cols
[2024-05-20 14:01:08] [INFO ] Computed 21 invariants in 10 ms
[2024-05-20 14:01:08] [INFO ] Implicit Places using invariants in 268 ms returned []
[2024-05-20 14:01:08] [INFO ] Invariant cache hit.
[2024-05-20 14:01:08] [INFO ] State equation strengthened by 780 read => feed constraints.
[2024-05-20 14:01:10] [INFO ] Implicit Places using invariants and state equation in 1880 ms returned []
Implicit Place search using SMT with State Equation took 2150 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 642/656 places, 1020/1042 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2487 ms. Remains : 642/656 places, 1020/1042 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-020-LTLFireability-05
Stuttering criterion allowed to conclude after 459 steps with 1 reset in 3 ms.
FORMULA CANConstruction-PT-020-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-020-LTLFireability-05 finished in 2588 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 3 out of 656 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 656/656 places, 1042/1042 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 131 transitions
Trivial Post-agglo rules discarded 131 transitions
Performed 131 trivial Post agglomeration. Transition count delta: 131
Iterating post reduction 0 with 131 rules applied. Total rules applied 131 place count 656 transition count 911
Reduce places removed 131 places and 0 transitions.
Iterating post reduction 1 with 131 rules applied. Total rules applied 262 place count 525 transition count 911
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 262 place count 525 transition count 893
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 298 place count 507 transition count 893
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 307 place count 498 transition count 875
Iterating global reduction 2 with 9 rules applied. Total rules applied 316 place count 498 transition count 875
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 2 with 8 rules applied. Total rules applied 324 place count 498 transition count 867
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 332 place count 490 transition count 867
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 4 with 40 rules applied. Total rules applied 372 place count 470 transition count 847
Applied a total of 372 rules in 67 ms. Remains 470 /656 variables (removed 186) and now considering 847/1042 (removed 195) transitions.
// Phase 1: matrix 847 rows 470 cols
[2024-05-20 14:01:10] [INFO ] Computed 23 invariants in 7 ms
[2024-05-20 14:01:10] [INFO ] Implicit Places using invariants in 237 ms returned [27, 42]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 238 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 468/656 places, 847/1042 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 468 transition count 843
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 464 transition count 843
Applied a total of 8 rules in 25 ms. Remains 464 /468 variables (removed 4) and now considering 843/847 (removed 4) transitions.
// Phase 1: matrix 843 rows 464 cols
[2024-05-20 14:01:10] [INFO ] Computed 21 invariants in 6 ms
[2024-05-20 14:01:10] [INFO ] Implicit Places using invariants in 232 ms returned []
[2024-05-20 14:01:10] [INFO ] Invariant cache hit.
[2024-05-20 14:01:11] [INFO ] State equation strengthened by 780 read => feed constraints.
[2024-05-20 14:01:12] [INFO ] Implicit Places using invariants and state equation in 1618 ms returned []
Implicit Place search using SMT with State Equation took 1852 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 464/656 places, 843/1042 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2182 ms. Remains : 464/656 places, 843/1042 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : CANConstruction-PT-020-LTLFireability-06
Stuttering criterion allowed to conclude after 135 steps with 0 reset in 2 ms.
FORMULA CANConstruction-PT-020-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-020-LTLFireability-06 finished in 2243 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((X(p1)||p0)))'
Support contains 3 out of 656 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 656/656 places, 1042/1042 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 646 transition count 1022
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 646 transition count 1022
Applied a total of 20 rules in 27 ms. Remains 646 /656 variables (removed 10) and now considering 1022/1042 (removed 20) transitions.
// Phase 1: matrix 1022 rows 646 cols
[2024-05-20 14:01:12] [INFO ] Computed 23 invariants in 7 ms
[2024-05-20 14:01:12] [INFO ] Implicit Places using invariants in 273 ms returned [96, 146]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 275 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 644/656 places, 1022/1042 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 642 transition count 1020
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 642 transition count 1020
Applied a total of 4 rules in 24 ms. Remains 642 /644 variables (removed 2) and now considering 1020/1022 (removed 2) transitions.
// Phase 1: matrix 1020 rows 642 cols
[2024-05-20 14:01:12] [INFO ] Computed 21 invariants in 6 ms
[2024-05-20 14:01:13] [INFO ] Implicit Places using invariants in 273 ms returned []
[2024-05-20 14:01:13] [INFO ] Invariant cache hit.
[2024-05-20 14:01:13] [INFO ] State equation strengthened by 780 read => feed constraints.
[2024-05-20 14:01:15] [INFO ] Implicit Places using invariants and state equation in 1963 ms returned []
Implicit Place search using SMT with State Equation took 2239 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 642/656 places, 1020/1042 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2566 ms. Remains : 642/656 places, 1020/1042 transitions.
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CANConstruction-PT-020-LTLFireability-08
Stuttering criterion allowed to conclude after 364 steps with 0 reset in 2 ms.
FORMULA CANConstruction-PT-020-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-020-LTLFireability-08 finished in 2666 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(!(p0 U p1)))||!(p0 U !p0)))'
Support contains 2 out of 656 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 656/656 places, 1042/1042 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 648 transition count 1026
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 648 transition count 1026
Applied a total of 16 rules in 43 ms. Remains 648 /656 variables (removed 8) and now considering 1026/1042 (removed 16) transitions.
// Phase 1: matrix 1026 rows 648 cols
[2024-05-20 14:01:15] [INFO ] Computed 23 invariants in 4 ms
[2024-05-20 14:01:15] [INFO ] Implicit Places using invariants in 304 ms returned [96, 146]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 318 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 646/656 places, 1026/1042 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 644 transition count 1024
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 644 transition count 1024
Applied a total of 4 rules in 35 ms. Remains 644 /646 variables (removed 2) and now considering 1024/1026 (removed 2) transitions.
// Phase 1: matrix 1024 rows 644 cols
[2024-05-20 14:01:15] [INFO ] Computed 21 invariants in 3 ms
[2024-05-20 14:01:15] [INFO ] Implicit Places using invariants in 292 ms returned []
[2024-05-20 14:01:15] [INFO ] Invariant cache hit.
[2024-05-20 14:01:16] [INFO ] State equation strengthened by 780 read => feed constraints.
[2024-05-20 14:01:17] [INFO ] Implicit Places using invariants and state equation in 1715 ms returned []
Implicit Place search using SMT with State Equation took 2022 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 644/656 places, 1024/1042 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2418 ms. Remains : 644/656 places, 1024/1042 transitions.
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p0) p1), p1, (AND (NOT p0) p1)]
Running random walk in product with property : CANConstruction-PT-020-LTLFireability-09
Product exploration explored 100000 steps with 50000 reset in 297 ms.
Product exploration explored 100000 steps with 50000 reset in 313 ms.
Computed a total of 61 stabilizing places and 80 stable transitions
Computed a total of 61 stabilizing places and 80 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 130 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CANConstruction-PT-020-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANConstruction-PT-020-LTLFireability-09 finished in 3298 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((p0&&X(p1))))))'
Support contains 3 out of 656 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 656/656 places, 1042/1042 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 646 transition count 1022
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 646 transition count 1022
Applied a total of 20 rules in 28 ms. Remains 646 /656 variables (removed 10) and now considering 1022/1042 (removed 20) transitions.
// Phase 1: matrix 1022 rows 646 cols
[2024-05-20 14:01:18] [INFO ] Computed 23 invariants in 5 ms
[2024-05-20 14:01:18] [INFO ] Implicit Places using invariants in 267 ms returned [96, 146]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 287 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 644/656 places, 1022/1042 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 642 transition count 1020
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 642 transition count 1020
Applied a total of 4 rules in 24 ms. Remains 642 /644 variables (removed 2) and now considering 1020/1022 (removed 2) transitions.
// Phase 1: matrix 1020 rows 642 cols
[2024-05-20 14:01:18] [INFO ] Computed 21 invariants in 3 ms
[2024-05-20 14:01:19] [INFO ] Implicit Places using invariants in 254 ms returned []
[2024-05-20 14:01:19] [INFO ] Invariant cache hit.
[2024-05-20 14:01:19] [INFO ] State equation strengthened by 780 read => feed constraints.
[2024-05-20 14:01:20] [INFO ] Implicit Places using invariants and state equation in 1832 ms returned []
Implicit Place search using SMT with State Equation took 2120 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 642/656 places, 1020/1042 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2459 ms. Remains : 642/656 places, 1020/1042 transitions.
Stuttering acceptance computed with spot in 150 ms :[true, (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : CANConstruction-PT-020-LTLFireability-10
Entered a terminal (fully accepting) state of product in 5824 steps with 16 reset in 17 ms.
FORMULA CANConstruction-PT-020-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-020-LTLFireability-10 finished in 2641 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 656 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 656/656 places, 1042/1042 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 131 transitions
Trivial Post-agglo rules discarded 131 transitions
Performed 131 trivial Post agglomeration. Transition count delta: 131
Iterating post reduction 0 with 131 rules applied. Total rules applied 131 place count 656 transition count 911
Reduce places removed 131 places and 0 transitions.
Iterating post reduction 1 with 131 rules applied. Total rules applied 262 place count 525 transition count 911
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 262 place count 525 transition count 893
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 298 place count 507 transition count 893
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 307 place count 498 transition count 875
Iterating global reduction 2 with 9 rules applied. Total rules applied 316 place count 498 transition count 875
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 2 with 8 rules applied. Total rules applied 324 place count 498 transition count 867
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 332 place count 490 transition count 867
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 4 with 42 rules applied. Total rules applied 374 place count 469 transition count 846
Applied a total of 374 rules in 49 ms. Remains 469 /656 variables (removed 187) and now considering 846/1042 (removed 196) transitions.
// Phase 1: matrix 846 rows 469 cols
[2024-05-20 14:01:21] [INFO ] Computed 23 invariants in 2 ms
[2024-05-20 14:01:21] [INFO ] Implicit Places using invariants in 359 ms returned [26, 41]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 375 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 467/656 places, 846/1042 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 467 transition count 842
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 463 transition count 842
Applied a total of 8 rules in 18 ms. Remains 463 /467 variables (removed 4) and now considering 842/846 (removed 4) transitions.
// Phase 1: matrix 842 rows 463 cols
[2024-05-20 14:01:21] [INFO ] Computed 21 invariants in 3 ms
[2024-05-20 14:01:21] [INFO ] Implicit Places using invariants in 420 ms returned []
[2024-05-20 14:01:21] [INFO ] Invariant cache hit.
[2024-05-20 14:01:22] [INFO ] State equation strengthened by 780 read => feed constraints.
[2024-05-20 14:01:23] [INFO ] Implicit Places using invariants and state equation in 1563 ms returned []
Implicit Place search using SMT with State Equation took 2006 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 463/656 places, 842/1042 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2449 ms. Remains : 463/656 places, 842/1042 transitions.
Stuttering acceptance computed with spot in 59 ms :[(NOT p0)]
Running random walk in product with property : CANConstruction-PT-020-LTLFireability-12
Product exploration explored 100000 steps with 747 reset in 381 ms.
Stack based approach found an accepted trace after 24617 steps with 184 reset with depth 138 and stack size 138 in 111 ms.
FORMULA CANConstruction-PT-020-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property CANConstruction-PT-020-LTLFireability-12 finished in 3032 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||F(G((F(p2)||p1))))))'
Support contains 5 out of 656 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 656/656 places, 1042/1042 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 649 transition count 1028
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 649 transition count 1028
Applied a total of 14 rules in 26 ms. Remains 649 /656 variables (removed 7) and now considering 1028/1042 (removed 14) transitions.
// Phase 1: matrix 1028 rows 649 cols
[2024-05-20 14:01:24] [INFO ] Computed 23 invariants in 13 ms
[2024-05-20 14:01:24] [INFO ] Implicit Places using invariants in 307 ms returned [96, 146]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 323 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 647/656 places, 1028/1042 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 645 transition count 1026
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 645 transition count 1026
Applied a total of 4 rules in 29 ms. Remains 645 /647 variables (removed 2) and now considering 1026/1028 (removed 2) transitions.
// Phase 1: matrix 1026 rows 645 cols
[2024-05-20 14:01:24] [INFO ] Computed 21 invariants in 4 ms
[2024-05-20 14:01:24] [INFO ] Implicit Places using invariants in 258 ms returned []
[2024-05-20 14:01:24] [INFO ] Invariant cache hit.
[2024-05-20 14:01:25] [INFO ] State equation strengthened by 780 read => feed constraints.
[2024-05-20 14:01:26] [INFO ] Implicit Places using invariants and state equation in 1844 ms returned []
Implicit Place search using SMT with State Equation took 2146 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 645/656 places, 1026/1042 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2524 ms. Remains : 645/656 places, 1026/1042 transitions.
Stuttering acceptance computed with spot in 149 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : CANConstruction-PT-020-LTLFireability-13
Product exploration explored 100000 steps with 50000 reset in 307 ms.
Product exploration explored 100000 steps with 50000 reset in 328 ms.
Computed a total of 61 stabilizing places and 80 stable transitions
Computed a total of 61 stabilizing places and 80 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 67 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CANConstruction-PT-020-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANConstruction-PT-020-LTLFireability-13 finished in 3413 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(((G(F(!p0))||G(!p1)) U p2))))'
Support contains 7 out of 656 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 656/656 places, 1042/1042 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 127 transitions
Trivial Post-agglo rules discarded 127 transitions
Performed 127 trivial Post agglomeration. Transition count delta: 127
Iterating post reduction 0 with 127 rules applied. Total rules applied 127 place count 656 transition count 915
Reduce places removed 127 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 128 rules applied. Total rules applied 255 place count 529 transition count 914
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 256 place count 528 transition count 914
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 18 Pre rules applied. Total rules applied 256 place count 528 transition count 896
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 292 place count 510 transition count 896
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 302 place count 500 transition count 876
Iterating global reduction 3 with 10 rules applied. Total rules applied 312 place count 500 transition count 876
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 3 with 8 rules applied. Total rules applied 320 place count 500 transition count 868
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 328 place count 492 transition count 868
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 5 with 34 rules applied. Total rules applied 362 place count 475 transition count 851
Applied a total of 362 rules in 117 ms. Remains 475 /656 variables (removed 181) and now considering 851/1042 (removed 191) transitions.
// Phase 1: matrix 851 rows 475 cols
[2024-05-20 14:01:27] [INFO ] Computed 23 invariants in 8 ms
[2024-05-20 14:01:28] [INFO ] Implicit Places using invariants in 562 ms returned [27, 43]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 564 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 473/656 places, 851/1042 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 473 transition count 847
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 469 transition count 847
Applied a total of 8 rules in 36 ms. Remains 469 /473 variables (removed 4) and now considering 847/851 (removed 4) transitions.
// Phase 1: matrix 847 rows 469 cols
[2024-05-20 14:01:28] [INFO ] Computed 21 invariants in 10 ms
[2024-05-20 14:01:28] [INFO ] Implicit Places using invariants in 331 ms returned []
[2024-05-20 14:01:28] [INFO ] Invariant cache hit.
[2024-05-20 14:01:28] [INFO ] State equation strengthened by 780 read => feed constraints.
[2024-05-20 14:01:30] [INFO ] Implicit Places using invariants and state equation in 1535 ms returned []
Implicit Place search using SMT with State Equation took 1868 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 469/656 places, 847/1042 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2585 ms. Remains : 469/656 places, 847/1042 transitions.
Stuttering acceptance computed with spot in 363 ms :[(NOT p2), (AND p1 (NOT p2) p0), (NOT p2), (AND p0 (NOT p2)), (AND (NOT p2) p1 p0), (AND p0 (NOT p2)), (AND p0 (NOT p2))]
Running random walk in product with property : CANConstruction-PT-020-LTLFireability-14
Product exploration explored 100000 steps with 716 reset in 360 ms.
Product exploration explored 100000 steps with 714 reset in 403 ms.
Computed a total of 21 stabilizing places and 40 stable transitions
Computed a total of 21 stabilizing places and 40 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (NOT (AND p0 p1))), (X (NOT (AND p2 p0 p1))), (X (NOT (AND (NOT p2) p0 p1))), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT (OR (AND p2 p0) (AND p0 (NOT p1))))), (X (NOT p1)), (X (NOT (AND (NOT p2) p1))), (X (NOT p0)), (X (NOT (AND p2 p0 (NOT p1)))), (X (X (NOT p2))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p2 p0 p1)))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (OR (AND p2 p0) (AND p0 (NOT p1)))))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p0))), (X (X (NOT (AND p2 p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 23 factoid took 146 ms. Reduced automaton from 7 states, 30 edges and 3 AP (stutter insensitive) to 7 states, 29 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 339 ms :[(NOT p2), (AND p1 (NOT p2) p0), (NOT p2), (AND p0 (NOT p2)), (AND p1 (NOT p2) p0), (AND p0 (NOT p2)), (AND (NOT p1) (NOT p2) p0)]
RANDOM walk for 40000 steps (276 resets) in 308 ms. (129 steps per ms) remains 4/11 properties
BEST_FIRST walk for 40004 steps (10 resets) in 96 ms. (412 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40004 steps (9 resets) in 111 ms. (357 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 109 ms. (363 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (11 resets) in 76 ms. (519 steps per ms) remains 3/3 properties
[2024-05-20 14:01:32] [INFO ] Invariant cache hit.
[2024-05-20 14:01:32] [INFO ] State equation strengthened by 780 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf4 is UNSAT
Problem apf6 is UNSAT
Problem apf9 is UNSAT
After SMT solving in domain Real declared 454/1316 variables, and 7 constraints, problems are : Problem set: 3 solved, 0 unsolved in 74 ms.
Refiners :[Positive P Invariants (semi-flows): 7/21 constraints, State Equation: 0/469 constraints, ReadFeed: 0/780 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 91ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (NOT (AND p0 p1))), (X (NOT (AND p2 p0 p1))), (X (NOT (AND (NOT p2) p0 p1))), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT (OR (AND p2 p0) (AND p0 (NOT p1))))), (X (NOT p1)), (X (NOT (AND (NOT p2) p1))), (X (NOT p0)), (X (NOT (AND p2 p0 (NOT p1)))), (X (X (NOT p2))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p2 p0 p1)))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (OR (AND p2 p0) (AND p0 (NOT p1)))))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p0))), (X (X (NOT (AND p2 p0 (NOT p1))))), (G (OR (NOT p1) (NOT p0))), (G (OR (NOT p1) (NOT p2) (NOT p0))), (G (OR (NOT p1) p2 (NOT p0)))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT (OR (NOT p1) p2))), (F p2), (F (NOT (OR p1 p2 (NOT p0)))), (F (NOT (OR p1 (NOT p2) (NOT p0)))), (F p0), (F p1), (F (NOT (AND (OR p1 (NOT p0)) (OR (NOT p2) (NOT p0)))))]
Knowledge based reduction with 26 factoid took 373 ms. Reduced automaton from 7 states, 29 edges and 3 AP (stutter insensitive) to 5 states, 11 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 243 ms :[(NOT p2), (AND p1 (NOT p2) p0), (NOT p2), (AND (NOT p2) p0), (AND (NOT p2) p0)]
Stuttering acceptance computed with spot in 215 ms :[(NOT p2), (AND p1 (NOT p2) p0), (NOT p2), (AND (NOT p2) p0), (AND (NOT p2) p0)]
[2024-05-20 14:01:33] [INFO ] Invariant cache hit.
[2024-05-20 14:01:33] [INFO ] [Real]Absence check using 21 positive place invariants in 15 ms returned sat
[2024-05-20 14:01:33] [INFO ] [Real]Absence check using state equation in 516 ms returned sat
[2024-05-20 14:01:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 14:01:34] [INFO ] [Nat]Absence check using 21 positive place invariants in 14 ms returned sat
[2024-05-20 14:01:34] [INFO ] [Nat]Absence check using state equation in 469 ms returned sat
[2024-05-20 14:01:34] [INFO ] State equation strengthened by 780 read => feed constraints.
[2024-05-20 14:01:35] [INFO ] [Nat]Added 780 Read/Feed constraints in 115 ms returned sat
[2024-05-20 14:01:35] [INFO ] Computed and/alt/rep : 767/2502/767 causal constraints (skipped 60 transitions) in 46 ms.
[2024-05-20 14:01:35] [INFO ] Added : 43 causal constraints over 9 iterations in 561 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 7 out of 469 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 469/469 places, 847/847 transitions.
Applied a total of 0 rules in 16 ms. Remains 469 /469 variables (removed 0) and now considering 847/847 (removed 0) transitions.
[2024-05-20 14:01:35] [INFO ] Invariant cache hit.
[2024-05-20 14:01:35] [INFO ] Implicit Places using invariants in 232 ms returned []
[2024-05-20 14:01:35] [INFO ] Invariant cache hit.
[2024-05-20 14:01:36] [INFO ] State equation strengthened by 780 read => feed constraints.
[2024-05-20 14:01:37] [INFO ] Implicit Places using invariants and state equation in 1449 ms returned []
Implicit Place search using SMT with State Equation took 1681 ms to find 0 implicit places.
[2024-05-20 14:01:37] [INFO ] Redundant transitions in 9 ms returned []
Running 827 sub problems to find dead transitions.
[2024-05-20 14:01:37] [INFO ] Invariant cache hit.
[2024-05-20 14:01:37] [INFO ] State equation strengthened by 780 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/468 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 827 unsolved
[2024-05-20 14:01:44] [INFO ] Deduced a trap composed of 23 places in 283 ms of which 9 ms to minimize.
[2024-05-20 14:01:44] [INFO ] Deduced a trap composed of 23 places in 310 ms of which 5 ms to minimize.
[2024-05-20 14:01:44] [INFO ] Deduced a trap composed of 28 places in 288 ms of which 6 ms to minimize.
[2024-05-20 14:01:44] [INFO ] Deduced a trap composed of 23 places in 291 ms of which 3 ms to minimize.
[2024-05-20 14:01:45] [INFO ] Deduced a trap composed of 27 places in 162 ms of which 3 ms to minimize.
[2024-05-20 14:01:45] [INFO ] Deduced a trap composed of 23 places in 197 ms of which 3 ms to minimize.
[2024-05-20 14:01:45] [INFO ] Deduced a trap composed of 23 places in 177 ms of which 3 ms to minimize.
[2024-05-20 14:01:45] [INFO ] Deduced a trap composed of 23 places in 146 ms of which 2 ms to minimize.
[2024-05-20 14:01:45] [INFO ] Deduced a trap composed of 28 places in 169 ms of which 3 ms to minimize.
[2024-05-20 14:01:46] [INFO ] Deduced a trap composed of 23 places in 151 ms of which 2 ms to minimize.
[2024-05-20 14:01:46] [INFO ] Deduced a trap composed of 30 places in 151 ms of which 3 ms to minimize.
[2024-05-20 14:01:46] [INFO ] Deduced a trap composed of 24 places in 154 ms of which 3 ms to minimize.
[2024-05-20 14:01:46] [INFO ] Deduced a trap composed of 23 places in 145 ms of which 2 ms to minimize.
[2024-05-20 14:01:46] [INFO ] Deduced a trap composed of 23 places in 142 ms of which 2 ms to minimize.
[2024-05-20 14:01:46] [INFO ] Deduced a trap composed of 27 places in 126 ms of which 3 ms to minimize.
[2024-05-20 14:01:47] [INFO ] Deduced a trap composed of 26 places in 145 ms of which 3 ms to minimize.
[2024-05-20 14:01:47] [INFO ] Deduced a trap composed of 24 places in 124 ms of which 3 ms to minimize.
[2024-05-20 14:01:47] [INFO ] Deduced a trap composed of 23 places in 131 ms of which 2 ms to minimize.
[2024-05-20 14:01:47] [INFO ] Deduced a trap composed of 26 places in 142 ms of which 3 ms to minimize.
[2024-05-20 14:01:47] [INFO ] Deduced a trap composed of 24 places in 137 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/468 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 827 unsolved
[2024-05-20 14:01:48] [INFO ] Deduced a trap composed of 28 places in 157 ms of which 3 ms to minimize.
[2024-05-20 14:01:48] [INFO ] Deduced a trap composed of 28 places in 120 ms of which 2 ms to minimize.
[2024-05-20 14:01:49] [INFO ] Deduced a trap composed of 29 places in 147 ms of which 3 ms to minimize.
[2024-05-20 14:01:49] [INFO ] Deduced a trap composed of 30 places in 148 ms of which 3 ms to minimize.
[2024-05-20 14:01:49] [INFO ] Deduced a trap composed of 30 places in 138 ms of which 2 ms to minimize.
[2024-05-20 14:01:49] [INFO ] Deduced a trap composed of 29 places in 149 ms of which 3 ms to minimize.
[2024-05-20 14:01:49] [INFO ] Deduced a trap composed of 24 places in 124 ms of which 2 ms to minimize.
[2024-05-20 14:01:49] [INFO ] Deduced a trap composed of 24 places in 174 ms of which 2 ms to minimize.
[2024-05-20 14:01:50] [INFO ] Deduced a trap composed of 25 places in 147 ms of which 3 ms to minimize.
[2024-05-20 14:01:50] [INFO ] Deduced a trap composed of 30 places in 150 ms of which 3 ms to minimize.
[2024-05-20 14:01:50] [INFO ] Deduced a trap composed of 25 places in 142 ms of which 3 ms to minimize.
[2024-05-20 14:01:50] [INFO ] Deduced a trap composed of 29 places in 154 ms of which 3 ms to minimize.
[2024-05-20 14:01:50] [INFO ] Deduced a trap composed of 28 places in 173 ms of which 2 ms to minimize.
[2024-05-20 14:01:50] [INFO ] Deduced a trap composed of 25 places in 138 ms of which 3 ms to minimize.
[2024-05-20 14:01:50] [INFO ] Deduced a trap composed of 25 places in 136 ms of which 2 ms to minimize.
[2024-05-20 14:01:51] [INFO ] Deduced a trap composed of 24 places in 131 ms of which 2 ms to minimize.
[2024-05-20 14:01:51] [INFO ] Deduced a trap composed of 24 places in 142 ms of which 2 ms to minimize.
[2024-05-20 14:01:51] [INFO ] Deduced a trap composed of 25 places in 114 ms of which 2 ms to minimize.
[2024-05-20 14:01:51] [INFO ] Deduced a trap composed of 25 places in 136 ms of which 3 ms to minimize.
[2024-05-20 14:01:51] [INFO ] Deduced a trap composed of 23 places in 122 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/468 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 827 unsolved
[2024-05-20 14:01:52] [INFO ] Deduced a trap composed of 23 places in 133 ms of which 2 ms to minimize.
[2024-05-20 14:01:52] [INFO ] Deduced a trap composed of 23 places in 139 ms of which 2 ms to minimize.
[2024-05-20 14:01:52] [INFO ] Deduced a trap composed of 23 places in 135 ms of which 2 ms to minimize.
[2024-05-20 14:01:53] [INFO ] Deduced a trap composed of 24 places in 121 ms of which 2 ms to minimize.
[2024-05-20 14:01:53] [INFO ] Deduced a trap composed of 24 places in 115 ms of which 3 ms to minimize.
[2024-05-20 14:01:53] [INFO ] Deduced a trap composed of 24 places in 115 ms of which 2 ms to minimize.
[2024-05-20 14:01:53] [INFO ] Deduced a trap composed of 23 places in 141 ms of which 2 ms to minimize.
[2024-05-20 14:01:53] [INFO ] Deduced a trap composed of 23 places in 127 ms of which 3 ms to minimize.
[2024-05-20 14:01:53] [INFO ] Deduced a trap composed of 23 places in 132 ms of which 3 ms to minimize.
[2024-05-20 14:01:54] [INFO ] Deduced a trap composed of 25 places in 131 ms of which 2 ms to minimize.
[2024-05-20 14:01:54] [INFO ] Deduced a trap composed of 28 places in 129 ms of which 3 ms to minimize.
[2024-05-20 14:01:54] [INFO ] Deduced a trap composed of 29 places in 129 ms of which 2 ms to minimize.
[2024-05-20 14:01:54] [INFO ] Deduced a trap composed of 27 places in 152 ms of which 2 ms to minimize.
[2024-05-20 14:01:54] [INFO ] Deduced a trap composed of 25 places in 143 ms of which 2 ms to minimize.
[2024-05-20 14:01:54] [INFO ] Deduced a trap composed of 25 places in 144 ms of which 3 ms to minimize.
[2024-05-20 14:01:55] [INFO ] Deduced a trap composed of 27 places in 132 ms of which 2 ms to minimize.
[2024-05-20 14:01:55] [INFO ] Deduced a trap composed of 27 places in 131 ms of which 3 ms to minimize.
[2024-05-20 14:01:55] [INFO ] Deduced a trap composed of 23 places in 118 ms of which 2 ms to minimize.
[2024-05-20 14:01:55] [INFO ] Deduced a trap composed of 24 places in 123 ms of which 3 ms to minimize.
[2024-05-20 14:01:55] [INFO ] Deduced a trap composed of 24 places in 112 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/468 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 827 unsolved
[2024-05-20 14:02:02] [INFO ] Deduced a trap composed of 28 places in 132 ms of which 2 ms to minimize.
[2024-05-20 14:02:02] [INFO ] Deduced a trap composed of 24 places in 124 ms of which 2 ms to minimize.
[2024-05-20 14:02:02] [INFO ] Deduced a trap composed of 23 places in 117 ms of which 2 ms to minimize.
[2024-05-20 14:02:02] [INFO ] Deduced a trap composed of 23 places in 121 ms of which 2 ms to minimize.
[2024-05-20 14:02:02] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 3 ms to minimize.
[2024-05-20 14:02:02] [INFO ] Deduced a trap composed of 23 places in 108 ms of which 2 ms to minimize.
[2024-05-20 14:02:03] [INFO ] Deduced a trap composed of 23 places in 158 ms of which 3 ms to minimize.
[2024-05-20 14:02:03] [INFO ] Deduced a trap composed of 24 places in 149 ms of which 3 ms to minimize.
[2024-05-20 14:02:03] [INFO ] Deduced a trap composed of 24 places in 130 ms of which 3 ms to minimize.
[2024-05-20 14:02:03] [INFO ] Deduced a trap composed of 24 places in 122 ms of which 2 ms to minimize.
[2024-05-20 14:02:03] [INFO ] Deduced a trap composed of 23 places in 122 ms of which 3 ms to minimize.
[2024-05-20 14:02:03] [INFO ] Deduced a trap composed of 23 places in 118 ms of which 2 ms to minimize.
[2024-05-20 14:02:03] [INFO ] Deduced a trap composed of 23 places in 121 ms of which 3 ms to minimize.
[2024-05-20 14:02:04] [INFO ] Deduced a trap composed of 23 places in 115 ms of which 2 ms to minimize.
[2024-05-20 14:02:04] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 2 ms to minimize.
[2024-05-20 14:02:04] [INFO ] Deduced a trap composed of 23 places in 124 ms of which 3 ms to minimize.
[2024-05-20 14:02:04] [INFO ] Deduced a trap composed of 27 places in 136 ms of which 3 ms to minimize.
[2024-05-20 14:02:04] [INFO ] Deduced a trap composed of 25 places in 128 ms of which 3 ms to minimize.
[2024-05-20 14:02:04] [INFO ] Deduced a trap composed of 27 places in 132 ms of which 3 ms to minimize.
[2024-05-20 14:02:05] [INFO ] Deduced a trap composed of 24 places in 129 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/468 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 827 unsolved
[2024-05-20 14:02:06] [INFO ] Deduced a trap composed of 23 places in 104 ms of which 2 ms to minimize.
[2024-05-20 14:02:06] [INFO ] Deduced a trap composed of 23 places in 102 ms of which 2 ms to minimize.
[2024-05-20 14:02:06] [INFO ] Deduced a trap composed of 28 places in 138 ms of which 3 ms to minimize.
[2024-05-20 14:02:06] [INFO ] Deduced a trap composed of 27 places in 135 ms of which 3 ms to minimize.
[2024-05-20 14:02:06] [INFO ] Deduced a trap composed of 23 places in 129 ms of which 3 ms to minimize.
[2024-05-20 14:02:07] [INFO ] Deduced a trap composed of 24 places in 125 ms of which 3 ms to minimize.
[2024-05-20 14:02:07] [INFO ] Deduced a trap composed of 24 places in 125 ms of which 2 ms to minimize.
[2024-05-20 14:02:07] [INFO ] Deduced a trap composed of 24 places in 121 ms of which 3 ms to minimize.
[2024-05-20 14:02:07] [INFO ] Deduced a trap composed of 24 places in 124 ms of which 3 ms to minimize.
[2024-05-20 14:02:07] [INFO ] Deduced a trap composed of 26 places in 123 ms of which 3 ms to minimize.
SMT process timed out in 30259ms, After SMT, problems are : Problem set: 0 solved, 827 unsolved
Search for dead transitions found 0 dead transitions in 30266ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 31980 ms. Remains : 469/469 places, 847/847 transitions.
Computed a total of 21 stabilizing places and 40 stable transitions
Computed a total of 21 stabilizing places and 40 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 119 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter insensitive) to 5 states, 11 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 239 ms :[(NOT p2), (AND p1 (NOT p2) p0), (NOT p2), (AND (NOT p2) p0), (AND (NOT p2) p0)]
RANDOM walk for 40000 steps (274 resets) in 348 ms. (114 steps per ms) remains 1/7 properties
BEST_FIRST walk for 40004 steps (12 resets) in 68 ms. (579 steps per ms) remains 1/1 properties
[2024-05-20 14:02:08] [INFO ] Invariant cache hit.
[2024-05-20 14:02:08] [INFO ] State equation strengthened by 780 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf5 is UNSAT
After SMT solving in domain Real declared 454/1316 variables, and 7 constraints, problems are : Problem set: 1 solved, 0 unsolved in 71 ms.
Refiners :[Positive P Invariants (semi-flows): 7/21 constraints, State Equation: 0/469 constraints, ReadFeed: 0/780 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 85ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (NOT p0))), (G (OR (NOT p1) p2 (NOT p0)))]
False Knowledge obtained : [(F (NOT (OR p2 (NOT p0)))), (F (NOT (OR (NOT p1) p2))), (F p0), (F p2), (F p1), (F (NOT (AND (NOT p1) (NOT p2))))]
Knowledge based reduction with 13 factoid took 409 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter insensitive) to 5 states, 11 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 235 ms :[(NOT p2), (AND p1 (NOT p2) p0), (NOT p2), (AND (NOT p2) p0), (AND (NOT p2) p0)]
Stuttering acceptance computed with spot in 200 ms :[(NOT p2), (AND p1 (NOT p2) p0), (NOT p2), (AND (NOT p2) p0), (AND (NOT p2) p0)]
[2024-05-20 14:02:09] [INFO ] Invariant cache hit.
[2024-05-20 14:02:09] [INFO ] [Real]Absence check using 21 positive place invariants in 15 ms returned sat
[2024-05-20 14:02:10] [INFO ] [Real]Absence check using state equation in 544 ms returned sat
[2024-05-20 14:02:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 14:02:10] [INFO ] [Nat]Absence check using 21 positive place invariants in 17 ms returned sat
[2024-05-20 14:02:11] [INFO ] [Nat]Absence check using state equation in 511 ms returned sat
[2024-05-20 14:02:11] [INFO ] State equation strengthened by 780 read => feed constraints.
[2024-05-20 14:02:11] [INFO ] [Nat]Added 780 Read/Feed constraints in 121 ms returned sat
[2024-05-20 14:02:11] [INFO ] Computed and/alt/rep : 767/2502/767 causal constraints (skipped 60 transitions) in 53 ms.
[2024-05-20 14:02:11] [INFO ] Added : 43 causal constraints over 9 iterations in 564 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 234 ms :[(NOT p2), (AND p1 (NOT p2) p0), (NOT p2), (AND (NOT p2) p0), (AND (NOT p2) p0)]
Product exploration explored 100000 steps with 693 reset in 371 ms.
Product exploration explored 100000 steps with 692 reset in 380 ms.
Built C files in :
/tmp/ltsmin4171280910147713719
[2024-05-20 14:02:12] [INFO ] Computing symmetric may disable matrix : 847 transitions.
[2024-05-20 14:02:12] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-20 14:02:12] [INFO ] Computing symmetric may enable matrix : 847 transitions.
[2024-05-20 14:02:12] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-20 14:02:12] [INFO ] Computing Do-Not-Accords matrix : 847 transitions.
[2024-05-20 14:02:13] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-20 14:02:13] [INFO ] Built C files in 144ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4171280910147713719
Running compilation step : cd /tmp/ltsmin4171280910147713719;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2575 ms.
Running link step : cd /tmp/ltsmin4171280910147713719;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 57 ms.
Running LTSmin : cd /tmp/ltsmin4171280910147713719;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased5044404571646351558.hoa' '--buchi-type=spotba'
LTSmin run took 9219 ms.
FORMULA CANConstruction-PT-020-LTLFireability-14 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CANConstruction-PT-020-LTLFireability-14 finished in 57348 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(p2)))))'
Support contains 4 out of 656 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 656/656 places, 1042/1042 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 648 transition count 1026
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 648 transition count 1026
Applied a total of 16 rules in 31 ms. Remains 648 /656 variables (removed 8) and now considering 1026/1042 (removed 16) transitions.
// Phase 1: matrix 1026 rows 648 cols
[2024-05-20 14:02:24] [INFO ] Computed 23 invariants in 8 ms
[2024-05-20 14:02:25] [INFO ] Implicit Places using invariants in 270 ms returned [96]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 271 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 647/656 places, 1026/1042 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 646 transition count 1025
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 646 transition count 1025
Applied a total of 2 rules in 27 ms. Remains 646 /647 variables (removed 1) and now considering 1025/1026 (removed 1) transitions.
// Phase 1: matrix 1025 rows 646 cols
[2024-05-20 14:02:25] [INFO ] Computed 22 invariants in 4 ms
[2024-05-20 14:02:25] [INFO ] Implicit Places using invariants in 267 ms returned []
[2024-05-20 14:02:25] [INFO ] Invariant cache hit.
[2024-05-20 14:02:25] [INFO ] State equation strengthened by 780 read => feed constraints.
[2024-05-20 14:02:27] [INFO ] Implicit Places using invariants and state equation in 1990 ms returned []
Implicit Place search using SMT with State Equation took 2259 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 646/656 places, 1025/1042 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2588 ms. Remains : 646/656 places, 1025/1042 transitions.
Stuttering acceptance computed with spot in 223 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : CANConstruction-PT-020-LTLFireability-15
Product exploration explored 100000 steps with 50000 reset in 283 ms.
Product exploration explored 100000 steps with 50000 reset in 292 ms.
Computed a total of 62 stabilizing places and 81 stable transitions
Computed a total of 62 stabilizing places and 81 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 14 factoid took 22 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CANConstruction-PT-020-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANConstruction-PT-020-LTLFireability-15 finished in 3439 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||G(F(p1))))))'
Found a Shortening insensitive property : CANConstruction-PT-020-LTLFireability-00
Stuttering acceptance computed with spot in 120 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 656 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 656/656 places, 1042/1042 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 130 transitions
Trivial Post-agglo rules discarded 130 transitions
Performed 130 trivial Post agglomeration. Transition count delta: 130
Iterating post reduction 0 with 130 rules applied. Total rules applied 130 place count 656 transition count 912
Reduce places removed 130 places and 0 transitions.
Iterating post reduction 1 with 130 rules applied. Total rules applied 260 place count 526 transition count 912
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 260 place count 526 transition count 894
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 296 place count 508 transition count 894
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 306 place count 498 transition count 874
Iterating global reduction 2 with 10 rules applied. Total rules applied 316 place count 498 transition count 874
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 2 with 9 rules applied. Total rules applied 325 place count 498 transition count 865
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 334 place count 489 transition count 865
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 4 with 38 rules applied. Total rules applied 372 place count 470 transition count 846
Applied a total of 372 rules in 50 ms. Remains 470 /656 variables (removed 186) and now considering 846/1042 (removed 196) transitions.
// Phase 1: matrix 846 rows 470 cols
[2024-05-20 14:02:28] [INFO ] Computed 23 invariants in 6 ms
[2024-05-20 14:02:28] [INFO ] Implicit Places using invariants in 234 ms returned [27, 42]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 235 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 468/656 places, 846/1042 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 468 transition count 843
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 465 transition count 843
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 7 place count 464 transition count 842
Iterating global reduction 2 with 1 rules applied. Total rules applied 8 place count 464 transition count 842
Applied a total of 8 rules in 21 ms. Remains 464 /468 variables (removed 4) and now considering 842/846 (removed 4) transitions.
// Phase 1: matrix 842 rows 464 cols
[2024-05-20 14:02:28] [INFO ] Computed 21 invariants in 5 ms
[2024-05-20 14:02:29] [INFO ] Implicit Places using invariants in 225 ms returned []
[2024-05-20 14:02:29] [INFO ] Invariant cache hit.
[2024-05-20 14:02:29] [INFO ] State equation strengthened by 780 read => feed constraints.
[2024-05-20 14:02:30] [INFO ] Implicit Places using invariants and state equation in 1574 ms returned []
Implicit Place search using SMT with State Equation took 1801 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 464/656 places, 842/1042 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 2107 ms. Remains : 464/656 places, 842/1042 transitions.
Running random walk in product with property : CANConstruction-PT-020-LTLFireability-00
Product exploration explored 100000 steps with 751 reset in 393 ms.
Product exploration explored 100000 steps with 769 reset in 398 ms.
Computed a total of 21 stabilizing places and 40 stable transitions
Computed a total of 21 stabilizing places and 40 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 108 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 207 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Reduction of identical properties reduced properties to check from 5 to 4
RANDOM walk for 40000 steps (289 resets) in 310 ms. (128 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40003 steps (14 resets) in 53 ms. (740 steps per ms) remains 1/1 properties
[2024-05-20 14:02:32] [INFO ] Invariant cache hit.
[2024-05-20 14:02:32] [INFO ] State equation strengthened by 780 read => feed constraints.
Problem apf0 is UNSAT
After SMT solving in domain Real declared 4/1306 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 18 ms.
Refiners :[Positive P Invariants (semi-flows): 0/21 constraints, State Equation: 0/464 constraints, ReadFeed: 0/780 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 38ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (G (OR (NOT p0) (NOT p1)))]
False Knowledge obtained : [(F (NOT p1)), (F p0), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 8 factoid took 240 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 213 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Stuttering acceptance computed with spot in 222 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Support contains 4 out of 464 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 464/464 places, 842/842 transitions.
Applied a total of 0 rules in 18 ms. Remains 464 /464 variables (removed 0) and now considering 842/842 (removed 0) transitions.
[2024-05-20 14:02:32] [INFO ] Invariant cache hit.
[2024-05-20 14:02:33] [INFO ] Implicit Places using invariants in 224 ms returned []
[2024-05-20 14:02:33] [INFO ] Invariant cache hit.
[2024-05-20 14:02:33] [INFO ] State equation strengthened by 780 read => feed constraints.
[2024-05-20 14:02:34] [INFO ] Implicit Places using invariants and state equation in 1522 ms returned []
Implicit Place search using SMT with State Equation took 1747 ms to find 0 implicit places.
[2024-05-20 14:02:34] [INFO ] Redundant transitions in 10 ms returned []
Running 822 sub problems to find dead transitions.
[2024-05-20 14:02:34] [INFO ] Invariant cache hit.
[2024-05-20 14:02:34] [INFO ] State equation strengthened by 780 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/463 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2024-05-20 14:02:41] [INFO ] Deduced a trap composed of 23 places in 161 ms of which 3 ms to minimize.
[2024-05-20 14:02:41] [INFO ] Deduced a trap composed of 26 places in 153 ms of which 3 ms to minimize.
[2024-05-20 14:02:41] [INFO ] Deduced a trap composed of 24 places in 159 ms of which 3 ms to minimize.
[2024-05-20 14:02:41] [INFO ] Deduced a trap composed of 23 places in 148 ms of which 3 ms to minimize.
[2024-05-20 14:02:41] [INFO ] Deduced a trap composed of 23 places in 137 ms of which 3 ms to minimize.
[2024-05-20 14:02:41] [INFO ] Deduced a trap composed of 23 places in 140 ms of which 3 ms to minimize.
[2024-05-20 14:02:42] [INFO ] Deduced a trap composed of 23 places in 144 ms of which 3 ms to minimize.
[2024-05-20 14:02:42] [INFO ] Deduced a trap composed of 23 places in 133 ms of which 3 ms to minimize.
[2024-05-20 14:02:42] [INFO ] Deduced a trap composed of 23 places in 141 ms of which 2 ms to minimize.
[2024-05-20 14:02:42] [INFO ] Deduced a trap composed of 23 places in 138 ms of which 4 ms to minimize.
[2024-05-20 14:02:42] [INFO ] Deduced a trap composed of 23 places in 136 ms of which 3 ms to minimize.
[2024-05-20 14:02:42] [INFO ] Deduced a trap composed of 27 places in 124 ms of which 3 ms to minimize.
[2024-05-20 14:02:42] [INFO ] Deduced a trap composed of 25 places in 117 ms of which 3 ms to minimize.
[2024-05-20 14:02:43] [INFO ] Deduced a trap composed of 26 places in 128 ms of which 3 ms to minimize.
[2024-05-20 14:02:43] [INFO ] Deduced a trap composed of 23 places in 115 ms of which 3 ms to minimize.
[2024-05-20 14:02:43] [INFO ] Deduced a trap composed of 23 places in 112 ms of which 3 ms to minimize.
[2024-05-20 14:02:43] [INFO ] Deduced a trap composed of 25 places in 112 ms of which 2 ms to minimize.
[2024-05-20 14:02:43] [INFO ] Deduced a trap composed of 24 places in 129 ms of which 3 ms to minimize.
[2024-05-20 14:02:43] [INFO ] Deduced a trap composed of 26 places in 108 ms of which 3 ms to minimize.
[2024-05-20 14:02:43] [INFO ] Deduced a trap composed of 26 places in 110 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/463 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2024-05-20 14:02:44] [INFO ] Deduced a trap composed of 23 places in 128 ms of which 4 ms to minimize.
[2024-05-20 14:02:44] [INFO ] Deduced a trap composed of 23 places in 114 ms of which 3 ms to minimize.
[2024-05-20 14:02:44] [INFO ] Deduced a trap composed of 24 places in 114 ms of which 3 ms to minimize.
[2024-05-20 14:02:45] [INFO ] Deduced a trap composed of 23 places in 135 ms of which 3 ms to minimize.
[2024-05-20 14:02:45] [INFO ] Deduced a trap composed of 24 places in 143 ms of which 3 ms to minimize.
[2024-05-20 14:02:45] [INFO ] Deduced a trap composed of 24 places in 129 ms of which 3 ms to minimize.
[2024-05-20 14:02:45] [INFO ] Deduced a trap composed of 25 places in 137 ms of which 2 ms to minimize.
[2024-05-20 14:02:45] [INFO ] Deduced a trap composed of 23 places in 124 ms of which 3 ms to minimize.
[2024-05-20 14:02:45] [INFO ] Deduced a trap composed of 23 places in 117 ms of which 3 ms to minimize.
[2024-05-20 14:02:46] [INFO ] Deduced a trap composed of 23 places in 118 ms of which 2 ms to minimize.
[2024-05-20 14:02:46] [INFO ] Deduced a trap composed of 24 places in 113 ms of which 2 ms to minimize.
[2024-05-20 14:02:46] [INFO ] Deduced a trap composed of 24 places in 111 ms of which 3 ms to minimize.
[2024-05-20 14:02:46] [INFO ] Deduced a trap composed of 23 places in 108 ms of which 3 ms to minimize.
[2024-05-20 14:02:46] [INFO ] Deduced a trap composed of 23 places in 114 ms of which 3 ms to minimize.
[2024-05-20 14:02:46] [INFO ] Deduced a trap composed of 28 places in 120 ms of which 3 ms to minimize.
[2024-05-20 14:02:46] [INFO ] Deduced a trap composed of 27 places in 136 ms of which 2 ms to minimize.
[2024-05-20 14:02:46] [INFO ] Deduced a trap composed of 27 places in 109 ms of which 3 ms to minimize.
[2024-05-20 14:02:47] [INFO ] Deduced a trap composed of 27 places in 115 ms of which 3 ms to minimize.
[2024-05-20 14:02:47] [INFO ] Deduced a trap composed of 23 places in 116 ms of which 2 ms to minimize.
[2024-05-20 14:02:47] [INFO ] Deduced a trap composed of 26 places in 109 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/463 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2024-05-20 14:02:48] [INFO ] Deduced a trap composed of 24 places in 108 ms of which 2 ms to minimize.
[2024-05-20 14:02:48] [INFO ] Deduced a trap composed of 23 places in 122 ms of which 3 ms to minimize.
[2024-05-20 14:02:48] [INFO ] Deduced a trap composed of 23 places in 115 ms of which 2 ms to minimize.
[2024-05-20 14:02:48] [INFO ] Deduced a trap composed of 23 places in 107 ms of which 2 ms to minimize.
[2024-05-20 14:02:48] [INFO ] Deduced a trap composed of 23 places in 108 ms of which 2 ms to minimize.
[2024-05-20 14:02:48] [INFO ] Deduced a trap composed of 23 places in 106 ms of which 2 ms to minimize.
[2024-05-20 14:02:49] [INFO ] Deduced a trap composed of 23 places in 110 ms of which 3 ms to minimize.
[2024-05-20 14:02:49] [INFO ] Deduced a trap composed of 23 places in 106 ms of which 2 ms to minimize.
[2024-05-20 14:02:49] [INFO ] Deduced a trap composed of 24 places in 108 ms of which 3 ms to minimize.
[2024-05-20 14:02:49] [INFO ] Deduced a trap composed of 25 places in 110 ms of which 2 ms to minimize.
[2024-05-20 14:02:49] [INFO ] Deduced a trap composed of 25 places in 108 ms of which 2 ms to minimize.
[2024-05-20 14:02:49] [INFO ] Deduced a trap composed of 23 places in 109 ms of which 3 ms to minimize.
[2024-05-20 14:02:49] [INFO ] Deduced a trap composed of 23 places in 125 ms of which 2 ms to minimize.
[2024-05-20 14:02:50] [INFO ] Deduced a trap composed of 23 places in 136 ms of which 3 ms to minimize.
[2024-05-20 14:02:50] [INFO ] Deduced a trap composed of 23 places in 124 ms of which 2 ms to minimize.
[2024-05-20 14:02:50] [INFO ] Deduced a trap composed of 23 places in 119 ms of which 2 ms to minimize.
[2024-05-20 14:02:50] [INFO ] Deduced a trap composed of 24 places in 114 ms of which 2 ms to minimize.
[2024-05-20 14:02:50] [INFO ] Deduced a trap composed of 24 places in 114 ms of which 3 ms to minimize.
[2024-05-20 14:02:50] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 2 ms to minimize.
[2024-05-20 14:02:50] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/463 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2024-05-20 14:02:57] [INFO ] Deduced a trap composed of 23 places in 110 ms of which 2 ms to minimize.
[2024-05-20 14:02:57] [INFO ] Deduced a trap composed of 23 places in 107 ms of which 3 ms to minimize.
[2024-05-20 14:02:57] [INFO ] Deduced a trap composed of 24 places in 104 ms of which 3 ms to minimize.
[2024-05-20 14:02:57] [INFO ] Deduced a trap composed of 26 places in 103 ms of which 3 ms to minimize.
[2024-05-20 14:02:57] [INFO ] Deduced a trap composed of 24 places in 93 ms of which 2 ms to minimize.
[2024-05-20 14:02:57] [INFO ] Deduced a trap composed of 24 places in 95 ms of which 2 ms to minimize.
[2024-05-20 14:02:57] [INFO ] Deduced a trap composed of 24 places in 96 ms of which 2 ms to minimize.
[2024-05-20 14:02:57] [INFO ] Deduced a trap composed of 23 places in 125 ms of which 3 ms to minimize.
[2024-05-20 14:02:57] [INFO ] Deduced a trap composed of 23 places in 117 ms of which 3 ms to minimize.
[2024-05-20 14:02:58] [INFO ] Deduced a trap composed of 23 places in 113 ms of which 3 ms to minimize.
[2024-05-20 14:02:58] [INFO ] Deduced a trap composed of 27 places in 122 ms of which 2 ms to minimize.
[2024-05-20 14:02:58] [INFO ] Deduced a trap composed of 25 places in 118 ms of which 3 ms to minimize.
[2024-05-20 14:02:58] [INFO ] Deduced a trap composed of 24 places in 116 ms of which 3 ms to minimize.
[2024-05-20 14:02:58] [INFO ] Deduced a trap composed of 23 places in 109 ms of which 2 ms to minimize.
[2024-05-20 14:02:58] [INFO ] Deduced a trap composed of 23 places in 131 ms of which 3 ms to minimize.
[2024-05-20 14:02:59] [INFO ] Deduced a trap composed of 25 places in 135 ms of which 3 ms to minimize.
[2024-05-20 14:02:59] [INFO ] Deduced a trap composed of 26 places in 121 ms of which 3 ms to minimize.
[2024-05-20 14:02:59] [INFO ] Deduced a trap composed of 24 places in 124 ms of which 2 ms to minimize.
[2024-05-20 14:02:59] [INFO ] Deduced a trap composed of 23 places in 113 ms of which 2 ms to minimize.
[2024-05-20 14:02:59] [INFO ] Deduced a trap composed of 23 places in 112 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/463 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2024-05-20 14:03:00] [INFO ] Deduced a trap composed of 23 places in 129 ms of which 3 ms to minimize.
[2024-05-20 14:03:00] [INFO ] Deduced a trap composed of 23 places in 131 ms of which 3 ms to minimize.
[2024-05-20 14:03:01] [INFO ] Deduced a trap composed of 23 places in 123 ms of which 3 ms to minimize.
[2024-05-20 14:03:01] [INFO ] Deduced a trap composed of 30 places in 129 ms of which 2 ms to minimize.
[2024-05-20 14:03:01] [INFO ] Deduced a trap composed of 23 places in 121 ms of which 2 ms to minimize.
[2024-05-20 14:03:01] [INFO ] Deduced a trap composed of 30 places in 119 ms of which 2 ms to minimize.
[2024-05-20 14:03:01] [INFO ] Deduced a trap composed of 23 places in 126 ms of which 2 ms to minimize.
[2024-05-20 14:03:01] [INFO ] Deduced a trap composed of 27 places in 122 ms of which 3 ms to minimize.
[2024-05-20 14:03:01] [INFO ] Deduced a trap composed of 24 places in 119 ms of which 2 ms to minimize.
[2024-05-20 14:03:01] [INFO ] Deduced a trap composed of 23 places in 120 ms of which 2 ms to minimize.
[2024-05-20 14:03:02] [INFO ] Deduced a trap composed of 23 places in 113 ms of which 3 ms to minimize.
[2024-05-20 14:03:02] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 3 ms to minimize.
[2024-05-20 14:03:02] [INFO ] Deduced a trap composed of 23 places in 117 ms of which 2 ms to minimize.
[2024-05-20 14:03:02] [INFO ] Deduced a trap composed of 27 places in 130 ms of which 3 ms to minimize.
[2024-05-20 14:03:02] [INFO ] Deduced a trap composed of 23 places in 122 ms of which 3 ms to minimize.
[2024-05-20 14:03:02] [INFO ] Deduced a trap composed of 24 places in 124 ms of which 3 ms to minimize.
[2024-05-20 14:03:02] [INFO ] Deduced a trap composed of 24 places in 122 ms of which 3 ms to minimize.
[2024-05-20 14:03:03] [INFO ] Deduced a trap composed of 23 places in 115 ms of which 2 ms to minimize.
[2024-05-20 14:03:03] [INFO ] Deduced a trap composed of 23 places in 128 ms of which 3 ms to minimize.
[2024-05-20 14:03:03] [INFO ] Deduced a trap composed of 23 places in 118 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/463 variables, 20/121 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2024-05-20 14:03:04] [INFO ] Deduced a trap composed of 23 places in 125 ms of which 3 ms to minimize.
[2024-05-20 14:03:04] [INFO ] Deduced a trap composed of 27 places in 123 ms of which 3 ms to minimize.
SMT process timed out in 30296ms, After SMT, problems are : Problem set: 0 solved, 822 unsolved
Search for dead transitions found 0 dead transitions in 30304ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 32093 ms. Remains : 464/464 places, 842/842 transitions.
Computed a total of 21 stabilizing places and 40 stable transitions
Computed a total of 21 stabilizing places and 40 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 119 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 241 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Reduction of identical properties reduced properties to check from 5 to 4
RANDOM walk for 40000 steps (288 resets) in 280 ms. (142 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (13 resets) in 74 ms. (533 steps per ms) remains 1/1 properties
[2024-05-20 14:03:05] [INFO ] Invariant cache hit.
[2024-05-20 14:03:05] [INFO ] State equation strengthened by 780 read => feed constraints.
Problem apf0 is UNSAT
After SMT solving in domain Real declared 4/1306 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 18 ms.
Refiners :[Positive P Invariants (semi-flows): 0/21 constraints, State Equation: 0/464 constraints, ReadFeed: 0/780 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 31ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (G (OR (NOT p0) (NOT p1)))]
False Knowledge obtained : [(F (NOT p1)), (F p0), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 12 factoid took 242 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 202 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Stuttering acceptance computed with spot in 209 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Stuttering acceptance computed with spot in 214 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Product exploration explored 100000 steps with 766 reset in 356 ms.
Product exploration explored 100000 steps with 752 reset in 385 ms.
Built C files in :
/tmp/ltsmin16021240145736492255
[2024-05-20 14:03:07] [INFO ] Computing symmetric may disable matrix : 842 transitions.
[2024-05-20 14:03:07] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-20 14:03:07] [INFO ] Computing symmetric may enable matrix : 842 transitions.
[2024-05-20 14:03:07] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-20 14:03:07] [INFO ] Computing Do-Not-Accords matrix : 842 transitions.
[2024-05-20 14:03:07] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-20 14:03:07] [INFO ] Built C files in 122ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16021240145736492255
Running compilation step : cd /tmp/ltsmin16021240145736492255;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2502 ms.
Running link step : cd /tmp/ltsmin16021240145736492255;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 55 ms.
Running LTSmin : cd /tmp/ltsmin16021240145736492255;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased3370934691133327733.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 464 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 464/464 places, 842/842 transitions.
Applied a total of 0 rules in 18 ms. Remains 464 /464 variables (removed 0) and now considering 842/842 (removed 0) transitions.
[2024-05-20 14:03:22] [INFO ] Invariant cache hit.
[2024-05-20 14:03:22] [INFO ] Implicit Places using invariants in 240 ms returned []
[2024-05-20 14:03:22] [INFO ] Invariant cache hit.
[2024-05-20 14:03:22] [INFO ] State equation strengthened by 780 read => feed constraints.
[2024-05-20 14:03:23] [INFO ] Implicit Places using invariants and state equation in 1509 ms returned []
Implicit Place search using SMT with State Equation took 1751 ms to find 0 implicit places.
[2024-05-20 14:03:23] [INFO ] Redundant transitions in 12 ms returned []
Running 822 sub problems to find dead transitions.
[2024-05-20 14:03:23] [INFO ] Invariant cache hit.
[2024-05-20 14:03:23] [INFO ] State equation strengthened by 780 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/463 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2024-05-20 14:03:30] [INFO ] Deduced a trap composed of 23 places in 165 ms of which 3 ms to minimize.
[2024-05-20 14:03:30] [INFO ] Deduced a trap composed of 26 places in 163 ms of which 3 ms to minimize.
[2024-05-20 14:03:30] [INFO ] Deduced a trap composed of 24 places in 157 ms of which 3 ms to minimize.
[2024-05-20 14:03:30] [INFO ] Deduced a trap composed of 23 places in 153 ms of which 3 ms to minimize.
[2024-05-20 14:03:30] [INFO ] Deduced a trap composed of 23 places in 149 ms of which 3 ms to minimize.
[2024-05-20 14:03:31] [INFO ] Deduced a trap composed of 23 places in 145 ms of which 3 ms to minimize.
[2024-05-20 14:03:31] [INFO ] Deduced a trap composed of 23 places in 141 ms of which 3 ms to minimize.
[2024-05-20 14:03:31] [INFO ] Deduced a trap composed of 23 places in 155 ms of which 3 ms to minimize.
[2024-05-20 14:03:31] [INFO ] Deduced a trap composed of 23 places in 137 ms of which 3 ms to minimize.
[2024-05-20 14:03:31] [INFO ] Deduced a trap composed of 23 places in 128 ms of which 2 ms to minimize.
[2024-05-20 14:03:31] [INFO ] Deduced a trap composed of 23 places in 135 ms of which 3 ms to minimize.
[2024-05-20 14:03:31] [INFO ] Deduced a trap composed of 27 places in 131 ms of which 3 ms to minimize.
[2024-05-20 14:03:32] [INFO ] Deduced a trap composed of 25 places in 125 ms of which 3 ms to minimize.
[2024-05-20 14:03:32] [INFO ] Deduced a trap composed of 26 places in 131 ms of which 2 ms to minimize.
[2024-05-20 14:03:32] [INFO ] Deduced a trap composed of 23 places in 127 ms of which 3 ms to minimize.
[2024-05-20 14:03:32] [INFO ] Deduced a trap composed of 23 places in 119 ms of which 3 ms to minimize.
[2024-05-20 14:03:32] [INFO ] Deduced a trap composed of 25 places in 117 ms of which 2 ms to minimize.
[2024-05-20 14:03:32] [INFO ] Deduced a trap composed of 24 places in 122 ms of which 3 ms to minimize.
[2024-05-20 14:03:32] [INFO ] Deduced a trap composed of 26 places in 113 ms of which 3 ms to minimize.
[2024-05-20 14:03:33] [INFO ] Deduced a trap composed of 26 places in 113 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/463 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2024-05-20 14:03:33] [INFO ] Deduced a trap composed of 23 places in 121 ms of which 2 ms to minimize.
[2024-05-20 14:03:33] [INFO ] Deduced a trap composed of 23 places in 113 ms of which 3 ms to minimize.
[2024-05-20 14:03:34] [INFO ] Deduced a trap composed of 24 places in 111 ms of which 3 ms to minimize.
[2024-05-20 14:03:34] [INFO ] Deduced a trap composed of 23 places in 139 ms of which 3 ms to minimize.
[2024-05-20 14:03:34] [INFO ] Deduced a trap composed of 24 places in 138 ms of which 3 ms to minimize.
[2024-05-20 14:03:34] [INFO ] Deduced a trap composed of 24 places in 133 ms of which 2 ms to minimize.
[2024-05-20 14:03:34] [INFO ] Deduced a trap composed of 25 places in 126 ms of which 3 ms to minimize.
[2024-05-20 14:03:34] [INFO ] Deduced a trap composed of 23 places in 127 ms of which 2 ms to minimize.
[2024-05-20 14:03:35] [INFO ] Deduced a trap composed of 23 places in 122 ms of which 3 ms to minimize.
[2024-05-20 14:03:35] [INFO ] Deduced a trap composed of 23 places in 123 ms of which 3 ms to minimize.
[2024-05-20 14:03:35] [INFO ] Deduced a trap composed of 24 places in 118 ms of which 3 ms to minimize.
[2024-05-20 14:03:35] [INFO ] Deduced a trap composed of 24 places in 118 ms of which 3 ms to minimize.
[2024-05-20 14:03:35] [INFO ] Deduced a trap composed of 23 places in 114 ms of which 2 ms to minimize.
[2024-05-20 14:03:35] [INFO ] Deduced a trap composed of 23 places in 115 ms of which 3 ms to minimize.
[2024-05-20 14:03:35] [INFO ] Deduced a trap composed of 28 places in 133 ms of which 3 ms to minimize.
[2024-05-20 14:03:35] [INFO ] Deduced a trap composed of 27 places in 112 ms of which 2 ms to minimize.
[2024-05-20 14:03:36] [INFO ] Deduced a trap composed of 27 places in 115 ms of which 2 ms to minimize.
[2024-05-20 14:03:36] [INFO ] Deduced a trap composed of 27 places in 116 ms of which 3 ms to minimize.
[2024-05-20 14:03:36] [INFO ] Deduced a trap composed of 23 places in 113 ms of which 2 ms to minimize.
[2024-05-20 14:03:36] [INFO ] Deduced a trap composed of 26 places in 118 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/463 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2024-05-20 14:03:37] [INFO ] Deduced a trap composed of 24 places in 112 ms of which 2 ms to minimize.
[2024-05-20 14:03:37] [INFO ] Deduced a trap composed of 23 places in 125 ms of which 3 ms to minimize.
[2024-05-20 14:03:37] [INFO ] Deduced a trap composed of 23 places in 120 ms of which 3 ms to minimize.
[2024-05-20 14:03:37] [INFO ] Deduced a trap composed of 23 places in 118 ms of which 2 ms to minimize.
[2024-05-20 14:03:38] [INFO ] Deduced a trap composed of 23 places in 135 ms of which 3 ms to minimize.
[2024-05-20 14:03:38] [INFO ] Deduced a trap composed of 23 places in 116 ms of which 2 ms to minimize.
[2024-05-20 14:03:38] [INFO ] Deduced a trap composed of 23 places in 119 ms of which 3 ms to minimize.
[2024-05-20 14:03:38] [INFO ] Deduced a trap composed of 23 places in 117 ms of which 3 ms to minimize.
[2024-05-20 14:03:38] [INFO ] Deduced a trap composed of 24 places in 118 ms of which 3 ms to minimize.
[2024-05-20 14:03:38] [INFO ] Deduced a trap composed of 25 places in 117 ms of which 3 ms to minimize.
[2024-05-20 14:03:38] [INFO ] Deduced a trap composed of 25 places in 114 ms of which 2 ms to minimize.
[2024-05-20 14:03:39] [INFO ] Deduced a trap composed of 23 places in 113 ms of which 3 ms to minimize.
[2024-05-20 14:03:39] [INFO ] Deduced a trap composed of 23 places in 128 ms of which 3 ms to minimize.
[2024-05-20 14:03:39] [INFO ] Deduced a trap composed of 23 places in 126 ms of which 3 ms to minimize.
[2024-05-20 14:03:39] [INFO ] Deduced a trap composed of 23 places in 124 ms of which 2 ms to minimize.
[2024-05-20 14:03:39] [INFO ] Deduced a trap composed of 23 places in 120 ms of which 2 ms to minimize.
[2024-05-20 14:03:39] [INFO ] Deduced a trap composed of 24 places in 123 ms of which 3 ms to minimize.
[2024-05-20 14:03:39] [INFO ] Deduced a trap composed of 24 places in 123 ms of which 3 ms to minimize.
[2024-05-20 14:03:39] [INFO ] Deduced a trap composed of 23 places in 121 ms of which 3 ms to minimize.
[2024-05-20 14:03:40] [INFO ] Deduced a trap composed of 23 places in 132 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/463 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2024-05-20 14:03:46] [INFO ] Deduced a trap composed of 23 places in 120 ms of which 3 ms to minimize.
[2024-05-20 14:03:46] [INFO ] Deduced a trap composed of 23 places in 102 ms of which 3 ms to minimize.
[2024-05-20 14:03:46] [INFO ] Deduced a trap composed of 24 places in 107 ms of which 2 ms to minimize.
[2024-05-20 14:03:46] [INFO ] Deduced a trap composed of 26 places in 126 ms of which 4 ms to minimize.
[2024-05-20 14:03:46] [INFO ] Deduced a trap composed of 24 places in 119 ms of which 2 ms to minimize.
[2024-05-20 14:03:47] [INFO ] Deduced a trap composed of 24 places in 101 ms of which 3 ms to minimize.
[2024-05-20 14:03:47] [INFO ] Deduced a trap composed of 24 places in 102 ms of which 2 ms to minimize.
[2024-05-20 14:03:47] [INFO ] Deduced a trap composed of 23 places in 128 ms of which 2 ms to minimize.
[2024-05-20 14:03:47] [INFO ] Deduced a trap composed of 23 places in 137 ms of which 3 ms to minimize.
[2024-05-20 14:03:47] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 3 ms to minimize.
[2024-05-20 14:03:47] [INFO ] Deduced a trap composed of 27 places in 119 ms of which 3 ms to minimize.
[2024-05-20 14:03:47] [INFO ] Deduced a trap composed of 25 places in 127 ms of which 3 ms to minimize.
[2024-05-20 14:03:47] [INFO ] Deduced a trap composed of 24 places in 116 ms of which 3 ms to minimize.
[2024-05-20 14:03:48] [INFO ] Deduced a trap composed of 23 places in 108 ms of which 3 ms to minimize.
[2024-05-20 14:03:48] [INFO ] Deduced a trap composed of 23 places in 133 ms of which 2 ms to minimize.
[2024-05-20 14:03:48] [INFO ] Deduced a trap composed of 25 places in 112 ms of which 2 ms to minimize.
[2024-05-20 14:03:48] [INFO ] Deduced a trap composed of 26 places in 113 ms of which 2 ms to minimize.
[2024-05-20 14:03:48] [INFO ] Deduced a trap composed of 24 places in 110 ms of which 2 ms to minimize.
[2024-05-20 14:03:48] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 3 ms to minimize.
[2024-05-20 14:03:48] [INFO ] Deduced a trap composed of 23 places in 108 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/463 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2024-05-20 14:03:50] [INFO ] Deduced a trap composed of 23 places in 143 ms of which 3 ms to minimize.
[2024-05-20 14:03:50] [INFO ] Deduced a trap composed of 23 places in 133 ms of which 3 ms to minimize.
[2024-05-20 14:03:50] [INFO ] Deduced a trap composed of 23 places in 146 ms of which 2 ms to minimize.
[2024-05-20 14:03:50] [INFO ] Deduced a trap composed of 30 places in 135 ms of which 3 ms to minimize.
[2024-05-20 14:03:50] [INFO ] Deduced a trap composed of 23 places in 145 ms of which 3 ms to minimize.
[2024-05-20 14:03:50] [INFO ] Deduced a trap composed of 30 places in 131 ms of which 2 ms to minimize.
[2024-05-20 14:03:51] [INFO ] Deduced a trap composed of 23 places in 127 ms of which 2 ms to minimize.
[2024-05-20 14:03:51] [INFO ] Deduced a trap composed of 27 places in 132 ms of which 3 ms to minimize.
[2024-05-20 14:03:51] [INFO ] Deduced a trap composed of 24 places in 122 ms of which 2 ms to minimize.
[2024-05-20 14:03:51] [INFO ] Deduced a trap composed of 23 places in 125 ms of which 3 ms to minimize.
[2024-05-20 14:03:51] [INFO ] Deduced a trap composed of 23 places in 109 ms of which 3 ms to minimize.
[2024-05-20 14:03:51] [INFO ] Deduced a trap composed of 23 places in 118 ms of which 2 ms to minimize.
[2024-05-20 14:03:51] [INFO ] Deduced a trap composed of 23 places in 103 ms of which 2 ms to minimize.
[2024-05-20 14:03:52] [INFO ] Deduced a trap composed of 27 places in 127 ms of which 3 ms to minimize.
[2024-05-20 14:03:52] [INFO ] Deduced a trap composed of 23 places in 128 ms of which 2 ms to minimize.
[2024-05-20 14:03:52] [INFO ] Deduced a trap composed of 24 places in 121 ms of which 3 ms to minimize.
[2024-05-20 14:03:52] [INFO ] Deduced a trap composed of 24 places in 124 ms of which 3 ms to minimize.
[2024-05-20 14:03:52] [INFO ] Deduced a trap composed of 23 places in 147 ms of which 3 ms to minimize.
[2024-05-20 14:03:52] [INFO ] Deduced a trap composed of 23 places in 125 ms of which 3 ms to minimize.
[2024-05-20 14:03:52] [INFO ] Deduced a trap composed of 23 places in 124 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/463 variables, 20/121 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2024-05-20 14:03:54] [INFO ] Deduced a trap composed of 23 places in 135 ms of which 3 ms to minimize.
SMT process timed out in 30344ms, After SMT, problems are : Problem set: 0 solved, 822 unsolved
Search for dead transitions found 0 dead transitions in 30353ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 32144 ms. Remains : 464/464 places, 842/842 transitions.
Built C files in :
/tmp/ltsmin16102249966716644439
[2024-05-20 14:03:54] [INFO ] Computing symmetric may disable matrix : 842 transitions.
[2024-05-20 14:03:54] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-20 14:03:54] [INFO ] Computing symmetric may enable matrix : 842 transitions.
[2024-05-20 14:03:54] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-20 14:03:54] [INFO ] Computing Do-Not-Accords matrix : 842 transitions.
[2024-05-20 14:03:54] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-20 14:03:54] [INFO ] Built C files in 149ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16102249966716644439
Running compilation step : cd /tmp/ltsmin16102249966716644439;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2540 ms.
Running link step : cd /tmp/ltsmin16102249966716644439;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 54 ms.
Running LTSmin : cd /tmp/ltsmin16102249966716644439;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13267371573478243669.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-20 14:04:09] [INFO ] Flatten gal took : 24 ms
[2024-05-20 14:04:09] [INFO ] Flatten gal took : 23 ms
[2024-05-20 14:04:09] [INFO ] Time to serialize gal into /tmp/LTL7438880400431890645.gal : 4 ms
[2024-05-20 14:04:09] [INFO ] Time to serialize properties into /tmp/LTL13814561468556808138.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7438880400431890645.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3674868836481407178.hoa' '-atoms' '/tmp/LTL13814561468556808138.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL13814561468556808138.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3674868836481407178.hoa
Detected timeout of ITS tools.
[2024-05-20 14:04:24] [INFO ] Flatten gal took : 22 ms
[2024-05-20 14:04:24] [INFO ] Flatten gal took : 21 ms
[2024-05-20 14:04:24] [INFO ] Time to serialize gal into /tmp/LTL9476513571654924352.gal : 6 ms
[2024-05-20 14:04:24] [INFO ] Time to serialize properties into /tmp/LTL2488219344402078310.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9476513571654924352.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2488219344402078310.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(F((G(F("((Node7IsInserted<1)||(Node2requestsent7<1))")))||("(((Node7IsInserted>=1)&&(Node2requestsent7>=1))&&(((Node7IsInserted<1...237
Formula 0 simplified : XG(!"(((Node7IsInserted>=1)&&(Node2requestsent7>=1))&&(((Node7IsInserted<1)||(Node2requestsent7<1))||((Node15IsInserted<1)||(Node17r...227
Detected timeout of ITS tools.
[2024-05-20 14:04:39] [INFO ] Flatten gal took : 21 ms
[2024-05-20 14:04:39] [INFO ] Applying decomposition
[2024-05-20 14:04:39] [INFO ] Flatten gal took : 20 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph13647385789651777567.txt' '-o' '/tmp/graph13647385789651777567.bin' '-w' '/tmp/graph13647385789651777567.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13647385789651777567.bin' '-l' '-1' '-v' '-w' '/tmp/graph13647385789651777567.weights' '-q' '0' '-e' '0.001'
[2024-05-20 14:04:39] [INFO ] Decomposing Gal with order
[2024-05-20 14:04:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 14:04:39] [INFO ] Removed a total of 769 redundant transitions.
[2024-05-20 14:04:39] [INFO ] Flatten gal took : 83 ms
[2024-05-20 14:04:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 720 labels/synchronizations in 22 ms.
[2024-05-20 14:04:39] [INFO ] Time to serialize gal into /tmp/LTL5245837457883284054.gal : 5 ms
[2024-05-20 14:04:39] [INFO ] Time to serialize properties into /tmp/LTL17268253210962255429.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5245837457883284054.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17268253210962255429.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(F((G(F("((u4.Node7IsInserted<1)||(u3.Node2requestsent7<1))")))||("(((u4.Node7IsInserted>=1)&&(u3.Node2requestsent7>=1))&&(((u4.No...263
Formula 0 simplified : XG(!"(((u4.Node7IsInserted>=1)&&(u3.Node2requestsent7>=1))&&(((u4.Node7IsInserted<1)||(u3.Node2requestsent7<1))||((u14.Node15IsInser...253
Detected timeout of ITS tools.
Treatment of property CANConstruction-PT-020-LTLFireability-00 finished in 146545 ms.
[2024-05-20 14:04:54] [INFO ] Flatten gal took : 24 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin7696225192748095130
[2024-05-20 14:04:54] [INFO ] Applying decomposition
[2024-05-20 14:04:54] [INFO ] Computing symmetric may disable matrix : 1042 transitions.
[2024-05-20 14:04:54] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-20 14:04:54] [INFO ] Computing symmetric may enable matrix : 1042 transitions.
[2024-05-20 14:04:54] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-20 14:04:54] [INFO ] Flatten gal took : 23 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph7382369115787213751.txt' '-o' '/tmp/graph7382369115787213751.bin' '-w' '/tmp/graph7382369115787213751.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7382369115787213751.bin' '-l' '-1' '-v' '-w' '/tmp/graph7382369115787213751.weights' '-q' '0' '-e' '0.001'
[2024-05-20 14:04:55] [INFO ] Decomposing Gal with order
[2024-05-20 14:04:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 14:04:55] [INFO ] Removed a total of 789 redundant transitions.
[2024-05-20 14:04:55] [INFO ] Flatten gal took : 61 ms
[2024-05-20 14:04:55] [INFO ] Computing Do-Not-Accords matrix : 1042 transitions.
[2024-05-20 14:04:55] [INFO ] Computation of Completed DNA matrix. took 14 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-20 14:04:55] [INFO ] Built C files in 265ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7696225192748095130
Running compilation step : cd /tmp/ltsmin7696225192748095130;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-20 14:04:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 1396 labels/synchronizations in 41 ms.
[2024-05-20 14:04:55] [INFO ] Time to serialize gal into /tmp/LTLFireability1232310153425340087.gal : 11 ms
[2024-05-20 14:04:55] [INFO ] Time to serialize properties into /tmp/LTLFireability9665295852771940986.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability1232310153425340087.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability9665295852771940986.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(F(("(((i16.u62.Node7IsInserted>=1)&&(i3.u10.Node2requestsent7>=1))&&(((i16.u62.Node7IsInserted<1)||(i3.u10.Node2requestsent7<1))|...296
Formula 0 simplified : XG(!"(((i16.u62.Node7IsInserted>=1)&&(i3.u10.Node2requestsent7>=1))&&(((i16.u62.Node7IsInserted<1)||(i3.u10.Node2requestsent7<1))||(...286
Compilation finished in 3426 ms.
Running link step : cd /tmp/ltsmin7696225192748095130;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 57 ms.
Running LTSmin : cd /tmp/ltsmin7696225192748095130;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>(((LTLAPp0==true)||[](<>((LTLAPp1==true))))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-20 14:27:18] [INFO ] Flatten gal took : 71 ms
[2024-05-20 14:27:18] [INFO ] Time to serialize gal into /tmp/LTLFireability3220441109632793898.gal : 5 ms
[2024-05-20 14:27:18] [INFO ] Time to serialize properties into /tmp/LTLFireability1206065554400073011.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability3220441109632793898.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability1206065554400073011.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...297
Read 1 LTL properties
Checking formula 0 : !((X(F(("(((Node7IsInserted>=1)&&(Node2requestsent7>=1))&&(((Node7IsInserted<1)||(Node2requestsent7<1))||((Node15IsInserted<1)||(Node1...237
Formula 0 simplified : XG(!"(((Node7IsInserted>=1)&&(Node2requestsent7>=1))&&(((Node7IsInserted<1)||(Node2requestsent7<1))||((Node15IsInserted<1)||(Node17r...227
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.004: Loading model from ./gal.so
pins2lts-mc-linux64( 2/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.125: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.125: LTL layer: formula: X(<>(((LTLAPp0==true)||[](<>((LTLAPp1==true))))))
pins2lts-mc-linux64( 1/ 8), 0.125: "X(<>(((LTLAPp0==true)||[](<>((LTLAPp1==true))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.125: Using Spin LTL semantics
pins2lts-mc-linux64( 5/ 8), 0.158: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.158: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.165: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.170: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.180: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.189: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.192: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.238: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.434: DFS-FIFO for weak LTL, using special progress label 1045
pins2lts-mc-linux64( 0/ 8), 0.434: There are 1046 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.434: State length is 657, there are 1046 groups
pins2lts-mc-linux64( 0/ 8), 0.434: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.434: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.434: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.434: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 2/ 8), 0.535: ~1 levels ~960 states ~13496 transitions
pins2lts-mc-linux64( 1/ 8), 0.642: ~1 levels ~1920 states ~34328 transitions
pins2lts-mc-linux64( 2/ 8), 0.810: ~1 levels ~3840 states ~68216 transitions
pins2lts-mc-linux64( 1/ 8), 1.172: ~1 levels ~7680 states ~143768 transitions
pins2lts-mc-linux64( 3/ 8), 1.825: ~1 levels ~15360 states ~290120 transitions
pins2lts-mc-linux64( 6/ 8), 3.008: ~1 levels ~30720 states ~583688 transitions
pins2lts-mc-linux64( 6/ 8), 5.148: ~1 levels ~61440 states ~1167368 transitions
pins2lts-mc-linux64( 7/ 8), 9.009: ~1 levels ~122880 states ~2334720 transitions
pins2lts-mc-linux64( 6/ 8), 16.052: ~1 levels ~245760 states ~4669448 transitions
pins2lts-mc-linux64( 0/ 8), 30.171: ~1 levels ~491520 states ~9338880 transitions
pins2lts-mc-linux64( 7/ 8), 57.598: ~1 levels ~983040 states ~18677760 transitions
pins2lts-mc-linux64( 7/ 8), 112.416: ~1 levels ~1966080 states ~37355520 transitions
pins2lts-mc-linux64( 1/ 8), 222.167: ~1 levels ~3932160 states ~74708928 transitions
pins2lts-mc-linux64( 1/ 8), 441.499: ~1 levels ~7864320 states ~149420112 transitions
pins2lts-mc-linux64( 3/ 8), 882.596: ~1 levels ~15728640 states ~298844488 transitions
pins2lts-mc-linux64( 3/ 8), 1765.421: ~1 levels ~31457280 states ~597703552 transitions
pins2lts-mc-linux64( 5/ 8), 2350.071: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 2350.123:
pins2lts-mc-linux64( 0/ 8), 2350.124: mean standard work distribution: 0.3% (states) 0.3% (transitions)
pins2lts-mc-linux64( 0/ 8), 2350.124:
pins2lts-mc-linux64( 0/ 8), 2350.124: Explored 41345324 states 785576927 transitions, fanout: 19.000
pins2lts-mc-linux64( 0/ 8), 2350.124: Total exploration time 2349.680 sec (2349.620 sec minimum, 2349.650 sec on average)
pins2lts-mc-linux64( 0/ 8), 2350.124: States per second: 17596, Transitions per second: 334334
pins2lts-mc-linux64( 0/ 8), 2350.124:
pins2lts-mc-linux64( 0/ 8), 2350.124: Progress states detected: 134217376
pins2lts-mc-linux64( 0/ 8), 2350.124: Redundant explorations: -69.1953
pins2lts-mc-linux64( 0/ 8), 2350.124:
pins2lts-mc-linux64( 0/ 8), 2350.124: Queue width: 8B, total height: 145057087, memory: 1106.70MB
pins2lts-mc-linux64( 0/ 8), 2350.124: Tree memory: 1046.0MB, 8.2 B/state, compr.: 0.3%
pins2lts-mc-linux64( 0/ 8), 2350.124: Tree fill ratio (roots/leafs): 99.0%/8.0%
pins2lts-mc-linux64( 0/ 8), 2350.124: Stored 1107 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 2350.124: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 2350.124: Est. total memory use: 2152.7MB (~2130.7MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin7696225192748095130;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>(((LTLAPp0==true)||[](<>((LTLAPp1==true))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin7696225192748095130;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>(((LTLAPp0==true)||[](<>((LTLAPp1==true))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:241)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:176)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:114)
at java.base/java.lang.Thread.run(Thread.java:840)
ITS-tools command line returned an error code 137
[2024-05-20 14:48:18] [INFO ] Flatten gal took : 22 ms
[2024-05-20 14:48:18] [INFO ] Input system was already deterministic with 1042 transitions.
[2024-05-20 14:48:18] [INFO ] Transformed 656 places.
[2024-05-20 14:48:18] [INFO ] Transformed 1042 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-20 14:48:18] [INFO ] Time to serialize gal into /tmp/LTLFireability13149976370098489180.gal : 4 ms
[2024-05-20 14:48:18] [INFO ] Time to serialize properties into /tmp/LTLFireability12187556648284917037.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability13149976370098489180.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability12187556648284917037.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...344
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X(F(("(((Node7IsInserted>=1)&&(Node2requestsent7>=1))&&(((Node7IsInserted<1)||(Node2requestsent7<1))||((Node15IsInserted<1)||(Node1...237
Formula 0 simplified : XG(!"(((Node7IsInserted>=1)&&(Node2requestsent7>=1))&&(((Node7IsInserted<1)||(Node2requestsent7<1))||((Node15IsInserted<1)||(Node17r...227

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

tar xzf /home/mcc/BenchKit/INPUTS/CANConstruction-PT-020.tgz
mv CANConstruction-PT-020 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;