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.r167-tall-167838852600163.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 Eratosthenes-PT-100, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r167-tall-167838852600163
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 684K
-rw-r--r-- 1 mcc users 7.7K Feb 25 11:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Feb 25 11:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 11:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 25 11:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Feb 25 11:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 186K Feb 25 11:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 11:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 92K Feb 25 11:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:04 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 126K 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 Eratosthenes-PT-100-LTLCardinality-00
FORMULA_NAME Eratosthenes-PT-100-LTLCardinality-01
FORMULA_NAME Eratosthenes-PT-100-LTLCardinality-02
FORMULA_NAME Eratosthenes-PT-100-LTLCardinality-03
FORMULA_NAME Eratosthenes-PT-100-LTLCardinality-04
FORMULA_NAME Eratosthenes-PT-100-LTLCardinality-05
FORMULA_NAME Eratosthenes-PT-100-LTLCardinality-06
FORMULA_NAME Eratosthenes-PT-100-LTLCardinality-07
FORMULA_NAME Eratosthenes-PT-100-LTLCardinality-08
FORMULA_NAME Eratosthenes-PT-100-LTLCardinality-09
FORMULA_NAME Eratosthenes-PT-100-LTLCardinality-10
FORMULA_NAME Eratosthenes-PT-100-LTLCardinality-11
FORMULA_NAME Eratosthenes-PT-100-LTLCardinality-12
FORMULA_NAME Eratosthenes-PT-100-LTLCardinality-13
FORMULA_NAME Eratosthenes-PT-100-LTLCardinality-14
FORMULA_NAME Eratosthenes-PT-100-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678445883841

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=Eratosthenes-PT-100
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-10 10:58:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-10 10:58:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 10:58:05] [INFO ] Load time of PNML (sax parser for PT used): 51 ms
[2023-03-10 10:58:05] [INFO ] Transformed 99 places.
[2023-03-10 10:58:05] [INFO ] Transformed 283 transitions.
[2023-03-10 10:58:05] [INFO ] Parsed PT model containing 99 places and 283 transitions and 849 arcs in 109 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Reduce places removed 25 places and 0 transitions.
Ensure Unique test removed 72 transitions
Reduce redundant transitions removed 72 transitions.
Initial state reduction rules removed 2 formulas.
FORMULA Eratosthenes-PT-100-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Eratosthenes-PT-100-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Eratosthenes-PT-100-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Eratosthenes-PT-100-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Eratosthenes-PT-100-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Eratosthenes-PT-100-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 22 out of 74 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 74/74 places, 211/211 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 61 transition count 198
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 61 transition count 198
Drop transitions removed 137 transitions
Redundant transition composition rules discarded 137 transitions
Iterating global reduction 0 with 137 rules applied. Total rules applied 163 place count 61 transition count 61
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 201 place count 23 transition count 23
Iterating global reduction 0 with 38 rules applied. Total rules applied 239 place count 23 transition count 23
Applied a total of 239 rules in 21 ms. Remains 23 /74 variables (removed 51) and now considering 23/211 (removed 188) transitions.
// Phase 1: matrix 23 rows 23 cols
[2023-03-10 10:58:05] [INFO ] Computed 0 place invariants in 4 ms
[2023-03-10 10:58:05] [INFO ] Implicit Places using invariants in 82 ms returned []
[2023-03-10 10:58:05] [INFO ] Invariant cache hit.
[2023-03-10 10:58:05] [INFO ] Implicit Places using invariants and state equation in 215 ms returned []
Implicit Place search using SMT with State Equation took 320 ms to find 0 implicit places.
[2023-03-10 10:58:05] [INFO ] Invariant cache hit.
[2023-03-10 10:58:05] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 23/74 places, 23/211 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 389 ms. Remains : 23/74 places, 23/211 transitions.
Support contains 22 out of 23 places after structural reductions.
[2023-03-10 10:58:05] [INFO ] Flatten gal took : 12 ms
[2023-03-10 10:58:05] [INFO ] Flatten gal took : 3 ms
[2023-03-10 10:58:05] [INFO ] Input system was already deterministic with 23 transitions.
Incomplete random walk after 10014 steps, including 131 resets, run finished after 188 ms. (steps per millisecond=53 ) properties (out of 21) seen :10
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 21 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
[2023-03-10 10:58:06] [INFO ] Invariant cache hit.
[2023-03-10 10:58:06] [INFO ] After 71ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-10 10:58:06] [INFO ] After 64ms SMT Verify possible using all constraints in natural domain returned unsat :11 sat :0
Fused 11 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
FORMULA Eratosthenes-PT-100-LTLCardinality-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 11 atomic propositions for a total of 9 simplifications.
FORMULA Eratosthenes-PT-100-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Eratosthenes-PT-100-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 23 stabilizing places and 23 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 23 transition count 23
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
FORMULA Eratosthenes-PT-100-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Eratosthenes-PT-100-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 23/23 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 2 transition count 2
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 2 transition count 2
Applied a total of 42 rules in 1 ms. Remains 2 /23 variables (removed 21) and now considering 2/23 (removed 21) transitions.
// Phase 1: matrix 2 rows 2 cols
[2023-03-10 10:58:06] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-10 10:58:06] [INFO ] Implicit Places using invariants in 14 ms returned []
[2023-03-10 10:58:06] [INFO ] Invariant cache hit.
[2023-03-10 10:58:06] [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-10 10:58:06] [INFO ] Invariant cache hit.
[2023-03-10 10:58:06] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2/23 places, 2/23 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 58 ms. Remains : 2/23 places, 2/23 transitions.
Stuttering acceptance computed with spot in 177 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Eratosthenes-PT-100-LTLCardinality-00 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:(LEQ 1 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 4 ms.
FORMULA Eratosthenes-PT-100-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-100-LTLCardinality-00 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(p0))'
Support contains 1 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 23/23 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 2 transition count 2
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 2 transition count 2
Applied a total of 42 rules in 2 ms. Remains 2 /23 variables (removed 21) and now considering 2/23 (removed 21) transitions.
[2023-03-10 10:58:07] [INFO ] Invariant cache hit.
[2023-03-10 10:58:07] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-03-10 10:58:07] [INFO ] Invariant cache hit.
[2023-03-10 10:58:07] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
[2023-03-10 10:58:07] [INFO ] Invariant cache hit.
[2023-03-10 10:58:07] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2/23 places, 2/23 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63 ms. Remains : 2/23 places, 2/23 transitions.
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : Eratosthenes-PT-100-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ 1 s1)], 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 1 reset in 1 ms.
FORMULA Eratosthenes-PT-100-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-100-LTLCardinality-02 finished in 172 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 4 out of 23 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 23/23 places, 23/23 transitions.
Graph (complete) has 0 edges and 23 vertex of which 4 are kept as prefixes of interest. Removing 19 places using SCC suffix rule.0 ms
Discarding 19 places :
Also discarding 19 output transitions
Drop transitions removed 19 transitions
Applied a total of 1 rules in 4 ms. Remains 4 /23 variables (removed 19) and now considering 4/23 (removed 19) transitions.
// Phase 1: matrix 4 rows 4 cols
[2023-03-10 10:58:07] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-10 10:58:07] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-03-10 10:58:07] [INFO ] Invariant cache hit.
[2023-03-10 10:58:07] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
[2023-03-10 10:58:07] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-10 10:58:07] [INFO ] Invariant cache hit.
[2023-03-10 10:58:07] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/23 places, 4/23 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 67 ms. Remains : 4/23 places, 4/23 transitions.
Stuttering acceptance computed with spot in 203 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Eratosthenes-PT-100-LTLCardinality-06 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 (LEQ s1 s0) (LEQ s2 s3))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 20334 reset in 161 ms.
Product exploration explored 100000 steps with 20341 reset in 96 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 : [p0, (X p0), (F (G p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 3 factoid took 121 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Eratosthenes-PT-100-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Eratosthenes-PT-100-LTLCardinality-06 finished in 692 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 2 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 23/23 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 3 transition count 3
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 3 transition count 3
Applied a total of 40 rules in 1 ms. Remains 3 /23 variables (removed 20) and now considering 3/23 (removed 20) transitions.
// Phase 1: matrix 3 rows 3 cols
[2023-03-10 10:58:07] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-10 10:58:07] [INFO ] Implicit Places using invariants in 15 ms returned []
[2023-03-10 10:58:07] [INFO ] Invariant cache hit.
[2023-03-10 10:58:08] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
[2023-03-10 10:58:08] [INFO ] Invariant cache hit.
[2023-03-10 10:58:08] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3/23 places, 3/23 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60 ms. Remains : 3/23 places, 3/23 transitions.
Stuttering acceptance computed with spot in 148 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Eratosthenes-PT-100-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(LEQ s1 s2)], 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][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 304 steps with 4 reset in 1 ms.
FORMULA Eratosthenes-PT-100-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-100-LTLCardinality-13 finished in 223 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' '!(((p0&&X(F(p1))) U G(p2)))'
Support contains 3 out of 23 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 23/23 places, 23/23 transitions.
Graph (complete) has 0 edges and 23 vertex of which 3 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.0 ms
Discarding 20 places :
Also discarding 20 output transitions
Drop transitions removed 20 transitions
Applied a total of 1 rules in 0 ms. Remains 3 /23 variables (removed 20) and now considering 3/23 (removed 20) transitions.
// Phase 1: matrix 3 rows 3 cols
[2023-03-10 10:58:08] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-10 10:58:08] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-03-10 10:58:08] [INFO ] Invariant cache hit.
[2023-03-10 10:58:08] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
[2023-03-10 10:58:08] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-10 10:58:08] [INFO ] Invariant cache hit.
[2023-03-10 10:58:08] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3/23 places, 3/23 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 66 ms. Remains : 3/23 places, 3/23 transitions.
Stuttering acceptance computed with spot in 157 ms :[(NOT p2), true, (NOT p1), (NOT p2)]
Running random walk in product with property : Eratosthenes-PT-100-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(AND p2 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={} source=0 dest: 2}, { cond=(AND p2 (NOT p0)), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 1}, { cond=p2, acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(LEQ 1 s2), p0:(LEQ 1 s1), p1:(LEQ s0 s2)], 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 18 steps with 4 reset in 0 ms.
FORMULA Eratosthenes-PT-100-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-100-LTLCardinality-15 finished in 239 ms.
All properties solved by simple procedures.
Total runtime 3237 ms.
ITS solved all properties within timeout

BK_STOP 1678445889801

--------------------
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

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="Eratosthenes-PT-100"
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 Eratosthenes-PT-100, 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 r167-tall-167838852600163"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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