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.r285-smll-171654421800023.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 gold2023
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 r285-smll-171654421800023
=====================================================================

--------------------
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 1716840713301

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ParamProductionCell-PT-3
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-27 20:11:55] [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-27 20:11:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 20:11:56] [INFO ] Load time of PNML (sax parser for PT used): 121 ms
[2024-05-27 20:11:56] [INFO ] Transformed 231 places.
[2024-05-27 20:11:56] [INFO ] Transformed 202 transitions.
[2024-05-27 20:11:56] [INFO ] Found NUPN structural information;
[2024-05-27 20:11:56] [INFO ] Parsed PT model containing 231 places and 202 transitions and 846 arcs in 232 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 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 54 ms. Remains 226 /231 variables (removed 5) and now considering 197/202 (removed 5) transitions.
// Phase 1: matrix 197 rows 226 cols
[2024-05-27 20:11:56] [INFO ] Computed 59 invariants in 19 ms
[2024-05-27 20:11:57] [INFO ] Implicit Places using invariants in 548 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 590 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 14 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 660 ms. Remains : 195/231 places, 197/202 transitions.
Support contains 36 out of 195 places after structural reductions.
[2024-05-27 20:11:57] [INFO ] Flatten gal took : 59 ms
[2024-05-27 20:11:57] [INFO ] Flatten gal took : 25 ms
[2024-05-27 20:11:57] [INFO ] Input system was already deterministic with 197 transitions.
Finished random walk after 683 steps, including 0 resets, run visited all 18 properties in 124 ms. (steps per millisecond=5 )
Parikh walk visited 0 properties in 1 ms.
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.202304061127/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 18 ms. Remains 194 /195 variables (removed 1) and now considering 196/197 (removed 1) transitions.
// Phase 1: matrix 196 rows 194 cols
[2024-05-27 20:11:57] [INFO ] Computed 28 invariants in 4 ms
[2024-05-27 20:11:58] [INFO ] Implicit Places using invariants in 218 ms returned [15, 64, 65, 84, 139, 171, 175]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 220 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-27 20:11:58] [INFO ] Computed 21 invariants in 3 ms
[2024-05-27 20:11:58] [INFO ] Implicit Places using invariants in 158 ms returned []
[2024-05-27 20:11:58] [INFO ] Invariant cache hit.
[2024-05-27 20:11:58] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-27 20:11:58] [INFO ] Implicit Places using invariants and state equation in 341 ms returned []
Implicit Place search using SMT with State Equation took 503 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 752 ms. Remains : 185/195 places, 194/197 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 470 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 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 5}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=2 dest: 6}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) p1 p2), acceptance={0} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) p2), acceptance={} source=4 dest: 6}], [{ cond=(NOT p0), acceptance={0} source=5 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 6}], [{ cond=(NOT p1), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(OR (EQ s36 0) (EQ s39 0)), p1:(AND (EQ s84 1) (EQ s148 1)), p2:(AND (EQ s85 1) (EQ s141 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 457 ms.
Product exploration explored 100000 steps with 33333 reset in 334 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 p1)), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1 p2))), (X (AND p0 (NOT p1))), (X p0), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (AND p0 (NOT p1)))), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 13 factoid took 27 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 2143 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/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-27 20:12:00] [INFO ] Computed 28 invariants in 3 ms
[2024-05-27 20:12:00] [INFO ] Implicit Places using invariants in 171 ms returned [15, 37, 64, 65, 84, 139, 171, 175]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 173 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 7 ms. Remains 184 /186 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 184 cols
[2024-05-27 20:12:00] [INFO ] Computed 20 invariants in 2 ms
[2024-05-27 20:12:00] [INFO ] Implicit Places using invariants in 114 ms returned []
[2024-05-27 20:12:00] [INFO ] Invariant cache hit.
[2024-05-27 20:12:00] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-27 20:12:00] [INFO ] Implicit Places using invariants and state equation in 332 ms returned []
Implicit Place search using SMT with State Equation took 449 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 639 ms. Remains : 184/195 places, 194/197 transitions.
Stuttering acceptance computed with spot in 82 ms :[(NOT p1), (AND (NOT p1) p0)]
Running random walk in product with property : ParamProductionCell-PT-3-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=p1, acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 0}, { cond=(AND p1 p0), acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(AND (EQ s83 1) (EQ s121 1)), p0:(AND (EQ s79 1) (EQ s98 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 371 reset in 175 ms.
Stack based approach found an accepted trace after 496 steps with 1 reset with depth 241 and stack size 241 in 2 ms.
FORMULA ParamProductionCell-PT-3-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property ParamProductionCell-PT-3-LTLFireability-01 finished in 918 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/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-27 20:12:00] [INFO ] Computed 28 invariants in 3 ms
[2024-05-27 20:12:01] [INFO ] Implicit Places using invariants in 187 ms returned [15, 37, 65, 84, 139, 175]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 189 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-27 20:12:01] [INFO ] Computed 22 invariants in 2 ms
[2024-05-27 20:12:01] [INFO ] Implicit Places using invariants in 141 ms returned []
[2024-05-27 20:12:01] [INFO ] Invariant cache hit.
[2024-05-27 20:12:01] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-27 20:12:01] [INFO ] Implicit Places using invariants and state equation in 359 ms returned []
Implicit Place search using SMT with State Equation took 502 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 705 ms. Remains : 186/195 places, 194/197 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-3-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s164 1) (EQ s170 1) (OR (NEQ s60 1) (NEQ s62 1) (NEQ s69 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 799 reset in 135 ms.
Product exploration explored 100000 steps with 800 reset in 242 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 198 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Finished random walk after 112 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=56 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 104 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
[2024-05-27 20:12:02] [INFO ] Invariant cache hit.
[2024-05-27 20:12:02] [INFO ] [Real]Absence check using 18 positive place invariants in 10 ms returned sat
[2024-05-27 20:12:02] [INFO ] [Real]Absence check using 18 positive and 4 generalized place invariants in 5 ms returned sat
[2024-05-27 20:12:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 20:12:02] [INFO ] [Real]Absence check using state equation in 193 ms returned sat
[2024-05-27 20:12:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 20:12:03] [INFO ] [Nat]Absence check using 18 positive place invariants in 9 ms returned sat
[2024-05-27 20:12:03] [INFO ] [Nat]Absence check using 18 positive and 4 generalized place invariants in 4 ms returned sat
[2024-05-27 20:12:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 20:12:03] [INFO ] [Nat]Absence check using state equation in 195 ms returned sat
[2024-05-27 20:12:03] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-27 20:12:03] [INFO ] [Nat]Added 68 Read/Feed constraints in 28 ms returned sat
[2024-05-27 20:12:03] [INFO ] Deduced a trap composed of 8 places in 95 ms of which 4 ms to minimize.
[2024-05-27 20:12:03] [INFO ] Deduced a trap composed of 7 places in 159 ms of which 2 ms to minimize.
[2024-05-27 20:12:03] [INFO ] Deduced a trap composed of 7 places in 117 ms of which 1 ms to minimize.
[2024-05-27 20:12:03] [INFO ] Deduced a trap composed of 7 places in 74 ms of which 1 ms to minimize.
[2024-05-27 20:12:04] [INFO ] Deduced a trap composed of 23 places in 79 ms of which 1 ms to minimize.
[2024-05-27 20:12:04] [INFO ] Deduced a trap composed of 26 places in 67 ms of which 1 ms to minimize.
[2024-05-27 20:12:04] [INFO ] Deduced a trap composed of 21 places in 69 ms of which 0 ms to minimize.
[2024-05-27 20:12:04] [INFO ] Deduced a trap composed of 29 places in 78 ms of which 1 ms to minimize.
[2024-05-27 20:12:04] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 1 ms to minimize.
[2024-05-27 20:12:04] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 1 ms to minimize.
[2024-05-27 20:12:04] [INFO ] Deduced a trap composed of 6 places in 83 ms of which 1 ms to minimize.
[2024-05-27 20:12:04] [INFO ] Deduced a trap composed of 7 places in 62 ms of which 1 ms to minimize.
[2024-05-27 20:12:04] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 0 ms to minimize.
[2024-05-27 20:12:04] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 1 ms to minimize.
[2024-05-27 20:12:04] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 1436 ms
[2024-05-27 20:12:04] [INFO ] Computed and/alt/rep : 191/319/191 causal constraints (skipped 0 transitions) in 14 ms.
[2024-05-27 20:12:05] [INFO ] Added : 169 causal constraints over 34 iterations in 838 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 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 1 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 42 ms. Remains 91 /186 variables (removed 95) and now considering 99/194 (removed 95) transitions.
// Phase 1: matrix 99 rows 91 cols
[2024-05-27 20:12:05] [INFO ] Computed 22 invariants in 1 ms
[2024-05-27 20:12:05] [INFO ] Implicit Places using invariants in 127 ms returned []
[2024-05-27 20:12:05] [INFO ] Invariant cache hit.
[2024-05-27 20:12:05] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-05-27 20:12:06] [INFO ] Implicit Places using invariants and state equation in 240 ms returned []
Implicit Place search using SMT with State Equation took 370 ms to find 0 implicit places.
[2024-05-27 20:12:06] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-27 20:12:06] [INFO ] Invariant cache hit.
[2024-05-27 20:12:06] [INFO ] Dead Transitions using invariants and state equation in 173 ms found 0 transitions.
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 601 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 83 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Finished random walk after 64 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=64 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 103 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
[2024-05-27 20:12:06] [INFO ] Invariant cache hit.
[2024-05-27 20:12:06] [INFO ] [Real]Absence check using 18 positive place invariants in 10 ms returned sat
[2024-05-27 20:12:06] [INFO ] [Real]Absence check using 18 positive and 4 generalized place invariants in 2 ms returned sat
[2024-05-27 20:12:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 20:12:06] [INFO ] [Real]Absence check using state equation in 66 ms returned sat
[2024-05-27 20:12:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 20:12:06] [INFO ] [Nat]Absence check using 18 positive place invariants in 8 ms returned sat
[2024-05-27 20:12:06] [INFO ] [Nat]Absence check using 18 positive and 4 generalized place invariants in 6 ms returned sat
[2024-05-27 20:12:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 20:12:06] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2024-05-27 20:12:07] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-05-27 20:12:07] [INFO ] [Nat]Added 67 Read/Feed constraints in 13 ms returned sat
[2024-05-27 20:12:07] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 1 ms to minimize.
[2024-05-27 20:12:07] [INFO ] Deduced a trap composed of 5 places in 50 ms of which 1 ms to minimize.
[2024-05-27 20:12:07] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 1 ms to minimize.
[2024-05-27 20:12:07] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 0 ms to minimize.
[2024-05-27 20:12:07] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 1 ms to minimize.
[2024-05-27 20:12:07] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
[2024-05-27 20:12:07] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
[2024-05-27 20:12:07] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2024-05-27 20:12:07] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 1 ms to minimize.
[2024-05-27 20:12:07] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-27 20:12:07] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 0 ms to minimize.
[2024-05-27 20:12:07] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
[2024-05-27 20:12:07] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 0 ms to minimize.
[2024-05-27 20:12:07] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 610 ms
[2024-05-27 20:12:07] [INFO ] Computed and/alt/rep : 97/231/97 causal constraints (skipped 0 transitions) in 8 ms.
[2024-05-27 20:12:07] [INFO ] Added : 88 causal constraints over 18 iterations in 250 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 64 ms :[(NOT p0)]
Product exploration explored 100000 steps with 1526 reset in 157 ms.
Product exploration explored 100000 steps with 1536 reset in 165 ms.
Built C files in :
/tmp/ltsmin713367060434902028
[2024-05-27 20:12:08] [INFO ] Computing symmetric may disable matrix : 99 transitions.
[2024-05-27 20:12:08] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 20:12:08] [INFO ] Computing symmetric may enable matrix : 99 transitions.
[2024-05-27 20:12:08] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 20:12:08] [INFO ] Computing Do-Not-Accords matrix : 99 transitions.
[2024-05-27 20:12:08] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 20:12:08] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin713367060434902028
Running compilation step : cd /tmp/ltsmin713367060434902028;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 477 ms.
Running link step : cd /tmp/ltsmin713367060434902028;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin713367060434902028;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased990722744677580674.hoa' '--buchi-type=spotba'
LTSmin run took 1138 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 9081 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/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 9 ms. Remains 194 /195 variables (removed 1) and now considering 196/197 (removed 1) transitions.
// Phase 1: matrix 196 rows 194 cols
[2024-05-27 20:12:10] [INFO ] Computed 28 invariants in 2 ms
[2024-05-27 20:12:10] [INFO ] Implicit Places using invariants in 179 ms returned [15, 64, 65, 84, 139, 171, 175]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 181 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-27 20:12:10] [INFO ] Computed 21 invariants in 2 ms
[2024-05-27 20:12:10] [INFO ] Implicit Places using invariants in 114 ms returned []
[2024-05-27 20:12:10] [INFO ] Invariant cache hit.
[2024-05-27 20:12:10] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-27 20:12:10] [INFO ] Implicit Places using invariants and state equation in 375 ms returned []
Implicit Place search using SMT with State Equation took 493 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 693 ms. Remains : 185/195 places, 194/197 transitions.
Stuttering acceptance computed with spot in 165 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 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=3, aps=[p0:(AND (EQ s34 1) (EQ s36 1) (EQ s45 1)), p1:(AND (EQ s84 1) (EQ s148 1)), p2:(EQ s29 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 1617 reset in 172 ms.
Product exploration explored 100000 steps with 1611 reset in 162 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 (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), true, (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p0))), (X (X (NOT (AND p1 (NOT p2)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 114 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 74 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Finished random walk after 541 steps, including 0 resets, run visited all 2 properties in 5 ms. (steps per millisecond=108 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), true, (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p0))), (X (X (NOT (AND p1 (NOT p2)))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p2)))), (F (AND p1 (NOT p2)))]
Knowledge based reduction with 8 factoid took 170 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 75 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
[2024-05-27 20:12:11] [INFO ] Invariant cache hit.
[2024-05-27 20:12:11] [INFO ] [Real]Absence check using 20 positive place invariants in 11 ms returned sat
[2024-05-27 20:12:11] [INFO ] [Real]Absence check using 20 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-27 20:12:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 20:12:12] [INFO ] [Real]Absence check using state equation in 185 ms returned sat
[2024-05-27 20:12:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 20:12:12] [INFO ] [Nat]Absence check using 20 positive place invariants in 15 ms returned sat
[2024-05-27 20:12:12] [INFO ] [Nat]Absence check using 20 positive and 1 generalized place invariants in 3 ms returned sat
[2024-05-27 20:12:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 20:12:12] [INFO ] [Nat]Absence check using state equation in 171 ms returned sat
[2024-05-27 20:12:12] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-27 20:12:12] [INFO ] [Nat]Added 68 Read/Feed constraints in 14 ms returned sat
[2024-05-27 20:12:12] [INFO ] Deduced a trap composed of 5 places in 68 ms of which 1 ms to minimize.
[2024-05-27 20:12:12] [INFO ] Deduced a trap composed of 7 places in 72 ms of which 0 ms to minimize.
[2024-05-27 20:12:12] [INFO ] Deduced a trap composed of 10 places in 83 ms of which 0 ms to minimize.
[2024-05-27 20:12:12] [INFO ] Deduced a trap composed of 11 places in 82 ms of which 1 ms to minimize.
[2024-05-27 20:12:12] [INFO ] Deduced a trap composed of 7 places in 85 ms of which 1 ms to minimize.
[2024-05-27 20:12:13] [INFO ] Deduced a trap composed of 26 places in 84 ms of which 1 ms to minimize.
[2024-05-27 20:12:13] [INFO ] Deduced a trap composed of 7 places in 70 ms of which 1 ms to minimize.
[2024-05-27 20:12:13] [INFO ] Deduced a trap composed of 12 places in 81 ms of which 4 ms to minimize.
[2024-05-27 20:12:13] [INFO ] Deduced a trap composed of 6 places in 83 ms of which 1 ms to minimize.
[2024-05-27 20:12:13] [INFO ] Deduced a trap composed of 30 places in 70 ms of which 1 ms to minimize.
[2024-05-27 20:12:13] [INFO ] Deduced a trap composed of 25 places in 74 ms of which 1 ms to minimize.
[2024-05-27 20:12:13] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 0 ms to minimize.
[2024-05-27 20:12:13] [INFO ] Deduced a trap composed of 7 places in 74 ms of which 0 ms to minimize.
[2024-05-27 20:12:13] [INFO ] Deduced a trap composed of 41 places in 60 ms of which 0 ms to minimize.
[2024-05-27 20:12:13] [INFO ] Deduced a trap composed of 7 places in 80 ms of which 0 ms to minimize.
[2024-05-27 20:12:13] [INFO ] Deduced a trap composed of 39 places in 74 ms of which 0 ms to minimize.
[2024-05-27 20:12:14] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 1 ms to minimize.
[2024-05-27 20:12:14] [INFO ] Deduced a trap composed of 23 places in 77 ms of which 0 ms to minimize.
[2024-05-27 20:12:14] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 1 ms to minimize.
[2024-05-27 20:12:14] [INFO ] Deduced a trap composed of 35 places in 72 ms of which 1 ms to minimize.
[2024-05-27 20:12:14] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 1947 ms
[2024-05-27 20:12:14] [INFO ] Computed and/alt/rep : 191/317/191 causal constraints (skipped 0 transitions) in 17 ms.
[2024-05-27 20:12:15] [INFO ] Deduced a trap composed of 40 places in 51 ms of which 1 ms to minimize.
[2024-05-27 20:12:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 108 ms
[2024-05-27 20:12:15] [INFO ] Added : 163 causal constraints over 33 iterations in 1085 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2))
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 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 0 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 1 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 28 ms. Remains 91 /185 variables (removed 94) and now considering 100/194 (removed 94) transitions.
// Phase 1: matrix 100 rows 91 cols
[2024-05-27 20:12:15] [INFO ] Computed 21 invariants in 1 ms
[2024-05-27 20:12:15] [INFO ] Implicit Places using invariants in 118 ms returned []
[2024-05-27 20:12:15] [INFO ] Invariant cache hit.
[2024-05-27 20:12:15] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-05-27 20:12:15] [INFO ] Implicit Places using invariants and state equation in 215 ms returned []
Implicit Place search using SMT with State Equation took 334 ms to find 0 implicit places.
[2024-05-27 20:12:15] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-27 20:12:15] [INFO ] Invariant cache hit.
[2024-05-27 20:12:15] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
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 451 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 p1) (NOT p2)), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 108 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 77 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Finished random walk after 109 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=54 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p2)), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 (NOT p2)))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p2)))), (F (AND p1 (NOT p2)))]
Knowledge based reduction with 5 factoid took 149 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 75 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
[2024-05-27 20:12:16] [INFO ] Invariant cache hit.
[2024-05-27 20:12:16] [INFO ] [Real]Absence check using 19 positive place invariants in 9 ms returned sat
[2024-05-27 20:12:16] [INFO ] [Real]Absence check using 19 positive and 2 generalized place invariants in 3 ms returned sat
[2024-05-27 20:12:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 20:12:16] [INFO ] [Real]Absence check using state equation in 63 ms returned sat
[2024-05-27 20:12:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 20:12:16] [INFO ] [Nat]Absence check using 19 positive place invariants in 9 ms returned sat
[2024-05-27 20:12:16] [INFO ] [Nat]Absence check using 19 positive and 2 generalized place invariants in 3 ms returned sat
[2024-05-27 20:12:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 20:12:16] [INFO ] [Nat]Absence check using state equation in 64 ms returned sat
[2024-05-27 20:12:16] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-05-27 20:12:16] [INFO ] [Nat]Added 67 Read/Feed constraints in 10 ms returned sat
[2024-05-27 20:12:16] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2024-05-27 20:12:16] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2024-05-27 20:12:16] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 0 ms to minimize.
[2024-05-27 20:12:17] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2024-05-27 20:12:17] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
[2024-05-27 20:12:17] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 0 ms to minimize.
[2024-05-27 20:12:17] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
[2024-05-27 20:12:17] [INFO ] Deduced a trap composed of 6 places in 46 ms of which 6 ms to minimize.
[2024-05-27 20:12:17] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
[2024-05-27 20:12:17] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 0 ms to minimize.
[2024-05-27 20:12:17] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 451 ms
[2024-05-27 20:12:17] [INFO ] Computed and/alt/rep : 98/230/98 causal constraints (skipped 0 transitions) in 8 ms.
[2024-05-27 20:12:17] [INFO ] Added : 86 causal constraints over 18 iterations in 220 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2))
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 2946 reset in 152 ms.
Product exploration explored 100000 steps with 2933 reset in 167 ms.
Built C files in :
/tmp/ltsmin12577379521494682659
[2024-05-27 20:12:17] [INFO ] Computing symmetric may disable matrix : 100 transitions.
[2024-05-27 20:12:17] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 20:12:17] [INFO ] Computing symmetric may enable matrix : 100 transitions.
[2024-05-27 20:12:17] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 20:12:17] [INFO ] Computing Do-Not-Accords matrix : 100 transitions.
[2024-05-27 20:12:17] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 20:12:17] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12577379521494682659
Running compilation step : cd /tmp/ltsmin12577379521494682659;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 303 ms.
Running link step : cd /tmp/ltsmin12577379521494682659;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin12577379521494682659;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased9860771296273085916.hoa' '--buchi-type=spotba'
LTSmin run took 2224 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 10497 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/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 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 0 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 0 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 21 ms. Remains 112 /195 variables (removed 83) and now considering 114/197 (removed 83) transitions.
// Phase 1: matrix 114 rows 112 cols
[2024-05-27 20:12:20] [INFO ] Computed 28 invariants in 1 ms
[2024-05-27 20:12:20] [INFO ] Implicit Places using invariants in 112 ms returned [10, 22, 37, 38, 78, 99, 101]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 113 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 105/195 places, 114/197 transitions.
Drop transitions 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 10 ms. Remains 94 /105 variables (removed 11) and now considering 103/114 (removed 11) transitions.
// Phase 1: matrix 103 rows 94 cols
[2024-05-27 20:12:20] [INFO ] Computed 21 invariants in 0 ms
[2024-05-27 20:12:20] [INFO ] Implicit Places using invariants in 108 ms returned []
[2024-05-27 20:12:20] [INFO ] Invariant cache hit.
[2024-05-27 20:12:20] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-05-27 20:12:20] [INFO ] Implicit Places using invariants and state equation in 211 ms returned []
Implicit Place search using SMT with State Equation took 321 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 465 ms. Remains : 94/195 places, 103/197 transitions.
Stuttering acceptance computed with spot in 95 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ParamProductionCell-PT-3-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (EQ s39 1) (EQ s47 1)), p0:(AND (EQ s0 1) (EQ s80 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 937 reset in 155 ms.
Product exploration explored 100000 steps with 945 reset in 170 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 (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Knowledge based reduction with 3 factoid took 185 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 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 69 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=69 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 3 factoid took 232 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 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 74 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 5 ms. Remains 94 /94 variables (removed 0) and now considering 103/103 (removed 0) transitions.
[2024-05-27 20:12:22] [INFO ] Invariant cache hit.
[2024-05-27 20:12:22] [INFO ] Implicit Places using invariants in 118 ms returned []
[2024-05-27 20:12:22] [INFO ] Invariant cache hit.
[2024-05-27 20:12:22] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-05-27 20:12:22] [INFO ] Implicit Places using invariants and state equation in 226 ms returned []
Implicit Place search using SMT with State Equation took 346 ms to find 0 implicit places.
[2024-05-27 20:12:22] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-27 20:12:22] [INFO ] Invariant cache hit.
[2024-05-27 20:12:22] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 444 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 (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 3 factoid took 182 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 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 231 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=115 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 3 factoid took 231 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 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 74 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))]
Product exploration explored 100000 steps with 941 reset in 159 ms.
Product exploration explored 100000 steps with 938 reset in 176 ms.
Built C files in :
/tmp/ltsmin5074539171948258305
[2024-05-27 20:12:23] [INFO ] Computing symmetric may disable matrix : 103 transitions.
[2024-05-27 20:12:23] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 20:12:23] [INFO ] Computing symmetric may enable matrix : 103 transitions.
[2024-05-27 20:12:23] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 20:12:23] [INFO ] Computing Do-Not-Accords matrix : 103 transitions.
[2024-05-27 20:12:23] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 20:12:23] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5074539171948258305
Running compilation step : cd /tmp/ltsmin5074539171948258305;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 312 ms.
Running link step : cd /tmp/ltsmin5074539171948258305;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin5074539171948258305;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13234290825697689243.hoa' '--buchi-type=spotba'
LTSmin run took 3745 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 7206 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/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 5 ms. Remains 194 /195 variables (removed 1) and now considering 196/197 (removed 1) transitions.
// Phase 1: matrix 196 rows 194 cols
[2024-05-27 20:12:27] [INFO ] Computed 28 invariants in 1 ms
[2024-05-27 20:12:27] [INFO ] Implicit Places using invariants in 158 ms returned [37, 64, 65, 84, 139, 171, 175]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 160 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 4 ms. Remains 185 /187 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 185 cols
[2024-05-27 20:12:27] [INFO ] Computed 21 invariants in 1 ms
[2024-05-27 20:12:27] [INFO ] Implicit Places using invariants in 108 ms returned []
[2024-05-27 20:12:28] [INFO ] Invariant cache hit.
[2024-05-27 20:12:28] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-27 20:12:28] [INFO ] Implicit Places using invariants and state equation in 344 ms returned []
Implicit Place search using SMT with State Equation took 471 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 640 ms. Remains : 185/195 places, 194/197 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-3-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s4 1) (EQ s15 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 1222 reset in 112 ms.
Product exploration explored 100000 steps with 1224 reset in 128 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 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Finished random walk after 70 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=70 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 92 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
[2024-05-27 20:12:28] [INFO ] Invariant cache hit.
[2024-05-27 20:12:29] [INFO ] [Real]Absence check using 19 positive place invariants in 8 ms returned sat
[2024-05-27 20:12:29] [INFO ] [Real]Absence check using 19 positive and 2 generalized place invariants in 3 ms returned sat
[2024-05-27 20:12:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 20:12:29] [INFO ] [Real]Absence check using state equation in 159 ms returned sat
[2024-05-27 20:12:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 20:12:29] [INFO ] [Nat]Absence check using 19 positive place invariants in 11 ms returned sat
[2024-05-27 20:12:29] [INFO ] [Nat]Absence check using 19 positive and 2 generalized place invariants in 3 ms returned sat
[2024-05-27 20:12:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 20:12:29] [INFO ] [Nat]Absence check using state equation in 172 ms returned sat
[2024-05-27 20:12:29] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-27 20:12:29] [INFO ] [Nat]Added 68 Read/Feed constraints in 17 ms returned sat
[2024-05-27 20:12:29] [INFO ] Deduced a trap composed of 5 places in 67 ms of which 1 ms to minimize.
[2024-05-27 20:12:29] [INFO ] Deduced a trap composed of 7 places in 64 ms of which 1 ms to minimize.
[2024-05-27 20:12:29] [INFO ] Deduced a trap composed of 5 places in 67 ms of which 0 ms to minimize.
[2024-05-27 20:12:29] [INFO ] Deduced a trap composed of 7 places in 64 ms of which 0 ms to minimize.
[2024-05-27 20:12:30] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 0 ms to minimize.
[2024-05-27 20:12:30] [INFO ] Deduced a trap composed of 11 places in 73 ms of which 0 ms to minimize.
[2024-05-27 20:12:30] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 1 ms to minimize.
[2024-05-27 20:12:30] [INFO ] Deduced a trap composed of 7 places in 60 ms of which 1 ms to minimize.
[2024-05-27 20:12:30] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 1 ms to minimize.
[2024-05-27 20:12:30] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 746 ms
[2024-05-27 20:12:30] [INFO ] Computed and/alt/rep : 191/309/191 causal constraints (skipped 0 transitions) in 15 ms.
[2024-05-27 20:12:30] [INFO ] Added : 91 causal constraints over 19 iterations in 384 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 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 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 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 16 ms. Remains 88 /185 variables (removed 97) and now considering 97/194 (removed 97) transitions.
// Phase 1: matrix 97 rows 88 cols
[2024-05-27 20:12:30] [INFO ] Computed 21 invariants in 0 ms
[2024-05-27 20:12:30] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-05-27 20:12:30] [INFO ] Invariant cache hit.
[2024-05-27 20:12:30] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-05-27 20:12:31] [INFO ] Implicit Places using invariants and state equation in 197 ms returned []
Implicit Place search using SMT with State Equation took 303 ms to find 0 implicit places.
[2024-05-27 20:12:31] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-27 20:12:31] [INFO ] Invariant cache hit.
[2024-05-27 20:12:31] [INFO ] Dead Transitions using invariants and state equation in 88 ms found 0 transitions.
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 418 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 75 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Finished random walk after 40 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=40 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 91 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
[2024-05-27 20:12:31] [INFO ] Invariant cache hit.
[2024-05-27 20:12:31] [INFO ] [Real]Absence check using 19 positive place invariants in 8 ms returned sat
[2024-05-27 20:12:31] [INFO ] [Real]Absence check using 19 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-27 20:12:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 20:12:31] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2024-05-27 20:12:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 20:12:31] [INFO ] [Nat]Absence check using 19 positive place invariants in 8 ms returned sat
[2024-05-27 20:12:31] [INFO ] [Nat]Absence check using 19 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-27 20:12:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 20:12:31] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2024-05-27 20:12:31] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-05-27 20:12:31] [INFO ] [Nat]Added 67 Read/Feed constraints in 19 ms returned sat
[2024-05-27 20:12:31] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2024-05-27 20:12:31] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
[2024-05-27 20:12:31] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 0 ms to minimize.
[2024-05-27 20:12:31] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 0 ms to minimize.
[2024-05-27 20:12:31] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 0 ms to minimize.
[2024-05-27 20:12:32] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 0 ms to minimize.
[2024-05-27 20:12:32] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 249 ms
[2024-05-27 20:12:32] [INFO ] Computed and/alt/rep : 95/219/95 causal constraints (skipped 0 transitions) in 7 ms.
[2024-05-27 20:12:32] [INFO ] Added : 81 causal constraints over 17 iterations in 179 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Product exploration explored 100000 steps with 2565 reset in 121 ms.
Product exploration explored 100000 steps with 2561 reset in 141 ms.
Built C files in :
/tmp/ltsmin6404766111659134265
[2024-05-27 20:12:32] [INFO ] Computing symmetric may disable matrix : 97 transitions.
[2024-05-27 20:12:32] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 20:12:32] [INFO ] Computing symmetric may enable matrix : 97 transitions.
[2024-05-27 20:12:32] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 20:12:32] [INFO ] Computing Do-Not-Accords matrix : 97 transitions.
[2024-05-27 20:12:32] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 20:12:32] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6404766111659134265
Running compilation step : cd /tmp/ltsmin6404766111659134265;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 293 ms.
Running link step : cd /tmp/ltsmin6404766111659134265;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin6404766111659134265;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased548647184837806785.hoa' '--buchi-type=spotba'
LTSmin run took 201 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 5356 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/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 2 ms. Remains 195 /195 variables (removed 0) and now considering 197/197 (removed 0) transitions.
// Phase 1: matrix 197 rows 195 cols
[2024-05-27 20:12:33] [INFO ] Computed 28 invariants in 1 ms
[2024-05-27 20:12:33] [INFO ] Implicit Places using invariants in 167 ms returned [15, 37, 64, 65, 140, 172]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 169 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 1 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 174 ms. Remains : 189/195 places, 197/197 transitions.
Stuttering acceptance computed with spot in 179 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 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 2}, { cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s80 1) (EQ s90 1)), p1:(OR (EQ s170 0) (EQ s175 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 383 reset in 115 ms.
Stack based approach found an accepted trace after 13546 steps with 46 reset with depth 293 and stack size 293 in 17 ms.
FORMULA ParamProductionCell-PT-3-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property ParamProductionCell-PT-3-LTLFireability-10 finished in 504 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/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 4 ms. Remains 194 /195 variables (removed 1) and now considering 196/197 (removed 1) transitions.
// Phase 1: matrix 196 rows 194 cols
[2024-05-27 20:12:33] [INFO ] Computed 28 invariants in 3 ms
[2024-05-27 20:12:33] [INFO ] Implicit Places using invariants in 150 ms returned [15, 37, 64, 65, 84, 139, 171]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 152 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 4 ms. Remains 185 /187 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 185 cols
[2024-05-27 20:12:33] [INFO ] Computed 21 invariants in 1 ms
[2024-05-27 20:12:33] [INFO ] Implicit Places using invariants in 99 ms returned []
[2024-05-27 20:12:33] [INFO ] Invariant cache hit.
[2024-05-27 20:12:33] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-27 20:12:34] [INFO ] Implicit Places using invariants and state equation in 320 ms returned []
Implicit Place search using SMT with State Equation took 421 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 583 ms. Remains : 185/195 places, 194/197 transitions.
Stuttering acceptance computed with spot in 109 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 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s173 1) (EQ s180 1)), p0:(OR (NEQ s131 1) (NEQ s137 1)), p2:(AND (EQ s157 1) (EQ s166 1) (EQ s172 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 121 ms.
Stack based approach found an accepted trace after 457 steps with 3 reset with depth 439 and stack size 439 in 1 ms.
FORMULA ParamProductionCell-PT-3-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property ParamProductionCell-PT-3-LTLFireability-12 finished in 834 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/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 2 ms. Remains 195 /195 variables (removed 0) and now considering 197/197 (removed 0) transitions.
// Phase 1: matrix 197 rows 195 cols
[2024-05-27 20:12:34] [INFO ] Computed 28 invariants in 1 ms
[2024-05-27 20:12:34] [INFO ] Implicit Places using invariants in 138 ms returned [15, 37, 64, 140, 172]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 140 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 2 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 145 ms. Remains : 190/195 places, 197/197 transitions.
Stuttering acceptance computed with spot in 125 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 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p2, acceptance={} source=2 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND p2 p0), acceptance={0} source=3 dest: 0}, { cond=(OR (AND (NOT p2) p1) (NOT p0)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(AND (EQ s81 1) (EQ s86 1) (EQ s150 1) (OR (EQ s162 0) (EQ s171 0) (EQ s177 0))), p2:(OR (AND (EQ s62 1) (EQ s64 1)) (AND (EQ s81 1) (EQ s91 1))), p1:(...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ParamProductionCell-PT-3-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-3-LTLFireability-13 finished in 286 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/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 4 ms. Remains 194 /195 variables (removed 1) and now considering 196/197 (removed 1) transitions.
// Phase 1: matrix 196 rows 194 cols
[2024-05-27 20:12:34] [INFO ] Computed 28 invariants in 1 ms
[2024-05-27 20:12:34] [INFO ] Implicit Places using invariants in 139 ms returned [15, 37, 64, 65, 84, 171, 175]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 152 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 4 ms. Remains 185 /187 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 185 cols
[2024-05-27 20:12:34] [INFO ] Computed 21 invariants in 1 ms
[2024-05-27 20:12:34] [INFO ] Implicit Places using invariants in 113 ms returned []
[2024-05-27 20:12:34] [INFO ] Invariant cache hit.
[2024-05-27 20:12:35] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-27 20:12:35] [INFO ] Implicit Places using invariants and state equation in 323 ms returned []
Implicit Place search using SMT with State Equation took 448 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 612 ms. Remains : 185/195 places, 194/197 transitions.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-3-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s133 1) (EQ s137 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 2388 reset in 113 ms.
Product exploration explored 100000 steps with 2389 reset in 204 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 75 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Finished random walk after 41 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=41 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 105 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
[2024-05-27 20:12:36] [INFO ] Invariant cache hit.
[2024-05-27 20:12:36] [INFO ] [Real]Absence check using 18 positive place invariants in 10 ms returned sat
[2024-05-27 20:12:36] [INFO ] [Real]Absence check using 18 positive and 3 generalized place invariants in 4 ms returned sat
[2024-05-27 20:12:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 20:12:36] [INFO ] [Real]Absence check using state equation in 188 ms returned sat
[2024-05-27 20:12:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 20:12:36] [INFO ] [Nat]Absence check using 18 positive place invariants in 11 ms returned sat
[2024-05-27 20:12:36] [INFO ] [Nat]Absence check using 18 positive and 3 generalized place invariants in 4 ms returned sat
[2024-05-27 20:12:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 20:12:36] [INFO ] [Nat]Absence check using state equation in 184 ms returned sat
[2024-05-27 20:12:36] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-27 20:12:36] [INFO ] [Nat]Added 68 Read/Feed constraints in 23 ms returned sat
[2024-05-27 20:12:36] [INFO ] Deduced a trap composed of 7 places in 64 ms of which 0 ms to minimize.
[2024-05-27 20:12:36] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 0 ms to minimize.
[2024-05-27 20:12:36] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 0 ms to minimize.
[2024-05-27 20:12:37] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 0 ms to minimize.
[2024-05-27 20:12:37] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 0 ms to minimize.
[2024-05-27 20:12:37] [INFO ] Deduced a trap composed of 5 places in 52 ms of which 0 ms to minimize.
[2024-05-27 20:12:37] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 484 ms
[2024-05-27 20:12:37] [INFO ] Computed and/alt/rep : 191/317/191 causal constraints (skipped 0 transitions) in 14 ms.
[2024-05-27 20:12:38] [INFO ] Added : 186 causal constraints over 38 iterations in 840 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 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 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 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 19 ms. Remains 89 /185 variables (removed 96) and now considering 98/194 (removed 96) transitions.
// Phase 1: matrix 98 rows 89 cols
[2024-05-27 20:12:38] [INFO ] Computed 21 invariants in 1 ms
[2024-05-27 20:12:38] [INFO ] Implicit Places using invariants in 99 ms returned []
[2024-05-27 20:12:38] [INFO ] Invariant cache hit.
[2024-05-27 20:12:38] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-05-27 20:12:38] [INFO ] Implicit Places using invariants and state equation in 175 ms returned []
Implicit Place search using SMT with State Equation took 276 ms to find 0 implicit places.
[2024-05-27 20:12:38] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-27 20:12:38] [INFO ] Invariant cache hit.
[2024-05-27 20:12:38] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
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 393 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 68 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Finished random walk after 20 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=20 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 92 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
[2024-05-27 20:12:38] [INFO ] Invariant cache hit.
[2024-05-27 20:12:38] [INFO ] [Real]Absence check using 18 positive place invariants in 7 ms returned sat
[2024-05-27 20:12:38] [INFO ] [Real]Absence check using 18 positive and 3 generalized place invariants in 3 ms returned sat
[2024-05-27 20:12:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 20:12:38] [INFO ] [Real]Absence check using state equation in 64 ms returned sat
[2024-05-27 20:12:38] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 20:12:38] [INFO ] [Nat]Absence check using 18 positive place invariants in 7 ms returned sat
[2024-05-27 20:12:38] [INFO ] [Nat]Absence check using 18 positive and 3 generalized place invariants in 2 ms returned sat
[2024-05-27 20:12:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 20:12:39] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2024-05-27 20:12:39] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-05-27 20:12:39] [INFO ] [Nat]Added 67 Read/Feed constraints in 10 ms returned sat
[2024-05-27 20:12:39] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2024-05-27 20:12:39] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-05-27 20:12:39] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 0 ms to minimize.
[2024-05-27 20:12:39] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2024-05-27 20:12:39] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-05-27 20:12:39] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
[2024-05-27 20:12:39] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-05-27 20:12:39] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-27 20:12:39] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 297 ms
[2024-05-27 20:12:39] [INFO ] Computed and/alt/rep : 96/228/96 causal constraints (skipped 0 transitions) in 7 ms.
[2024-05-27 20:12:39] [INFO ] Added : 90 causal constraints over 20 iterations in 224 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Product exploration explored 100000 steps with 4797 reset in 125 ms.
Product exploration explored 100000 steps with 4799 reset in 145 ms.
Built C files in :
/tmp/ltsmin10689959419523871365
[2024-05-27 20:12:39] [INFO ] Computing symmetric may disable matrix : 98 transitions.
[2024-05-27 20:12:39] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 20:12:39] [INFO ] Computing symmetric may enable matrix : 98 transitions.
[2024-05-27 20:12:39] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 20:12:39] [INFO ] Computing Do-Not-Accords matrix : 98 transitions.
[2024-05-27 20:12:39] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 20:12:39] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10689959419523871365
Running compilation step : cd /tmp/ltsmin10689959419523871365;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 287 ms.
Running link step : cd /tmp/ltsmin10689959419523871365;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin10689959419523871365;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased2084426343879139251.hoa' '--buchi-type=spotba'
LTSmin run took 153 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 5656 ms.
All properties solved by simple procedures.
Total runtime 44439 ms.

BK_STOP 1716840761454

--------------------
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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /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="gold2023"
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 gold2023"
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 r285-smll-171654421800023"
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 ;