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.r135-smll-167819414900627.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 lolaxred
Input is DrinkVendingMachine-PT-02, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r135-smll-167819414900627
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 660K
-rw-r--r-- 1 mcc users 11K Feb 26 04:37 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K Feb 26 04:37 CTLCardinality.xml
-rw-r--r-- 1 mcc users 18K Feb 26 04:35 CTLFireability.txt
-rw-r--r-- 1 mcc users 94K Feb 26 04:35 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 5.5K Feb 25 16:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 31K Feb 25 16:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Feb 25 16:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 34K Feb 25 16:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 04:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 106K Feb 26 04:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 25K Feb 26 04:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 109K Feb 26 04:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 16:02 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.2K Feb 25 16:02 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 51K 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 DrinkVendingMachine-PT-02-LTLCardinality-00
FORMULA_NAME DrinkVendingMachine-PT-02-LTLCardinality-01
FORMULA_NAME DrinkVendingMachine-PT-02-LTLCardinality-02
FORMULA_NAME DrinkVendingMachine-PT-02-LTLCardinality-03
FORMULA_NAME DrinkVendingMachine-PT-02-LTLCardinality-04
FORMULA_NAME DrinkVendingMachine-PT-02-LTLCardinality-05
FORMULA_NAME DrinkVendingMachine-PT-02-LTLCardinality-06
FORMULA_NAME DrinkVendingMachine-PT-02-LTLCardinality-07
FORMULA_NAME DrinkVendingMachine-PT-02-LTLCardinality-08
FORMULA_NAME DrinkVendingMachine-PT-02-LTLCardinality-09
FORMULA_NAME DrinkVendingMachine-PT-02-LTLCardinality-10
FORMULA_NAME DrinkVendingMachine-PT-02-LTLCardinality-11
FORMULA_NAME DrinkVendingMachine-PT-02-LTLCardinality-12
FORMULA_NAME DrinkVendingMachine-PT-02-LTLCardinality-13
FORMULA_NAME DrinkVendingMachine-PT-02-LTLCardinality-14
FORMULA_NAME DrinkVendingMachine-PT-02-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678435722899

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=lolaxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DrinkVendingMachine-PT-02
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-10 08:08:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-10 08:08:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 08:08:46] [INFO ] Load time of PNML (sax parser for PT used): 84 ms
[2023-03-10 08:08:46] [INFO ] Transformed 24 places.
[2023-03-10 08:08:46] [INFO ] Transformed 72 transitions.
[2023-03-10 08:08:46] [INFO ] Parsed PT model containing 24 places and 72 transitions and 440 arcs in 238 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 20 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Ensure Unique test removed 20 transitions
Reduce redundant transitions removed 20 transitions.
FORMULA DrinkVendingMachine-PT-02-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DrinkVendingMachine-PT-02-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DrinkVendingMachine-PT-02-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DrinkVendingMachine-PT-02-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 24 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 52/52 transitions.
Applied a total of 0 rules in 16 ms. Remains 24 /24 variables (removed 0) and now considering 52/52 (removed 0) transitions.
// Phase 1: matrix 52 rows 24 cols
[2023-03-10 08:08:46] [INFO ] Computed 12 place invariants in 8 ms
[2023-03-10 08:08:47] [INFO ] Dead Transitions using invariants and state equation in 338 ms found 24 transitions.
Found 24 dead transitions using SMT.
Drop transitions removed 24 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 24 transitions.
// Phase 1: matrix 28 rows 24 cols
[2023-03-10 08:08:47] [INFO ] Computed 12 place invariants in 2 ms
[2023-03-10 08:08:47] [INFO ] Implicit Places using invariants in 60 ms returned []
[2023-03-10 08:08:47] [INFO ] Invariant cache hit.
[2023-03-10 08:08:47] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 213 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 24/24 places, 28/52 transitions.
Reduce places removed 0 places and 2 transitions.
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 0 rules in 2 ms. Remains 24 /24 variables (removed 0) and now considering 26/28 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 639 ms. Remains : 24/24 places, 26/52 transitions.
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Support contains 20 out of 20 places after structural reductions.
FORMULA DrinkVendingMachine-PT-02-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DrinkVendingMachine-PT-02-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-10 08:08:47] [INFO ] Flatten gal took : 41 ms
[2023-03-10 08:08:47] [INFO ] Flatten gal took : 16 ms
[2023-03-10 08:08:47] [INFO ] Input system was already deterministic with 26 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 810 ms. (steps per millisecond=12 ) properties (out of 22) seen :15
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 7) seen :2
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 26 rows 20 cols
[2023-03-10 08:08:48] [INFO ] Computed 10 place invariants in 7 ms
[2023-03-10 08:08:49] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2023-03-10 08:08:49] [INFO ] After 84ms SMT Verify possible using all constraints in real domain returned unsat :5 sat :0
Fused 5 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
FORMULA DrinkVendingMachine-PT-02-LTLCardinality-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 5 atomic propositions for a total of 9 simplifications.
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((G(p0)||G(F(p1)))))'
Support contains 6 out of 20 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 20/20 places, 26/26 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 18 place count 8 transition count 20
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 26 place count 8 transition count 12
Applied a total of 26 rules in 13 ms. Remains 8 /20 variables (removed 12) and now considering 12/26 (removed 14) transitions.
// Phase 1: matrix 12 rows 8 cols
[2023-03-10 08:08:49] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-10 08:08:49] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-10 08:08:49] [INFO ] Invariant cache hit.
[2023-03-10 08:08:49] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
[2023-03-10 08:08:49] [INFO ] Redundant transitions in 36 ms returned []
[2023-03-10 08:08:49] [INFO ] Invariant cache hit.
[2023-03-10 08:08:49] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/20 places, 12/26 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 171 ms. Remains : 8/20 places, 12/26 transitions.
Stuttering acceptance computed with spot in 335 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DrinkVendingMachine-PT-02-LTLCardinality-01 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 (ADD s4 s6) (ADD s2 s3)), p1:(GT 2 (ADD s5 s7))], 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 7808 reset in 618 ms.
Stack based approach found an accepted trace after 77 steps with 6 reset with depth 13 and stack size 9 in 2 ms.
FORMULA DrinkVendingMachine-PT-02-LTLCardinality-01 FALSE TECHNIQUES STACK_TEST
Treatment of property DrinkVendingMachine-PT-02-LTLCardinality-01 finished in 1221 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 20 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 20/20 places, 26/26 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 24 place count 4 transition count 18
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 36 place count 4 transition count 6
Applied a total of 36 rules in 7 ms. Remains 4 /20 variables (removed 16) and now considering 6/26 (removed 20) transitions.
// Phase 1: matrix 6 rows 4 cols
[2023-03-10 08:08:50] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-10 08:08:50] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-10 08:08:50] [INFO ] Invariant cache hit.
[2023-03-10 08:08:50] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2023-03-10 08:08:50] [INFO ] Redundant transitions in 19 ms returned [5]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 5 rows 4 cols
[2023-03-10 08:08:50] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-10 08:08:50] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/20 places, 5/26 transitions.
Applied a total of 0 rules in 2 ms. Remains 4 /4 variables (removed 0) and now considering 5/5 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 131 ms. Remains : 4/20 places, 5/26 transitions.
Stuttering acceptance computed with spot in 132 ms :[(NOT p0)]
Running random walk in product with property : DrinkVendingMachine-PT-02-LTLCardinality-03 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 2 (ADD s0 s1))], 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 1 steps with 0 reset in 0 ms.
FORMULA DrinkVendingMachine-PT-02-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DrinkVendingMachine-PT-02-LTLCardinality-03 finished in 284 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)&&(p1 U (p2||G(p1))))))'
Support contains 12 out of 20 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 26/26 transitions.
Applied a total of 0 rules in 2 ms. Remains 20 /20 variables (removed 0) and now considering 26/26 (removed 0) transitions.
// Phase 1: matrix 26 rows 20 cols
[2023-03-10 08:08:50] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-10 08:08:51] [INFO ] Implicit Places using invariants in 49 ms returned []
[2023-03-10 08:08:51] [INFO ] Invariant cache hit.
[2023-03-10 08:08:51] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
[2023-03-10 08:08:51] [INFO ] Invariant cache hit.
[2023-03-10 08:08:51] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 171 ms. Remains : 20/20 places, 26/26 transitions.
Stuttering acceptance computed with spot in 281 ms :[(AND (NOT p2) (NOT p1)), (NOT p0), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : DrinkVendingMachine-PT-02-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND p0 (NOT p2) p1), acceptance={0} source=4 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=4 dest: 4}]], initial=2, aps=[p2:(AND (GT (ADD s17 s19) (ADD s8 s9)) (LEQ 3 (ADD s0 s1 s2 s3 s4 s5 2))), p1:(LEQ 3 (ADD s0 s1 s2 s3 s4 s5 2)), p0:(GT (ADD s0 s1 s2 s3 s4 s5 2) (ADD s16...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 13889 reset in 577 ms.
Product exploration explored 100000 steps with 13817 reset in 386 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 p2) p1 p0), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) p2))), true, (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p0) p2))))]
False Knowledge obtained : [(X (AND p0 (NOT p2) p1)), (X (NOT (AND p0 (NOT p2) p1))), (X (X (AND p0 (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 556 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 131 ms :[true, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Finished random walk after 3123 steps, including 0 resets, run visited all 2 properties in 14 ms. (steps per millisecond=223 )
Knowledge obtained : [(AND (NOT p2) p1 p0), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) p2))), true, (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p0) p2))))]
False Knowledge obtained : [(X (AND p0 (NOT p2) p1)), (X (NOT (AND p0 (NOT p2) p1))), (X (X (AND p0 (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (F (AND (NOT p1) (NOT p2))), (F (NOT (AND p1 (NOT p2))))]
Knowledge based reduction with 9 factoid took 765 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 124 ms :[true, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 122 ms :[true, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 10 out of 20 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 26/26 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 26/26 (removed 0) transitions.
[2023-03-10 08:08:54] [INFO ] Invariant cache hit.
[2023-03-10 08:08:54] [INFO ] Implicit Places using invariants in 42 ms returned []
[2023-03-10 08:08:54] [INFO ] Invariant cache hit.
[2023-03-10 08:08:54] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
[2023-03-10 08:08:54] [INFO ] Invariant cache hit.
[2023-03-10 08:08:54] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 184 ms. Remains : 20/20 places, 26/26 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 p1 (NOT p2)), (X (NOT (AND (NOT p1) (NOT p2)))), true, (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(X (AND p1 (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2)))))]
Knowledge based reduction with 4 factoid took 355 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 126 ms :[true, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 2) seen :1
Finished Best-First random walk after 118 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=59 )
Knowledge obtained : [(AND p1 (NOT p2)), (X (NOT (AND (NOT p1) (NOT p2)))), true, (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(X (AND p1 (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (F (AND (NOT p1) (NOT p2))), (F (NOT (AND p1 (NOT p2))))]
Knowledge based reduction with 4 factoid took 411 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 121 ms :[true, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 121 ms :[true, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 120 ms :[true, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 13975 reset in 419 ms.
Product exploration explored 100000 steps with 13727 reset in 433 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 125 ms :[true, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 10 out of 20 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 20/20 places, 26/26 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 20 transition count 26
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 19 transition count 18
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 19 transition count 18
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 18 transition count 17
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 18 transition count 17
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 6 rules in 12 ms. Remains 18 /20 variables (removed 2) and now considering 17/26 (removed 9) transitions.
[2023-03-10 08:08:57] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 17 rows 18 cols
[2023-03-10 08:08:57] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-10 08:08:57] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 18/20 places, 17/26 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 89 ms. Remains : 18/20 places, 17/26 transitions.
Support contains 10 out of 20 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 26/26 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 26/26 (removed 0) transitions.
// Phase 1: matrix 26 rows 20 cols
[2023-03-10 08:08:57] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-10 08:08:57] [INFO ] Implicit Places using invariants in 44 ms returned []
[2023-03-10 08:08:57] [INFO ] Invariant cache hit.
[2023-03-10 08:08:57] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
[2023-03-10 08:08:57] [INFO ] Invariant cache hit.
[2023-03-10 08:08:57] [INFO ] Dead Transitions using invariants and state equation in 89 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 196 ms. Remains : 20/20 places, 26/26 transitions.
Treatment of property DrinkVendingMachine-PT-02-LTLCardinality-04 finished in 6369 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 4 out of 20 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 20/20 places, 26/26 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 18 place count 8 transition count 20
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 26 place count 8 transition count 12
Applied a total of 26 rules in 5 ms. Remains 8 /20 variables (removed 12) and now considering 12/26 (removed 14) transitions.
// Phase 1: matrix 12 rows 8 cols
[2023-03-10 08:08:57] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-10 08:08:57] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-03-10 08:08:57] [INFO ] Invariant cache hit.
[2023-03-10 08:08:57] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
[2023-03-10 08:08:57] [INFO ] Redundant transitions in 27 ms returned []
[2023-03-10 08:08:57] [INFO ] Invariant cache hit.
[2023-03-10 08:08:57] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/20 places, 12/26 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 163 ms. Remains : 8/20 places, 12/26 transitions.
Stuttering acceptance computed with spot in 163 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DrinkVendingMachine-PT-02-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GT 2 (ADD s5 s7)), p1:(GT 1 (ADD s0 s1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 194 ms.
Stack based approach found an accepted trace after 7 steps with 0 reset with depth 8 and stack size 8 in 6 ms.
FORMULA DrinkVendingMachine-PT-02-LTLCardinality-05 FALSE TECHNIQUES STACK_TEST
Treatment of property DrinkVendingMachine-PT-02-LTLCardinality-05 finished in 551 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||(p1 U G(!p2))))))'
Support contains 10 out of 20 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 26/26 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 26/26 (removed 0) transitions.
// Phase 1: matrix 26 rows 20 cols
[2023-03-10 08:08:57] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-10 08:08:57] [INFO ] Implicit Places using invariants in 49 ms returned []
[2023-03-10 08:08:57] [INFO ] Invariant cache hit.
[2023-03-10 08:08:58] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
[2023-03-10 08:08:58] [INFO ] Invariant cache hit.
[2023-03-10 08:08:58] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 161 ms. Remains : 20/20 places, 26/26 transitions.
Stuttering acceptance computed with spot in 246 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), true, p2, p2]
Running random walk in product with property : DrinkVendingMachine-PT-02-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p2, acceptance={} source=3 dest: 2}, { cond=(NOT p2), acceptance={} source=3 dest: 3}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={} source=4 dest: 4}, { cond=(AND p2 p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(LEQ 1 (ADD s10 s11 s12 s13 s14 s15)), p2:(AND (OR (LEQ 1 (ADD s10 s11 s12 s13 s14 s15)) (LEQ (ADD s10 s11 s12 s13 s14 s15) (ADD s8 s9))) (LEQ (ADD s10...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 44 steps with 0 reset in 1 ms.
FORMULA DrinkVendingMachine-PT-02-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DrinkVendingMachine-PT-02-LTLCardinality-06 finished in 440 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&X(X(F(p0)))))))'
Support contains 6 out of 20 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 26/26 transitions.
Applied a total of 0 rules in 2 ms. Remains 20 /20 variables (removed 0) and now considering 26/26 (removed 0) transitions.
[2023-03-10 08:08:58] [INFO ] Invariant cache hit.
[2023-03-10 08:08:58] [INFO ] Implicit Places using invariants in 56 ms returned []
[2023-03-10 08:08:58] [INFO ] Invariant cache hit.
[2023-03-10 08:08:58] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 127 ms to find 0 implicit places.
[2023-03-10 08:08:58] [INFO ] Invariant cache hit.
[2023-03-10 08:08:58] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 206 ms. Remains : 20/20 places, 26/26 transitions.
Stuttering acceptance computed with spot in 215 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DrinkVendingMachine-PT-02-LTLCardinality-07 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=p0, acceptance={0} source=3 dest: 1}, { cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(LEQ 1 (ADD s10 s11 s12 s13 s14 s15))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 24252 reset in 333 ms.
Product exploration explored 100000 steps with 24273 reset in 358 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X p0), true]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 3 factoid took 237 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 221 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), (X p0), true]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F p0)]
Knowledge based reduction with 3 factoid took 279 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 202 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 147 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
[2023-03-10 08:09:00] [INFO ] Invariant cache hit.
[2023-03-10 08:09:00] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2023-03-10 08:09:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 08:09:00] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2023-03-10 08:09:00] [INFO ] Computed and/alt/rep : 10/48/10 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-10 08:09:00] [INFO ] Added : 0 causal constraints over 0 iterations in 30 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 6 out of 20 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 26/26 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 26/26 (removed 0) transitions.
[2023-03-10 08:09:00] [INFO ] Invariant cache hit.
[2023-03-10 08:09:00] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-10 08:09:00] [INFO ] Invariant cache hit.
[2023-03-10 08:09:00] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
[2023-03-10 08:09:00] [INFO ] Invariant cache hit.
[2023-03-10 08:09:00] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 134 ms. Remains : 20/20 places, 26/26 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 279 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 176 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=0 )
Knowledge obtained : [(NOT p0), true]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 131 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 207 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 206 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
[2023-03-10 08:09:01] [INFO ] Invariant cache hit.
[2023-03-10 08:09:01] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2023-03-10 08:09:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 08:09:01] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2023-03-10 08:09:01] [INFO ] Computed and/alt/rep : 10/48/10 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-10 08:09:01] [INFO ] Added : 0 causal constraints over 0 iterations in 14 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 206 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 24285 reset in 317 ms.
Product exploration explored 100000 steps with 24275 reset in 347 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 211 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 6 out of 20 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 20/20 places, 26/26 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 20 transition count 26
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 19 transition count 18
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 19 transition count 18
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 18 transition count 17
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 18 transition count 17
Deduced a syphon composed of 3 places in 0 ms
Applied a total of 8 rules in 15 ms. Remains 18 /20 variables (removed 2) and now considering 17/26 (removed 9) transitions.
[2023-03-10 08:09:03] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-10 08:09:03] [INFO ] Flow matrix only has 15 transitions (discarded 2 similar events)
// Phase 1: matrix 15 rows 18 cols
[2023-03-10 08:09:03] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-10 08:09:03] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 18/20 places, 17/26 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 81 ms. Remains : 18/20 places, 17/26 transitions.
Support contains 6 out of 20 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 26/26 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 26/26 (removed 0) transitions.
// Phase 1: matrix 26 rows 20 cols
[2023-03-10 08:09:03] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-10 08:09:03] [INFO ] Implicit Places using invariants in 77 ms returned []
[2023-03-10 08:09:03] [INFO ] Invariant cache hit.
[2023-03-10 08:09:03] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 144 ms to find 0 implicit places.
[2023-03-10 08:09:03] [INFO ] Invariant cache hit.
[2023-03-10 08:09:03] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 193 ms. Remains : 20/20 places, 26/26 transitions.
Treatment of property DrinkVendingMachine-PT-02-LTLCardinality-07 finished in 5172 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)||X(G(p1)))))'
Support contains 4 out of 20 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 26/26 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 26/26 (removed 0) transitions.
[2023-03-10 08:09:03] [INFO ] Invariant cache hit.
[2023-03-10 08:09:03] [INFO ] Implicit Places using invariants in 48 ms returned []
[2023-03-10 08:09:03] [INFO ] Invariant cache hit.
[2023-03-10 08:09:03] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
[2023-03-10 08:09:03] [INFO ] Invariant cache hit.
[2023-03-10 08:09:03] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 153 ms. Remains : 20/20 places, 26/26 transitions.
Stuttering acceptance computed with spot in 340 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DrinkVendingMachine-PT-02-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={} source=5 dest: 1}, { cond=p0, acceptance={} source=5 dest: 2}]], initial=4, aps=[p1:(GT s16 s4), p0:(LEQ s18 s1)], 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 53 steps with 0 reset in 1 ms.
FORMULA DrinkVendingMachine-PT-02-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DrinkVendingMachine-PT-02-LTLCardinality-08 finished in 510 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&F(p1)))'
Support contains 2 out of 20 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 20/20 places, 26/26 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 24 place count 4 transition count 18
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 37 place count 4 transition count 5
Applied a total of 37 rules in 4 ms. Remains 4 /20 variables (removed 16) and now considering 5/26 (removed 21) transitions.
// Phase 1: matrix 5 rows 4 cols
[2023-03-10 08:09:04] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-10 08:09:04] [INFO ] Implicit Places using invariants in 52 ms returned []
[2023-03-10 08:09:04] [INFO ] Invariant cache hit.
[2023-03-10 08:09:04] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
[2023-03-10 08:09:04] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-10 08:09:04] [INFO ] Invariant cache hit.
[2023-03-10 08:09:04] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/20 places, 5/26 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 147 ms. Remains : 4/20 places, 5/26 transitions.
Stuttering acceptance computed with spot in 168 ms :[(NOT p1), (NOT p0), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : DrinkVendingMachine-PT-02-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=2, aps=[p1:(GT 1 s2), p0:(OR (LEQ 1 s2) (LEQ 2 s3))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DrinkVendingMachine-PT-02-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DrinkVendingMachine-PT-02-LTLCardinality-09 finished in 366 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 20 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 20/20 places, 26/26 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 24 place count 4 transition count 18
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 36 place count 4 transition count 6
Applied a total of 36 rules in 5 ms. Remains 4 /20 variables (removed 16) and now considering 6/26 (removed 20) transitions.
// Phase 1: matrix 6 rows 4 cols
[2023-03-10 08:09:04] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-10 08:09:04] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-03-10 08:09:04] [INFO ] Invariant cache hit.
[2023-03-10 08:09:04] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2023-03-10 08:09:04] [INFO ] Redundant transitions in 19 ms returned [5]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 5 rows 4 cols
[2023-03-10 08:09:04] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-10 08:09:04] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/20 places, 5/26 transitions.
Applied a total of 0 rules in 1 ms. Remains 4 /4 variables (removed 0) and now considering 5/5 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 117 ms. Remains : 4/20 places, 5/26 transitions.
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Running random walk in product with property : DrinkVendingMachine-PT-02-LTLCardinality-12 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 s1 s2)], 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 DrinkVendingMachine-PT-02-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DrinkVendingMachine-PT-02-LTLCardinality-12 finished in 189 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)&&(p1 U (p2||G(p1))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&X(X(F(p0)))))))'
Found a Shortening insensitive property : DrinkVendingMachine-PT-02-LTLCardinality-07
Stuttering acceptance computed with spot in 203 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 6 out of 20 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 20/20 places, 26/26 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 12 transition count 22
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 22 place count 12 transition count 12
Applied a total of 22 rules in 9 ms. Remains 12 /20 variables (removed 8) and now considering 12/26 (removed 14) transitions.
// Phase 1: matrix 12 rows 12 cols
[2023-03-10 08:09:05] [INFO ] Computed 6 place invariants in 0 ms
[2023-03-10 08:09:05] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-10 08:09:05] [INFO ] Invariant cache hit.
[2023-03-10 08:09:05] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
[2023-03-10 08:09:05] [INFO ] Invariant cache hit.
[2023-03-10 08:09:05] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 12/20 places, 12/26 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 120 ms. Remains : 12/20 places, 12/26 transitions.
Running random walk in product with property : DrinkVendingMachine-PT-02-LTLCardinality-07 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=p0, acceptance={0} source=3 dest: 1}, { cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(LEQ 1 (ADD s6 s7 s8 s9 s10 s11))], 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 25000 reset in 154 ms.
Product exploration explored 100000 steps with 25000 reset in 197 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X p0), true]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 3 factoid took 242 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 287 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), (X p0), true]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F p0)]
Knowledge based reduction with 3 factoid took 283 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 187 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 177 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
[2023-03-10 08:09:06] [INFO ] Invariant cache hit.
[2023-03-10 08:09:06] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-10 08:09:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 08:09:06] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-03-10 08:09:06] [INFO ] Computed and/alt/rep : 6/6/6 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-10 08:09:06] [INFO ] Added : 0 causal constraints over 0 iterations in 6 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 6 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-03-10 08:09:06] [INFO ] Invariant cache hit.
[2023-03-10 08:09:06] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-10 08:09:06] [INFO ] Invariant cache hit.
[2023-03-10 08:09:06] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2023-03-10 08:09:06] [INFO ] Invariant cache hit.
[2023-03-10 08:09:06] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 82 ms. Remains : 12/12 places, 12/12 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 113 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 206 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), true]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 158 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 209 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 206 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
[2023-03-10 08:09:07] [INFO ] Invariant cache hit.
[2023-03-10 08:09:07] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-10 08:09:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 08:09:07] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-10 08:09:07] [INFO ] Computed and/alt/rep : 6/6/6 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-10 08:09:07] [INFO ] Added : 0 causal constraints over 0 iterations in 6 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 204 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 135 ms.
Product exploration explored 100000 steps with 25000 reset in 150 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 201 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 6 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Applied a total of 0 rules in 3 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-03-10 08:09:08] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-10 08:09:08] [INFO ] Invariant cache hit.
[2023-03-10 08:09:08] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 55 ms. Remains : 12/12 places, 12/12 transitions.
Support contains 6 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-03-10 08:09:08] [INFO ] Invariant cache hit.
[2023-03-10 08:09:08] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-10 08:09:08] [INFO ] Invariant cache hit.
[2023-03-10 08:09:08] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
[2023-03-10 08:09:08] [INFO ] Invariant cache hit.
[2023-03-10 08:09:08] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 117 ms. Remains : 12/12 places, 12/12 transitions.
Treatment of property DrinkVendingMachine-PT-02-LTLCardinality-07 finished in 4228 ms.
[2023-03-10 08:09:08] [INFO ] Flatten gal took : 10 ms
[2023-03-10 08:09:08] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
Added places for constants to the net.
[2023-03-10 08:09:08] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 21 places, 26 transitions and 116 arcs took 2 ms.
Total runtime 22771 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT DrinkVendingMachine-PT-02
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/363
LTLCardinality

