Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 712K
-rw-r--r-- 1 mcc users 8.4K Feb 26 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 26 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Feb 26 17:15 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 26 17:15 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.1K Feb 25 16:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 16:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Feb 25 16:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Feb 26 17:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 160K Feb 26 17:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Feb 26 17:17 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 98K Feb 26 17:17 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 16:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 2 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 174K Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678988580533

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=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ParamProductionCell-PT-2
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-16 17:43:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-16 17:43:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-16 17:43:03] [INFO ] Load time of PNML (sax parser for PT used): 110 ms
[2023-03-16 17:43:03] [INFO ] Transformed 231 places.
[2023-03-16 17:43:03] [INFO ] Transformed 202 transitions.
[2023-03-16 17:43:03] [INFO ] Found NUPN structural information;
[2023-03-16 17:43:03] [INFO ] Parsed PT model containing 231 places and 202 transitions and 846 arcs in 208 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Initial state reduction rules removed 2 formulas.
FORMULA ParamProductionCell-PT-2-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-2-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-2-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-2-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-2-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-2-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-2-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 22 out of 231 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 231/231 places, 202/202 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 227 transition count 198
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 227 transition count 198
Applied a total of 8 rules in 62 ms. Remains 227 /231 variables (removed 4) and now considering 198/202 (removed 4) transitions.
// Phase 1: matrix 198 rows 227 cols
[2023-03-16 17:43:03] [INFO ] Computed 59 place invariants in 19 ms
[2023-03-16 17:43:04] [INFO ] Implicit Places using invariants in 658 ms returned [15, 18, 19, 24, 31, 35, 36, 41, 42, 46, 47, 64, 65, 73, 78, 79, 98, 99, 101, 114, 115, 117, 119, 120, 161, 162, 166, 167, 192, 193, 196, 197, 203, 207, 218]
Discarding 35 places :
Implicit Place search using SMT only with invariants took 700 ms to find 35 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 192/231 places, 198/202 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 190 transition count 196
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 190 transition count 196
Applied a total of 4 rules in 21 ms. Remains 190 /192 variables (removed 2) and now considering 196/198 (removed 2) transitions.
// Phase 1: matrix 196 rows 190 cols
[2023-03-16 17:43:04] [INFO ] Computed 24 place invariants in 4 ms
[2023-03-16 17:43:04] [INFO ] Implicit Places using invariants in 164 ms returned []
[2023-03-16 17:43:04] [INFO ] Invariant cache hit.
[2023-03-16 17:43:04] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-16 17:43:04] [INFO ] Implicit Places using invariants and state equation in 408 ms returned []
Implicit Place search using SMT with State Equation took 574 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 190/231 places, 196/202 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1358 ms. Remains : 190/231 places, 196/202 transitions.
Support contains 22 out of 190 places after structural reductions.
[2023-03-16 17:43:05] [INFO ] Flatten gal took : 60 ms
[2023-03-16 17:43:05] [INFO ] Flatten gal took : 29 ms
[2023-03-16 17:43:05] [INFO ] Input system was already deterministic with 196 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 514 ms. (steps per millisecond=19 ) properties (out of 18) seen :16
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-16 17:43:05] [INFO ] Invariant cache hit.
[2023-03-16 17:43:06] [INFO ] After 94ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-16 17:43:06] [INFO ] [Nat]Absence check using 20 positive place invariants in 9 ms returned sat
[2023-03-16 17:43:06] [INFO ] [Nat]Absence check using 20 positive and 4 generalized place invariants in 4 ms returned sat
[2023-03-16 17:43:06] [INFO ] After 122ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-16 17:43:06] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-16 17:43:06] [INFO ] After 49ms SMT Verify possible using 68 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-16 17:43:06] [INFO ] Deduced a trap composed of 7 places in 101 ms of which 6 ms to minimize.
[2023-03-16 17:43:06] [INFO ] Deduced a trap composed of 5 places in 110 ms of which 1 ms to minimize.
[2023-03-16 17:43:06] [INFO ] Deduced a trap composed of 11 places in 83 ms of which 1 ms to minimize.
[2023-03-16 17:43:06] [INFO ] Deduced a trap composed of 5 places in 80 ms of which 2 ms to minimize.
[2023-03-16 17:43:06] [INFO ] Deduced a trap composed of 12 places in 97 ms of which 2 ms to minimize.
[2023-03-16 17:43:07] [INFO ] Deduced a trap composed of 23 places in 91 ms of which 1 ms to minimize.
[2023-03-16 17:43:07] [INFO ] Deduced a trap composed of 6 places in 71 ms of which 1 ms to minimize.
[2023-03-16 17:43:07] [INFO ] Deduced a trap composed of 7 places in 70 ms of which 1 ms to minimize.
[2023-03-16 17:43:07] [INFO ] Deduced a trap composed of 7 places in 89 ms of which 1 ms to minimize.
[2023-03-16 17:43:07] [INFO ] Deduced a trap composed of 24 places in 69 ms of which 1 ms to minimize.
[2023-03-16 17:43:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 10 trap constraints in 1002 ms
[2023-03-16 17:43:07] [INFO ] Deduced a trap composed of 26 places in 79 ms of which 1 ms to minimize.
[2023-03-16 17:43:07] [INFO ] Deduced a trap composed of 46 places in 78 ms of which 1 ms to minimize.
[2023-03-16 17:43:07] [INFO ] Deduced a trap composed of 30 places in 76 ms of which 1 ms to minimize.
[2023-03-16 17:43:07] [INFO ] Deduced a trap composed of 8 places in 73 ms of which 0 ms to minimize.
[2023-03-16 17:43:07] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 8 ms to minimize.
[2023-03-16 17:43:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 5 trap constraints in 465 ms
[2023-03-16 17:43:07] [INFO ] After 1550ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :0
[2023-03-16 17:43:07] [INFO ] After 1779ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 2 ms.
Successfully simplified 2 atomic propositions for a total of 9 simplifications.
FORMULA ParamProductionCell-PT-2-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(!p0)) U G(p1)))'
Support contains 3 out of 190 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 190/190 places, 196/196 transitions.
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 190 transition count 160
Reduce places removed 36 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 38 rules applied. Total rules applied 74 place count 154 transition count 158
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 76 place count 152 transition count 158
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 76 place count 152 transition count 146
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 100 place count 140 transition count 146
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 101 place count 139 transition count 145
Iterating global reduction 3 with 1 rules applied. Total rules applied 102 place count 139 transition count 145
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 188 place count 96 transition count 102
Applied a total of 188 rules in 44 ms. Remains 96 /190 variables (removed 94) and now considering 102/196 (removed 94) transitions.
// Phase 1: matrix 102 rows 96 cols
[2023-03-16 17:43:08] [INFO ] Computed 24 place invariants in 2 ms
[2023-03-16 17:43:08] [INFO ] Implicit Places using invariants in 107 ms returned [10, 27, 87]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 108 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 93/190 places, 102/196 transitions.
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 0 with 4 rules applied. Total rules applied 4 place count 91 transition count 100
Applied a total of 4 rules in 9 ms. Remains 91 /93 variables (removed 2) and now considering 100/102 (removed 2) transitions.
// Phase 1: matrix 100 rows 91 cols
[2023-03-16 17:43:08] [INFO ] Computed 21 place invariants in 1 ms
[2023-03-16 17:43:08] [INFO ] Implicit Places using invariants in 90 ms returned []
[2023-03-16 17:43:08] [INFO ] Invariant cache hit.
[2023-03-16 17:43:08] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-16 17:43:08] [INFO ] Implicit Places using invariants and state equation in 200 ms returned []
Implicit Place search using SMT with State Equation took 293 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 91/190 places, 100/196 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 454 ms. Remains : 91/190 places, 100/196 transitions.
Stuttering acceptance computed with spot in 297 ms :[(NOT p1), p0, (AND p0 p1)]
Running random walk in product with property : ParamProductionCell-PT-2-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=(AND p1 p0), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(EQ s43 1), p0:(OR (EQ s64 0) (EQ s21 1))], 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 6224 reset in 401 ms.
Product exploration explored 100000 steps with 6167 reset in 291 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 p0))), (X (AND (NOT p1) p0)), (X p0), (X (NOT p1)), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) p0))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 375 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 112 ms :[(NOT p1), p0, (AND p0 p1)]
Finished random walk after 90 steps, including 0 resets, run visited all 4 properties in 4 ms. (steps per millisecond=22 )
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 p0))), (X (AND (NOT p1) p0)), (X p0), (X (NOT p1)), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) p0))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (AND p0 p1)), (F p1), (F (NOT p0)), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 9 factoid took 465 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 113 ms :[(NOT p1), p0, (AND p0 p1)]
Stuttering acceptance computed with spot in 112 ms :[(NOT p1), p0, (AND p0 p1)]
[2023-03-16 17:43:10] [INFO ] Invariant cache hit.
[2023-03-16 17:43:10] [INFO ] [Real]Absence check using 18 positive place invariants in 7 ms returned sat
[2023-03-16 17:43:10] [INFO ] [Real]Absence check using 18 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-16 17:43:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 17:43:10] [INFO ] [Real]Absence check using state equation in 66 ms returned sat
[2023-03-16 17:43:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 17:43:11] [INFO ] [Nat]Absence check using 18 positive place invariants in 10 ms returned sat
[2023-03-16 17:43:11] [INFO ] [Nat]Absence check using 18 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-16 17:43:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 17:43:11] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2023-03-16 17:43:11] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-16 17:43:11] [INFO ] [Nat]Added 68 Read/Feed constraints in 11 ms returned sat
[2023-03-16 17:43:11] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 0 ms to minimize.
[2023-03-16 17:43:11] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 1 ms to minimize.
[2023-03-16 17:43:11] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
[2023-03-16 17:43:11] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
[2023-03-16 17:43:11] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 0 ms to minimize.
[2023-03-16 17:43:11] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 1 ms to minimize.
[2023-03-16 17:43:11] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 1 ms to minimize.
[2023-03-16 17:43:11] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 0 ms to minimize.
[2023-03-16 17:43:11] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 1 ms to minimize.
[2023-03-16 17:43:11] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 0 ms to minimize.
[2023-03-16 17:43:11] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 523 ms
[2023-03-16 17:43:11] [INFO ] Computed and/alt/rep : 98/231/98 causal constraints (skipped 0 transitions) in 8 ms.
[2023-03-16 17:43:11] [INFO ] Added : 97 causal constraints over 22 iterations in 281 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 3 out of 91 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 91/91 places, 100/100 transitions.
Applied a total of 0 rules in 5 ms. Remains 91 /91 variables (removed 0) and now considering 100/100 (removed 0) transitions.
[2023-03-16 17:43:11] [INFO ] Invariant cache hit.
[2023-03-16 17:43:12] [INFO ] Implicit Places using invariants in 90 ms returned []
[2023-03-16 17:43:12] [INFO ] Invariant cache hit.
[2023-03-16 17:43:12] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-16 17:43:12] [INFO ] Implicit Places using invariants and state equation in 194 ms returned []
Implicit Place search using SMT with State Equation took 287 ms to find 0 implicit places.
[2023-03-16 17:43:12] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-16 17:43:12] [INFO ] Invariant cache hit.
[2023-03-16 17:43:12] [INFO ] Dead Transitions using invariants and state equation in 100 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 403 ms. Remains : 91/91 places, 100/100 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) p0), (X (NOT (AND p0 p1))), (X (AND p0 (NOT p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 374 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 118 ms :[(NOT p1), p0, (AND p0 p1)]
Finished random walk after 88 steps, including 0 resets, run visited all 4 properties in 3 ms. (steps per millisecond=29 )
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p0 p1))), (X (AND p0 (NOT p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (AND p0 p1)), (F p1), (F (NOT p0)), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 9 factoid took 465 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 115 ms :[(NOT p1), p0, (AND p0 p1)]
Stuttering acceptance computed with spot in 111 ms :[(NOT p1), p0, (AND p0 p1)]
[2023-03-16 17:43:13] [INFO ] Invariant cache hit.
[2023-03-16 17:43:13] [INFO ] [Real]Absence check using 18 positive place invariants in 8 ms returned sat
[2023-03-16 17:43:13] [INFO ] [Real]Absence check using 18 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-16 17:43:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 17:43:13] [INFO ] [Real]Absence check using state equation in 65 ms returned sat
[2023-03-16 17:43:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 17:43:13] [INFO ] [Nat]Absence check using 18 positive place invariants in 8 ms returned sat
[2023-03-16 17:43:13] [INFO ] [Nat]Absence check using 18 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-16 17:43:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 17:43:13] [INFO ] [Nat]Absence check using state equation in 64 ms returned sat
[2023-03-16 17:43:13] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-16 17:43:13] [INFO ] [Nat]Added 68 Read/Feed constraints in 9 ms returned sat
[2023-03-16 17:43:13] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
[2023-03-16 17:43:14] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
[2023-03-16 17:43:14] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 0 ms to minimize.
[2023-03-16 17:43:14] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2023-03-16 17:43:14] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 3 ms to minimize.
[2023-03-16 17:43:14] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 0 ms to minimize.
[2023-03-16 17:43:14] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 0 ms to minimize.
[2023-03-16 17:43:14] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 0 ms to minimize.
[2023-03-16 17:43:14] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 5 ms to minimize.
[2023-03-16 17:43:14] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 3 ms to minimize.
[2023-03-16 17:43:14] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 469 ms
[2023-03-16 17:43:14] [INFO ] Computed and/alt/rep : 98/231/98 causal constraints (skipped 0 transitions) in 8 ms.
[2023-03-16 17:43:14] [INFO ] Added : 97 causal constraints over 22 iterations in 273 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 109 ms :[(NOT p1), p0, (AND p0 p1)]
Product exploration explored 100000 steps with 6221 reset in 141 ms.
Product exploration explored 100000 steps with 6161 reset in 272 ms.
Support contains 3 out of 91 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 91/91 places, 100/100 transitions.
Applied a total of 0 rules in 4 ms. Remains 91 /91 variables (removed 0) and now considering 100/100 (removed 0) transitions.
[2023-03-16 17:43:15] [INFO ] Invariant cache hit.
[2023-03-16 17:43:15] [INFO ] Implicit Places using invariants in 131 ms returned []
[2023-03-16 17:43:15] [INFO ] Invariant cache hit.
[2023-03-16 17:43:15] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-16 17:43:15] [INFO ] Implicit Places using invariants and state equation in 187 ms returned []
Implicit Place search using SMT with State Equation took 320 ms to find 0 implicit places.
[2023-03-16 17:43:15] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-16 17:43:15] [INFO ] Invariant cache hit.
[2023-03-16 17:43:15] [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 420 ms. Remains : 91/91 places, 100/100 transitions.
Treatment of property ParamProductionCell-PT-2-LTLCardinality-00 finished in 7617 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 190 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 190/190 places, 196/196 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 190 transition count 156
Reduce places removed 40 places and 0 transitions.
Iterating post reduction 1 with 40 rules applied. Total rules applied 80 place count 150 transition count 156
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 80 place count 150 transition count 146
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 100 place count 140 transition count 146
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 102 place count 138 transition count 144
Iterating global reduction 2 with 2 rules applied. Total rules applied 104 place count 138 transition count 144
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: 45
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 2 with 90 rules applied. Total rules applied 194 place count 93 transition count 99
Applied a total of 194 rules in 22 ms. Remains 93 /190 variables (removed 97) and now considering 99/196 (removed 97) transitions.
// Phase 1: matrix 99 rows 93 cols
[2023-03-16 17:43:15] [INFO ] Computed 24 place invariants in 1 ms
[2023-03-16 17:43:15] [INFO ] Implicit Places using invariants in 96 ms returned [10, 26, 65, 83]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 99 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 89/190 places, 99/196 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 85 transition count 95
Applied a total of 8 rules in 10 ms. Remains 85 /89 variables (removed 4) and now considering 95/99 (removed 4) transitions.
// Phase 1: matrix 95 rows 85 cols
[2023-03-16 17:43:15] [INFO ] Computed 20 place invariants in 2 ms
[2023-03-16 17:43:15] [INFO ] Implicit Places using invariants in 86 ms returned []
[2023-03-16 17:43:15] [INFO ] Invariant cache hit.
[2023-03-16 17:43:15] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-16 17:43:16] [INFO ] Implicit Places using invariants and state equation in 187 ms returned []
Implicit Place search using SMT with State Equation took 277 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 85/190 places, 95/196 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 408 ms. Remains : 85/190 places, 95/196 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-2-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s81 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 33304 reset in 140 ms.
Product exploration explored 100000 steps with 33327 reset in 159 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)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 130 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 1 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=0 )
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 140 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)]
[2023-03-16 17:43:16] [INFO ] Invariant cache hit.
[2023-03-16 17:43:16] [INFO ] [Real]Absence check using 18 positive place invariants in 6 ms returned sat
[2023-03-16 17:43:16] [INFO ] [Real]Absence check using 18 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-16 17:43:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 17:43:16] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2023-03-16 17:43:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 17:43:17] [INFO ] [Nat]Absence check using 18 positive place invariants in 7 ms returned sat
[2023-03-16 17:43:17] [INFO ] [Nat]Absence check using 18 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-16 17:43:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 17:43:17] [INFO ] [Nat]Absence check using state equation in 55 ms returned sat
[2023-03-16 17:43:17] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-16 17:43:17] [INFO ] [Nat]Added 68 Read/Feed constraints in 10 ms returned sat
[2023-03-16 17:43:17] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 1 ms to minimize.
[2023-03-16 17:43:17] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 0 ms to minimize.
[2023-03-16 17:43:17] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 1 ms to minimize.
[2023-03-16 17:43:17] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 0 ms to minimize.
[2023-03-16 17:43:17] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2023-03-16 17:43:17] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2023-03-16 17:43:17] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
[2023-03-16 17:43:17] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
[2023-03-16 17:43:17] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2023-03-16 17:43:17] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
[2023-03-16 17:43:17] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 0 ms to minimize.
[2023-03-16 17:43:17] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
[2023-03-16 17:43:17] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2023-03-16 17:43:17] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2023-03-16 17:43:17] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
[2023-03-16 17:43:17] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
[2023-03-16 17:43:17] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2023-03-16 17:43:17] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 0 ms to minimize.
[2023-03-16 17:43:17] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 0 ms to minimize.
[2023-03-16 17:43:17] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2023-03-16 17:43:18] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 0 ms to minimize.
[2023-03-16 17:43:18] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 1 ms to minimize.
[2023-03-16 17:43:18] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2023-03-16 17:43:18] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 978 ms
[2023-03-16 17:43:18] [INFO ] Computed and/alt/rep : 93/218/93 causal constraints (skipped 0 transitions) in 8 ms.
[2023-03-16 17:43:18] [INFO ] Added : 90 causal constraints over 20 iterations in 236 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 85 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 85/85 places, 95/95 transitions.
Applied a total of 0 rules in 5 ms. Remains 85 /85 variables (removed 0) and now considering 95/95 (removed 0) transitions.
[2023-03-16 17:43:18] [INFO ] Invariant cache hit.
[2023-03-16 17:43:18] [INFO ] Implicit Places using invariants in 94 ms returned []
[2023-03-16 17:43:18] [INFO ] Invariant cache hit.
[2023-03-16 17:43:18] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-16 17:43:18] [INFO ] Implicit Places using invariants and state equation in 189 ms returned []
Implicit Place search using SMT with State Equation took 297 ms to find 0 implicit places.
[2023-03-16 17:43:18] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-16 17:43:18] [INFO ] Invariant cache hit.
[2023-03-16 17:43:18] [INFO ] Dead Transitions using invariants and state equation in 89 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 401 ms. Remains : 85/85 places, 95/95 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)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 163 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 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 137 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 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
[2023-03-16 17:43:19] [INFO ] Invariant cache hit.
[2023-03-16 17:43:19] [INFO ] [Real]Absence check using 18 positive place invariants in 7 ms returned sat
[2023-03-16 17:43:19] [INFO ] [Real]Absence check using 18 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-16 17:43:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 17:43:19] [INFO ] [Real]Absence check using state equation in 72 ms returned sat
[2023-03-16 17:43:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 17:43:19] [INFO ] [Nat]Absence check using 18 positive place invariants in 8 ms returned sat
[2023-03-16 17:43:19] [INFO ] [Nat]Absence check using 18 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-16 17:43:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 17:43:19] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2023-03-16 17:43:19] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-16 17:43:19] [INFO ] [Nat]Added 68 Read/Feed constraints in 11 ms returned sat
[2023-03-16 17:43:19] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
[2023-03-16 17:43:19] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 0 ms to minimize.
[2023-03-16 17:43:19] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 1 ms to minimize.
[2023-03-16 17:43:19] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 0 ms to minimize.
[2023-03-16 17:43:19] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 0 ms to minimize.
[2023-03-16 17:43:19] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2023-03-16 17:43:19] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
[2023-03-16 17:43:19] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 0 ms to minimize.
[2023-03-16 17:43:19] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
[2023-03-16 17:43:20] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 1 ms to minimize.
[2023-03-16 17:43:20] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 0 ms to minimize.
[2023-03-16 17:43:20] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
[2023-03-16 17:43:20] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
[2023-03-16 17:43:20] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 0 ms to minimize.
[2023-03-16 17:43:20] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 0 ms to minimize.
[2023-03-16 17:43:20] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 0 ms to minimize.
[2023-03-16 17:43:20] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2023-03-16 17:43:20] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 0 ms to minimize.
[2023-03-16 17:43:20] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 0 ms to minimize.
[2023-03-16 17:43:20] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 0 ms to minimize.
[2023-03-16 17:43:20] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 0 ms to minimize.
[2023-03-16 17:43:20] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 1 ms to minimize.
[2023-03-16 17:43:20] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2023-03-16 17:43:20] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 1071 ms
[2023-03-16 17:43:20] [INFO ] Computed and/alt/rep : 93/218/93 causal constraints (skipped 0 transitions) in 10 ms.
[2023-03-16 17:43:20] [INFO ] Added : 90 causal constraints over 20 iterations in 242 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Product exploration explored 100000 steps with 33246 reset in 147 ms.
Product exploration explored 100000 steps with 33292 reset in 154 ms.
Support contains 1 out of 85 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 85/85 places, 95/95 transitions.
Applied a total of 0 rules in 4 ms. Remains 85 /85 variables (removed 0) and now considering 95/95 (removed 0) transitions.
[2023-03-16 17:43:21] [INFO ] Invariant cache hit.
[2023-03-16 17:43:21] [INFO ] Implicit Places using invariants in 109 ms returned []
[2023-03-16 17:43:21] [INFO ] Invariant cache hit.
[2023-03-16 17:43:21] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-16 17:43:21] [INFO ] Implicit Places using invariants and state equation in 203 ms returned []
Implicit Place search using SMT with State Equation took 314 ms to find 0 implicit places.
[2023-03-16 17:43:21] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-16 17:43:21] [INFO ] Invariant cache hit.
[2023-03-16 17:43:21] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 403 ms. Remains : 85/85 places, 95/95 transitions.
Treatment of property ParamProductionCell-PT-2-LTLCardinality-01 finished in 5936 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0&&X(p1)))))'
Support contains 4 out of 190 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 190/190 places, 196/196 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 189 transition count 195
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 189 transition count 195
Applied a total of 2 rules in 7 ms. Remains 189 /190 variables (removed 1) and now considering 195/196 (removed 1) transitions.
// Phase 1: matrix 195 rows 189 cols
[2023-03-16 17:43:21] [INFO ] Computed 24 place invariants in 4 ms
[2023-03-16 17:43:21] [INFO ] Implicit Places using invariants in 118 ms returned [15, 136, 167]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 120 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 186/190 places, 195/196 transitions.
Applied a total of 0 rules in 5 ms. Remains 186 /186 variables (removed 0) and now considering 195/195 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 133 ms. Remains : 186/190 places, 195/196 transitions.
Stuttering acceptance computed with spot in 128 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : ParamProductionCell-PT-2-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s43 0) (EQ s47 1)), p1:(OR (EQ s129 0) (EQ s169 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33353 reset in 216 ms.
Product exploration explored 100000 steps with 33390 reset in 239 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 p1), (X p0), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 284 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 195 rows 186 cols
[2023-03-16 17:43:22] [INFO ] Computed 21 place invariants in 3 ms
[2023-03-16 17:43:22] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 17:43:22] [INFO ] [Nat]Absence check using 19 positive place invariants in 9 ms returned sat
[2023-03-16 17:43:22] [INFO ] [Nat]Absence check using 19 positive and 2 generalized place invariants in 5 ms returned sat
[2023-03-16 17:43:22] [INFO ] After 64ms SMT Verify possible using all constraints in natural 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 p0 p1), (X p0), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT p0)), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 8 factoid took 336 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 115 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Support contains 4 out of 186 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 186/186 places, 195/195 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 186 transition count 155
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 146 transition count 154
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 82 place count 145 transition count 154
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 82 place count 145 transition count 146
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 98 place count 137 transition count 146
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 192 place count 90 transition count 99
Applied a total of 192 rules in 17 ms. Remains 90 /186 variables (removed 96) and now considering 99/195 (removed 96) transitions.
// Phase 1: matrix 99 rows 90 cols
[2023-03-16 17:43:23] [INFO ] Computed 21 place invariants in 1 ms
[2023-03-16 17:43:23] [INFO ] Implicit Places using invariants in 111 ms returned []
[2023-03-16 17:43:23] [INFO ] Invariant cache hit.
[2023-03-16 17:43:23] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-16 17:43:23] [INFO ] Implicit Places using invariants and state equation in 187 ms returned []
Implicit Place search using SMT with State Equation took 301 ms to find 0 implicit places.
[2023-03-16 17:43:23] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-16 17:43:23] [INFO ] Invariant cache hit.
[2023-03-16 17:43:23] [INFO ] Dead Transitions using invariants and state equation in 88 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 90/186 places, 99/195 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 415 ms. Remains : 90/186 places, 99/195 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 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 198 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Finished random walk after 1256 steps, including 0 resets, run visited all 2 properties in 8 ms. (steps per millisecond=157 )
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 337 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 112 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 113 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 116 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 33258 reset in 155 ms.
Product exploration explored 100000 steps with 33454 reset in 174 ms.
Support contains 4 out of 90 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 90/90 places, 99/99 transitions.
Applied a total of 0 rules in 4 ms. Remains 90 /90 variables (removed 0) and now considering 99/99 (removed 0) transitions.
[2023-03-16 17:43:25] [INFO ] Invariant cache hit.
[2023-03-16 17:43:25] [INFO ] Implicit Places using invariants in 91 ms returned []
[2023-03-16 17:43:25] [INFO ] Invariant cache hit.
[2023-03-16 17:43:25] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-16 17:43:25] [INFO ] Implicit Places using invariants and state equation in 206 ms returned []
Implicit Place search using SMT with State Equation took 299 ms to find 0 implicit places.
[2023-03-16 17:43:25] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-16 17:43:25] [INFO ] Invariant cache hit.
[2023-03-16 17:43:25] [INFO ] Dead Transitions using invariants and state equation in 95 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 408 ms. Remains : 90/90 places, 99/99 transitions.
Treatment of property ParamProductionCell-PT-2-LTLCardinality-03 finished in 4104 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||(p1&&F(G(p2))))))'
Support contains 5 out of 190 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 190/190 places, 196/196 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 190 transition count 158
Reduce places removed 38 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 39 rules applied. Total rules applied 77 place count 152 transition count 157
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 78 place count 151 transition count 157
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 78 place count 151 transition count 145
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 102 place count 139 transition count 145
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 104 place count 137 transition count 143
Iterating global reduction 3 with 2 rules applied. Total rules applied 106 place count 137 transition count 143
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 190 place count 95 transition count 101
Applied a total of 190 rules in 19 ms. Remains 95 /190 variables (removed 95) and now considering 101/196 (removed 95) transitions.
// Phase 1: matrix 101 rows 95 cols
[2023-03-16 17:43:25] [INFO ] Computed 24 place invariants in 1 ms
[2023-03-16 17:43:25] [INFO ] Implicit Places using invariants in 94 ms returned [10, 27, 67]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 107 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 92/190 places, 101/196 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 89 transition count 98
Applied a total of 6 rules in 5 ms. Remains 89 /92 variables (removed 3) and now considering 98/101 (removed 3) transitions.
// Phase 1: matrix 98 rows 89 cols
[2023-03-16 17:43:25] [INFO ] Computed 21 place invariants in 1 ms
[2023-03-16 17:43:25] [INFO ] Implicit Places using invariants in 108 ms returned []
[2023-03-16 17:43:25] [INFO ] Invariant cache hit.
[2023-03-16 17:43:26] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-16 17:43:26] [INFO ] Implicit Places using invariants and state equation in 206 ms returned []
Implicit Place search using SMT with State Equation took 316 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 89/190 places, 98/196 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 449 ms. Remains : 89/190 places, 98/196 transitions.
Stuttering acceptance computed with spot in 78 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ParamProductionCell-PT-2-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s10 0) (EQ s79 1) (EQ s17 0) (EQ s21 1)), p1:(OR (EQ s79 0) (EQ s10 1)), p2:(EQ s44 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 164 reset in 156 ms.
Stack based approach found an accepted trace after 162 steps with 0 reset with depth 163 and stack size 163 in 0 ms.
FORMULA ParamProductionCell-PT-2-LTLCardinality-04 FALSE TECHNIQUES STACK_TEST
Treatment of property ParamProductionCell-PT-2-LTLCardinality-04 finished in 700 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 190 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 190/190 places, 196/196 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 190 transition count 156
Reduce places removed 40 places and 0 transitions.
Iterating post reduction 1 with 40 rules applied. Total rules applied 80 place count 150 transition count 156
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 80 place count 150 transition count 145
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 102 place count 139 transition count 145
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 104 place count 137 transition count 143
Iterating global reduction 2 with 2 rules applied. Total rules applied 106 place count 137 transition count 143
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 2 with 86 rules applied. Total rules applied 192 place count 94 transition count 100
Applied a total of 192 rules in 13 ms. Remains 94 /190 variables (removed 96) and now considering 100/196 (removed 96) transitions.
// Phase 1: matrix 100 rows 94 cols
[2023-03-16 17:43:26] [INFO ] Computed 24 place invariants in 1 ms
[2023-03-16 17:43:26] [INFO ] Implicit Places using invariants in 117 ms returned [10, 26, 67, 85]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 131 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 90/190 places, 100/196 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 86 transition count 96
Applied a total of 8 rules in 5 ms. Remains 86 /90 variables (removed 4) and now considering 96/100 (removed 4) transitions.
// Phase 1: matrix 96 rows 86 cols
[2023-03-16 17:43:26] [INFO ] Computed 20 place invariants in 1 ms
[2023-03-16 17:43:26] [INFO ] Implicit Places using invariants in 116 ms returned []
[2023-03-16 17:43:26] [INFO ] Invariant cache hit.
[2023-03-16 17:43:26] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-16 17:43:26] [INFO ] Implicit Places using invariants and state equation in 181 ms returned []
Implicit Place search using SMT with State Equation took 299 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 86/190 places, 96/196 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 449 ms. Remains : 86/190 places, 96/196 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-2-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s35 0) (EQ s16 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 297 ms.
Stack based approach found an accepted trace after 301 steps with 0 reset with depth 302 and stack size 255 in 1 ms.
FORMULA ParamProductionCell-PT-2-LTLCardinality-05 FALSE TECHNIQUES STACK_TEST
Treatment of property ParamProductionCell-PT-2-LTLCardinality-05 finished in 796 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p0)||X(F(p1))))))'
Support contains 2 out of 190 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 190/190 places, 196/196 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 188 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 188 transition count 194
Applied a total of 4 rules in 5 ms. Remains 188 /190 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 188 cols
[2023-03-16 17:43:27] [INFO ] Computed 24 place invariants in 2 ms
[2023-03-16 17:43:27] [INFO ] Implicit Places using invariants in 151 ms returned [15, 48, 135, 166]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 152 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 184/190 places, 194/196 transitions.
Applied a total of 0 rules in 2 ms. Remains 184 /184 variables (removed 0) and now considering 194/194 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 160 ms. Remains : 184/190 places, 194/196 transitions.
Stuttering acceptance computed with spot in 187 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ParamProductionCell-PT-2-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=3, aps=[p1:(EQ s121 0), p0:(EQ s46 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]]
Product exploration explored 100000 steps with 25000 reset in 168 ms.
Product exploration explored 100000 steps with 25000 reset in 199 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 p1 (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 91 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 179 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Finished random walk after 33 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=33 )
Knowledge obtained : [(AND p1 (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 2 factoid took 110 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 139 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 138 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Support contains 1 out of 184 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 194/194 transitions.
Applied a total of 0 rules in 1 ms. Remains 184 /184 variables (removed 0) and now considering 194/194 (removed 0) transitions.
// Phase 1: matrix 194 rows 184 cols
[2023-03-16 17:43:28] [INFO ] Computed 20 place invariants in 1 ms
[2023-03-16 17:43:28] [INFO ] Implicit Places using invariants in 136 ms returned []
[2023-03-16 17:43:28] [INFO ] Invariant cache hit.
[2023-03-16 17:43:28] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-16 17:43:29] [INFO ] Implicit Places using invariants and state equation in 342 ms returned []
Implicit Place search using SMT with State Equation took 486 ms to find 0 implicit places.
[2023-03-16 17:43:29] [INFO ] Invariant cache hit.
[2023-03-16 17:43:29] [INFO ] Dead Transitions using invariants and state equation in 144 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 634 ms. Remains : 184/184 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 : [p1, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 82 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 140 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Finished random walk after 52 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=52 )
Knowledge obtained : [p1, true]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 2 factoid took 96 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 132 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 129 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 166 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 25000 reset in 168 ms.
Product exploration explored 100000 steps with 25000 reset in 190 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 155 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Support contains 1 out of 184 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 184/184 places, 194/194 transitions.
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 38 rules applied. Total rules applied 38 place count 184 transition count 194
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 12 Pre rules applied. Total rules applied 38 place count 184 transition count 194
Deduced a syphon composed of 50 places in 0 ms
Iterating global reduction 1 with 12 rules applied. Total rules applied 50 place count 184 transition count 194
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 58 place count 176 transition count 186
Deduced a syphon composed of 42 places in 0 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 66 place count 176 transition count 186
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 90 places in 0 ms
Iterating global reduction 1 with 48 rules applied. Total rules applied 114 place count 176 transition count 186
Discarding 31 places :
Symmetric choice reduction at 1 with 31 rule applications. Total rules 145 place count 145 transition count 155
Deduced a syphon composed of 59 places in 0 ms
Iterating global reduction 1 with 31 rules applied. Total rules applied 176 place count 145 transition count 155
Deduced a syphon composed of 59 places in 0 ms
Applied a total of 176 rules in 24 ms. Remains 145 /184 variables (removed 39) and now considering 155/194 (removed 39) transitions.
[2023-03-16 17:43:30] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 155 rows 145 cols
[2023-03-16 17:43:30] [INFO ] Computed 20 place invariants in 1 ms
[2023-03-16 17:43:31] [INFO ] Dead Transitions using invariants and state equation in 122 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 145/184 places, 155/194 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 161 ms. Remains : 145/184 places, 155/194 transitions.
Support contains 1 out of 184 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 194/194 transitions.
Applied a total of 0 rules in 2 ms. Remains 184 /184 variables (removed 0) and now considering 194/194 (removed 0) transitions.
// Phase 1: matrix 194 rows 184 cols
[2023-03-16 17:43:31] [INFO ] Computed 20 place invariants in 2 ms
[2023-03-16 17:43:31] [INFO ] Implicit Places using invariants in 130 ms returned []
[2023-03-16 17:43:31] [INFO ] Invariant cache hit.
[2023-03-16 17:43:31] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-16 17:43:31] [INFO ] Implicit Places using invariants and state equation in 364 ms returned []
Implicit Place search using SMT with State Equation took 496 ms to find 0 implicit places.
[2023-03-16 17:43:31] [INFO ] Invariant cache hit.
[2023-03-16 17:43:31] [INFO ] Dead Transitions using invariants and state equation in 166 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 665 ms. Remains : 184/184 places, 194/194 transitions.
Treatment of property ParamProductionCell-PT-2-LTLCardinality-06 finished in 4576 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((!p1 U (p2||G(!p1))))&&p0)))'
Support contains 3 out of 190 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 190/190 places, 196/196 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 188 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 188 transition count 194
Applied a total of 4 rules in 9 ms. Remains 188 /190 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 188 cols
[2023-03-16 17:43:31] [INFO ] Computed 24 place invariants in 2 ms
[2023-03-16 17:43:31] [INFO ] Implicit Places using invariants in 147 ms returned [15, 48, 135, 166]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 149 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 184/190 places, 194/196 transitions.
Applied a total of 0 rules in 3 ms. Remains 184 /184 variables (removed 0) and now considering 194/194 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 161 ms. Remains : 184/190 places, 194/196 transitions.
Stuttering acceptance computed with spot in 145 ms :[true, (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (AND (NOT p2) p1)]
Running random walk in product with property : ParamProductionCell-PT-2-LTLCardinality-12 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: 3}], [{ cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(AND (NEQ s94 0) (NEQ s35 1)), p2:(NEQ s33 1), p1:(OR (EQ s94 0) (EQ s35 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ParamProductionCell-PT-2-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-2-LTLCardinality-12 finished in 322 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 190 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 190/190 places, 196/196 transitions.
Drop transitions removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 0 with 41 rules applied. Total rules applied 41 place count 190 transition count 155
Reduce places removed 41 places and 0 transitions.
Iterating post reduction 1 with 41 rules applied. Total rules applied 82 place count 149 transition count 155
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 82 place count 149 transition count 145
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 102 place count 139 transition count 145
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 104 place count 137 transition count 143
Iterating global reduction 2 with 2 rules applied. Total rules applied 106 place count 137 transition count 143
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 44
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 2 with 88 rules applied. Total rules applied 194 place count 93 transition count 99
Applied a total of 194 rules in 29 ms. Remains 93 /190 variables (removed 97) and now considering 99/196 (removed 97) transitions.
// Phase 1: matrix 99 rows 93 cols
[2023-03-16 17:43:32] [INFO ] Computed 24 place invariants in 1 ms
[2023-03-16 17:43:32] [INFO ] Implicit Places using invariants in 101 ms returned [10, 26, 66, 84]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 104 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 89/190 places, 99/196 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 85 transition count 95
Applied a total of 8 rules in 6 ms. Remains 85 /89 variables (removed 4) and now considering 95/99 (removed 4) transitions.
// Phase 1: matrix 95 rows 85 cols
[2023-03-16 17:43:32] [INFO ] Computed 20 place invariants in 0 ms
[2023-03-16 17:43:32] [INFO ] Implicit Places using invariants in 78 ms returned []
[2023-03-16 17:43:32] [INFO ] Invariant cache hit.
[2023-03-16 17:43:32] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-16 17:43:32] [INFO ] Implicit Places using invariants and state equation in 195 ms returned []
Implicit Place search using SMT with State Equation took 276 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 85/190 places, 95/196 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 415 ms. Remains : 85/190 places, 95/196 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-2-LTLCardinality-14 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:(EQ s38 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 158 reset in 126 ms.
Stack based approach found an accepted trace after 233 steps with 1 reset with depth 143 and stack size 143 in 1 ms.
FORMULA ParamProductionCell-PT-2-LTLCardinality-14 FALSE TECHNIQUES STACK_TEST
Treatment of property ParamProductionCell-PT-2-LTLCardinality-14 finished in 631 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(!p0)) U G(p1)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0&&X(p1)))))'
Found a Shortening insensitive property : ParamProductionCell-PT-2-LTLCardinality-03
Stuttering acceptance computed with spot in 116 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Support contains 4 out of 190 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 190/190 places, 196/196 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 190 transition count 157
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 151 transition count 156
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 80 place count 150 transition count 156
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 80 place count 150 transition count 148
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 96 place count 142 transition count 148
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 97 place count 141 transition count 147
Iterating global reduction 3 with 1 rules applied. Total rules applied 98 place count 141 transition count 147
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 44
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 88 rules applied. Total rules applied 186 place count 97 transition count 103
Applied a total of 186 rules in 19 ms. Remains 97 /190 variables (removed 93) and now considering 103/196 (removed 93) transitions.
// Phase 1: matrix 103 rows 97 cols
[2023-03-16 17:43:33] [INFO ] Computed 24 place invariants in 0 ms
[2023-03-16 17:43:33] [INFO ] Implicit Places using invariants in 130 ms returned [11, 69, 87]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 131 ms to find 3 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 94/190 places, 103/196 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 90 transition count 99
Applied a total of 8 rules in 3 ms. Remains 90 /94 variables (removed 4) and now considering 99/103 (removed 4) transitions.
// Phase 1: matrix 99 rows 90 cols
[2023-03-16 17:43:33] [INFO ] Computed 21 place invariants in 1 ms
[2023-03-16 17:43:33] [INFO ] Implicit Places using invariants in 109 ms returned []
[2023-03-16 17:43:33] [INFO ] Invariant cache hit.
[2023-03-16 17:43:33] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-16 17:43:33] [INFO ] Implicit Places using invariants and state equation in 199 ms returned []
Implicit Place search using SMT with State Equation took 311 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 90/190 places, 99/196 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 467 ms. Remains : 90/190 places, 99/196 transitions.
Running random walk in product with property : ParamProductionCell-PT-2-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s22 0) (EQ s25 1)), p1:(OR (EQ s62 0) (EQ s82 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33256 reset in 168 ms.
Product exploration explored 100000 steps with 33274 reset in 195 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 p1), (X p0), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 268 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 102 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-16 17:43:34] [INFO ] Invariant cache hit.
[2023-03-16 17:43:34] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 17:43:34] [INFO ] [Nat]Absence check using 19 positive place invariants in 8 ms returned sat
[2023-03-16 17:43:34] [INFO ] [Nat]Absence check using 19 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-16 17:43:34] [INFO ] After 44ms SMT Verify possible using all constraints in natural 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 p0 p1), (X p0), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT p0)), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 8 factoid took 425 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 109 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Support contains 4 out of 90 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 90/90 places, 99/99 transitions.
Applied a total of 0 rules in 2 ms. Remains 90 /90 variables (removed 0) and now considering 99/99 (removed 0) transitions.
[2023-03-16 17:43:35] [INFO ] Invariant cache hit.
[2023-03-16 17:43:35] [INFO ] Implicit Places using invariants in 102 ms returned []
[2023-03-16 17:43:35] [INFO ] Invariant cache hit.
[2023-03-16 17:43:35] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-16 17:43:35] [INFO ] Implicit Places using invariants and state equation in 209 ms returned []
Implicit Place search using SMT with State Equation took 323 ms to find 0 implicit places.
[2023-03-16 17:43:35] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-16 17:43:35] [INFO ] Invariant cache hit.
[2023-03-16 17:43:35] [INFO ] Dead Transitions using invariants and state equation in 91 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 429 ms. Remains : 90/90 places, 99/99 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 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 186 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 108 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Finished random walk after 441 steps, including 0 resets, run visited all 2 properties in 5 ms. (steps per millisecond=88 )
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 226 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 109 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 109 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 104 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 33158 reset in 164 ms.
Product exploration explored 100000 steps with 33371 reset in 187 ms.
Support contains 4 out of 90 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 90/90 places, 99/99 transitions.
Applied a total of 0 rules in 2 ms. Remains 90 /90 variables (removed 0) and now considering 99/99 (removed 0) transitions.
[2023-03-16 17:43:36] [INFO ] Invariant cache hit.
[2023-03-16 17:43:36] [INFO ] Implicit Places using invariants in 103 ms returned []
[2023-03-16 17:43:36] [INFO ] Invariant cache hit.
[2023-03-16 17:43:37] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-16 17:43:37] [INFO ] Implicit Places using invariants and state equation in 179 ms returned []
Implicit Place search using SMT with State Equation took 283 ms to find 0 implicit places.
[2023-03-16 17:43:37] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-16 17:43:37] [INFO ] Invariant cache hit.
[2023-03-16 17:43:37] [INFO ] Dead Transitions using invariants and state equation in 84 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 377 ms. Remains : 90/90 places, 99/99 transitions.
Treatment of property ParamProductionCell-PT-2-LTLCardinality-03 finished in 4257 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p0)||X(F(p1))))))'
[2023-03-16 17:43:37] [INFO ] Flatten gal took : 15 ms
[2023-03-16 17:43:37] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-16 17:43:37] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 190 places, 196 transitions and 604 arcs took 3 ms.
Total runtime 34341 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1917/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1917/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1917/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1917/ltl_3_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : ParamProductionCell-PT-2-LTLCardinality-00
Could not compute solution for formula : ParamProductionCell-PT-2-LTLCardinality-01
Could not compute solution for formula : ParamProductionCell-PT-2-LTLCardinality-03
Could not compute solution for formula : ParamProductionCell-PT-2-LTLCardinality-06

