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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 20K Feb 26 14:33 CTLCardinality.txt
-rw-r--r-- 1 mcc users 111K Feb 26 14:33 CTLCardinality.xml
-rw-r--r-- 1 mcc users 51K Feb 26 14:32 CTLFireability.txt
-rw-r--r-- 1 mcc users 184K Feb 26 14:32 CTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 25 17:25 LTLCardinality.txt
-rw-r--r-- 1 mcc users 53K Feb 25 17:25 LTLCardinality.xml
-rw-r--r-- 1 mcc users 13K Feb 25 17:25 LTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 25 17:25 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 14:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 84K Feb 26 14:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 94K Feb 26 14:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 357K Feb 26 14:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 17:25 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.4K 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 128K 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-Z4T4N04-LTLCardinality-00
FORMULA_NAME UtilityControlRoom-PT-Z4T4N04-LTLCardinality-01
FORMULA_NAME UtilityControlRoom-PT-Z4T4N04-LTLCardinality-02
FORMULA_NAME UtilityControlRoom-PT-Z4T4N04-LTLCardinality-03
FORMULA_NAME UtilityControlRoom-PT-Z4T4N04-LTLCardinality-04
FORMULA_NAME UtilityControlRoom-PT-Z4T4N04-LTLCardinality-05
FORMULA_NAME UtilityControlRoom-PT-Z4T4N04-LTLCardinality-06
FORMULA_NAME UtilityControlRoom-PT-Z4T4N04-LTLCardinality-07
FORMULA_NAME UtilityControlRoom-PT-Z4T4N04-LTLCardinality-08
FORMULA_NAME UtilityControlRoom-PT-Z4T4N04-LTLCardinality-09
FORMULA_NAME UtilityControlRoom-PT-Z4T4N04-LTLCardinality-10
FORMULA_NAME UtilityControlRoom-PT-Z4T4N04-LTLCardinality-11
FORMULA_NAME UtilityControlRoom-PT-Z4T4N04-LTLCardinality-12
FORMULA_NAME UtilityControlRoom-PT-Z4T4N04-LTLCardinality-13
FORMULA_NAME UtilityControlRoom-PT-Z4T4N04-LTLCardinality-14
FORMULA_NAME UtilityControlRoom-PT-Z4T4N04-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679323701867

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-Z4T4N04
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202303021504
[2023-03-20 14:48:23] [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:48:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 14:48:23] [INFO ] Load time of PNML (sax parser for PT used): 48 ms
[2023-03-20 14:48:23] [INFO ] Transformed 154 places.
[2023-03-20 14:48:23] [INFO ] Transformed 300 transitions.
[2023-03-20 14:48:23] [INFO ] Parsed PT model containing 154 places and 300 transitions and 964 arcs in 109 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
Ensure Unique test removed 64 transitions
Reduce redundant transitions removed 64 transitions.
FORMULA UtilityControlRoom-PT-Z4T4N04-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-PT-Z4T4N04-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-PT-Z4T4N04-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-PT-Z4T4N04-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-PT-Z4T4N04-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-PT-Z4T4N04-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 143 out of 154 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 154/154 places, 236/236 transitions.
Applied a total of 0 rules in 12 ms. Remains 154 /154 variables (removed 0) and now considering 236/236 (removed 0) transitions.
// Phase 1: matrix 236 rows 154 cols
[2023-03-20 14:48:23] [INFO ] Computed 11 place invariants in 18 ms
[2023-03-20 14:48:23] [INFO ] Implicit Places using invariants in 340 ms returned []
[2023-03-20 14:48:23] [INFO ] Invariant cache hit.
[2023-03-20 14:48:24] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 495 ms to find 0 implicit places.
[2023-03-20 14:48:24] [INFO ] Invariant cache hit.
[2023-03-20 14:48:24] [INFO ] Dead Transitions using invariants and state equation in 137 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 647 ms. Remains : 154/154 places, 236/236 transitions.
Support contains 143 out of 154 places after structural reductions.
[2023-03-20 14:48:24] [INFO ] Flatten gal took : 41 ms
[2023-03-20 14:48:24] [INFO ] Flatten gal took : 17 ms
[2023-03-20 14:48:24] [INFO ] Input system was already deterministic with 236 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 168 ms. (steps per millisecond=59 ) properties (out of 18) seen :16
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-20 14:48:24] [INFO ] Invariant cache hit.
[2023-03-20 14:48:24] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2023-03-20 14:48:24] [INFO ] After 86ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2023-03-20 14:48:24] [INFO ] [Nat]Absence check using 11 positive place invariants in 17 ms returned sat
[2023-03-20 14:48:24] [INFO ] After 60ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
FORMULA UtilityControlRoom-PT-Z4T4N04-LTLCardinality-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 9 simplifications.
FORMULA UtilityControlRoom-PT-Z4T4N04-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-PT-Z4T4N04-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(X(p1))))'
Support contains 84 out of 154 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 154/154 places, 236/236 transitions.
Applied a total of 0 rules in 3 ms. Remains 154 /154 variables (removed 0) and now considering 236/236 (removed 0) transitions.
[2023-03-20 14:48:25] [INFO ] Invariant cache hit.
[2023-03-20 14:48:25] [INFO ] Implicit Places using invariants in 98 ms returned [124, 125]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 103 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 152/154 places, 236/236 transitions.
Applied a total of 0 rules in 5 ms. Remains 152 /152 variables (removed 0) and now considering 236/236 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 111 ms. Remains : 152/154 places, 236/236 transitions.
Stuttering acceptance computed with spot in 417 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), true]
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N04-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(LEQ 1 (ADD s40 s41 s42 s43 s44 s45 s46 s47 s48 s49 s50 s51 s52 s53 s54 s55 s56 s57 s58 s59 s60 s61 s62 s63 s64 s65 s66 s67 s68 s69 s70 s71 s72 s73 s74...], nbAcceptance=0, 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]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA UtilityControlRoom-PT-Z4T4N04-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z4T4N04-LTLCardinality-02 finished in 585 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) U X((G(p1)||(p1&&G(F(p2))))))))'
Support contains 37 out of 154 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 154/154 places, 236/236 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 106 transition count 188
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 106 transition count 188
Applied a total of 96 rules in 19 ms. Remains 106 /154 variables (removed 48) and now considering 188/236 (removed 48) transitions.
// Phase 1: matrix 188 rows 106 cols
[2023-03-20 14:48:25] [INFO ] Computed 11 place invariants in 4 ms
[2023-03-20 14:48:25] [INFO ] Implicit Places using invariants in 78 ms returned [77]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 80 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 105/154 places, 188/236 transitions.
Applied a total of 0 rules in 3 ms. Remains 105 /105 variables (removed 0) and now considering 188/188 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 103 ms. Remains : 105/154 places, 188/236 transitions.
Stuttering acceptance computed with spot in 507 ms :[(NOT p1), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) p1)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N04-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=p1, acceptance={} source=2 dest: 5}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 7}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 8}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}, { cond=(NOT p0), acceptance={} source=5 dest: 7}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=6 dest: 9}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=7 dest: 9}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=7 dest: 10}], [{ cond=(NOT p0), acceptance={0} source=8 dest: 8}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=9 dest: 9}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=10 dest: 9}, { cond=(AND (NOT p0) p1), acceptance={} source=10 dest: 10}]], initial=0, aps=[p0:(LEQ s76 (ADD s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23)), p1:(LEQ 3 (ADD s56 s57 s58 s59 s60 s61 s62 s63 s64 s65 s66 s67 s68 s69 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 5370 reset in 322 ms.
Stack based approach found an accepted trace after 19477 steps with 1048 reset with depth 32 and stack size 32 in 46 ms.
FORMULA UtilityControlRoom-PT-Z4T4N04-LTLCardinality-03 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z4T4N04-LTLCardinality-03 finished in 1011 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&G(F(!p0)))))'
Support contains 80 out of 154 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 154/154 places, 236/236 transitions.
Applied a total of 0 rules in 5 ms. Remains 154 /154 variables (removed 0) and now considering 236/236 (removed 0) transitions.
// Phase 1: matrix 236 rows 154 cols
[2023-03-20 14:48:26] [INFO ] Computed 11 place invariants in 3 ms
[2023-03-20 14:48:26] [INFO ] Implicit Places using invariants in 97 ms returned [124, 125]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 100 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 152/154 places, 236/236 transitions.
Applied a total of 0 rules in 2 ms. Remains 152 /152 variables (removed 0) and now considering 236/236 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 107 ms. Remains : 152/154 places, 236/236 transitions.
Stuttering acceptance computed with spot in 173 ms :[true, true, true, p0, p0]
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N04-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={0} source=3 dest: 3}], [{ cond=p0, acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(LEQ (ADD s40 s41 s42 s43 s44 s45 s46 s47 s48 s49 s50 s51 s52 s53 s54 s55 s56 s57 s58 s59 s60 s61 s62 s63 s64 s65 s66 s67 s68 s69 s70 s71 s72 s73 s74 s...], 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 11130 reset in 265 ms.
Product exploration explored 100000 steps with 11193 reset in 291 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 200 ms. Reduced automaton from 5 states, 8 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[p0, p0]
Finished random walk after 4 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=2 )
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 138 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 :[p0, p0]
Stuttering acceptance computed with spot in 69 ms :[p0, p0]
// Phase 1: matrix 236 rows 152 cols
[2023-03-20 14:48:28] [INFO ] Computed 9 place invariants in 4 ms
[2023-03-20 14:48:28] [INFO ] [Real]Absence check using 9 positive place invariants in 4 ms returned sat
[2023-03-20 14:48:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 14:48:28] [INFO ] [Real]Absence check using state equation in 80 ms returned sat
[2023-03-20 14:48:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 14:48:28] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2023-03-20 14:48:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 14:48:28] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2023-03-20 14:48:28] [INFO ] Computed and/alt/rep : 232/356/232 causal constraints (skipped 0 transitions) in 15 ms.
[2023-03-20 14:48:29] [INFO ] Added : 232 causal constraints over 47 iterations in 785 ms. Result :sat
Could not prove EG p0
Support contains 80 out of 152 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 152/152 places, 236/236 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 0 with 48 rules applied. Total rules applied 48 place count 128 transition count 212
Applied a total of 48 rules in 16 ms. Remains 128 /152 variables (removed 24) and now considering 212/236 (removed 24) transitions.
// Phase 1: matrix 212 rows 128 cols
[2023-03-20 14:48:29] [INFO ] Computed 9 place invariants in 2 ms
[2023-03-20 14:48:29] [INFO ] Implicit Places using invariants in 43 ms returned []
[2023-03-20 14:48:29] [INFO ] Invariant cache hit.
[2023-03-20 14:48:29] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
[2023-03-20 14:48:29] [INFO ] Redundant transitions in 7 ms returned []
[2023-03-20 14:48:29] [INFO ] Invariant cache hit.
[2023-03-20 14:48:29] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 128/152 places, 212/236 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 222 ms. Remains : 128/152 places, 212/236 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 : [p0, (X p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 89 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 65 ms :[p0, p0]
Finished random walk after 5 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=2 )
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 2 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 70 ms :[p0, p0]
Stuttering acceptance computed with spot in 73 ms :[p0, p0]
[2023-03-20 14:48:30] [INFO ] Invariant cache hit.
[2023-03-20 14:48:30] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2023-03-20 14:48:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 14:48:30] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2023-03-20 14:48:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 14:48:30] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2023-03-20 14:48:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 14:48:30] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2023-03-20 14:48:30] [INFO ] Computed and/alt/rep : 196/352/196 causal constraints (skipped 0 transitions) in 12 ms.
[2023-03-20 14:48:30] [INFO ] Added : 136 causal constraints over 28 iterations in 381 ms. Result :sat
Could not prove EG p0
Stuttering acceptance computed with spot in 80 ms :[p0, p0]
Product exploration explored 100000 steps with 13816 reset in 301 ms.
Stack based approach found an accepted trace after 8787 steps with 1169 reset with depth 14 and stack size 14 in 27 ms.
FORMULA UtilityControlRoom-PT-Z4T4N04-LTLCardinality-04 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z4T4N04-LTLCardinality-04 finished in 4535 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 4 out of 154 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 154/154 places, 236/236 transitions.
Drop transitions removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 154 transition count 172
Reduce places removed 64 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 80 rules applied. Total rules applied 144 place count 90 transition count 156
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 144 place count 90 transition count 140
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 176 place count 74 transition count 140
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 179 place count 71 transition count 92
Iterating global reduction 2 with 3 rules applied. Total rules applied 182 place count 71 transition count 92
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 194 place count 59 transition count 80
Iterating global reduction 2 with 12 rules applied. Total rules applied 206 place count 59 transition count 80
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 218 place count 47 transition count 56
Iterating global reduction 2 with 12 rules applied. Total rules applied 230 place count 47 transition count 56
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 242 place count 35 transition count 44
Iterating global reduction 2 with 12 rules applied. Total rules applied 254 place count 35 transition count 44
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 266 place count 35 transition count 32
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 266 place count 35 transition count 28
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 274 place count 31 transition count 28
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 9 rules applied. Total rules applied 283 place count 26 transition count 24
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 9 rules applied. Total rules applied 292 place count 21 transition count 20
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 300 place count 17 transition count 16
Applied a total of 300 rules in 28 ms. Remains 17 /154 variables (removed 137) and now considering 16/236 (removed 220) transitions.
// Phase 1: matrix 16 rows 17 cols
[2023-03-20 14:48:31] [INFO ] Computed 9 place invariants in 0 ms
[2023-03-20 14:48:31] [INFO ] Implicit Places using invariants in 39 ms returned [8]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 40 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 16/154 places, 16/236 transitions.
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 0 place count 16 transition count 12
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 8 transition count 12
Applied a total of 12 rules in 2 ms. Remains 8 /16 variables (removed 8) and now considering 12/16 (removed 4) transitions.
[2023-03-20 14:48:31] [INFO ] Flow matrix only has 9 transitions (discarded 3 similar events)
// Phase 1: matrix 9 rows 8 cols
[2023-03-20 14:48:31] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-20 14:48:31] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-03-20 14:48:31] [INFO ] Flow matrix only has 9 transitions (discarded 3 similar events)
[2023-03-20 14:48:31] [INFO ] Invariant cache hit.
[2023-03-20 14:48:31] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 8/154 places, 12/236 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 114 ms. Remains : 8/154 places, 12/236 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N04-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 3 (ADD s4 s5 s6 s7))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-PT-Z4T4N04-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z4T4N04-LTLCardinality-05 finished in 169 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((X(F(p0))&&(G(F(p1))||G(p0)))))'
Support contains 9 out of 154 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 154/154 places, 236/236 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 106 transition count 188
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 106 transition count 188
Applied a total of 96 rules in 14 ms. Remains 106 /154 variables (removed 48) and now considering 188/236 (removed 48) transitions.
// Phase 1: matrix 188 rows 106 cols
[2023-03-20 14:48:31] [INFO ] Computed 11 place invariants in 2 ms
[2023-03-20 14:48:31] [INFO ] Implicit Places using invariants in 76 ms returned [76]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 83 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 105/154 places, 188/236 transitions.
Applied a total of 0 rules in 3 ms. Remains 105 /105 variables (removed 0) and now considering 188/188 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 101 ms. Remains : 105/154 places, 188/236 transitions.
Stuttering acceptance computed with spot in 247 ms :[(NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (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-Z4T4N04-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}, { cond=p0, acceptance={} source=0 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(NOT p0), acceptance={} source=3 dest: 3}, { cond=p0, acceptance={} source=3 dest: 5}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 2}, { cond=(NOT p0), acceptance={} source=5 dest: 3}, { cond=p0, acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p1:(GT (ADD s72 s73 s74 s75) (ADD s85 s86 s87 s88)), p0:(GT s76 (ADD s72 s73 s74 s75))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1282 reset in 196 ms.
Product exploration explored 100000 steps with 1397 reset in 250 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 (AND (NOT p1) p0))), (X (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Knowledge based reduction with 4 factoid took 269 ms. Reduced automaton from 7 states, 18 edges and 2 AP (stutter sensitive) to 6 states, 14 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 220 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 2 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=2 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F p0), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 4 factoid took 405 ms. Reduced automaton from 6 states, 14 edges and 2 AP (stutter sensitive) to 6 states, 14 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 249 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 216 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
// Phase 1: matrix 188 rows 105 cols
[2023-03-20 14:48:33] [INFO ] Computed 10 place invariants in 3 ms
[2023-03-20 14:48:33] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-20 14:48:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 14:48:33] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2023-03-20 14:48:33] [INFO ] Computed and/alt/rep : 184/372/184 causal constraints (skipped 0 transitions) in 11 ms.
[2023-03-20 14:48:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 14:48:33] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-20 14:48:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 14:48:33] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2023-03-20 14:48:33] [INFO ] Computed and/alt/rep : 184/372/184 causal constraints (skipped 0 transitions) in 12 ms.
[2023-03-20 14:48:34] [INFO ] Added : 117 causal constraints over 24 iterations in 316 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 9 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 188/188 transitions.
Applied a total of 0 rules in 4 ms. Remains 105 /105 variables (removed 0) and now considering 188/188 (removed 0) transitions.
[2023-03-20 14:48:34] [INFO ] Invariant cache hit.
[2023-03-20 14:48:34] [INFO ] Implicit Places using invariants in 64 ms returned []
[2023-03-20 14:48:34] [INFO ] Invariant cache hit.
[2023-03-20 14:48:34] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 166 ms to find 0 implicit places.
[2023-03-20 14:48:34] [INFO ] Invariant cache hit.
[2023-03-20 14:48:34] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 249 ms. Remains : 105/105 places, 188/188 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 4 factoid took 302 ms. Reduced automaton from 6 states, 14 edges and 2 AP (stutter sensitive) to 6 states, 14 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 247 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 2 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F p0), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 4 factoid took 325 ms. Reduced automaton from 6 states, 14 edges and 2 AP (stutter sensitive) to 6 states, 14 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 258 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 368 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2023-03-20 14:48:36] [INFO ] Invariant cache hit.
[2023-03-20 14:48:36] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2023-03-20 14:48:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 14:48:36] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2023-03-20 14:48:36] [INFO ] Computed and/alt/rep : 184/372/184 causal constraints (skipped 0 transitions) in 12 ms.
[2023-03-20 14:48:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 14:48:36] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2023-03-20 14:48:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 14:48:36] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2023-03-20 14:48:36] [INFO ] Computed and/alt/rep : 184/372/184 causal constraints (skipped 0 transitions) in 11 ms.
[2023-03-20 14:48:36] [INFO ] Added : 101 causal constraints over 21 iterations in 259 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 230 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1371 reset in 165 ms.
Product exploration explored 100000 steps with 1519 reset in 179 ms.
Applying partial POR strategy [false, true, true, true, true, true]
Stuttering acceptance computed with spot in 227 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 9 out of 105 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 105/105 places, 188/188 transitions.
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 16 Pre rules applied. Total rules applied 0 place count 105 transition count 204
Deduced a syphon composed of 16 places in 0 ms
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 105 transition count 204
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 36 places in 0 ms
Iterating global reduction 0 with 20 rules applied. Total rules applied 36 place count 105 transition count 204
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 52 place count 105 transition count 188
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 55 place count 102 transition count 140
Deduced a syphon composed of 36 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 58 place count 102 transition count 140
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 70 place count 90 transition count 128
Deduced a syphon composed of 36 places in 0 ms
Iterating global reduction 1 with 12 rules applied. Total rules applied 82 place count 90 transition count 128
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 106 place count 66 transition count 80
Deduced a syphon composed of 24 places in 0 ms
Iterating global reduction 1 with 24 rules applied. Total rules applied 130 place count 66 transition count 80
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 154 place count 42 transition count 56
Deduced a syphon composed of 12 places in 0 ms
Iterating global reduction 1 with 24 rules applied. Total rules applied 178 place count 42 transition count 56
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 190 place count 42 transition count 44
Deduced a syphon composed of 12 places in 0 ms
Applied a total of 190 rules in 21 ms. Remains 42 /105 variables (removed 63) and now considering 44/188 (removed 144) transitions.
[2023-03-20 14:48:37] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 44 rows 42 cols
[2023-03-20 14:48:37] [INFO ] Computed 10 place invariants in 0 ms
[2023-03-20 14:48:37] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 42/105 places, 44/188 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 79 ms. Remains : 42/105 places, 44/188 transitions.
Built C files in :
/tmp/ltsmin6909554141647943468
[2023-03-20 14:48:37] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6909554141647943468
Running compilation step : cd /tmp/ltsmin6909554141647943468;'/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 360 ms.
Running link step : cd /tmp/ltsmin6909554141647943468;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin6909554141647943468;'/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/stateBased6594213346864137149.hoa' '--buchi-type=spotba'
LTSmin run took 2004 ms.
FORMULA UtilityControlRoom-PT-Z4T4N04-LTLCardinality-07 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property UtilityControlRoom-PT-Z4T4N04-LTLCardinality-07 finished in 8631 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||G(p1)))))'
Support contains 3 out of 154 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 154/154 places, 236/236 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 106 transition count 188
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 106 transition count 188
Applied a total of 96 rules in 7 ms. Remains 106 /154 variables (removed 48) and now considering 188/236 (removed 48) transitions.
// Phase 1: matrix 188 rows 106 cols
[2023-03-20 14:48:40] [INFO ] Computed 11 place invariants in 1 ms
[2023-03-20 14:48:40] [INFO ] Implicit Places using invariants in 79 ms returned [76, 77]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 80 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 104/154 places, 188/236 transitions.
Applied a total of 0 rules in 1 ms. Remains 104 /104 variables (removed 0) and now considering 188/188 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 89 ms. Remains : 104/154 places, 188/236 transitions.
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N04-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(GT 1 s62), p0:(GT s86 s91)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 5904 reset in 155 ms.
Product exploration explored 100000 steps with 5854 reset in 168 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
Knowledge based reduction with 4 factoid took 210 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 196 steps, including 0 resets, run visited all 2 properties in 6 ms. (steps per millisecond=32 )
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 4 factoid took 299 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 188/188 transitions.
Applied a total of 0 rules in 4 ms. Remains 104 /104 variables (removed 0) and now considering 188/188 (removed 0) transitions.
// Phase 1: matrix 188 rows 104 cols
[2023-03-20 14:48:41] [INFO ] Computed 9 place invariants in 2 ms
[2023-03-20 14:48:41] [INFO ] Implicit Places using invariants in 57 ms returned []
[2023-03-20 14:48:41] [INFO ] Invariant cache hit.
[2023-03-20 14:48:41] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 137 ms to find 0 implicit places.
[2023-03-20 14:48:41] [INFO ] Invariant cache hit.
[2023-03-20 14:48:41] [INFO ] Dead Transitions using invariants and state equation in 115 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 293 ms. Remains : 104/104 places, 188/188 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
Knowledge based reduction with 4 factoid took 235 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 163 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=54 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 4 factoid took 264 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 56 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 93 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 5898 reset in 152 ms.
Stack based approach found an accepted trace after 16058 steps with 936 reset with depth 43 and stack size 43 in 37 ms.
FORMULA UtilityControlRoom-PT-Z4T4N04-LTLCardinality-08 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z4T4N04-LTLCardinality-08 finished in 2650 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)))'
Support contains 2 out of 154 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 154/154 places, 236/236 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 106 transition count 188
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 106 transition count 188
Applied a total of 96 rules in 8 ms. Remains 106 /154 variables (removed 48) and now considering 188/236 (removed 48) transitions.
// Phase 1: matrix 188 rows 106 cols
[2023-03-20 14:48:42] [INFO ] Computed 11 place invariants in 1 ms
[2023-03-20 14:48:42] [INFO ] Implicit Places using invariants in 90 ms returned [76, 77]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 91 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 104/154 places, 188/236 transitions.
Applied a total of 0 rules in 1 ms. Remains 104 /104 variables (removed 0) and now considering 188/188 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 100 ms. Remains : 104/154 places, 188/236 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z4T4N04-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s89 s77)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 129 ms.
Product exploration explored 100000 steps with 50000 reset in 136 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 63 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA UtilityControlRoom-PT-Z4T4N04-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-PT-Z4T4N04-LTLCardinality-15 finished in 532 ms.
All properties solved by simple procedures.
Total runtime 19897 ms.

BK_STOP 1679323724173

--------------------
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-Z4T4N04"
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-Z4T4N04, 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-167912700401195"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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