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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 732K
-rw-r--r-- 1 mcc users 14K Feb 25 15:34 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K Feb 25 15:34 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Feb 25 15:34 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 25 15:34 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 6.1K Feb 25 16:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 16:17 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Feb 25 16:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 25K Feb 25 15:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 150K Feb 25 15:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 18K Feb 25 15:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 86K Feb 25 15:35 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:17 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K Feb 25 16:17 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 171K 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 IBM5964-PT-none-LTLCardinality-00
FORMULA_NAME IBM5964-PT-none-LTLCardinality-01
FORMULA_NAME IBM5964-PT-none-LTLCardinality-02
FORMULA_NAME IBM5964-PT-none-LTLCardinality-03
FORMULA_NAME IBM5964-PT-none-LTLCardinality-04
FORMULA_NAME IBM5964-PT-none-LTLCardinality-05
FORMULA_NAME IBM5964-PT-none-LTLCardinality-06
FORMULA_NAME IBM5964-PT-none-LTLCardinality-07
FORMULA_NAME IBM5964-PT-none-LTLCardinality-08
FORMULA_NAME IBM5964-PT-none-LTLCardinality-09
FORMULA_NAME IBM5964-PT-none-LTLCardinality-10
FORMULA_NAME IBM5964-PT-none-LTLCardinality-11
FORMULA_NAME IBM5964-PT-none-LTLCardinality-12
FORMULA_NAME IBM5964-PT-none-LTLCardinality-13
FORMULA_NAME IBM5964-PT-none-LTLCardinality-14
FORMULA_NAME IBM5964-PT-none-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679447394023

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=IBM5964-PT-none
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-22 01:09:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-22 01:09:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 01:09:55] [INFO ] Load time of PNML (sax parser for PT used): 54 ms
[2023-03-22 01:09:55] [INFO ] Transformed 263 places.
[2023-03-22 01:09:55] [INFO ] Transformed 139 transitions.
[2023-03-22 01:09:55] [INFO ] Parsed PT model containing 263 places and 139 transitions and 541 arcs in 121 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA IBM5964-PT-none-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM5964-PT-none-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 34 out of 263 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 263/263 places, 139/139 transitions.
Ensure Unique test removed 115 places
Reduce places removed 120 places and 0 transitions.
Iterating post reduction 0 with 120 rules applied. Total rules applied 120 place count 143 transition count 139
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 128 place count 135 transition count 131
Iterating global reduction 1 with 8 rules applied. Total rules applied 136 place count 135 transition count 131
Applied a total of 136 rules in 27 ms. Remains 135 /263 variables (removed 128) and now considering 131/139 (removed 8) transitions.
// Phase 1: matrix 131 rows 135 cols
[2023-03-22 01:09:56] [INFO ] Computed 9 place invariants in 14 ms
[2023-03-22 01:09:56] [INFO ] Implicit Places using invariants in 391 ms returned [24]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 419 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 134/263 places, 131/139 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 133 transition count 130
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 133 transition count 130
Applied a total of 2 rules in 11 ms. Remains 133 /134 variables (removed 1) and now considering 130/131 (removed 1) transitions.
// Phase 1: matrix 130 rows 133 cols
[2023-03-22 01:09:56] [INFO ] Computed 8 place invariants in 3 ms
[2023-03-22 01:09:56] [INFO ] Implicit Places using invariants in 52 ms returned []
[2023-03-22 01:09:56] [INFO ] Invariant cache hit.
[2023-03-22 01:09:56] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 133/263 places, 130/139 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 618 ms. Remains : 133/263 places, 130/139 transitions.
Support contains 34 out of 133 places after structural reductions.
[2023-03-22 01:09:56] [INFO ] Flatten gal took : 36 ms
[2023-03-22 01:09:56] [INFO ] Flatten gal took : 11 ms
[2023-03-22 01:09:56] [INFO ] Input system was already deterministic with 130 transitions.
Support contains 30 out of 133 places (down from 34) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 210 resets, run finished after 346 ms. (steps per millisecond=28 ) properties (out of 26) seen :6
Incomplete Best-First random walk after 1000 steps, including 5 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 5 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 6 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 20) seen :0
Running SMT prover for 20 properties.
[2023-03-22 01:09:57] [INFO ] Invariant cache hit.
[2023-03-22 01:09:57] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-22 01:09:57] [INFO ] [Real]Absence check using 1 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-22 01:09:57] [INFO ] After 195ms SMT Verify possible using all constraints in real domain returned unsat :4 sat :0 real:16
[2023-03-22 01:09:57] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-22 01:09:57] [INFO ] [Nat]Absence check using 1 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-22 01:09:57] [INFO ] After 213ms SMT Verify possible using all constraints in natural domain returned unsat :20 sat :0
Fused 20 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 2 ms.
Successfully simplified 20 atomic propositions for a total of 14 simplifications.
FORMULA IBM5964-PT-none-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM5964-PT-none-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM5964-PT-none-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM5964-PT-none-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM5964-PT-none-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM5964-PT-none-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM5964-PT-none-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM5964-PT-none-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM5964-PT-none-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 133 stabilizing places and 130 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 133 transition count 130
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
FORMULA IBM5964-PT-none-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM5964-PT-none-LTLCardinality-13 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' '!(F(G(p0)))'
Support contains 1 out of 133 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 133/133 places, 130/130 transitions.
Graph (complete) has 156 edges and 133 vertex of which 5 are kept as prefixes of interest. Removing 128 places using SCC suffix rule.1 ms
Discarding 128 places :
Also discarding 126 output transitions
Drop transitions removed 126 transitions
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 5 transition count 3
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 4 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 4 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 6 place count 2 transition count 2
Applied a total of 6 rules in 8 ms. Remains 2 /133 variables (removed 131) and now considering 2/130 (removed 128) transitions.
// Phase 1: matrix 2 rows 2 cols
[2023-03-22 01:09:58] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-22 01:09:58] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-03-22 01:09:58] [INFO ] Invariant cache hit.
[2023-03-22 01:09:58] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2023-03-22 01:09:58] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 01:09:58] [INFO ] Invariant cache hit.
[2023-03-22 01:09:58] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/133 places, 2/130 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 81 ms. Remains : 2/133 places, 2/130 transitions.
Stuttering acceptance computed with spot in 155 ms :[(NOT p0)]
Running random walk in product with property : IBM5964-PT-none-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:(GT 1 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 33333 reset in 178 ms.
Product exploration explored 100000 steps with 33333 reset in 99 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2 transition count 2
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 (NOT p0)), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 4 factoid took 115 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA IBM5964-PT-none-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property IBM5964-PT-none-LTLCardinality-03 finished in 716 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 133 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 133/133 places, 130/130 transitions.
Graph (complete) has 156 edges and 133 vertex of which 78 are kept as prefixes of interest. Removing 55 places using SCC suffix rule.1 ms
Discarding 55 places :
Also discarding 49 output transitions
Drop transitions removed 49 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 0 with 44 rules applied. Total rules applied 45 place count 77 transition count 36
Reduce places removed 43 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 44 rules applied. Total rules applied 89 place count 34 transition count 35
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 90 place count 33 transition count 35
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 90 place count 33 transition count 25
Deduced a syphon composed of 10 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 21 rules applied. Total rules applied 111 place count 22 transition count 25
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 111 place count 22 transition count 24
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 113 place count 21 transition count 24
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 114 place count 20 transition count 23
Iterating global reduction 3 with 1 rules applied. Total rules applied 115 place count 20 transition count 23
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 123 place count 16 transition count 19
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 126 place count 16 transition count 16
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 128 place count 15 transition count 15
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 129 place count 15 transition count 14
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 131 place count 14 transition count 14
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 132 place count 13 transition count 13
Ensure Unique test removed 1 places
Iterating post reduction 5 with 1 rules applied. Total rules applied 133 place count 12 transition count 13
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 134 place count 11 transition count 11
Iterating global reduction 6 with 1 rules applied. Total rules applied 135 place count 11 transition count 11
Applied a total of 135 rules in 23 ms. Remains 11 /133 variables (removed 122) and now considering 11/130 (removed 119) transitions.
// Phase 1: matrix 11 rows 11 cols
[2023-03-22 01:09:58] [INFO ] Computed 1 place invariants in 2 ms
[2023-03-22 01:09:58] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-22 01:09:58] [INFO ] Invariant cache hit.
[2023-03-22 01:09:58] [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-22 01:09:58] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 01:09:58] [INFO ] Invariant cache hit.
[2023-03-22 01:09:58] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/133 places, 11/130 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 112 ms. Remains : 11/133 places, 11/130 transitions.
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Running random walk in product with property : IBM5964-PT-none-LTLCardinality-04 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 s5 s8)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 8408 reset in 104 ms.
Product exploration explored 100000 steps with 8414 reset in 107 ms.
Computed a total of 11 stabilizing places and 11 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 11 transition count 11
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, (F (G p0))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 2 factoid took 124 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA IBM5964-PT-none-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property IBM5964-PT-none-LTLCardinality-04 finished in 537 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)))'
Support contains 1 out of 133 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 133/133 places, 130/130 transitions.
Ensure Unique test removed 2 places
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 127 transition count 130
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 9 place count 124 transition count 127
Iterating global reduction 1 with 3 rules applied. Total rules applied 12 place count 124 transition count 127
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 123 transition count 126
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 123 transition count 126
Applied a total of 14 rules in 19 ms. Remains 123 /133 variables (removed 10) and now considering 126/130 (removed 4) transitions.
// Phase 1: matrix 126 rows 123 cols
[2023-03-22 01:09:59] [INFO ] Computed 4 place invariants in 4 ms
[2023-03-22 01:09:59] [INFO ] Implicit Places using invariants in 44 ms returned [98]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 45 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 122/133 places, 126/130 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 121 transition count 125
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 121 transition count 125
Applied a total of 2 rules in 5 ms. Remains 121 /122 variables (removed 1) and now considering 125/126 (removed 1) transitions.
// Phase 1: matrix 125 rows 121 cols
[2023-03-22 01:09:59] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-22 01:09:59] [INFO ] Implicit Places using invariants in 38 ms returned []
[2023-03-22 01:09:59] [INFO ] Invariant cache hit.
[2023-03-22 01:09:59] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 121/133 places, 125/130 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 189 ms. Remains : 121/133 places, 125/130 transitions.
Stuttering acceptance computed with spot in 136 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : IBM5964-PT-none-LTLCardinality-11 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}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=3, aps=[p0:(GT 1 s11)], 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][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 185 ms.
Product exploration explored 100000 steps with 33333 reset in 124 ms.
Computed a total of 121 stabilizing places and 125 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 121 transition count 125
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 (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 3 factoid took 56 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA IBM5964-PT-none-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property IBM5964-PT-none-LTLCardinality-11 finished in 763 ms.
All properties solved by simple procedures.
Total runtime 4473 ms.
ITS solved all properties within timeout

BK_STOP 1679447401335

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is IBM5964-PT-none, 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 r233-tall-167856418400083"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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