Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 508K
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.1K Apr 23 07:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 23 07:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.5K Apr 12 20:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 46K Apr 12 20:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Apr 12 20:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 12 20:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 23 07:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 2 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 174K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716653437334

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ParamProductionCell-PT-3
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-25 16:10:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-25 16:10:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 16:10:39] [INFO ] Load time of PNML (sax parser for PT used): 155 ms
[2024-05-25 16:10:39] [INFO ] Transformed 231 places.
[2024-05-25 16:10:39] [INFO ] Transformed 202 transitions.
[2024-05-25 16:10:39] [INFO ] Found NUPN structural information;
[2024-05-25 16:10:39] [INFO ] Parsed PT model containing 231 places and 202 transitions and 846 arcs in 359 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 260 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
FORMULA ParamProductionCell-PT-3-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-3-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-3-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-3-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-3-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-3-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 36 out of 231 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 231/231 places, 202/202 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 226 transition count 197
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 226 transition count 197
Applied a total of 10 rules in 70 ms. Remains 226 /231 variables (removed 5) and now considering 197/202 (removed 5) transitions.
// Phase 1: matrix 197 rows 226 cols
[2024-05-25 16:10:40] [INFO ] Computed 59 invariants in 30 ms
[2024-05-25 16:10:41] [INFO ] Implicit Places using invariants in 882 ms returned [16, 18, 19, 24, 31, 35, 36, 41, 42, 47, 59, 64, 65, 73, 99, 101, 114, 115, 117, 119, 120, 160, 161, 165, 166, 191, 192, 195, 196, 202, 217]
Discarding 31 places :
Implicit Place search using SMT only with invariants took 945 ms to find 31 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 195/231 places, 197/202 transitions.
Applied a total of 0 rules in 15 ms. Remains 195 /195 variables (removed 0) and now considering 197/197 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1078 ms. Remains : 195/231 places, 197/202 transitions.
Support contains 36 out of 195 places after structural reductions.
[2024-05-25 16:10:41] [INFO ] Flatten gal took : 74 ms
[2024-05-25 16:10:41] [INFO ] Flatten gal took : 34 ms
[2024-05-25 16:10:41] [INFO ] Input system was already deterministic with 197 transitions.
RANDOM walk for 15209 steps (2 resets) in 650 ms. (23 steps per ms) remains 0/18 properties
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((p0&&F(p1)))||X((X(!p2) U ((!p1&&X(!p2))||X(G(!p2)))))))'
Support contains 6 out of 195 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 195/195 places, 197/197 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 194 transition count 196
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 194 transition count 196
Applied a total of 2 rules in 15 ms. Remains 194 /195 variables (removed 1) and now considering 196/197 (removed 1) transitions.
// Phase 1: matrix 196 rows 194 cols
[2024-05-25 16:10:42] [INFO ] Computed 28 invariants in 4 ms
[2024-05-25 16:10:42] [INFO ] Implicit Places using invariants in 212 ms returned [15, 64, 65, 84, 139, 171, 175]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 216 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 187/195 places, 196/197 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 185 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 185 transition count 194
Applied a total of 4 rules in 11 ms. Remains 185 /187 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 185 cols
[2024-05-25 16:10:42] [INFO ] Computed 21 invariants in 4 ms
[2024-05-25 16:10:42] [INFO ] Implicit Places using invariants in 147 ms returned []
[2024-05-25 16:10:42] [INFO ] Invariant cache hit.
[2024-05-25 16:10:42] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-25 16:10:42] [INFO ] Implicit Places using invariants and state equation in 376 ms returned []
Implicit Place search using SMT with State Equation took 525 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 185/195 places, 194/197 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 768 ms. Remains : 185/195 places, 194/197 transitions.
Stuttering acceptance computed with spot in 486 ms :[(OR (AND (NOT p0) p2) (AND (NOT p1) p2)), (AND (NOT p1) p2), (OR (AND (NOT p1) p2) (AND (NOT p0) p2)), (OR (AND (NOT p0) p2) (AND (NOT p1) p2)), (AND (NOT p1) p2), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : ParamProductionCell-PT-3-LTLFireability-00
Product exploration explored 100000 steps with 33333 reset in 426 ms.
Product exploration explored 100000 steps with 33333 reset in 337 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) p1 p2))), (X p0), (X (AND p0 (NOT p1))), (X (NOT p1)), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 16 factoid took 46 ms. Reduced automaton from 7 states, 13 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ParamProductionCell-PT-3-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ParamProductionCell-PT-3-LTLFireability-00 finished in 2207 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(!(X(p0) U !p1)))'
Support contains 4 out of 195 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 195/195 places, 197/197 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 194 transition count 196
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 194 transition count 196
Applied a total of 2 rules in 10 ms. Remains 194 /195 variables (removed 1) and now considering 196/197 (removed 1) transitions.
// Phase 1: matrix 196 rows 194 cols
[2024-05-25 16:10:44] [INFO ] Computed 28 invariants in 3 ms
[2024-05-25 16:10:44] [INFO ] Implicit Places using invariants in 178 ms returned [15, 37, 64, 65, 84, 139, 171, 175]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 179 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 186/195 places, 196/197 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 184 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 184 transition count 194
Applied a total of 4 rules in 8 ms. Remains 184 /186 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 184 cols
[2024-05-25 16:10:44] [INFO ] Computed 20 invariants in 3 ms
[2024-05-25 16:10:44] [INFO ] Implicit Places using invariants in 124 ms returned []
[2024-05-25 16:10:44] [INFO ] Invariant cache hit.
[2024-05-25 16:10:44] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-25 16:10:44] [INFO ] Implicit Places using invariants and state equation in 355 ms returned []
Implicit Place search using SMT with State Equation took 485 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 184/195 places, 194/197 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 682 ms. Remains : 184/195 places, 194/197 transitions.
Stuttering acceptance computed with spot in 226 ms :[(NOT p1), (AND (NOT p1) p0)]
Running random walk in product with property : ParamProductionCell-PT-3-LTLFireability-01
Product exploration explored 100000 steps with 378 reset in 304 ms.
Stack based approach found an accepted trace after 2141 steps with 8 reset with depth 477 and stack size 477 in 6 ms.
FORMULA ParamProductionCell-PT-3-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property ParamProductionCell-PT-3-LTLFireability-01 finished in 1244 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 5 out of 195 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 195/195 places, 197/197 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 194 transition count 196
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 194 transition count 196
Applied a total of 2 rules in 7 ms. Remains 194 /195 variables (removed 1) and now considering 196/197 (removed 1) transitions.
// Phase 1: matrix 196 rows 194 cols
[2024-05-25 16:10:45] [INFO ] Computed 28 invariants in 6 ms
[2024-05-25 16:10:45] [INFO ] Implicit Places using invariants in 159 ms returned [15, 37, 65, 84, 139, 175]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 162 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 188/195 places, 196/197 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 186 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 186 transition count 194
Applied a total of 4 rules in 6 ms. Remains 186 /188 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 186 cols
[2024-05-25 16:10:45] [INFO ] Computed 22 invariants in 2 ms
[2024-05-25 16:10:45] [INFO ] Implicit Places using invariants in 133 ms returned []
[2024-05-25 16:10:45] [INFO ] Invariant cache hit.
[2024-05-25 16:10:45] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-25 16:10:46] [INFO ] Implicit Places using invariants and state equation in 436 ms returned []
Implicit Place search using SMT with State Equation took 571 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 186/195 places, 194/197 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 747 ms. Remains : 186/195 places, 194/197 transitions.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-3-LTLFireability-03
Product exploration explored 100000 steps with 801 reset in 125 ms.
Product exploration explored 100000 steps with 804 reset in 183 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 77 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 457 steps (0 resets) in 6 ms. (65 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 99 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
[2024-05-25 16:10:47] [INFO ] Invariant cache hit.
[2024-05-25 16:10:47] [INFO ] [Real]Absence check using 18 positive place invariants in 11 ms returned sat
[2024-05-25 16:10:47] [INFO ] [Real]Absence check using 18 positive and 4 generalized place invariants in 6 ms returned sat
[2024-05-25 16:10:47] [INFO ] [Real]Absence check using state equation in 349 ms returned sat
[2024-05-25 16:10:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:10:47] [INFO ] [Nat]Absence check using 18 positive place invariants in 9 ms returned sat
[2024-05-25 16:10:47] [INFO ] [Nat]Absence check using 18 positive and 4 generalized place invariants in 4 ms returned sat
[2024-05-25 16:10:48] [INFO ] [Nat]Absence check using state equation in 382 ms returned sat
[2024-05-25 16:10:48] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-25 16:10:48] [INFO ] [Nat]Added 68 Read/Feed constraints in 23 ms returned sat
[2024-05-25 16:10:48] [INFO ] Deduced a trap composed of 15 places in 141 ms of which 36 ms to minimize.
[2024-05-25 16:10:48] [INFO ] Deduced a trap composed of 5 places in 156 ms of which 16 ms to minimize.
[2024-05-25 16:10:48] [INFO ] Deduced a trap composed of 7 places in 122 ms of which 2 ms to minimize.
[2024-05-25 16:10:48] [INFO ] Deduced a trap composed of 7 places in 80 ms of which 2 ms to minimize.
[2024-05-25 16:10:49] [INFO ] Deduced a trap composed of 7 places in 107 ms of which 2 ms to minimize.
[2024-05-25 16:10:49] [INFO ] Deduced a trap composed of 10 places in 88 ms of which 3 ms to minimize.
[2024-05-25 16:10:49] [INFO ] Deduced a trap composed of 37 places in 68 ms of which 2 ms to minimize.
[2024-05-25 16:10:49] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 2 ms to minimize.
[2024-05-25 16:10:49] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 2 ms to minimize.
[2024-05-25 16:10:49] [INFO ] Deduced a trap composed of 30 places in 85 ms of which 2 ms to minimize.
[2024-05-25 16:10:49] [INFO ] Deduced a trap composed of 7 places in 101 ms of which 2 ms to minimize.
[2024-05-25 16:10:49] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 2 ms to minimize.
[2024-05-25 16:10:49] [INFO ] Deduced a trap composed of 28 places in 62 ms of which 2 ms to minimize.
[2024-05-25 16:10:50] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 1 ms to minimize.
[2024-05-25 16:10:50] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 2 ms to minimize.
[2024-05-25 16:10:50] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 2 ms to minimize.
[2024-05-25 16:10:50] [INFO ] Deduced a trap composed of 38 places in 57 ms of which 2 ms to minimize.
[2024-05-25 16:10:50] [INFO ] Deduced a trap composed of 40 places in 84 ms of which 2 ms to minimize.
[2024-05-25 16:10:50] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 2 ms to minimize.
[2024-05-25 16:10:50] [INFO ] Deduced a trap composed of 27 places in 58 ms of which 2 ms to minimize.
[2024-05-25 16:10:50] [INFO ] Deduced a trap composed of 22 places in 69 ms of which 2 ms to minimize.
[2024-05-25 16:10:50] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 2 ms to minimize.
[2024-05-25 16:10:50] [INFO ] Deduced a trap composed of 26 places in 78 ms of which 2 ms to minimize.
[2024-05-25 16:10:51] [INFO ] Deduced a trap composed of 23 places in 93 ms of which 1 ms to minimize.
[2024-05-25 16:10:51] [INFO ] Deduced a trap composed of 24 places in 79 ms of which 2 ms to minimize.
[2024-05-25 16:10:51] [INFO ] Deduced a trap composed of 25 places in 82 ms of which 1 ms to minimize.
[2024-05-25 16:10:51] [INFO ] Deduced a trap composed of 5 places in 98 ms of which 2 ms to minimize.
[2024-05-25 16:10:51] [INFO ] Deduced a trap composed of 26 places in 60 ms of which 2 ms to minimize.
[2024-05-25 16:10:51] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 1 ms to minimize.
[2024-05-25 16:10:51] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
[2024-05-25 16:10:51] [INFO ] Deduced a trap composed of 27 places in 91 ms of which 2 ms to minimize.
[2024-05-25 16:10:51] [INFO ] Trap strengthening (SAT) tested/added 32/31 trap constraints in 3458 ms
[2024-05-25 16:10:51] [INFO ] Computed and/alt/rep : 191/319/191 causal constraints (skipped 0 transitions) in 20 ms.
[2024-05-25 16:10:53] [INFO ] Added : 186 causal constraints over 38 iterations in 1302 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 5 out of 186 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 186/186 places, 194/194 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 38 place count 186 transition count 156
Reduce places removed 38 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 40 rules applied. Total rules applied 78 place count 148 transition count 154
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 80 place count 146 transition count 154
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 80 place count 146 transition count 142
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 104 place count 134 transition count 142
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 84 rules applied. Total rules applied 188 place count 92 transition count 100
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 190 place count 91 transition count 99
Applied a total of 190 rules in 56 ms. Remains 91 /186 variables (removed 95) and now considering 99/194 (removed 95) transitions.
// Phase 1: matrix 99 rows 91 cols
[2024-05-25 16:10:53] [INFO ] Computed 22 invariants in 0 ms
[2024-05-25 16:10:53] [INFO ] Implicit Places using invariants in 243 ms returned []
[2024-05-25 16:10:53] [INFO ] Invariant cache hit.
[2024-05-25 16:10:53] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-05-25 16:10:53] [INFO ] Implicit Places using invariants and state equation in 215 ms returned []
Implicit Place search using SMT with State Equation took 467 ms to find 0 implicit places.
[2024-05-25 16:10:53] [INFO ] Redundant transitions in 2 ms returned []
Running 97 sub problems to find dead transitions.
[2024-05-25 16:10:53] [INFO ] Invariant cache hit.
[2024-05-25 16:10:53] [INFO ] State equation strengthened by 67 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-25 16:10:54] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 2 ms to minimize.
[2024-05-25 16:10:54] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2024-05-25 16:10:54] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 2 ms to minimize.
[2024-05-25 16:10:54] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-05-25 16:10:54] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
[2024-05-25 16:10:54] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 1 ms to minimize.
[2024-05-25 16:10:54] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
[2024-05-25 16:10:54] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2024-05-25 16:10:54] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
[2024-05-25 16:10:54] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-05-25 16:10:54] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2024-05-25 16:10:54] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 1 ms to minimize.
[2024-05-25 16:10:54] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2024-05-25 16:10:54] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-05-25 16:10:54] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
[2024-05-25 16:10:54] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2024-05-25 16:10:54] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 2 ms to minimize.
[2024-05-25 16:10:54] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-25 16:10:54] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 2 ms to minimize.
[2024-05-25 16:10:55] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-25 16:10:55] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 1 ms to minimize.
[2024-05-25 16:10:55] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 1 ms to minimize.
[2024-05-25 16:10:55] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
[2024-05-25 16:10:55] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-25 16:10:55] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-05-25 16:10:55] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 12 ms to minimize.
[2024-05-25 16:10:55] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2024-05-25 16:10:55] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 0 ms to minimize.
[2024-05-25 16:10:55] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
[2024-05-25 16:10:55] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-05-25 16:10:55] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-05-25 16:10:55] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 1 ms to minimize.
[2024-05-25 16:10:55] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
[2024-05-25 16:10:55] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 0 ms to minimize.
[2024-05-25 16:10:55] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-05-25 16:10:55] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 0 ms to minimize.
[2024-05-25 16:10:55] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
[2024-05-25 16:10:55] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
[2024-05-25 16:10:55] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 19/59 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-25 16:10:56] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-05-25 16:10:56] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 2 ms to minimize.
[2024-05-25 16:10:56] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2024-05-25 16:10:56] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 4/63 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-25 16:10:56] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/89 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/89 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (OVERLAPS) 1/90 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-25 16:10:57] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 1 ms to minimize.
[2024-05-25 16:10:57] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 1 ms to minimize.
[2024-05-25 16:10:57] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-05-25 16:10:58] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 0 ms to minimize.
[2024-05-25 16:10:58] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/90 variables, 5/70 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/90 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 10 (OVERLAPS) 1/91 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-25 16:10:59] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 0 ms to minimize.
[2024-05-25 16:10:59] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/91 variables, 2/73 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/91 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 13 (OVERLAPS) 99/190 variables, 91/164 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/190 variables, 67/231 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/190 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 16 (OVERLAPS) 0/190 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Real declared 190/190 variables, and 231 constraints, problems are : Problem set: 0 solved, 97 unsolved in 8115 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 91/91 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 51/51 constraints]
Escalating to Integer solving :Problem set: 0 solved, 97 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 50/70 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-25 16:11:02] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
[2024-05-25 16:11:02] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 2/72 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (OVERLAPS) 1/90 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/90 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/90 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (OVERLAPS) 1/91 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-25 16:11:03] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/91 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/91 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 11 (OVERLAPS) 99/190 variables, 91/167 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/190 variables, 67/234 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/190 variables, 97/331 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/190 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-25 16:11:05] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 1 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/190 variables, 1/332 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/190 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 17 (OVERLAPS) 0/190 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Int declared 190/190 variables, and 332 constraints, problems are : Problem set: 0 solved, 97 unsolved in 6795 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 91/91 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 55/55 constraints]
After SMT, in 14975ms problems are : Problem set: 0 solved, 97 unsolved
Search for dead transitions found 0 dead transitions in 14987ms
Starting structural reductions in SI_LTL mode, iteration 1 : 91/186 places, 99/194 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 15522 ms. Remains : 91/186 places, 99/194 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 87 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 268 steps (0 resets) in 5 ms. (44 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 101 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
[2024-05-25 16:11:08] [INFO ] Invariant cache hit.
[2024-05-25 16:11:09] [INFO ] [Real]Absence check using 18 positive place invariants in 8 ms returned sat
[2024-05-25 16:11:09] [INFO ] [Real]Absence check using 18 positive and 4 generalized place invariants in 2 ms returned sat
[2024-05-25 16:11:09] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2024-05-25 16:11:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:11:09] [INFO ] [Nat]Absence check using 18 positive place invariants in 8 ms returned sat
[2024-05-25 16:11:09] [INFO ] [Nat]Absence check using 18 positive and 4 generalized place invariants in 3 ms returned sat
[2024-05-25 16:11:09] [INFO ] [Nat]Absence check using state equation in 68 ms returned sat
[2024-05-25 16:11:09] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-05-25 16:11:09] [INFO ] [Nat]Added 67 Read/Feed constraints in 13 ms returned sat
[2024-05-25 16:11:09] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 2 ms to minimize.
[2024-05-25 16:11:09] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 1 ms to minimize.
[2024-05-25 16:11:09] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 1 ms to minimize.
[2024-05-25 16:11:09] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 1 ms to minimize.
[2024-05-25 16:11:09] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
[2024-05-25 16:11:09] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2024-05-25 16:11:09] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 2 ms to minimize.
[2024-05-25 16:11:09] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-05-25 16:11:09] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
[2024-05-25 16:11:09] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 2 ms to minimize.
[2024-05-25 16:11:09] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-05-25 16:11:09] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 567 ms
[2024-05-25 16:11:09] [INFO ] Computed and/alt/rep : 97/231/97 causal constraints (skipped 0 transitions) in 8 ms.
[2024-05-25 16:11:10] [INFO ] Added : 72 causal constraints over 15 iterations in 207 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1532 reset in 196 ms.
Product exploration explored 100000 steps with 1531 reset in 239 ms.
Built C files in :
/tmp/ltsmin9788772207912604485
[2024-05-25 16:11:10] [INFO ] Computing symmetric may disable matrix : 99 transitions.
[2024-05-25 16:11:10] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 16:11:10] [INFO ] Computing symmetric may enable matrix : 99 transitions.
[2024-05-25 16:11:10] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 16:11:10] [INFO ] Computing Do-Not-Accords matrix : 99 transitions.
[2024-05-25 16:11:10] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 16:11:10] [INFO ] Built C files in 37ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9788772207912604485
Running compilation step : cd /tmp/ltsmin9788772207912604485;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 770 ms.
Running link step : cd /tmp/ltsmin9788772207912604485;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin9788772207912604485;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12884168259569231043.hoa' '--buchi-type=spotba'
LTSmin run took 1128 ms.
FORMULA ParamProductionCell-PT-3-LTLFireability-03 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ParamProductionCell-PT-3-LTLFireability-03 finished in 27179 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||F(G((p1||X(F(p2))))))))'
Support contains 6 out of 195 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 195/195 places, 197/197 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 194 transition count 196
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 194 transition count 196
Applied a total of 2 rules in 6 ms. Remains 194 /195 variables (removed 1) and now considering 196/197 (removed 1) transitions.
// Phase 1: matrix 196 rows 194 cols
[2024-05-25 16:11:12] [INFO ] Computed 28 invariants in 1 ms
[2024-05-25 16:11:12] [INFO ] Implicit Places using invariants in 161 ms returned [15, 64, 65, 84, 139, 171, 175]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 173 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 187/195 places, 196/197 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 185 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 185 transition count 194
Applied a total of 4 rules in 8 ms. Remains 185 /187 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 185 cols
[2024-05-25 16:11:12] [INFO ] Computed 21 invariants in 1 ms
[2024-05-25 16:11:12] [INFO ] Implicit Places using invariants in 126 ms returned []
[2024-05-25 16:11:12] [INFO ] Invariant cache hit.
[2024-05-25 16:11:13] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-25 16:11:13] [INFO ] Implicit Places using invariants and state equation in 391 ms returned []
Implicit Place search using SMT with State Equation took 519 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 185/195 places, 194/197 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 706 ms. Remains : 185/195 places, 194/197 transitions.
Stuttering acceptance computed with spot in 149 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : ParamProductionCell-PT-3-LTLFireability-04
Product exploration explored 100000 steps with 1614 reset in 144 ms.
Product exploration explored 100000 steps with 1616 reset in 157 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p2)), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p0))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 11 factoid took 131 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
RANDOM walk for 1187 steps (0 resets) in 22 ms. (51 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p2)), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p0))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F p2), (F (NOT (AND (NOT p2) (NOT p1)))), (F (NOT (OR p2 (NOT p1))))]
Knowledge based reduction with 11 factoid took 305 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
[2024-05-25 16:11:14] [INFO ] Invariant cache hit.
[2024-05-25 16:11:14] [INFO ] [Real]Absence check using 20 positive place invariants in 12 ms returned sat
[2024-05-25 16:11:14] [INFO ] [Real]Absence check using 20 positive and 1 generalized place invariants in 4 ms returned sat
[2024-05-25 16:11:14] [INFO ] [Real]Absence check using state equation in 280 ms returned sat
[2024-05-25 16:11:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:11:15] [INFO ] [Nat]Absence check using 20 positive place invariants in 13 ms returned sat
[2024-05-25 16:11:15] [INFO ] [Nat]Absence check using 20 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-25 16:11:15] [INFO ] [Nat]Absence check using state equation in 330 ms returned sat
[2024-05-25 16:11:15] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-25 16:11:15] [INFO ] [Nat]Added 68 Read/Feed constraints in 32 ms returned sat
[2024-05-25 16:11:15] [INFO ] Deduced a trap composed of 7 places in 73 ms of which 2 ms to minimize.
[2024-05-25 16:11:15] [INFO ] Deduced a trap composed of 7 places in 68 ms of which 2 ms to minimize.
[2024-05-25 16:11:15] [INFO ] Deduced a trap composed of 7 places in 70 ms of which 2 ms to minimize.
[2024-05-25 16:11:15] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 1 ms to minimize.
[2024-05-25 16:11:15] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 2 ms to minimize.
[2024-05-25 16:11:16] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 2 ms to minimize.
[2024-05-25 16:11:16] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
[2024-05-25 16:11:16] [INFO ] Deduced a trap composed of 6 places in 45 ms of which 2 ms to minimize.
[2024-05-25 16:11:16] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 1 ms to minimize.
[2024-05-25 16:11:16] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 1 ms to minimize.
[2024-05-25 16:11:16] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 1 ms to minimize.
[2024-05-25 16:11:16] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 888 ms
[2024-05-25 16:11:16] [INFO ] Computed and/alt/rep : 191/317/191 causal constraints (skipped 0 transitions) in 20 ms.
[2024-05-25 16:11:17] [INFO ] Added : 177 causal constraints over 36 iterations in 1296 ms. Result :sat
Could not prove EG (AND (NOT p2) (NOT p1))
Support contains 3 out of 185 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 185/185 places, 194/194 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 39 place count 185 transition count 155
Reduce places removed 39 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 40 rules applied. Total rules applied 79 place count 146 transition count 154
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 80 place count 145 transition count 154
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 80 place count 145 transition count 144
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 100 place count 135 transition count 144
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: 43
Deduced a syphon composed of 43 places in 0 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 3 with 86 rules applied. Total rules applied 186 place count 92 transition count 101
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 188 place count 91 transition count 100
Applied a total of 188 rules in 29 ms. Remains 91 /185 variables (removed 94) and now considering 100/194 (removed 94) transitions.
// Phase 1: matrix 100 rows 91 cols
[2024-05-25 16:11:17] [INFO ] Computed 21 invariants in 0 ms
[2024-05-25 16:11:17] [INFO ] Implicit Places using invariants in 119 ms returned []
[2024-05-25 16:11:17] [INFO ] Invariant cache hit.
[2024-05-25 16:11:17] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-05-25 16:11:18] [INFO ] Implicit Places using invariants and state equation in 208 ms returned []
Implicit Place search using SMT with State Equation took 329 ms to find 0 implicit places.
[2024-05-25 16:11:18] [INFO ] Redundant transitions in 2 ms returned []
Running 98 sub problems to find dead transitions.
[2024-05-25 16:11:18] [INFO ] Invariant cache hit.
[2024-05-25 16:11:18] [INFO ] State equation strengthened by 67 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-25 16:11:18] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-25 16:11:18] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 2 ms to minimize.
[2024-05-25 16:11:18] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2024-05-25 16:11:18] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 1 ms to minimize.
[2024-05-25 16:11:18] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2024-05-25 16:11:18] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2024-05-25 16:11:18] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2024-05-25 16:11:18] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 1 ms to minimize.
[2024-05-25 16:11:18] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 2 ms to minimize.
[2024-05-25 16:11:18] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
[2024-05-25 16:11:18] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-05-25 16:11:18] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-25 16:11:19] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
[2024-05-25 16:11:19] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2024-05-25 16:11:19] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-25 16:11:19] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 1 ms to minimize.
[2024-05-25 16:11:19] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
[2024-05-25 16:11:19] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
[2024-05-25 16:11:19] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2024-05-25 16:11:19] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-25 16:11:19] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-05-25 16:11:19] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-05-25 16:11:19] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-05-25 16:11:19] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 2 ms to minimize.
[2024-05-25 16:11:19] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
[2024-05-25 16:11:19] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-25 16:11:19] [INFO ] Deduced a trap composed of 14 places in 20 ms of which 0 ms to minimize.
[2024-05-25 16:11:19] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2024-05-25 16:11:19] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 0 ms to minimize.
[2024-05-25 16:11:19] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-05-25 16:11:19] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 1 ms to minimize.
[2024-05-25 16:11:19] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-05-25 16:11:19] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
[2024-05-25 16:11:20] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 3 ms to minimize.
[2024-05-25 16:11:20] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-25 16:11:20] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 0 ms to minimize.
[2024-05-25 16:11:20] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 17/56 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-25 16:11:20] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/89 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (OVERLAPS) 2/91 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-25 16:11:21] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-05-25 16:11:21] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 0 ms to minimize.
[2024-05-25 16:11:21] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-25 16:11:21] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/91 variables, 4/63 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-25 16:11:22] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/91 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/91 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 10 (OVERLAPS) 100/191 variables, 91/155 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/191 variables, 67/222 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/191 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 13 (OVERLAPS) 0/191 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Real declared 191/191 variables, and 222 constraints, problems are : Problem set: 0 solved, 98 unsolved in 6335 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 91/91 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 43/43 constraints]
Escalating to Integer solving :Problem set: 0 solved, 98 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 42/61 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (OVERLAPS) 2/91 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-25 16:11:25] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/91 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (OVERLAPS) 100/191 variables, 91/156 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/191 variables, 67/223 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/191 variables, 98/321 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-25 16:11:26] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-05-25 16:11:26] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/191 variables, 2/323 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-25 16:11:27] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/191 variables, 1/324 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/191 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 14 (OVERLAPS) 0/191 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Int declared 191/191 variables, and 324 constraints, problems are : Problem set: 0 solved, 98 unsolved in 5941 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 91/91 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 47/47 constraints]
After SMT, in 12326ms problems are : Problem set: 0 solved, 98 unsolved
Search for dead transitions found 0 dead transitions in 12332ms
Starting structural reductions in SI_LTL mode, iteration 1 : 91/185 places, 100/194 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 12699 ms. Remains : 91/185 places, 100/194 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND (NOT p2) p1))), (X (AND (NOT p2) (NOT p1))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 105 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
RANDOM walk for 937 steps (0 resets) in 23 ms. (39 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND (NOT p2) p1))), (X (AND (NOT p2) (NOT p1))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F p2), (F (NOT (OR (NOT p1) p2))), (F (NOT (AND (NOT p1) (NOT p2))))]
Knowledge based reduction with 9 factoid took 224 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
[2024-05-25 16:11:30] [INFO ] Invariant cache hit.
[2024-05-25 16:11:31] [INFO ] [Real]Absence check using 19 positive place invariants in 10 ms returned sat
[2024-05-25 16:11:31] [INFO ] [Real]Absence check using 19 positive and 2 generalized place invariants in 3 ms returned sat
[2024-05-25 16:11:31] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2024-05-25 16:11:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:11:31] [INFO ] [Nat]Absence check using 19 positive place invariants in 8 ms returned sat
[2024-05-25 16:11:31] [INFO ] [Nat]Absence check using 19 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-25 16:11:31] [INFO ] [Nat]Absence check using state equation in 78 ms returned sat
[2024-05-25 16:11:31] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-05-25 16:11:31] [INFO ] [Nat]Added 67 Read/Feed constraints in 11 ms returned sat
[2024-05-25 16:11:31] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 1 ms to minimize.
[2024-05-25 16:11:31] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 1 ms to minimize.
[2024-05-25 16:11:31] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 2 ms to minimize.
[2024-05-25 16:11:31] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
[2024-05-25 16:11:31] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 1 ms to minimize.
[2024-05-25 16:11:31] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 2 ms to minimize.
[2024-05-25 16:11:31] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2024-05-25 16:11:31] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2024-05-25 16:11:31] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 1 ms to minimize.
[2024-05-25 16:11:31] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-05-25 16:11:31] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2024-05-25 16:11:31] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2024-05-25 16:11:31] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 1 ms to minimize.
[2024-05-25 16:11:32] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 2 ms to minimize.
[2024-05-25 16:11:32] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 2 ms to minimize.
[2024-05-25 16:11:32] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 1 ms to minimize.
[2024-05-25 16:11:32] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-05-25 16:11:32] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2024-05-25 16:11:32] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-05-25 16:11:32] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 1 ms to minimize.
[2024-05-25 16:11:32] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
[2024-05-25 16:11:32] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 1 ms to minimize.
[2024-05-25 16:11:32] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-05-25 16:11:32] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 1108 ms
[2024-05-25 16:11:32] [INFO ] Computed and/alt/rep : 98/230/98 causal constraints (skipped 0 transitions) in 8 ms.
[2024-05-25 16:11:32] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
[2024-05-25 16:11:32] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-05-25 16:11:32] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 1 ms to minimize.
[2024-05-25 16:11:32] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 1 ms to minimize.
[2024-05-25 16:11:32] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 183 ms
[2024-05-25 16:11:32] [INFO ] Added : 94 causal constraints over 19 iterations in 469 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2))
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 2943 reset in 141 ms.
Product exploration explored 100000 steps with 2942 reset in 156 ms.
Built C files in :
/tmp/ltsmin10049419320534769318
[2024-05-25 16:11:33] [INFO ] Computing symmetric may disable matrix : 100 transitions.
[2024-05-25 16:11:33] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 16:11:33] [INFO ] Computing symmetric may enable matrix : 100 transitions.
[2024-05-25 16:11:33] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 16:11:33] [INFO ] Computing Do-Not-Accords matrix : 100 transitions.
[2024-05-25 16:11:33] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 16:11:33] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10049419320534769318
Running compilation step : cd /tmp/ltsmin10049419320534769318;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 395 ms.
Running link step : cd /tmp/ltsmin10049419320534769318;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin10049419320534769318;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10303662229907187102.hoa' '--buchi-type=spotba'
LTSmin run took 2822 ms.
FORMULA ParamProductionCell-PT-3-LTLFireability-04 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ParamProductionCell-PT-3-LTLFireability-04 finished in 23960 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Support contains 4 out of 195 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 195/195 places, 197/197 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 195 transition count 162
Reduce places removed 35 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 36 rules applied. Total rules applied 71 place count 160 transition count 161
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 72 place count 159 transition count 161
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 72 place count 159 transition count 151
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 92 place count 149 transition count 151
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 1 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 72 rules applied. Total rules applied 164 place count 113 transition count 115
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 166 place count 112 transition count 114
Applied a total of 166 rules in 23 ms. Remains 112 /195 variables (removed 83) and now considering 114/197 (removed 83) transitions.
// Phase 1: matrix 114 rows 112 cols
[2024-05-25 16:11:36] [INFO ] Computed 28 invariants in 1 ms
[2024-05-25 16:11:36] [INFO ] Implicit Places using invariants in 150 ms returned [10, 22, 37, 38, 78, 99, 101]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 152 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 105/195 places, 114/197 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 105 transition count 113
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 104 transition count 113
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 2 place count 104 transition count 110
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 8 place count 101 transition count 110
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 22 place count 94 transition count 103
Applied a total of 22 rules in 12 ms. Remains 94 /105 variables (removed 11) and now considering 103/114 (removed 11) transitions.
// Phase 1: matrix 103 rows 94 cols
[2024-05-25 16:11:36] [INFO ] Computed 21 invariants in 1 ms
[2024-05-25 16:11:36] [INFO ] Implicit Places using invariants in 116 ms returned []
[2024-05-25 16:11:36] [INFO ] Invariant cache hit.
[2024-05-25 16:11:37] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-05-25 16:11:37] [INFO ] Implicit Places using invariants and state equation in 227 ms returned []
Implicit Place search using SMT with State Equation took 345 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 94/195 places, 103/197 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 534 ms. Remains : 94/195 places, 103/197 transitions.
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ParamProductionCell-PT-3-LTLFireability-05
Product exploration explored 100000 steps with 939 reset in 141 ms.
Product exploration explored 100000 steps with 939 reset in 160 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT p0)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 5 factoid took 281 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 304 steps (0 resets) in 7 ms. (38 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT p0)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (F p1), (F (NOT (OR p0 (NOT p1)))), (F (NOT p0)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 5 factoid took 481 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 94 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 94/94 places, 103/103 transitions.
Applied a total of 0 rules in 4 ms. Remains 94 /94 variables (removed 0) and now considering 103/103 (removed 0) transitions.
[2024-05-25 16:11:38] [INFO ] Invariant cache hit.
[2024-05-25 16:11:38] [INFO ] Implicit Places using invariants in 121 ms returned []
[2024-05-25 16:11:38] [INFO ] Invariant cache hit.
[2024-05-25 16:11:38] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-05-25 16:11:38] [INFO ] Implicit Places using invariants and state equation in 232 ms returned []
Implicit Place search using SMT with State Equation took 355 ms to find 0 implicit places.
[2024-05-25 16:11:38] [INFO ] Redundant transitions in 2 ms returned []
Running 101 sub problems to find dead transitions.
[2024-05-25 16:11:38] [INFO ] Invariant cache hit.
[2024-05-25 16:11:38] [INFO ] State equation strengthened by 67 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-05-25 16:11:39] [INFO ] Deduced a trap composed of 34 places in 38 ms of which 2 ms to minimize.
[2024-05-25 16:11:39] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 1 ms to minimize.
[2024-05-25 16:11:39] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 2 ms to minimize.
[2024-05-25 16:11:39] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
[2024-05-25 16:11:39] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-05-25 16:11:39] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
[2024-05-25 16:11:39] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 2 ms to minimize.
[2024-05-25 16:11:39] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-05-25 16:11:39] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
[2024-05-25 16:11:39] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-05-25 16:11:39] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
[2024-05-25 16:11:39] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2024-05-25 16:11:39] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 1 ms to minimize.
[2024-05-25 16:11:39] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
[2024-05-25 16:11:40] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 1 ms to minimize.
[2024-05-25 16:11:40] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2024-05-25 16:11:40] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-05-25 16:11:40] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 1 ms to minimize.
[2024-05-25 16:11:40] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2024-05-25 16:11:40] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-05-25 16:11:40] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2024-05-25 16:11:40] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
[2024-05-25 16:11:40] [INFO ] Deduced a trap composed of 27 places in 32 ms of which 1 ms to minimize.
[2024-05-25 16:11:40] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
[2024-05-25 16:11:40] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-05-25 16:11:40] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2024-05-25 16:11:40] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 0 ms to minimize.
[2024-05-25 16:11:40] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 2 ms to minimize.
[2024-05-25 16:11:40] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2024-05-25 16:11:40] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-25 16:11:40] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-05-25 16:11:40] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-05-25 16:11:40] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 1 ms to minimize.
[2024-05-25 16:11:40] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 1 ms to minimize.
[2024-05-25 16:11:41] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2024-05-25 16:11:41] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 16/55 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-05-25 16:11:41] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 1 ms to minimize.
[2024-05-25 16:11:41] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 2/57 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-05-25 16:11:41] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-05-25 16:11:42] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/92 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/92 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (OVERLAPS) 1/93 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-05-25 16:11:42] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 1 ms to minimize.
[2024-05-25 16:11:43] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
[2024-05-25 16:11:43] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/93 variables, 3/63 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-05-25 16:11:43] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 1 ms to minimize.
[2024-05-25 16:11:43] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/93 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/93 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 11 (OVERLAPS) 1/94 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/94 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 13 (OVERLAPS) 103/197 variables, 94/160 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/197 variables, 67/227 constraints. Problems are: Problem set: 0 solved, 101 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/197 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 16 (OVERLAPS) 0/197 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Real declared 197/197 variables, and 227 constraints, problems are : Problem set: 0 solved, 101 unsolved in 8018 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 94/94 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 45/45 constraints]
Escalating to Integer solving :Problem set: 0 solved, 101 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 44/63 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-05-25 16:11:47] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (OVERLAPS) 1/93 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/93 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/93 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 8 (OVERLAPS) 1/94 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-05-25 16:11:48] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/94 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/94 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 11 (OVERLAPS) 103/197 variables, 94/162 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/197 variables, 67/229 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/197 variables, 101/330 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/197 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 15 (OVERLAPS) 0/197 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Int declared 197/197 variables, and 330 constraints, problems are : Problem set: 0 solved, 101 unsolved in 5559 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 94/94 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 47/47 constraints]
After SMT, in 13607ms problems are : Problem set: 0 solved, 101 unsolved
Search for dead transitions found 0 dead transitions in 13609ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 13977 ms. Remains : 94/94 places, 103/103 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 5 factoid took 279 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 298 steps (0 resets) in 9 ms. (29 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (F p1), (F (NOT (OR p0 (NOT p1)))), (F (NOT p0)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 5 factoid took 437 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 937 reset in 145 ms.
Product exploration explored 100000 steps with 944 reset in 163 ms.
Built C files in :
/tmp/ltsmin11671617031352193876
[2024-05-25 16:11:53] [INFO ] Computing symmetric may disable matrix : 103 transitions.
[2024-05-25 16:11:53] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 16:11:53] [INFO ] Computing symmetric may enable matrix : 103 transitions.
[2024-05-25 16:11:53] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 16:11:53] [INFO ] Computing Do-Not-Accords matrix : 103 transitions.
[2024-05-25 16:11:53] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 16:11:53] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11671617031352193876
Running compilation step : cd /tmp/ltsmin11671617031352193876;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 541 ms.
Running link step : cd /tmp/ltsmin11671617031352193876;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin11671617031352193876;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1801679648950704140.hoa' '--buchi-type=spotba'
LTSmin run took 2357 ms.
FORMULA ParamProductionCell-PT-3-LTLFireability-05 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ParamProductionCell-PT-3-LTLFireability-05 finished in 20248 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 195 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 195/195 places, 197/197 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 194 transition count 196
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 194 transition count 196
Applied a total of 2 rules in 3 ms. Remains 194 /195 variables (removed 1) and now considering 196/197 (removed 1) transitions.
// Phase 1: matrix 196 rows 194 cols
[2024-05-25 16:11:56] [INFO ] Computed 28 invariants in 3 ms
[2024-05-25 16:11:57] [INFO ] Implicit Places using invariants in 238 ms returned [37, 64, 65, 84, 139, 171, 175]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 240 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 187/195 places, 196/197 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 185 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 185 transition count 194
Applied a total of 4 rules in 6 ms. Remains 185 /187 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 185 cols
[2024-05-25 16:11:57] [INFO ] Computed 21 invariants in 2 ms
[2024-05-25 16:11:57] [INFO ] Implicit Places using invariants in 178 ms returned []
[2024-05-25 16:11:57] [INFO ] Invariant cache hit.
[2024-05-25 16:11:57] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-25 16:11:57] [INFO ] Implicit Places using invariants and state equation in 512 ms returned []
Implicit Place search using SMT with State Equation took 701 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 185/195 places, 194/197 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 952 ms. Remains : 185/195 places, 194/197 transitions.
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-3-LTLFireability-06
Product exploration explored 100000 steps with 1229 reset in 180 ms.
Product exploration explored 100000 steps with 1223 reset in 209 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 105 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 323 steps (0 resets) in 6 ms. (46 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 139 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 108 ms :[(NOT p0), (NOT p0)]
[2024-05-25 16:11:58] [INFO ] Invariant cache hit.
[2024-05-25 16:11:59] [INFO ] [Real]Absence check using 19 positive place invariants in 18 ms returned sat
[2024-05-25 16:11:59] [INFO ] [Real]Absence check using 19 positive and 2 generalized place invariants in 5 ms returned sat
[2024-05-25 16:11:59] [INFO ] [Real]Absence check using state equation in 428 ms returned sat
[2024-05-25 16:11:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:11:59] [INFO ] [Nat]Absence check using 19 positive place invariants in 16 ms returned sat
[2024-05-25 16:11:59] [INFO ] [Nat]Absence check using 19 positive and 2 generalized place invariants in 5 ms returned sat
[2024-05-25 16:12:00] [INFO ] [Nat]Absence check using state equation in 406 ms returned sat
[2024-05-25 16:12:00] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-25 16:12:00] [INFO ] [Nat]Added 68 Read/Feed constraints in 47 ms returned sat
[2024-05-25 16:12:00] [INFO ] Deduced a trap composed of 7 places in 110 ms of which 3 ms to minimize.
[2024-05-25 16:12:00] [INFO ] Deduced a trap composed of 5 places in 109 ms of which 2 ms to minimize.
[2024-05-25 16:12:00] [INFO ] Deduced a trap composed of 7 places in 102 ms of which 4 ms to minimize.
[2024-05-25 16:12:00] [INFO ] Deduced a trap composed of 9 places in 95 ms of which 3 ms to minimize.
[2024-05-25 16:12:01] [INFO ] Deduced a trap composed of 12 places in 135 ms of which 3 ms to minimize.
[2024-05-25 16:12:01] [INFO ] Deduced a trap composed of 7 places in 107 ms of which 3 ms to minimize.
[2024-05-25 16:12:01] [INFO ] Deduced a trap composed of 24 places in 104 ms of which 2 ms to minimize.
[2024-05-25 16:12:01] [INFO ] Deduced a trap composed of 6 places in 94 ms of which 3 ms to minimize.
[2024-05-25 16:12:01] [INFO ] Deduced a trap composed of 26 places in 91 ms of which 2 ms to minimize.
[2024-05-25 16:12:01] [INFO ] Deduced a trap composed of 7 places in 98 ms of which 2 ms to minimize.
[2024-05-25 16:12:01] [INFO ] Deduced a trap composed of 27 places in 94 ms of which 3 ms to minimize.
[2024-05-25 16:12:02] [INFO ] Deduced a trap composed of 41 places in 91 ms of which 2 ms to minimize.
[2024-05-25 16:12:02] [INFO ] Deduced a trap composed of 27 places in 95 ms of which 2 ms to minimize.
[2024-05-25 16:12:02] [INFO ] Deduced a trap composed of 41 places in 93 ms of which 2 ms to minimize.
[2024-05-25 16:12:02] [INFO ] Deduced a trap composed of 7 places in 86 ms of which 2 ms to minimize.
[2024-05-25 16:12:02] [INFO ] Deduced a trap composed of 29 places in 51 ms of which 2 ms to minimize.
[2024-05-25 16:12:02] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 2 ms to minimize.
[2024-05-25 16:12:02] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 2224 ms
[2024-05-25 16:12:02] [INFO ] Computed and/alt/rep : 191/309/191 causal constraints (skipped 0 transitions) in 22 ms.
[2024-05-25 16:12:03] [INFO ] Added : 177 causal constraints over 36 iterations in 1279 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 185 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 185/185 places, 194/194 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 185 transition count 154
Reduce places removed 40 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 41 rules applied. Total rules applied 81 place count 145 transition count 153
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 82 place count 144 transition count 153
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 82 place count 144 transition count 141
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 106 place count 132 transition count 141
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: 43
Deduced a syphon composed of 43 places in 0 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 3 with 86 rules applied. Total rules applied 192 place count 89 transition count 98
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 194 place count 88 transition count 97
Applied a total of 194 rules in 23 ms. Remains 88 /185 variables (removed 97) and now considering 97/194 (removed 97) transitions.
// Phase 1: matrix 97 rows 88 cols
[2024-05-25 16:12:03] [INFO ] Computed 21 invariants in 2 ms
[2024-05-25 16:12:04] [INFO ] Implicit Places using invariants in 197 ms returned []
[2024-05-25 16:12:04] [INFO ] Invariant cache hit.
[2024-05-25 16:12:04] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-05-25 16:12:04] [INFO ] Implicit Places using invariants and state equation in 328 ms returned []
Implicit Place search using SMT with State Equation took 527 ms to find 0 implicit places.
[2024-05-25 16:12:04] [INFO ] Redundant transitions in 3 ms returned []
Running 95 sub problems to find dead transitions.
[2024-05-25 16:12:04] [INFO ] Invariant cache hit.
[2024-05-25 16:12:04] [INFO ] State equation strengthened by 67 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-25 16:12:04] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 1 ms to minimize.
[2024-05-25 16:12:05] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 1 ms to minimize.
[2024-05-25 16:12:05] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 2 ms to minimize.
[2024-05-25 16:12:05] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 2 ms to minimize.
[2024-05-25 16:12:05] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 2 ms to minimize.
[2024-05-25 16:12:05] [INFO ] Deduced a trap composed of 28 places in 53 ms of which 2 ms to minimize.
[2024-05-25 16:12:05] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 2 ms to minimize.
[2024-05-25 16:12:05] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 1 ms to minimize.
[2024-05-25 16:12:05] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 8 ms to minimize.
[2024-05-25 16:12:05] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 4 ms to minimize.
[2024-05-25 16:12:05] [INFO ] Deduced a trap composed of 29 places in 60 ms of which 1 ms to minimize.
[2024-05-25 16:12:05] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 2 ms to minimize.
[2024-05-25 16:12:05] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 2 ms to minimize.
[2024-05-25 16:12:05] [INFO ] Deduced a trap composed of 7 places in 58 ms of which 2 ms to minimize.
[2024-05-25 16:12:05] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 1 ms to minimize.
[2024-05-25 16:12:05] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 3 ms to minimize.
[2024-05-25 16:12:06] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 2 ms to minimize.
[2024-05-25 16:12:06] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 1 ms to minimize.
[2024-05-25 16:12:06] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 1 ms to minimize.
[2024-05-25 16:12:06] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-25 16:12:06] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 2 ms to minimize.
[2024-05-25 16:12:06] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 1 ms to minimize.
[2024-05-25 16:12:06] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 2 ms to minimize.
[2024-05-25 16:12:06] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 2 ms to minimize.
[2024-05-25 16:12:06] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 1 ms to minimize.
[2024-05-25 16:12:06] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 2 ms to minimize.
[2024-05-25 16:12:06] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 1 ms to minimize.
[2024-05-25 16:12:06] [INFO ] Deduced a trap composed of 25 places in 58 ms of which 2 ms to minimize.
[2024-05-25 16:12:06] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 1 ms to minimize.
[2024-05-25 16:12:06] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 1 ms to minimize.
[2024-05-25 16:12:06] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2024-05-25 16:12:07] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
[2024-05-25 16:12:07] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 2 ms to minimize.
[2024-05-25 16:12:07] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
[2024-05-25 16:12:07] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 2 ms to minimize.
[2024-05-25 16:12:07] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 2 ms to minimize.
[2024-05-25 16:12:07] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-05-25 16:12:07] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 18/57 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-25 16:12:08] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (OVERLAPS) 2/88 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-25 16:12:09] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 1 ms to minimize.
[2024-05-25 16:12:09] [INFO ] Deduced a trap composed of 6 places in 40 ms of which 2 ms to minimize.
[2024-05-25 16:12:09] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/88 variables, 3/63 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/88 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 9 (OVERLAPS) 97/185 variables, 88/151 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/185 variables, 67/218 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/185 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 12 (OVERLAPS) 0/185 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Real declared 185/185 variables, and 218 constraints, problems are : Problem set: 0 solved, 95 unsolved in 9475 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 88/88 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 42/42 constraints]
Escalating to Integer solving :Problem set: 0 solved, 95 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 41/60 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 4 (OVERLAPS) 2/88 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 7 (OVERLAPS) 97/185 variables, 88/151 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/185 variables, 67/218 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/185 variables, 95/313 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/185 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 11 (OVERLAPS) 0/185 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Int declared 185/185 variables, and 313 constraints, problems are : Problem set: 0 solved, 95 unsolved in 5233 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 88/88 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 42/42 constraints]
After SMT, in 14742ms problems are : Problem set: 0 solved, 95 unsolved
Search for dead transitions found 0 dead transitions in 14745ms
Starting structural reductions in SI_LTL mode, iteration 1 : 88/185 places, 97/194 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 15308 ms. Remains : 88/185 places, 97/194 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 101 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 171 steps (0 resets) in 7 ms. (21 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 265 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0)]
[2024-05-25 16:12:19] [INFO ] Invariant cache hit.
[2024-05-25 16:12:19] [INFO ] [Real]Absence check using 19 positive place invariants in 12 ms returned sat
[2024-05-25 16:12:19] [INFO ] [Real]Absence check using 19 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-25 16:12:20] [INFO ] [Real]Absence check using state equation in 93 ms returned sat
[2024-05-25 16:12:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:12:20] [INFO ] [Nat]Absence check using 19 positive place invariants in 10 ms returned sat
[2024-05-25 16:12:20] [INFO ] [Nat]Absence check using 19 positive and 2 generalized place invariants in 3 ms returned sat
[2024-05-25 16:12:20] [INFO ] [Nat]Absence check using state equation in 108 ms returned sat
[2024-05-25 16:12:20] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-05-25 16:12:20] [INFO ] [Nat]Added 67 Read/Feed constraints in 18 ms returned sat
[2024-05-25 16:12:20] [INFO ] Deduced a trap composed of 3 places in 62 ms of which 1 ms to minimize.
[2024-05-25 16:12:20] [INFO ] Deduced a trap composed of 5 places in 65 ms of which 2 ms to minimize.
[2024-05-25 16:12:20] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 2 ms to minimize.
[2024-05-25 16:12:20] [INFO ] Deduced a trap composed of 7 places in 63 ms of which 2 ms to minimize.
[2024-05-25 16:12:20] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 1 ms to minimize.
[2024-05-25 16:12:20] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 2 ms to minimize.
[2024-05-25 16:12:20] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 469 ms
[2024-05-25 16:12:20] [INFO ] Computed and/alt/rep : 95/219/95 causal constraints (skipped 0 transitions) in 13 ms.
[2024-05-25 16:12:21] [INFO ] Deduced a trap composed of 5 places in 47 ms of which 1 ms to minimize.
[2024-05-25 16:12:21] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 2 ms to minimize.
[2024-05-25 16:12:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 136 ms
[2024-05-25 16:12:21] [INFO ] Added : 92 causal constraints over 19 iterations in 489 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2552 reset in 191 ms.
Product exploration explored 100000 steps with 2559 reset in 223 ms.
Built C files in :
/tmp/ltsmin4705810282323207381
[2024-05-25 16:12:21] [INFO ] Computing symmetric may disable matrix : 97 transitions.
[2024-05-25 16:12:21] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 16:12:21] [INFO ] Computing symmetric may enable matrix : 97 transitions.
[2024-05-25 16:12:21] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 16:12:21] [INFO ] Computing Do-Not-Accords matrix : 97 transitions.
[2024-05-25 16:12:21] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 16:12:21] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4705810282323207381
Running compilation step : cd /tmp/ltsmin4705810282323207381;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 585 ms.
Running link step : cd /tmp/ltsmin4705810282323207381;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin4705810282323207381;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased6310887256414659406.hoa' '--buchi-type=spotba'
LTSmin run took 420 ms.
FORMULA ParamProductionCell-PT-3-LTLFireability-06 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ParamProductionCell-PT-3-LTLFireability-06 finished in 25993 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||G((F(p0)&&F(p1))))))'
Support contains 4 out of 195 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 195/195 places, 197/197 transitions.
Applied a total of 0 rules in 3 ms. Remains 195 /195 variables (removed 0) and now considering 197/197 (removed 0) transitions.
// Phase 1: matrix 197 rows 195 cols
[2024-05-25 16:12:22] [INFO ] Computed 28 invariants in 1 ms
[2024-05-25 16:12:23] [INFO ] Implicit Places using invariants in 267 ms returned [15, 37, 64, 65, 140, 172]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 269 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 189/195 places, 197/197 transitions.
Applied a total of 0 rules in 3 ms. Remains 189 /189 variables (removed 0) and now considering 197/197 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 275 ms. Remains : 189/195 places, 197/197 transitions.
Stuttering acceptance computed with spot in 221 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ParamProductionCell-PT-3-LTLFireability-10
Product exploration explored 100000 steps with 366 reset in 187 ms.
Stack based approach found an accepted trace after 2040 steps with 7 reset with depth 298 and stack size 298 in 5 ms.
FORMULA ParamProductionCell-PT-3-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property ParamProductionCell-PT-3-LTLFireability-10 finished in 715 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(G(p0))&&(p1||X(p2)))))'
Support contains 7 out of 195 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 195/195 places, 197/197 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 194 transition count 196
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 194 transition count 196
Applied a total of 2 rules in 6 ms. Remains 194 /195 variables (removed 1) and now considering 196/197 (removed 1) transitions.
// Phase 1: matrix 196 rows 194 cols
[2024-05-25 16:12:23] [INFO ] Computed 28 invariants in 1 ms
[2024-05-25 16:12:23] [INFO ] Implicit Places using invariants in 207 ms returned [15, 37, 64, 65, 84, 139, 171]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 215 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 187/195 places, 196/197 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 185 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 185 transition count 194
Applied a total of 4 rules in 6 ms. Remains 185 /187 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 185 cols
[2024-05-25 16:12:23] [INFO ] Computed 21 invariants in 2 ms
[2024-05-25 16:12:23] [INFO ] Implicit Places using invariants in 165 ms returned []
[2024-05-25 16:12:23] [INFO ] Invariant cache hit.
[2024-05-25 16:12:24] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-25 16:12:24] [INFO ] Implicit Places using invariants and state equation in 431 ms returned []
Implicit Place search using SMT with State Equation took 598 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 185/195 places, 194/197 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 825 ms. Remains : 185/195 places, 194/197 transitions.
Stuttering acceptance computed with spot in 233 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ParamProductionCell-PT-3-LTLFireability-12
Product exploration explored 100000 steps with 0 reset in 210 ms.
Stack based approach found an accepted trace after 452 steps with 0 reset with depth 453 and stack size 453 in 2 ms.
FORMULA ParamProductionCell-PT-3-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property ParamProductionCell-PT-3-LTLFireability-12 finished in 1297 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))&&(!p1 U p2)))'
Support contains 9 out of 195 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 195/195 places, 197/197 transitions.
Applied a total of 0 rules in 3 ms. Remains 195 /195 variables (removed 0) and now considering 197/197 (removed 0) transitions.
// Phase 1: matrix 197 rows 195 cols
[2024-05-25 16:12:24] [INFO ] Computed 28 invariants in 1 ms
[2024-05-25 16:12:25] [INFO ] Implicit Places using invariants in 244 ms returned [15, 37, 64, 140, 172]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 246 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 190/195 places, 197/197 transitions.
Applied a total of 0 rules in 3 ms. Remains 190 /190 variables (removed 0) and now considering 197/197 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 252 ms. Remains : 190/195 places, 197/197 transitions.
Stuttering acceptance computed with spot in 151 ms :[(NOT p0), true, (OR (NOT p0) (NOT p2)), (OR (NOT p2) (NOT p0))]
Running random walk in product with property : ParamProductionCell-PT-3-LTLFireability-13
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ParamProductionCell-PT-3-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-3-LTLFireability-13 finished in 427 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 195 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 195/195 places, 197/197 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 194 transition count 196
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 194 transition count 196
Applied a total of 2 rules in 6 ms. Remains 194 /195 variables (removed 1) and now considering 196/197 (removed 1) transitions.
// Phase 1: matrix 196 rows 194 cols
[2024-05-25 16:12:25] [INFO ] Computed 28 invariants in 1 ms
[2024-05-25 16:12:25] [INFO ] Implicit Places using invariants in 212 ms returned [15, 37, 64, 65, 84, 171, 175]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 215 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 187/195 places, 196/197 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 185 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 185 transition count 194
Applied a total of 4 rules in 6 ms. Remains 185 /187 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 185 cols
[2024-05-25 16:12:25] [INFO ] Computed 21 invariants in 2 ms
[2024-05-25 16:12:25] [INFO ] Implicit Places using invariants in 194 ms returned []
[2024-05-25 16:12:25] [INFO ] Invariant cache hit.
[2024-05-25 16:12:25] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-25 16:12:26] [INFO ] Implicit Places using invariants and state equation in 492 ms returned []
Implicit Place search using SMT with State Equation took 688 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 185/195 places, 194/197 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 915 ms. Remains : 185/195 places, 194/197 transitions.
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-3-LTLFireability-15
Product exploration explored 100000 steps with 2389 reset in 179 ms.
Product exploration explored 100000 steps with 2389 reset in 218 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 99 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 164 steps (0 resets) in 4 ms. (32 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 133 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
[2024-05-25 16:12:27] [INFO ] Invariant cache hit.
[2024-05-25 16:12:27] [INFO ] [Real]Absence check using 18 positive place invariants in 14 ms returned sat
[2024-05-25 16:12:27] [INFO ] [Real]Absence check using 18 positive and 3 generalized place invariants in 6 ms returned sat
[2024-05-25 16:12:27] [INFO ] [Real]Absence check using state equation in 283 ms returned sat
[2024-05-25 16:12:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:12:27] [INFO ] [Nat]Absence check using 18 positive place invariants in 14 ms returned sat
[2024-05-25 16:12:27] [INFO ] [Nat]Absence check using 18 positive and 3 generalized place invariants in 5 ms returned sat
[2024-05-25 16:12:28] [INFO ] [Nat]Absence check using state equation in 488 ms returned sat
[2024-05-25 16:12:28] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-25 16:12:28] [INFO ] [Nat]Added 68 Read/Feed constraints in 18 ms returned sat
[2024-05-25 16:12:28] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 2 ms to minimize.
[2024-05-25 16:12:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 84 ms
[2024-05-25 16:12:28] [INFO ] Computed and/alt/rep : 191/317/191 causal constraints (skipped 0 transitions) in 15 ms.
[2024-05-25 16:12:29] [INFO ] Deduced a trap composed of 27 places in 80 ms of which 2 ms to minimize.
[2024-05-25 16:12:29] [INFO ] Deduced a trap composed of 7 places in 76 ms of which 2 ms to minimize.
[2024-05-25 16:12:29] [INFO ] Deduced a trap composed of 6 places in 77 ms of which 3 ms to minimize.
[2024-05-25 16:12:30] [INFO ] Deduced a trap composed of 12 places in 98 ms of which 3 ms to minimize.
[2024-05-25 16:12:30] [INFO ] Deduced a trap composed of 19 places in 86 ms of which 2 ms to minimize.
[2024-05-25 16:12:30] [INFO ] Deduced a trap composed of 40 places in 85 ms of which 3 ms to minimize.
[2024-05-25 16:12:30] [INFO ] Deduced a trap composed of 61 places in 80 ms of which 1 ms to minimize.
[2024-05-25 16:12:30] [INFO ] Deduced a trap composed of 5 places in 54 ms of which 2 ms to minimize.
[2024-05-25 16:12:30] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
[2024-05-25 16:12:30] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 999 ms
[2024-05-25 16:12:30] [INFO ] Added : 186 causal constraints over 38 iterations in 2065 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 185 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 185/185 places, 194/194 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 39 place count 185 transition count 155
Reduce places removed 39 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 41 rules applied. Total rules applied 80 place count 146 transition count 153
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 82 place count 144 transition count 153
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 82 place count 144 transition count 141
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 106 place count 132 transition count 141
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 84 rules applied. Total rules applied 190 place count 90 transition count 99
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 192 place count 89 transition count 98
Applied a total of 192 rules in 16 ms. Remains 89 /185 variables (removed 96) and now considering 98/194 (removed 96) transitions.
// Phase 1: matrix 98 rows 89 cols
[2024-05-25 16:12:30] [INFO ] Computed 21 invariants in 1 ms
[2024-05-25 16:12:30] [INFO ] Implicit Places using invariants in 147 ms returned []
[2024-05-25 16:12:30] [INFO ] Invariant cache hit.
[2024-05-25 16:12:30] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-05-25 16:12:31] [INFO ] Implicit Places using invariants and state equation in 245 ms returned []
Implicit Place search using SMT with State Equation took 394 ms to find 0 implicit places.
[2024-05-25 16:12:31] [INFO ] Redundant transitions in 3 ms returned []
Running 96 sub problems to find dead transitions.
[2024-05-25 16:12:31] [INFO ] Invariant cache hit.
[2024-05-25 16:12:31] [INFO ] State equation strengthened by 67 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-25 16:12:31] [INFO ] Deduced a trap composed of 5 places in 54 ms of which 1 ms to minimize.
[2024-05-25 16:12:31] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 1 ms to minimize.
[2024-05-25 16:12:31] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 2 ms to minimize.
[2024-05-25 16:12:31] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 1 ms to minimize.
[2024-05-25 16:12:31] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
[2024-05-25 16:12:31] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 2 ms to minimize.
[2024-05-25 16:12:31] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 2 ms to minimize.
[2024-05-25 16:12:31] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2024-05-25 16:12:32] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-05-25 16:12:32] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 1 ms to minimize.
[2024-05-25 16:12:32] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 2 ms to minimize.
[2024-05-25 16:12:32] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 1 ms to minimize.
[2024-05-25 16:12:32] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 2 ms to minimize.
[2024-05-25 16:12:32] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 1 ms to minimize.
[2024-05-25 16:12:32] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 1 ms to minimize.
[2024-05-25 16:12:32] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
[2024-05-25 16:12:32] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 1 ms to minimize.
[2024-05-25 16:12:32] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 1 ms to minimize.
[2024-05-25 16:12:32] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 1 ms to minimize.
[2024-05-25 16:12:32] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-25 16:12:32] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 1 ms to minimize.
[2024-05-25 16:12:32] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2024-05-25 16:12:32] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-05-25 16:12:32] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
[2024-05-25 16:12:32] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
[2024-05-25 16:12:32] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2024-05-25 16:12:32] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
[2024-05-25 16:12:33] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 2 ms to minimize.
[2024-05-25 16:12:33] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 2 ms to minimize.
[2024-05-25 16:12:33] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2024-05-25 16:12:33] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 2 ms to minimize.
[2024-05-25 16:12:33] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 1 ms to minimize.
[2024-05-25 16:12:33] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
[2024-05-25 16:12:33] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-05-25 16:12:33] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 2 ms to minimize.
[2024-05-25 16:12:33] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2024-05-25 16:12:33] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-05-25 16:12:33] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2024-05-25 16:12:33] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 19/58 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-25 16:12:34] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (OVERLAPS) 1/88 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-25 16:12:35] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 1 ms to minimize.
[2024-05-25 16:12:35] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 0 ms to minimize.
[2024-05-25 16:12:35] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/88 variables, 3/63 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/88 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 9 (OVERLAPS) 1/89 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/89 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 11 (OVERLAPS) 98/187 variables, 89/153 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/187 variables, 67/220 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/187 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 14 (OVERLAPS) 0/187 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Real declared 187/187 variables, and 220 constraints, problems are : Problem set: 0 solved, 96 unsolved in 7954 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 89/89 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 43/43 constraints]
Escalating to Integer solving :Problem set: 0 solved, 96 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 42/61 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (OVERLAPS) 1/88 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (OVERLAPS) 1/89 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/89 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 9 (OVERLAPS) 98/187 variables, 89/153 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/187 variables, 67/220 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/187 variables, 96/316 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/187 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 13 (OVERLAPS) 0/187 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Int declared 187/187 variables, and 316 constraints, problems are : Problem set: 0 solved, 96 unsolved in 5822 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 89/89 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 43/43 constraints]
After SMT, in 13810ms problems are : Problem set: 0 solved, 96 unsolved
Search for dead transitions found 0 dead transitions in 13813ms
Starting structural reductions in SI_LTL mode, iteration 1 : 89/185 places, 98/194 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 14235 ms. Remains : 89/185 places, 98/194 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 91 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 80 steps (0 resets) in 5 ms. (13 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 114 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 161 ms :[(NOT p0), (NOT p0)]
[2024-05-25 16:12:45] [INFO ] Invariant cache hit.
[2024-05-25 16:12:45] [INFO ] [Real]Absence check using 18 positive place invariants in 11 ms returned sat
[2024-05-25 16:12:45] [INFO ] [Real]Absence check using 18 positive and 3 generalized place invariants in 4 ms returned sat
[2024-05-25 16:12:45] [INFO ] [Real]Absence check using state equation in 116 ms returned sat
[2024-05-25 16:12:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:12:45] [INFO ] [Nat]Absence check using 18 positive place invariants in 11 ms returned sat
[2024-05-25 16:12:45] [INFO ] [Nat]Absence check using 18 positive and 3 generalized place invariants in 4 ms returned sat
[2024-05-25 16:12:45] [INFO ] [Nat]Absence check using state equation in 109 ms returned sat
[2024-05-25 16:12:45] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-05-25 16:12:45] [INFO ] [Nat]Added 67 Read/Feed constraints in 21 ms returned sat
[2024-05-25 16:12:46] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 2 ms to minimize.
[2024-05-25 16:12:46] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 1 ms to minimize.
[2024-05-25 16:12:46] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 1 ms to minimize.
[2024-05-25 16:12:46] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 1 ms to minimize.
[2024-05-25 16:12:46] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-05-25 16:12:46] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 359 ms
[2024-05-25 16:12:46] [INFO ] Computed and/alt/rep : 96/228/96 causal constraints (skipped 0 transitions) in 14 ms.
[2024-05-25 16:12:46] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 2 ms to minimize.
[2024-05-25 16:12:46] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 2 ms to minimize.
[2024-05-25 16:12:46] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 1 ms to minimize.
[2024-05-25 16:12:46] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 236 ms
[2024-05-25 16:12:46] [INFO ] Added : 80 causal constraints over 16 iterations in 545 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 4804 reset in 187 ms.
Product exploration explored 100000 steps with 4800 reset in 381 ms.
Built C files in :
/tmp/ltsmin13987171080869588880
[2024-05-25 16:12:47] [INFO ] Computing symmetric may disable matrix : 98 transitions.
[2024-05-25 16:12:47] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 16:12:47] [INFO ] Computing symmetric may enable matrix : 98 transitions.
[2024-05-25 16:12:47] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 16:12:47] [INFO ] Computing Do-Not-Accords matrix : 98 transitions.
[2024-05-25 16:12:47] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 16:12:47] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13987171080869588880
Running compilation step : cd /tmp/ltsmin13987171080869588880;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 493 ms.
Running link step : cd /tmp/ltsmin13987171080869588880;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin13987171080869588880;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased9849300548307581743.hoa' '--buchi-type=spotba'
LTSmin run took 139 ms.
FORMULA ParamProductionCell-PT-3-LTLFireability-15 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ParamProductionCell-PT-3-LTLFireability-15 finished in 22944 ms.
All properties solved by simple procedures.
Total runtime 129151 ms.

BK_STOP 1716653568289

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is ParamProductionCell-PT-3, 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 r268-smll-171654406800036"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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