FORMULA DrinkVendingMachine-PT-02-LTLCardinality-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DrinkVendingMachine-PT-02-LTLCardinality-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678435750484

--------------------
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
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/363/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/363/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/363/LTLCardinality.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:550
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: LAUNCH task # 5 (type EXCL) for 0 DrinkVendingMachine-PT-02-LTLCardinality-04
lola: time limit : 1200 sec
lola: memory limit: 32 pages
lola: FINISHED task # 5 (type EXCL) for DrinkVendingMachine-PT-02-LTLCardinality-04
lola: result : true
lola: markings : 341
lola: fired transitions : 1380
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 8 (type EXCL) for 7 DrinkVendingMachine-PT-02-LTLCardinality-07
lola: time limit : 1800 sec
lola: memory limit: 32 pages
lola: FINISHED task # 8 (type EXCL) for DrinkVendingMachine-PT-02-LTLCardinality-07
lola: result : true
lola: markings : 173
lola: fired transitions : 496
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 3 (type EXCL) for 0 DrinkVendingMachine-PT-02-LTLCardinality-04
lola: time limit : 3600 sec
lola: memory limit: 32 pages
lola: FINISHED task # 3 (type EXCL) for DrinkVendingMachine-PT-02-LTLCardinality-04
lola: result : true
lola: markings : 17
lola: fired transitions : 16
lola: time used : 0.000000
lola: memory pages used : 1
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DrinkVendingMachine-PT-02-LTLCardinality-04: CONJ true CONJ
DrinkVendingMachine-PT-02-LTLCardinality-07: LTL true LTL model checker


Time elapsed: 0 secs. Pages in use: 1

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="DrinkVendingMachine-PT-02"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="lolaxred"
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 lolaxred"
echo " Input is DrinkVendingMachine-PT-02, 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 r135-smll-167819414900627"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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