Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 420K
-rw-r--r-- 1 mcc users 8.5K Apr 29 17:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Apr 29 17:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Apr 29 17:37 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Apr 29 17:37 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.5K May 9 08:22 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 08:22 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 9 08:22 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 08:22 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 9 08:22 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 9 08:22 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 2 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 174K May 10 09:34 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-4-LTLFireability-00
FORMULA_NAME ParamProductionCell-PT-4-LTLFireability-01
FORMULA_NAME ParamProductionCell-PT-4-LTLFireability-02
FORMULA_NAME ParamProductionCell-PT-4-LTLFireability-03
FORMULA_NAME ParamProductionCell-PT-4-LTLFireability-04
FORMULA_NAME ParamProductionCell-PT-4-LTLFireability-05
FORMULA_NAME ParamProductionCell-PT-4-LTLFireability-06
FORMULA_NAME ParamProductionCell-PT-4-LTLFireability-07
FORMULA_NAME ParamProductionCell-PT-4-LTLFireability-08
FORMULA_NAME ParamProductionCell-PT-4-LTLFireability-09
FORMULA_NAME ParamProductionCell-PT-4-LTLFireability-10
FORMULA_NAME ParamProductionCell-PT-4-LTLFireability-11
FORMULA_NAME ParamProductionCell-PT-4-LTLFireability-12
FORMULA_NAME ParamProductionCell-PT-4-LTLFireability-13
FORMULA_NAME ParamProductionCell-PT-4-LTLFireability-14
FORMULA_NAME ParamProductionCell-PT-4-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1653050614601

