Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r421-tajo-167905974800148.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.....................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is ShieldRVs-PT-050A, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r421-tajo-167905974800148
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 744K
-rw-r--r-- 1 mcc users 6.7K Feb 26 18:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Feb 26 18:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 26 18:31 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 26 18:31 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Feb 25 17:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 17:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.3K Feb 26 19:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 26 19:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Feb 26 18:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K Feb 26 18:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:03 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:03 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 320K Mar 5 18:23 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 ShieldRVs-PT-050A-LTLFireability-00
FORMULA_NAME ShieldRVs-PT-050A-LTLFireability-01
FORMULA_NAME ShieldRVs-PT-050A-LTLFireability-02
FORMULA_NAME ShieldRVs-PT-050A-LTLFireability-03
FORMULA_NAME ShieldRVs-PT-050A-LTLFireability-04
FORMULA_NAME ShieldRVs-PT-050A-LTLFireability-05
FORMULA_NAME ShieldRVs-PT-050A-LTLFireability-06
FORMULA_NAME ShieldRVs-PT-050A-LTLFireability-07
FORMULA_NAME ShieldRVs-PT-050A-LTLFireability-08
FORMULA_NAME ShieldRVs-PT-050A-LTLFireability-09
FORMULA_NAME ShieldRVs-PT-050A-LTLFireability-10
FORMULA_NAME ShieldRVs-PT-050A-LTLFireability-11
FORMULA_NAME ShieldRVs-PT-050A-LTLFireability-12
FORMULA_NAME ShieldRVs-PT-050A-LTLFireability-13
FORMULA_NAME ShieldRVs-PT-050A-LTLFireability-14
FORMULA_NAME ShieldRVs-PT-050A-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679167091056

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVs-PT-050A
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-18 19:18:12] [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]
[2023-03-18 19:18:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 19:18:12] [INFO ] Load time of PNML (sax parser for PT used): 119 ms
[2023-03-18 19:18:12] [INFO ] Transformed 703 places.
[2023-03-18 19:18:12] [INFO ] Transformed 953 transitions.
[2023-03-18 19:18:12] [INFO ] Found NUPN structural information;
[2023-03-18 19:18:12] [INFO ] Parsed PT model containing 703 places and 953 transitions and 4600 arcs in 208 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA ShieldRVs-PT-050A-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-050A-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-050A-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-050A-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 84 out of 703 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 703/703 places, 953/953 transitions.
Applied a total of 0 rules in 64 ms. Remains 703 /703 variables (removed 0) and now considering 953/953 (removed 0) transitions.
// Phase 1: matrix 953 rows 703 cols
[2023-03-18 19:18:13] [INFO ] Computed 201 place invariants in 30 ms
[2023-03-18 19:18:13] [INFO ] Implicit Places using invariants in 595 ms returned []
[2023-03-18 19:18:13] [INFO ] Invariant cache hit.
[2023-03-18 19:18:14] [INFO ] Implicit Places using invariants and state equation in 699 ms returned []
Implicit Place search using SMT with State Equation took 1321 ms to find 0 implicit places.
[2023-03-18 19:18:14] [INFO ] Invariant cache hit.
[2023-03-18 19:18:15] [INFO ] Dead Transitions using invariants and state equation in 518 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1906 ms. Remains : 703/703 places, 953/953 transitions.
Support contains 84 out of 703 places after structural reductions.
[2023-03-18 19:18:15] [INFO ] Flatten gal took : 149 ms
[2023-03-18 19:18:15] [INFO ] Flatten gal took : 86 ms
[2023-03-18 19:18:15] [INFO ] Input system was already deterministic with 953 transitions.
Incomplete random walk after 10000 steps, including 15 resets, run finished after 387 ms. (steps per millisecond=25 ) properties (out of 36) seen :30
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 4) seen :1
Running SMT prover for 3 properties.
[2023-03-18 19:18:16] [INFO ] Invariant cache hit.
[2023-03-18 19:18:16] [INFO ] [Real]Absence check using 201 positive place invariants in 30 ms returned sat
[2023-03-18 19:18:16] [INFO ] After 653ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-18 19:18:17] [INFO ] [Nat]Absence check using 201 positive place invariants in 74 ms returned sat
[2023-03-18 19:18:17] [INFO ] After 422ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-18 19:18:17] [INFO ] Deduced a trap composed of 7 places in 71 ms of which 6 ms to minimize.
[2023-03-18 19:18:17] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 1 ms to minimize.
[2023-03-18 19:18:17] [INFO ] Deduced a trap composed of 11 places in 64 ms of which 4 ms to minimize.
[2023-03-18 19:18:18] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 0 ms to minimize.
[2023-03-18 19:18:18] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 396 ms
[2023-03-18 19:18:18] [INFO ] Deduced a trap composed of 7 places in 59 ms of which 1 ms to minimize.
[2023-03-18 19:18:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 125 ms
[2023-03-18 19:18:18] [INFO ] After 1091ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 118 ms.
[2023-03-18 19:18:18] [INFO ] After 1546ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 76 ms.
Support contains 9 out of 703 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 703/703 places, 953/953 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 702 transition count 952
Partial Free-agglomeration rule applied 99 times.
Drop transitions removed 99 transitions
Iterating global reduction 0 with 99 rules applied. Total rules applied 101 place count 702 transition count 952
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 102 place count 701 transition count 951
Applied a total of 102 rules in 156 ms. Remains 701 /703 variables (removed 2) and now considering 951/953 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 156 ms. Remains : 701/703 places, 951/953 transitions.
Finished random walk after 6678 steps, including 11 resets, run visited all 3 properties in 80 ms. (steps per millisecond=83 )
FORMULA ShieldRVs-PT-050A-LTLFireability-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 1 stabilizing places and 1 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(F((p0||(!p1 U X(p0)))))))))'
Support contains 3 out of 703 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 703/703 places, 953/953 transitions.
Applied a total of 0 rules in 11 ms. Remains 703 /703 variables (removed 0) and now considering 953/953 (removed 0) transitions.
[2023-03-18 19:18:19] [INFO ] Invariant cache hit.
[2023-03-18 19:18:19] [INFO ] Implicit Places using invariants in 368 ms returned []
[2023-03-18 19:18:19] [INFO ] Invariant cache hit.
[2023-03-18 19:18:20] [INFO ] Implicit Places using invariants and state equation in 911 ms returned []
Implicit Place search using SMT with State Equation took 1284 ms to find 0 implicit places.
[2023-03-18 19:18:20] [INFO ] Invariant cache hit.
[2023-03-18 19:18:21] [INFO ] Dead Transitions using invariants and state equation in 466 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1763 ms. Remains : 703/703 places, 953/953 transitions.
Stuttering acceptance computed with spot in 337 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVs-PT-050A-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p0:(AND (EQ s115 1) (EQ s132 1) (EQ s142 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 654 steps with 0 reset in 9 ms.
FORMULA ShieldRVs-PT-050A-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-050A-LTLFireability-00 finished in 2176 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(p0))||(p1 U p2)))'
Support contains 7 out of 703 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 703/703 places, 953/953 transitions.
Applied a total of 0 rules in 9 ms. Remains 703 /703 variables (removed 0) and now considering 953/953 (removed 0) transitions.
[2023-03-18 19:18:21] [INFO ] Invariant cache hit.
[2023-03-18 19:18:21] [INFO ] Implicit Places using invariants in 351 ms returned []
[2023-03-18 19:18:21] [INFO ] Invariant cache hit.
[2023-03-18 19:18:22] [INFO ] Implicit Places using invariants and state equation in 839 ms returned []
Implicit Place search using SMT with State Equation took 1194 ms to find 0 implicit places.
[2023-03-18 19:18:22] [INFO ] Invariant cache hit.
[2023-03-18 19:18:22] [INFO ] Dead Transitions using invariants and state equation in 391 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1596 ms. Remains : 703/703 places, 953/953 transitions.
Stuttering acceptance computed with spot in 363 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), true, (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2)]
Running random walk in product with property : ShieldRVs-PT-050A-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=1 dest: 6}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={} source=5 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=6 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=6 dest: 6}]], initial=4, aps=[p0:(AND (EQ s236 1) (EQ s240 1) (EQ s247 1)), p2:(AND (EQ s59 1) (EQ s74 1) (EQ s85 1)), p1:(EQ s109 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA ShieldRVs-PT-050A-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-050A-LTLFireability-01 finished in 1982 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&G((F(p1)&&F(G(p0)))))))'
Support contains 4 out of 703 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 703/703 places, 953/953 transitions.
Applied a total of 0 rules in 21 ms. Remains 703 /703 variables (removed 0) and now considering 953/953 (removed 0) transitions.
[2023-03-18 19:18:23] [INFO ] Invariant cache hit.
[2023-03-18 19:18:23] [INFO ] Implicit Places using invariants in 368 ms returned []
[2023-03-18 19:18:23] [INFO ] Invariant cache hit.
[2023-03-18 19:18:24] [INFO ] Implicit Places using invariants and state equation in 669 ms returned []
Implicit Place search using SMT with State Equation took 1043 ms to find 0 implicit places.
[2023-03-18 19:18:24] [INFO ] Invariant cache hit.
[2023-03-18 19:18:24] [INFO ] Dead Transitions using invariants and state equation in 425 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1491 ms. Remains : 703/703 places, 953/953 transitions.
Stuttering acceptance computed with spot in 253 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1), (NOT p0), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldRVs-PT-050A-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=p0, acceptance={} source=4 dest: 4}, { cond=(NOT p0), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 3}, { cond=(NOT p0), acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(EQ s33 1), p1:(OR (EQ s33 1) (AND (EQ s10 1) (EQ s16 1) (EQ s23 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldRVs-PT-050A-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-050A-LTLFireability-02 finished in 1777 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 4 out of 703 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 703/703 places, 953/953 transitions.
Applied a total of 0 rules in 13 ms. Remains 703 /703 variables (removed 0) and now considering 953/953 (removed 0) transitions.
[2023-03-18 19:18:25] [INFO ] Invariant cache hit.
[2023-03-18 19:18:25] [INFO ] Implicit Places using invariants in 369 ms returned []
[2023-03-18 19:18:25] [INFO ] Invariant cache hit.
[2023-03-18 19:18:26] [INFO ] Implicit Places using invariants and state equation in 736 ms returned []
Implicit Place search using SMT with State Equation took 1115 ms to find 0 implicit places.
[2023-03-18 19:18:26] [INFO ] Invariant cache hit.
[2023-03-18 19:18:26] [INFO ] Dead Transitions using invariants and state equation in 463 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1592 ms. Remains : 703/703 places, 953/953 transitions.
Stuttering acceptance computed with spot in 151 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVs-PT-050A-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (EQ s537 1) (AND (EQ s164 1) (EQ s168 1) (EQ s177 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA ShieldRVs-PT-050A-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-050A-LTLFireability-05 finished in 1762 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U (X(G(p1))&&G(!p2))))'
Support contains 7 out of 703 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 703/703 places, 953/953 transitions.
Applied a total of 0 rules in 13 ms. Remains 703 /703 variables (removed 0) and now considering 953/953 (removed 0) transitions.
[2023-03-18 19:18:26] [INFO ] Invariant cache hit.
[2023-03-18 19:18:27] [INFO ] Implicit Places using invariants in 378 ms returned []
[2023-03-18 19:18:27] [INFO ] Invariant cache hit.
[2023-03-18 19:18:28] [INFO ] Implicit Places using invariants and state equation in 742 ms returned []
Implicit Place search using SMT with State Equation took 1134 ms to find 0 implicit places.
[2023-03-18 19:18:28] [INFO ] Invariant cache hit.
[2023-03-18 19:18:28] [INFO ] Dead Transitions using invariants and state equation in 460 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1608 ms. Remains : 703/703 places, 953/953 transitions.
Stuttering acceptance computed with spot in 286 ms :[(OR (NOT p1) p2), (NOT p0), (NOT p1), p2, true, (AND p0 (NOT p1)), (AND p2 p0)]
Running random walk in product with property : ShieldRVs-PT-050A-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={0, 1} source=0 dest: 0}, { cond=p2, acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={0, 1} source=0 dest: 2}, { cond=(NOT p2), acceptance={1} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(AND p2 p0 (NOT p1)), acceptance={0, 1} source=2 dest: 0}, { cond=(AND p2 p0 (NOT p1)), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0, 1} source=2 dest: 2}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={1} source=2 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 5}], [{ cond=(AND p2 p0), acceptance={0, 1} source=3 dest: 0}, { cond=(AND p2 p0), acceptance={} source=3 dest: 1}, { cond=(NOT p2), acceptance={1} source=3 dest: 3}, { cond=(AND p2 (NOT p0)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=3 dest: 6}], [{ cond=true, acceptance={0, 1} source=4 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(AND p0 p1), acceptance={} source=5 dest: 5}], [{ cond=(AND p2 p0), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p2) p0), acceptance={} source=6 dest: 6}]], initial=0, aps=[p2:(AND (EQ s118 1) (EQ s119 1) (EQ s124 1)), p0:(OR (NOT (AND (EQ s313 1) (EQ s315 1) (EQ s320 1))) (AND (EQ s118 1) (EQ s119 1) (EQ s124 1))), p1:(EQ s3...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 16593 steps with 28 reset in 138 ms.
FORMULA ShieldRVs-PT-050A-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-050A-LTLFireability-06 finished in 2074 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(((p0 U p1)&&X((F(p2) U G(p3)))))))'
Support contains 10 out of 703 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 703/703 places, 953/953 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 702 transition count 952
Applied a total of 2 rules in 55 ms. Remains 702 /703 variables (removed 1) and now considering 952/953 (removed 1) transitions.
// Phase 1: matrix 952 rows 702 cols
[2023-03-18 19:18:29] [INFO ] Computed 201 place invariants in 8 ms
[2023-03-18 19:18:29] [INFO ] Implicit Places using invariants in 412 ms returned []
[2023-03-18 19:18:29] [INFO ] Invariant cache hit.
[2023-03-18 19:18:30] [INFO ] Implicit Places using invariants and state equation in 694 ms returned []
Implicit Place search using SMT with State Equation took 1108 ms to find 0 implicit places.
[2023-03-18 19:18:30] [INFO ] Redundant transitions in 603 ms returned [300]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 951 rows 702 cols
[2023-03-18 19:18:30] [INFO ] Computed 201 place invariants in 4 ms
[2023-03-18 19:18:31] [INFO ] Dead Transitions using invariants and state equation in 538 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 702/703 places, 951/953 transitions.
Applied a total of 0 rules in 23 ms. Remains 702 /702 variables (removed 0) and now considering 951/951 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2336 ms. Remains : 702/703 places, 951/953 transitions.
Stuttering acceptance computed with spot in 306 ms :[(OR (NOT p1) (NOT p3)), (OR (NOT p1) (NOT p3)), (NOT p1), (NOT p3), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldRVs-PT-050A-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}, { cond=(OR p1 p0), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 2}, { cond=(OR p1 p0), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}], [{ cond=p3, acceptance={} source=3 dest: 3}, { cond=(NOT p3), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p1) p0 (NOT p3) (NOT p2)), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=4 dest: 4}, { cond=(OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), acceptance={0} source=4 dest: 5}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=4 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p3) (NOT p2)), acceptance={0} source=5 dest: 4}, { cond=(AND p3 (NOT p2)), acceptance={} source=5 dest: 5}, { cond=(OR (AND p1 (NOT p3) (NOT p2)) (AND p0 (NOT p3) (NOT p2))), acceptance={0} source=5 dest: 5}, { cond=(AND (NOT p1) p0 (NOT p3) (NOT p2)), acceptance={0} source=5 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=6 dest: 4}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p1:(EQ s75 1), p0:(AND (EQ s3 1) (EQ s20 1) (EQ s29 1)), p3:(AND (EQ s304 1) (EQ s310 1) (EQ s317 1)), p2:(AND (EQ s129 1) (EQ s144 1) (EQ s156 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null][true, true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 685 steps with 0 reset in 6 ms.
FORMULA ShieldRVs-PT-050A-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-050A-LTLFireability-09 finished in 2682 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p1)&&p0)))'
Support contains 5 out of 703 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 703/703 places, 953/953 transitions.
Applied a total of 0 rules in 9 ms. Remains 703 /703 variables (removed 0) and now considering 953/953 (removed 0) transitions.
// Phase 1: matrix 953 rows 703 cols
[2023-03-18 19:18:31] [INFO ] Computed 201 place invariants in 3 ms
[2023-03-18 19:18:31] [INFO ] Implicit Places using invariants in 316 ms returned []
[2023-03-18 19:18:31] [INFO ] Invariant cache hit.
[2023-03-18 19:18:32] [INFO ] Implicit Places using invariants and state equation in 824 ms returned []
Implicit Place search using SMT with State Equation took 1145 ms to find 0 implicit places.
[2023-03-18 19:18:32] [INFO ] Invariant cache hit.
[2023-03-18 19:18:33] [INFO ] Dead Transitions using invariants and state equation in 509 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1664 ms. Remains : 703/703 places, 953/953 transitions.
Stuttering acceptance computed with spot in 105 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldRVs-PT-050A-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(AND (EQ s642 1) (EQ s646 1) (EQ s653 1)), p0:(AND (EQ s642 1) (EQ s646 1) (EQ s653 1) (EQ s428 1) (EQ s433 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ShieldRVs-PT-050A-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-050A-LTLFireability-11 finished in 1786 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((X(p0) U p1) U !p2)))'
Support contains 6 out of 703 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 703/703 places, 953/953 transitions.
Applied a total of 0 rules in 13 ms. Remains 703 /703 variables (removed 0) and now considering 953/953 (removed 0) transitions.
[2023-03-18 19:18:33] [INFO ] Invariant cache hit.
[2023-03-18 19:18:33] [INFO ] Implicit Places using invariants in 332 ms returned []
[2023-03-18 19:18:33] [INFO ] Invariant cache hit.
[2023-03-18 19:18:34] [INFO ] Implicit Places using invariants and state equation in 749 ms returned []
Implicit Place search using SMT with State Equation took 1091 ms to find 0 implicit places.
[2023-03-18 19:18:34] [INFO ] Invariant cache hit.
[2023-03-18 19:18:35] [INFO ] Dead Transitions using invariants and state equation in 531 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1641 ms. Remains : 703/703 places, 953/953 transitions.
Stuttering acceptance computed with spot in 139 ms :[p2, p2, (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : ShieldRVs-PT-050A-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p2, acceptance={} source=1 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(AND (EQ s178 1) (EQ s182 1) (EQ s191 1)), p1:(EQ s11 1), p0:(OR (EQ s374 1) (EQ s60 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 2507 ms.
Product exploration explored 100000 steps with 50000 reset in 2251 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (NOT (AND p2 (NOT p1)))), (X (X (NOT p2))), (X (X (NOT p0))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT p2))
Knowledge based reduction with 7 factoid took 144 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldRVs-PT-050A-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVs-PT-050A-LTLFireability-12 finished in 6718 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((!p0||F(p1)) U (G((!p0||F(p1)))||((!p0||F(p1))&&X(G(!p3))&&p2))))'
Support contains 6 out of 703 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 703/703 places, 953/953 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 702 transition count 952
Applied a total of 2 rules in 41 ms. Remains 702 /703 variables (removed 1) and now considering 952/953 (removed 1) transitions.
// Phase 1: matrix 952 rows 702 cols
[2023-03-18 19:18:40] [INFO ] Computed 201 place invariants in 5 ms
[2023-03-18 19:18:40] [INFO ] Implicit Places using invariants in 364 ms returned []
[2023-03-18 19:18:40] [INFO ] Invariant cache hit.
[2023-03-18 19:18:41] [INFO ] Implicit Places using invariants and state equation in 581 ms returned []
Implicit Place search using SMT with State Equation took 960 ms to find 0 implicit places.
[2023-03-18 19:18:41] [INFO ] Redundant transitions in 227 ms returned [300]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 951 rows 702 cols
[2023-03-18 19:18:41] [INFO ] Computed 201 place invariants in 3 ms
[2023-03-18 19:18:41] [INFO ] Dead Transitions using invariants and state equation in 479 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 702/703 places, 951/953 transitions.
Applied a total of 0 rules in 26 ms. Remains 702 /702 variables (removed 0) and now considering 951/951 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1746 ms. Remains : 702/703 places, 951/953 transitions.
Stuttering acceptance computed with spot in 180 ms :[(AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1) p3), (AND (NOT p1) (NOT p0) p3)]
Running random walk in product with property : ShieldRVs-PT-050A-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}, { cond=p2, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) p3), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1) p3), acceptance={} source=2 dest: 1}, { cond=(OR p2 (NOT p3)), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p3)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1) p3), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p3)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(AND (EQ s414 1) (EQ s419 1)), p0:(AND (EQ s414 1) (EQ s419 1)), p1:(NEQ s439 1), p3:(AND (EQ s500 1) (EQ s506 1) (EQ s513 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 162 reset in 580 ms.
Product exploration explored 100000 steps with 161 reset in 643 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1 (NOT p3)), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (NOT (AND (NOT p2) p3))), (X (NOT (AND p0 (NOT p1) p3))), (X (NOT p2)), (X (OR p2 (NOT p3))), (X (NOT (AND p0 (NOT p1) (NOT p3)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT (AND (NOT p2) p3)))), (X (X (NOT (AND p0 (NOT p1) p3)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p3)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3))))), (X (X (OR p2 (NOT p3)))), (X (X (NOT (AND p0 (NOT p1) (NOT p3)))))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 723 ms. Reduced automaton from 4 states, 10 edges and 4 AP (stutter insensitive) to 4 states, 10 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 153 ms :[(AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1) p3), (AND (NOT p1) (NOT p0) p3)]
Incomplete random walk after 10000 steps, including 15 resets, run finished after 242 ms. (steps per millisecond=41 ) properties (out of 9) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
[2023-03-18 19:18:44] [INFO ] Invariant cache hit.
[2023-03-18 19:18:44] [INFO ] [Real]Absence check using 201 positive place invariants in 27 ms returned sat
[2023-03-18 19:18:45] [INFO ] After 425ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 19:18:45] [INFO ] [Nat]Absence check using 201 positive place invariants in 30 ms returned sat
[2023-03-18 19:18:45] [INFO ] After 441ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 19:18:45] [INFO ] Deduced a trap composed of 12 places in 127 ms of which 1 ms to minimize.
[2023-03-18 19:18:45] [INFO ] Deduced a trap composed of 12 places in 118 ms of which 1 ms to minimize.
[2023-03-18 19:18:46] [INFO ] Deduced a trap composed of 8 places in 123 ms of which 0 ms to minimize.
[2023-03-18 19:18:46] [INFO ] Deduced a trap composed of 7 places in 124 ms of which 0 ms to minimize.
[2023-03-18 19:18:46] [INFO ] Deduced a trap composed of 15 places in 122 ms of which 1 ms to minimize.
[2023-03-18 19:18:46] [INFO ] Deduced a trap composed of 15 places in 114 ms of which 1 ms to minimize.
[2023-03-18 19:18:46] [INFO ] Deduced a trap composed of 8 places in 104 ms of which 1 ms to minimize.
[2023-03-18 19:18:46] [INFO ] Deduced a trap composed of 9 places in 104 ms of which 0 ms to minimize.
[2023-03-18 19:18:47] [INFO ] Deduced a trap composed of 13 places in 124 ms of which 1 ms to minimize.
[2023-03-18 19:18:47] [INFO ] Deduced a trap composed of 8 places in 135 ms of which 1 ms to minimize.
[2023-03-18 19:18:47] [INFO ] Deduced a trap composed of 11 places in 138 ms of which 0 ms to minimize.
[2023-03-18 19:18:47] [INFO ] Deduced a trap composed of 12 places in 137 ms of which 1 ms to minimize.
[2023-03-18 19:18:47] [INFO ] Deduced a trap composed of 11 places in 162 ms of which 0 ms to minimize.
[2023-03-18 19:18:47] [INFO ] Deduced a trap composed of 8 places in 132 ms of which 1 ms to minimize.
[2023-03-18 19:18:48] [INFO ] Deduced a trap composed of 25 places in 107 ms of which 1 ms to minimize.
[2023-03-18 19:18:48] [INFO ] Deduced a trap composed of 12 places in 109 ms of which 1 ms to minimize.
[2023-03-18 19:18:48] [INFO ] Deduced a trap composed of 31 places in 145 ms of which 0 ms to minimize.
[2023-03-18 19:18:48] [INFO ] Deduced a trap composed of 19 places in 102 ms of which 0 ms to minimize.
[2023-03-18 19:18:48] [INFO ] Deduced a trap composed of 8 places in 106 ms of which 0 ms to minimize.
[2023-03-18 19:18:48] [INFO ] Deduced a trap composed of 11 places in 100 ms of which 0 ms to minimize.
[2023-03-18 19:18:49] [INFO ] Deduced a trap composed of 19 places in 126 ms of which 1 ms to minimize.
[2023-03-18 19:18:49] [INFO ] Deduced a trap composed of 11 places in 123 ms of which 1 ms to minimize.
[2023-03-18 19:18:49] [INFO ] Deduced a trap composed of 19 places in 175 ms of which 1 ms to minimize.
[2023-03-18 19:18:49] [INFO ] Deduced a trap composed of 35 places in 126 ms of which 1 ms to minimize.
[2023-03-18 19:18:49] [INFO ] Deduced a trap composed of 8 places in 124 ms of which 0 ms to minimize.
[2023-03-18 19:18:49] [INFO ] Deduced a trap composed of 11 places in 158 ms of which 0 ms to minimize.
[2023-03-18 19:18:50] [INFO ] Deduced a trap composed of 11 places in 155 ms of which 0 ms to minimize.
[2023-03-18 19:18:50] [INFO ] Deduced a trap composed of 15 places in 146 ms of which 1 ms to minimize.
[2023-03-18 19:18:50] [INFO ] Deduced a trap composed of 15 places in 119 ms of which 5 ms to minimize.
[2023-03-18 19:18:50] [INFO ] Deduced a trap composed of 19 places in 119 ms of which 1 ms to minimize.
[2023-03-18 19:18:50] [INFO ] Deduced a trap composed of 15 places in 155 ms of which 12 ms to minimize.
[2023-03-18 19:18:51] [INFO ] Deduced a trap composed of 19 places in 142 ms of which 0 ms to minimize.
[2023-03-18 19:18:51] [INFO ] Deduced a trap composed of 16 places in 117 ms of which 0 ms to minimize.
[2023-03-18 19:18:51] [INFO ] Deduced a trap composed of 16 places in 127 ms of which 1 ms to minimize.
[2023-03-18 19:18:51] [INFO ] Deduced a trap composed of 24 places in 123 ms of which 1 ms to minimize.
[2023-03-18 19:18:51] [INFO ] Deduced a trap composed of 25 places in 157 ms of which 1 ms to minimize.
[2023-03-18 19:18:51] [INFO ] Deduced a trap composed of 23 places in 120 ms of which 1 ms to minimize.
[2023-03-18 19:18:52] [INFO ] Deduced a trap composed of 23 places in 146 ms of which 0 ms to minimize.
[2023-03-18 19:18:52] [INFO ] Deduced a trap composed of 27 places in 152 ms of which 1 ms to minimize.
[2023-03-18 19:18:52] [INFO ] Deduced a trap composed of 16 places in 146 ms of which 1 ms to minimize.
[2023-03-18 19:18:52] [INFO ] Deduced a trap composed of 27 places in 160 ms of which 1 ms to minimize.
[2023-03-18 19:18:52] [INFO ] Deduced a trap composed of 16 places in 118 ms of which 0 ms to minimize.
[2023-03-18 19:18:53] [INFO ] Deduced a trap composed of 15 places in 101 ms of which 1 ms to minimize.
[2023-03-18 19:18:53] [INFO ] Deduced a trap composed of 15 places in 130 ms of which 1 ms to minimize.
[2023-03-18 19:18:53] [INFO ] Deduced a trap composed of 21 places in 112 ms of which 1 ms to minimize.
[2023-03-18 19:18:53] [INFO ] Deduced a trap composed of 31 places in 124 ms of which 0 ms to minimize.
[2023-03-18 19:18:53] [INFO ] Deduced a trap composed of 23 places in 118 ms of which 1 ms to minimize.
[2023-03-18 19:18:53] [INFO ] Deduced a trap composed of 19 places in 129 ms of which 0 ms to minimize.
[2023-03-18 19:18:54] [INFO ] Deduced a trap composed of 24 places in 136 ms of which 1 ms to minimize.
[2023-03-18 19:18:54] [INFO ] Deduced a trap composed of 24 places in 125 ms of which 1 ms to minimize.
[2023-03-18 19:18:54] [INFO ] Deduced a trap composed of 23 places in 118 ms of which 8 ms to minimize.
[2023-03-18 19:18:54] [INFO ] Deduced a trap composed of 25 places in 133 ms of which 0 ms to minimize.
[2023-03-18 19:18:54] [INFO ] Deduced a trap composed of 23 places in 116 ms of which 1 ms to minimize.
[2023-03-18 19:18:54] [INFO ] Deduced a trap composed of 24 places in 124 ms of which 1 ms to minimize.
[2023-03-18 19:18:55] [INFO ] Deduced a trap composed of 35 places in 111 ms of which 0 ms to minimize.
[2023-03-18 19:18:55] [INFO ] Deduced a trap composed of 24 places in 115 ms of which 0 ms to minimize.
[2023-03-18 19:18:55] [INFO ] Deduced a trap composed of 23 places in 117 ms of which 1 ms to minimize.
[2023-03-18 19:18:55] [INFO ] Deduced a trap composed of 23 places in 102 ms of which 1 ms to minimize.
[2023-03-18 19:18:55] [INFO ] Deduced a trap composed of 35 places in 116 ms of which 3 ms to minimize.
[2023-03-18 19:18:55] [INFO ] Deduced a trap composed of 35 places in 109 ms of which 1 ms to minimize.
[2023-03-18 19:18:55] [INFO ] Deduced a trap composed of 24 places in 107 ms of which 1 ms to minimize.
[2023-03-18 19:18:56] [INFO ] Deduced a trap composed of 23 places in 197 ms of which 2 ms to minimize.
[2023-03-18 19:18:56] [INFO ] Deduced a trap composed of 31 places in 108 ms of which 2 ms to minimize.
[2023-03-18 19:18:56] [INFO ] Deduced a trap composed of 31 places in 113 ms of which 1 ms to minimize.
[2023-03-18 19:18:56] [INFO ] Deduced a trap composed of 24 places in 109 ms of which 1 ms to minimize.
[2023-03-18 19:18:56] [INFO ] Deduced a trap composed of 19 places in 110 ms of which 1 ms to minimize.
[2023-03-18 19:18:57] [INFO ] Deduced a trap composed of 25 places in 113 ms of which 1 ms to minimize.
[2023-03-18 19:18:57] [INFO ] Deduced a trap composed of 23 places in 122 ms of which 0 ms to minimize.
[2023-03-18 19:18:57] [INFO ] Deduced a trap composed of 20 places in 109 ms of which 0 ms to minimize.
[2023-03-18 19:18:57] [INFO ] Deduced a trap composed of 33 places in 161 ms of which 0 ms to minimize.
[2023-03-18 19:18:57] [INFO ] Deduced a trap composed of 28 places in 123 ms of which 0 ms to minimize.
[2023-03-18 19:18:57] [INFO ] Deduced a trap composed of 28 places in 106 ms of which 1 ms to minimize.
[2023-03-18 19:18:58] [INFO ] Deduced a trap composed of 27 places in 156 ms of which 0 ms to minimize.
[2023-03-18 19:18:58] [INFO ] Deduced a trap composed of 31 places in 113 ms of which 1 ms to minimize.
[2023-03-18 19:18:58] [INFO ] Deduced a trap composed of 31 places in 147 ms of which 0 ms to minimize.
[2023-03-18 19:18:58] [INFO ] Deduced a trap composed of 31 places in 131 ms of which 1 ms to minimize.
[2023-03-18 19:18:58] [INFO ] Deduced a trap composed of 21 places in 119 ms of which 1 ms to minimize.
[2023-03-18 19:18:58] [INFO ] Deduced a trap composed of 28 places in 113 ms of which 1 ms to minimize.
[2023-03-18 19:18:59] [INFO ] Deduced a trap composed of 8 places in 158 ms of which 0 ms to minimize.
[2023-03-18 19:18:59] [INFO ] Deduced a trap composed of 26 places in 114 ms of which 1 ms to minimize.
[2023-03-18 19:18:59] [INFO ] Deduced a trap composed of 33 places in 110 ms of which 0 ms to minimize.
[2023-03-18 19:18:59] [INFO ] Deduced a trap composed of 24 places in 168 ms of which 1 ms to minimize.
[2023-03-18 19:18:59] [INFO ] Deduced a trap composed of 28 places in 119 ms of which 0 ms to minimize.
[2023-03-18 19:19:00] [INFO ] Deduced a trap composed of 31 places in 124 ms of which 0 ms to minimize.
[2023-03-18 19:19:00] [INFO ] Deduced a trap composed of 31 places in 139 ms of which 1 ms to minimize.
[2023-03-18 19:19:00] [INFO ] Deduced a trap composed of 31 places in 138 ms of which 0 ms to minimize.
[2023-03-18 19:19:00] [INFO ] Deduced a trap composed of 11 places in 128 ms of which 0 ms to minimize.
[2023-03-18 19:19:00] [INFO ] Deduced a trap composed of 15 places in 154 ms of which 0 ms to minimize.
[2023-03-18 19:19:00] [INFO ] Deduced a trap composed of 24 places in 152 ms of which 0 ms to minimize.
[2023-03-18 19:19:01] [INFO ] Deduced a trap composed of 28 places in 118 ms of which 0 ms to minimize.
[2023-03-18 19:19:01] [INFO ] Deduced a trap composed of 28 places in 118 ms of which 0 ms to minimize.
[2023-03-18 19:19:01] [INFO ] Deduced a trap composed of 24 places in 126 ms of which 1 ms to minimize.
[2023-03-18 19:19:01] [INFO ] Deduced a trap composed of 28 places in 106 ms of which 0 ms to minimize.
[2023-03-18 19:19:01] [INFO ] Deduced a trap composed of 28 places in 107 ms of which 1 ms to minimize.
[2023-03-18 19:19:01] [INFO ] Deduced a trap composed of 24 places in 104 ms of which 0 ms to minimize.
[2023-03-18 19:19:02] [INFO ] Deduced a trap composed of 28 places in 108 ms of which 0 ms to minimize.
[2023-03-18 19:19:02] [INFO ] Deduced a trap composed of 28 places in 100 ms of which 0 ms to minimize.
[2023-03-18 19:19:02] [INFO ] Deduced a trap composed of 27 places in 232 ms of which 1 ms to minimize.
[2023-03-18 19:19:02] [INFO ] Deduced a trap composed of 31 places in 107 ms of which 1 ms to minimize.
[2023-03-18 19:19:02] [INFO ] Deduced a trap composed of 28 places in 106 ms of which 0 ms to minimize.
[2023-03-18 19:19:02] [INFO ] Deduced a trap composed of 31 places in 112 ms of which 0 ms to minimize.
[2023-03-18 19:19:03] [INFO ] Deduced a trap composed of 24 places in 125 ms of which 1 ms to minimize.
[2023-03-18 19:19:03] [INFO ] Deduced a trap composed of 28 places in 113 ms of which 0 ms to minimize.
[2023-03-18 19:19:03] [INFO ] Deduced a trap composed of 24 places in 121 ms of which 1 ms to minimize.
[2023-03-18 19:19:03] [INFO ] Deduced a trap composed of 28 places in 125 ms of which 0 ms to minimize.
[2023-03-18 19:19:03] [INFO ] Deduced a trap composed of 24 places in 113 ms of which 0 ms to minimize.
[2023-03-18 19:19:03] [INFO ] Deduced a trap composed of 28 places in 115 ms of which 1 ms to minimize.
[2023-03-18 19:19:04] [INFO ] Deduced a trap composed of 28 places in 141 ms of which 0 ms to minimize.
[2023-03-18 19:19:04] [INFO ] Deduced a trap composed of 29 places in 116 ms of which 0 ms to minimize.
[2023-03-18 19:19:04] [INFO ] Deduced a trap composed of 33 places in 137 ms of which 0 ms to minimize.
[2023-03-18 19:19:04] [INFO ] Deduced a trap composed of 33 places in 139 ms of which 1 ms to minimize.
[2023-03-18 19:19:04] [INFO ] Deduced a trap composed of 27 places in 119 ms of which 0 ms to minimize.
[2023-03-18 19:19:04] [INFO ] Deduced a trap composed of 31 places in 117 ms of which 0 ms to minimize.
[2023-03-18 19:19:05] [INFO ] Deduced a trap composed of 27 places in 122 ms of which 1 ms to minimize.
[2023-03-18 19:19:05] [INFO ] Deduced a trap composed of 31 places in 110 ms of which 0 ms to minimize.
[2023-03-18 19:19:05] [INFO ] Deduced a trap composed of 29 places in 106 ms of which 1 ms to minimize.
[2023-03-18 19:19:05] [INFO ] Deduced a trap composed of 33 places in 104 ms of which 1 ms to minimize.
[2023-03-18 19:19:05] [INFO ] Deduced a trap composed of 27 places in 113 ms of which 0 ms to minimize.
[2023-03-18 19:19:05] [INFO ] Deduced a trap composed of 31 places in 106 ms of which 0 ms to minimize.
[2023-03-18 19:19:06] [INFO ] Deduced a trap composed of 16 places in 119 ms of which 1 ms to minimize.
[2023-03-18 19:19:06] [INFO ] Deduced a trap composed of 17 places in 101 ms of which 0 ms to minimize.
[2023-03-18 19:19:06] [INFO ] Deduced a trap composed of 8 places in 118 ms of which 0 ms to minimize.
[2023-03-18 19:19:06] [INFO ] Deduced a trap composed of 15 places in 126 ms of which 1 ms to minimize.
[2023-03-18 19:19:06] [INFO ] Deduced a trap composed of 8 places in 134 ms of which 0 ms to minimize.
[2023-03-18 19:19:06] [INFO ] Deduced a trap composed of 12 places in 137 ms of which 0 ms to minimize.
[2023-03-18 19:19:06] [INFO ] Deduced a trap composed of 12 places in 103 ms of which 1 ms to minimize.
[2023-03-18 19:19:07] [INFO ] Deduced a trap composed of 11 places in 107 ms of which 0 ms to minimize.
[2023-03-18 19:19:07] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2023-03-18 19:19:07] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 0 ms to minimize.
[2023-03-18 19:19:07] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 0 ms to minimize.
[2023-03-18 19:19:07] [INFO ] Trap strengthening (SAT) tested/added 131/130 trap constraints in 21686 ms
[2023-03-18 19:19:07] [INFO ] After 22179ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 110 ms.
[2023-03-18 19:19:07] [INFO ] After 22463ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 28 ms.
Support contains 6 out of 702 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 702/702 places, 951/951 transitions.
Partial Free-agglomeration rule applied 100 times.
Drop transitions removed 100 transitions
Iterating global reduction 0 with 100 rules applied. Total rules applied 100 place count 702 transition count 951
Applied a total of 100 rules in 58 ms. Remains 702 /702 variables (removed 0) and now considering 951/951 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70 ms. Remains : 702/702 places, 951/951 transitions.
Incomplete random walk after 10000 steps, including 17 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 1) seen :0
Finished Best-First random walk after 8760 steps, including 2 resets, run visited all 1 properties in 27 ms. (steps per millisecond=324 )
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1 (NOT p3)), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (NOT (AND (NOT p2) p3))), (X (NOT (AND p0 (NOT p1) p3))), (X (NOT p2)), (X (OR p2 (NOT p3))), (X (NOT (AND p0 (NOT p1) (NOT p3)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT (AND (NOT p2) p3)))), (X (X (NOT (AND p0 (NOT p1) p3)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p3)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3))))), (X (X (OR p2 (NOT p3)))), (X (X (NOT (AND p0 (NOT p1) (NOT p3)))))]
False Knowledge obtained : [(F (AND p0 (NOT p1) p3)), (F (AND p3 (NOT p2))), (F (AND p0 (NOT p1) (NOT p3))), (F (NOT (OR (NOT p3) p2))), (F p2), (F (NOT p1)), (F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p1) (NOT p3))), (F (AND (NOT p0) (NOT p1) p3))]
Knowledge based reduction with 17 factoid took 782 ms. Reduced automaton from 4 states, 10 edges and 4 AP (stutter insensitive) to 4 states, 10 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 166 ms :[(AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1) p3), (AND (NOT p1) (NOT p0) p3)]
Stuttering acceptance computed with spot in 152 ms :[(AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1) p3), (AND (NOT p1) (NOT p0) p3)]
Support contains 6 out of 702 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 702/702 places, 951/951 transitions.
Applied a total of 0 rules in 24 ms. Remains 702 /702 variables (removed 0) and now considering 951/951 (removed 0) transitions.
[2023-03-18 19:19:08] [INFO ] Invariant cache hit.
[2023-03-18 19:19:09] [INFO ] Implicit Places using invariants in 273 ms returned []
[2023-03-18 19:19:09] [INFO ] Invariant cache hit.
[2023-03-18 19:19:09] [INFO ] Implicit Places using invariants and state equation in 735 ms returned []
Implicit Place search using SMT with State Equation took 1011 ms to find 0 implicit places.
[2023-03-18 19:19:10] [INFO ] Redundant transitions in 173 ms returned []
[2023-03-18 19:19:10] [INFO ] Invariant cache hit.
[2023-03-18 19:19:10] [INFO ] Dead Transitions using invariants and state equation in 489 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1703 ms. Remains : 702/702 places, 951/951 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1 (NOT p3)), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (NOT (AND p0 (NOT p1) p3))), (X (OR (NOT p3) p2)), (X (NOT p2)), (X (NOT (AND p3 (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p3)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT (AND p0 (NOT p1) p3)))), (X (X (OR (NOT p3) p2))), (X (X (NOT p2))), (X (X (NOT (AND p3 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p3)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) (NOT p3)))))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 557 ms. Reduced automaton from 4 states, 10 edges and 4 AP (stutter insensitive) to 4 states, 10 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 130 ms :[(AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1) p3), (AND (NOT p1) (NOT p0) p3)]
Incomplete random walk after 10000 steps, including 15 resets, run finished after 163 ms. (steps per millisecond=61 ) properties (out of 9) seen :7
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-18 19:19:11] [INFO ] Invariant cache hit.
[2023-03-18 19:19:11] [INFO ] [Real]Absence check using 201 positive place invariants in 28 ms returned sat
[2023-03-18 19:19:12] [INFO ] After 509ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-18 19:19:12] [INFO ] [Nat]Absence check using 201 positive place invariants in 28 ms returned sat
[2023-03-18 19:19:12] [INFO ] After 721ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-18 19:19:13] [INFO ] Deduced a trap composed of 11 places in 186 ms of which 1 ms to minimize.
[2023-03-18 19:19:13] [INFO ] Deduced a trap composed of 11 places in 143 ms of which 0 ms to minimize.
[2023-03-18 19:19:13] [INFO ] Deduced a trap composed of 8 places in 139 ms of which 0 ms to minimize.
[2023-03-18 19:19:13] [INFO ] Deduced a trap composed of 8 places in 161 ms of which 0 ms to minimize.
[2023-03-18 19:19:14] [INFO ] Deduced a trap composed of 11 places in 196 ms of which 0 ms to minimize.
[2023-03-18 19:19:14] [INFO ] Deduced a trap composed of 8 places in 203 ms of which 0 ms to minimize.
[2023-03-18 19:19:14] [INFO ] Deduced a trap composed of 11 places in 165 ms of which 0 ms to minimize.
[2023-03-18 19:19:14] [INFO ] Deduced a trap composed of 8 places in 163 ms of which 0 ms to minimize.
[2023-03-18 19:19:15] [INFO ] Deduced a trap composed of 8 places in 164 ms of which 1 ms to minimize.
[2023-03-18 19:19:15] [INFO ] Deduced a trap composed of 8 places in 177 ms of which 0 ms to minimize.
[2023-03-18 19:19:15] [INFO ] Deduced a trap composed of 11 places in 206 ms of which 1 ms to minimize.
[2023-03-18 19:19:15] [INFO ] Deduced a trap composed of 11 places in 134 ms of which 1 ms to minimize.
[2023-03-18 19:19:15] [INFO ] Deduced a trap composed of 8 places in 188 ms of which 0 ms to minimize.
[2023-03-18 19:19:16] [INFO ] Deduced a trap composed of 8 places in 126 ms of which 0 ms to minimize.
[2023-03-18 19:19:16] [INFO ] Deduced a trap composed of 15 places in 125 ms of which 1 ms to minimize.
[2023-03-18 19:19:16] [INFO ] Deduced a trap composed of 21 places in 168 ms of which 0 ms to minimize.
[2023-03-18 19:19:16] [INFO ] Deduced a trap composed of 23 places in 132 ms of which 0 ms to minimize.
[2023-03-18 19:19:16] [INFO ] Deduced a trap composed of 20 places in 136 ms of which 1 ms to minimize.
[2023-03-18 19:19:17] [INFO ] Deduced a trap composed of 9 places in 174 ms of which 1 ms to minimize.
[2023-03-18 19:19:17] [INFO ] Deduced a trap composed of 11 places in 169 ms of which 5 ms to minimize.
[2023-03-18 19:19:17] [INFO ] Deduced a trap composed of 12 places in 155 ms of which 1 ms to minimize.
[2023-03-18 19:19:17] [INFO ] Deduced a trap composed of 15 places in 151 ms of which 1 ms to minimize.
[2023-03-18 19:19:17] [INFO ] Deduced a trap composed of 17 places in 122 ms of which 0 ms to minimize.
[2023-03-18 19:19:17] [INFO ] Deduced a trap composed of 10 places in 138 ms of which 1 ms to minimize.
[2023-03-18 19:19:18] [INFO ] Deduced a trap composed of 16 places in 129 ms of which 0 ms to minimize.
[2023-03-18 19:19:18] [INFO ] Deduced a trap composed of 16 places in 146 ms of which 1 ms to minimize.
[2023-03-18 19:19:18] [INFO ] Deduced a trap composed of 19 places in 156 ms of which 0 ms to minimize.
[2023-03-18 19:19:18] [INFO ] Deduced a trap composed of 16 places in 190 ms of which 0 ms to minimize.
[2023-03-18 19:19:18] [INFO ] Deduced a trap composed of 16 places in 173 ms of which 1 ms to minimize.
[2023-03-18 19:19:19] [INFO ] Deduced a trap composed of 16 places in 151 ms of which 1 ms to minimize.
[2023-03-18 19:19:19] [INFO ] Deduced a trap composed of 16 places in 150 ms of which 0 ms to minimize.
[2023-03-18 19:19:19] [INFO ] Deduced a trap composed of 8 places in 207 ms of which 1 ms to minimize.
[2023-03-18 19:19:19] [INFO ] Deduced a trap composed of 11 places in 174 ms of which 1 ms to minimize.
[2023-03-18 19:19:20] [INFO ] Deduced a trap composed of 11 places in 174 ms of which 1 ms to minimize.
[2023-03-18 19:19:20] [INFO ] Deduced a trap composed of 8 places in 185 ms of which 1 ms to minimize.
[2023-03-18 19:19:20] [INFO ] Deduced a trap composed of 8 places in 168 ms of which 1 ms to minimize.
[2023-03-18 19:19:20] [INFO ] Deduced a trap composed of 12 places in 165 ms of which 0 ms to minimize.
[2023-03-18 19:19:20] [INFO ] Deduced a trap composed of 8 places in 171 ms of which 0 ms to minimize.
[2023-03-18 19:19:21] [INFO ] Deduced a trap composed of 16 places in 153 ms of which 1 ms to minimize.
[2023-03-18 19:19:21] [INFO ] Deduced a trap composed of 11 places in 155 ms of which 0 ms to minimize.
[2023-03-18 19:19:21] [INFO ] Deduced a trap composed of 16 places in 165 ms of which 0 ms to minimize.
[2023-03-18 19:19:21] [INFO ] Deduced a trap composed of 15 places in 174 ms of which 0 ms to minimize.
[2023-03-18 19:19:21] [INFO ] Deduced a trap composed of 15 places in 162 ms of which 0 ms to minimize.
[2023-03-18 19:19:22] [INFO ] Deduced a trap composed of 15 places in 149 ms of which 1 ms to minimize.
[2023-03-18 19:19:22] [INFO ] Deduced a trap composed of 15 places in 162 ms of which 0 ms to minimize.
[2023-03-18 19:19:22] [INFO ] Deduced a trap composed of 12 places in 157 ms of which 1 ms to minimize.
[2023-03-18 19:19:22] [INFO ] Deduced a trap composed of 11 places in 182 ms of which 0 ms to minimize.
[2023-03-18 19:19:23] [INFO ] Deduced a trap composed of 16 places in 158 ms of which 0 ms to minimize.
[2023-03-18 19:19:23] [INFO ] Deduced a trap composed of 15 places in 176 ms of which 1 ms to minimize.
[2023-03-18 19:19:23] [INFO ] Deduced a trap composed of 16 places in 180 ms of which 1 ms to minimize.
[2023-03-18 19:19:23] [INFO ] Deduced a trap composed of 15 places in 172 ms of which 0 ms to minimize.
[2023-03-18 19:19:23] [INFO ] Deduced a trap composed of 15 places in 170 ms of which 1 ms to minimize.
[2023-03-18 19:19:24] [INFO ] Deduced a trap composed of 28 places in 160 ms of which 0 ms to minimize.
[2023-03-18 19:19:24] [INFO ] Deduced a trap composed of 31 places in 171 ms of which 1 ms to minimize.
[2023-03-18 19:19:24] [INFO ] Deduced a trap composed of 23 places in 139 ms of which 1 ms to minimize.
[2023-03-18 19:19:24] [INFO ] Deduced a trap composed of 31 places in 143 ms of which 1 ms to minimize.
[2023-03-18 19:19:24] [INFO ] Deduced a trap composed of 12 places in 162 ms of which 1 ms to minimize.
[2023-03-18 19:19:25] [INFO ] Deduced a trap composed of 20 places in 177 ms of which 0 ms to minimize.
[2023-03-18 19:19:25] [INFO ] Deduced a trap composed of 19 places in 134 ms of which 1 ms to minimize.
[2023-03-18 19:19:25] [INFO ] Deduced a trap composed of 11 places in 154 ms of which 1 ms to minimize.
[2023-03-18 19:19:25] [INFO ] Deduced a trap composed of 20 places in 154 ms of which 0 ms to minimize.
[2023-03-18 19:19:25] [INFO ] Deduced a trap composed of 19 places in 190 ms of which 1 ms to minimize.
[2023-03-18 19:19:26] [INFO ] Deduced a trap composed of 19 places in 200 ms of which 1 ms to minimize.
[2023-03-18 19:19:26] [INFO ] Deduced a trap composed of 36 places in 166 ms of which 0 ms to minimize.
[2023-03-18 19:19:26] [INFO ] Deduced a trap composed of 36 places in 160 ms of which 1 ms to minimize.
[2023-03-18 19:19:26] [INFO ] Deduced a trap composed of 35 places in 133 ms of which 1 ms to minimize.
[2023-03-18 19:19:26] [INFO ] Deduced a trap composed of 35 places in 128 ms of which 0 ms to minimize.
[2023-03-18 19:19:27] [INFO ] Deduced a trap composed of 36 places in 123 ms of which 1 ms to minimize.
[2023-03-18 19:19:27] [INFO ] Deduced a trap composed of 35 places in 171 ms of which 1 ms to minimize.
[2023-03-18 19:19:27] [INFO ] Deduced a trap composed of 36 places in 121 ms of which 1 ms to minimize.
[2023-03-18 19:19:27] [INFO ] Deduced a trap composed of 36 places in 184 ms of which 0 ms to minimize.
[2023-03-18 19:19:27] [INFO ] Deduced a trap composed of 35 places in 187 ms of which 1 ms to minimize.
[2023-03-18 19:19:28] [INFO ] Deduced a trap composed of 35 places in 171 ms of which 1 ms to minimize.
[2023-03-18 19:19:28] [INFO ] Deduced a trap composed of 13 places in 123 ms of which 1 ms to minimize.
[2023-03-18 19:19:28] [INFO ] Deduced a trap composed of 11 places in 124 ms of which 1 ms to minimize.
[2023-03-18 19:19:28] [INFO ] Deduced a trap composed of 19 places in 154 ms of which 0 ms to minimize.
[2023-03-18 19:19:28] [INFO ] Deduced a trap composed of 15 places in 151 ms of which 0 ms to minimize.
[2023-03-18 19:19:28] [INFO ] Deduced a trap composed of 15 places in 121 ms of which 1 ms to minimize.
[2023-03-18 19:19:29] [INFO ] Deduced a trap composed of 23 places in 141 ms of which 0 ms to minimize.
[2023-03-18 19:19:29] [INFO ] Deduced a trap composed of 23 places in 151 ms of which 1 ms to minimize.
[2023-03-18 19:19:29] [INFO ] Deduced a trap composed of 28 places in 178 ms of which 1 ms to minimize.
[2023-03-18 19:19:29] [INFO ] Deduced a trap composed of 27 places in 179 ms of which 1 ms to minimize.
[2023-03-18 19:19:29] [INFO ] Deduced a trap composed of 27 places in 163 ms of which 0 ms to minimize.
[2023-03-18 19:19:30] [INFO ] Deduced a trap composed of 23 places in 114 ms of which 1 ms to minimize.
[2023-03-18 19:19:30] [INFO ] Deduced a trap composed of 23 places in 113 ms of which 0 ms to minimize.
[2023-03-18 19:19:30] [INFO ] Deduced a trap composed of 24 places in 113 ms of which 1 ms to minimize.
[2023-03-18 19:19:30] [INFO ] Deduced a trap composed of 24 places in 102 ms of which 1 ms to minimize.
[2023-03-18 19:19:30] [INFO ] Deduced a trap composed of 24 places in 137 ms of which 1 ms to minimize.
[2023-03-18 19:19:30] [INFO ] Deduced a trap composed of 24 places in 133 ms of which 0 ms to minimize.
[2023-03-18 19:19:31] [INFO ] Deduced a trap composed of 24 places in 172 ms of which 1 ms to minimize.
[2023-03-18 19:19:31] [INFO ] Deduced a trap composed of 23 places in 173 ms of which 1 ms to minimize.
[2023-03-18 19:19:31] [INFO ] Deduced a trap composed of 23 places in 134 ms of which 0 ms to minimize.
[2023-03-18 19:19:31] [INFO ] Deduced a trap composed of 8 places in 138 ms of which 0 ms to minimize.
[2023-03-18 19:19:31] [INFO ] Deduced a trap composed of 8 places in 157 ms of which 0 ms to minimize.
[2023-03-18 19:19:32] [INFO ] Deduced a trap composed of 16 places in 124 ms of which 1 ms to minimize.
[2023-03-18 19:19:32] [INFO ] Deduced a trap composed of 15 places in 124 ms of which 0 ms to minimize.
[2023-03-18 19:19:32] [INFO ] Deduced a trap composed of 15 places in 126 ms of which 1 ms to minimize.
[2023-03-18 19:19:32] [INFO ] Deduced a trap composed of 16 places in 107 ms of which 0 ms to minimize.
[2023-03-18 19:19:32] [INFO ] Deduced a trap composed of 9 places in 107 ms of which 1 ms to minimize.
[2023-03-18 19:19:32] [INFO ] Deduced a trap composed of 15 places in 106 ms of which 0 ms to minimize.
[2023-03-18 19:19:32] [INFO ] Deduced a trap composed of 15 places in 114 ms of which 0 ms to minimize.
[2023-03-18 19:19:33] [INFO ] Deduced a trap composed of 15 places in 130 ms of which 1 ms to minimize.
[2023-03-18 19:19:33] [INFO ] Deduced a trap composed of 24 places in 116 ms of which 0 ms to minimize.
[2023-03-18 19:19:33] [INFO ] Deduced a trap composed of 24 places in 102 ms of which 0 ms to minimize.
[2023-03-18 19:19:33] [INFO ] Deduced a trap composed of 16 places in 105 ms of which 0 ms to minimize.
[2023-03-18 19:19:33] [INFO ] Deduced a trap composed of 15 places in 103 ms of which 0 ms to minimize.
[2023-03-18 19:19:33] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 0 ms to minimize.
[2023-03-18 19:19:33] [INFO ] Deduced a trap composed of 23 places in 87 ms of which 0 ms to minimize.
[2023-03-18 19:19:34] [INFO ] Deduced a trap composed of 23 places in 98 ms of which 1 ms to minimize.
[2023-03-18 19:19:34] [INFO ] Deduced a trap composed of 23 places in 93 ms of which 1 ms to minimize.
[2023-03-18 19:19:34] [INFO ] Deduced a trap composed of 23 places in 93 ms of which 1 ms to minimize.
[2023-03-18 19:19:34] [INFO ] Deduced a trap composed of 23 places in 88 ms of which 1 ms to minimize.
[2023-03-18 19:19:34] [INFO ] Deduced a trap composed of 8 places in 113 ms of which 1 ms to minimize.
[2023-03-18 19:19:34] [INFO ] Deduced a trap composed of 9 places in 106 ms of which 1 ms to minimize.
[2023-03-18 19:19:34] [INFO ] Deduced a trap composed of 11 places in 105 ms of which 0 ms to minimize.
[2023-03-18 19:19:35] [INFO ] Deduced a trap composed of 19 places in 107 ms of which 0 ms to minimize.
[2023-03-18 19:19:35] [INFO ] Deduced a trap composed of 27 places in 101 ms of which 0 ms to minimize.
[2023-03-18 19:19:35] [INFO ] Deduced a trap composed of 27 places in 87 ms of which 1 ms to minimize.
[2023-03-18 19:19:35] [INFO ] Deduced a trap composed of 27 places in 110 ms of which 0 ms to minimize.
[2023-03-18 19:19:35] [INFO ] Deduced a trap composed of 27 places in 96 ms of which 0 ms to minimize.
[2023-03-18 19:19:35] [INFO ] Deduced a trap composed of 27 places in 88 ms of which 0 ms to minimize.
[2023-03-18 19:19:35] [INFO ] Deduced a trap composed of 19 places in 78 ms of which 0 ms to minimize.
[2023-03-18 19:19:36] [INFO ] Deduced a trap composed of 27 places in 100 ms of which 0 ms to minimize.
[2023-03-18 19:19:36] [INFO ] Deduced a trap composed of 27 places in 100 ms of which 0 ms to minimize.
[2023-03-18 19:19:36] [INFO ] Deduced a trap composed of 27 places in 128 ms of which 0 ms to minimize.
[2023-03-18 19:19:36] [INFO ] Deduced a trap composed of 27 places in 100 ms of which 0 ms to minimize.
[2023-03-18 19:19:36] [INFO ] Deduced a trap composed of 27 places in 93 ms of which 0 ms to minimize.
[2023-03-18 19:19:36] [INFO ] Deduced a trap composed of 19 places in 90 ms of which 0 ms to minimize.
[2023-03-18 19:19:36] [INFO ] Deduced a trap composed of 27 places in 87 ms of which 1 ms to minimize.
[2023-03-18 19:19:37] [INFO ] Deduced a trap composed of 27 places in 130 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-18 19:19:37] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 19:19:37] [INFO ] After 25031ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Parikh walk visited 0 properties in 64 ms.
Support contains 6 out of 702 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 702/702 places, 951/951 transitions.
Partial Free-agglomeration rule applied 100 times.
Drop transitions removed 100 transitions
Iterating global reduction 0 with 100 rules applied. Total rules applied 100 place count 702 transition count 951
Applied a total of 100 rules in 44 ms. Remains 702 /702 variables (removed 0) and now considering 951/951 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 702/702 places, 951/951 transitions.
Incomplete random walk after 10000 steps, including 17 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 203601 steps, run timeout after 3001 ms. (steps per millisecond=67 ) properties seen :{}
Probabilistic random walk after 203601 steps, saw 134158 distinct states, run finished after 3004 ms. (steps per millisecond=67 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 951 rows 702 cols
[2023-03-18 19:19:40] [INFO ] Computed 201 place invariants in 3 ms
[2023-03-18 19:19:40] [INFO ] [Real]Absence check using 201 positive place invariants in 24 ms returned sat
[2023-03-18 19:19:40] [INFO ] After 504ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-18 19:19:41] [INFO ] [Nat]Absence check using 201 positive place invariants in 32 ms returned sat
[2023-03-18 19:19:42] [INFO ] After 1056ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-18 19:19:42] [INFO ] Deduced a trap composed of 7 places in 173 ms of which 0 ms to minimize.
[2023-03-18 19:19:42] [INFO ] Deduced a trap composed of 7 places in 140 ms of which 0 ms to minimize.
[2023-03-18 19:19:42] [INFO ] Deduced a trap composed of 7 places in 133 ms of which 0 ms to minimize.
[2023-03-18 19:19:43] [INFO ] Deduced a trap composed of 7 places in 135 ms of which 0 ms to minimize.
[2023-03-18 19:19:43] [INFO ] Deduced a trap composed of 7 places in 170 ms of which 1 ms to minimize.
[2023-03-18 19:19:43] [INFO ] Deduced a trap composed of 7 places in 185 ms of which 0 ms to minimize.
[2023-03-18 19:19:43] [INFO ] Deduced a trap composed of 11 places in 160 ms of which 1 ms to minimize.
[2023-03-18 19:19:43] [INFO ] Deduced a trap composed of 12 places in 158 ms of which 1 ms to minimize.
[2023-03-18 19:19:44] [INFO ] Deduced a trap composed of 7 places in 195 ms of which 0 ms to minimize.
[2023-03-18 19:19:44] [INFO ] Deduced a trap composed of 7 places in 162 ms of which 0 ms to minimize.
[2023-03-18 19:19:44] [INFO ] Deduced a trap composed of 7 places in 165 ms of which 0 ms to minimize.
[2023-03-18 19:19:44] [INFO ] Deduced a trap composed of 12 places in 162 ms of which 0 ms to minimize.
[2023-03-18 19:19:44] [INFO ] Deduced a trap composed of 15 places in 196 ms of which 1 ms to minimize.
[2023-03-18 19:19:45] [INFO ] Deduced a trap composed of 12 places in 167 ms of which 0 ms to minimize.
[2023-03-18 19:19:45] [INFO ] Deduced a trap composed of 11 places in 164 ms of which 1 ms to minimize.
[2023-03-18 19:19:45] [INFO ] Deduced a trap composed of 7 places in 149 ms of which 0 ms to minimize.
[2023-03-18 19:19:45] [INFO ] Deduced a trap composed of 12 places in 146 ms of which 0 ms to minimize.
[2023-03-18 19:19:45] [INFO ] Deduced a trap composed of 11 places in 188 ms of which 0 ms to minimize.
[2023-03-18 19:19:46] [INFO ] Deduced a trap composed of 7 places in 147 ms of which 1 ms to minimize.
[2023-03-18 19:19:46] [INFO ] Deduced a trap composed of 7 places in 144 ms of which 0 ms to minimize.
[2023-03-18 19:19:46] [INFO ] Deduced a trap composed of 10 places in 140 ms of which 0 ms to minimize.
[2023-03-18 19:19:46] [INFO ] Deduced a trap composed of 7 places in 171 ms of which 0 ms to minimize.
[2023-03-18 19:19:46] [INFO ] Deduced a trap composed of 11 places in 126 ms of which 1 ms to minimize.
[2023-03-18 19:19:46] [INFO ] Deduced a trap composed of 11 places in 131 ms of which 0 ms to minimize.
[2023-03-18 19:19:47] [INFO ] Deduced a trap composed of 11 places in 193 ms of which 1 ms to minimize.
[2023-03-18 19:19:47] [INFO ] Deduced a trap composed of 11 places in 131 ms of which 1 ms to minimize.
[2023-03-18 19:19:47] [INFO ] Deduced a trap composed of 15 places in 140 ms of which 0 ms to minimize.
[2023-03-18 19:19:47] [INFO ] Deduced a trap composed of 7 places in 143 ms of which 0 ms to minimize.
[2023-03-18 19:19:47] [INFO ] Deduced a trap composed of 9 places in 126 ms of which 1 ms to minimize.
[2023-03-18 19:19:48] [INFO ] Deduced a trap composed of 7 places in 125 ms of which 0 ms to minimize.
[2023-03-18 19:19:48] [INFO ] Deduced a trap composed of 7 places in 133 ms of which 1 ms to minimize.
[2023-03-18 19:19:48] [INFO ] Deduced a trap composed of 11 places in 147 ms of which 0 ms to minimize.
[2023-03-18 19:19:48] [INFO ] Deduced a trap composed of 12 places in 137 ms of which 0 ms to minimize.
[2023-03-18 19:19:48] [INFO ] Deduced a trap composed of 13 places in 150 ms of which 1 ms to minimize.
[2023-03-18 19:19:49] [INFO ] Deduced a trap composed of 15 places in 161 ms of which 1 ms to minimize.
[2023-03-18 19:19:49] [INFO ] Deduced a trap composed of 12 places in 147 ms of which 0 ms to minimize.
[2023-03-18 19:19:49] [INFO ] Deduced a trap composed of 15 places in 150 ms of which 0 ms to minimize.
[2023-03-18 19:19:49] [INFO ] Deduced a trap composed of 7 places in 147 ms of which 1 ms to minimize.
[2023-03-18 19:19:49] [INFO ] Deduced a trap composed of 7 places in 137 ms of which 0 ms to minimize.
[2023-03-18 19:19:50] [INFO ] Deduced a trap composed of 11 places in 141 ms of which 1 ms to minimize.
[2023-03-18 19:19:50] [INFO ] Deduced a trap composed of 6 places in 170 ms of which 1 ms to minimize.
[2023-03-18 19:19:50] [INFO ] Deduced a trap composed of 19 places in 186 ms of which 0 ms to minimize.
[2023-03-18 19:19:50] [INFO ] Deduced a trap composed of 13 places in 162 ms of which 0 ms to minimize.
[2023-03-18 19:19:50] [INFO ] Deduced a trap composed of 7 places in 169 ms of which 0 ms to minimize.
[2023-03-18 19:19:51] [INFO ] Deduced a trap composed of 11 places in 130 ms of which 1 ms to minimize.
[2023-03-18 19:19:51] [INFO ] Deduced a trap composed of 12 places in 151 ms of which 1 ms to minimize.
[2023-03-18 19:19:51] [INFO ] Deduced a trap composed of 11 places in 129 ms of which 0 ms to minimize.
[2023-03-18 19:19:51] [INFO ] Deduced a trap composed of 16 places in 129 ms of which 0 ms to minimize.
[2023-03-18 19:19:51] [INFO ] Deduced a trap composed of 15 places in 159 ms of which 0 ms to minimize.
[2023-03-18 19:19:51] [INFO ] Deduced a trap composed of 19 places in 127 ms of which 0 ms to minimize.
[2023-03-18 19:19:52] [INFO ] Deduced a trap composed of 16 places in 151 ms of which 1 ms to minimize.
[2023-03-18 19:19:52] [INFO ] Deduced a trap composed of 21 places in 125 ms of which 0 ms to minimize.
[2023-03-18 19:19:52] [INFO ] Deduced a trap composed of 24 places in 145 ms of which 0 ms to minimize.
[2023-03-18 19:19:52] [INFO ] Deduced a trap composed of 7 places in 184 ms of which 1 ms to minimize.
[2023-03-18 19:19:53] [INFO ] Deduced a trap composed of 7 places in 151 ms of which 1 ms to minimize.
[2023-03-18 19:19:53] [INFO ] Deduced a trap composed of 13 places in 194 ms of which 1 ms to minimize.
[2023-03-18 19:19:53] [INFO ] Deduced a trap composed of 7 places in 177 ms of which 1 ms to minimize.
[2023-03-18 19:19:53] [INFO ] Deduced a trap composed of 11 places in 140 ms of which 0 ms to minimize.
[2023-03-18 19:19:53] [INFO ] Deduced a trap composed of 7 places in 162 ms of which 1 ms to minimize.
[2023-03-18 19:19:54] [INFO ] Deduced a trap composed of 7 places in 158 ms of which 0 ms to minimize.
[2023-03-18 19:19:54] [INFO ] Deduced a trap composed of 7 places in 179 ms of which 0 ms to minimize.
[2023-03-18 19:19:54] [INFO ] Deduced a trap composed of 7 places in 155 ms of which 0 ms to minimize.
[2023-03-18 19:19:54] [INFO ] Deduced a trap composed of 11 places in 164 ms of which 1 ms to minimize.
[2023-03-18 19:19:54] [INFO ] Deduced a trap composed of 14 places in 179 ms of which 0 ms to minimize.
[2023-03-18 19:19:55] [INFO ] Deduced a trap composed of 7 places in 155 ms of which 0 ms to minimize.
[2023-03-18 19:19:55] [INFO ] Deduced a trap composed of 11 places in 150 ms of which 0 ms to minimize.
[2023-03-18 19:19:55] [INFO ] Deduced a trap composed of 7 places in 163 ms of which 0 ms to minimize.
[2023-03-18 19:19:55] [INFO ] Deduced a trap composed of 7 places in 133 ms of which 1 ms to minimize.
[2023-03-18 19:19:55] [INFO ] Deduced a trap composed of 11 places in 133 ms of which 1 ms to minimize.
[2023-03-18 19:19:55] [INFO ] Deduced a trap composed of 7 places in 139 ms of which 0 ms to minimize.
[2023-03-18 19:19:56] [INFO ] Deduced a trap composed of 7 places in 138 ms of which 1 ms to minimize.
[2023-03-18 19:19:56] [INFO ] Deduced a trap composed of 11 places in 129 ms of which 0 ms to minimize.
[2023-03-18 19:19:56] [INFO ] Deduced a trap composed of 15 places in 135 ms of which 0 ms to minimize.
[2023-03-18 19:19:56] [INFO ] Deduced a trap composed of 15 places in 133 ms of which 0 ms to minimize.
[2023-03-18 19:19:56] [INFO ] Deduced a trap composed of 15 places in 128 ms of which 0 ms to minimize.
[2023-03-18 19:19:56] [INFO ] Deduced a trap composed of 11 places in 118 ms of which 0 ms to minimize.
[2023-03-18 19:19:57] [INFO ] Deduced a trap composed of 23 places in 145 ms of which 1 ms to minimize.
[2023-03-18 19:19:57] [INFO ] Deduced a trap composed of 23 places in 145 ms of which 0 ms to minimize.
[2023-03-18 19:19:57] [INFO ] Deduced a trap composed of 19 places in 105 ms of which 1 ms to minimize.
[2023-03-18 19:19:57] [INFO ] Deduced a trap composed of 11 places in 115 ms of which 0 ms to minimize.
[2023-03-18 19:19:57] [INFO ] Deduced a trap composed of 15 places in 113 ms of which 0 ms to minimize.
[2023-03-18 19:19:58] [INFO ] Deduced a trap composed of 7 places in 166 ms of which 0 ms to minimize.
[2023-03-18 19:19:58] [INFO ] Deduced a trap composed of 7 places in 174 ms of which 1 ms to minimize.
[2023-03-18 19:19:58] [INFO ] Deduced a trap composed of 7 places in 177 ms of which 1 ms to minimize.
[2023-03-18 19:19:58] [INFO ] Deduced a trap composed of 11 places in 150 ms of which 0 ms to minimize.
[2023-03-18 19:19:59] [INFO ] Deduced a trap composed of 7 places in 152 ms of which 0 ms to minimize.
[2023-03-18 19:19:59] [INFO ] Deduced a trap composed of 12 places in 151 ms of which 0 ms to minimize.
[2023-03-18 19:19:59] [INFO ] Deduced a trap composed of 19 places in 149 ms of which 1 ms to minimize.
[2023-03-18 19:19:59] [INFO ] Deduced a trap composed of 11 places in 163 ms of which 0 ms to minimize.
[2023-03-18 19:19:59] [INFO ] Deduced a trap composed of 10 places in 145 ms of which 1 ms to minimize.
[2023-03-18 19:20:00] [INFO ] Deduced a trap composed of 7 places in 167 ms of which 1 ms to minimize.
[2023-03-18 19:20:00] [INFO ] Deduced a trap composed of 19 places in 149 ms of which 0 ms to minimize.
[2023-03-18 19:20:00] [INFO ] Deduced a trap composed of 7 places in 167 ms of which 0 ms to minimize.
[2023-03-18 19:20:00] [INFO ] Deduced a trap composed of 12 places in 184 ms of which 1 ms to minimize.
[2023-03-18 19:20:00] [INFO ] Deduced a trap composed of 7 places in 161 ms of which 1 ms to minimize.
[2023-03-18 19:20:01] [INFO ] Deduced a trap composed of 21 places in 186 ms of which 1 ms to minimize.
[2023-03-18 19:20:01] [INFO ] Deduced a trap composed of 21 places in 201 ms of which 1 ms to minimize.
[2023-03-18 19:20:01] [INFO ] Deduced a trap composed of 16 places in 166 ms of which 0 ms to minimize.
[2023-03-18 19:20:01] [INFO ] Deduced a trap composed of 16 places in 173 ms of which 0 ms to minimize.
[2023-03-18 19:20:02] [INFO ] Deduced a trap composed of 17 places in 191 ms of which 0 ms to minimize.
[2023-03-18 19:20:02] [INFO ] Deduced a trap composed of 7 places in 172 ms of which 1 ms to minimize.
[2023-03-18 19:20:02] [INFO ] Deduced a trap composed of 11 places in 167 ms of which 0 ms to minimize.
[2023-03-18 19:20:02] [INFO ] Deduced a trap composed of 12 places in 165 ms of which 0 ms to minimize.
[2023-03-18 19:20:02] [INFO ] Deduced a trap composed of 11 places in 159 ms of which 0 ms to minimize.
[2023-03-18 19:20:03] [INFO ] Deduced a trap composed of 24 places in 161 ms of which 0 ms to minimize.
[2023-03-18 19:20:03] [INFO ] Deduced a trap composed of 19 places in 139 ms of which 0 ms to minimize.
[2023-03-18 19:20:03] [INFO ] Deduced a trap composed of 17 places in 168 ms of which 0 ms to minimize.
[2023-03-18 19:20:03] [INFO ] Deduced a trap composed of 17 places in 135 ms of which 0 ms to minimize.
[2023-03-18 19:20:03] [INFO ] Deduced a trap composed of 20 places in 148 ms of which 1 ms to minimize.
[2023-03-18 19:20:04] [INFO ] Deduced a trap composed of 19 places in 153 ms of which 2 ms to minimize.
[2023-03-18 19:20:04] [INFO ] Deduced a trap composed of 7 places in 154 ms of which 1 ms to minimize.
[2023-03-18 19:20:04] [INFO ] Deduced a trap composed of 15 places in 138 ms of which 1 ms to minimize.
[2023-03-18 19:20:04] [INFO ] Deduced a trap composed of 15 places in 151 ms of which 1 ms to minimize.
[2023-03-18 19:20:04] [INFO ] Deduced a trap composed of 15 places in 168 ms of which 0 ms to minimize.
[2023-03-18 19:20:05] [INFO ] Deduced a trap composed of 21 places in 168 ms of which 0 ms to minimize.
[2023-03-18 19:20:05] [INFO ] Deduced a trap composed of 21 places in 155 ms of which 1 ms to minimize.
[2023-03-18 19:20:05] [INFO ] Deduced a trap composed of 19 places in 172 ms of which 0 ms to minimize.
[2023-03-18 19:20:05] [INFO ] Deduced a trap composed of 12 places in 145 ms of which 0 ms to minimize.
[2023-03-18 19:20:05] [INFO ] Deduced a trap composed of 12 places in 141 ms of which 0 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-18 19:20:05] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 19:20:05] [INFO ] After 25118ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Parikh walk visited 0 properties in 71 ms.
Support contains 6 out of 702 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 702/702 places, 951/951 transitions.
Applied a total of 0 rules in 23 ms. Remains 702 /702 variables (removed 0) and now considering 951/951 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 702/702 places, 951/951 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 702/702 places, 951/951 transitions.
Applied a total of 0 rules in 22 ms. Remains 702 /702 variables (removed 0) and now considering 951/951 (removed 0) transitions.
[2023-03-18 19:20:06] [INFO ] Invariant cache hit.
[2023-03-18 19:20:06] [INFO ] Implicit Places using invariants in 422 ms returned []
[2023-03-18 19:20:06] [INFO ] Invariant cache hit.
[2023-03-18 19:20:07] [INFO ] Implicit Places using invariants and state equation in 909 ms returned []
Implicit Place search using SMT with State Equation took 1332 ms to find 0 implicit places.
[2023-03-18 19:20:07] [INFO ] Redundant transitions in 53 ms returned []
[2023-03-18 19:20:07] [INFO ] Invariant cache hit.
[2023-03-18 19:20:07] [INFO ] Dead Transitions using invariants and state equation in 427 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1840 ms. Remains : 702/702 places, 951/951 transitions.
Applied a total of 0 rules in 19 ms. Remains 702 /702 variables (removed 0) and now considering 951/951 (removed 0) transitions.
Running SMT prover for 2 properties.
[2023-03-18 19:20:07] [INFO ] Invariant cache hit.
[2023-03-18 19:20:08] [INFO ] [Real]Absence check using 201 positive place invariants in 23 ms returned sat
[2023-03-18 19:20:08] [INFO ] After 712ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-18 19:20:08] [INFO ] [Nat]Absence check using 201 positive place invariants in 22 ms returned sat
[2023-03-18 19:20:09] [INFO ] After 620ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-18 19:20:09] [INFO ] Deduced a trap composed of 7 places in 141 ms of which 0 ms to minimize.
[2023-03-18 19:20:10] [INFO ] Deduced a trap composed of 7 places in 145 ms of which 1 ms to minimize.
[2023-03-18 19:20:10] [INFO ] Deduced a trap composed of 7 places in 147 ms of which 0 ms to minimize.
[2023-03-18 19:20:10] [INFO ] Deduced a trap composed of 7 places in 138 ms of which 1 ms to minimize.
[2023-03-18 19:20:10] [INFO ] Deduced a trap composed of 7 places in 121 ms of which 0 ms to minimize.
[2023-03-18 19:20:10] [INFO ] Deduced a trap composed of 7 places in 129 ms of which 0 ms to minimize.
[2023-03-18 19:20:10] [INFO ] Deduced a trap composed of 11 places in 135 ms of which 0 ms to minimize.
[2023-03-18 19:20:11] [INFO ] Deduced a trap composed of 7 places in 124 ms of which 0 ms to minimize.
[2023-03-18 19:20:11] [INFO ] Deduced a trap composed of 19 places in 124 ms of which 0 ms to minimize.
[2023-03-18 19:20:11] [INFO ] Deduced a trap composed of 11 places in 122 ms of which 1 ms to minimize.
[2023-03-18 19:20:11] [INFO ] Deduced a trap composed of 11 places in 114 ms of which 0 ms to minimize.
[2023-03-18 19:20:11] [INFO ] Deduced a trap composed of 12 places in 121 ms of which 1 ms to minimize.
[2023-03-18 19:20:11] [INFO ] Deduced a trap composed of 13 places in 126 ms of which 1 ms to minimize.
[2023-03-18 19:20:11] [INFO ] Deduced a trap composed of 7 places in 134 ms of which 1 ms to minimize.
[2023-03-18 19:20:12] [INFO ] Deduced a trap composed of 27 places in 130 ms of which 1 ms to minimize.
[2023-03-18 19:20:12] [INFO ] Deduced a trap composed of 12 places in 131 ms of which 0 ms to minimize.
[2023-03-18 19:20:12] [INFO ] Deduced a trap composed of 7 places in 158 ms of which 1 ms to minimize.
[2023-03-18 19:20:12] [INFO ] Deduced a trap composed of 7 places in 138 ms of which 0 ms to minimize.
[2023-03-18 19:20:12] [INFO ] Deduced a trap composed of 16 places in 134 ms of which 1 ms to minimize.
[2023-03-18 19:20:13] [INFO ] Deduced a trap composed of 7 places in 156 ms of which 0 ms to minimize.
[2023-03-18 19:20:13] [INFO ] Deduced a trap composed of 11 places in 147 ms of which 1 ms to minimize.
[2023-03-18 19:20:13] [INFO ] Deduced a trap composed of 19 places in 143 ms of which 0 ms to minimize.
[2023-03-18 19:20:13] [INFO ] Deduced a trap composed of 24 places in 164 ms of which 0 ms to minimize.
[2023-03-18 19:20:13] [INFO ] Deduced a trap composed of 21 places in 155 ms of which 0 ms to minimize.
[2023-03-18 19:20:14] [INFO ] Deduced a trap composed of 19 places in 147 ms of which 1 ms to minimize.
[2023-03-18 19:20:14] [INFO ] Deduced a trap composed of 20 places in 145 ms of which 0 ms to minimize.
[2023-03-18 19:20:14] [INFO ] Deduced a trap composed of 19 places in 127 ms of which 1 ms to minimize.
[2023-03-18 19:20:14] [INFO ] Deduced a trap composed of 19 places in 137 ms of which 0 ms to minimize.
[2023-03-18 19:20:14] [INFO ] Deduced a trap composed of 15 places in 156 ms of which 0 ms to minimize.
[2023-03-18 19:20:14] [INFO ] Deduced a trap composed of 19 places in 129 ms of which 0 ms to minimize.
[2023-03-18 19:20:15] [INFO ] Deduced a trap composed of 23 places in 136 ms of which 0 ms to minimize.
[2023-03-18 19:20:15] [INFO ] Deduced a trap composed of 23 places in 132 ms of which 1 ms to minimize.
[2023-03-18 19:20:15] [INFO ] Deduced a trap composed of 7 places in 156 ms of which 0 ms to minimize.
[2023-03-18 19:20:15] [INFO ] Deduced a trap composed of 7 places in 164 ms of which 0 ms to minimize.
[2023-03-18 19:20:15] [INFO ] Deduced a trap composed of 15 places in 150 ms of which 0 ms to minimize.
[2023-03-18 19:20:16] [INFO ] Deduced a trap composed of 19 places in 145 ms of which 0 ms to minimize.
[2023-03-18 19:20:16] [INFO ] Deduced a trap composed of 19 places in 139 ms of which 1 ms to minimize.
[2023-03-18 19:20:16] [INFO ] Deduced a trap composed of 7 places in 182 ms of which 1 ms to minimize.
[2023-03-18 19:20:16] [INFO ] Deduced a trap composed of 7 places in 177 ms of which 0 ms to minimize.
[2023-03-18 19:20:17] [INFO ] Deduced a trap composed of 7 places in 185 ms of which 0 ms to minimize.
[2023-03-18 19:20:17] [INFO ] Deduced a trap composed of 13 places in 172 ms of which 0 ms to minimize.
[2023-03-18 19:20:17] [INFO ] Deduced a trap composed of 7 places in 157 ms of which 1 ms to minimize.
[2023-03-18 19:20:17] [INFO ] Deduced a trap composed of 10 places in 183 ms of which 0 ms to minimize.
[2023-03-18 19:20:18] [INFO ] Deduced a trap composed of 10 places in 181 ms of which 1 ms to minimize.
[2023-03-18 19:20:18] [INFO ] Deduced a trap composed of 7 places in 136 ms of which 1 ms to minimize.
[2023-03-18 19:20:18] [INFO ] Deduced a trap composed of 7 places in 133 ms of which 0 ms to minimize.
[2023-03-18 19:20:18] [INFO ] Deduced a trap composed of 7 places in 160 ms of which 1 ms to minimize.
[2023-03-18 19:20:18] [INFO ] Deduced a trap composed of 7 places in 172 ms of which 0 ms to minimize.
[2023-03-18 19:20:19] [INFO ] Deduced a trap composed of 11 places in 148 ms of which 0 ms to minimize.
[2023-03-18 19:20:19] [INFO ] Deduced a trap composed of 11 places in 151 ms of which 0 ms to minimize.
[2023-03-18 19:20:19] [INFO ] Deduced a trap composed of 7 places in 219 ms of which 1 ms to minimize.
[2023-03-18 19:20:19] [INFO ] Deduced a trap composed of 12 places in 194 ms of which 1 ms to minimize.
[2023-03-18 19:20:20] [INFO ] Deduced a trap composed of 15 places in 209 ms of which 0 ms to minimize.
[2023-03-18 19:20:20] [INFO ] Deduced a trap composed of 11 places in 243 ms of which 1 ms to minimize.
[2023-03-18 19:20:20] [INFO ] Deduced a trap composed of 15 places in 180 ms of which 1 ms to minimize.
[2023-03-18 19:20:20] [INFO ] Deduced a trap composed of 15 places in 186 ms of which 0 ms to minimize.
[2023-03-18 19:20:21] [INFO ] Deduced a trap composed of 19 places in 204 ms of which 0 ms to minimize.
[2023-03-18 19:20:21] [INFO ] Deduced a trap composed of 17 places in 205 ms of which 1 ms to minimize.
[2023-03-18 19:20:21] [INFO ] Deduced a trap composed of 15 places in 175 ms of which 1 ms to minimize.
[2023-03-18 19:20:21] [INFO ] Deduced a trap composed of 15 places in 173 ms of which 0 ms to minimize.
[2023-03-18 19:20:22] [INFO ] Deduced a trap composed of 19 places in 175 ms of which 1 ms to minimize.
[2023-03-18 19:20:22] [INFO ] Deduced a trap composed of 19 places in 155 ms of which 0 ms to minimize.
[2023-03-18 19:20:22] [INFO ] Deduced a trap composed of 19 places in 183 ms of which 1 ms to minimize.
[2023-03-18 19:20:22] [INFO ] Deduced a trap composed of 7 places in 195 ms of which 1 ms to minimize.
[2023-03-18 19:20:22] [INFO ] Deduced a trap composed of 15 places in 167 ms of which 1 ms to minimize.
[2023-03-18 19:20:23] [INFO ] Deduced a trap composed of 7 places in 143 ms of which 1 ms to minimize.
[2023-03-18 19:20:23] [INFO ] Deduced a trap composed of 15 places in 127 ms of which 0 ms to minimize.
[2023-03-18 19:20:23] [INFO ] Deduced a trap composed of 15 places in 128 ms of which 1 ms to minimize.
[2023-03-18 19:20:23] [INFO ] Deduced a trap composed of 15 places in 188 ms of which 0 ms to minimize.
[2023-03-18 19:20:23] [INFO ] Deduced a trap composed of 7 places in 172 ms of which 1 ms to minimize.
[2023-03-18 19:20:24] [INFO ] Deduced a trap composed of 17 places in 166 ms of which 0 ms to minimize.
[2023-03-18 19:20:24] [INFO ] Deduced a trap composed of 13 places in 120 ms of which 0 ms to minimize.
[2023-03-18 19:20:24] [INFO ] Deduced a trap composed of 11 places in 170 ms of which 1 ms to minimize.
[2023-03-18 19:20:24] [INFO ] Deduced a trap composed of 15 places in 117 ms of which 0 ms to minimize.
[2023-03-18 19:20:24] [INFO ] Deduced a trap composed of 11 places in 116 ms of which 0 ms to minimize.
[2023-03-18 19:20:24] [INFO ] Deduced a trap composed of 16 places in 118 ms of which 0 ms to minimize.
[2023-03-18 19:20:24] [INFO ] Deduced a trap composed of 16 places in 114 ms of which 0 ms to minimize.
[2023-03-18 19:20:25] [INFO ] Deduced a trap composed of 16 places in 147 ms of which 0 ms to minimize.
[2023-03-18 19:20:25] [INFO ] Deduced a trap composed of 23 places in 123 ms of which 0 ms to minimize.
[2023-03-18 19:20:25] [INFO ] Deduced a trap composed of 21 places in 114 ms of which 0 ms to minimize.
[2023-03-18 19:20:25] [INFO ] Deduced a trap composed of 23 places in 117 ms of which 1 ms to minimize.
[2023-03-18 19:20:25] [INFO ] Deduced a trap composed of 19 places in 120 ms of which 1 ms to minimize.
[2023-03-18 19:20:25] [INFO ] Deduced a trap composed of 19 places in 118 ms of which 0 ms to minimize.
[2023-03-18 19:20:26] [INFO ] Deduced a trap composed of 19 places in 127 ms of which 0 ms to minimize.
[2023-03-18 19:20:26] [INFO ] Deduced a trap composed of 15 places in 123 ms of which 1 ms to minimize.
[2023-03-18 19:20:26] [INFO ] Deduced a trap composed of 15 places in 129 ms of which 0 ms to minimize.
[2023-03-18 19:20:26] [INFO ] Deduced a trap composed of 15 places in 146 ms of which 0 ms to minimize.
[2023-03-18 19:20:26] [INFO ] Deduced a trap composed of 23 places in 126 ms of which 0 ms to minimize.
[2023-03-18 19:20:26] [INFO ] Deduced a trap composed of 23 places in 129 ms of which 0 ms to minimize.
[2023-03-18 19:20:27] [INFO ] Deduced a trap composed of 23 places in 120 ms of which 0 ms to minimize.
[2023-03-18 19:20:27] [INFO ] Deduced a trap composed of 19 places in 149 ms of which 1 ms to minimize.
[2023-03-18 19:20:27] [INFO ] Deduced a trap composed of 19 places in 156 ms of which 0 ms to minimize.
[2023-03-18 19:20:27] [INFO ] Deduced a trap composed of 19 places in 135 ms of which 0 ms to minimize.
[2023-03-18 19:20:27] [INFO ] Deduced a trap composed of 28 places in 157 ms of which 1 ms to minimize.
[2023-03-18 19:20:28] [INFO ] Deduced a trap composed of 28 places in 165 ms of which 1 ms to minimize.
[2023-03-18 19:20:28] [INFO ] Deduced a trap composed of 28 places in 120 ms of which 0 ms to minimize.
[2023-03-18 19:20:28] [INFO ] Deduced a trap composed of 24 places in 147 ms of which 0 ms to minimize.
[2023-03-18 19:20:28] [INFO ] Deduced a trap composed of 24 places in 144 ms of which 0 ms to minimize.
[2023-03-18 19:20:28] [INFO ] Deduced a trap composed of 28 places in 136 ms of which 1 ms to minimize.
[2023-03-18 19:20:29] [INFO ] Deduced a trap composed of 7 places in 168 ms of which 1 ms to minimize.
[2023-03-18 19:20:29] [INFO ] Deduced a trap composed of 28 places in 129 ms of which 1 ms to minimize.
[2023-03-18 19:20:29] [INFO ] Deduced a trap composed of 28 places in 124 ms of which 0 ms to minimize.
[2023-03-18 19:20:29] [INFO ] Deduced a trap composed of 28 places in 170 ms of which 0 ms to minimize.
[2023-03-18 19:20:29] [INFO ] Deduced a trap composed of 24 places in 185 ms of which 1 ms to minimize.
[2023-03-18 19:20:29] [INFO ] Deduced a trap composed of 28 places in 163 ms of which 0 ms to minimize.
[2023-03-18 19:20:30] [INFO ] Deduced a trap composed of 25 places in 142 ms of which 0 ms to minimize.
[2023-03-18 19:20:30] [INFO ] Deduced a trap composed of 24 places in 118 ms of which 1 ms to minimize.
[2023-03-18 19:20:30] [INFO ] Deduced a trap composed of 28 places in 115 ms of which 0 ms to minimize.
[2023-03-18 19:20:30] [INFO ] Deduced a trap composed of 28 places in 112 ms of which 0 ms to minimize.
[2023-03-18 19:20:30] [INFO ] Deduced a trap composed of 24 places in 112 ms of which 1 ms to minimize.
[2023-03-18 19:20:30] [INFO ] Deduced a trap composed of 35 places in 167 ms of which 1 ms to minimize.
[2023-03-18 19:20:31] [INFO ] Deduced a trap composed of 31 places in 176 ms of which 1 ms to minimize.
[2023-03-18 19:20:31] [INFO ] Deduced a trap composed of 27 places in 133 ms of which 1 ms to minimize.
[2023-03-18 19:20:31] [INFO ] Deduced a trap composed of 7 places in 218 ms of which 1 ms to minimize.
[2023-03-18 19:20:31] [INFO ] Deduced a trap composed of 7 places in 165 ms of which 0 ms to minimize.
[2023-03-18 19:20:32] [INFO ] Deduced a trap composed of 7 places in 135 ms of which 0 ms to minimize.
[2023-03-18 19:20:32] [INFO ] Deduced a trap composed of 7 places in 165 ms of which 0 ms to minimize.
[2023-03-18 19:20:32] [INFO ] Deduced a trap composed of 7 places in 210 ms of which 0 ms to minimize.
[2023-03-18 19:20:33] [INFO ] Deduced a trap composed of 7 places in 158 ms of which 0 ms to minimize.
[2023-03-18 19:20:33] [INFO ] Deduced a trap composed of 12 places in 160 ms of which 0 ms to minimize.
[2023-03-18 19:20:33] [INFO ] Deduced a trap composed of 7 places in 190 ms of which 1 ms to minimize.
[2023-03-18 19:20:33] [INFO ] Deduced a trap composed of 12 places in 183 ms of which 1 ms to minimize.
[2023-03-18 19:20:34] [INFO ] Deduced a trap composed of 13 places in 219 ms of which 1 ms to minimize.
[2023-03-18 19:20:34] [INFO ] Deduced a trap composed of 7 places in 183 ms of which 1 ms to minimize.
[2023-03-18 19:20:34] [INFO ] Deduced a trap composed of 7 places in 210 ms of which 0 ms to minimize.
[2023-03-18 19:20:34] [INFO ] Deduced a trap composed of 11 places in 191 ms of which 3 ms to minimize.
[2023-03-18 19:20:35] [INFO ] Deduced a trap composed of 11 places in 148 ms of which 0 ms to minimize.
[2023-03-18 19:20:35] [INFO ] Deduced a trap composed of 7 places in 156 ms of which 0 ms to minimize.
[2023-03-18 19:20:35] [INFO ] Deduced a trap composed of 12 places in 193 ms of which 1 ms to minimize.
[2023-03-18 19:20:35] [INFO ] Deduced a trap composed of 11 places in 185 ms of which 1 ms to minimize.
[2023-03-18 19:20:35] [INFO ] Deduced a trap composed of 11 places in 171 ms of which 0 ms to minimize.
[2023-03-18 19:20:36] [INFO ] Deduced a trap composed of 7 places in 161 ms of which 0 ms to minimize.
[2023-03-18 19:20:36] [INFO ] Deduced a trap composed of 7 places in 144 ms of which 1 ms to minimize.
[2023-03-18 19:20:36] [INFO ] Deduced a trap composed of 7 places in 182 ms of which 0 ms to minimize.
[2023-03-18 19:20:36] [INFO ] Deduced a trap composed of 12 places in 160 ms of which 0 ms to minimize.
[2023-03-18 19:20:36] [INFO ] Deduced a trap composed of 12 places in 147 ms of which 0 ms to minimize.
[2023-03-18 19:20:37] [INFO ] Deduced a trap composed of 7 places in 169 ms of which 0 ms to minimize.
[2023-03-18 19:20:37] [INFO ] Deduced a trap composed of 7 places in 235 ms of which 1 ms to minimize.
[2023-03-18 19:20:37] [INFO ] Deduced a trap composed of 7 places in 196 ms of which 0 ms to minimize.
[2023-03-18 19:20:38] [INFO ] Deduced a trap composed of 7 places in 153 ms of which 1 ms to minimize.
[2023-03-18 19:20:38] [INFO ] Deduced a trap composed of 11 places in 170 ms of which 0 ms to minimize.
[2023-03-18 19:20:38] [INFO ] Deduced a trap composed of 9 places in 147 ms of which 0 ms to minimize.
[2023-03-18 19:20:38] [INFO ] Deduced a trap composed of 7 places in 154 ms of which 0 ms to minimize.
[2023-03-18 19:20:38] [INFO ] Deduced a trap composed of 23 places in 162 ms of which 0 ms to minimize.
[2023-03-18 19:20:39] [INFO ] Deduced a trap composed of 7 places in 141 ms of which 0 ms to minimize.
[2023-03-18 19:20:39] [INFO ] Deduced a trap composed of 7 places in 149 ms of which 0 ms to minimize.
[2023-03-18 19:20:39] [INFO ] Deduced a trap composed of 11 places in 158 ms of which 0 ms to minimize.
[2023-03-18 19:20:39] [INFO ] Deduced a trap composed of 6 places in 148 ms of which 0 ms to minimize.
[2023-03-18 19:20:40] [INFO ] Deduced a trap composed of 24 places in 195 ms of which 1 ms to minimize.
[2023-03-18 19:20:40] [INFO ] Deduced a trap composed of 15 places in 172 ms of which 0 ms to minimize.
[2023-03-18 19:20:40] [INFO ] Deduced a trap composed of 7 places in 198 ms of which 0 ms to minimize.
[2023-03-18 19:20:40] [INFO ] Deduced a trap composed of 15 places in 147 ms of which 1 ms to minimize.
[2023-03-18 19:20:40] [INFO ] Deduced a trap composed of 28 places in 161 ms of which 0 ms to minimize.
[2023-03-18 19:20:41] [INFO ] Deduced a trap composed of 19 places in 195 ms of which 0 ms to minimize.
[2023-03-18 19:20:41] [INFO ] Deduced a trap composed of 24 places in 153 ms of which 0 ms to minimize.
[2023-03-18 19:20:41] [INFO ] Deduced a trap composed of 15 places in 141 ms of which 1 ms to minimize.
[2023-03-18 19:20:41] [INFO ] Deduced a trap composed of 28 places in 146 ms of which 1 ms to minimize.
[2023-03-18 19:20:41] [INFO ] Deduced a trap composed of 19 places in 156 ms of which 1 ms to minimize.
[2023-03-18 19:20:42] [INFO ] Deduced a trap composed of 24 places in 174 ms of which 0 ms to minimize.
[2023-03-18 19:20:42] [INFO ] Deduced a trap composed of 27 places in 145 ms of which 1 ms to minimize.
[2023-03-18 19:20:42] [INFO ] Deduced a trap composed of 23 places in 151 ms of which 0 ms to minimize.
[2023-03-18 19:20:42] [INFO ] Deduced a trap composed of 27 places in 157 ms of which 0 ms to minimize.
[2023-03-18 19:20:42] [INFO ] Deduced a trap composed of 23 places in 146 ms of which 0 ms to minimize.
[2023-03-18 19:20:43] [INFO ] Deduced a trap composed of 7 places in 173 ms of which 1 ms to minimize.
[2023-03-18 19:20:43] [INFO ] Deduced a trap composed of 11 places in 155 ms of which 0 ms to minimize.
[2023-03-18 19:20:43] [INFO ] Deduced a trap composed of 13 places in 148 ms of which 1 ms to minimize.
[2023-03-18 19:20:43] [INFO ] Deduced a trap composed of 7 places in 154 ms of which 1 ms to minimize.
[2023-03-18 19:20:43] [INFO ] Deduced a trap composed of 11 places in 152 ms of which 0 ms to minimize.
[2023-03-18 19:20:44] [INFO ] Deduced a trap composed of 7 places in 181 ms of which 0 ms to minimize.
[2023-03-18 19:20:44] [INFO ] Deduced a trap composed of 10 places in 206 ms of which 0 ms to minimize.
[2023-03-18 19:20:44] [INFO ] Deduced a trap composed of 11 places in 156 ms of which 0 ms to minimize.
[2023-03-18 19:20:45] [INFO ] Deduced a trap composed of 28 places in 133 ms of which 0 ms to minimize.
[2023-03-18 19:20:45] [INFO ] Deduced a trap composed of 32 places in 131 ms of which 0 ms to minimize.
[2023-03-18 19:20:45] [INFO ] Deduced a trap composed of 33 places in 135 ms of which 0 ms to minimize.
[2023-03-18 19:20:45] [INFO ] Deduced a trap composed of 7 places in 134 ms of which 0 ms to minimize.
[2023-03-18 19:20:45] [INFO ] Deduced a trap composed of 7 places in 173 ms of which 0 ms to minimize.
[2023-03-18 19:20:46] [INFO ] Deduced a trap composed of 17 places in 186 ms of which 0 ms to minimize.
[2023-03-18 19:20:46] [INFO ] Deduced a trap composed of 7 places in 164 ms of which 0 ms to minimize.
[2023-03-18 19:20:46] [INFO ] Deduced a trap composed of 16 places in 136 ms of which 1 ms to minimize.
[2023-03-18 19:20:46] [INFO ] Deduced a trap composed of 16 places in 171 ms of which 0 ms to minimize.
[2023-03-18 19:20:46] [INFO ] Deduced a trap composed of 16 places in 131 ms of which 1 ms to minimize.
[2023-03-18 19:20:47] [INFO ] Deduced a trap composed of 7 places in 167 ms of which 1 ms to minimize.
[2023-03-18 19:20:47] [INFO ] Deduced a trap composed of 7 places in 148 ms of which 0 ms to minimize.
[2023-03-18 19:20:47] [INFO ] Deduced a trap composed of 15 places in 150 ms of which 1 ms to minimize.
[2023-03-18 19:20:47] [INFO ] Deduced a trap composed of 21 places in 126 ms of which 0 ms to minimize.
[2023-03-18 19:20:47] [INFO ] Deduced a trap composed of 16 places in 146 ms of which 0 ms to minimize.
[2023-03-18 19:20:48] [INFO ] Deduced a trap composed of 13 places in 150 ms of which 1 ms to minimize.
[2023-03-18 19:20:48] [INFO ] Deduced a trap composed of 12 places in 128 ms of which 1 ms to minimize.
[2023-03-18 19:20:48] [INFO ] Deduced a trap composed of 11 places in 156 ms of which 0 ms to minimize.
[2023-03-18 19:20:48] [INFO ] Deduced a trap composed of 11 places in 171 ms of which 0 ms to minimize.
[2023-03-18 19:20:48] [INFO ] Deduced a trap composed of 11 places in 119 ms of which 0 ms to minimize.
[2023-03-18 19:20:48] [INFO ] Deduced a trap composed of 19 places in 133 ms of which 1 ms to minimize.
[2023-03-18 19:20:49] [INFO ] Deduced a trap composed of 15 places in 181 ms of which 1 ms to minimize.
[2023-03-18 19:20:49] [INFO ] Deduced a trap composed of 19 places in 130 ms of which 1 ms to minimize.
[2023-03-18 19:20:49] [INFO ] Deduced a trap composed of 15 places in 113 ms of which 1 ms to minimize.
[2023-03-18 19:20:49] [INFO ] Deduced a trap composed of 15 places in 115 ms of which 0 ms to minimize.
[2023-03-18 19:20:49] [INFO ] Deduced a trap composed of 15 places in 161 ms of which 0 ms to minimize.
[2023-03-18 19:20:49] [INFO ] Deduced a trap composed of 19 places in 114 ms of which 1 ms to minimize.
[2023-03-18 19:20:50] [INFO ] Deduced a trap composed of 15 places in 130 ms of which 1 ms to minimize.
[2023-03-18 19:20:50] [INFO ] Deduced a trap composed of 20 places in 171 ms of which 0 ms to minimize.
[2023-03-18 19:20:50] [INFO ] Deduced a trap composed of 15 places in 168 ms of which 1 ms to minimize.
[2023-03-18 19:20:50] [INFO ] Deduced a trap composed of 12 places in 142 ms of which 0 ms to minimize.
[2023-03-18 19:20:51] [INFO ] Deduced a trap composed of 7 places in 182 ms of which 0 ms to minimize.
[2023-03-18 19:20:51] [INFO ] Deduced a trap composed of 16 places in 153 ms of which 0 ms to minimize.
[2023-03-18 19:20:51] [INFO ] Deduced a trap composed of 24 places in 153 ms of which 1 ms to minimize.
[2023-03-18 19:20:51] [INFO ] Deduced a trap composed of 7 places in 171 ms of which 0 ms to minimize.
[2023-03-18 19:20:51] [INFO ] Deduced a trap composed of 15 places in 168 ms of which 0 ms to minimize.
[2023-03-18 19:20:52] [INFO ] Deduced a trap composed of 12 places in 181 ms of which 1 ms to minimize.
[2023-03-18 19:20:52] [INFO ] Deduced a trap composed of 15 places in 171 ms of which 1 ms to minimize.
[2023-03-18 19:20:52] [INFO ] Deduced a trap composed of 23 places in 154 ms of which 0 ms to minimize.
[2023-03-18 19:20:52] [INFO ] Deduced a trap composed of 19 places in 174 ms of which 1 ms to minimize.
[2023-03-18 19:20:52] [INFO ] Deduced a trap composed of 19 places in 166 ms of which 0 ms to minimize.
[2023-03-18 19:20:53] [INFO ] Deduced a trap composed of 23 places in 209 ms of which 1 ms to minimize.
[2023-03-18 19:20:53] [INFO ] Deduced a trap composed of 23 places in 154 ms of which 0 ms to minimize.
[2023-03-18 19:20:53] [INFO ] Deduced a trap composed of 17 places in 153 ms of which 1 ms to minimize.
[2023-03-18 19:20:53] [INFO ] Deduced a trap composed of 15 places in 166 ms of which 1 ms to minimize.
[2023-03-18 19:20:53] [INFO ] Deduced a trap composed of 35 places in 186 ms of which 1 ms to minimize.
[2023-03-18 19:20:54] [INFO ] Deduced a trap composed of 23 places in 170 ms of which 0 ms to minimize.
[2023-03-18 19:20:54] [INFO ] Deduced a trap composed of 23 places in 187 ms of which 0 ms to minimize.
[2023-03-18 19:20:54] [INFO ] Deduced a trap composed of 13 places in 175 ms of which 1 ms to minimize.
[2023-03-18 19:20:54] [INFO ] Deduced a trap composed of 12 places in 175 ms of which 1 ms to minimize.
[2023-03-18 19:20:55] [INFO ] Deduced a trap composed of 23 places in 182 ms of which 1 ms to minimize.
[2023-03-18 19:20:55] [INFO ] Deduced a trap composed of 23 places in 197 ms of which 1 ms to minimize.
[2023-03-18 19:20:55] [INFO ] Deduced a trap composed of 24 places in 200 ms of which 0 ms to minimize.
[2023-03-18 19:20:55] [INFO ] Deduced a trap composed of 27 places in 218 ms of which 0 ms to minimize.
[2023-03-18 19:20:56] [INFO ] Deduced a trap composed of 19 places in 212 ms of which 0 ms to minimize.
[2023-03-18 19:20:56] [INFO ] Deduced a trap composed of 27 places in 170 ms of which 1 ms to minimize.
[2023-03-18 19:20:56] [INFO ] Deduced a trap composed of 23 places in 163 ms of which 0 ms to minimize.
[2023-03-18 19:20:56] [INFO ] Deduced a trap composed of 27 places in 181 ms of which 0 ms to minimize.
[2023-03-18 19:20:56] [INFO ] Deduced a trap composed of 24 places in 219 ms of which 0 ms to minimize.
[2023-03-18 19:20:57] [INFO ] Deduced a trap composed of 32 places in 159 ms of which 0 ms to minimize.
[2023-03-18 19:20:57] [INFO ] Deduced a trap composed of 28 places in 178 ms of which 1 ms to minimize.
[2023-03-18 19:20:57] [INFO ] Deduced a trap composed of 33 places in 155 ms of which 1 ms to minimize.
[2023-03-18 19:20:57] [INFO ] Deduced a trap composed of 25 places in 192 ms of which 1 ms to minimize.
[2023-03-18 19:20:58] [INFO ] Deduced a trap composed of 31 places in 179 ms of which 1 ms to minimize.
[2023-03-18 19:20:58] [INFO ] Deduced a trap composed of 33 places in 147 ms of which 0 ms to minimize.
[2023-03-18 19:20:58] [INFO ] Deduced a trap composed of 33 places in 151 ms of which 1 ms to minimize.
[2023-03-18 19:20:58] [INFO ] Deduced a trap composed of 33 places in 208 ms of which 1 ms to minimize.
[2023-03-18 19:20:58] [INFO ] Deduced a trap composed of 29 places in 167 ms of which 0 ms to minimize.
[2023-03-18 19:20:59] [INFO ] Deduced a trap composed of 29 places in 176 ms of which 0 ms to minimize.
[2023-03-18 19:20:59] [INFO ] Deduced a trap composed of 33 places in 131 ms of which 0 ms to minimize.
[2023-03-18 19:20:59] [INFO ] Deduced a trap composed of 29 places in 148 ms of which 0 ms to minimize.
[2023-03-18 19:20:59] [INFO ] Deduced a trap composed of 23 places in 176 ms of which 1 ms to minimize.
[2023-03-18 19:20:59] [INFO ] Deduced a trap composed of 23 places in 190 ms of which 1 ms to minimize.
[2023-03-18 19:21:00] [INFO ] Deduced a trap composed of 31 places in 141 ms of which 0 ms to minimize.
[2023-03-18 19:21:00] [INFO ] Deduced a trap composed of 31 places in 123 ms of which 0 ms to minimize.
[2023-03-18 19:21:00] [INFO ] Deduced a trap composed of 31 places in 121 ms of which 0 ms to minimize.
[2023-03-18 19:21:00] [INFO ] Deduced a trap composed of 30 places in 163 ms of which 1 ms to minimize.
[2023-03-18 19:21:00] [INFO ] Deduced a trap composed of 35 places in 108 ms of which 1 ms to minimize.
[2023-03-18 19:21:00] [INFO ] Deduced a trap composed of 35 places in 119 ms of which 1 ms to minimize.
[2023-03-18 19:21:01] [INFO ] Deduced a trap composed of 11 places in 141 ms of which 1 ms to minimize.
[2023-03-18 19:21:01] [INFO ] Deduced a trap composed of 11 places in 124 ms of which 0 ms to minimize.
[2023-03-18 19:21:01] [INFO ] Deduced a trap composed of 16 places in 121 ms of which 0 ms to minimize.
[2023-03-18 19:21:01] [INFO ] Deduced a trap composed of 16 places in 177 ms of which 1 ms to minimize.
[2023-03-18 19:21:01] [INFO ] Deduced a trap composed of 15 places in 127 ms of which 1 ms to minimize.
[2023-03-18 19:21:02] [INFO ] Deduced a trap composed of 11 places in 109 ms of which 1 ms to minimize.
[2023-03-18 19:21:02] [INFO ] Deduced a trap composed of 15 places in 167 ms of which 1 ms to minimize.
[2023-03-18 19:21:02] [INFO ] Deduced a trap composed of 10 places in 177 ms of which 0 ms to minimize.
[2023-03-18 19:21:02] [INFO ] Deduced a trap composed of 12 places in 190 ms of which 0 ms to minimize.
[2023-03-18 19:21:02] [INFO ] Deduced a trap composed of 7 places in 135 ms of which 1 ms to minimize.
[2023-03-18 19:21:03] [INFO ] Deduced a trap composed of 12 places in 174 ms of which 0 ms to minimize.
[2023-03-18 19:21:03] [INFO ] Deduced a trap composed of 7 places in 172 ms of which 0 ms to minimize.
[2023-03-18 19:21:03] [INFO ] Deduced a trap composed of 12 places in 109 ms of which 0 ms to minimize.
[2023-03-18 19:21:03] [INFO ] Deduced a trap composed of 11 places in 137 ms of which 1 ms to minimize.
[2023-03-18 19:21:03] [INFO ] Deduced a trap composed of 19 places in 127 ms of which 0 ms to minimize.
[2023-03-18 19:21:03] [INFO ] Deduced a trap composed of 7 places in 100 ms of which 1 ms to minimize.
[2023-03-18 19:21:04] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 1 ms to minimize.
[2023-03-18 19:21:04] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 0 ms to minimize.
[2023-03-18 19:21:04] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 0 ms to minimize.
[2023-03-18 19:21:04] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 1 ms to minimize.
[2023-03-18 19:21:04] [INFO ] Deduced a trap composed of 17 places in 89 ms of which 1 ms to minimize.
[2023-03-18 19:21:04] [INFO ] Deduced a trap composed of 11 places in 94 ms of which 0 ms to minimize.
[2023-03-18 19:21:05] [INFO ] Deduced a trap composed of 16 places in 218 ms of which 1 ms to minimize.
[2023-03-18 19:21:05] [INFO ] Deduced a trap composed of 15 places in 181 ms of which 0 ms to minimize.
[2023-03-18 19:21:05] [INFO ] Deduced a trap composed of 11 places in 186 ms of which 1 ms to minimize.
[2023-03-18 19:21:06] [INFO ] Deduced a trap composed of 12 places in 182 ms of which 0 ms to minimize.
[2023-03-18 19:21:06] [INFO ] Deduced a trap composed of 15 places in 137 ms of which 0 ms to minimize.
[2023-03-18 19:21:06] [INFO ] Deduced a trap composed of 12 places in 179 ms of which 1 ms to minimize.
[2023-03-18 19:21:06] [INFO ] Deduced a trap composed of 7 places in 186 ms of which 1 ms to minimize.
[2023-03-18 19:21:06] [INFO ] Deduced a trap composed of 10 places in 168 ms of which 0 ms to minimize.
[2023-03-18 19:21:07] [INFO ] Deduced a trap composed of 7 places in 165 ms of which 0 ms to minimize.
[2023-03-18 19:21:07] [INFO ] Deduced a trap composed of 7 places in 148 ms of which 0 ms to minimize.
[2023-03-18 19:21:07] [INFO ] Deduced a trap composed of 11 places in 145 ms of which 0 ms to minimize.
[2023-03-18 19:21:07] [INFO ] Deduced a trap composed of 11 places in 130 ms of which 0 ms to minimize.
[2023-03-18 19:21:07] [INFO ] Deduced a trap composed of 17 places in 173 ms of which 0 ms to minimize.
[2023-03-18 19:21:08] [INFO ] Deduced a trap composed of 16 places in 178 ms of which 1 ms to minimize.
[2023-03-18 19:21:08] [INFO ] Deduced a trap composed of 13 places in 144 ms of which 0 ms to minimize.
[2023-03-18 19:21:08] [INFO ] Deduced a trap composed of 12 places in 174 ms of which 0 ms to minimize.
[2023-03-18 19:21:08] [INFO ] Deduced a trap composed of 7 places in 136 ms of which 1 ms to minimize.
[2023-03-18 19:21:08] [INFO ] Deduced a trap composed of 15 places in 177 ms of which 1 ms to minimize.
[2023-03-18 19:21:09] [INFO ] Deduced a trap composed of 7 places in 141 ms of which 1 ms to minimize.
[2023-03-18 19:21:09] [INFO ] Deduced a trap composed of 24 places in 134 ms of which 1 ms to minimize.
[2023-03-18 19:21:09] [INFO ] Deduced a trap composed of 24 places in 137 ms of which 0 ms to minimize.
[2023-03-18 19:21:09] [INFO ] Deduced a trap composed of 19 places in 127 ms of which 1 ms to minimize.
[2023-03-18 19:21:09] [INFO ] Deduced a trap composed of 19 places in 129 ms of which 1 ms to minimize.
[2023-03-18 19:21:10] [INFO ] Deduced a trap composed of 28 places in 128 ms of which 1 ms to minimize.
[2023-03-18 19:21:10] [INFO ] Deduced a trap composed of 31 places in 116 ms of which 1 ms to minimize.
[2023-03-18 19:21:10] [INFO ] Deduced a trap composed of 27 places in 113 ms of which 1 ms to minimize.
[2023-03-18 19:21:10] [INFO ] Deduced a trap composed of 33 places in 146 ms of which 0 ms to minimize.
[2023-03-18 19:21:10] [INFO ] Deduced a trap composed of 32 places in 121 ms of which 1 ms to minimize.
[2023-03-18 19:21:10] [INFO ] Deduced a trap composed of 28 places in 109 ms of which 1 ms to minimize.
[2023-03-18 19:21:11] [INFO ] Deduced a trap composed of 27 places in 120 ms of which 0 ms to minimize.
[2023-03-18 19:21:11] [INFO ] Deduced a trap composed of 31 places in 124 ms of which 1 ms to minimize.
[2023-03-18 19:21:11] [INFO ] Deduced a trap composed of 27 places in 150 ms of which 0 ms to minimize.
[2023-03-18 19:21:11] [INFO ] Deduced a trap composed of 22 places in 164 ms of which 1 ms to minimize.
[2023-03-18 19:21:11] [INFO ] Deduced a trap composed of 23 places in 126 ms of which 1 ms to minimize.
[2023-03-18 19:21:11] [INFO ] Deduced a trap composed of 17 places in 148 ms of which 0 ms to minimize.
[2023-03-18 19:21:12] [INFO ] Deduced a trap composed of 19 places in 128 ms of which 0 ms to minimize.
[2023-03-18 19:21:12] [INFO ] Deduced a trap composed of 17 places in 130 ms of which 0 ms to minimize.
[2023-03-18 19:21:12] [INFO ] Deduced a trap composed of 19 places in 132 ms of which 0 ms to minimize.
[2023-03-18 19:21:12] [INFO ] Deduced a trap composed of 27 places in 131 ms of which 0 ms to minimize.
[2023-03-18 19:21:12] [INFO ] Deduced a trap composed of 27 places in 148 ms of which 0 ms to minimize.
[2023-03-18 19:21:13] [INFO ] Deduced a trap composed of 21 places in 161 ms of which 0 ms to minimize.
[2023-03-18 19:21:13] [INFO ] Deduced a trap composed of 28 places in 165 ms of which 0 ms to minimize.
[2023-03-18 19:21:13] [INFO ] Deduced a trap composed of 27 places in 128 ms of which 0 ms to minimize.
[2023-03-18 19:21:13] [INFO ] Deduced a trap composed of 28 places in 141 ms of which 0 ms to minimize.
[2023-03-18 19:21:13] [INFO ] Deduced a trap composed of 28 places in 149 ms of which 1 ms to minimize.
[2023-03-18 19:21:13] [INFO ] Deduced a trap composed of 28 places in 128 ms of which 1 ms to minimize.
[2023-03-18 19:21:14] [INFO ] Deduced a trap composed of 28 places in 130 ms of which 0 ms to minimize.
[2023-03-18 19:21:14] [INFO ] Deduced a trap composed of 28 places in 124 ms of which 0 ms to minimize.
[2023-03-18 19:21:14] [INFO ] Deduced a trap composed of 24 places in 155 ms of which 0 ms to minimize.
[2023-03-18 19:21:14] [INFO ] Deduced a trap composed of 7 places in 137 ms of which 1 ms to minimize.
[2023-03-18 19:21:14] [INFO ] Deduced a trap composed of 20 places in 158 ms of which 1 ms to minimize.
[2023-03-18 19:21:15] [INFO ] Deduced a trap composed of 23 places in 117 ms of which 1 ms to minimize.
[2023-03-18 19:21:15] [INFO ] Deduced a trap composed of 21 places in 114 ms of which 0 ms to minimize.
[2023-03-18 19:21:15] [INFO ] Deduced a trap composed of 24 places in 166 ms of which 1 ms to minimize.
[2023-03-18 19:21:15] [INFO ] Deduced a trap composed of 20 places in 155 ms of which 1 ms to minimize.
[2023-03-18 19:21:15] [INFO ] Deduced a trap composed of 23 places in 159 ms of which 0 ms to minimize.
[2023-03-18 19:21:16] [INFO ] Deduced a trap composed of 28 places in 156 ms of which 0 ms to minimize.
[2023-03-18 19:21:16] [INFO ] Deduced a trap composed of 33 places in 156 ms of which 0 ms to minimize.
[2023-03-18 19:21:16] [INFO ] Deduced a trap composed of 33 places in 154 ms of which 1 ms to minimize.
[2023-03-18 19:21:16] [INFO ] Deduced a trap composed of 32 places in 134 ms of which 0 ms to minimize.
[2023-03-18 19:21:16] [INFO ] Deduced a trap composed of 31 places in 128 ms of which 0 ms to minimize.
[2023-03-18 19:21:16] [INFO ] Deduced a trap composed of 29 places in 130 ms of which 1 ms to minimize.
[2023-03-18 19:21:17] [INFO ] Deduced a trap composed of 31 places in 160 ms of which 1 ms to minimize.
[2023-03-18 19:21:17] [INFO ] Deduced a trap composed of 29 places in 162 ms of which 1 ms to minimize.
[2023-03-18 19:21:17] [INFO ] Deduced a trap composed of 33 places in 142 ms of which 1 ms to minimize.
[2023-03-18 19:21:17] [INFO ] Deduced a trap composed of 34 places in 173 ms of which 0 ms to minimize.
[2023-03-18 19:21:18] [INFO ] Deduced a trap composed of 31 places in 183 ms of which 1 ms to minimize.
[2023-03-18 19:21:18] [INFO ] Deduced a trap composed of 11 places in 204 ms of which 1 ms to minimize.
[2023-03-18 19:21:18] [INFO ] Deduced a trap composed of 7 places in 190 ms of which 0 ms to minimize.
[2023-03-18 19:21:18] [INFO ] Deduced a trap composed of 16 places in 170 ms of which 0 ms to minimize.
[2023-03-18 19:21:19] [INFO ] Deduced a trap composed of 19 places in 209 ms of which 0 ms to minimize.
[2023-03-18 19:21:19] [INFO ] Deduced a trap composed of 19 places in 168 ms of which 0 ms to minimize.
[2023-03-18 19:21:19] [INFO ] Deduced a trap composed of 15 places in 196 ms of which 1 ms to minimize.
[2023-03-18 19:21:19] [INFO ] Deduced a trap composed of 19 places in 169 ms of which 1 ms to minimize.
[2023-03-18 19:21:20] [INFO ] Deduced a trap composed of 15 places in 185 ms of which 1 ms to minimize.
[2023-03-18 19:21:20] [INFO ] Deduced a trap composed of 19 places in 192 ms of which 0 ms to minimize.
[2023-03-18 19:21:20] [INFO ] Deduced a trap composed of 11 places in 192 ms of which 1 ms to minimize.
[2023-03-18 19:21:20] [INFO ] Deduced a trap composed of 23 places in 171 ms of which 1 ms to minimize.
[2023-03-18 19:21:21] [INFO ] Deduced a trap composed of 15 places in 172 ms of which 0 ms to minimize.
[2023-03-18 19:21:21] [INFO ] Deduced a trap composed of 15 places in 172 ms of which 0 ms to minimize.
[2023-03-18 19:21:21] [INFO ] Deduced a trap composed of 19 places in 167 ms of which 0 ms to minimize.
[2023-03-18 19:21:21] [INFO ] Deduced a trap composed of 19 places in 194 ms of which 0 ms to minimize.
[2023-03-18 19:21:21] [INFO ] Deduced a trap composed of 19 places in 190 ms of which 1 ms to minimize.
[2023-03-18 19:21:22] [INFO ] Deduced a trap composed of 12 places in 177 ms of which 1 ms to minimize.
[2023-03-18 19:21:22] [INFO ] Deduced a trap composed of 15 places in 166 ms of which 0 ms to minimize.
[2023-03-18 19:21:22] [INFO ] Deduced a trap composed of 7 places in 183 ms of which 1 ms to minimize.
[2023-03-18 19:21:22] [INFO ] Deduced a trap composed of 11 places in 165 ms of which 1 ms to minimize.
[2023-03-18 19:21:23] [INFO ] Deduced a trap composed of 11 places in 181 ms of which 0 ms to minimize.
[2023-03-18 19:21:23] [INFO ] Deduced a trap composed of 11 places in 190 ms of which 0 ms to minimize.
[2023-03-18 19:21:23] [INFO ] Deduced a trap composed of 16 places in 175 ms of which 1 ms to minimize.
[2023-03-18 19:21:23] [INFO ] Deduced a trap composed of 16 places in 162 ms of which 1 ms to minimize.
[2023-03-18 19:21:23] [INFO ] Deduced a trap composed of 15 places in 167 ms of which 1 ms to minimize.
[2023-03-18 19:21:24] [INFO ] Deduced a trap composed of 15 places in 166 ms of which 0 ms to minimize.
[2023-03-18 19:21:24] [INFO ] Deduced a trap composed of 7 places in 169 ms of which 0 ms to minimize.
[2023-03-18 19:21:24] [INFO ] Deduced a trap composed of 7 places in 199 ms of which 0 ms to minimize.
[2023-03-18 19:21:24] [INFO ] Deduced a trap composed of 11 places in 162 ms of which 0 ms to minimize.
[2023-03-18 19:21:25] [INFO ] Deduced a trap composed of 15 places in 169 ms of which 0 ms to minimize.
[2023-03-18 19:21:25] [INFO ] Deduced a trap composed of 11 places in 155 ms of which 0 ms to minimize.
[2023-03-18 19:21:25] [INFO ] Deduced a trap composed of 15 places in 149 ms of which 0 ms to minimize.
[2023-03-18 19:21:25] [INFO ] Deduced a trap composed of 16 places in 112 ms of which 0 ms to minimize.
[2023-03-18 19:21:25] [INFO ] Deduced a trap composed of 16 places in 134 ms of which 0 ms to minimize.
[2023-03-18 19:21:26] [INFO ] Deduced a trap composed of 15 places in 151 ms of which 0 ms to minimize.
[2023-03-18 19:21:26] [INFO ] Deduced a trap composed of 15 places in 150 ms of which 1 ms to minimize.
[2023-03-18 19:21:26] [INFO ] Deduced a trap composed of 19 places in 150 ms of which 0 ms to minimize.
[2023-03-18 19:21:26] [INFO ] Deduced a trap composed of 19 places in 152 ms of which 0 ms to minimize.
[2023-03-18 19:21:26] [INFO ] Deduced a trap composed of 15 places in 145 ms of which 0 ms to minimize.
[2023-03-18 19:21:27] [INFO ] Deduced a trap composed of 15 places in 152 ms of which 1 ms to minimize.
[2023-03-18 19:21:27] [INFO ] Deduced a trap composed of 19 places in 145 ms of which 1 ms to minimize.
[2023-03-18 19:21:27] [INFO ] Deduced a trap composed of 20 places in 149 ms of which 0 ms to minimize.
[2023-03-18 19:21:27] [INFO ] Deduced a trap composed of 19 places in 143 ms of which 1 ms to minimize.
[2023-03-18 19:21:27] [INFO ] Deduced a trap composed of 23 places in 150 ms of which 1 ms to minimize.
[2023-03-18 19:21:28] [INFO ] Deduced a trap composed of 23 places in 148 ms of which 1 ms to minimize.
[2023-03-18 19:21:28] [INFO ] Deduced a trap composed of 19 places in 162 ms of which 1 ms to minimize.
[2023-03-18 19:21:28] [INFO ] Deduced a trap composed of 19 places in 141 ms of which 0 ms to minimize.
[2023-03-18 19:21:28] [INFO ] Deduced a trap composed of 12 places in 116 ms of which 0 ms to minimize.
[2023-03-18 19:21:28] [INFO ] Deduced a trap composed of 11 places in 126 ms of which 0 ms to minimize.
[2023-03-18 19:21:29] [INFO ] Deduced a trap composed of 7 places in 123 ms of which 0 ms to minimize.
[2023-03-18 19:21:29] [INFO ] Deduced a trap composed of 16 places in 141 ms of which 0 ms to minimize.
[2023-03-18 19:21:29] [INFO ] Deduced a trap composed of 15 places in 144 ms of which 0 ms to minimize.
[2023-03-18 19:21:29] [INFO ] Deduced a trap composed of 20 places in 149 ms of which 0 ms to minimize.
[2023-03-18 19:21:29] [INFO ] Deduced a trap composed of 19 places in 137 ms of which 1 ms to minimize.
[2023-03-18 19:21:29] [INFO ] Deduced a trap composed of 17 places in 114 ms of which 0 ms to minimize.
[2023-03-18 19:21:30] [INFO ] Deduced a trap composed of 31 places in 117 ms of which 1 ms to minimize.
[2023-03-18 19:21:30] [INFO ] Deduced a trap composed of 31 places in 141 ms of which 1 ms to minimize.
[2023-03-18 19:21:30] [INFO ] Deduced a trap composed of 17 places in 150 ms of which 0 ms to minimize.
[2023-03-18 19:21:30] [INFO ] Deduced a trap composed of 31 places in 149 ms of which 0 ms to minimize.
[2023-03-18 19:21:30] [INFO ] Deduced a trap composed of 31 places in 139 ms of which 0 ms to minimize.
[2023-03-18 19:21:31] [INFO ] Deduced a trap composed of 21 places in 144 ms of which 0 ms to minimize.
[2023-03-18 19:21:31] [INFO ] Deduced a trap composed of 35 places in 161 ms of which 1 ms to minimize.
[2023-03-18 19:21:31] [INFO ] Deduced a trap composed of 35 places in 146 ms of which 0 ms to minimize.
[2023-03-18 19:21:31] [INFO ] Deduced a trap composed of 21 places in 142 ms of which 0 ms to minimize.
[2023-03-18 19:21:31] [INFO ] Deduced a trap composed of 35 places in 138 ms of which 0 ms to minimize.
[2023-03-18 19:21:32] [INFO ] Deduced a trap composed of 35 places in 155 ms of which 1 ms to minimize.
[2023-03-18 19:21:32] [INFO ] Deduced a trap composed of 30 places in 135 ms of which 1 ms to minimize.
[2023-03-18 19:21:32] [INFO ] Deduced a trap composed of 44 places in 142 ms of which 0 ms to minimize.
[2023-03-18 19:21:32] [INFO ] Deduced a trap composed of 39 places in 121 ms of which 0 ms to minimize.
[2023-03-18 19:21:32] [INFO ] Deduced a trap composed of 25 places in 155 ms of which 1 ms to minimize.
[2023-03-18 19:21:33] [INFO ] Deduced a trap composed of 39 places in 154 ms of which 1 ms to minimize.
[2023-03-18 19:21:33] [INFO ] Deduced a trap composed of 39 places in 139 ms of which 0 ms to minimize.
[2023-03-18 19:21:33] [INFO ] Deduced a trap composed of 15 places in 150 ms of which 1 ms to minimize.
[2023-03-18 19:21:33] [INFO ] Deduced a trap composed of 31 places in 140 ms of which 1 ms to minimize.
[2023-03-18 19:21:33] [INFO ] Deduced a trap composed of 31 places in 136 ms of which 0 ms to minimize.
[2023-03-18 19:21:34] [INFO ] Deduced a trap composed of 23 places in 147 ms of which 0 ms to minimize.
[2023-03-18 19:21:34] [INFO ] Deduced a trap composed of 27 places in 142 ms of which 0 ms to minimize.
[2023-03-18 19:21:34] [INFO ] Deduced a trap composed of 27 places in 143 ms of which 1 ms to minimize.
[2023-03-18 19:21:34] [INFO ] Deduced a trap composed of 27 places in 152 ms of which 0 ms to minimize.
[2023-03-18 19:21:34] [INFO ] Deduced a trap composed of 27 places in 157 ms of which 1 ms to minimize.
[2023-03-18 19:21:35] [INFO ] Deduced a trap composed of 27 places in 153 ms of which 0 ms to minimize.
[2023-03-18 19:21:35] [INFO ] Deduced a trap composed of 39 places in 142 ms of which 0 ms to minimize.
[2023-03-18 19:21:35] [INFO ] Deduced a trap composed of 39 places in 151 ms of which 1 ms to minimize.
[2023-03-18 19:21:35] [INFO ] Deduced a trap composed of 43 places in 155 ms of which 0 ms to minimize.
[2023-03-18 19:21:35] [INFO ] Deduced a trap composed of 43 places in 147 ms of which 0 ms to minimize.
[2023-03-18 19:21:36] [INFO ] Deduced a trap composed of 43 places in 143 ms of which 0 ms to minimize.
[2023-03-18 19:21:36] [INFO ] Deduced a trap composed of 39 places in 147 ms of which 1 ms to minimize.
[2023-03-18 19:21:36] [INFO ] Deduced a trap composed of 43 places in 142 ms of which 0 ms to minimize.
[2023-03-18 19:21:36] [INFO ] Deduced a trap composed of 39 places in 150 ms of which 1 ms to minimize.
[2023-03-18 19:21:36] [INFO ] Deduced a trap composed of 43 places in 136 ms of which 1 ms to minimize.
[2023-03-18 19:21:37] [INFO ] Deduced a trap composed of 43 places in 145 ms of which 1 ms to minimize.
[2023-03-18 19:21:37] [INFO ] Deduced a trap composed of 35 places in 144 ms of which 0 ms to minimize.
[2023-03-18 19:21:37] [INFO ] Deduced a trap composed of 35 places in 142 ms of which 0 ms to minimize.
[2023-03-18 19:21:37] [INFO ] Deduced a trap composed of 35 places in 142 ms of which 0 ms to minimize.
[2023-03-18 19:21:37] [INFO ] Deduced a trap composed of 35 places in 136 ms of which 0 ms to minimize.
[2023-03-18 19:21:38] [INFO ] Deduced a trap composed of 35 places in 139 ms of which 0 ms to minimize.
[2023-03-18 19:21:38] [INFO ] Deduced a trap composed of 35 places in 151 ms of which 0 ms to minimize.
[2023-03-18 19:21:38] [INFO ] Deduced a trap composed of 35 places in 144 ms of which 0 ms to minimize.
[2023-03-18 19:21:38] [INFO ] Deduced a trap composed of 35 places in 145 ms of which 1 ms to minimize.
[2023-03-18 19:21:38] [INFO ] Deduced a trap composed of 35 places in 124 ms of which 1 ms to minimize.
[2023-03-18 19:21:39] [INFO ] Deduced a trap composed of 35 places in 121 ms of which 1 ms to minimize.
[2023-03-18 19:21:39] [INFO ] Deduced a trap composed of 35 places in 122 ms of which 0 ms to minimize.
[2023-03-18 19:21:39] [INFO ] Trap strengthening procedure interrupted after too many repetitions 89585 ms
[2023-03-18 19:21:39] [INFO ] Trap strengthening (SAT) tested/added 441/440 trap constraints in 89586 ms
[2023-03-18 19:21:39] [INFO ] Deduced a trap composed of 35 places in 155 ms of which 0 ms to minimize.
[2023-03-18 19:21:39] [INFO ] Deduced a trap composed of 7 places in 142 ms of which 0 ms to minimize.
[2023-03-18 19:21:40] [INFO ] Deduced a trap composed of 35 places in 122 ms of which 0 ms to minimize.
[2023-03-18 19:21:40] [INFO ] Deduced a trap composed of 43 places in 143 ms of which 0 ms to minimize.
[2023-03-18 19:21:40] [INFO ] Deduced a trap composed of 24 places in 140 ms of which 0 ms to minimize.
[2023-03-18 19:21:40] [INFO ] Deduced a trap composed of 59 places in 132 ms of which 1 ms to minimize.
[2023-03-18 19:21:40] [INFO ] Deduced a trap composed of 43 places in 134 ms of which 1 ms to minimize.
[2023-03-18 19:21:40] [INFO ] Deduced a trap composed of 24 places in 135 ms of which 1 ms to minimize.
[2023-03-18 19:21:41] [INFO ] Deduced a trap composed of 59 places in 140 ms of which 1 ms to minimize.
[2023-03-18 19:21:41] [INFO ] Deduced a trap composed of 24 places in 123 ms of which 0 ms to minimize.
[2023-03-18 19:21:41] [INFO ] Deduced a trap composed of 59 places in 140 ms of which 1 ms to minimize.
[2023-03-18 19:21:41] [INFO ] Deduced a trap composed of 59 places in 142 ms of which 0 ms to minimize.
[2023-03-18 19:21:41] [INFO ] Deduced a trap composed of 28 places in 132 ms of which 0 ms to minimize.
[2023-03-18 19:21:42] [INFO ] Deduced a trap composed of 32 places in 138 ms of which 1 ms to minimize.
[2023-03-18 19:21:42] [INFO ] Deduced a trap composed of 37 places in 142 ms of which 0 ms to minimize.
[2023-03-18 19:21:42] [INFO ] Deduced a trap composed of 37 places in 142 ms of which 0 ms to minimize.
[2023-03-18 19:21:42] [INFO ] Deduced a trap composed of 36 places in 136 ms of which 0 ms to minimize.
[2023-03-18 19:21:42] [INFO ] Deduced a trap composed of 36 places in 136 ms of which 0 ms to minimize.
[2023-03-18 19:21:43] [INFO ] Deduced a trap composed of 63 places in 141 ms of which 0 ms to minimize.
[2023-03-18 19:21:43] [INFO ] Deduced a trap composed of 67 places in 128 ms of which 1 ms to minimize.
[2023-03-18 19:21:43] [INFO ] Deduced a trap composed of 71 places in 134 ms of which 0 ms to minimize.
[2023-03-18 19:21:43] [INFO ] Deduced a trap composed of 71 places in 151 ms of which 1 ms to minimize.
[2023-03-18 19:21:43] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 4444 ms
[2023-03-18 19:21:43] [INFO ] After 95108ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 1028 ms.
[2023-03-18 19:21:44] [INFO ] After 96289ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1 (NOT p3)), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (NOT (AND p0 (NOT p1) p3))), (X (OR (NOT p3) p2)), (X (NOT p2)), (X (NOT (AND p3 (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p3)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT (AND p0 (NOT p1) p3)))), (X (X (OR (NOT p3) p2))), (X (X (NOT p2))), (X (X (NOT (AND p3 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p3)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) (NOT p3)))))]
False Knowledge obtained : [(F (AND p3 (NOT p2))), (F (AND p0 (NOT p1) (NOT p3))), (F (NOT (OR (NOT p3) p2))), (F p2), (F (NOT p1)), (F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p1) (NOT p3)))]
Knowledge based reduction with 17 factoid took 1388 ms. Reduced automaton from 4 states, 10 edges and 4 AP (stutter insensitive) to 4 states, 10 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 234 ms :[(AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1) p3), (AND (NOT p1) (NOT p0) p3)]
Stuttering acceptance computed with spot in 199 ms :[(AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1) p3), (AND (NOT p1) (NOT p0) p3)]
Stuttering acceptance computed with spot in 216 ms :[(AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1) p3), (AND (NOT p1) (NOT p0) p3)]
Product exploration explored 100000 steps with 162 reset in 609 ms.
Product exploration explored 100000 steps with 158 reset in 652 ms.
Built C files in :
/tmp/ltsmin6245933632204298411
[2023-03-18 19:21:48] [INFO ] Computing symmetric may disable matrix : 951 transitions.
[2023-03-18 19:21:48] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 19:21:48] [INFO ] Computing symmetric may enable matrix : 951 transitions.
[2023-03-18 19:21:48] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 19:21:48] [INFO ] Computing Do-Not-Accords matrix : 951 transitions.
[2023-03-18 19:21:48] [INFO ] Computation of Completed DNA matrix. took 32 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 19:21:48] [INFO ] Built C files in 259ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6245933632204298411
Running compilation step : cd /tmp/ltsmin6245933632204298411;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2750 ms.
Running link step : cd /tmp/ltsmin6245933632204298411;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 101 ms.
Running LTSmin : cd /tmp/ltsmin6245933632204298411;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased2307240286295242995.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 702 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 702/702 places, 951/951 transitions.
Applied a total of 0 rules in 15 ms. Remains 702 /702 variables (removed 0) and now considering 951/951 (removed 0) transitions.
// Phase 1: matrix 951 rows 702 cols
[2023-03-18 19:22:03] [INFO ] Computed 201 place invariants in 3 ms
[2023-03-18 19:22:03] [INFO ] Implicit Places using invariants in 247 ms returned []
[2023-03-18 19:22:03] [INFO ] Invariant cache hit.
[2023-03-18 19:22:04] [INFO ] Implicit Places using invariants and state equation in 663 ms returned []
Implicit Place search using SMT with State Equation took 924 ms to find 0 implicit places.
[2023-03-18 19:22:04] [INFO ] Redundant transitions in 180 ms returned []
[2023-03-18 19:22:04] [INFO ] Invariant cache hit.
[2023-03-18 19:22:04] [INFO ] Dead Transitions using invariants and state equation in 349 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1498 ms. Remains : 702/702 places, 951/951 transitions.
Built C files in :
/tmp/ltsmin555237516070813
[2023-03-18 19:22:04] [INFO ] Computing symmetric may disable matrix : 951 transitions.
[2023-03-18 19:22:04] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 19:22:04] [INFO ] Computing symmetric may enable matrix : 951 transitions.
[2023-03-18 19:22:04] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 19:22:05] [INFO ] Computing Do-Not-Accords matrix : 951 transitions.
[2023-03-18 19:22:05] [INFO ] Computation of Completed DNA matrix. took 16 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 19:22:05] [INFO ] Built C files in 150ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin555237516070813
Running compilation step : cd /tmp/ltsmin555237516070813;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2278 ms.
Running link step : cd /tmp/ltsmin555237516070813;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin555237516070813;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased5137009609168923338.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-18 19:22:20] [INFO ] Flatten gal took : 51 ms
[2023-03-18 19:22:20] [INFO ] Flatten gal took : 42 ms
[2023-03-18 19:22:20] [INFO ] Time to serialize gal into /tmp/LTL12433978148858760372.gal : 29 ms
[2023-03-18 19:22:20] [INFO ] Time to serialize properties into /tmp/LTL118674136642594573.prop : 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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12433978148858760372.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13446176215543004600.hoa' '-atoms' '/tmp/LTL118674136642594573.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL118674136642594573.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13446176215543004600.hoa
Detected timeout of ITS tools.
[2023-03-18 19:22:35] [INFO ] Flatten gal took : 41 ms
[2023-03-18 19:22:35] [INFO ] Flatten gal took : 39 ms
[2023-03-18 19:22:35] [INFO ] Time to serialize gal into /tmp/LTL12095431518996736023.gal : 19 ms
[2023-03-18 19:22:35] [INFO ] Time to serialize properties into /tmp/LTL13192134991901736688.ltl : 3 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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12095431518996736023.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13192134991901736688.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((((!("((p414==1)&&(p419==1))"))||(F("(p439==0)")))U((G((!("((p414==1)&&(p419==1))"))||(F("(p439==0)"))))||(("((p414==1)&&(p419==1))"...263
Formula 0 simplified : (!"((p414==1)&&(p419==1))" | XF"(((p500==1)&&(p506==1))&&(p513==1))") U ("((p414==1)&&(p419==1))" & G!"(p439==0)")
Detected timeout of ITS tools.
[2023-03-18 19:22:50] [INFO ] Flatten gal took : 70 ms
[2023-03-18 19:22:50] [INFO ] Applying decomposition
[2023-03-18 19:22:50] [INFO ] Flatten gal took : 52 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph1992634934605530833.txt' '-o' '/tmp/graph1992634934605530833.bin' '-w' '/tmp/graph1992634934605530833.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph1992634934605530833.bin' '-l' '-1' '-v' '-w' '/tmp/graph1992634934605530833.weights' '-q' '0' '-e' '0.001'
[2023-03-18 19:22:50] [INFO ] Decomposing Gal with order
[2023-03-18 19:22:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 19:22:50] [INFO ] Removed a total of 1045 redundant transitions.
[2023-03-18 19:22:51] [INFO ] Flatten gal took : 152 ms
[2023-03-18 19:22:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 868 labels/synchronizations in 103 ms.
[2023-03-18 19:22:51] [INFO ] Time to serialize gal into /tmp/LTL13112440758314419266.gal : 10 ms
[2023-03-18 19:22:51] [INFO ] Time to serialize properties into /tmp/LTL13400109017438795714.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13112440758314419266.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13400109017438795714.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((((!("((i9.u118.p414==1)&&(i9.u120.p419==1))"))||(F("(i9.u125.p439==0)")))U((G((!("((i9.u118.p414==1)&&(i9.u120.p419==1))"))||(F("(i...378
Formula 0 simplified : (!"((i9.u118.p414==1)&&(i9.u120.p419==1))" | XF"(((i11.u143.p500==1)&&(i11.u144.p506==1))&&(i11.u147.p513==1))") U ("((i9.u118.p414=...204
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8081330536259941855
[2023-03-18 19:23:06] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8081330536259941855
Running compilation step : cd /tmp/ltsmin8081330536259941855;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1625 ms.
Running link step : cd /tmp/ltsmin8081330536259941855;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 25 ms.
Running LTSmin : cd /tmp/ltsmin8081330536259941855;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '((!(LTLAPp0==true)||<>((LTLAPp1==true))) U ([]((!(LTLAPp0==true)||<>((LTLAPp1==true))))||(X([](!(LTLAPp3==true)))&&(!(LTLAPp0==true)||<>((LTLAPp1==true)))&&(LTLAPp2==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldRVs-PT-050A-LTLFireability-13 finished in 281159 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0 U X(G(p1)))&&F(p2))))'
Support contains 12 out of 703 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 703/703 places, 953/953 transitions.
Applied a total of 0 rules in 18 ms. Remains 703 /703 variables (removed 0) and now considering 953/953 (removed 0) transitions.
// Phase 1: matrix 953 rows 703 cols
[2023-03-18 19:23:21] [INFO ] Computed 201 place invariants in 4 ms
[2023-03-18 19:23:21] [INFO ] Implicit Places using invariants in 380 ms returned []
[2023-03-18 19:23:21] [INFO ] Invariant cache hit.
[2023-03-18 19:23:22] [INFO ] Implicit Places using invariants and state equation in 712 ms returned []
Implicit Place search using SMT with State Equation took 1095 ms to find 0 implicit places.
[2023-03-18 19:23:22] [INFO ] Invariant cache hit.
[2023-03-18 19:23:22] [INFO ] Dead Transitions using invariants and state equation in 429 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1543 ms. Remains : 703/703 places, 953/953 transitions.
Stuttering acceptance computed with spot in 219 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (NOT p1), true]
Running random walk in product with property : ShieldRVs-PT-050A-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(NOT p2), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 2}, { cond=(AND p0 p1), acceptance={} source=4 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(AND (EQ s423 1) (EQ s438 1) (EQ s449 1) (EQ s383 1) (EQ s385 1) (EQ s390 1)), p2:(AND (EQ s202 1) (EQ s203 1) (EQ s207 1)), p1:(AND (EQ s454 1) (EQ s4...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 659 steps with 0 reset in 7 ms.
FORMULA ShieldRVs-PT-050A-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-050A-LTLFireability-14 finished in 1798 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((!p0 U (p1||G(!p0)))&&X((!p2 U (G(!p2)||(!p2&&(X(p3)||F(!p4)))))))))'
Support contains 11 out of 703 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 703/703 places, 953/953 transitions.
Applied a total of 0 rules in 13 ms. Remains 703 /703 variables (removed 0) and now considering 953/953 (removed 0) transitions.
[2023-03-18 19:23:23] [INFO ] Invariant cache hit.
[2023-03-18 19:23:23] [INFO ] Implicit Places using invariants in 367 ms returned []
[2023-03-18 19:23:23] [INFO ] Invariant cache hit.
[2023-03-18 19:23:24] [INFO ] Implicit Places using invariants and state equation in 888 ms returned []
Implicit Place search using SMT with State Equation took 1258 ms to find 0 implicit places.
[2023-03-18 19:23:24] [INFO ] Invariant cache hit.
[2023-03-18 19:23:24] [INFO ] Dead Transitions using invariants and state equation in 444 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1717 ms. Remains : 703/703 places, 953/953 transitions.
Stuttering acceptance computed with spot in 261 ms :[(OR p2 (AND p0 (NOT p1))), (OR p2 (AND p0 (NOT p1))), true, (AND (NOT p1) p0), p2, (AND p4 p2 (NOT p3)), p4]
Running random walk in product with property : ShieldRVs-PT-050A-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(OR p1 (NOT p0)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 3}], [{ cond=p2, acceptance={} source=4 dest: 2}, { cond=(AND p4 (NOT p2)), acceptance={} source=4 dest: 5}], [{ cond=(AND p4 (NOT p2) (NOT p3)), acceptance={} source=5 dest: 5}, { cond=(AND p4 p2 (NOT p3)), acceptance={} source=5 dest: 6}], [{ cond=p4, acceptance={0} source=6 dest: 6}]], initial=0, aps=[p1:(AND (NOT (AND (EQ s652 1) (EQ s657 1))) (NOT (AND (EQ s106 1) (EQ s111 1)))), p0:(AND (EQ s106 1) (EQ s111 1)), p2:(EQ s109 1), p4:(AND (EQ s684 1) (E...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 1970 ms.
Product exploration explored 100000 steps with 33333 reset in 1729 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 (NOT p0) (NOT p2) (NOT p4) (NOT p3)), (X (OR p1 (NOT p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT p2))), true, (X (X (NOT (AND p4 (NOT p2))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT (AND p4 (NOT p2)))))
Knowledge based reduction with 9 factoid took 230 ms. Reduced automaton from 7 states, 12 edges and 5 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldRVs-PT-050A-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVs-PT-050A-LTLFireability-15 finished in 5949 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((!p0||F(p1)) U (G((!p0||F(p1)))||((!p0||F(p1))&&X(G(!p3))&&p2))))'
[2023-03-18 19:23:29] [INFO ] Flatten gal took : 74 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin10856831659799833518
[2023-03-18 19:23:29] [INFO ] Computing symmetric may disable matrix : 953 transitions.
[2023-03-18 19:23:29] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 19:23:29] [INFO ] Computing symmetric may enable matrix : 953 transitions.
[2023-03-18 19:23:29] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 19:23:29] [INFO ] Applying decomposition
[2023-03-18 19:23:29] [INFO ] Flatten gal took : 59 ms
[2023-03-18 19:23:29] [INFO ] Computing Do-Not-Accords matrix : 953 transitions.
[2023-03-18 19:23:29] [INFO ] Computation of Completed DNA matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 19:23:29] [INFO ] Built C files in 198ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10856831659799833518
Running compilation step : cd /tmp/ltsmin10856831659799833518;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph5884285571454483359.txt' '-o' '/tmp/graph5884285571454483359.bin' '-w' '/tmp/graph5884285571454483359.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph5884285571454483359.bin' '-l' '-1' '-v' '-w' '/tmp/graph5884285571454483359.weights' '-q' '0' '-e' '0.001'
[2023-03-18 19:23:29] [INFO ] Decomposing Gal with order
[2023-03-18 19:23:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 19:23:29] [INFO ] Removed a total of 1047 redundant transitions.
[2023-03-18 19:23:29] [INFO ] Flatten gal took : 107 ms
[2023-03-18 19:23:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 824 labels/synchronizations in 63 ms.
[2023-03-18 19:23:29] [INFO ] Time to serialize gal into /tmp/LTLFireability7513553042473813068.gal : 22 ms
[2023-03-18 19:23:29] [INFO ] Time to serialize properties into /tmp/LTLFireability5769953401117913465.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability7513553042473813068.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability5769953401117913465.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((((!("((i10.u118.p414==1)&&(i10.u120.p419==1))"))||(F("(i10.u125.p439!=1)")))U((G((!("((i10.u118.p414==1)&&(i10.u120.p419==1))"))||(...389
Formula 0 simplified : (!"((i10.u118.p414==1)&&(i10.u120.p419==1))" | XF"(((i12.u143.p500==1)&&(i12.u144.p506==1))&&(i12.u147.p513==1))") U ("((i10.u118.p4...209
Compilation finished in 2665 ms.
Running link step : cd /tmp/ltsmin10856831659799833518;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 56 ms.
Running LTSmin : cd /tmp/ltsmin10856831659799833518;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '((!(LTLAPp0==true)||<>((LTLAPp1==true))) U ([]((!(LTLAPp0==true)||<>((LTLAPp1==true))))||((!(LTLAPp0==true)||<>((LTLAPp1==true)))&&X([](!(LTLAPp3==true)))&&(LTLAPp2==true))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.003: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.013: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.013: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.014: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.014: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.014: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.014: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.013: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.026: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.027: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.027: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.248: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.248: LTL layer: formula: ((!(LTLAPp0==true)||<>((LTLAPp1==true))) U ([]((!(LTLAPp0==true)||<>((LTLAPp1==true))))||((!(LTLAPp0==true)||<>((LTLAPp1==true)))&&X([](!(LTLAPp3==true)))&&(LTLAPp2==true))))
pins2lts-mc-linux64( 2/ 8), 0.248: "((!(LTLAPp0==true)||<>((LTLAPp1==true))) U ([]((!(LTLAPp0==true)||<>((LTLAPp1==true))))||((!(LTLAPp0==true)||<>((LTLAPp1==true)))&&X([](!(LTLAPp3==true)))&&(LTLAPp2==true))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 0.248: Using Spin LTL semantics
pins2lts-mc-linux64( 7/ 8), 0.254: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.274: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.279: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.280: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.287: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.292: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.320: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.359: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.640: DFS-FIFO for weak LTL, using special progress label 958
pins2lts-mc-linux64( 0/ 8), 0.640: There are 959 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.640: State length is 704, there are 964 groups
pins2lts-mc-linux64( 0/ 8), 0.640: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.640: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.640: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.640: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 2/ 8), 1.092: ~1 levels ~960 states ~3792 transitions
pins2lts-mc-linux64( 2/ 8), 1.310: ~1 levels ~1920 states ~8936 transitions
pins2lts-mc-linux64( 2/ 8), 1.829: ~1 levels ~3840 states ~20224 transitions
pins2lts-mc-linux64( 2/ 8), 2.382: ~1 levels ~7680 states ~41376 transitions
pins2lts-mc-linux64( 2/ 8), 3.896: ~1 levels ~15360 states ~91920 transitions
pins2lts-mc-linux64( 7/ 8), 5.737: ~1 levels ~30720 states ~193728 transitions
pins2lts-mc-linux64( 2/ 8), 8.554: ~1 levels ~61440 states ~400632 transitions
pins2lts-mc-linux64( 2/ 8), 10.824: ~1 levels ~122880 states ~838736 transitions
pins2lts-mc-linux64( 2/ 8), 14.960: ~1 levels ~245760 states ~1725008 transitions
pins2lts-mc-linux64( 3/ 8), 22.974: ~1 levels ~491520 states ~3486056 transitions
pins2lts-mc-linux64( 4/ 8), 38.453: ~1 levels ~983040 states ~7295680 transitions
pins2lts-mc-linux64( 3/ 8), 69.464: ~1 levels ~1966080 states ~15219016 transitions
pins2lts-mc-linux64( 3/ 8), 132.136: ~1 levels ~3932160 states ~31570464 transitions
pins2lts-mc-linux64( 3/ 8), 191.751: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 191.944:
pins2lts-mc-linux64( 0/ 8), 191.944: mean standard work distribution: 5.5% (states) 4.7% (transitions)
pins2lts-mc-linux64( 0/ 8), 191.945:
pins2lts-mc-linux64( 0/ 8), 191.945: Explored 5405634 states 46683426 transitions, fanout: 8.636
pins2lts-mc-linux64( 0/ 8), 191.945: Total exploration time 191.260 sec (191.110 sec minimum, 191.199 sec on average)
pins2lts-mc-linux64( 0/ 8), 191.945: States per second: 28263, Transitions per second: 244084
pins2lts-mc-linux64( 0/ 8), 191.945:
pins2lts-mc-linux64( 0/ 8), 191.945: Progress states detected: 10123569
pins2lts-mc-linux64( 0/ 8), 191.945: Redundant explorations: -46.6036
pins2lts-mc-linux64( 0/ 8), 191.945:
pins2lts-mc-linux64( 0/ 8), 191.945: Queue width: 8B, total height: 8304338, memory: 63.36MB
pins2lts-mc-linux64( 0/ 8), 191.945: Tree memory: 333.2MB, 34.5 B/state, compr.: 1.2%
pins2lts-mc-linux64( 0/ 8), 191.945: Tree fill ratio (roots/leafs): 7.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 191.945: Stored 1025 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 191.945: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 191.945: Est. total memory use: 396.6MB (~1087.4MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin10856831659799833518;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '((!(LTLAPp0==true)||<>((LTLAPp1==true))) U ([]((!(LTLAPp0==true)||<>((LTLAPp1==true))))||((!(LTLAPp0==true)||<>((LTLAPp1==true)))&&X([](!(LTLAPp3==true)))&&(LTLAPp2==true))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin10856831659799833518;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '((!(LTLAPp0==true)||<>((LTLAPp1==true))) U ([]((!(LTLAPp0==true)||<>((LTLAPp1==true))))||((!(LTLAPp0==true)||<>((LTLAPp1==true)))&&X([](!(LTLAPp3==true)))&&(LTLAPp2==true))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2023-03-18 19:45:20] [INFO ] Applying decomposition
[2023-03-18 19:45:20] [INFO ] Flatten gal took : 514 ms
[2023-03-18 19:45:21] [INFO ] Decomposing Gal with order
[2023-03-18 19:45:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 19:45:21] [INFO ] Removed a total of 1047 redundant transitions.
[2023-03-18 19:45:21] [INFO ] Flatten gal took : 468 ms
[2023-03-18 19:45:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 600 labels/synchronizations in 104 ms.
[2023-03-18 19:45:22] [INFO ] Time to serialize gal into /tmp/LTLFireability9883170278113084983.gal : 42 ms
[2023-03-18 19:45:22] [INFO ] Time to serialize properties into /tmp/LTLFireability13463055060108020801.ltl : 5 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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability9883170278113084983.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability13463055060108020801.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((((!("((u119.p414==1)&&(u121.p419==1))"))||(F("(u126.p439!=1)")))U((G((!("((u119.p414==1)&&(u121.p419==1))"))||(F("(u126.p439!=1)"))...333
Formula 0 simplified : (!"((u119.p414==1)&&(u121.p419==1))" | XF"(((u144.p500==1)&&(u145.p506==1))&&(u148.p513==1))") U ("((u119.p414==1)&&(u121.p419==1))"...177
Reverse transition relation is NOT exact ! Due to transitions t304, t307, t310, t317, t320, t324, t326, t331, t336, t339, t344, t348, t350, t356, t361, t36...4105
Computing Next relation with stutter on 2.394e+38 deadlock states
Detected timeout of ITS tools.
[2023-03-18 20:07:10] [INFO ] Flatten gal took : 640 ms
[2023-03-18 20:07:12] [INFO ] Input system was already deterministic with 953 transitions.
[2023-03-18 20:07:12] [INFO ] Transformed 703 places.
[2023-03-18 20:07:12] [INFO ] Transformed 953 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
[2023-03-18 20:07:12] [INFO ] Time to serialize gal into /tmp/LTLFireability10976599806436494078.gal : 12 ms
[2023-03-18 20:07:12] [INFO ] Time to serialize properties into /tmp/LTLFireability16819974975720769758.ltl : 3 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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability10976599806436494078.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability16819974975720769758.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.202303021504/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 : !((((!("((p414==1)&&(p419==1))"))||(F("(p439!=1)")))U((G((!("((p414==1)&&(p419==1))"))||(F("(p439!=1)"))))||(("((p414==1)&&(p419==1))"...263
Formula 0 simplified : (!"((p414==1)&&(p419==1))" | XF"(((p500==1)&&(p506==1))&&(p513==1))") U ("((p414==1)&&(p419==1))" & G!"(p439!=1)")
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393356 kB
MemFree: 11753660 kB
After kill :
MemTotal: 16393356 kB
MemFree: 16233248 kB

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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /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="ShieldRVs-PT-050A"
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-5348"
echo " Executing tool itstools"
echo " Input is ShieldRVs-PT-050A, 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 r421-tajo-167905974800148"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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