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.r231-tall-167856415500084.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 IBM5964-PT-none, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r231-tall-167856415500084
=====================================================================

--------------------
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-LTLFireability-00
FORMULA_NAME IBM5964-PT-none-LTLFireability-01
FORMULA_NAME IBM5964-PT-none-LTLFireability-02
FORMULA_NAME IBM5964-PT-none-LTLFireability-03
FORMULA_NAME IBM5964-PT-none-LTLFireability-04
FORMULA_NAME IBM5964-PT-none-LTLFireability-05
FORMULA_NAME IBM5964-PT-none-LTLFireability-06
FORMULA_NAME IBM5964-PT-none-LTLFireability-07
FORMULA_NAME IBM5964-PT-none-LTLFireability-08
FORMULA_NAME IBM5964-PT-none-LTLFireability-09
FORMULA_NAME IBM5964-PT-none-LTLFireability-10
FORMULA_NAME IBM5964-PT-none-LTLFireability-11
FORMULA_NAME IBM5964-PT-none-LTLFireability-12
FORMULA_NAME IBM5964-PT-none-LTLFireability-13
FORMULA_NAME IBM5964-PT-none-LTLFireability-14
FORMULA_NAME IBM5964-PT-none-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679434355932

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=IBM5964-PT-none
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-21 21:32:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-21 21:32:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 21:32:37] [INFO ] Load time of PNML (sax parser for PT used): 52 ms
[2023-03-21 21:32:37] [INFO ] Transformed 263 places.
[2023-03-21 21:32:37] [INFO ] Transformed 139 transitions.
[2023-03-21 21:32:37] [INFO ] Parsed PT model containing 263 places and 139 transitions and 541 arcs in 108 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA IBM5964-PT-none-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM5964-PT-none-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM5964-PT-none-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 57 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 88 places
Reduce places removed 97 places and 0 transitions.
Iterating post reduction 0 with 97 rules applied. Total rules applied 97 place count 166 transition count 139
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 103 place count 160 transition count 133
Iterating global reduction 1 with 6 rules applied. Total rules applied 109 place count 160 transition count 133
Applied a total of 109 rules in 24 ms. Remains 160 /263 variables (removed 103) and now considering 133/139 (removed 6) transitions.
// Phase 1: matrix 133 rows 160 cols
[2023-03-21 21:32:37] [INFO ] Computed 34 place invariants in 20 ms
[2023-03-21 21:32:38] [INFO ] Implicit Places using invariants in 353 ms returned [127]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 377 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 159/263 places, 133/139 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 158 transition count 132
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 158 transition count 132
Applied a total of 2 rules in 11 ms. Remains 158 /159 variables (removed 1) and now considering 132/133 (removed 1) transitions.
// Phase 1: matrix 132 rows 158 cols
[2023-03-21 21:32:38] [INFO ] Computed 33 place invariants in 3 ms
[2023-03-21 21:32:38] [INFO ] Implicit Places using invariants in 57 ms returned []
[2023-03-21 21:32:38] [INFO ] Invariant cache hit.
[2023-03-21 21:32:38] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 153 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 158/263 places, 132/139 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 565 ms. Remains : 158/263 places, 132/139 transitions.
Support contains 57 out of 158 places after structural reductions.
[2023-03-21 21:32:38] [INFO ] Flatten gal took : 32 ms
[2023-03-21 21:32:38] [INFO ] Flatten gal took : 12 ms
[2023-03-21 21:32:38] [INFO ] Input system was already deterministic with 132 transitions.
Incomplete random walk after 10000 steps, including 208 resets, run finished after 396 ms. (steps per millisecond=25 ) properties (out of 28) seen :7
Incomplete Best-First random walk after 1000 steps, including 6 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 21) 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 21) 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 21) 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 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 5 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 6 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 21) 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 21) 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 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 6 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 5 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 21) 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 21) 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 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 5 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 21) 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 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 6 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 5 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 21) 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 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Running SMT prover for 21 properties.
[2023-03-21 21:32:39] [INFO ] Invariant cache hit.
[2023-03-21 21:32:39] [INFO ] [Real]Absence check using 0 positive and 33 generalized place invariants in 5 ms returned sat
[2023-03-21 21:32:39] [INFO ] After 228ms SMT Verify possible using all constraints in real domain returned unsat :7 sat :0 real:14
[2023-03-21 21:32:39] [INFO ] [Nat]Absence check using 0 positive and 33 generalized place invariants in 5 ms returned sat
[2023-03-21 21:32:39] [INFO ] After 429ms SMT Verify possible using all constraints in natural domain returned unsat :21 sat :0
Fused 21 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 21 atomic propositions for a total of 13 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA IBM5964-PT-none-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM5964-PT-none-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM5964-PT-none-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM5964-PT-none-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM5964-PT-none-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM5964-PT-none-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM5964-PT-none-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM5964-PT-none-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM5964-PT-none-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 158 stabilizing places and 132 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 158 transition count 132
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-LTLFireability-02 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(X(F(!p0))))'
Support contains 1 out of 158 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 158/158 places, 132/132 transitions.
Ensure Unique test removed 29 places
Iterating post reduction 0 with 29 rules applied. Total rules applied 29 place count 129 transition count 132
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 33 place count 125 transition count 128
Iterating global reduction 1 with 4 rules applied. Total rules applied 37 place count 125 transition count 128
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 124 transition count 127
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 124 transition count 127
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 40 place count 123 transition count 126
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 123 transition count 126
Applied a total of 41 rules in 23 ms. Remains 123 /158 variables (removed 35) and now considering 126/132 (removed 6) transitions.
// Phase 1: matrix 126 rows 123 cols
[2023-03-21 21:32:39] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-21 21:32:39] [INFO ] Implicit Places using invariants in 37 ms returned [24]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 38 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 122/158 places, 126/132 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-21 21:32:39] [INFO ] Computed 3 place invariants in 2 ms
[2023-03-21 21:32:39] [INFO ] Implicit Places using invariants in 42 ms returned []
[2023-03-21 21:32:39] [INFO ] Invariant cache hit.
[2023-03-21 21:32:40] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 123 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 121/158 places, 125/132 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 189 ms. Remains : 121/158 places, 125/132 transitions.
Stuttering acceptance computed with spot in 218 ms :[p0, p0, p0]
Running random walk in product with property : IBM5964-PT-none-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(LT s36 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 5282 reset in 207 ms.
Product exploration explored 100000 steps with 5298 reset in 149 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 : []
Knowledge based reduction with 3 factoid took 131 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 127 ms :[p0, p0, p0]
Finished random walk after 18 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=18 )
Knowledge obtained : [p0, (X (X p0)), (F (G p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 161 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 118 ms :[p0, p0, p0]
Stuttering acceptance computed with spot in 95 ms :[p0, p0, p0]
[2023-03-21 21:32:41] [INFO ] Invariant cache hit.
[2023-03-21 21:32:41] [INFO ] [Real]Absence check using 0 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-21 21:32:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 21:32:41] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2023-03-21 21:32:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 21:32:41] [INFO ] [Nat]Absence check using 0 positive and 3 generalized place invariants in 0 ms returned sat
[2023-03-21 21:32:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 21:32:41] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2023-03-21 21:32:41] [INFO ] Computed and/alt/rep : 124/144/124 causal constraints (skipped 0 transitions) in 8 ms.
[2023-03-21 21:32:41] [INFO ] Added : 18 causal constraints over 4 iterations in 76 ms. Result :sat
Could not prove EG p0
Support contains 1 out of 121 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 125/125 transitions.
Applied a total of 0 rules in 3 ms. Remains 121 /121 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2023-03-21 21:32:41] [INFO ] Invariant cache hit.
[2023-03-21 21:32:41] [INFO ] Implicit Places using invariants in 44 ms returned []
[2023-03-21 21:32:41] [INFO ] Invariant cache hit.
[2023-03-21 21:32:41] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 136 ms to find 0 implicit places.
[2023-03-21 21:32:41] [INFO ] Invariant cache hit.
[2023-03-21 21:32:41] [INFO ] Dead Transitions using invariants and state equation in 109 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 264 ms. Remains : 121/121 places, 125/125 transitions.
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 : []
Knowledge based reduction with 3 factoid took 138 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 99 ms :[p0, p0, p0]
Finished random walk after 16 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=8 )
Knowledge obtained : [p0, (X (X p0)), (F (G p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 136 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 100 ms :[p0, p0, p0]
Stuttering acceptance computed with spot in 96 ms :[p0, p0, p0]
[2023-03-21 21:32:42] [INFO ] Invariant cache hit.
[2023-03-21 21:32:42] [INFO ] [Real]Absence check using 0 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-21 21:32:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 21:32:42] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2023-03-21 21:32:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 21:32:42] [INFO ] [Nat]Absence check using 0 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-21 21:32:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 21:32:42] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2023-03-21 21:32:42] [INFO ] Computed and/alt/rep : 124/144/124 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-21 21:32:42] [INFO ] Added : 18 causal constraints over 4 iterations in 47 ms. Result :sat
Could not prove EG p0
Stuttering acceptance computed with spot in 81 ms :[p0, p0, p0]
Product exploration explored 100000 steps with 5281 reset in 113 ms.
Product exploration explored 100000 steps with 5275 reset in 90 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 108 ms :[p0, p0, p0]
Support contains 1 out of 121 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 121/121 places, 125/125 transitions.
Graph (complete) has 137 edges and 121 vertex of which 9 are kept as prefixes of interest. Removing 112 places using SCC suffix rule.2 ms
Discarding 112 places :
Also discarding 115 output transitions
Drop transitions removed 115 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 9 transition count 9
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 5 place count 9 transition count 9
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 7 place count 9 transition count 9
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 10 place count 6 transition count 6
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 13 place count 6 transition count 6
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 6 transition count 6
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 5 transition count 5
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 5 transition count 5
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 16 rules in 13 ms. Remains 5 /121 variables (removed 116) and now considering 5/125 (removed 120) transitions.
[2023-03-21 21:32:43] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 5 cols
[2023-03-21 21:32:43] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-21 21:32:43] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5/121 places, 5/125 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 38 ms. Remains : 5/121 places, 5/125 transitions.
Support contains 1 out of 121 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 125/125 transitions.
Applied a total of 0 rules in 3 ms. Remains 121 /121 variables (removed 0) and now considering 125/125 (removed 0) transitions.
// Phase 1: matrix 125 rows 121 cols
[2023-03-21 21:32:43] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-21 21:32:43] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-21 21:32:43] [INFO ] Invariant cache hit.
[2023-03-21 21:32:43] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
[2023-03-21 21:32:43] [INFO ] Invariant cache hit.
[2023-03-21 21:32:43] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 173 ms. Remains : 121/121 places, 125/125 transitions.
Treatment of property IBM5964-PT-none-LTLFireability-04 finished in 3751 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((X(p0)||G(p1)))))'
Support contains 6 out of 158 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 158/158 places, 132/132 transitions.
Ensure Unique test removed 25 places
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 133 transition count 132
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 29 place count 129 transition count 128
Iterating global reduction 1 with 4 rules applied. Total rules applied 33 place count 129 transition count 128
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 128 transition count 127
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 128 transition count 127
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 127 transition count 126
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 127 transition count 126
Applied a total of 37 rules in 9 ms. Remains 127 /158 variables (removed 31) and now considering 126/132 (removed 6) transitions.
// Phase 1: matrix 126 rows 127 cols
[2023-03-21 21:32:43] [INFO ] Computed 8 place invariants in 11 ms
[2023-03-21 21:32:43] [INFO ] Implicit Places using invariants in 67 ms returned [24]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 70 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 126/158 places, 126/132 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 125 transition count 125
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 125 transition count 125
Applied a total of 2 rules in 5 ms. Remains 125 /126 variables (removed 1) and now considering 125/126 (removed 1) transitions.
// Phase 1: matrix 125 rows 125 cols
[2023-03-21 21:32:43] [INFO ] Computed 7 place invariants in 0 ms
[2023-03-21 21:32:43] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-21 21:32:43] [INFO ] Invariant cache hit.
[2023-03-21 21:32:43] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 187 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 125/158 places, 125/132 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 272 ms. Remains : 125/158 places, 125/132 transitions.
Stuttering acceptance computed with spot in 191 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : IBM5964-PT-none-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 1}, { cond=(AND p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=(NOT p1), acceptance={} source=5 dest: 1}, { cond=p1, acceptance={} source=5 dest: 2}]], initial=4, aps=[p0:(AND (GEQ s60 1) (GEQ s99 1) (GEQ s100 1)), p1:(AND (GEQ s56 1) (GEQ s108 1) (GEQ s109 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, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA IBM5964-PT-none-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBM5964-PT-none-LTLFireability-08 finished in 486 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 3 out of 158 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 158/158 places, 132/132 transitions.
Graph (complete) has 208 edges and 158 vertex of which 26 are kept as prefixes of interest. Removing 132 places using SCC suffix rule.0 ms
Discarding 132 places :
Also discarding 112 output transitions
Drop transitions removed 112 transitions
Ensure Unique test removed 2 places
Reduce places removed 3 places and 1 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 8 place count 23 transition count 12
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 15 place count 16 transition count 12
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 15 place count 16 transition count 8
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 23 place count 12 transition count 8
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 2 with 2 rules applied. Total rules applied 25 place count 11 transition count 7
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 27 place count 9 transition count 5
Ensure Unique test removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 28 place count 8 transition count 5
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 29 place count 7 transition count 4
Applied a total of 29 rules in 5 ms. Remains 7 /158 variables (removed 151) and now considering 4/132 (removed 128) transitions.
// Phase 1: matrix 4 rows 7 cols
[2023-03-21 21:32:44] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-21 21:32:44] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-03-21 21:32:44] [INFO ] Invariant cache hit.
[2023-03-21 21:32:44] [INFO ] Implicit Places using invariants and state equation in 26 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 46 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/158 places, 4/132 transitions.
Applied a total of 0 rules in 1 ms. Remains 6 /6 variables (removed 0) and now considering 4/4 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 52 ms. Remains : 6/158 places, 4/132 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : IBM5964-PT-none-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s4 1) (GEQ s5 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA IBM5964-PT-none-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBM5964-PT-none-LTLFireability-09 finished in 94 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(F(!p0))))'
Found a Shortening insensitive property : IBM5964-PT-none-LTLFireability-04
Stuttering acceptance computed with spot in 98 ms :[p0, p0, p0]
Support contains 1 out of 158 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 158/158 places, 132/132 transitions.
Graph (complete) has 208 edges and 158 vertex of which 11 are kept as prefixes of interest. Removing 147 places using SCC suffix rule.1 ms
Discarding 147 places :
Also discarding 122 output transitions
Drop transitions removed 122 transitions
Ensure Unique test removed 2 places
Reduce places removed 3 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 8 transition count 4
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 10 place count 4 transition count 4
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 10 place count 4 transition count 3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 3 transition count 3
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 13 place count 2 transition count 2
Applied a total of 13 rules in 5 ms. Remains 2 /158 variables (removed 156) and now considering 2/132 (removed 130) transitions.
// Phase 1: matrix 2 rows 2 cols
[2023-03-21 21:32:44] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-21 21:32:44] [INFO ] Implicit Places using invariants in 12 ms returned []
[2023-03-21 21:32:44] [INFO ] Invariant cache hit.
[2023-03-21 21:32:44] [INFO ] Implicit Places using invariants and state equation in 14 ms returned []
Implicit Place search using SMT with State Equation took 28 ms to find 0 implicit places.
[2023-03-21 21:32:44] [INFO ] Invariant cache hit.
[2023-03-21 21:32:44] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 2/158 places, 2/132 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 51 ms. Remains : 2/158 places, 2/132 transitions.
Running random walk in product with property : IBM5964-PT-none-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(LT s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 28589 reset in 48 ms.
Product exploration explored 100000 steps with 28563 reset in 47 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, (F (G p0))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 117 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 156 ms :[p0, p0, p0]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [p0, (F (G p0))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 118 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 90 ms :[p0, p0, p0]
Stuttering acceptance computed with spot in 100 ms :[p0, p0, p0]
[2023-03-21 21:32:45] [INFO ] Invariant cache hit.
[2023-03-21 21:32:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 21:32:45] [INFO ] [Real]Absence check using state equation in 1 ms returned sat
[2023-03-21 21:32:45] [INFO ] Computed and/alt/rep : 1/1/1 causal constraints (skipped 0 transitions) in 0 ms.
[2023-03-21 21:32:45] [INFO ] Added : 0 causal constraints over 0 iterations in 2 ms. Result :sat
Could not prove EG p0
Support contains 1 out of 2 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2/2 places, 2/2 transitions.
Applied a total of 0 rules in 0 ms. Remains 2 /2 variables (removed 0) and now considering 2/2 (removed 0) transitions.
[2023-03-21 21:32:45] [INFO ] Invariant cache hit.
[2023-03-21 21:32:45] [INFO ] Implicit Places using invariants in 14 ms returned []
[2023-03-21 21:32:45] [INFO ] Invariant cache hit.
[2023-03-21 21:32:45] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
[2023-03-21 21:32:45] [INFO ] Invariant cache hit.
[2023-03-21 21:32:45] [INFO ] Dead Transitions using invariants and state equation in 16 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54 ms. Remains : 2/2 places, 2/2 transitions.
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, (F (G p0))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 113 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 100 ms :[p0, p0, p0]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [p0, (F (G p0))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 132 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 93 ms :[p0, p0, p0]
Stuttering acceptance computed with spot in 103 ms :[p0, p0, p0]
[2023-03-21 21:32:45] [INFO ] Invariant cache hit.
[2023-03-21 21:32:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 21:32:45] [INFO ] [Real]Absence check using state equation in 1 ms returned sat
[2023-03-21 21:32:45] [INFO ] Computed and/alt/rep : 1/1/1 causal constraints (skipped 0 transitions) in 0 ms.
[2023-03-21 21:32:45] [INFO ] Added : 0 causal constraints over 0 iterations in 2 ms. Result :sat
Could not prove EG p0
Stuttering acceptance computed with spot in 98 ms :[p0, p0, p0]
Product exploration explored 100000 steps with 28585 reset in 40 ms.
Product exploration explored 100000 steps with 28584 reset in 47 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 104 ms :[p0, p0, p0]
Support contains 1 out of 2 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2/2 places, 2/2 transitions.
Applied a total of 0 rules in 0 ms. Remains 2 /2 variables (removed 0) and now considering 2/2 (removed 0) transitions.
[2023-03-21 21:32:46] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-21 21:32:46] [INFO ] Invariant cache hit.
[2023-03-21 21:32:46] [INFO ] Dead Transitions using invariants and state equation in 14 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 25 ms. Remains : 2/2 places, 2/2 transitions.
Support contains 1 out of 2 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2/2 places, 2/2 transitions.
Applied a total of 0 rules in 0 ms. Remains 2 /2 variables (removed 0) and now considering 2/2 (removed 0) transitions.
[2023-03-21 21:32:46] [INFO ] Invariant cache hit.
[2023-03-21 21:32:46] [INFO ] Implicit Places using invariants in 12 ms returned []
[2023-03-21 21:32:46] [INFO ] Invariant cache hit.
[2023-03-21 21:32:46] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 30 ms to find 0 implicit places.
[2023-03-21 21:32:46] [INFO ] Invariant cache hit.
[2023-03-21 21:32:46] [INFO ] Dead Transitions using invariants and state equation in 13 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45 ms. Remains : 2/2 places, 2/2 transitions.
Treatment of property IBM5964-PT-none-LTLFireability-04 finished in 2086 ms.
[2023-03-21 21:32:46] [INFO ] Flatten gal took : 7 ms
[2023-03-21 21:32:46] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-21 21:32:46] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 158 places, 132 transitions and 339 arcs took 1 ms.
Total runtime 8873 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT IBM5964-PT-none
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/364
LTLFireability

FORMULA IBM5964-PT-none-LTLFireability-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1679434367669

--------------------
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
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/364/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/364/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/364/LTLFireability.xml
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: LAUNCH task # 1 (type EXCL) for 0 IBM5964-PT-none-LTLFireability-04
lola: time limit : 3600 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for IBM5964-PT-none-LTLFireability-04
lola: result : true
lola: markings : 1781
lola: fired transitions : 4871
lola: time used : 0.000000
lola: memory pages used : 1
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
IBM5964-PT-none-LTLFireability-04: LTL true LTL model checker


Time elapsed: 0 secs. Pages in use: 1

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="IBM5964-PT-none"
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 IBM5964-PT-none, 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 r231-tall-167856415500084"
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 [ "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 ;