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.r327-tall-167889199700508.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 Referendum-PT-0200, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r327-tall-167889199700508
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 7.8M
-rw-r--r-- 1 mcc users 200K Feb 26 17:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 966K Feb 26 17:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 67K Feb 26 17:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 500K Feb 26 17:36 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 96K Feb 25 16:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 331K Feb 25 16:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 44K Feb 25 16:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 230K Feb 25 16:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 529K Feb 26 18:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 2.5M Feb 26 18:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 253K Feb 26 17:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.9M Feb 26 17:58 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 24K Feb 25 16:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 58K Feb 25 16:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 228K Mar 5 18:23 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME Referendum-PT-0200-LTLFireability-00
FORMULA_NAME Referendum-PT-0200-LTLFireability-01
FORMULA_NAME Referendum-PT-0200-LTLFireability-02
FORMULA_NAME Referendum-PT-0200-LTLFireability-03
FORMULA_NAME Referendum-PT-0200-LTLFireability-04
FORMULA_NAME Referendum-PT-0200-LTLFireability-05
FORMULA_NAME Referendum-PT-0200-LTLFireability-06
FORMULA_NAME Referendum-PT-0200-LTLFireability-07
FORMULA_NAME Referendum-PT-0200-LTLFireability-08
FORMULA_NAME Referendum-PT-0200-LTLFireability-09
FORMULA_NAME Referendum-PT-0200-LTLFireability-10
FORMULA_NAME Referendum-PT-0200-LTLFireability-11
FORMULA_NAME Referendum-PT-0200-LTLFireability-12
FORMULA_NAME Referendum-PT-0200-LTLFireability-13
FORMULA_NAME Referendum-PT-0200-LTLFireability-14
FORMULA_NAME Referendum-PT-0200-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679050583644

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=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Referendum-PT-0200
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-17 10:56:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-17 10:56:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-17 10:56:25] [INFO ] Load time of PNML (sax parser for PT used): 67 ms
[2023-03-17 10:56:25] [INFO ] Transformed 601 places.
[2023-03-17 10:56:25] [INFO ] Transformed 401 transitions.
[2023-03-17 10:56:25] [INFO ] Found NUPN structural information;
[2023-03-17 10:56:25] [INFO ] Parsed PT model containing 601 places and 401 transitions and 1001 arcs in 130 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 20 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA Referendum-PT-0200-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0200-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0200-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 201 out of 601 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 601/601 places, 401/401 transitions.
Reduce places removed 400 places and 0 transitions.
Ensure Unique test removed 200 transitions
Reduce isomorphic transitions removed 200 transitions.
Iterating post reduction 0 with 600 rules applied. Total rules applied 600 place count 201 transition count 201
Applied a total of 600 rules in 11 ms. Remains 201 /601 variables (removed 400) and now considering 201/401 (removed 200) transitions.
// Phase 1: matrix 201 rows 201 cols
[2023-03-17 10:56:26] [INFO ] Computed 0 place invariants in 12 ms
[2023-03-17 10:56:26] [INFO ] Implicit Places using invariants in 137 ms returned []
[2023-03-17 10:56:26] [INFO ] Invariant cache hit.
[2023-03-17 10:56:26] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 297 ms to find 0 implicit places.
[2023-03-17 10:56:26] [INFO ] Invariant cache hit.
[2023-03-17 10:56:26] [INFO ] Dead Transitions using invariants and state equation in 125 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 201/601 places, 201/401 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 435 ms. Remains : 201/601 places, 201/401 transitions.
Support contains 201 out of 201 places after structural reductions.
[2023-03-17 10:56:26] [INFO ] Flatten gal took : 56 ms
[2023-03-17 10:56:27] [INFO ] Flatten gal took : 34 ms
[2023-03-17 10:56:27] [INFO ] Input system was already deterministic with 201 transitions.
Finished random walk after 201 steps, including 0 resets, run visited all 16 properties in 163 ms. (steps per millisecond=1 )
FORMULA Referendum-PT-0200-LTLFireability-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA Referendum-PT-0200-LTLFireability-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 201 stabilizing places and 201 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 201 transition count 201
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
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 200 out of 201 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 201/201 places, 201/201 transitions.
Applied a total of 0 rules in 2 ms. Remains 201 /201 variables (removed 0) and now considering 201/201 (removed 0) transitions.
[2023-03-17 10:56:27] [INFO ] Invariant cache hit.
[2023-03-17 10:56:27] [INFO ] Implicit Places using invariants in 38 ms returned []
[2023-03-17 10:56:27] [INFO ] Invariant cache hit.
[2023-03-17 10:56:27] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 137 ms to find 0 implicit places.
[2023-03-17 10:56:27] [INFO ] Invariant cache hit.
[2023-03-17 10:56:27] [INFO ] Dead Transitions using invariants and state equation in 110 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 250 ms. Remains : 201/201 places, 201/201 transitions.
Stuttering acceptance computed with spot in 191 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Referendum-PT-0200-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s1 1) (EQ s131 1) (EQ s66 1) (EQ s196 1) (EQ s9 1) (EQ s139 1) (EQ s74 1) (EQ s17 1) (EQ s147 1) (EQ s82 1) (EQ s25 1) (EQ s155 1) (EQ s90 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 201 steps with 0 reset in 10 ms.
FORMULA Referendum-PT-0200-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0200-LTLFireability-02 finished in 508 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((p0 U X(X(p1)))))'
Support contains 201 out of 201 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 201/201 places, 201/201 transitions.
Applied a total of 0 rules in 3 ms. Remains 201 /201 variables (removed 0) and now considering 201/201 (removed 0) transitions.
[2023-03-17 10:56:28] [INFO ] Invariant cache hit.
[2023-03-17 10:56:28] [INFO ] Implicit Places using invariants in 55 ms returned []
[2023-03-17 10:56:28] [INFO ] Invariant cache hit.
[2023-03-17 10:56:28] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 156 ms to find 0 implicit places.
[2023-03-17 10:56:28] [INFO ] Invariant cache hit.
[2023-03-17 10:56:28] [INFO ] Dead Transitions using invariants and state equation in 94 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 255 ms. Remains : 201/201 places, 201/201 transitions.
Stuttering acceptance computed with spot in 283 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1), (NOT p1)]
Running random walk in product with property : Referendum-PT-0200-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 5}, { cond=p0, acceptance={} source=2 dest: 6}], [{ cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=6 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(OR (EQ s1 1) (EQ s131 1) (EQ s66 1) (EQ s196 1) (EQ s9 1) (EQ s139 1) (EQ s74 1) (EQ s17 1) (EQ s147 1) (EQ s82 1) (EQ s25 1) (EQ s155 1) (EQ s90 1) (...], 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, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 201 steps with 0 reset in 8 ms.
FORMULA Referendum-PT-0200-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0200-LTLFireability-03 finished in 567 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 200 out of 201 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 201/201 places, 201/201 transitions.
Applied a total of 0 rules in 7 ms. Remains 201 /201 variables (removed 0) and now considering 201/201 (removed 0) transitions.
[2023-03-17 10:56:28] [INFO ] Invariant cache hit.
[2023-03-17 10:56:28] [INFO ] Implicit Places using invariants in 42 ms returned []
[2023-03-17 10:56:28] [INFO ] Invariant cache hit.
[2023-03-17 10:56:28] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 142 ms to find 0 implicit places.
[2023-03-17 10:56:28] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-17 10:56:28] [INFO ] Invariant cache hit.
[2023-03-17 10:56:28] [INFO ] Dead Transitions using invariants and state equation in 120 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 285 ms. Remains : 201/201 places, 201/201 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Referendum-PT-0200-LTLFireability-04 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:(OR (EQ s1 1) (EQ s131 1) (EQ s66 1) (EQ s196 1) (EQ s9 1) (EQ s139 1) (EQ s74 1) (EQ s17 1) (EQ s147 1) (EQ s82 1) (EQ s25 1) (EQ s155 1) (EQ s90 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 211 steps with 5 reset in 13 ms.
FORMULA Referendum-PT-0200-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0200-LTLFireability-04 finished in 385 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 200 out of 201 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 201/201 places, 201/201 transitions.
Applied a total of 0 rules in 1 ms. Remains 201 /201 variables (removed 0) and now considering 201/201 (removed 0) transitions.
[2023-03-17 10:56:29] [INFO ] Invariant cache hit.
[2023-03-17 10:56:29] [INFO ] Implicit Places using invariants in 42 ms returned []
[2023-03-17 10:56:29] [INFO ] Invariant cache hit.
[2023-03-17 10:56:29] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 140 ms to find 0 implicit places.
[2023-03-17 10:56:29] [INFO ] Invariant cache hit.
[2023-03-17 10:56:29] [INFO ] Dead Transitions using invariants and state equation in 87 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 228 ms. Remains : 201/201 places, 201/201 transitions.
Stuttering acceptance computed with spot in 92 ms :[true, p0, p0]
Running random walk in product with property : Referendum-PT-0200-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s1 1) (EQ s131 1) (EQ s66 1) (EQ s196 1) (EQ s9 1) (EQ s139 1) (EQ s74 1) (EQ s17 1) (EQ s147 1) (EQ s82 1) (EQ s25 1) (EQ s155 1) (EQ s90 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Referendum-PT-0200-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0200-LTLFireability-05 finished in 357 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(p1)))))'
Support contains 201 out of 201 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 201/201 places, 201/201 transitions.
Applied a total of 0 rules in 1 ms. Remains 201 /201 variables (removed 0) and now considering 201/201 (removed 0) transitions.
[2023-03-17 10:56:29] [INFO ] Invariant cache hit.
[2023-03-17 10:56:29] [INFO ] Implicit Places using invariants in 43 ms returned []
[2023-03-17 10:56:29] [INFO ] Invariant cache hit.
[2023-03-17 10:56:29] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
[2023-03-17 10:56:29] [INFO ] Invariant cache hit.
[2023-03-17 10:56:29] [INFO ] Dead Transitions using invariants and state equation in 102 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 240 ms. Remains : 201/201 places, 201/201 transitions.
Stuttering acceptance computed with spot in 119 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Referendum-PT-0200-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=2, aps=[p1:(OR (EQ s1 1) (EQ s131 1) (EQ s66 1) (EQ s196 1) (EQ s9 1) (EQ s139 1) (EQ s74 1) (EQ s17 1) (EQ s147 1) (EQ s82 1) (EQ s25 1) (EQ s155 1) (EQ s90 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 201 steps with 0 reset in 3 ms.
FORMULA Referendum-PT-0200-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0200-LTLFireability-07 finished in 377 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((p0 U p1)))'
Support contains 2 out of 201 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 201/201 places, 201/201 transitions.
Graph (complete) has 200 edges and 201 vertex of which 2 are kept as prefixes of interest. Removing 199 places using SCC suffix rule.3 ms
Discarding 199 places :
Also discarding 199 output transitions
Drop transitions removed 199 transitions
Applied a total of 1 rules in 6 ms. Remains 2 /201 variables (removed 199) and now considering 2/201 (removed 199) transitions.
// Phase 1: matrix 2 rows 2 cols
[2023-03-17 10:56:29] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-17 10:56:29] [INFO ] Implicit Places using invariants in 15 ms returned []
[2023-03-17 10:56:29] [INFO ] Invariant cache hit.
[2023-03-17 10:56:29] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
[2023-03-17 10:56:29] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-17 10:56:29] [INFO ] Invariant cache hit.
[2023-03-17 10:56:29] [INFO ] Dead Transitions using invariants and state equation in 16 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/201 places, 2/201 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 68 ms. Remains : 2/201 places, 2/201 transitions.
Stuttering acceptance computed with spot in 110 ms :[(NOT p1), true, (NOT p1)]
Running random walk in product with property : Referendum-PT-0200-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(EQ s0 1), p0:(EQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA Referendum-PT-0200-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0200-LTLFireability-08 finished in 198 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(p0) U G(p1)))'
Support contains 2 out of 201 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 201/201 places, 201/201 transitions.
Graph (complete) has 200 edges and 201 vertex of which 2 are kept as prefixes of interest. Removing 199 places using SCC suffix rule.1 ms
Discarding 199 places :
Also discarding 199 output transitions
Drop transitions removed 199 transitions
Applied a total of 1 rules in 3 ms. Remains 2 /201 variables (removed 199) and now considering 2/201 (removed 199) transitions.
[2023-03-17 10:56:29] [INFO ] Invariant cache hit.
[2023-03-17 10:56:30] [INFO ] Implicit Places using invariants in 14 ms returned []
[2023-03-17 10:56:30] [INFO ] Invariant cache hit.
[2023-03-17 10:56:30] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
[2023-03-17 10:56:30] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-17 10:56:30] [INFO ] Invariant cache hit.
[2023-03-17 10:56:30] [INFO ] Dead Transitions using invariants and state equation in 15 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/201 places, 2/201 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 65 ms. Remains : 2/201 places, 2/201 transitions.
Stuttering acceptance computed with spot in 124 ms :[(NOT p1), true, (AND p1 (NOT p0)), (NOT p1)]
Running random walk in product with property : Referendum-PT-0200-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(AND p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND p1 p0), acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s1 1), p0:(EQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Referendum-PT-0200-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0200-LTLFireability-09 finished in 208 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((F(p1)||p0))))'
Support contains 3 out of 201 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 201/201 places, 201/201 transitions.
Graph (complete) has 200 edges and 201 vertex of which 3 are kept as prefixes of interest. Removing 198 places using SCC suffix rule.0 ms
Discarding 198 places :
Also discarding 198 output transitions
Drop transitions removed 198 transitions
Applied a total of 1 rules in 2 ms. Remains 3 /201 variables (removed 198) and now considering 3/201 (removed 198) transitions.
// Phase 1: matrix 3 rows 3 cols
[2023-03-17 10:56:30] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-17 10:56:30] [INFO ] Implicit Places using invariants in 14 ms returned []
[2023-03-17 10:56:30] [INFO ] Invariant cache hit.
[2023-03-17 10:56:30] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
[2023-03-17 10:56:30] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-17 10:56:30] [INFO ] Invariant cache hit.
[2023-03-17 10:56:30] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3/201 places, 3/201 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60 ms. Remains : 3/201 places, 3/201 transitions.
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Referendum-PT-0200-LTLFireability-10 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:(OR (EQ s2 1) (EQ s1 0)), p1:(EQ s0 0)], 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 25000 reset in 139 ms.
Product exploration explored 100000 steps with 25000 reset in 101 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3 transition count 3
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (F (G p0)), (F (G p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 7 factoid took 234 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Referendum-PT-0200-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-PT-0200-LTLFireability-10 finished in 683 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)||(p1&&X((p2&&G(p3)))))))'
Support contains 3 out of 201 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 201/201 places, 201/201 transitions.
Discarding 197 places :
Symmetric choice reduction at 0 with 197 rule applications. Total rules 197 place count 4 transition count 4
Iterating global reduction 0 with 197 rules applied. Total rules applied 394 place count 4 transition count 4
Applied a total of 394 rules in 10 ms. Remains 4 /201 variables (removed 197) and now considering 4/201 (removed 197) transitions.
// Phase 1: matrix 4 rows 4 cols
[2023-03-17 10:56:30] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-17 10:56:30] [INFO ] Implicit Places using invariants in 14 ms returned []
[2023-03-17 10:56:30] [INFO ] Invariant cache hit.
[2023-03-17 10:56:30] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 31 ms to find 0 implicit places.
[2023-03-17 10:56:30] [INFO ] Invariant cache hit.
[2023-03-17 10:56:30] [INFO ] Dead Transitions using invariants and state equation in 16 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 4/201 places, 4/201 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 58 ms. Remains : 4/201 places, 4/201 transitions.
Stuttering acceptance computed with spot in 236 ms :[true, (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (NOT p3), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : Referendum-PT-0200-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}, { cond=p1, acceptance={} source=3 dest: 5}], [{ cond=(NOT p3), acceptance={} source=4 dest: 0}, { cond=p3, acceptance={} source=4 dest: 4}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p0) p2 p3), acceptance={} source=5 dest: 4}]], initial=2, aps=[p0:(EQ s3 1), p1:(EQ s2 0), p3:(EQ s3 0), p2:(EQ s0 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 29 steps with 9 reset in 0 ms.
FORMULA Referendum-PT-0200-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0200-LTLFireability-12 finished in 318 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(p1)&&p0)))'
Support contains 3 out of 201 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 201/201 places, 201/201 transitions.
Graph (complete) has 200 edges and 201 vertex of which 3 are kept as prefixes of interest. Removing 198 places using SCC suffix rule.1 ms
Discarding 198 places :
Also discarding 198 output transitions
Drop transitions removed 198 transitions
Applied a total of 1 rules in 3 ms. Remains 3 /201 variables (removed 198) and now considering 3/201 (removed 198) transitions.
// Phase 1: matrix 3 rows 3 cols
[2023-03-17 10:56:31] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-17 10:56:31] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-17 10:56:31] [INFO ] Invariant cache hit.
[2023-03-17 10:56:31] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
[2023-03-17 10:56:31] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-17 10:56:31] [INFO ] Invariant cache hit.
[2023-03-17 10:56:31] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3/201 places, 3/201 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 69 ms. Remains : 3/201 places, 3/201 transitions.
Stuttering acceptance computed with spot in 86 ms :[(OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : Referendum-PT-0200-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s0 1) (OR (EQ s2 0) (EQ s1 0))), p1:(NEQ s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA Referendum-PT-0200-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0200-LTLFireability-14 finished in 178 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) U !p1)&&X((p0 U p2))))'
Support contains 3 out of 201 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 201/201 places, 201/201 transitions.
Discarding 197 places :
Symmetric choice reduction at 0 with 197 rule applications. Total rules 197 place count 4 transition count 4
Iterating global reduction 0 with 197 rules applied. Total rules applied 394 place count 4 transition count 4
Applied a total of 394 rules in 7 ms. Remains 4 /201 variables (removed 197) and now considering 4/201 (removed 197) transitions.
// Phase 1: matrix 4 rows 4 cols
[2023-03-17 10:56:31] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-17 10:56:31] [INFO ] Implicit Places using invariants in 14 ms returned []
[2023-03-17 10:56:31] [INFO ] Invariant cache hit.
[2023-03-17 10:56:31] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 32 ms to find 0 implicit places.
[2023-03-17 10:56:31] [INFO ] Invariant cache hit.
[2023-03-17 10:56:31] [INFO ] Dead Transitions using invariants and state equation in 14 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 4/201 places, 4/201 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54 ms. Remains : 4/201 places, 4/201 transitions.
Stuttering acceptance computed with spot in 193 ms :[(OR (NOT p2) p1), (NOT p0), p1, (NOT p2), true]
Running random walk in product with property : Referendum-PT-0200-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(EQ s0 1), p0:(EQ s3 1), p2:(EQ s2 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 180 ms.
Product exploration explored 100000 steps with 50000 reset in 86 ms.
Computed a total of 4 stabilizing places and 4 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 4
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 (NOT p0) (NOT p2)), (X p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X (NOT p1)), true, (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p1))), (F (G (NOT p1))), (F (G (NOT p0))), (F (G (NOT p2)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2)))))]
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p1 (NOT p0) (NOT p2))
Knowledge based reduction with 13 factoid took 589 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Referendum-PT-0200-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-PT-0200-LTLFireability-15 finished in 1155 ms.
All properties solved by simple procedures.
Total runtime 7163 ms.
ITS solved all properties within timeout

BK_STOP 1679050594277

--------------------
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 LTLFireability -timeout 360 -rebuildPNML

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="Referendum-PT-0200"
export BK_EXAMINATION="LTLFireability"
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 Referendum-PT-0200, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r327-tall-167889199700508"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Referendum-PT-0200.tgz
mv Referendum-PT-0200 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;