Running Version 202205111006
[2022-05-20 12:43:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-20 12:43:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 12:43:37] [INFO ] Load time of PNML (sax parser for PT used): 347 ms
[2022-05-20 12:43:37] [INFO ] Transformed 231 places.
[2022-05-20 12:43:37] [INFO ] Transformed 202 transitions.
[2022-05-20 12:43:37] [INFO ] Found NUPN structural information;
[2022-05-20 12:43:37] [INFO ] Parsed PT model containing 231 places and 202 transitions in 621 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 36 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA ParamProductionCell-PT-4-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-4-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-4-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-4-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-4-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 48 out of 231 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 231/231 places, 202/202 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 225 transition count 196
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 225 transition count 196
Applied a total of 12 rules in 48 ms. Remains 225 /231 variables (removed 6) and now considering 196/202 (removed 6) transitions.
// Phase 1: matrix 196 rows 225 cols
[2022-05-20 12:43:38] [INFO ] Computed 59 place invariants in 35 ms
[2022-05-20 12:43:38] [INFO ] Implicit Places using invariants in 666 ms returned [15, 16, 18, 24, 31, 35, 36, 42, 46, 47, 65, 73, 78, 98, 113, 114, 159, 164, 165, 190, 194, 195, 200, 216]
Discarding 24 places :
Implicit Place search using SMT only with invariants took 746 ms to find 24 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 201/231 places, 196/202 transitions.
Applied a total of 0 rules in 21 ms. Remains 201 /201 variables (removed 0) and now considering 196/196 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 201/231 places, 196/202 transitions.
Support contains 48 out of 201 places after structural reductions.
[2022-05-20 12:43:39] [INFO ] Flatten gal took : 97 ms
[2022-05-20 12:43:39] [INFO ] Flatten gal took : 44 ms
[2022-05-20 12:43:39] [INFO ] Input system was already deterministic with 196 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 670 ms. (steps per millisecond=14 ) properties (out of 29) seen :28
Finished Best-First random walk after 191 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=63 )
FORMULA ParamProductionCell-PT-4-LTLFireability-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(G(p0)))&&(p1||(G(X(p3))&&p2)))))'
Support contains 5 out of 201 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 201/201 places, 196/196 transitions.
Applied a total of 0 rules in 7 ms. Remains 201 /201 variables (removed 0) and now considering 196/196 (removed 0) transitions.
// Phase 1: matrix 196 rows 201 cols
[2022-05-20 12:43:40] [INFO ] Computed 35 place invariants in 6 ms
[2022-05-20 12:43:41] [INFO ] Implicit Places using invariants in 323 ms returned [16, 34, 54, 66, 85, 87, 100, 102, 103, 145, 171, 178, 182]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 326 ms to find 13 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 188/201 places, 196/196 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 20 ms. Remains 186 /188 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 186 cols
[2022-05-20 12:43:41] [INFO ] Computed 22 place invariants in 5 ms
[2022-05-20 12:43:41] [INFO ] Implicit Places using invariants in 201 ms returned []
// Phase 1: matrix 194 rows 186 cols
[2022-05-20 12:43:41] [INFO ] Computed 22 place invariants in 6 ms
[2022-05-20 12:43:41] [INFO ] State equation strengthened by 68 read => feed constraints.
[2022-05-20 12:43:41] [INFO ] Implicit Places using invariants and state equation in 447 ms returned []
Implicit Place search using SMT with State Equation took 655 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 186/201 places, 194/196 transitions.
Finished structural reductions, in 2 iterations. Remains : 186/201 places, 194/196 transitions.
Stuttering acceptance computed with spot in 543 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), true, (NOT p0), (NOT p3)]
Running random walk in product with property : ParamProductionCell-PT-4-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(OR p1 p2), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p3), acceptance={} source=4 dest: 2}, { cond=p3, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(AND (EQ s133 1) (EQ s140 1)), p2:(AND (EQ s8 1) (EQ s47 1)), p0:(EQ s100 1), p3:(AND (EQ s8 1) (EQ s47 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA ParamProductionCell-PT-4-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-4-LTLFireability-01 finished in 1648 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(X((G(!p0) U G(p1))))||F(p2)))'
Support contains 7 out of 201 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 201/201 places, 196/196 transitions.
Applied a total of 0 rules in 9 ms. Remains 201 /201 variables (removed 0) and now considering 196/196 (removed 0) transitions.
// Phase 1: matrix 196 rows 201 cols
[2022-05-20 12:43:42] [INFO ] Computed 35 place invariants in 4 ms
[2022-05-20 12:43:42] [INFO ] Implicit Places using invariants in 295 ms returned [16, 34, 49, 54, 66, 85, 87, 100, 103, 143, 145, 171]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 297 ms to find 12 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 189/201 places, 196/196 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 187 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 187 transition count 194
Applied a total of 4 rules in 16 ms. Remains 187 /189 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 187 cols
[2022-05-20 12:43:42] [INFO ] Computed 23 place invariants in 3 ms
[2022-05-20 12:43:42] [INFO ] Implicit Places using invariants in 179 ms returned []
// Phase 1: matrix 194 rows 187 cols
[2022-05-20 12:43:42] [INFO ] Computed 23 place invariants in 2 ms
[2022-05-20 12:43:43] [INFO ] State equation strengthened by 68 read => feed constraints.
[2022-05-20 12:43:43] [INFO ] Implicit Places using invariants and state equation in 363 ms returned []
Implicit Place search using SMT with State Equation took 548 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 187/201 places, 194/196 transitions.
Finished structural reductions, in 2 iterations. Remains : 187/201 places, 194/196 transitions.
Stuttering acceptance computed with spot in 319 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) p1 p0), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : ParamProductionCell-PT-4-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) p1 p0), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(AND (EQ s164 1) (EQ s179 1)), p1:(AND (EQ s158 1) (EQ s168 1) (EQ s174 1) (EQ s93 1) (EQ s109 1)), p0:(AND (EQ s93 1) (EQ s109 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 25018 reset in 795 ms.
Product exploration explored 100000 steps with 25040 reset in 440 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 p2) (NOT p1) (NOT p0)), (X (NOT (AND (NOT p2) p1 p0))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (AND (NOT p2) (NOT p1) (NOT p0))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 12 factoid took 762 ms. Reduced automaton from 5 states, 11 edges and 3 AP to 5 states, 12 edges and 3 AP.
Stuttering acceptance computed with spot in 270 ms :[(OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) p0 p1), (AND (NOT p2) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 441 ms. (steps per millisecond=22 ) properties (out of 7) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 3) seen :2
Running SMT prover for 1 properties.
// Phase 1: matrix 194 rows 187 cols
[2022-05-20 12:43:46] [INFO ] Computed 23 place invariants in 2 ms
[2022-05-20 12:43:46] [INFO ] After 57ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT (AND (NOT p2) p1 p0))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (AND (NOT p2) (NOT p1) (NOT p0))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (G (NOT (AND (NOT p0) p1 (NOT p2))))]
False Knowledge obtained : [(F p2), (F (AND p0 p1 (NOT p2))), (F (AND p1 (NOT p2))), (F (NOT (AND (NOT p1) (NOT p2)))), (F (AND p0 (NOT p1) (NOT p2))), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 13 factoid took 789 ms. Reduced automaton from 5 states, 12 edges and 3 AP to 2 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 96 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 99 ms :[(NOT p2), (NOT p2)]
// Phase 1: matrix 194 rows 187 cols
[2022-05-20 12:43:47] [INFO ] Computed 23 place invariants in 2 ms
[2022-05-20 12:43:47] [INFO ] [Real]Absence check using 19 positive place invariants in 19 ms returned sat
[2022-05-20 12:43:47] [INFO ] [Real]Absence check using 19 positive and 4 generalized place invariants in 6 ms returned sat
[2022-05-20 12:43:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 12:43:48] [INFO ] [Real]Absence check using state equation in 326 ms returned sat
[2022-05-20 12:43:48] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 12:43:48] [INFO ] [Nat]Absence check using 19 positive place invariants in 15 ms returned sat
[2022-05-20 12:43:48] [INFO ] [Nat]Absence check using 19 positive and 4 generalized place invariants in 5 ms returned sat
[2022-05-20 12:43:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 12:43:48] [INFO ] [Nat]Absence check using state equation in 309 ms returned sat
[2022-05-20 12:43:48] [INFO ] State equation strengthened by 68 read => feed constraints.
[2022-05-20 12:43:48] [INFO ] [Nat]Added 68 Read/Feed constraints in 74 ms returned sat
[2022-05-20 12:43:49] [INFO ] Deduced a trap composed of 7 places in 179 ms of which 5 ms to minimize.
[2022-05-20 12:43:49] [INFO ] Deduced a trap composed of 11 places in 138 ms of which 2 ms to minimize.
[2022-05-20 12:43:49] [INFO ] Deduced a trap composed of 7 places in 120 ms of which 2 ms to minimize.
[2022-05-20 12:43:49] [INFO ] Deduced a trap composed of 7 places in 124 ms of which 12 ms to minimize.
[2022-05-20 12:43:49] [INFO ] Deduced a trap composed of 20 places in 122 ms of which 2 ms to minimize.
[2022-05-20 12:43:49] [INFO ] Deduced a trap composed of 5 places in 137 ms of which 1 ms to minimize.
[2022-05-20 12:43:50] [INFO ] Deduced a trap composed of 26 places in 116 ms of which 1 ms to minimize.
[2022-05-20 12:43:50] [INFO ] Deduced a trap composed of 7 places in 128 ms of which 2 ms to minimize.
[2022-05-20 12:43:50] [INFO ] Deduced a trap composed of 7 places in 157 ms of which 1 ms to minimize.
[2022-05-20 12:43:50] [INFO ] Deduced a trap composed of 26 places in 122 ms of which 1 ms to minimize.
[2022-05-20 12:43:50] [INFO ] Deduced a trap composed of 23 places in 148 ms of which 2 ms to minimize.
[2022-05-20 12:43:50] [INFO ] Deduced a trap composed of 6 places in 92 ms of which 1 ms to minimize.
[2022-05-20 12:43:50] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 1 ms to minimize.
[2022-05-20 12:43:51] [INFO ] Deduced a trap composed of 27 places in 55 ms of which 1 ms to minimize.
[2022-05-20 12:43:51] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 1 ms to minimize.
[2022-05-20 12:43:51] [INFO ] Deduced a trap composed of 22 places in 77 ms of which 1 ms to minimize.
[2022-05-20 12:43:51] [INFO ] Deduced a trap composed of 27 places in 107 ms of which 1 ms to minimize.
[2022-05-20 12:43:51] [INFO ] Deduced a trap composed of 5 places in 83 ms of which 1 ms to minimize.
[2022-05-20 12:43:51] [INFO ] Deduced a trap composed of 26 places in 74 ms of which 0 ms to minimize.
[2022-05-20 12:43:51] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 1 ms to minimize.
[2022-05-20 12:43:51] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 2931 ms
[2022-05-20 12:43:51] [INFO ] Computed and/alt/rep : 190/317/190 causal constraints (skipped 0 transitions) in 21 ms.
[2022-05-20 12:43:52] [INFO ] Added : 168 causal constraints over 34 iterations in 1167 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 2 out of 187 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 187/187 places, 194/194 transitions.
Applied a total of 0 rules in 7 ms. Remains 187 /187 variables (removed 0) and now considering 194/194 (removed 0) transitions.
// Phase 1: matrix 194 rows 187 cols
[2022-05-20 12:43:52] [INFO ] Computed 23 place invariants in 3 ms
[2022-05-20 12:43:53] [INFO ] Implicit Places using invariants in 160 ms returned []
// Phase 1: matrix 194 rows 187 cols
[2022-05-20 12:43:53] [INFO ] Computed 23 place invariants in 2 ms
[2022-05-20 12:43:53] [INFO ] State equation strengthened by 68 read => feed constraints.
[2022-05-20 12:43:53] [INFO ] Implicit Places using invariants and state equation in 401 ms returned []
Implicit Place search using SMT with State Equation took 564 ms to find 0 implicit places.
// Phase 1: matrix 194 rows 187 cols
[2022-05-20 12:43:53] [INFO ] Computed 23 place invariants in 4 ms
[2022-05-20 12:43:53] [INFO ] Dead Transitions using invariants and state equation in 196 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 187/187 places, 194/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 p2), (X (NOT p2)), (X (X (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 152 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 50 ms :[(NOT p2)]
Finished random walk after 26 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=13 )
Knowledge obtained : [(NOT p2), (X (NOT p2)), (X (X (NOT p2)))]
False Knowledge obtained : [(F p2)]
Knowledge based reduction with 3 factoid took 128 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 38 ms :[(NOT p2)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p2)]
// Phase 1: matrix 194 rows 187 cols
[2022-05-20 12:43:54] [INFO ] Computed 23 place invariants in 2 ms
[2022-05-20 12:43:54] [INFO ] [Real]Absence check using 19 positive place invariants in 14 ms returned sat
[2022-05-20 12:43:54] [INFO ] [Real]Absence check using 19 positive and 4 generalized place invariants in 5 ms returned sat
[2022-05-20 12:43:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 12:43:54] [INFO ] [Real]Absence check using state equation in 321 ms returned sat
[2022-05-20 12:43:54] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 12:43:54] [INFO ] [Nat]Absence check using 19 positive place invariants in 12 ms returned sat
[2022-05-20 12:43:54] [INFO ] [Nat]Absence check using 19 positive and 4 generalized place invariants in 5 ms returned sat
[2022-05-20 12:43:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 12:43:55] [INFO ] [Nat]Absence check using state equation in 307 ms returned sat
[2022-05-20 12:43:55] [INFO ] State equation strengthened by 68 read => feed constraints.
[2022-05-20 12:43:55] [INFO ] [Nat]Added 68 Read/Feed constraints in 71 ms returned sat
[2022-05-20 12:43:55] [INFO ] Deduced a trap composed of 7 places in 111 ms of which 1 ms to minimize.
[2022-05-20 12:43:55] [INFO ] Deduced a trap composed of 11 places in 126 ms of which 1 ms to minimize.
[2022-05-20 12:43:55] [INFO ] Deduced a trap composed of 7 places in 100 ms of which 0 ms to minimize.
[2022-05-20 12:43:55] [INFO ] Deduced a trap composed of 7 places in 96 ms of which 1 ms to minimize.
[2022-05-20 12:43:56] [INFO ] Deduced a trap composed of 20 places in 103 ms of which 1 ms to minimize.
[2022-05-20 12:43:56] [INFO ] Deduced a trap composed of 5 places in 106 ms of which 1 ms to minimize.
[2022-05-20 12:43:56] [INFO ] Deduced a trap composed of 26 places in 102 ms of which 1 ms to minimize.
[2022-05-20 12:43:56] [INFO ] Deduced a trap composed of 7 places in 97 ms of which 1 ms to minimize.
[2022-05-20 12:43:56] [INFO ] Deduced a trap composed of 7 places in 76 ms of which 1 ms to minimize.
[2022-05-20 12:43:56] [INFO ] Deduced a trap composed of 26 places in 77 ms of which 1 ms to minimize.
[2022-05-20 12:43:56] [INFO ] Deduced a trap composed of 23 places in 81 ms of which 0 ms to minimize.
[2022-05-20 12:43:56] [INFO ] Deduced a trap composed of 6 places in 65 ms of which 1 ms to minimize.
[2022-05-20 12:43:56] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 0 ms to minimize.
[2022-05-20 12:43:57] [INFO ] Deduced a trap composed of 27 places in 74 ms of which 1 ms to minimize.
[2022-05-20 12:43:57] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 1 ms to minimize.
[2022-05-20 12:43:57] [INFO ] Deduced a trap composed of 22 places in 85 ms of which 1 ms to minimize.
[2022-05-20 12:43:57] [INFO ] Deduced a trap composed of 27 places in 99 ms of which 1 ms to minimize.
[2022-05-20 12:43:57] [INFO ] Deduced a trap composed of 5 places in 80 ms of which 0 ms to minimize.
[2022-05-20 12:43:57] [INFO ] Deduced a trap composed of 26 places in 80 ms of which 1 ms to minimize.
[2022-05-20 12:43:57] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 1 ms to minimize.
[2022-05-20 12:43:57] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 2380 ms
[2022-05-20 12:43:57] [INFO ] Computed and/alt/rep : 190/317/190 causal constraints (skipped 0 transitions) in 18 ms.
[2022-05-20 12:43:58] [INFO ] Added : 168 causal constraints over 34 iterations in 1014 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 47 ms :[(NOT p2)]
Product exploration explored 100000 steps with 3194 reset in 169 ms.
Product exploration explored 100000 steps with 3186 reset in 168 ms.
Built C files in :
/tmp/ltsmin3429864307497430177
[2022-05-20 12:43:59] [INFO ] Computing symmetric may disable matrix : 194 transitions.
[2022-05-20 12:43:59] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 12:43:59] [INFO ] Computing symmetric may enable matrix : 194 transitions.
[2022-05-20 12:43:59] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 12:43:59] [INFO ] Computing Do-Not-Accords matrix : 194 transitions.
[2022-05-20 12:43:59] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 12:43:59] [INFO ] Built C files in 75ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3429864307497430177
Running compilation step : cd /tmp/ltsmin3429864307497430177;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1028 ms.
Running link step : cd /tmp/ltsmin3429864307497430177;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 67 ms.
Running LTSmin : cd /tmp/ltsmin3429864307497430177;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased3801044621963532655.hoa' '--buchi-type=spotba'
LTSmin run took 3963 ms.
FORMULA ParamProductionCell-PT-4-LTLFireability-03 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ParamProductionCell-PT-4-LTLFireability-03 finished in 21917 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(G(F((G(X(p0))&&F(p1)))))))'
Support contains 5 out of 201 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 201/201 places, 196/196 transitions.
Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 201 transition count 176
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 40 place count 181 transition count 176
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 40 place count 181 transition count 160
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 72 place count 165 transition count 160
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 120 place count 141 transition count 136
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 124 place count 139 transition count 134
Applied a total of 124 rules in 37 ms. Remains 139 /201 variables (removed 62) and now considering 134/196 (removed 62) transitions.
// Phase 1: matrix 134 rows 139 cols
[2022-05-20 12:44:04] [INFO ] Computed 35 place invariants in 1 ms
[2022-05-20 12:44:04] [INFO ] Implicit Places using invariants in 272 ms returned [7, 18, 29, 32, 40, 49, 62, 63, 64, 97, 120, 125, 127]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 275 ms to find 13 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 126/201 places, 134/196 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 126 transition count 133
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 125 transition count 133
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 125 transition count 132
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 124 transition count 132
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 38 place count 107 transition count 115
Applied a total of 38 rules in 23 ms. Remains 107 /126 variables (removed 19) and now considering 115/134 (removed 19) transitions.
// Phase 1: matrix 115 rows 107 cols
[2022-05-20 12:44:04] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-20 12:44:04] [INFO ] Implicit Places using invariants in 134 ms returned []
// Phase 1: matrix 115 rows 107 cols
[2022-05-20 12:44:04] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-20 12:44:04] [INFO ] State equation strengthened by 66 read => feed constraints.
[2022-05-20 12:44:05] [INFO ] Implicit Places using invariants and state equation in 387 ms returned []
Implicit Place search using SMT with State Equation took 523 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 107/201 places, 115/196 transitions.
Finished structural reductions, in 2 iterations. Remains : 107/201 places, 115/196 transitions.
Stuttering acceptance computed with spot in 154 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-4-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s36 1) (EQ s38 1) (EQ s71 1)), p0:(OR (EQ s74 0) (EQ s89 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 360 reset in 287 ms.
Stack based approach found an accepted trace after 504 steps with 8 reset with depth 250 and stack size 250 in 3 ms.
FORMULA ParamProductionCell-PT-4-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property ParamProductionCell-PT-4-LTLFireability-06 finished in 1332 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(X(F(p0)))))'
Support contains 2 out of 201 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 201/201 places, 196/196 transitions.
Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 201 transition count 176
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 40 place count 181 transition count 176
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 40 place count 181 transition count 159
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 74 place count 164 transition count 159
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 122 place count 140 transition count 135
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 126 place count 138 transition count 133
Applied a total of 126 rules in 44 ms. Remains 138 /201 variables (removed 63) and now considering 133/196 (removed 63) transitions.
// Phase 1: matrix 133 rows 138 cols
[2022-05-20 12:44:05] [INFO ] Computed 35 place invariants in 2 ms
[2022-05-20 12:44:05] [INFO ] Implicit Places using invariants in 261 ms returned [7, 18, 29, 32, 40, 51, 63, 64, 65, 96, 98, 119, 124, 126]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 286 ms to find 14 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 124/201 places, 133/196 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 124 transition count 132
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 123 transition count 132
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 123 transition count 131
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 122 transition count 131
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 6 place count 120 transition count 129
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 120 transition count 129
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 46 place count 101 transition count 110
Applied a total of 46 rules in 42 ms. Remains 101 /124 variables (removed 23) and now considering 110/133 (removed 23) transitions.
// Phase 1: matrix 110 rows 101 cols
[2022-05-20 12:44:06] [INFO ] Computed 21 place invariants in 9 ms
[2022-05-20 12:44:06] [INFO ] Implicit Places using invariants in 287 ms returned []
// Phase 1: matrix 110 rows 101 cols
[2022-05-20 12:44:06] [INFO ] Computed 21 place invariants in 1 ms
[2022-05-20 12:44:06] [INFO ] State equation strengthened by 66 read => feed constraints.
[2022-05-20 12:44:06] [INFO ] Implicit Places using invariants and state equation in 380 ms returned []
Implicit Place search using SMT with State Equation took 681 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 101/201 places, 110/196 transitions.
Finished structural reductions, in 2 iterations. Remains : 101/201 places, 110/196 transitions.
Stuttering acceptance computed with spot in 114 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-4-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s38 1) (EQ s39 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 115 reset in 217 ms.
Stack based approach found an accepted trace after 223 steps with 0 reset with depth 224 and stack size 224 in 1 ms.
FORMULA ParamProductionCell-PT-4-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property ParamProductionCell-PT-4-LTLFireability-07 finished in 1416 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((!(p0 U p1)||F(p0)))))'
Support contains 4 out of 201 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 201/201 places, 196/196 transitions.
Applied a total of 0 rules in 4 ms. Remains 201 /201 variables (removed 0) and now considering 196/196 (removed 0) transitions.
// Phase 1: matrix 196 rows 201 cols
[2022-05-20 12:44:07] [INFO ] Computed 35 place invariants in 2 ms
[2022-05-20 12:44:07] [INFO ] Implicit Places using invariants in 532 ms returned [16, 49, 54, 66, 85, 87, 100, 102, 103, 143, 145, 171, 178, 182]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 536 ms to find 14 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 187/201 places, 196/196 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 7 ms. Remains 185 /187 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 185 cols
[2022-05-20 12:44:07] [INFO ] Computed 21 place invariants in 2 ms
[2022-05-20 12:44:07] [INFO ] Implicit Places using invariants in 301 ms returned []
// Phase 1: matrix 194 rows 185 cols
[2022-05-20 12:44:07] [INFO ] Computed 21 place invariants in 1 ms
[2022-05-20 12:44:08] [INFO ] State equation strengthened by 68 read => feed constraints.
[2022-05-20 12:44:08] [INFO ] Implicit Places using invariants and state equation in 441 ms returned []
Implicit Place search using SMT with State Equation took 748 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 185/201 places, 194/196 transitions.
Finished structural reductions, in 2 iterations. Remains : 185/201 places, 194/196 transitions.
Stuttering acceptance computed with spot in 122 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-4-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s80 1) (EQ s129 1)), p1:(AND (EQ s33 1) (EQ s37 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 13 reset in 199 ms.
Stack based approach found an accepted trace after 372 steps with 0 reset with depth 373 and stack size 373 in 3 ms.
FORMULA ParamProductionCell-PT-4-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property ParamProductionCell-PT-4-LTLFireability-08 finished in 1653 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(((F(X(p0))||G(p1))&&p2)))'
Support contains 9 out of 201 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 201/201 places, 196/196 transitions.
Applied a total of 0 rules in 4 ms. Remains 201 /201 variables (removed 0) and now considering 196/196 (removed 0) transitions.
// Phase 1: matrix 196 rows 201 cols
[2022-05-20 12:44:08] [INFO ] Computed 35 place invariants in 6 ms
[2022-05-20 12:44:09] [INFO ] Implicit Places using invariants in 299 ms returned [16, 34, 49, 54, 66, 85, 87, 102, 103, 145, 171, 178, 182]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 301 ms to find 13 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 188/201 places, 196/196 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 4 ms. Remains 186 /188 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 186 cols
[2022-05-20 12:44:09] [INFO ] Computed 22 place invariants in 2 ms
[2022-05-20 12:44:09] [INFO ] Implicit Places using invariants in 139 ms returned []
// Phase 1: matrix 194 rows 186 cols
[2022-05-20 12:44:09] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-20 12:44:09] [INFO ] State equation strengthened by 68 read => feed constraints.
[2022-05-20 12:44:09] [INFO ] Implicit Places using invariants and state equation in 491 ms returned []
Implicit Place search using SMT with State Equation took 638 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 186/201 places, 194/196 transitions.
Finished structural reductions, in 2 iterations. Remains : 186/201 places, 194/196 transitions.
Stuttering acceptance computed with spot in 393 ms :[true, (NOT p0), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ParamProductionCell-PT-4-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p2), acceptance={} source=3 dest: 0}, { cond=(AND p2 (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND p2 p1), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 4}]], initial=2, aps=[p0:(AND (EQ s92 1) (EQ s108 1) (EQ s114 1)), p2:(OR (AND (EQ s2 1) (EQ s158 1)) (AND (EQ s133 1) (EQ s152 1))), p1:(AND (EQ s34 1) (EQ s39 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ParamProductionCell-PT-4-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-4-LTLFireability-10 finished in 1363 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((F(X((G((p1 U p2))&&p3)))&&p0))))'
Support contains 8 out of 201 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 201/201 places, 196/196 transitions.
Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 201 transition count 176
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 40 place count 181 transition count 176
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 40 place count 181 transition count 160
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 72 place count 165 transition count 160
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 120 place count 141 transition count 136
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 124 place count 139 transition count 134
Applied a total of 124 rules in 29 ms. Remains 139 /201 variables (removed 62) and now considering 134/196 (removed 62) transitions.
// Phase 1: matrix 134 rows 139 cols
[2022-05-20 12:44:10] [INFO ] Computed 35 place invariants in 1 ms
[2022-05-20 12:44:10] [INFO ] Implicit Places using invariants in 292 ms returned [7, 18, 29, 32, 40, 51, 64, 65, 97, 120, 125, 127]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 293 ms to find 12 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 127/201 places, 134/196 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 127 transition count 133
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 126 transition count 133
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 126 transition count 132
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 125 transition count 132
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 6 place count 123 transition count 130
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 123 transition count 130
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 34 place count 110 transition count 117
Applied a total of 34 rules in 22 ms. Remains 110 /127 variables (removed 17) and now considering 117/134 (removed 17) transitions.
// Phase 1: matrix 117 rows 110 cols
[2022-05-20 12:44:10] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-20 12:44:10] [INFO ] Implicit Places using invariants in 170 ms returned []
// Phase 1: matrix 117 rows 110 cols
[2022-05-20 12:44:10] [INFO ] Computed 23 place invariants in 2 ms
[2022-05-20 12:44:10] [INFO ] State equation strengthened by 66 read => feed constraints.
[2022-05-20 12:44:11] [INFO ] Implicit Places using invariants and state equation in 386 ms returned []
Implicit Place search using SMT with State Equation took 559 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 110/201 places, 117/196 transitions.
Finished structural reductions, in 2 iterations. Remains : 110/201 places, 117/196 transitions.
Stuttering acceptance computed with spot in 303 ms :[(OR (NOT p3) (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p3)), (NOT p0), (NOT p2), (NOT p2)]
Running random walk in product with property : ParamProductionCell-PT-4-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (NOT p3) (AND (NOT p2) (NOT p1))), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=(AND p3 (NOT p2) p1), acceptance={} source=0 dest: 3}], [{ cond=(OR (NOT p3) (AND (NOT p2) (NOT p1))), acceptance={0} source=1 dest: 1}, { cond=(AND p3 (NOT p2) p1), acceptance={0} source=1 dest: 3}, { cond=(OR (AND p3 p2) (AND p3 p1)), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={0} source=4 dest: 3}, { cond=(OR p2 p1), acceptance={} source=4 dest: 4}]], initial=0, aps=[p3:(OR (AND (EQ s80 1) (EQ s82 1)) (EQ s50 0) (EQ s51 0)), p2:(AND (EQ s80 1) (EQ s82 1)), p1:(AND (EQ s37 1) (EQ s76 1)), p0:(AND (EQ s38 1) (EQ s87 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 362 ms.
Stack based approach found an accepted trace after 268 steps with 1 reset with depth 108 and stack size 108 in 3 ms.
FORMULA ParamProductionCell-PT-4-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property ParamProductionCell-PT-4-LTLFireability-11 finished in 1603 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G((!(!p1 U p2)||p0))&&F(p3)))'
Support contains 6 out of 201 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 201/201 places, 196/196 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 201 transition count 180
Reduce places removed 16 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 17 rules applied. Total rules applied 33 place count 185 transition count 179
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 34 place count 184 transition count 179
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 19 Pre rules applied. Total rules applied 34 place count 184 transition count 160
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 72 place count 165 transition count 160
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 1 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 118 place count 142 transition count 137
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 122 place count 140 transition count 135
Applied a total of 122 rules in 32 ms. Remains 140 /201 variables (removed 61) and now considering 135/196 (removed 61) transitions.
// Phase 1: matrix 135 rows 140 cols
[2022-05-20 12:44:11] [INFO ] Computed 35 place invariants in 2 ms
[2022-05-20 12:44:12] [INFO ] Implicit Places using invariants in 318 ms returned [8, 19, 30, 33, 41, 50, 52, 63, 64, 65, 96, 98, 118]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 320 ms to find 13 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 127/201 places, 135/196 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 127 transition count 134
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 126 transition count 133
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 125 transition count 133
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 4 place count 125 transition count 132
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 6 place count 124 transition count 132
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 66 place count 94 transition count 102
Applied a total of 66 rules in 18 ms. Remains 94 /127 variables (removed 33) and now considering 102/135 (removed 33) transitions.
// Phase 1: matrix 102 rows 94 cols
[2022-05-20 12:44:12] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-20 12:44:12] [INFO ] Implicit Places using invariants in 141 ms returned []
// Phase 1: matrix 102 rows 94 cols
[2022-05-20 12:44:12] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-20 12:44:12] [INFO ] State equation strengthened by 66 read => feed constraints.
[2022-05-20 12:44:12] [INFO ] Implicit Places using invariants and state equation in 284 ms returned []
Implicit Place search using SMT with State Equation took 433 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 94/201 places, 102/196 transitions.
Finished structural reductions, in 2 iterations. Remains : 94/201 places, 102/196 transitions.
Stuttering acceptance computed with spot in 263 ms :[true, (OR (NOT p3) p2), p2, (AND (NOT p0) p2), (OR (NOT p3) (AND (NOT p0) p2))]
Running random walk in product with property : ParamProductionCell-PT-4-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p2, acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) (NOT p2) (NOT p3)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2) p3), acceptance={0} source=1 dest: 2}, { cond=(AND p1 (NOT p2) p3), acceptance={0} source=1 dest: 3}, { cond=(AND p1 (NOT p2) (NOT p3)), acceptance={0} source=1 dest: 4}], [{ cond=p2, acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(OR p0 (AND p1 (NOT p2))), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p0) p2), acceptance={0} source=4 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2) p3), acceptance={0} source=4 dest: 2}, { cond=(OR (AND p0 p3) (AND p1 (NOT p2) p3)), acceptance={0} source=4 dest: 3}, { cond=(OR (AND p0 (NOT p3)) (AND p1 (NOT p2) (NOT p3))), acceptance={0} source=4 dest: 4}]], initial=4, aps=[p2:(AND (EQ s80 1) (EQ s85 1)), p1:(AND (EQ s76 1) (EQ s79 1)), p3:(AND (EQ s76 1) (EQ s79 1) (EQ s9 1) (EQ s14 1)), p0:(OR (EQ s80 0) (EQ s85 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, weak, inherently-weak], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Entered a terminal (fully accepting) state of product in 74 steps with 0 reset in 0 ms.
FORMULA ParamProductionCell-PT-4-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-4-LTLFireability-12 finished in 1094 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 201 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 201/201 places, 196/196 transitions.
Applied a total of 0 rules in 5 ms. Remains 201 /201 variables (removed 0) and now considering 196/196 (removed 0) transitions.
// Phase 1: matrix 196 rows 201 cols
[2022-05-20 12:44:12] [INFO ] Computed 35 place invariants in 5 ms
[2022-05-20 12:44:13] [INFO ] Implicit Places using invariants in 312 ms returned [16, 34, 49, 54, 85, 87, 100, 102, 103, 143, 145, 171, 178, 182]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 314 ms to find 14 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 187/201 places, 196/196 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 5 ms. Remains 185 /187 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 185 cols
[2022-05-20 12:44:13] [INFO ] Computed 21 place invariants in 2 ms
[2022-05-20 12:44:13] [INFO ] Implicit Places using invariants in 185 ms returned []
// Phase 1: matrix 194 rows 185 cols
[2022-05-20 12:44:13] [INFO ] Computed 21 place invariants in 12 ms
[2022-05-20 12:44:13] [INFO ] State equation strengthened by 68 read => feed constraints.
[2022-05-20 12:44:13] [INFO ] Implicit Places using invariants and state equation in 528 ms returned []
Implicit Place search using SMT with State Equation took 715 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 185/201 places, 194/196 transitions.
Finished structural reductions, in 2 iterations. Remains : 185/201 places, 194/196 transitions.
Stuttering acceptance computed with spot in 110 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-4-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s62 1) (EQ s63 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ParamProductionCell-PT-4-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-4-LTLFireability-14 finished in 1167 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X((p0 U (!G((p0 U p2))&&p1)))||F(G(p3))))'
Support contains 6 out of 201 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 201/201 places, 196/196 transitions.
Applied a total of 0 rules in 3 ms. Remains 201 /201 variables (removed 0) and now considering 196/196 (removed 0) transitions.
// Phase 1: matrix 196 rows 201 cols
[2022-05-20 12:44:13] [INFO ] Computed 35 place invariants in 1 ms
[2022-05-20 12:44:14] [INFO ] Implicit Places using invariants in 333 ms returned [34, 49, 54, 85, 87, 100, 102, 103, 143, 145, 178, 182]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 334 ms to find 12 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 189/201 places, 196/196 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 187 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 187 transition count 194
Applied a total of 4 rules in 6 ms. Remains 187 /189 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 187 cols
[2022-05-20 12:44:14] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-20 12:44:14] [INFO ] Implicit Places using invariants in 162 ms returned []
// Phase 1: matrix 194 rows 187 cols
[2022-05-20 12:44:14] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-20 12:44:14] [INFO ] State equation strengthened by 68 read => feed constraints.
[2022-05-20 12:44:14] [INFO ] Implicit Places using invariants and state equation in 441 ms returned []
Implicit Place search using SMT with State Equation took 605 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 187/201 places, 194/196 transitions.
Finished structural reductions, in 2 iterations. Remains : 187/201 places, 194/196 transitions.
Stuttering acceptance computed with spot in 213 ms :[(OR (AND (NOT p1) (NOT p3)) (AND p2 (NOT p3))), (NOT p3), (AND p2 (NOT p3)), (OR (AND (NOT p1) (NOT p3)) (AND p2 (NOT p3)))]
Running random walk in product with property : ParamProductionCell-PT-4-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p3 p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p3) p0), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(OR (AND p1 p0) (AND p1 p2)), acceptance={} source=0 dest: 2}], [{ cond=p3, acceptance={0} source=1 dest: 1}, { cond=(NOT p3), acceptance={0, 1} source=1 dest: 1}], [{ cond=(AND p3 p0 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND p3 p2), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p3) p0 (NOT p2)), acceptance={1} source=2 dest: 2}, { cond=(AND (NOT p3) p2), acceptance={0, 1} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=3, aps=[p1:(AND (EQ s159 1) (EQ s167 1)), p3:(OR (EQ s16 0) (EQ s22 0)), p0:(AND (EQ s16 1) (EQ s22 1)), p2:(AND (EQ s63 1) (EQ s65 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 158 ms.
Stack based approach found an accepted trace after 208 steps with 0 reset with depth 209 and stack size 209 in 1 ms.
FORMULA ParamProductionCell-PT-4-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property ParamProductionCell-PT-4-LTLFireability-15 finished in 1346 ms.
All properties solved by simple procedures.
Total runtime 38212 ms.

BK_STOP 1653050655495

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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-4"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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