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.r261-smll-167863536300395.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 itstools
Input is ParamProductionCell-PT-4, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r261-smll-167863536300395
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 652K
-rw-r--r-- 1 mcc users 9.3K Feb 26 17:17 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Feb 26 17:17 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Feb 26 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Feb 26 17:16 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.8K Feb 25 16:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Feb 25 16:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Feb 25 16:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 17:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 117K Feb 26 17:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Feb 26 17:18 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K Feb 26 17:18 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 16:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:30 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-4-LTLCardinality-00
FORMULA_NAME ParamProductionCell-PT-4-LTLCardinality-01
FORMULA_NAME ParamProductionCell-PT-4-LTLCardinality-02
FORMULA_NAME ParamProductionCell-PT-4-LTLCardinality-03
FORMULA_NAME ParamProductionCell-PT-4-LTLCardinality-04
FORMULA_NAME ParamProductionCell-PT-4-LTLCardinality-05
FORMULA_NAME ParamProductionCell-PT-4-LTLCardinality-06
FORMULA_NAME ParamProductionCell-PT-4-LTLCardinality-07
FORMULA_NAME ParamProductionCell-PT-4-LTLCardinality-08
FORMULA_NAME ParamProductionCell-PT-4-LTLCardinality-09
FORMULA_NAME ParamProductionCell-PT-4-LTLCardinality-10
FORMULA_NAME ParamProductionCell-PT-4-LTLCardinality-11
FORMULA_NAME ParamProductionCell-PT-4-LTLCardinality-12
FORMULA_NAME ParamProductionCell-PT-4-LTLCardinality-13
FORMULA_NAME ParamProductionCell-PT-4-LTLCardinality-14
FORMULA_NAME ParamProductionCell-PT-4-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678919932513

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ParamProductionCell-PT-4
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202303021504
[2023-03-15 22:38:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-15 22:38:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 22:38:55] [INFO ] Load time of PNML (sax parser for PT used): 124 ms
[2023-03-15 22:38:55] [INFO ] Transformed 231 places.
[2023-03-15 22:38:55] [INFO ] Transformed 202 transitions.
[2023-03-15 22:38:55] [INFO ] Found NUPN structural information;
[2023-03-15 22:38:55] [INFO ] Parsed PT model containing 231 places and 202 transitions and 846 arcs in 229 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA ParamProductionCell-PT-4-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-4-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-4-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-4-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 41 out of 231 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 231/231 places, 202/202 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 228 transition count 199
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 228 transition count 199
Applied a total of 6 rules in 54 ms. Remains 228 /231 variables (removed 3) and now considering 199/202 (removed 3) transitions.
// Phase 1: matrix 199 rows 228 cols
[2023-03-15 22:38:55] [INFO ] Computed 59 place invariants in 47 ms
[2023-03-15 22:38:56] [INFO ] Implicit Places using invariants in 1066 ms returned [16, 19, 24, 31, 41, 64, 101, 113, 116, 119, 162, 165, 194, 197, 203, 204, 219]
Discarding 17 places :
Implicit Place search using SMT only with invariants took 1117 ms to find 17 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 211/231 places, 199/202 transitions.
Applied a total of 0 rules in 15 ms. Remains 211 /211 variables (removed 0) and now considering 199/199 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1187 ms. Remains : 211/231 places, 199/202 transitions.
Support contains 41 out of 211 places after structural reductions.
[2023-03-15 22:38:56] [INFO ] Flatten gal took : 65 ms
[2023-03-15 22:38:56] [INFO ] Flatten gal took : 28 ms
[2023-03-15 22:38:56] [INFO ] Input system was already deterministic with 199 transitions.
Support contains 38 out of 211 places (down from 41) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 476 ms. (steps per millisecond=21 ) properties (out of 25) seen :23
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 199 rows 211 cols
[2023-03-15 22:38:57] [INFO ] Computed 42 place invariants in 14 ms
[2023-03-15 22:38:57] [INFO ] After 152ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-15 22:38:58] [INFO ] [Nat]Absence check using 32 positive place invariants in 18 ms returned sat
[2023-03-15 22:38:58] [INFO ] [Nat]Absence check using 32 positive and 10 generalized place invariants in 10 ms returned sat
[2023-03-15 22:38:58] [INFO ] After 172ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2023-03-15 22:38:58] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-15 22:38:58] [INFO ] After 85ms SMT Verify possible using 68 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2023-03-15 22:38:58] [INFO ] Deduced a trap composed of 7 places in 126 ms of which 7 ms to minimize.
[2023-03-15 22:38:58] [INFO ] Deduced a trap composed of 32 places in 108 ms of which 1 ms to minimize.
[2023-03-15 22:38:58] [INFO ] Deduced a trap composed of 7 places in 99 ms of which 1 ms to minimize.
[2023-03-15 22:38:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 3 trap constraints in 407 ms
[2023-03-15 22:38:58] [INFO ] After 520ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :0
[2023-03-15 22:38:58] [INFO ] After 874ms 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 0 ms.
Successfully simplified 2 atomic propositions for a total of 12 simplifications.
FORMULA ParamProductionCell-PT-4-LTLCardinality-06 TRUE 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' '!(F((X(F((p1&&F(p2))))||p0)))'
Support contains 4 out of 211 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 211/211 places, 199/199 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 208 transition count 196
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 208 transition count 196
Applied a total of 6 rules in 18 ms. Remains 208 /211 variables (removed 3) and now considering 196/199 (removed 3) transitions.
// Phase 1: matrix 196 rows 208 cols
[2023-03-15 22:38:59] [INFO ] Computed 42 place invariants in 3 ms
[2023-03-15 22:38:59] [INFO ] Implicit Places using invariants in 246 ms returned [15, 17, 31, 32, 37, 41, 42, 54, 59, 67, 72, 73, 92, 93, 109, 149, 152, 153, 178, 181, 189]
Discarding 21 places :
Implicit Place search using SMT only with invariants took 248 ms to find 21 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 187/211 places, 196/199 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 185 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 185 transition count 194
Applied a total of 4 rules in 9 ms. Remains 185 /187 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 185 cols
[2023-03-15 22:38:59] [INFO ] Computed 21 place invariants in 2 ms
[2023-03-15 22:38:59] [INFO ] Implicit Places using invariants in 117 ms returned []
[2023-03-15 22:38:59] [INFO ] Invariant cache hit.
[2023-03-15 22:38:59] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-15 22:38:59] [INFO ] Implicit Places using invariants and state equation in 354 ms returned []
Implicit Place search using SMT with State Equation took 476 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 185/211 places, 194/199 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 751 ms. Remains : 185/211 places, 194/199 transitions.
Stuttering acceptance computed with spot in 469 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (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-4-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s91 0) (EQ s35 1)), p1:(OR (EQ s91 0) (EQ s35 1)), p2:(OR (EQ s36 0) (EQ s153 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][false, false, false]]
Product exploration explored 100000 steps with 4355 reset in 655 ms.
Product exploration explored 100000 steps with 4363 reset in 453 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 248 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 118 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 177 ms. (steps per millisecond=56 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-15 22:39:02] [INFO ] Invariant cache hit.
[2023-03-15 22:39:02] [INFO ] After 55ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2023-03-15 22:39:02] [INFO ] [Nat]Absence check using 19 positive place invariants in 7 ms returned sat
[2023-03-15 22:39:02] [INFO ] [Nat]Absence check using 19 positive and 2 generalized place invariants in 8 ms returned sat
[2023-03-15 22:39:02] [INFO ] After 93ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2023-03-15 22:39:02] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-15 22:39:02] [INFO ] After 29ms SMT Verify possible using 68 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2023-03-15 22:39:02] [INFO ] Deduced a trap composed of 5 places in 94 ms of which 2 ms to minimize.
[2023-03-15 22:39:02] [INFO ] Deduced a trap composed of 7 places in 102 ms of which 2 ms to minimize.
[2023-03-15 22:39:02] [INFO ] Deduced a trap composed of 27 places in 110 ms of which 1 ms to minimize.
[2023-03-15 22:39:02] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 0 ms to minimize.
[2023-03-15 22:39:02] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2023-03-15 22:39:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 5 trap constraints in 461 ms
[2023-03-15 22:39:02] [INFO ] After 504ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :0
[2023-03-15 22:39:02] [INFO ] After 673ms 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 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (G (NOT (AND (NOT p0) (NOT p2)))), (G (NOT (AND p1 (NOT p0) (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 8 factoid took 370 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 52 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 37 ms :[(AND (NOT p0) (NOT p1))]
[2023-03-15 22:39:03] [INFO ] Invariant cache hit.
[2023-03-15 22:39:03] [INFO ] [Real]Absence check using 19 positive place invariants in 25 ms returned sat
[2023-03-15 22:39:03] [INFO ] [Real]Absence check using 19 positive and 2 generalized place invariants in 5 ms returned sat
[2023-03-15 22:39:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 22:39:03] [INFO ] [Real]Absence check using state equation in 192 ms returned sat
[2023-03-15 22:39:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 22:39:04] [INFO ] [Nat]Absence check using 19 positive place invariants in 12 ms returned sat
[2023-03-15 22:39:04] [INFO ] [Nat]Absence check using 19 positive and 2 generalized place invariants in 8 ms returned sat
[2023-03-15 22:39:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 22:39:04] [INFO ] [Nat]Absence check using state equation in 176 ms returned sat
[2023-03-15 22:39:04] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-15 22:39:04] [INFO ] [Nat]Added 68 Read/Feed constraints in 37 ms returned sat
[2023-03-15 22:39:04] [INFO ] Deduced a trap composed of 5 places in 74 ms of which 1 ms to minimize.
[2023-03-15 22:39:04] [INFO ] Deduced a trap composed of 6 places in 77 ms of which 0 ms to minimize.
[2023-03-15 22:39:04] [INFO ] Deduced a trap composed of 7 places in 75 ms of which 1 ms to minimize.
[2023-03-15 22:39:04] [INFO ] Deduced a trap composed of 7 places in 85 ms of which 1 ms to minimize.
[2023-03-15 22:39:04] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 0 ms to minimize.
[2023-03-15 22:39:04] [INFO ] Deduced a trap composed of 7 places in 63 ms of which 1 ms to minimize.
[2023-03-15 22:39:05] [INFO ] Deduced a trap composed of 41 places in 66 ms of which 1 ms to minimize.
[2023-03-15 22:39:05] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 656 ms
[2023-03-15 22:39:05] [INFO ] Computed and/alt/rep : 190/309/190 causal constraints (skipped 0 transitions) in 21 ms.
[2023-03-15 22:39:05] [INFO ] Added : 164 causal constraints over 33 iterations in 786 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 2 out of 185 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 185/185 places, 194/194 transitions.
Drop transitions removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 185 transition count 161
Reduce places removed 33 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 34 rules applied. Total rules applied 67 place count 152 transition count 160
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 68 place count 151 transition count 160
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 16 Pre rules applied. Total rules applied 68 place count 151 transition count 144
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 100 place count 135 transition count 144
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 1 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 176 place count 97 transition count 106
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 180 place count 95 transition count 104
Applied a total of 180 rules in 72 ms. Remains 95 /185 variables (removed 90) and now considering 104/194 (removed 90) transitions.
// Phase 1: matrix 104 rows 95 cols
[2023-03-15 22:39:05] [INFO ] Computed 21 place invariants in 2 ms
[2023-03-15 22:39:06] [INFO ] Implicit Places using invariants in 131 ms returned []
[2023-03-15 22:39:06] [INFO ] Invariant cache hit.
[2023-03-15 22:39:06] [INFO ] State equation strengthened by 66 read => feed constraints.
[2023-03-15 22:39:06] [INFO ] Implicit Places using invariants and state equation in 322 ms returned []
Implicit Place search using SMT with State Equation took 459 ms to find 0 implicit places.
[2023-03-15 22:39:06] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-15 22:39:06] [INFO ] Invariant cache hit.
[2023-03-15 22:39:06] [INFO ] Dead Transitions using invariants and state equation in 122 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 95/185 places, 104/194 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 668 ms. Remains : 95/185 places, 104/194 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 166 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(AND (NOT p0) (NOT p1))]
Finished random walk after 10 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=10 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 3 factoid took 126 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 36 ms :[(AND (NOT p0) (NOT p1))]
[2023-03-15 22:39:06] [INFO ] Invariant cache hit.
[2023-03-15 22:39:07] [INFO ] [Real]Absence check using 19 positive place invariants in 11 ms returned sat
[2023-03-15 22:39:07] [INFO ] [Real]Absence check using 19 positive and 2 generalized place invariants in 8 ms returned sat
[2023-03-15 22:39:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 22:39:07] [INFO ] [Real]Absence check using state equation in 108 ms returned sat
[2023-03-15 22:39:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 22:39:07] [INFO ] [Nat]Absence check using 19 positive place invariants in 15 ms returned sat
[2023-03-15 22:39:07] [INFO ] [Nat]Absence check using 19 positive and 2 generalized place invariants in 3 ms returned sat
[2023-03-15 22:39:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 22:39:07] [INFO ] [Nat]Absence check using state equation in 95 ms returned sat
[2023-03-15 22:39:07] [INFO ] State equation strengthened by 66 read => feed constraints.
[2023-03-15 22:39:07] [INFO ] [Nat]Added 66 Read/Feed constraints in 14 ms returned sat
[2023-03-15 22:39:07] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 2 ms to minimize.
[2023-03-15 22:39:07] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 0 ms to minimize.
[2023-03-15 22:39:07] [INFO ] Deduced a trap composed of 6 places in 46 ms of which 0 ms to minimize.
[2023-03-15 22:39:07] [INFO ] Deduced a trap composed of 6 places in 39 ms of which 0 ms to minimize.
[2023-03-15 22:39:07] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
[2023-03-15 22:39:07] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2023-03-15 22:39:07] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 1 ms to minimize.
[2023-03-15 22:39:07] [INFO ] Deduced a trap composed of 5 places in 48 ms of which 0 ms to minimize.
[2023-03-15 22:39:07] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 442 ms
[2023-03-15 22:39:07] [INFO ] Computed and/alt/rep : 101/219/101 causal constraints (skipped 0 transitions) in 13 ms.
[2023-03-15 22:39:08] [INFO ] Added : 41 causal constraints over 9 iterations in 147 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 37 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 10244 reset in 166 ms.
Product exploration explored 100000 steps with 10325 reset in 159 ms.
Built C files in :
/tmp/ltsmin4168718713733673108
[2023-03-15 22:39:08] [INFO ] Computing symmetric may disable matrix : 104 transitions.
[2023-03-15 22:39:08] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-15 22:39:08] [INFO ] Computing symmetric may enable matrix : 104 transitions.
[2023-03-15 22:39:08] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-15 22:39:08] [INFO ] Computing Do-Not-Accords matrix : 104 transitions.
[2023-03-15 22:39:08] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-15 22:39:08] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4168718713733673108
Running compilation step : cd /tmp/ltsmin4168718713733673108;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 474 ms.
Running link step : cd /tmp/ltsmin4168718713733673108;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin4168718713733673108;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4340715243489557713.hoa' '--buchi-type=spotba'
LTSmin run took 175 ms.
FORMULA ParamProductionCell-PT-4-LTLCardinality-00 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ParamProductionCell-PT-4-LTLCardinality-00 finished in 10080 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 211 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 211/211 places, 199/199 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 209 transition count 197
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 209 transition count 197
Applied a total of 4 rules in 10 ms. Remains 209 /211 variables (removed 2) and now considering 197/199 (removed 2) transitions.
// Phase 1: matrix 197 rows 209 cols
[2023-03-15 22:39:09] [INFO ] Computed 42 place invariants in 3 ms
[2023-03-15 22:39:09] [INFO ] Implicit Places using invariants in 186 ms returned [15, 17, 31, 32, 37, 41, 42, 54, 59, 67, 72, 73, 92, 93, 106, 109, 150, 153, 154, 179, 182, 190]
Discarding 22 places :
Implicit Place search using SMT only with invariants took 188 ms to find 22 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 187/211 places, 197/199 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 185 transition count 195
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 185 transition count 195
Applied a total of 4 rules in 8 ms. Remains 185 /187 variables (removed 2) and now considering 195/197 (removed 2) transitions.
// Phase 1: matrix 195 rows 185 cols
[2023-03-15 22:39:09] [INFO ] Computed 20 place invariants in 2 ms
[2023-03-15 22:39:09] [INFO ] Implicit Places using invariants in 101 ms returned []
[2023-03-15 22:39:09] [INFO ] Invariant cache hit.
[2023-03-15 22:39:09] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-15 22:39:09] [INFO ] Implicit Places using invariants and state equation in 321 ms returned []
Implicit Place search using SMT with State Equation took 429 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 185/211 places, 195/199 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 637 ms. Remains : 185/211 places, 195/199 transitions.
Stuttering acceptance computed with spot in 86 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-4-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s106 0) (EQ s162 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 89276 steps with 0 reset in 143 ms.
FORMULA ParamProductionCell-PT-4-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-4-LTLCardinality-01 finished in 887 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)&&(F(p1)||X(F(p2))))))'
Support contains 4 out of 211 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 211/211 places, 199/199 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 211 transition count 197
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 209 transition count 197
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 4 place count 209 transition count 181
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 36 place count 193 transition count 181
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 39 place count 190 transition count 178
Iterating global reduction 2 with 3 rules applied. Total rules applied 42 place count 190 transition count 178
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 2 with 82 rules applied. Total rules applied 124 place count 149 transition count 137
Applied a total of 124 rules in 32 ms. Remains 149 /211 variables (removed 62) and now considering 137/199 (removed 62) transitions.
// Phase 1: matrix 137 rows 149 cols
[2023-03-15 22:39:10] [INFO ] Computed 42 place invariants in 3 ms
[2023-03-15 22:39:10] [INFO ] Implicit Places using invariants in 161 ms returned [14, 16, 24, 25, 28, 32, 33, 46, 50, 54, 66, 67, 79, 81, 108, 111, 112, 131, 134, 138]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 164 ms to find 20 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 129/211 places, 137/199 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 129 transition count 133
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 125 transition count 133
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 8 place count 125 transition count 131
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 12 place count 123 transition count 131
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 68 place count 95 transition count 103
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 72 place count 93 transition count 101
Applied a total of 72 rules in 19 ms. Remains 93 /129 variables (removed 36) and now considering 101/137 (removed 36) transitions.
// Phase 1: matrix 101 rows 93 cols
[2023-03-15 22:39:10] [INFO ] Computed 22 place invariants in 0 ms
[2023-03-15 22:39:10] [INFO ] Implicit Places using invariants in 80 ms returned []
[2023-03-15 22:39:10] [INFO ] Invariant cache hit.
[2023-03-15 22:39:10] [INFO ] State equation strengthened by 66 read => feed constraints.
[2023-03-15 22:39:10] [INFO ] Implicit Places using invariants and state equation in 218 ms returned []
Implicit Place search using SMT with State Equation took 301 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 93/211 places, 101/199 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 516 ms. Remains : 93/211 places, 101/199 transitions.
Stuttering acceptance computed with spot in 116 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ParamProductionCell-PT-4-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s35 0) (EQ s46 1)), p1:(AND (EQ s46 0) (EQ s35 1)), p2:(OR (EQ s25 0) (EQ s32 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 2691 reset in 196 ms.
Product exploration explored 100000 steps with 2689 reset in 172 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X p0), (X (AND (NOT p1) (NOT p2))), (X (X p0)), (X (X (AND (NOT p1) (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 303 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter insensitive) to 3 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 214 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Finished random walk after 35 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=17 )
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X p0), (X (AND (NOT p1) (NOT p2))), (X (X p0)), (X (X (AND (NOT p1) (NOT p2))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND (NOT p1) (NOT p2)))), (F p1)]
Knowledge based reduction with 5 factoid took 344 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter insensitive) to 3 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 148 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 124 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
[2023-03-15 22:39:12] [INFO ] Invariant cache hit.
[2023-03-15 22:39:12] [INFO ] [Real]Absence check using 19 positive place invariants in 6 ms returned sat
[2023-03-15 22:39:12] [INFO ] [Real]Absence check using 19 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-15 22:39:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 22:39:12] [INFO ] [Real]Absence check using state equation in 64 ms returned sat
[2023-03-15 22:39:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 22:39:12] [INFO ] [Nat]Absence check using 19 positive place invariants in 11 ms returned sat
[2023-03-15 22:39:12] [INFO ] [Nat]Absence check using 19 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-15 22:39:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 22:39:12] [INFO ] [Nat]Absence check using state equation in 94 ms returned sat
[2023-03-15 22:39:12] [INFO ] State equation strengthened by 66 read => feed constraints.
[2023-03-15 22:39:12] [INFO ] [Nat]Added 66 Read/Feed constraints in 26 ms returned sat
[2023-03-15 22:39:12] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 1 ms to minimize.
[2023-03-15 22:39:12] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 1 ms to minimize.
[2023-03-15 22:39:12] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
[2023-03-15 22:39:12] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 0 ms to minimize.
[2023-03-15 22:39:12] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 0 ms to minimize.
[2023-03-15 22:39:12] [INFO ] Deduced a trap composed of 6 places in 43 ms of which 1 ms to minimize.
[2023-03-15 22:39:13] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 1 ms to minimize.
[2023-03-15 22:39:13] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 1 ms to minimize.
[2023-03-15 22:39:13] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2023-03-15 22:39:13] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
[2023-03-15 22:39:13] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 2 ms to minimize.
[2023-03-15 22:39:13] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 8 ms to minimize.
[2023-03-15 22:39:13] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 0 ms to minimize.
[2023-03-15 22:39:13] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 0 ms to minimize.
[2023-03-15 22:39:13] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 1 ms to minimize.
[2023-03-15 22:39:13] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 0 ms to minimize.
[2023-03-15 22:39:13] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
[2023-03-15 22:39:13] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2023-03-15 22:39:13] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2023-03-15 22:39:13] [INFO ] Deduced a trap composed of 6 places in 49 ms of which 0 ms to minimize.
[2023-03-15 22:39:13] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2023-03-15 22:39:13] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 1 ms to minimize.
[2023-03-15 22:39:13] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 1271 ms
[2023-03-15 22:39:13] [INFO ] Computed and/alt/rep : 98/230/98 causal constraints (skipped 0 transitions) in 11 ms.
[2023-03-15 22:39:14] [INFO ] Added : 87 causal constraints over 18 iterations in 268 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2))
Support contains 4 out of 93 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 93/93 places, 101/101 transitions.
Applied a total of 0 rules in 7 ms. Remains 93 /93 variables (removed 0) and now considering 101/101 (removed 0) transitions.
[2023-03-15 22:39:14] [INFO ] Invariant cache hit.
[2023-03-15 22:39:14] [INFO ] Implicit Places using invariants in 118 ms returned []
[2023-03-15 22:39:14] [INFO ] Invariant cache hit.
[2023-03-15 22:39:14] [INFO ] State equation strengthened by 66 read => feed constraints.
[2023-03-15 22:39:14] [INFO ] Implicit Places using invariants and state equation in 272 ms returned []
Implicit Place search using SMT with State Equation took 393 ms to find 0 implicit places.
[2023-03-15 22:39:14] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-15 22:39:14] [INFO ] Invariant cache hit.
[2023-03-15 22:39:14] [INFO ] Dead Transitions using invariants and state equation in 111 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 523 ms. Remains : 93/93 places, 101/101 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X p0), (X (AND (NOT p1) (NOT p2))), (X (X p0)), (X (X (AND (NOT p1) (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 264 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter insensitive) to 3 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 151 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Finished random walk after 32 steps, including 0 resets, run visited all 3 properties in 3 ms. (steps per millisecond=10 )
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X p0), (X (AND (NOT p1) (NOT p2))), (X (X p0)), (X (X (AND (NOT p1) (NOT p2))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND (NOT p1) (NOT p2)))), (F p1)]
Knowledge based reduction with 5 factoid took 345 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter insensitive) to 3 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 168 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 153 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
[2023-03-15 22:39:15] [INFO ] Invariant cache hit.
[2023-03-15 22:39:15] [INFO ] [Real]Absence check using 19 positive place invariants in 9 ms returned sat
[2023-03-15 22:39:15] [INFO ] [Real]Absence check using 19 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-15 22:39:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 22:39:16] [INFO ] [Real]Absence check using state equation in 74 ms returned sat
[2023-03-15 22:39:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 22:39:16] [INFO ] [Nat]Absence check using 19 positive place invariants in 9 ms returned sat
[2023-03-15 22:39:16] [INFO ] [Nat]Absence check using 19 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-15 22:39:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 22:39:16] [INFO ] [Nat]Absence check using state equation in 78 ms returned sat
[2023-03-15 22:39:16] [INFO ] State equation strengthened by 66 read => feed constraints.
[2023-03-15 22:39:16] [INFO ] [Nat]Added 66 Read/Feed constraints in 19 ms returned sat
[2023-03-15 22:39:16] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 1 ms to minimize.
[2023-03-15 22:39:16] [INFO ] Deduced a trap composed of 5 places in 58 ms of which 0 ms to minimize.
[2023-03-15 22:39:16] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 0 ms to minimize.
[2023-03-15 22:39:16] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 1 ms to minimize.
[2023-03-15 22:39:16] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 0 ms to minimize.
[2023-03-15 22:39:16] [INFO ] Deduced a trap composed of 6 places in 53 ms of which 3 ms to minimize.
[2023-03-15 22:39:16] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 0 ms to minimize.
[2023-03-15 22:39:16] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 1 ms to minimize.
[2023-03-15 22:39:16] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2023-03-15 22:39:16] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 0 ms to minimize.
[2023-03-15 22:39:16] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2023-03-15 22:39:17] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 12 ms to minimize.
[2023-03-15 22:39:17] [INFO ] Deduced a trap composed of 11 places in 19 ms of which 1 ms to minimize.
[2023-03-15 22:39:17] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 0 ms to minimize.
[2023-03-15 22:39:17] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
[2023-03-15 22:39:17] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2023-03-15 22:39:17] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 0 ms to minimize.
[2023-03-15 22:39:17] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 0 ms to minimize.
[2023-03-15 22:39:17] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 0 ms to minimize.
[2023-03-15 22:39:17] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 0 ms to minimize.
[2023-03-15 22:39:17] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 0 ms to minimize.
[2023-03-15 22:39:17] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 1 ms to minimize.
[2023-03-15 22:39:17] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 1182 ms
[2023-03-15 22:39:17] [INFO ] Computed and/alt/rep : 98/230/98 causal constraints (skipped 0 transitions) in 11 ms.
[2023-03-15 22:39:17] [INFO ] Added : 87 causal constraints over 18 iterations in 253 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2))
Stuttering acceptance computed with spot in 133 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 2688 reset in 210 ms.
Product exploration explored 100000 steps with 2692 reset in 276 ms.
Built C files in :
/tmp/ltsmin10531389698297024521
[2023-03-15 22:39:18] [INFO ] Computing symmetric may disable matrix : 101 transitions.
[2023-03-15 22:39:18] [INFO ] Computation of Complete disable matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-15 22:39:18] [INFO ] Computing symmetric may enable matrix : 101 transitions.
[2023-03-15 22:39:18] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-15 22:39:18] [INFO ] Computing Do-Not-Accords matrix : 101 transitions.
[2023-03-15 22:39:18] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-15 22:39:18] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10531389698297024521
Running compilation step : cd /tmp/ltsmin10531389698297024521;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 314 ms.
Running link step : cd /tmp/ltsmin10531389698297024521;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin10531389698297024521;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased14726079882693425121.hoa' '--buchi-type=spotba'
LTSmin run took 4338 ms.
FORMULA ParamProductionCell-PT-4-LTLCardinality-02 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ParamProductionCell-PT-4-LTLCardinality-02 finished in 12979 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U G(p1)) U (p2 U (p0&&G(p3)))))'
Support contains 8 out of 211 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 211/211 places, 199/199 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 211 transition count 197
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 209 transition count 197
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 4 place count 209 transition count 180
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 38 place count 192 transition count 180
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 40 place count 190 transition count 178
Iterating global reduction 2 with 2 rules applied. Total rules applied 42 place count 190 transition count 178
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 1 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 2 with 82 rules applied. Total rules applied 124 place count 149 transition count 137
Applied a total of 124 rules in 25 ms. Remains 149 /211 variables (removed 62) and now considering 137/199 (removed 62) transitions.
// Phase 1: matrix 137 rows 149 cols
[2023-03-15 22:39:23] [INFO ] Computed 42 place invariants in 1 ms
[2023-03-15 22:39:23] [INFO ] Implicit Places using invariants in 201 ms returned [14, 16, 25, 26, 29, 34, 42, 45, 49, 52, 53, 66, 78, 80, 108, 111, 112, 131, 134, 138]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 203 ms to find 20 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 129/211 places, 137/199 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 129 transition count 133
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 125 transition count 133
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 52 place count 103 transition count 111
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 56 place count 101 transition count 109
Applied a total of 56 rules in 14 ms. Remains 101 /129 variables (removed 28) and now considering 109/137 (removed 28) transitions.
// Phase 1: matrix 109 rows 101 cols
[2023-03-15 22:39:23] [INFO ] Computed 22 place invariants in 1 ms
[2023-03-15 22:39:23] [INFO ] Implicit Places using invariants in 86 ms returned []
[2023-03-15 22:39:23] [INFO ] Invariant cache hit.
[2023-03-15 22:39:23] [INFO ] State equation strengthened by 66 read => feed constraints.
[2023-03-15 22:39:23] [INFO ] Implicit Places using invariants and state equation in 192 ms returned []
Implicit Place search using SMT with State Equation took 280 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 101/211 places, 109/199 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 524 ms. Remains : 101/211 places, 109/199 transitions.
Stuttering acceptance computed with spot in 529 ms :[(OR (NOT p0) (NOT p3)), true, (NOT p1), (NOT p1), (OR (NOT p0) (NOT p3)), (AND p0 (NOT p1) (NOT p3)), (AND (NOT p1) p2 (NOT p3)), (NOT p3), (NOT p3), (NOT p3), (OR (AND p0 (NOT p1) (NOT p3)) (AND (NOT p1) p2 (NOT p3)))]
Running random walk in product with property : ParamProductionCell-PT-4-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p0) p1) (AND p0 (NOT p3))), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=0 dest: 2}, { cond=(AND p0 (NOT p3) (NOT p2)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=0 dest: 4}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=0 dest: 5}, { cond=(AND p0 p3 (NOT p2)), acceptance={} source=0 dest: 6}, { cond=(AND p0 p3), acceptance={} source=0 dest: 7}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p3) (NOT p2))), acceptance={} source=4 dest: 1}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p3) p2)), acceptance={0} source=4 dest: 4}, { cond=(AND p0 p3 (NOT p2)), acceptance={} source=4 dest: 8}, { cond=(AND p0 p3 p2), acceptance={} source=4 dest: 9}], [{ cond=(AND p0 (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=5 dest: 1}, { cond=(AND p0 (NOT p3) (NOT p2) p1), acceptance={} source=5 dest: 2}, { cond=(AND p0 (NOT p3) p2 (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(AND p0 p2 p1), acceptance={} source=5 dest: 5}, { cond=(AND p0 p3 (NOT p2) (NOT p1)), acceptance={} source=5 dest: 8}, { cond=(AND p0 p3 p2 (NOT p1)), acceptance={} source=5 dest: 9}, { cond=(AND p0 p3 (NOT p2) p1), acceptance={} source=5 dest: 10}], [{ cond=(AND (NOT p0) (NOT p3) p2 (NOT p1)), acceptance={} source=6 dest: 1}, { cond=(AND (NOT p0) (NOT p3) p2 p1), acceptance={} source=6 dest: 2}, { cond=(AND p0 (NOT p3) p2), acceptance={} source=6 dest: 3}, { cond=(AND p0 p3 p2), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p0) p3 p2 (NOT p1)), acceptance={} source=6 dest: 8}, { cond=(AND (NOT p0) p3 p2 p1), acceptance={} source=6 dest: 10}], [{ cond=(OR (AND p0 (NOT p3)) (AND (NOT p3) p1)), acceptance={0} source=7 dest: 0}, { cond=(AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=7 dest: 1}, { cond=(AND (NOT p0) (NOT p3) (NOT p2) p1), acceptance={} source=7 dest: 2}, { cond=(AND p0 (NOT p3) (NOT p2)), acceptance={} source=7 dest: 3}, { cond=(AND (NOT p0) (NOT p3) p2 (NOT p1)), acceptance={} source=7 dest: 4}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=7 dest: 5}, { cond=(AND p0 p3 (NOT p2)), acceptance={} source=7 dest: 6}, { cond=(OR (AND p0 p3) (AND p3 p1)), acceptance={} source=7 dest: 7}, { cond=(AND (NOT p0) p3 (NOT p2) (NOT p1)), acceptance={} source=7 dest: 8}, { cond=(AND (NOT p0) p3 p2 (NOT p1)), acceptance={} source=7 dest: 9}, { cond=(AND (NOT p0) p3 (NOT p2) p1), acceptance={} source=7 dest: 10}], [{ cond=(NOT p3), acceptance={} source=8 dest: 1}, { cond=p3, acceptance={} source=8 dest: 8}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=9 dest: 1}, { cond=(AND (NOT p3) p2), acceptance={0} source=9 dest: 4}, { cond=(AND p3 (NOT p2)), acceptance={} source=9 dest: 8}, { cond=(AND p3 p2), acceptance={} source=9 dest: 9}], [{ cond=(OR (AND p0 (NOT p3) (NOT p1)) (AND (NOT p3) p2 (NOT p1))), acceptance={} source=10 dest: 1}, { cond=(OR (AND p0 (NOT p3) p1) (AND (NOT p3) p2 p1)), acceptance={} source=10 dest: 2}, { cond=(OR (AND p0 p3 (NOT p1)) (AND p3 p2 (NOT p1))), acceptance={} source=10 dest: 8}, { cond=(OR (AND p0 p3 p1) (AND p3 p2 p1)), acceptance={} source=10 dest: 10}]], initial=0, aps=[p0:(OR (EQ s78 0) (EQ s44 1)), p1:(OR (EQ s68 0) (EQ s58 1)), p3:(OR (EQ s14 0) (EQ s23 1)), p2:(OR (EQ s75 0) (EQ s91 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][true, true, true, true, true, true, true, true, true, true, true]]
Entered a terminal (fully accepting) state of product in 96 steps with 0 reset in 1 ms.
FORMULA ParamProductionCell-PT-4-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-4-LTLCardinality-04 finished in 1180 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&(X(X(p1)) U ((!p1&&X(X(p1)))||X(X(G(p1)))))))'
Support contains 2 out of 211 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 211/211 places, 199/199 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 208 transition count 196
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 208 transition count 196
Applied a total of 6 rules in 5 ms. Remains 208 /211 variables (removed 3) and now considering 196/199 (removed 3) transitions.
// Phase 1: matrix 196 rows 208 cols
[2023-03-15 22:39:24] [INFO ] Computed 42 place invariants in 2 ms
[2023-03-15 22:39:24] [INFO ] Implicit Places using invariants in 224 ms returned [15, 17, 31, 32, 37, 41, 42, 54, 59, 67, 72, 73, 92, 93, 106, 109, 149, 152, 153, 178, 181, 189]
Discarding 22 places :
Implicit Place search using SMT only with invariants took 226 ms to find 22 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 186/211 places, 196/199 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 184 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 184 transition count 194
Applied a total of 4 rules in 4 ms. Remains 184 /186 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 184 cols
[2023-03-15 22:39:24] [INFO ] Computed 20 place invariants in 1 ms
[2023-03-15 22:39:24] [INFO ] Implicit Places using invariants in 129 ms returned []
[2023-03-15 22:39:24] [INFO ] Invariant cache hit.
[2023-03-15 22:39:24] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-15 22:39:24] [INFO ] Implicit Places using invariants and state equation in 305 ms returned []
Implicit Place search using SMT with State Equation took 437 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 184/211 places, 194/199 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 673 ms. Remains : 184/211 places, 194/199 transitions.
Stuttering acceptance computed with spot in 238 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : ParamProductionCell-PT-4-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 4}]], initial=0, aps=[p1:(EQ s35 1), p0:(EQ s73 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ParamProductionCell-PT-4-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-4-LTLCardinality-05 finished in 932 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(p0)))'
Support contains 2 out of 211 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 211/211 places, 199/199 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 209 transition count 197
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 209 transition count 197
Applied a total of 4 rules in 5 ms. Remains 209 /211 variables (removed 2) and now considering 197/199 (removed 2) transitions.
// Phase 1: matrix 197 rows 209 cols
[2023-03-15 22:39:25] [INFO ] Computed 42 place invariants in 1 ms
[2023-03-15 22:39:25] [INFO ] Implicit Places using invariants in 305 ms returned [15, 17, 31, 32, 37, 41, 42, 54, 59, 67, 72, 73, 92, 93, 106, 109, 150, 153, 154, 179, 182, 190]
Discarding 22 places :
Implicit Place search using SMT only with invariants took 307 ms to find 22 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 187/211 places, 197/199 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 185 transition count 195
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 185 transition count 195
Applied a total of 4 rules in 3 ms. Remains 185 /187 variables (removed 2) and now considering 195/197 (removed 2) transitions.
// Phase 1: matrix 195 rows 185 cols
[2023-03-15 22:39:25] [INFO ] Computed 20 place invariants in 2 ms
[2023-03-15 22:39:25] [INFO ] Implicit Places using invariants in 158 ms returned []
[2023-03-15 22:39:25] [INFO ] Invariant cache hit.
[2023-03-15 22:39:25] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-15 22:39:25] [INFO ] Implicit Places using invariants and state equation in 335 ms returned []
Implicit Place search using SMT with State Equation took 496 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 185/211 places, 195/199 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 813 ms. Remains : 185/211 places, 195/199 transitions.
Stuttering acceptance computed with spot in 141 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-4-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=3, aps=[p0:(AND (NEQ s131 0) (NEQ s105 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 2 steps with 0 reset in 0 ms.
FORMULA ParamProductionCell-PT-4-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-4-LTLCardinality-08 finished in 969 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 2 out of 211 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 211/211 places, 199/199 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 211 transition count 197
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 209 transition count 197
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 4 place count 209 transition count 181
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 36 place count 193 transition count 181
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 39 place count 190 transition count 178
Iterating global reduction 2 with 3 rules applied. Total rules applied 42 place count 190 transition count 178
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 2 with 82 rules applied. Total rules applied 124 place count 149 transition count 137
Applied a total of 124 rules in 20 ms. Remains 149 /211 variables (removed 62) and now considering 137/199 (removed 62) transitions.
// Phase 1: matrix 137 rows 149 cols
[2023-03-15 22:39:26] [INFO ] Computed 42 place invariants in 2 ms
[2023-03-15 22:39:26] [INFO ] Implicit Places using invariants in 196 ms returned [15, 17, 26, 27, 30, 34, 35, 43, 46, 50, 53, 54, 66, 67, 79, 81, 108, 111, 112, 131, 134, 138]
Discarding 22 places :
Implicit Place search using SMT only with invariants took 198 ms to find 22 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 127/211 places, 137/199 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 127 transition count 132
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 122 transition count 132
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 10 place count 122 transition count 131
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 121 transition count 131
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 76 place count 89 transition count 99
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 80 place count 87 transition count 97
Applied a total of 80 rules in 13 ms. Remains 87 /127 variables (removed 40) and now considering 97/137 (removed 40) transitions.
// Phase 1: matrix 97 rows 87 cols
[2023-03-15 22:39:26] [INFO ] Computed 20 place invariants in 1 ms
[2023-03-15 22:39:26] [INFO ] Implicit Places using invariants in 130 ms returned []
[2023-03-15 22:39:26] [INFO ] Invariant cache hit.
[2023-03-15 22:39:26] [INFO ] State equation strengthened by 66 read => feed constraints.
[2023-03-15 22:39:26] [INFO ] Implicit Places using invariants and state equation in 257 ms returned []
Implicit Place search using SMT with State Equation took 390 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 87/211 places, 97/199 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 621 ms. Remains : 87/211 places, 97/199 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-4-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s23 0) (EQ s10 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 6485 reset in 121 ms.
Stack based approach found an accepted trace after 51483 steps with 3330 reset with depth 90 and stack size 90 in 69 ms.
FORMULA ParamProductionCell-PT-4-LTLCardinality-09 FALSE TECHNIQUES STACK_TEST
Treatment of property ParamProductionCell-PT-4-LTLCardinality-09 finished in 866 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(X(X(G((p0||X(G(p1)))))))))'
Support contains 2 out of 211 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 211/211 places, 199/199 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 208 transition count 196
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 208 transition count 196
Applied a total of 6 rules in 5 ms. Remains 208 /211 variables (removed 3) and now considering 196/199 (removed 3) transitions.
// Phase 1: matrix 196 rows 208 cols
[2023-03-15 22:39:27] [INFO ] Computed 42 place invariants in 2 ms
[2023-03-15 22:39:27] [INFO ] Implicit Places using invariants in 221 ms returned [15, 31, 32, 37, 41, 42, 54, 59, 67, 72, 73, 92, 93, 106, 109, 149, 152, 153, 178, 181, 189]
Discarding 21 places :
Implicit Place search using SMT only with invariants took 225 ms to find 21 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 187/211 places, 196/199 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 185 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 185 transition count 194
Applied a total of 4 rules in 3 ms. Remains 185 /187 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 185 cols
[2023-03-15 22:39:27] [INFO ] Computed 21 place invariants in 1 ms
[2023-03-15 22:39:27] [INFO ] Implicit Places using invariants in 117 ms returned []
[2023-03-15 22:39:27] [INFO ] Invariant cache hit.
[2023-03-15 22:39:27] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-15 22:39:27] [INFO ] Implicit Places using invariants and state equation in 310 ms returned []
Implicit Place search using SMT with State Equation took 429 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 185/211 places, 194/199 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 663 ms. Remains : 185/211 places, 194/199 transitions.
Stuttering acceptance computed with spot in 277 ms :[true, (NOT p1), (AND (NOT p0) (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-4-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}], [{ cond=true, acceptance={} source=6 dest: 5}]], initial=6, aps=[p1:(OR (EQ s16 0) (EQ s17 1)), p0:(AND (EQ s17 0) (EQ s16 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 18 steps with 0 reset in 1 ms.
FORMULA ParamProductionCell-PT-4-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-4-LTLCardinality-10 finished in 957 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)&&F(p1))))'
Support contains 4 out of 211 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 211/211 places, 199/199 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 211 transition count 198
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 210 transition count 198
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 2 place count 210 transition count 182
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 34 place count 194 transition count 182
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 37 place count 191 transition count 179
Iterating global reduction 2 with 3 rules applied. Total rules applied 40 place count 191 transition count 179
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 120 place count 151 transition count 139
Applied a total of 120 rules in 18 ms. Remains 151 /211 variables (removed 60) and now considering 139/199 (removed 60) transitions.
// Phase 1: matrix 139 rows 151 cols
[2023-03-15 22:39:27] [INFO ] Computed 42 place invariants in 1 ms
[2023-03-15 22:39:28] [INFO ] Implicit Places using invariants in 272 ms returned [14, 16, 24, 29, 33, 43, 46, 51, 54, 55, 67, 68, 80, 82, 109, 112, 113, 132, 135, 139]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 273 ms to find 20 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 131/211 places, 139/199 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 131 transition count 134
Reduce places removed 5 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 7 rules applied. Total rules applied 12 place count 126 transition count 132
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 14 place count 124 transition count 132
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 72 place count 95 transition count 103
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 76 place count 93 transition count 101
Applied a total of 76 rules in 10 ms. Remains 93 /131 variables (removed 38) and now considering 101/139 (removed 38) transitions.
// Phase 1: matrix 101 rows 93 cols
[2023-03-15 22:39:28] [INFO ] Computed 22 place invariants in 1 ms
[2023-03-15 22:39:28] [INFO ] Implicit Places using invariants in 102 ms returned []
[2023-03-15 22:39:28] [INFO ] Invariant cache hit.
[2023-03-15 22:39:28] [INFO ] State equation strengthened by 66 read => feed constraints.
[2023-03-15 22:39:28] [INFO ] Implicit Places using invariants and state equation in 253 ms returned []
Implicit Place search using SMT with State Equation took 358 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 93/211 places, 101/199 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 660 ms. Remains : 93/211 places, 101/199 transitions.
Stuttering acceptance computed with spot in 122 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ParamProductionCell-PT-4-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s31 0) (EQ s18 1)), p1:(AND (EQ s24 0) (EQ s1 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 1787 reset in 127 ms.
Stack based approach found an accepted trace after 748 steps with 20 reset with depth 128 and stack size 128 in 2 ms.
FORMULA ParamProductionCell-PT-4-LTLCardinality-12 FALSE TECHNIQUES STACK_TEST
Treatment of property ParamProductionCell-PT-4-LTLCardinality-12 finished in 929 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&&X(X(F(p1))))))'
Support contains 4 out of 211 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 211/211 places, 199/199 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 208 transition count 196
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 208 transition count 196
Applied a total of 6 rules in 4 ms. Remains 208 /211 variables (removed 3) and now considering 196/199 (removed 3) transitions.
// Phase 1: matrix 196 rows 208 cols
[2023-03-15 22:39:28] [INFO ] Computed 42 place invariants in 1 ms
[2023-03-15 22:39:29] [INFO ] Implicit Places using invariants in 219 ms returned [15, 17, 31, 32, 37, 41, 42, 54, 59, 67, 72, 73, 92, 93, 106, 109, 149, 152, 178, 181, 189]
Discarding 21 places :
Implicit Place search using SMT only with invariants took 220 ms to find 21 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 187/211 places, 196/199 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 185 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 185 transition count 194
Applied a total of 4 rules in 4 ms. Remains 185 /187 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 185 cols
[2023-03-15 22:39:29] [INFO ] Computed 21 place invariants in 2 ms
[2023-03-15 22:39:29] [INFO ] Implicit Places using invariants in 102 ms returned []
[2023-03-15 22:39:29] [INFO ] Invariant cache hit.
[2023-03-15 22:39:29] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-15 22:39:29] [INFO ] Implicit Places using invariants and state equation in 359 ms returned []
Implicit Place search using SMT with State Equation took 463 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 185/211 places, 194/199 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 693 ms. Remains : 185/211 places, 194/199 transitions.
Stuttering acceptance computed with spot in 164 ms :[(NOT p1), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ParamProductionCell-PT-4-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=p0, acceptance={0} source=2 dest: 1}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=2, aps=[p1:(AND (EQ s35 0) (EQ s134 1)), p0:(OR (EQ s27 0) (EQ s93 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][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 205 ms.
Product exploration explored 100000 steps with 33333 reset in 211 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 p0), (X p0), true, (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p1))
Knowledge based reduction with 5 factoid took 157 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ParamProductionCell-PT-4-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ParamProductionCell-PT-4-LTLCardinality-13 finished in 1451 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 1 out of 211 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 211/211 places, 199/199 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 211 transition count 197
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 209 transition count 197
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 4 place count 209 transition count 181
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 36 place count 193 transition count 181
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 39 place count 190 transition count 178
Iterating global reduction 2 with 3 rules applied. Total rules applied 42 place count 190 transition count 178
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 2 with 84 rules applied. Total rules applied 126 place count 148 transition count 136
Applied a total of 126 rules in 27 ms. Remains 148 /211 variables (removed 63) and now considering 136/199 (removed 63) transitions.
// Phase 1: matrix 136 rows 148 cols
[2023-03-15 22:39:30] [INFO ] Computed 42 place invariants in 2 ms
[2023-03-15 22:39:30] [INFO ] Implicit Places using invariants in 235 ms returned [14, 16, 24, 25, 28, 32, 33, 41, 44, 48, 51, 52, 64, 65, 77, 79, 106, 109, 110, 129, 132, 137]
Discarding 22 places :
Implicit Place search using SMT only with invariants took 247 ms to find 22 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 126/211 places, 136/199 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 126 transition count 131
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 121 transition count 131
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 10 place count 121 transition count 129
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 14 place count 119 transition count 129
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 78 place count 87 transition count 97
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 82 place count 85 transition count 95
Applied a total of 82 rules in 12 ms. Remains 85 /126 variables (removed 41) and now considering 95/136 (removed 41) transitions.
// Phase 1: matrix 95 rows 85 cols
[2023-03-15 22:39:30] [INFO ] Computed 20 place invariants in 1 ms
[2023-03-15 22:39:30] [INFO ] Implicit Places using invariants in 102 ms returned []
[2023-03-15 22:39:30] [INFO ] Invariant cache hit.
[2023-03-15 22:39:30] [INFO ] State equation strengthened by 66 read => feed constraints.
[2023-03-15 22:39:30] [INFO ] Implicit Places using invariants and state equation in 167 ms returned []
Implicit Place search using SMT with State Equation took 271 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 85/211 places, 95/199 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 557 ms. Remains : 85/211 places, 95/199 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-4-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s77 0)], 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 128 ms.
Stack based approach found an accepted trace after 162 steps with 0 reset with depth 163 and stack size 163 in 1 ms.
FORMULA ParamProductionCell-PT-4-LTLCardinality-15 FALSE TECHNIQUES STACK_TEST
Treatment of property ParamProductionCell-PT-4-LTLCardinality-15 finished in 745 ms.
All properties solved by simple procedures.
Total runtime 36157 ms.

BK_STOP 1678919972096

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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