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.r485-tall-167912700401179.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 UtilityControlRoom-PT-Z4T3N10, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r485-tall-167912700401179
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.7M
-rw-r--r-- 1 mcc users 45K Feb 26 14:43 CTLCardinality.txt
-rw-r--r-- 1 mcc users 215K Feb 26 14:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 42K Feb 26 14:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 167K Feb 26 14:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 21K Feb 25 17:25 LTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Feb 25 17:25 LTLCardinality.xml
-rw-r--r-- 1 mcc users 68K Feb 25 17:25 LTLFireability.txt
-rw-r--r-- 1 mcc users 186K Feb 25 17:25 LTLFireability.xml
-rw-r--r-- 1 mcc users 116K Feb 26 14:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 556K Feb 26 14:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 174K Feb 26 14:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 639K Feb 26 14:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 6.3K Feb 25 17:25 UpperBounds.txt
-rw-r--r-- 1 mcc users 14K Feb 25 17:25 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 8 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 319K 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 UtilityControlRoom-PT-Z4T3N10-LTLCardinality-00
FORMULA_NAME UtilityControlRoom-PT-Z4T3N10-LTLCardinality-01
FORMULA_NAME UtilityControlRoom-PT-Z4T3N10-LTLCardinality-02
FORMULA_NAME UtilityControlRoom-PT-Z4T3N10-LTLCardinality-03
FORMULA_NAME UtilityControlRoom-PT-Z4T3N10-LTLCardinality-04
FORMULA_NAME UtilityControlRoom-PT-Z4T3N10-LTLCardinality-05
FORMULA_NAME UtilityControlRoom-PT-Z4T3N10-LTLCardinality-06
FORMULA_NAME UtilityControlRoom-PT-Z4T3N10-LTLCardinality-07
FORMULA_NAME UtilityControlRoom-PT-Z4T3N10-LTLCardinality-08
FORMULA_NAME UtilityControlRoom-PT-Z4T3N10-LTLCardinality-09
FORMULA_NAME UtilityControlRoom-PT-Z4T3N10-LTLCardinality-10
FORMULA_NAME UtilityControlRoom-PT-Z4T3N10-LTLCardinality-11
FORMULA_NAME UtilityControlRoom-PT-Z4T3N10-LTLCardinality-12
FORMULA_NAME UtilityControlRoom-PT-Z4T3N10-LTLCardinality-13
FORMULA_NAME UtilityControlRoom-PT-Z4T3N10-LTLCardinality-14
FORMULA_NAME UtilityControlRoom-PT-Z4T3N10-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679321783675

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=UtilityControlRoom-PT-Z4T3N10
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202303021504
[2023-03-20 14:16:25] [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-20 14:16:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 14:16:25] [INFO ] Load time of PNML (sax parser for PT used): 66 ms
[2023-03-20 14:16:25] [INFO ] Transformed 376 places.
[2023-03-20 14:16:25] [INFO ] Transformed 750 transitions.
[2023-03-20 14:16:25] [INFO ] Parsed PT model containing 376 places and 750 transitions and 2410 arcs in 130 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 160 transitions
Reduce redundant transitions removed 160 transitions.
FORMULA UtilityControlRoom-PT-Z4T3N10-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-PT-Z4T3N10-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-PT-Z4T3N10-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 357 out of 376 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 376/376 places, 590/590 transitions.
Applied a total of 0 rules in 12 ms. Remains 376 /376 variables (removed 0) and now considering 590/590 (removed 0) transitions.
// Phase 1: matrix 590 rows 376 cols
[2023-03-20 14:16:25] [INFO ] Computed 23 place invariants in 30 ms
[2023-03-20 14:16:25] [INFO ] Implicit Places using invariants in 219 ms returned []
[2023-03-20 14:16:25] [INFO ] Invariant cache hit.
[2023-03-20 14:16:25] [INFO ] Implicit Places using invariants and state equation in 205 ms returned []
Implicit Place search using SMT with State Equation took 446 ms to find 0 implicit places.
[2023-03-20 14:16:25] [INFO ] Invariant cache hit.
[2023-03-20 14:16:26] [INFO ] Dead Transitions using invariants and state equation in 238 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 703 ms. Remains : 376/376 places, 590/590 transitions.
Support contains 357 out of 376 places after structural reductions.
[2023-03-20 14:16:26] [INFO ] Flatten gal took : 72 ms
[2023-03-20 14:16:26] [INFO ] Flatten gal took : 40 ms
[2023-03-20 14:16:26] [INFO ] Input system was already deterministic with 590 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 488 ms. (steps per millisecond=20 ) properties (out of 27) seen :22
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-20 14:16:27] [INFO ] Invariant cache hit.
[2023-03-20 14:16:27] [INFO ] After 94ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:4
[2023-03-20 14:16:27] [INFO ] [Nat]Absence check using 23 positive place invariants in 14 ms returned sat
[2023-03-20 14:16:27] [INFO ] After 116ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :0
Fused 5 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
FORMULA UtilityControlRoom-PT-Z4T3N10-LTLCardinality-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA UtilityControlRoom-PT-Z4T3N10-LTLCardinality-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 5 atomic propositions for a total of 11 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA UtilityControlRoom-PT-Z4T3N10-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-PT-Z4T3N10-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
FORMULA UtilityControlRoom-PT-Z4T3N10-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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||F((G(F(p1))||(F(p1)&&G(p0))))) U G((p2 U !p1))))'
Support contains 94 out of 376 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 376/376 places, 590/590 transitions.
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 120 place count 256 transition count 470
Iterating global reduction 0 with 120 rules applied. Total rules applied 240 place count 256 transition count 470
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 260 place count 246 transition count 460
Applied a total of 260 rules in 58 ms. Remains 246 /376 variables (removed 130) and now considering 460/590 (removed 130) transitions.
// Phase 1: matrix 460 rows 246 cols
[2023-03-20 14:16:27] [INFO ] Computed 23 place invariants in 5 ms
[2023-03-20 14:16:27] [INFO ] Implicit Places using invariants in 112 ms returned [185]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 113 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 245/376 places, 460/590 transitions.
Applied a total of 0 rules in 14 ms. Remains 245 /245 variables (removed 0) and now considering 460/460 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 186 ms. Remains : 245/376 places, 460/590 transitions.
Stuttering acceptance computed with spot in 431 ms :[p1, (NOT p1), false, false, p1, (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : UtilityControlRoom-PT-Z4T3N10-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p1) p2), acceptance={} source=0 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(OR (AND (NOT p1) (NOT p0)) (AND p2 (NOT p0))), acceptance={} source=0 dest: 2}, { cond=(AND p1 p2), acceptance={0} source=0 dest: 4}], [{ cond=(OR (AND (NOT p1) (NOT p0)) (AND p2 (NOT p0))), acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 5}, { cond=p0, acceptance={} source=1 dest: 6}], [{ cond=(OR (AND (NOT p1) p0) (AND p2 p0)), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p2) p0), acceptance={} source=2 dest: 6}], [{ cond=(AND p1 p2 p0), acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p2) p0), acceptance={} source=3 dest: 6}], [{ cond=(AND p1 (NOT p2)), acceptance={0} source=4 dest: 0}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=4 dest: 1}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=4 dest: 3}, { cond=(AND p1 p2), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 5}], [{ cond=(OR (AND (NOT p1) (NOT p0)) (AND p2 (NOT p0))), acceptance={} source=6 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=6 dest: 5}, { cond=p0, acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(GT (ADD s174 s175 s176 s177 s178 s179 s180 s181 s182 s183) (ADD s54 s55 s56 s57 s58 s59 s60 s61 s62 s63 s64 s65 s66 s67 s68 s69 s70 s71 s72 s73 s74 s7...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null][true, true, true, true, true, true, true]]
Product exploration explored 100000 steps with 30880 reset in 784 ms.
Product exploration explored 100000 steps with 30832 reset in 783 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p2 (NOT p0)), (X (NOT (OR (AND (NOT p1) p0) (AND p2 p0)))), (X (OR (AND (NOT p1) (NOT p0)) (AND p2 (NOT p0)))), (X (AND p1 p2)), (X p1), (X (NOT (AND p1 (NOT p2) p0))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND p1 (NOT p2)))), (X (OR (NOT p1) p2)), (X (NOT p0)), (X (AND p1 p2 (NOT p0))), (X (X (NOT (OR (AND (NOT p1) p0) (AND p2 p0))))), (X (X (OR (AND (NOT p1) (NOT p0)) (AND p2 (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p1 p2 p0)))), (X (X (OR (NOT p1) p2))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (AND p1 p2))), (X (X (NOT (AND p1 p2)))), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 p2 (NOT p0)))), (X (X (NOT (AND p1 p2 (NOT p0)))))]
Knowledge based reduction with 19 factoid took 993 ms. Reduced automaton from 7 states, 20 edges and 3 AP (stutter insensitive) to 7 states, 20 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 305 ms :[p1, (NOT p1), false, false, p1, (NOT p1), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 12) seen :11
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 460 rows 245 cols
[2023-03-20 14:16:31] [INFO ] Computed 22 place invariants in 7 ms
[2023-03-20 14:16:31] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 14:16:31] [INFO ] [Nat]Absence check using 22 positive place invariants in 12 ms returned sat
[2023-03-20 14:16:31] [INFO ] After 51ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p2 (NOT p0)), (X (NOT (OR (AND (NOT p1) p0) (AND p2 p0)))), (X (OR (AND (NOT p1) (NOT p0)) (AND p2 (NOT p0)))), (X (AND p1 p2)), (X p1), (X (NOT (AND p1 (NOT p2) p0))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND p1 (NOT p2)))), (X (OR (NOT p1) p2)), (X (NOT p0)), (X (AND p1 p2 (NOT p0))), (X (X (NOT (OR (AND (NOT p1) p0) (AND p2 p0))))), (X (X (OR (AND (NOT p1) (NOT p0)) (AND p2 (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p1 p2 p0)))), (X (X (OR (NOT p1) p2))), (X (X (NOT p0))), (G (NOT (AND p1 (NOT p2) (NOT p0))))]
False Knowledge obtained : [(X (X (AND p1 p2))), (X (X (NOT (AND p1 p2)))), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 p2 (NOT p0)))), (X (X (NOT (AND p1 p2 (NOT p0))))), (F (AND p1 (NOT p2) p0)), (F (OR (AND (NOT p1) p0) (AND p2 p0))), (F (AND p1 p2 p0)), (F (AND p1 p2)), (F (NOT (OR (AND (NOT p1) (NOT p0)) (AND p2 (NOT p0))))), (F p0), (F p1), (F (NOT (OR (NOT p1) p2))), (F (AND p1 (NOT p2))), (F (NOT (AND (NOT p1) (NOT p0)))), (F (AND p1 p2 (NOT p0)))]
Knowledge based reduction with 20 factoid took 1419 ms. Reduced automaton from 7 states, 20 edges and 3 AP (stutter insensitive) to 7 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 286 ms :[p1, (NOT p1), false, false, p1, (NOT p1), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 245 ms :[p1, (NOT p1), false, false, p1, (NOT p1), (AND (NOT p0) (NOT p1))]
Support contains 94 out of 245 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 245/245 places, 460/460 transitions.
Applied a total of 0 rules in 8 ms. Remains 245 /245 variables (removed 0) and now considering 460/460 (removed 0) transitions.
[2023-03-20 14:16:33] [INFO ] Invariant cache hit.
[2023-03-20 14:16:33] [INFO ] Implicit Places using invariants in 75 ms returned []
[2023-03-20 14:16:33] [INFO ] Invariant cache hit.
[2023-03-20 14:16:33] [INFO ] Implicit Places using invariants and state equation in 155 ms returned []
Implicit Place search using SMT with State Equation took 231 ms to find 0 implicit places.
[2023-03-20 14:16:33] [INFO ] Invariant cache hit.
[2023-03-20 14:16:33] [INFO ] Dead Transitions using invariants and state equation in 187 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 430 ms. Remains : 245/245 places, 460/460 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p2 (NOT p0)), (X (NOT p0)), (X (AND p1 p2)), (X (NOT (OR (AND p0 (NOT p1)) (AND p0 p2)))), (X (NOT (AND p1 (NOT p2)))), (X (AND (NOT p0) p1)), (X (OR (NOT p1) p2)), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT p0))), (X (X (NOT (OR (AND p0 (NOT p1)) (AND p0 p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (OR (NOT p1) p2)))]
False Knowledge obtained : [(X (X (AND p1 p2))), (X (X (NOT (AND p1 p2)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 12 factoid took 638 ms. Reduced automaton from 7 states, 18 edges and 3 AP (stutter sensitive) to 7 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 272 ms :[p1, (NOT p1), false, false, p1, (NOT p1), (AND (NOT p0) (NOT p1))]
Finished random walk after 38 steps, including 0 resets, run visited all 9 properties in 3 ms. (steps per millisecond=12 )
Knowledge obtained : [(AND (NOT p1) p2 (NOT p0)), (X (NOT p0)), (X (AND p1 p2)), (X (NOT (OR (AND p0 (NOT p1)) (AND p0 p2)))), (X (NOT (AND p1 (NOT p2)))), (X (AND (NOT p0) p1)), (X (OR (NOT p1) p2)), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT p0))), (X (X (NOT (OR (AND p0 (NOT p1)) (AND p0 p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (OR (NOT p1) p2)))]
False Knowledge obtained : [(X (X (AND p1 p2))), (X (X (NOT (AND p1 p2)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F p1), (F (AND p1 p2)), (F (AND p0 p1 p2)), (F (OR (AND p0 (NOT p1)) (AND p0 p2))), (F (NOT (OR (NOT p1) p2))), (F p0), (F (AND p1 (NOT p2))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 12 factoid took 895 ms. Reduced automaton from 7 states, 18 edges and 3 AP (stutter sensitive) to 7 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 294 ms :[p1, (NOT p1), false, false, p1, (NOT p1), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 280 ms :[p1, (NOT p1), false, false, p1, (NOT p1), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 295 ms :[p1, (NOT p1), false, false, p1, (NOT p1), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 31175 reset in 487 ms.
Product exploration explored 100000 steps with 31092 reset in 510 ms.
Applying partial POR strategy [false, true, false, false, false, true, true]
Stuttering acceptance computed with spot in 279 ms :[p1, (NOT p1), false, false, p1, (NOT p1), (AND (NOT p0) (NOT p1))]
Support contains 94 out of 245 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 245/245 places, 460/460 transitions.
Applied a total of 0 rules in 13 ms. Remains 245 /245 variables (removed 0) and now considering 460/460 (removed 0) transitions.
[2023-03-20 14:16:37] [INFO ] Redundant transitions in 25 ms returned []
[2023-03-20 14:16:37] [INFO ] Invariant cache hit.
[2023-03-20 14:16:38] [INFO ] Dead Transitions using invariants and state equation in 163 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 212 ms. Remains : 245/245 places, 460/460 transitions.
Built C files in :
/tmp/ltsmin7974664724498145604
[2023-03-20 14:16:38] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7974664724498145604
Running compilation step : cd /tmp/ltsmin7974664724498145604;'/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 733 ms.
Running link step : cd /tmp/ltsmin7974664724498145604;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin7974664724498145604;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased3403498320532720776.hoa' '--buchi-type=spotba'
LTSmin run took 346 ms.
FORMULA UtilityControlRoom-PT-Z4T3N10-LTLCardinality-00 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property UtilityControlRoom-PT-Z4T3N10-LTLCardinality-00 finished in 11718 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)||G(p1))))'
Support contains 45 out of 376 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 376/376 places, 590/590 transitions.
Performed 160 Post agglomeration using F-continuation condition.Transition count delta: 160
Iterating post reduction 0 with 160 rules applied. Total rules applied 160 place count 376 transition count 430
Reduce places removed 160 places and 0 transitions.
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 1 with 200 rules applied. Total rules applied 360 place count 216 transition count 390
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 40 Pre rules applied. Total rules applied 360 place count 216 transition count 350
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 440 place count 176 transition count 350
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 460 place count 166 transition count 340
Applied a total of 460 rules in 37 ms. Remains 166 /376 variables (removed 210) and now considering 340/590 (removed 250) transitions.
// Phase 1: matrix 340 rows 166 cols
[2023-03-20 14:16:39] [INFO ] Computed 23 place invariants in 1 ms
[2023-03-20 14:16:39] [INFO ] Implicit Places using invariants in 62 ms returned []
[2023-03-20 14:16:39] [INFO ] Invariant cache hit.
[2023-03-20 14:16:39] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 184 ms to find 0 implicit places.
[2023-03-20 14:16:39] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-20 14:16:39] [INFO ] Invariant cache hit.
[2023-03-20 14:16:39] [INFO ] Dead Transitions using invariants and state equation in 115 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 166/376 places, 340/590 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 347 ms. Remains : 166/376 places, 340/590 transitions.
Stuttering acceptance computed with spot in 31 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : UtilityControlRoom-PT-Z4T3N10-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s105 (ADD s0 s1 s2 s3)), p1:(GT 1 (ADD s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s38 s39 s40...], nbAcceptance=2, 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 511 ms.
Stack based approach found an accepted trace after 7703 steps with 0 reset with depth 7704 and stack size 7704 in 41 ms.
FORMULA UtilityControlRoom-PT-Z4T3N10-LTLCardinality-01 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z4T3N10-LTLCardinality-01 finished in 952 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(F((p0&&X(F(p1))))))'
Support contains 61 out of 376 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 376/376 places, 590/590 transitions.
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 120 place count 256 transition count 470
Iterating global reduction 0 with 120 rules applied. Total rules applied 240 place count 256 transition count 470
Applied a total of 240 rules in 16 ms. Remains 256 /376 variables (removed 120) and now considering 470/590 (removed 120) transitions.
// Phase 1: matrix 470 rows 256 cols
[2023-03-20 14:16:40] [INFO ] Computed 23 place invariants in 7 ms
[2023-03-20 14:16:40] [INFO ] Implicit Places using invariants in 103 ms returned [185]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 105 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 255/376 places, 470/590 transitions.
Applied a total of 0 rules in 3 ms. Remains 255 /255 variables (removed 0) and now considering 470/470 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 124 ms. Remains : 255/376 places, 470/590 transitions.
Stuttering acceptance computed with spot in 95 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : UtilityControlRoom-PT-Z4T3N10-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={0} source=2 dest: 0}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(GT (ADD s195 s196 s197 s198 s199 s200 s201 s202 s203 s204) s184), p0:(GT (ADD s185 s186 s187 s188 s189 s190 s191 s192 s193 s194) (ADD s134 s135 s136 s...], 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 2346 reset in 404 ms.
Product exploration explored 100000 steps with 2313 reset in 432 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 150 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 105 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Finished random walk after 42 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=14 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p1), (F p0)]
Knowledge based reduction with 4 factoid took 730 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 108 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 103 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
// Phase 1: matrix 470 rows 255 cols
[2023-03-20 14:16:42] [INFO ] Computed 22 place invariants in 3 ms
[2023-03-20 14:16:42] [INFO ] [Real]Absence check using 22 positive place invariants in 11 ms returned sat
[2023-03-20 14:16:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 14:16:42] [INFO ] [Real]Absence check using state equation in 175 ms returned sat
[2023-03-20 14:16:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 14:16:43] [INFO ] [Nat]Absence check using 22 positive place invariants in 9 ms returned sat
[2023-03-20 14:16:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 14:16:43] [INFO ] [Nat]Absence check using state equation in 156 ms returned sat
[2023-03-20 14:16:43] [INFO ] Computed and/alt/rep : 460/770/460 causal constraints (skipped 0 transitions) in 23 ms.
[2023-03-20 14:16:44] [INFO ] Added : 240 causal constraints over 48 iterations in 1303 ms. Result :sat
Could not prove EG (NOT p0)
[2023-03-20 14:16:44] [INFO ] Invariant cache hit.
[2023-03-20 14:16:44] [INFO ] [Real]Absence check using 22 positive place invariants in 12 ms returned unsat
Proved EG (NOT p1)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p1), (F p0), (G (NOT p1))]
Property proved to be false thanks to negative knowledge :(G (NOT p1))
Knowledge based reduction with 4 factoid took 136 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA UtilityControlRoom-PT-Z4T3N10-LTLCardinality-02 FALSE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-PT-Z4T3N10-LTLCardinality-02 finished in 4686 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||G(F(p1))))))'
Support contains 54 out of 376 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 376/376 places, 590/590 transitions.
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 120 place count 256 transition count 470
Iterating global reduction 0 with 120 rules applied. Total rules applied 240 place count 256 transition count 470
Applied a total of 240 rules in 4 ms. Remains 256 /376 variables (removed 120) and now considering 470/590 (removed 120) transitions.
// Phase 1: matrix 470 rows 256 cols
[2023-03-20 14:16:44] [INFO ] Computed 23 place invariants in 7 ms
[2023-03-20 14:16:45] [INFO ] Implicit Places using invariants in 116 ms returned [185]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 117 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 255/376 places, 470/590 transitions.
Applied a total of 0 rules in 1 ms. Remains 255 /255 variables (removed 0) and now considering 470/470 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 123 ms. Remains : 255/376 places, 470/590 transitions.
Stuttering acceptance computed with spot in 165 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T3N10-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(GT (ADD s174 s175 s176 s177 s178 s179 s180 s181 s182 s183) (ADD s0 s1 s2 s3)), p1:(LEQ 2 (ADD s54 s55 s56 s57 s58 s59 s60 s61 s62 s63 s64 s65 s66 s67 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 3404 reset in 306 ms.
Product exploration explored 100000 steps with 3388 reset in 317 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)), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 143 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 54 ms :[(NOT p1), (NOT p1)]
Finished random walk after 16 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=8 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 3 factoid took 128 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p1), (NOT p1)]
// Phase 1: matrix 470 rows 255 cols
[2023-03-20 14:16:46] [INFO ] Computed 22 place invariants in 8 ms
Proved EG (NOT p1)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F p1), (G (NOT p1))]
Property proved to be false thanks to negative knowledge :(G (NOT p1))
Knowledge based reduction with 3 factoid took 79 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA UtilityControlRoom-PT-Z4T3N10-LTLCardinality-03 FALSE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-PT-Z4T3N10-LTLCardinality-03 finished in 1701 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(F((X(p0)||(p0&&G(p1))))))'
Support contains 85 out of 376 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 376/376 places, 590/590 transitions.
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 120 place count 256 transition count 470
Iterating global reduction 0 with 120 rules applied. Total rules applied 240 place count 256 transition count 470
Applied a total of 240 rules in 9 ms. Remains 256 /376 variables (removed 120) and now considering 470/590 (removed 120) transitions.
// Phase 1: matrix 470 rows 256 cols
[2023-03-20 14:16:46] [INFO ] Computed 23 place invariants in 3 ms
[2023-03-20 14:16:46] [INFO ] Implicit Places using invariants in 94 ms returned []
[2023-03-20 14:16:46] [INFO ] Invariant cache hit.
[2023-03-20 14:16:46] [INFO ] Implicit Places using invariants and state equation in 203 ms returned []
Implicit Place search using SMT with State Equation took 300 ms to find 0 implicit places.
[2023-03-20 14:16:46] [INFO ] Invariant cache hit.
[2023-03-20 14:16:47] [INFO ] Dead Transitions using invariants and state equation in 185 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 256/376 places, 470/590 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 497 ms. Remains : 256/376 places, 470/590 transitions.
Stuttering acceptance computed with spot in 132 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : UtilityControlRoom-PT-Z4T3N10-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(LEQ (ADD s0 s1 s2 s3) (ADD s134 s135 s136 s137 s138 s139 s140 s141 s142 s143 s144 s145 s146 s147 s148 s149 s150 s151 s152 s153 s154 s155 s156 s157 s15...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 4062 reset in 339 ms.
Product exploration explored 100000 steps with 4060 reset in 353 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)), (X (OR (NOT p0) (NOT p1))), (X (NOT (AND p0 p1))), (X (X (NOT p0))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 219 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 138 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-20 14:16:48] [INFO ] Invariant cache hit.
[2023-03-20 14:16:48] [INFO ] [Real]Absence check using 23 positive place invariants in 6 ms returned sat
[2023-03-20 14:16:48] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (OR (NOT p0) (NOT p1))), (X (NOT (AND p0 p1))), (X (X (NOT p0))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (G (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) p1)), (F p1), (F p0)]
Knowledge based reduction with 7 factoid took 354 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
[2023-03-20 14:16:48] [INFO ] Invariant cache hit.
[2023-03-20 14:16:49] [INFO ] [Real]Absence check using 23 positive place invariants in 14 ms returned sat
[2023-03-20 14:16:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 14:16:49] [INFO ] [Real]Absence check using state equation in 148 ms returned sat
[2023-03-20 14:16:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 14:16:49] [INFO ] [Nat]Absence check using 23 positive place invariants in 10 ms returned sat
[2023-03-20 14:16:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 14:16:49] [INFO ] [Nat]Absence check using state equation in 159 ms returned sat
[2023-03-20 14:16:49] [INFO ] Computed and/alt/rep : 420/690/420 causal constraints (skipped 40 transitions) in 26 ms.
[2023-03-20 14:16:51] [INFO ] Added : 308 causal constraints over 62 iterations in 1754 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 44 out of 256 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 256/256 places, 470/470 transitions.
Applied a total of 0 rules in 5 ms. Remains 256 /256 variables (removed 0) and now considering 470/470 (removed 0) transitions.
[2023-03-20 14:16:51] [INFO ] Invariant cache hit.
[2023-03-20 14:16:51] [INFO ] Implicit Places using invariants in 93 ms returned []
[2023-03-20 14:16:51] [INFO ] Invariant cache hit.
[2023-03-20 14:16:51] [INFO ] Implicit Places using invariants and state equation in 194 ms returned []
Implicit Place search using SMT with State Equation took 288 ms to find 0 implicit places.
[2023-03-20 14:16:51] [INFO ] Invariant cache hit.
[2023-03-20 14:16:52] [INFO ] Dead Transitions using invariants and state equation in 166 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 461 ms. Remains : 256/256 places, 470/470 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 96 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Finished random walk after 24 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=24 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 126 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
[2023-03-20 14:16:52] [INFO ] Invariant cache hit.
[2023-03-20 14:16:52] [INFO ] [Real]Absence check using 23 positive place invariants in 13 ms returned sat
[2023-03-20 14:16:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 14:16:52] [INFO ] [Real]Absence check using state equation in 139 ms returned sat
[2023-03-20 14:16:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 14:16:52] [INFO ] [Nat]Absence check using 23 positive place invariants in 10 ms returned sat
[2023-03-20 14:16:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 14:16:53] [INFO ] [Nat]Absence check using state equation in 151 ms returned sat
[2023-03-20 14:16:53] [INFO ] Computed and/alt/rep : 420/690/420 causal constraints (skipped 40 transitions) in 25 ms.
[2023-03-20 14:16:54] [INFO ] Added : 308 causal constraints over 62 iterations in 1664 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Product exploration explored 100000 steps with 4084 reset in 335 ms.
Product exploration explored 100000 steps with 4068 reset in 348 ms.
Built C files in :
/tmp/ltsmin7919791109314460428
[2023-03-20 14:16:55] [INFO ] Computing symmetric may disable matrix : 470 transitions.
[2023-03-20 14:16:55] [INFO ] Computation of Complete disable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-20 14:16:55] [INFO ] Computing symmetric may enable matrix : 470 transitions.
[2023-03-20 14:16:55] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-20 14:16:55] [INFO ] Computing Do-Not-Accords matrix : 470 transitions.
[2023-03-20 14:16:55] [INFO ] Computation of Completed DNA matrix. took 14 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-20 14:16:55] [INFO ] Built C files in 92ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7919791109314460428
Running compilation step : cd /tmp/ltsmin7919791109314460428;'/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 1040 ms.
Running link step : cd /tmp/ltsmin7919791109314460428;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin7919791109314460428;'/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/stateBased14527252769317136895.hoa' '--buchi-type=spotba'
LTSmin run took 1846 ms.
FORMULA UtilityControlRoom-PT-Z4T3N10-LTLCardinality-05 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property UtilityControlRoom-PT-Z4T3N10-LTLCardinality-05 finished in 11996 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 80 out of 376 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 376/376 places, 590/590 transitions.
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 120 place count 256 transition count 470
Iterating global reduction 0 with 120 rules applied. Total rules applied 240 place count 256 transition count 470
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 40 rules applied. Total rules applied 280 place count 236 transition count 450
Drop transitions removed 40 transitions
Redundant transition composition rules discarded 40 transitions
Iterating global reduction 0 with 40 rules applied. Total rules applied 320 place count 236 transition count 410
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 323 place count 233 transition count 290
Ensure Unique test removed 1 places
Iterating global reduction 0 with 4 rules applied. Total rules applied 327 place count 232 transition count 290
Applied a total of 327 rules in 28 ms. Remains 232 /376 variables (removed 144) and now considering 290/590 (removed 300) transitions.
// Phase 1: matrix 290 rows 232 cols
[2023-03-20 14:16:58] [INFO ] Computed 22 place invariants in 2 ms
[2023-03-20 14:16:58] [INFO ] Implicit Places using invariants in 90 ms returned [171]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 91 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 231/376 places, 290/590 transitions.
Applied a total of 0 rules in 4 ms. Remains 231 /231 variables (removed 0) and now considering 290/290 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 125 ms. Remains : 231/376 places, 290/590 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T3N10-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT (ADD s191 s192 s193 s194 s195 s196 s197 s198 s199 s200 s201 s202 s203 s204 s205 s206 s207 s208 s209 s210 s211 s212 s213 s214 s215 s216 s217 s218 s2...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 3234 reset in 312 ms.
Product exploration explored 100000 steps with 3270 reset in 318 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 148 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Finished random walk after 28 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=28 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 124 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
// Phase 1: matrix 290 rows 231 cols
[2023-03-20 14:16:59] [INFO ] Computed 21 place invariants in 2 ms
[2023-03-20 14:17:00] [INFO ] [Real]Absence check using 21 positive place invariants in 9 ms returned sat
[2023-03-20 14:17:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 14:17:00] [INFO ] [Real]Absence check using state equation in 145 ms returned sat
[2023-03-20 14:17:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 14:17:00] [INFO ] [Nat]Absence check using 21 positive place invariants in 10 ms returned sat
[2023-03-20 14:17:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 14:17:00] [INFO ] [Nat]Absence check using state equation in 152 ms returned sat
[2023-03-20 14:17:00] [INFO ] Computed and/alt/rep : 250/520/250 causal constraints (skipped 0 transitions) in 16 ms.
[2023-03-20 14:17:01] [INFO ] Added : 199 causal constraints over 40 iterations in 729 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 80 out of 231 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 231/231 places, 290/290 transitions.
Applied a total of 0 rules in 6 ms. Remains 231 /231 variables (removed 0) and now considering 290/290 (removed 0) transitions.
[2023-03-20 14:17:01] [INFO ] Invariant cache hit.
[2023-03-20 14:17:01] [INFO ] Implicit Places using invariants in 77 ms returned []
[2023-03-20 14:17:01] [INFO ] Invariant cache hit.
[2023-03-20 14:17:01] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 202 ms to find 0 implicit places.
[2023-03-20 14:17:01] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-20 14:17:01] [INFO ] Invariant cache hit.
[2023-03-20 14:17:01] [INFO ] Dead Transitions using invariants and state equation in 114 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 330 ms. Remains : 231/231 places, 290/290 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 365 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Finished random walk after 25 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=12 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 152 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
[2023-03-20 14:17:02] [INFO ] Invariant cache hit.
[2023-03-20 14:17:02] [INFO ] [Real]Absence check using 21 positive place invariants in 8 ms returned sat
[2023-03-20 14:17:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 14:17:02] [INFO ] [Real]Absence check using state equation in 142 ms returned sat
[2023-03-20 14:17:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 14:17:03] [INFO ] [Nat]Absence check using 21 positive place invariants in 8 ms returned sat
[2023-03-20 14:17:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 14:17:03] [INFO ] [Nat]Absence check using state equation in 136 ms returned sat
[2023-03-20 14:17:03] [INFO ] Computed and/alt/rep : 250/520/250 causal constraints (skipped 0 transitions) in 15 ms.
[2023-03-20 14:17:03] [INFO ] Added : 205 causal constraints over 41 iterations in 731 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 3257 reset in 310 ms.
Product exploration explored 100000 steps with 3256 reset in 317 ms.
Built C files in :
/tmp/ltsmin5072504884102739506
[2023-03-20 14:17:04] [INFO ] Computing symmetric may disable matrix : 290 transitions.
[2023-03-20 14:17:04] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-20 14:17:04] [INFO ] Computing symmetric may enable matrix : 290 transitions.
[2023-03-20 14:17:04] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-20 14:17:04] [INFO ] Computing Do-Not-Accords matrix : 290 transitions.
[2023-03-20 14:17:04] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-20 14:17:04] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5072504884102739506
Running compilation step : cd /tmp/ltsmin5072504884102739506;'/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 511 ms.
Running link step : cd /tmp/ltsmin5072504884102739506;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin5072504884102739506;'/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/stateBased16431099792185063340.hoa' '--buchi-type=spotba'
LTSmin run took 1108 ms.
FORMULA UtilityControlRoom-PT-Z4T3N10-LTLCardinality-07 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property UtilityControlRoom-PT-Z4T3N10-LTLCardinality-07 finished in 7787 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(F(p0))))'
Support contains 2 out of 376 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 376/376 places, 590/590 transitions.
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 120 place count 256 transition count 470
Iterating global reduction 0 with 120 rules applied. Total rules applied 240 place count 256 transition count 470
Applied a total of 240 rules in 14 ms. Remains 256 /376 variables (removed 120) and now considering 470/590 (removed 120) transitions.
// Phase 1: matrix 470 rows 256 cols
[2023-03-20 14:17:06] [INFO ] Computed 23 place invariants in 5 ms
[2023-03-20 14:17:06] [INFO ] Implicit Places using invariants in 109 ms returned []
[2023-03-20 14:17:06] [INFO ] Invariant cache hit.
[2023-03-20 14:17:06] [INFO ] Implicit Places using invariants and state equation in 212 ms returned []
Implicit Place search using SMT with State Equation took 323 ms to find 0 implicit places.
[2023-03-20 14:17:06] [INFO ] Invariant cache hit.
[2023-03-20 14:17:06] [INFO ] Dead Transitions using invariants and state equation in 173 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 256/376 places, 470/590 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 510 ms. Remains : 256/376 places, 470/590 transitions.
Stuttering acceptance computed with spot in 488 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T3N10-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(LEQ s2 s185)], 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 272 ms.
Product exploration explored 100000 steps with 33333 reset in 273 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 2 factoid took 60 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA UtilityControlRoom-PT-Z4T3N10-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-PT-Z4T3N10-LTLCardinality-13 finished in 1624 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((p0||F(p1))))))'
Support contains 4 out of 376 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 376/376 places, 590/590 transitions.
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 120 place count 256 transition count 470
Iterating global reduction 0 with 120 rules applied. Total rules applied 240 place count 256 transition count 470
Applied a total of 240 rules in 5 ms. Remains 256 /376 variables (removed 120) and now considering 470/590 (removed 120) transitions.
[2023-03-20 14:17:08] [INFO ] Invariant cache hit.
[2023-03-20 14:17:08] [INFO ] Implicit Places using invariants in 101 ms returned []
[2023-03-20 14:17:08] [INFO ] Invariant cache hit.
[2023-03-20 14:17:08] [INFO ] Implicit Places using invariants and state equation in 211 ms returned []
Implicit Place search using SMT with State Equation took 314 ms to find 0 implicit places.
[2023-03-20 14:17:08] [INFO ] Invariant cache hit.
[2023-03-20 14:17:08] [INFO ] Dead Transitions using invariants and state equation in 175 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 256/376 places, 470/590 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 495 ms. Remains : 256/376 places, 470/590 transitions.
Stuttering acceptance computed with spot in 212 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : UtilityControlRoom-PT-Z4T3N10-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p1:(LEQ s3 s185), p0:(GT s19 s253)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 263 ms.
Product exploration explored 100000 steps with 25000 reset in 276 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 79 ms. Reduced automaton from 5 states, 5 edges and 2 AP (stutter sensitive) to 5 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 154 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 1 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), true]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 2 factoid took 124 ms. Reduced automaton from 5 states, 5 edges and 2 AP (stutter sensitive) to 5 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 179 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 223 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
[2023-03-20 14:17:10] [INFO ] Invariant cache hit.
[2023-03-20 14:17:10] [INFO ] [Real]Absence check using 23 positive place invariants in 18 ms returned sat
[2023-03-20 14:17:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 14:17:10] [INFO ] [Real]Absence check using state equation in 217 ms returned sat
[2023-03-20 14:17:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 14:17:10] [INFO ] [Nat]Absence check using 23 positive place invariants in 11 ms returned sat
[2023-03-20 14:17:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 14:17:10] [INFO ] [Nat]Absence check using state equation in 210 ms returned sat
[2023-03-20 14:17:10] [INFO ] Computed and/alt/rep : 420/690/420 causal constraints (skipped 40 transitions) in 29 ms.
[2023-03-20 14:17:11] [INFO ] Added : 78 causal constraints over 16 iterations in 451 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p0))
Support contains 4 out of 256 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 256/256 places, 470/470 transitions.
Applied a total of 0 rules in 2 ms. Remains 256 /256 variables (removed 0) and now considering 470/470 (removed 0) transitions.
[2023-03-20 14:17:11] [INFO ] Invariant cache hit.
[2023-03-20 14:17:11] [INFO ] Implicit Places using invariants in 110 ms returned []
[2023-03-20 14:17:11] [INFO ] Invariant cache hit.
[2023-03-20 14:17:11] [INFO ] Implicit Places using invariants and state equation in 210 ms returned []
Implicit Place search using SMT with State Equation took 322 ms to find 0 implicit places.
[2023-03-20 14:17:11] [INFO ] Invariant cache hit.
[2023-03-20 14:17:11] [INFO ] Dead Transitions using invariants and state equation in 175 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 501 ms. Remains : 256/256 places, 470/470 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 149 ms. Reduced automaton from 5 states, 5 edges and 2 AP (stutter sensitive) to 5 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 184 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 1 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), true]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 2 factoid took 126 ms. Reduced automaton from 5 states, 5 edges and 2 AP (stutter sensitive) to 5 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 186 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 166 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
[2023-03-20 14:17:12] [INFO ] Invariant cache hit.
[2023-03-20 14:17:12] [INFO ] [Real]Absence check using 23 positive place invariants in 18 ms returned sat
[2023-03-20 14:17:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 14:17:13] [INFO ] [Real]Absence check using state equation in 224 ms returned sat
[2023-03-20 14:17:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 14:17:13] [INFO ] [Nat]Absence check using 23 positive place invariants in 12 ms returned sat
[2023-03-20 14:17:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 14:17:13] [INFO ] [Nat]Absence check using state equation in 212 ms returned sat
[2023-03-20 14:17:13] [INFO ] Computed and/alt/rep : 420/690/420 causal constraints (skipped 40 transitions) in 27 ms.
[2023-03-20 14:17:13] [INFO ] Added : 78 causal constraints over 16 iterations in 451 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p0))
Stuttering acceptance computed with spot in 178 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 25000 reset in 293 ms.
Product exploration explored 100000 steps with 25000 reset in 299 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 178 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 256 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 256/256 places, 470/470 transitions.
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 40 Pre rules applied. Total rules applied 0 place count 256 transition count 510
Deduced a syphon composed of 40 places in 0 ms
Iterating global reduction 0 with 40 rules applied. Total rules applied 40 place count 256 transition count 510
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 99 places in 0 ms
Iterating global reduction 0 with 59 rules applied. Total rules applied 99 place count 256 transition count 537
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 0 with 40 rules applied. Total rules applied 139 place count 256 transition count 497
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 141 place count 254 transition count 417
Deduced a syphon composed of 99 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 143 place count 254 transition count 417
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 162 place count 235 transition count 398
Deduced a syphon composed of 99 places in 0 ms
Iterating global reduction 1 with 19 rules applied. Total rules applied 181 place count 235 transition count 398
Discarding 38 places :
Symmetric choice reduction at 1 with 38 rule applications. Total rules 219 place count 197 transition count 322
Deduced a syphon composed of 80 places in 0 ms
Iterating global reduction 1 with 38 rules applied. Total rules applied 257 place count 197 transition count 322
Discarding 37 places :
Symmetric choice reduction at 1 with 37 rule applications. Total rules 294 place count 160 transition count 267
Deduced a syphon composed of 61 places in 0 ms
Iterating global reduction 1 with 37 rules applied. Total rules applied 331 place count 160 transition count 267
Ensure Unique test removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 366 place count 160 transition count 232
Deduced a syphon composed of 61 places in 0 ms
Applied a total of 366 rules in 41 ms. Remains 160 /256 variables (removed 96) and now considering 232/470 (removed 238) transitions.
[2023-03-20 14:17:15] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 232 rows 160 cols
[2023-03-20 14:17:15] [INFO ] Computed 23 place invariants in 1 ms
[2023-03-20 14:17:15] [INFO ] Dead Transitions using invariants and state equation in 97 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 160/256 places, 232/470 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 146 ms. Remains : 160/256 places, 232/470 transitions.
Built C files in :
/tmp/ltsmin13891010208847992665
[2023-03-20 14:17:15] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13891010208847992665
Running compilation step : cd /tmp/ltsmin13891010208847992665;'/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 692 ms.
Running link step : cd /tmp/ltsmin13891010208847992665;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin13891010208847992665;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased7943119298284877831.hoa' '--buchi-type=spotba'
LTSmin run took 214 ms.
FORMULA UtilityControlRoom-PT-Z4T3N10-LTLCardinality-14 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property UtilityControlRoom-PT-Z4T3N10-LTLCardinality-14 finished in 8070 ms.
All properties solved by simple procedures.
Total runtime 51027 ms.

BK_STOP 1679321842541

--------------------
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="UtilityControlRoom-PT-Z4T3N10"
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 UtilityControlRoom-PT-Z4T3N10, 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 r485-tall-167912700401179"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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