fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r201-smll-167840347400219
Last Updated
May 14, 2023

About the Execution of LTSMin+red for GlobalResAllocation-PT-03

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
442.312 41500.00 65063.00 903.60 FFFTTT?FFFFFTTFT normal

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.r201-smll-167840347400219.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is GlobalResAllocation-PT-03, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r201-smll-167840347400219
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 20M
-rw-r--r-- 1 mcc users 17K Feb 25 17:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 103K Feb 25 17:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 1.1M Feb 25 17:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 4.3M Feb 25 17:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 9.1K Feb 25 16:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 41K Feb 25 16:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 535K Feb 25 16:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 1.7M Feb 25 16:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 25 18:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 104K Feb 25 18:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 1.2M Feb 25 18:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 4.6M Feb 25 18:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 16:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.4K Feb 25 16:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 5.7M Mar 5 18:22 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 GlobalResAllocation-PT-03-LTLCardinality-00
FORMULA_NAME GlobalResAllocation-PT-03-LTLCardinality-01
FORMULA_NAME GlobalResAllocation-PT-03-LTLCardinality-02
FORMULA_NAME GlobalResAllocation-PT-03-LTLCardinality-03
FORMULA_NAME GlobalResAllocation-PT-03-LTLCardinality-04
FORMULA_NAME GlobalResAllocation-PT-03-LTLCardinality-05
FORMULA_NAME GlobalResAllocation-PT-03-LTLCardinality-06
FORMULA_NAME GlobalResAllocation-PT-03-LTLCardinality-07
FORMULA_NAME GlobalResAllocation-PT-03-LTLCardinality-08
FORMULA_NAME GlobalResAllocation-PT-03-LTLCardinality-09
FORMULA_NAME GlobalResAllocation-PT-03-LTLCardinality-10
FORMULA_NAME GlobalResAllocation-PT-03-LTLCardinality-11
FORMULA_NAME GlobalResAllocation-PT-03-LTLCardinality-12
FORMULA_NAME GlobalResAllocation-PT-03-LTLCardinality-13
FORMULA_NAME GlobalResAllocation-PT-03-LTLCardinality-14
FORMULA_NAME GlobalResAllocation-PT-03-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678625191207

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=GlobalResAllocation-PT-03
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 12:46:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-12 12:46:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 12:46:34] [INFO ] Load time of PNML (sax parser for PT used): 610 ms
[2023-03-12 12:46:34] [INFO ] Transformed 33 places.
[2023-03-12 12:46:34] [INFO ] Transformed 4791 transitions.
[2023-03-12 12:46:34] [INFO ] Parsed PT model containing 33 places and 4791 transitions and 38652 arcs in 881 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Ensure Unique test removed 4080 transitions
Reduce redundant transitions removed 4080 transitions.
FORMULA GlobalResAllocation-PT-03-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GlobalResAllocation-PT-03-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GlobalResAllocation-PT-03-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GlobalResAllocation-PT-03-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GlobalResAllocation-PT-03-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 711/711 transitions.
Reduce isomorphic (modulo) transitions removed 36 transitions.
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 33 transition count 693
Applied a total of 36 rules in 47 ms. Remains 33 /33 variables (removed 0) and now considering 693/711 (removed 18) transitions.
// Phase 1: matrix 693 rows 33 cols
[2023-03-12 12:46:35] [INFO ] Computed 12 place invariants in 43 ms
[2023-03-12 12:46:36] [INFO ] Dead Transitions using invariants and state equation in 729 ms found 459 transitions.
Found 459 dead transitions using SMT.
Drop transitions removed 459 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 459 transitions.
// Phase 1: matrix 234 rows 33 cols
[2023-03-12 12:46:36] [INFO ] Computed 12 place invariants in 6 ms
[2023-03-12 12:46:36] [INFO ] Implicit Places using invariants in 49 ms returned []
[2023-03-12 12:46:36] [INFO ] Invariant cache hit.
[2023-03-12 12:46:36] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 231 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 33/33 places, 234/711 transitions.
Applied a total of 0 rules in 2 ms. Remains 33 /33 variables (removed 0) and now considering 234/234 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1055 ms. Remains : 33/33 places, 234/711 transitions.
Support contains 33 out of 33 places after structural reductions.
[2023-03-12 12:46:36] [INFO ] Flatten gal took : 117 ms
[2023-03-12 12:46:36] [INFO ] Flatten gal took : 48 ms
[2023-03-12 12:46:36] [INFO ] Input system was already deterministic with 234 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 722 ms. (steps per millisecond=13 ) properties (out of 20) seen :16
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-12 12:46:37] [INFO ] Invariant cache hit.
[2023-03-12 12:46:37] [INFO ] After 65ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-12 12:46:38] [INFO ] [Nat]Absence check using 7 positive place invariants in 8 ms returned sat
[2023-03-12 12:46:38] [INFO ] [Nat]Absence check using 7 positive and 5 generalized place invariants in 2 ms returned sat
[2023-03-12 12:46:38] [INFO ] After 59ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :0
Fused 4 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
FORMULA GlobalResAllocation-PT-03-LTLCardinality-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 4 atomic propositions for a total of 10 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA GlobalResAllocation-PT-03-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GlobalResAllocation-PT-03-LTLCardinality-13 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' '!(X((F(p0)&&(X(F(p1))||(p1&&G(p0))))))'
Support contains 24 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 234/234 transitions.
Applied a total of 0 rules in 3 ms. Remains 33 /33 variables (removed 0) and now considering 234/234 (removed 0) transitions.
[2023-03-12 12:46:38] [INFO ] Invariant cache hit.
[2023-03-12 12:46:38] [INFO ] Dead Transitions using invariants and state equation in 160 ms found 0 transitions.
[2023-03-12 12:46:38] [INFO ] Invariant cache hit.
[2023-03-12 12:46:38] [INFO ] Implicit Places using invariants in 139 ms returned [27, 28, 31]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 143 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 30/33 places, 234/234 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 234/234 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 310 ms. Remains : 30/33 places, 234/234 transitions.
Stuttering acceptance computed with spot in 384 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : GlobalResAllocation-PT-03-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(OR (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND p0 p1), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(LEQ (ADD s0 s1 s2) (ADD s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26)), p1:(LEQ 2 (ADD s27 s28 s29))], 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 32589 reset in 1726 ms.
Product exploration explored 100000 steps with 32599 reset in 1571 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 (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (OR (NOT p0) (NOT p1))), (X (NOT (OR (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (NOT p0)), (X p0), (X (X (NOT p1))), (X (X p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 398 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 202 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p0))]
Finished random walk after 116 steps, including 0 resets, run visited all 6 properties in 3 ms. (steps per millisecond=38 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (OR (NOT p0) (NOT p1))), (X (NOT (OR (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (NOT p0)), (X p0), (X (X (NOT p1))), (X (X p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F (AND p0 (NOT p1))), (F p0), (F (AND p0 p1)), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 2 factoid took 526 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 195 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 198 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p0))]
// Phase 1: matrix 234 rows 30 cols
[2023-03-12 12:46:43] [INFO ] Computed 9 place invariants in 2 ms
[2023-03-12 12:46:44] [INFO ] [Real]Absence check using 9 positive place invariants in 16 ms returned sat
[2023-03-12 12:46:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 12:46:44] [INFO ] [Real]Absence check using state equation in 90 ms returned sat
[2023-03-12 12:46:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 12:46:44] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned unsat
Proved EG (NOT p0)
[2023-03-12 12:46:44] [INFO ] Invariant cache hit.
[2023-03-12 12:46:44] [INFO ] [Real]Absence check using 9 positive place invariants in 5 ms returned sat
[2023-03-12 12:46:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 12:46:44] [INFO ] [Real]Absence check using state equation in 112 ms returned sat
[2023-03-12 12:46:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 12:46:44] [INFO ] [Nat]Absence check using 9 positive place invariants in 5 ms returned sat
[2023-03-12 12:46:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 12:46:45] [INFO ] [Nat]Absence check using state equation in 72 ms returned sat
[2023-03-12 12:46:45] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 66 transitions) in 43 ms.
[2023-03-12 12:46:45] [INFO ] Added : 0 causal constraints over 0 iterations in 87 ms. Result :sat
Could not prove EG (NOT p1)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (OR (NOT p0) (NOT p1))), (X (NOT (OR (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (NOT p0)), (X p0), (X (X (NOT p1))), (X (X p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F (AND p0 (NOT p1))), (F p0), (F (AND p0 p1)), (F (NOT (OR (NOT p0) (NOT p1)))), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 2 factoid took 636 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA GlobalResAllocation-PT-03-LTLCardinality-00 FALSE TECHNIQUES KNOWLEDGE
Treatment of property GlobalResAllocation-PT-03-LTLCardinality-00 finished in 7487 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)&&(p0||X((p1 U X(!p1)))))))'
Support contains 12 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 234/234 transitions.
Applied a total of 0 rules in 2 ms. Remains 33 /33 variables (removed 0) and now considering 234/234 (removed 0) transitions.
// Phase 1: matrix 234 rows 33 cols
[2023-03-12 12:46:45] [INFO ] Computed 12 place invariants in 6 ms
[2023-03-12 12:46:45] [INFO ] Dead Transitions using invariants and state equation in 167 ms found 0 transitions.
[2023-03-12 12:46:45] [INFO ] Invariant cache hit.
[2023-03-12 12:46:46] [INFO ] Implicit Places using invariants in 98 ms returned [27, 28, 31]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 113 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 30/33 places, 234/234 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 234/234 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 288 ms. Remains : 30/33 places, 234/234 transitions.
Stuttering acceptance computed with spot in 244 ms :[(NOT p0), (NOT p0), (OR (NOT p0) p1), p1, p1, true, (NOT p0)]
Running random walk in product with property : GlobalResAllocation-PT-03-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 5}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 p1), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(NOT p0), acceptance={} source=2 dest: 5}], [{ cond=p1, acceptance={0} source=3 dest: 3}], [{ cond=p1, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=true, acceptance={} source=6 dest: 1}]], initial=6, aps=[p0:(LEQ (ADD s0 s1 s2) (ADD s27 s28 s29)), p1:(GT 2 (ADD s3 s4 s5 s6 s7 s8))], 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, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 16 steps with 4 reset in 1 ms.
FORMULA GlobalResAllocation-PT-03-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GlobalResAllocation-PT-03-LTLCardinality-02 finished in 552 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(F(p0)))))'
Support contains 9 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 234/234 transitions.
Applied a total of 0 rules in 2 ms. Remains 33 /33 variables (removed 0) and now considering 234/234 (removed 0) transitions.
[2023-03-12 12:46:46] [INFO ] Invariant cache hit.
[2023-03-12 12:46:46] [INFO ] Dead Transitions using invariants and state equation in 186 ms found 0 transitions.
[2023-03-12 12:46:46] [INFO ] Invariant cache hit.
[2023-03-12 12:46:46] [INFO ] Implicit Places using invariants in 77 ms returned [27, 28, 31]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 79 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 30/33 places, 234/234 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 234/234 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 270 ms. Remains : 30/33 places, 234/234 transitions.
Stuttering acceptance computed with spot in 150 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : GlobalResAllocation-PT-03-LTLCardinality-06 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: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(GT (ADD s3 s4 s5 s6 s7 s8) (ADD s0 s1 s2))], 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 23770 reset in 1269 ms.
Product exploration explored 100000 steps with 23808 reset in 1239 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, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 89 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 147 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=1 )
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 111 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 145 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 156 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 9 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 234/234 transitions.
Applied a total of 0 rules in 5 ms. Remains 30 /30 variables (removed 0) and now considering 234/234 (removed 0) transitions.
// Phase 1: matrix 234 rows 30 cols
[2023-03-12 12:46:49] [INFO ] Computed 9 place invariants in 2 ms
[2023-03-12 12:46:50] [INFO ] Dead Transitions using invariants and state equation in 176 ms found 0 transitions.
[2023-03-12 12:46:50] [INFO ] Invariant cache hit.
[2023-03-12 12:46:50] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-03-12 12:46:50] [INFO ] Invariant cache hit.
[2023-03-12 12:46:50] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
[2023-03-12 12:46:50] [INFO ] Invariant cache hit.
[2023-03-12 12:46:50] [INFO ] Dead Transitions using invariants and state equation in 181 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 473 ms. Remains : 30/30 places, 234/234 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, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 88 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 146 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 103 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=17 )
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 111 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 143 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 153 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 23797 reset in 1206 ms.
Product exploration explored 100000 steps with 23812 reset in 1221 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 150 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 9 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 234/234 transitions.
Applied a total of 0 rules in 20 ms. Remains 30 /30 variables (removed 0) and now considering 234/234 (removed 0) transitions.
[2023-03-12 12:46:54] [INFO ] Invariant cache hit.
[2023-03-12 12:46:54] [INFO ] Dead Transitions using invariants and state equation in 177 ms found 0 transitions.
[2023-03-12 12:46:54] [INFO ] Redundant transitions in 116 ms returned [189, 190, 191, 192, 193, 194, 195, 196, 197, 198, 199, 200, 201, 202, 203, 204, 205, 206, 207, 208, 209, 210, 211, 212, 213, 214, 215, 216, 217, 218, 219, 220, 221, 222, 223, 224, 225, 226, 227, 228, 229, 230, 231, 232, 233]
Found 45 redundant transitions using SMT.
Drop transitions removed 45 transitions
Redundant transitions reduction (with SMT) removed 45 transitions.
// Phase 1: matrix 189 rows 30 cols
[2023-03-12 12:46:54] [INFO ] Computed 9 place invariants in 2 ms
[2023-03-12 12:46:54] [INFO ] Dead Transitions using invariants and state equation in 139 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 30/30 places, 189/234 transitions.
Applied a total of 0 rules in 8 ms. Remains 30 /30 variables (removed 0) and now considering 189/189 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 471 ms. Remains : 30/30 places, 189/234 transitions.
Support contains 9 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 234/234 transitions.
Applied a total of 0 rules in 3 ms. Remains 30 /30 variables (removed 0) and now considering 234/234 (removed 0) transitions.
// Phase 1: matrix 234 rows 30 cols
[2023-03-12 12:46:54] [INFO ] Computed 9 place invariants in 2 ms
[2023-03-12 12:46:54] [INFO ] Dead Transitions using invariants and state equation in 175 ms found 0 transitions.
[2023-03-12 12:46:54] [INFO ] Invariant cache hit.
[2023-03-12 12:46:54] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-12 12:46:54] [INFO ] Invariant cache hit.
[2023-03-12 12:46:54] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
[2023-03-12 12:46:54] [INFO ] Invariant cache hit.
[2023-03-12 12:46:55] [INFO ] Dead Transitions using invariants and state equation in 173 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 464 ms. Remains : 30/30 places, 234/234 transitions.
Treatment of property GlobalResAllocation-PT-03-LTLCardinality-06 finished in 8838 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 6 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 234/234 transitions.
Applied a total of 0 rules in 2 ms. Remains 33 /33 variables (removed 0) and now considering 234/234 (removed 0) transitions.
// Phase 1: matrix 234 rows 33 cols
[2023-03-12 12:46:55] [INFO ] Computed 12 place invariants in 3 ms
[2023-03-12 12:46:55] [INFO ] Dead Transitions using invariants and state equation in 174 ms found 0 transitions.
[2023-03-12 12:46:55] [INFO ] Invariant cache hit.
[2023-03-12 12:46:55] [INFO ] Implicit Places using invariants in 73 ms returned []
[2023-03-12 12:46:55] [INFO ] Invariant cache hit.
[2023-03-12 12:46:55] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 207 ms to find 0 implicit places.
[2023-03-12 12:46:55] [INFO ] Invariant cache hit.
[2023-03-12 12:46:55] [INFO ] Dead Transitions using invariants and state equation in 189 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 574 ms. Remains : 33/33 places, 234/234 transitions.
Stuttering acceptance computed with spot in 209 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : GlobalResAllocation-PT-03-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(LEQ (ADD s0 s1 s2) (ADD s27 s28 s31))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 91 steps with 0 reset in 1 ms.
FORMULA GlobalResAllocation-PT-03-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GlobalResAllocation-PT-03-LTLCardinality-07 finished in 805 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((X(G(X(p0)))&&p1))&&!(!p1 U p2)))'
Support contains 5 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 234/234 transitions.
Applied a total of 0 rules in 2 ms. Remains 33 /33 variables (removed 0) and now considering 234/234 (removed 0) transitions.
[2023-03-12 12:46:55] [INFO ] Invariant cache hit.
[2023-03-12 12:46:56] [INFO ] Dead Transitions using invariants and state equation in 182 ms found 0 transitions.
[2023-03-12 12:46:56] [INFO ] Invariant cache hit.
[2023-03-12 12:46:56] [INFO ] Implicit Places using invariants in 107 ms returned [28, 31]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 108 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 31/33 places, 234/234 transitions.
Applied a total of 0 rules in 2 ms. Remains 31 /31 variables (removed 0) and now considering 234/234 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 295 ms. Remains : 31/33 places, 234/234 transitions.
Stuttering acceptance computed with spot in 231 ms :[true, (NOT p0), (OR (NOT p1) (NOT p0) p2), (OR (NOT p1) (NOT p0) p2), (OR (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : GlobalResAllocation-PT-03-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 5}], [{ cond=p2, acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=(OR (NOT p1) p2), acceptance={} source=3 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 1}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=p1, acceptance={} source=4 dest: 1}], [{ cond=(NOT p0), acceptance={} source=5 dest: 0}, { cond=p0, acceptance={} source=5 dest: 5}]], initial=2, aps=[p2:(LEQ s2 s30), p1:(GT s27 s6), p0:(GT s2 s8)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA GlobalResAllocation-PT-03-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GlobalResAllocation-PT-03-LTLCardinality-08 finished in 546 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 4 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 234/234 transitions.
Applied a total of 0 rules in 2 ms. Remains 33 /33 variables (removed 0) and now considering 234/234 (removed 0) transitions.
[2023-03-12 12:46:56] [INFO ] Invariant cache hit.
[2023-03-12 12:46:56] [INFO ] Dead Transitions using invariants and state equation in 166 ms found 0 transitions.
[2023-03-12 12:46:56] [INFO ] Invariant cache hit.
[2023-03-12 12:46:56] [INFO ] Implicit Places using invariants in 104 ms returned [27, 28, 31]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 107 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 30/33 places, 234/234 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 234/234 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 277 ms. Remains : 30/33 places, 234/234 transitions.
Stuttering acceptance computed with spot in 87 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : GlobalResAllocation-PT-03-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GT s28 s1) (GT s3 s27))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA GlobalResAllocation-PT-03-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GlobalResAllocation-PT-03-LTLCardinality-09 finished in 384 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 33 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 33/33 places, 234/234 transitions.
Applied a total of 0 rules in 22 ms. Remains 33 /33 variables (removed 0) and now considering 234/234 (removed 0) transitions.
[2023-03-12 12:46:56] [INFO ] Invariant cache hit.
[2023-03-12 12:46:57] [INFO ] Dead Transitions using invariants and state equation in 148 ms found 0 transitions.
[2023-03-12 12:46:57] [INFO ] Invariant cache hit.
[2023-03-12 12:46:57] [INFO ] Implicit Places using invariants in 111 ms returned [28, 31]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 113 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 31/33 places, 234/234 transitions.
Applied a total of 0 rules in 13 ms. Remains 31 /31 variables (removed 0) and now considering 234/234 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 300 ms. Remains : 31/33 places, 234/234 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : GlobalResAllocation-PT-03-LTLCardinality-11 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 1 s27)], 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 8876 reset in 692 ms.
Stack based approach found an accepted trace after 118 steps with 13 reset with depth 11 and stack size 11 in 1 ms.
FORMULA GlobalResAllocation-PT-03-LTLCardinality-11 FALSE TECHNIQUES STACK_TEST
Treatment of property GlobalResAllocation-PT-03-LTLCardinality-11 finished in 1087 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((X(X(p0))||F(p1)))))'
Support contains 3 out of 33 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 33/33 places, 234/234 transitions.
Applied a total of 0 rules in 12 ms. Remains 33 /33 variables (removed 0) and now considering 234/234 (removed 0) transitions.
[2023-03-12 12:46:58] [INFO ] Invariant cache hit.
[2023-03-12 12:46:58] [INFO ] Dead Transitions using invariants and state equation in 159 ms found 0 transitions.
[2023-03-12 12:46:58] [INFO ] Invariant cache hit.
[2023-03-12 12:46:58] [INFO ] Implicit Places using invariants in 94 ms returned [27, 28, 31]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 95 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 30/33 places, 234/234 transitions.
Applied a total of 0 rules in 7 ms. Remains 30 /30 variables (removed 0) and now considering 234/234 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 276 ms. Remains : 30/33 places, 234/234 transitions.
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : GlobalResAllocation-PT-03-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s0 s6), p1:(LEQ 1 s27)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 80 reset in 429 ms.
Product exploration explored 100000 steps with 85 reset in 802 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 1 factoid took 235 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 1 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND p0 (NOT p1))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 1 factoid took 281 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 95 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 234/234 transitions.
Applied a total of 0 rules in 8 ms. Remains 30 /30 variables (removed 0) and now considering 234/234 (removed 0) transitions.
// Phase 1: matrix 234 rows 30 cols
[2023-03-12 12:47:00] [INFO ] Computed 9 place invariants in 4 ms
[2023-03-12 12:47:00] [INFO ] Dead Transitions using invariants and state equation in 141 ms found 0 transitions.
[2023-03-12 12:47:00] [INFO ] Invariant cache hit.
[2023-03-12 12:47:00] [INFO ] Implicit Places using invariants in 50 ms returned []
[2023-03-12 12:47:00] [INFO ] Invariant cache hit.
[2023-03-12 12:47:00] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 162 ms to find 0 implicit places.
[2023-03-12 12:47:00] [INFO ] Redundant transitions in 133 ms returned [189, 190, 191, 192, 193, 194, 195, 196, 197, 198, 199, 200, 201, 202, 203, 204, 205, 206, 207, 208, 209, 210, 211, 212, 213, 214, 215, 216, 217, 218, 219, 220, 221, 222, 223, 224, 225, 226, 227, 228, 229, 230, 231, 232, 233]
Found 45 redundant transitions using SMT.
Drop transitions removed 45 transitions
Redundant transitions reduction (with SMT) removed 45 transitions.
// Phase 1: matrix 189 rows 30 cols
[2023-03-12 12:47:00] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-12 12:47:00] [INFO ] Dead Transitions using invariants and state equation in 139 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 30/30 places, 189/234 transitions.
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 0 with 20 rules applied. Total rules applied 20 place count 20 transition count 179
Drop transitions removed 100 transitions
Redundant transition composition rules discarded 100 transitions
Iterating global reduction 0 with 100 rules applied. Total rules applied 120 place count 20 transition count 79
Applied a total of 120 rules in 19 ms. Remains 20 /30 variables (removed 10) and now considering 79/189 (removed 110) transitions.
[2023-03-12 12:47:01] [INFO ] Flow matrix only has 71 transitions (discarded 8 similar events)
// Phase 1: matrix 71 rows 20 cols
[2023-03-12 12:47:01] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-12 12:47:01] [INFO ] Implicit Places using invariants in 41 ms returned []
[2023-03-12 12:47:01] [INFO ] Flow matrix only has 71 transitions (discarded 8 similar events)
[2023-03-12 12:47:01] [INFO ] Invariant cache hit.
[2023-03-12 12:47:01] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 20/30 places, 79/234 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 727 ms. Remains : 20/30 places, 79/234 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 1 factoid took 329 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 8 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=8 )
Knowledge obtained : [(AND p0 (NOT p1))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 1 factoid took 273 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 794 reset in 289 ms.
Stack based approach found an accepted trace after 6868 steps with 44 reset with depth 140 and stack size 66 in 18 ms.
FORMULA GlobalResAllocation-PT-03-LTLCardinality-14 FALSE TECHNIQUES STACK_TEST
Treatment of property GlobalResAllocation-PT-03-LTLCardinality-14 finished in 4401 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(F(p0)))))'
Found a Shortening insensitive property : GlobalResAllocation-PT-03-LTLCardinality-06
Stuttering acceptance computed with spot in 150 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 9 out of 33 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 33/33 places, 234/234 transitions.
Applied a total of 0 rules in 7 ms. Remains 33 /33 variables (removed 0) and now considering 234/234 (removed 0) transitions.
// Phase 1: matrix 234 rows 33 cols
[2023-03-12 12:47:02] [INFO ] Computed 12 place invariants in 4 ms
[2023-03-12 12:47:02] [INFO ] Dead Transitions using invariants and state equation in 164 ms found 0 transitions.
[2023-03-12 12:47:02] [INFO ] Invariant cache hit.
[2023-03-12 12:47:02] [INFO ] Implicit Places using invariants in 70 ms returned [27, 28, 31]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 74 ms to find 3 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 30/33 places, 234/234 transitions.
Applied a total of 0 rules in 5 ms. Remains 30 /30 variables (removed 0) and now considering 234/234 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 252 ms. Remains : 30/33 places, 234/234 transitions.
Running random walk in product with property : GlobalResAllocation-PT-03-LTLCardinality-06 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: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(GT (ADD s3 s4 s5 s6 s7 s8) (ADD s0 s1 s2))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 23767 reset in 1259 ms.
Product exploration explored 100000 steps with 23812 reset in 1281 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, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 100 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 147 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 82 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=41 )
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 108 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 142 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 229 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 9 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 234/234 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 234/234 (removed 0) transitions.
// Phase 1: matrix 234 rows 30 cols
[2023-03-12 12:47:06] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-12 12:47:06] [INFO ] Dead Transitions using invariants and state equation in 171 ms found 0 transitions.
[2023-03-12 12:47:06] [INFO ] Invariant cache hit.
[2023-03-12 12:47:06] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-12 12:47:06] [INFO ] Invariant cache hit.
[2023-03-12 12:47:06] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 96 ms to find 0 implicit places.
[2023-03-12 12:47:06] [INFO ] Invariant cache hit.
[2023-03-12 12:47:06] [INFO ] Dead Transitions using invariants and state equation in 135 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 407 ms. Remains : 30/30 places, 234/234 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, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 87 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 159 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 52 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=26 )
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 106 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 152 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 148 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 146 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 23804 reset in 1242 ms.
Product exploration explored 100000 steps with 23792 reset in 1267 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 149 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 9 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 234/234 transitions.
Applied a total of 0 rules in 10 ms. Remains 30 /30 variables (removed 0) and now considering 234/234 (removed 0) transitions.
[2023-03-12 12:47:10] [INFO ] Invariant cache hit.
[2023-03-12 12:47:10] [INFO ] Dead Transitions using invariants and state equation in 169 ms found 0 transitions.
[2023-03-12 12:47:10] [INFO ] Redundant transitions in 89 ms returned [189, 190, 191, 192, 193, 194, 195, 196, 197, 198, 199, 200, 201, 202, 203, 204, 205, 206, 207, 208, 209, 210, 211, 212, 213, 214, 215, 216, 217, 218, 219, 220, 221, 222, 223, 224, 225, 226, 227, 228, 229, 230, 231, 232, 233]
Found 45 redundant transitions using SMT.
Drop transitions removed 45 transitions
Redundant transitions reduction (with SMT) removed 45 transitions.
// Phase 1: matrix 189 rows 30 cols
[2023-03-12 12:47:10] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-12 12:47:10] [INFO ] Dead Transitions using invariants and state equation in 157 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 30/30 places, 189/234 transitions.
Applied a total of 0 rules in 5 ms. Remains 30 /30 variables (removed 0) and now considering 189/189 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 437 ms. Remains : 30/30 places, 189/234 transitions.
Support contains 9 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 234/234 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 234/234 (removed 0) transitions.
// Phase 1: matrix 234 rows 30 cols
[2023-03-12 12:47:10] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-12 12:47:10] [INFO ] Dead Transitions using invariants and state equation in 132 ms found 0 transitions.
[2023-03-12 12:47:10] [INFO ] Invariant cache hit.
[2023-03-12 12:47:10] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-12 12:47:10] [INFO ] Invariant cache hit.
[2023-03-12 12:47:10] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
[2023-03-12 12:47:10] [INFO ] Invariant cache hit.
[2023-03-12 12:47:11] [INFO ] Dead Transitions using invariants and state equation in 127 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 369 ms. Remains : 30/30 places, 234/234 transitions.
Treatment of property GlobalResAllocation-PT-03-LTLCardinality-06 finished in 8689 ms.
[2023-03-12 12:47:11] [INFO ] Flatten gal took : 35 ms
[2023-03-12 12:47:11] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2023-03-12 12:47:11] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 33 places, 234 transitions and 1743 arcs took 5 ms.
Total runtime 37059 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1504/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : GlobalResAllocation-PT-03-LTLCardinality-06

BK_STOP 1678625232707

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2023
ltl formula name GlobalResAllocation-PT-03-LTLCardinality-06
ltl formula formula --ltl=/tmp/1504/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 33 places, 234 transitions and 1743 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.070 real 0.010 user 0.010 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1504/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1504/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1504/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1504/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is GlobalResAllocation-PT-03, 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 r201-smll-167840347400219"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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