BK_STOP 1678988619253

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

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2023
ltl formula name ParamProductionCell-PT-2-LTLCardinality-00
ltl formula formula --ltl=/tmp/1917/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 190 places, 196 transitions and 604 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1917/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1917/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1917/ltl_0_
pnml2lts-mc( 0/ 4): Loading Petri net took 0.050 real 0.020 user 0.010 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1917/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name ParamProductionCell-PT-2-LTLCardinality-01
ltl formula formula --ltl=/tmp/1917/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 190 places, 196 transitions and 604 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.060 real 0.010 user 0.010 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1917/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1917/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1917/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 1 states
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1917/ltl_1_
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
0: pnml2lts-mc(+0xa23f4) [0x556a49d603f4]
1: pnml2lts-mc(+0xa2496) [0x556a49d60496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7fbbcab13140]
3: pnml2lts-mc(+0x405be5) [0x556a4a0c3be5]
4: pnml2lts-mc(+0x16b3f9) [0x556a49e293f9]
5: pnml2lts-mc(+0x164ac4) [0x556a49e22ac4]
6: pnml2lts-mc(+0x272e0a) [0x556a49f30e0a]
7: pnml2lts-mc(+0xb61f0) [0x556a49d741f0]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7fbbca9664d7]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7fbbca96667a]
10: pnml2lts-mc(+0xa1581) [0x556a49d5f581]
11: pnml2lts-mc(+0xa1910) [0x556a49d5f910]
12: pnml2lts-mc(+0xa32a2) [0x556a49d612a2]
13: pnml2lts-mc(+0xa50f4) [0x556a49d630f4]
14: pnml2lts-mc(+0x3f34b3) [0x556a4a0b14b3]
15: pnml2lts-mc(+0x7c63d) [0x556a49d3a63d]
16: pnml2lts-mc(+0x67d86) [0x556a49d25d86]
17: pnml2lts-mc(+0x60a8a) [0x556a49d1ea8a]
18: pnml2lts-mc(+0x5eb15) [0x556a49d1cb15]
19: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7fbbca94ed0a]
20: pnml2lts-mc(+0x6075e) [0x556a49d1e75e]
ltl formula name ParamProductionCell-PT-2-LTLCardinality-03
ltl formula formula --ltl=/tmp/1917/ltl_2_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 190 places, 196 transitions and 604 arcs
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1917/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1917/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1917/ltl_2_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.070 real 0.010 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1917/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
corrupted size vs. prev_size in fastbins
ltl formula name ParamProductionCell-PT-2-LTLCardinality-06
ltl formula formula --ltl=/tmp/1917/ltl_3_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 190 places, 196 transitions and 604 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.030 real 0.010 user 0.000 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1917/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1917/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1917/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1917/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is ParamProductionCell-PT-2, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r265-smll-167863540000379"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ParamProductionCell-PT-2.tgz
mv ParamProductionCell-PT-2 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;