About the Execution of LTSMin+red for HirschbergSinclair-PT-50
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 617.020 | 151101.00 | 180808.00 | 961.80 | FFTTTFT?FFTTFFTF | normal |
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.r201-smll-167840347900500.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 HirschbergSinclair-PT-50, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r201-smll-167840347900500
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 13K Feb 26 02:12 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K Feb 26 02:12 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Feb 26 02:11 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 26 02:11 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.4K Feb 25 16:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 16:15 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 02:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 101K Feb 26 02:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Feb 26 02:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 26 02:12 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 16:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Feb 25 16:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 652K 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 HirschbergSinclair-PT-50-LTLFireability-00
FORMULA_NAME HirschbergSinclair-PT-50-LTLFireability-01
FORMULA_NAME HirschbergSinclair-PT-50-LTLFireability-02
FORMULA_NAME HirschbergSinclair-PT-50-LTLFireability-03
FORMULA_NAME HirschbergSinclair-PT-50-LTLFireability-04
FORMULA_NAME HirschbergSinclair-PT-50-LTLFireability-05
FORMULA_NAME HirschbergSinclair-PT-50-LTLFireability-06
FORMULA_NAME HirschbergSinclair-PT-50-LTLFireability-07
FORMULA_NAME HirschbergSinclair-PT-50-LTLFireability-08
FORMULA_NAME HirschbergSinclair-PT-50-LTLFireability-09
FORMULA_NAME HirschbergSinclair-PT-50-LTLFireability-10
FORMULA_NAME HirschbergSinclair-PT-50-LTLFireability-11
FORMULA_NAME HirschbergSinclair-PT-50-LTLFireability-12
FORMULA_NAME HirschbergSinclair-PT-50-LTLFireability-13
FORMULA_NAME HirschbergSinclair-PT-50-LTLFireability-14
FORMULA_NAME HirschbergSinclair-PT-50-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1678754713063
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=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HirschbergSinclair-PT-50
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-14 00:45:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-14 00:45:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 00:45:15] [INFO ] Load time of PNML (sax parser for PT used): 366 ms
[2023-03-14 00:45:15] [INFO ] Transformed 1208 places.
[2023-03-14 00:45:15] [INFO ] Transformed 1102 transitions.
[2023-03-14 00:45:15] [INFO ] Parsed PT model containing 1208 places and 1102 transitions and 3361 arcs in 529 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA HirschbergSinclair-PT-50-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-50-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-50-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-50-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-50-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 1208 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1208/1208 places, 1102/1102 transitions.
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 0 with 50 rules applied. Total rules applied 50 place count 1158 transition count 1102
Discarding 48 places :
Symmetric choice reduction at 1 with 48 rule applications. Total rules 98 place count 1110 transition count 1054
Iterating global reduction 1 with 48 rules applied. Total rules applied 146 place count 1110 transition count 1054
Discarding 44 places :
Symmetric choice reduction at 1 with 44 rule applications. Total rules 190 place count 1066 transition count 1010
Iterating global reduction 1 with 44 rules applied. Total rules applied 234 place count 1066 transition count 1010
Applied a total of 234 rules in 804 ms. Remains 1066 /1208 variables (removed 142) and now considering 1010/1102 (removed 92) transitions.
// Phase 1: matrix 1010 rows 1066 cols
[2023-03-14 00:45:17] [INFO ] Computed 56 place invariants in 49 ms
[2023-03-14 00:45:18] [INFO ] Implicit Places using invariants in 1044 ms returned []
[2023-03-14 00:45:18] [INFO ] Invariant cache hit.
[2023-03-14 00:45:22] [INFO ] Implicit Places using invariants and state equation in 4239 ms returned []
Implicit Place search using SMT with State Equation took 5328 ms to find 0 implicit places.
[2023-03-14 00:45:22] [INFO ] Invariant cache hit.
[2023-03-14 00:45:23] [INFO ] Dead Transitions using invariants and state equation in 1405 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1066/1208 places, 1010/1102 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7545 ms. Remains : 1066/1208 places, 1010/1102 transitions.
Support contains 33 out of 1066 places after structural reductions.
[2023-03-14 00:45:24] [INFO ] Flatten gal took : 169 ms
[2023-03-14 00:45:24] [INFO ] Flatten gal took : 102 ms
[2023-03-14 00:45:24] [INFO ] Input system was already deterministic with 1010 transitions.
Finished random walk after 1039 steps, including 0 resets, run visited all 22 properties in 178 ms. (steps per millisecond=5 )
FORMULA HirschbergSinclair-PT-50-LTLFireability-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA HirschbergSinclair-PT-50-LTLFireability-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA HirschbergSinclair-PT-50-LTLFireability-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 1066 stabilizing places and 1010 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1066 transition count 1010
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 1066 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1066/1066 places, 1010/1010 transitions.
Reduce places removed 50 places and 50 transitions.
Drop transitions removed 445 transitions
Trivial Post-agglo rules discarded 445 transitions
Performed 445 trivial Post agglomeration. Transition count delta: 445
Iterating post reduction 0 with 445 rules applied. Total rules applied 445 place count 1016 transition count 515
Reduce places removed 445 places and 0 transitions.
Iterating post reduction 1 with 445 rules applied. Total rules applied 890 place count 571 transition count 515
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 895 place count 566 transition count 510
Iterating global reduction 2 with 5 rules applied. Total rules applied 900 place count 566 transition count 510
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 2 with 4 rules applied. Total rules applied 904 place count 566 transition count 506
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 908 place count 562 transition count 506
Applied a total of 908 rules in 124 ms. Remains 562 /1066 variables (removed 504) and now considering 506/1010 (removed 504) transitions.
// Phase 1: matrix 506 rows 562 cols
[2023-03-14 00:45:25] [INFO ] Computed 56 place invariants in 7 ms
[2023-03-14 00:45:26] [INFO ] Implicit Places using invariants in 730 ms returned []
[2023-03-14 00:45:26] [INFO ] Invariant cache hit.
[2023-03-14 00:45:29] [INFO ] Implicit Places using invariants and state equation in 2872 ms returned []
Implicit Place search using SMT with State Equation took 3607 ms to find 0 implicit places.
[2023-03-14 00:45:29] [INFO ] Redundant transitions in 36 ms returned []
[2023-03-14 00:45:29] [INFO ] Invariant cache hit.
[2023-03-14 00:45:29] [INFO ] Dead Transitions using invariants and state equation in 710 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 562/1066 places, 506/1010 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4484 ms. Remains : 562/1066 places, 506/1010 transitions.
Stuttering acceptance computed with spot in 175 ms :[(NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-50-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s128 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 1672 reset in 1209 ms.
Product exploration explored 100000 steps with 1673 reset in 1159 ms.
Computed a total of 562 stabilizing places and 506 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 562 transition count 506
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 : [(NOT p0), (F (G (NOT p0)))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 170 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Finished random walk after 31 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=15 )
Knowledge obtained : [(NOT p0), (F (G (NOT p0)))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 197 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
[2023-03-14 00:45:33] [INFO ] Invariant cache hit.
[2023-03-14 00:45:34] [INFO ] [Real]Absence check using 0 positive and 56 generalized place invariants in 239 ms returned unsat
Proved EG (NOT p0)
Knowledge obtained : [(NOT p0), (F (G (NOT p0)))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 2 factoid took 161 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA HirschbergSinclair-PT-50-LTLFireability-01 FALSE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-50-LTLFireability-01 finished in 8859 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 1 out of 1066 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1066/1066 places, 1010/1010 transitions.
Reduce places removed 50 places and 50 transitions.
Drop transitions removed 445 transitions
Trivial Post-agglo rules discarded 445 transitions
Performed 445 trivial Post agglomeration. Transition count delta: 445
Iterating post reduction 0 with 445 rules applied. Total rules applied 445 place count 1016 transition count 515
Reduce places removed 445 places and 0 transitions.
Iterating post reduction 1 with 445 rules applied. Total rules applied 890 place count 571 transition count 515
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 896 place count 565 transition count 509
Iterating global reduction 2 with 6 rules applied. Total rules applied 902 place count 565 transition count 509
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 2 with 4 rules applied. Total rules applied 906 place count 565 transition count 505
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 910 place count 561 transition count 505
Applied a total of 910 rules in 89 ms. Remains 561 /1066 variables (removed 505) and now considering 505/1010 (removed 505) transitions.
// Phase 1: matrix 505 rows 561 cols
[2023-03-14 00:45:34] [INFO ] Computed 56 place invariants in 5 ms
[2023-03-14 00:45:34] [INFO ] Implicit Places using invariants in 725 ms returned []
[2023-03-14 00:45:34] [INFO ] Invariant cache hit.
[2023-03-14 00:45:37] [INFO ] Implicit Places using invariants and state equation in 2872 ms returned []
Implicit Place search using SMT with State Equation took 3605 ms to find 0 implicit places.
[2023-03-14 00:45:37] [INFO ] Redundant transitions in 11 ms returned []
[2023-03-14 00:45:37] [INFO ] Invariant cache hit.
[2023-03-14 00:45:38] [INFO ] Dead Transitions using invariants and state equation in 655 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 561/1066 places, 505/1010 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4376 ms. Remains : 561/1066 places, 505/1010 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-50-LTLFireability-03 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:(LT s473 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 214 reset in 455 ms.
Product exploration explored 100000 steps with 212 reset in 462 ms.
Computed a total of 561 stabilizing places and 505 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 561 transition count 505
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), (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 100 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HirschbergSinclair-PT-50-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-50-LTLFireability-03 finished in 5740 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 1 out of 1066 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1066/1066 places, 1010/1010 transitions.
Reduce places removed 50 places and 50 transitions.
Drop transitions removed 445 transitions
Trivial Post-agglo rules discarded 445 transitions
Performed 445 trivial Post agglomeration. Transition count delta: 445
Iterating post reduction 0 with 445 rules applied. Total rules applied 445 place count 1016 transition count 515
Reduce places removed 445 places and 0 transitions.
Iterating post reduction 1 with 445 rules applied. Total rules applied 890 place count 571 transition count 515
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 896 place count 565 transition count 509
Iterating global reduction 2 with 6 rules applied. Total rules applied 902 place count 565 transition count 509
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 2 with 4 rules applied. Total rules applied 906 place count 565 transition count 505
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 910 place count 561 transition count 505
Applied a total of 910 rules in 80 ms. Remains 561 /1066 variables (removed 505) and now considering 505/1010 (removed 505) transitions.
// Phase 1: matrix 505 rows 561 cols
[2023-03-14 00:45:40] [INFO ] Computed 56 place invariants in 4 ms
[2023-03-14 00:45:40] [INFO ] Implicit Places using invariants in 917 ms returned []
[2023-03-14 00:45:40] [INFO ] Invariant cache hit.
[2023-03-14 00:45:43] [INFO ] Implicit Places using invariants and state equation in 2646 ms returned []
Implicit Place search using SMT with State Equation took 3565 ms to find 0 implicit places.
[2023-03-14 00:45:43] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-14 00:45:43] [INFO ] Invariant cache hit.
[2023-03-14 00:45:44] [INFO ] Dead Transitions using invariants and state equation in 713 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 561/1066 places, 505/1010 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4375 ms. Remains : 561/1066 places, 505/1010 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-50-LTLFireability-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:(LT s131 1)], 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 180 reset in 356 ms.
Product exploration explored 100000 steps with 180 reset in 402 ms.
Computed a total of 561 stabilizing places and 505 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 561 transition count 505
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 135 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HirschbergSinclair-PT-50-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-50-LTLFireability-04 finished in 5552 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((!(F(p0) U !p1)||p2))&&F(F(X(p3)))))'
Support contains 7 out of 1066 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1066/1066 places, 1010/1010 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 1061 transition count 1005
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 1061 transition count 1005
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 1059 transition count 1003
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 1059 transition count 1003
Applied a total of 14 rules in 145 ms. Remains 1059 /1066 variables (removed 7) and now considering 1003/1010 (removed 7) transitions.
// Phase 1: matrix 1003 rows 1059 cols
[2023-03-14 00:45:45] [INFO ] Computed 56 place invariants in 9 ms
[2023-03-14 00:45:46] [INFO ] Implicit Places using invariants in 1001 ms returned []
[2023-03-14 00:45:46] [INFO ] Invariant cache hit.
[2023-03-14 00:45:46] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-14 00:45:47] [INFO ] Implicit Places using invariants and state equation in 905 ms returned []
Implicit Place search using SMT with State Equation took 1915 ms to find 0 implicit places.
[2023-03-14 00:45:47] [INFO ] Invariant cache hit.
[2023-03-14 00:45:47] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-14 00:45:48] [INFO ] Dead Transitions using invariants and state equation in 948 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1059/1066 places, 1003/1010 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3011 ms. Remains : 1059/1066 places, 1003/1010 transitions.
Stuttering acceptance computed with spot in 343 ms :[(OR (NOT p3) (AND (NOT p1) (NOT p2))), (OR (NOT p3) (AND (NOT p1) (NOT p2))), true, (NOT p1), (NOT p3), (AND (NOT p1) p0), p0]
Running random walk in product with property : HirschbergSinclair-PT-50-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) p0 p1), acceptance={} source=1 dest: 3}, { cond=(OR (AND p2 (NOT p3)) (AND p1 (NOT p3))), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 5}], [{ cond=(NOT p3), acceptance={0} source=4 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 2}, { cond=(AND p0 p1), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 6}], [{ cond=p0, acceptance={} source=6 dest: 2}, { cond=(NOT p0), acceptance={} source=6 dest: 6}]], initial=0, aps=[p2:(AND (GEQ s7 1) (GEQ s901 1)), p1:(AND (GEQ s61 1) (GEQ s742 1)), p0:(GEQ s942 1), p3:(OR (LT s55 1) (LT s210 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA HirschbergSinclair-PT-50-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-50-LTLFireability-05 finished in 3394 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((G(!p0)||(!p0&&F(!p1))))))'
Support contains 4 out of 1066 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1066/1066 places, 1010/1010 transitions.
Reduce places removed 47 places and 47 transitions.
Drop transitions removed 428 transitions
Trivial Post-agglo rules discarded 428 transitions
Performed 428 trivial Post agglomeration. Transition count delta: 428
Iterating post reduction 0 with 428 rules applied. Total rules applied 428 place count 1019 transition count 535
Reduce places removed 428 places and 0 transitions.
Iterating post reduction 1 with 428 rules applied. Total rules applied 856 place count 591 transition count 535
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 861 place count 586 transition count 530
Iterating global reduction 2 with 5 rules applied. Total rules applied 866 place count 586 transition count 530
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 3 rules applied. Total rules applied 869 place count 586 transition count 527
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 872 place count 583 transition count 527
Applied a total of 872 rules in 90 ms. Remains 583 /1066 variables (removed 483) and now considering 527/1010 (removed 483) transitions.
// Phase 1: matrix 527 rows 583 cols
[2023-03-14 00:45:48] [INFO ] Computed 56 place invariants in 4 ms
[2023-03-14 00:45:49] [INFO ] Implicit Places using invariants in 707 ms returned []
[2023-03-14 00:45:49] [INFO ] Invariant cache hit.
[2023-03-14 00:45:50] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-14 00:45:52] [INFO ] Implicit Places using invariants and state equation in 2709 ms returned []
Implicit Place search using SMT with State Equation took 3418 ms to find 0 implicit places.
[2023-03-14 00:45:52] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-14 00:45:52] [INFO ] Invariant cache hit.
[2023-03-14 00:45:53] [INFO ] Dead Transitions using invariants and state equation in 679 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 583/1066 places, 527/1010 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4198 ms. Remains : 583/1066 places, 527/1010 transitions.
Stuttering acceptance computed with spot in 127 ms :[p0, (AND p1 p0), p0]
Running random walk in product with property : HirschbergSinclair-PT-50-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND p1 p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s24 1) (GEQ s403 1)), p0:(AND (GEQ s47 1) (GEQ s142 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 884 reset in 1045 ms.
Product exploration explored 100000 steps with 834 reset in 896 ms.
Computed a total of 583 stabilizing places and 527 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 583 transition count 527
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 p0))), (X (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Property proved to be true thanks to knowledge :(F (G (NOT p0)))
Knowledge based reduction with 8 factoid took 257 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HirschbergSinclair-PT-50-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-50-LTLFireability-06 finished in 6804 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((p0||X(X(F(p1))))) U (X(p3)&&p2)))'
Support contains 5 out of 1066 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1066/1066 places, 1010/1010 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 1060 transition count 1004
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 1060 transition count 1004
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 1058 transition count 1002
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 1058 transition count 1002
Applied a total of 16 rules in 142 ms. Remains 1058 /1066 variables (removed 8) and now considering 1002/1010 (removed 8) transitions.
// Phase 1: matrix 1002 rows 1058 cols
[2023-03-14 00:45:55] [INFO ] Computed 56 place invariants in 8 ms
[2023-03-14 00:45:56] [INFO ] Implicit Places using invariants in 1005 ms returned []
[2023-03-14 00:45:56] [INFO ] Invariant cache hit.
[2023-03-14 00:46:02] [INFO ] Implicit Places using invariants and state equation in 5364 ms returned []
Implicit Place search using SMT with State Equation took 6372 ms to find 0 implicit places.
[2023-03-14 00:46:02] [INFO ] Invariant cache hit.
[2023-03-14 00:46:02] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-14 00:46:03] [INFO ] Dead Transitions using invariants and state equation in 1115 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1058/1066 places, 1002/1010 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7636 ms. Remains : 1058/1066 places, 1002/1010 transitions.
Stuttering acceptance computed with spot in 233 ms :[(OR (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p3) (NOT p1)), (NOT p3), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : HirschbergSinclair-PT-50-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p2 (NOT p0)), acceptance={} source=0 dest: 2}, { cond=p2, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p2) (NOT p0) (NOT p3)), acceptance={} source=3 dest: 1}, { cond=(AND p2 (NOT p0) (NOT p3)), acceptance={} source=3 dest: 2}, { cond=(AND p2 (NOT p3)), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(AND (GEQ s29 1) (GEQ s519 1)), p0:(GEQ s651 1), p3:(GEQ s342 1), p1:(GEQ s277 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 700 reset in 886 ms.
Product exploration explored 100000 steps with 680 reset in 895 ms.
Computed a total of 1058 stabilizing places and 1002 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1058 transition count 1002
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p3) (NOT p1)), (X (NOT (AND p2 (NOT p3)))), (X (AND (NOT p2) (NOT p3))), (X (AND (NOT p0) (NOT p3))), (X (AND (NOT p2) (NOT p0))), (X (AND (NOT p2) (NOT p0) (NOT p3))), (X (NOT (AND p2 (NOT p0) (NOT p3)))), (X (NOT p2)), (X (NOT (AND p2 (NOT p0)))), (X (NOT p0)), (X (X (NOT (AND p2 (NOT p3))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (AND (NOT p0) (NOT p3)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (AND (NOT p2) (NOT p0) (NOT p3)))), (X (X (NOT (AND p2 (NOT p0) (NOT p3))))), (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT p0))), (F (G (NOT p2))), (F (G (NOT p0))), (F (G (NOT p3))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 24 factoid took 1113 ms. Reduced automaton from 5 states, 11 edges and 4 AP (stutter sensitive) to 5 states, 11 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 243 ms :[(OR (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p3) (NOT p1)), (NOT p3), (AND (NOT p0) (NOT p1))]
Finished random walk after 789 steps, including 0 resets, run visited all 10 properties in 62 ms. (steps per millisecond=12 )
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p3) (NOT p1)), (X (NOT (AND p2 (NOT p3)))), (X (AND (NOT p2) (NOT p3))), (X (AND (NOT p0) (NOT p3))), (X (AND (NOT p2) (NOT p0))), (X (AND (NOT p2) (NOT p0) (NOT p3))), (X (NOT (AND p2 (NOT p0) (NOT p3)))), (X (NOT p2)), (X (NOT (AND p2 (NOT p0)))), (X (NOT p0)), (X (X (NOT (AND p2 (NOT p3))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (AND (NOT p0) (NOT p3)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (AND (NOT p2) (NOT p0) (NOT p3)))), (X (X (NOT (AND p2 (NOT p0) (NOT p3))))), (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT p0))), (F (G (NOT p2))), (F (G (NOT p0))), (F (G (NOT p3))), (F (G (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p3)))), (F p0), (F (NOT (AND (NOT p2) (NOT p0) (NOT p3)))), (F (NOT (AND (NOT p2) (NOT p3)))), (F p2), (F (AND p2 (NOT p0))), (F (NOT (AND (NOT p2) (NOT p0)))), (F (AND p2 (NOT p3))), (F (AND p2 (NOT p0) (NOT p3))), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 24 factoid took 1311 ms. Reduced automaton from 5 states, 11 edges and 4 AP (stutter sensitive) to 5 states, 11 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 210 ms :[(OR (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p3) (NOT p1)), (NOT p3), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 212 ms :[(OR (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p3) (NOT p1)), (NOT p3), (AND (NOT p0) (NOT p1))]
[2023-03-14 00:46:08] [INFO ] Invariant cache hit.
[2023-03-14 00:46:10] [INFO ] [Real]Absence check using 0 positive and 56 generalized place invariants in 399 ms returned sat
[2023-03-14 00:46:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 00:46:23] [INFO ] [Real]Absence check using state equation in 13562 ms returned unknown
Could not prove EG (NOT p2)
[2023-03-14 00:46:23] [INFO ] Invariant cache hit.
[2023-03-14 00:46:25] [INFO ] [Real]Absence check using 0 positive and 56 generalized place invariants in 287 ms returned sat
[2023-03-14 00:46:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 00:46:30] [INFO ] [Real]Absence check using state equation in 4922 ms returned sat
[2023-03-14 00:46:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 00:46:31] [INFO ] [Nat]Absence check using 0 positive and 56 generalized place invariants in 361 ms returned sat
[2023-03-14 00:46:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 00:46:36] [INFO ] [Nat]Absence check using state equation in 4333 ms returned sat
[2023-03-14 00:46:36] [INFO ] Computed and/alt/rep : 496/826/496 causal constraints (skipped 456 transitions) in 89 ms.
[2023-03-14 00:46:40] [INFO ] Added : 128 causal constraints over 26 iterations in 3971 ms. Result :sat
Could not prove EG (NOT p3)
Support contains 5 out of 1058 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1058/1058 places, 1002/1002 transitions.
Applied a total of 0 rules in 45 ms. Remains 1058 /1058 variables (removed 0) and now considering 1002/1002 (removed 0) transitions.
[2023-03-14 00:46:40] [INFO ] Invariant cache hit.
[2023-03-14 00:46:41] [INFO ] Implicit Places using invariants in 1029 ms returned []
[2023-03-14 00:46:41] [INFO ] Invariant cache hit.
[2023-03-14 00:46:41] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-14 00:46:42] [INFO ] Implicit Places using invariants and state equation in 843 ms returned []
Implicit Place search using SMT with State Equation took 1886 ms to find 0 implicit places.
[2023-03-14 00:46:42] [INFO ] Invariant cache hit.
[2023-03-14 00:46:43] [INFO ] Dead Transitions using invariants and state equation in 1322 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3257 ms. Remains : 1058/1058 places, 1002/1002 transitions.
Computed a total of 1058 stabilizing places and 1002 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1058 transition count 1002
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p3) (NOT p1)), (X (NOT (AND p2 (NOT p3)))), (X (AND (NOT p2) (NOT p3))), (X (AND (NOT p0) (NOT p3))), (X (AND (NOT p2) (NOT p0))), (X (AND (NOT p2) (NOT p0) (NOT p3))), (X (NOT (AND p2 (NOT p0) (NOT p3)))), (X (NOT p2)), (X (NOT (AND p2 (NOT p0)))), (X (NOT p0)), (X (X (NOT (AND p2 (NOT p3))))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p0) (NOT p3)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (AND (NOT p2) (NOT p0) (NOT p3)))), (X (X (NOT (AND p2 (NOT p0) (NOT p3))))), (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT p0))), (F (G (NOT p2))), (F (G (NOT p0))), (F (G (NOT p3))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 24 factoid took 1036 ms. Reduced automaton from 5 states, 11 edges and 4 AP (stutter sensitive) to 5 states, 11 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 210 ms :[(OR (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p3) (NOT p1)), (NOT p3), (AND (NOT p0) (NOT p1))]
Finished random walk after 769 steps, including 0 resets, run visited all 10 properties in 46 ms. (steps per millisecond=16 )
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p3) (NOT p1)), (X (NOT (AND p2 (NOT p3)))), (X (AND (NOT p2) (NOT p3))), (X (AND (NOT p0) (NOT p3))), (X (AND (NOT p2) (NOT p0))), (X (AND (NOT p2) (NOT p0) (NOT p3))), (X (NOT (AND p2 (NOT p0) (NOT p3)))), (X (NOT p2)), (X (NOT (AND p2 (NOT p0)))), (X (NOT p0)), (X (X (NOT (AND p2 (NOT p3))))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p0) (NOT p3)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (AND (NOT p2) (NOT p0) (NOT p3)))), (X (X (NOT (AND p2 (NOT p0) (NOT p3))))), (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT p0))), (F (G (NOT p2))), (F (G (NOT p0))), (F (G (NOT p3))), (F (G (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p3)))), (F p0), (F (NOT (AND (NOT p2) (NOT p0) (NOT p3)))), (F (NOT (AND (NOT p2) (NOT p3)))), (F p2), (F (AND p2 (NOT p0))), (F (NOT (AND (NOT p2) (NOT p0)))), (F (AND p2 (NOT p3))), (F (AND p2 (NOT p0) (NOT p3))), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 24 factoid took 1344 ms. Reduced automaton from 5 states, 11 edges and 4 AP (stutter sensitive) to 5 states, 11 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 210 ms :[(OR (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p3) (NOT p1)), (NOT p3), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 220 ms :[(OR (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p3) (NOT p1)), (NOT p3), (AND (NOT p0) (NOT p1))]
[2023-03-14 00:46:47] [INFO ] Invariant cache hit.
[2023-03-14 00:46:48] [INFO ] [Real]Absence check using 0 positive and 56 generalized place invariants in 389 ms returned sat
[2023-03-14 00:46:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 00:47:02] [INFO ] [Real]Absence check using state equation in 13564 ms returned unknown
Could not prove EG (NOT p2)
[2023-03-14 00:47:02] [INFO ] Invariant cache hit.
[2023-03-14 00:47:03] [INFO ] [Real]Absence check using 0 positive and 56 generalized place invariants in 307 ms returned sat
[2023-03-14 00:47:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 00:47:08] [INFO ] [Real]Absence check using state equation in 5000 ms returned sat
[2023-03-14 00:47:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 00:47:10] [INFO ] [Nat]Absence check using 0 positive and 56 generalized place invariants in 376 ms returned sat
[2023-03-14 00:47:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 00:47:14] [INFO ] [Nat]Absence check using state equation in 4386 ms returned sat
[2023-03-14 00:47:14] [INFO ] Computed and/alt/rep : 496/826/496 causal constraints (skipped 456 transitions) in 81 ms.
[2023-03-14 00:47:18] [INFO ] Added : 128 causal constraints over 26 iterations in 3787 ms. Result :sat
Could not prove EG (NOT p3)
Stuttering acceptance computed with spot in 205 ms :[(OR (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p3) (NOT p1)), (NOT p3), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 703 reset in 819 ms.
Product exploration explored 100000 steps with 702 reset in 888 ms.
Applying partial POR strategy [false, false, true, false, true]
Stuttering acceptance computed with spot in 206 ms :[(OR (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p3) (NOT p1)), (NOT p3), (AND (NOT p0) (NOT p1))]
Support contains 5 out of 1058 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1058/1058 places, 1002/1002 transitions.
Performed 436 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 436 rules applied. Total rules applied 436 place count 1058 transition count 1002
Deduced a syphon composed of 436 places in 7 ms
Applied a total of 436 rules in 302 ms. Remains 1058 /1058 variables (removed 0) and now considering 1002/1002 (removed 0) transitions.
[2023-03-14 00:47:20] [INFO ] Redundant transitions in 13 ms returned []
// Phase 1: matrix 1002 rows 1058 cols
[2023-03-14 00:47:20] [INFO ] Computed 56 place invariants in 8 ms
[2023-03-14 00:47:22] [INFO ] Dead Transitions using invariants and state equation in 1287 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1058/1058 places, 1002/1002 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1611 ms. Remains : 1058/1058 places, 1002/1002 transitions.
Support contains 5 out of 1058 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1058/1058 places, 1002/1002 transitions.
Applied a total of 0 rules in 49 ms. Remains 1058 /1058 variables (removed 0) and now considering 1002/1002 (removed 0) transitions.
// Phase 1: matrix 1002 rows 1058 cols
[2023-03-14 00:47:22] [INFO ] Computed 56 place invariants in 7 ms
[2023-03-14 00:47:23] [INFO ] Implicit Places using invariants in 974 ms returned []
[2023-03-14 00:47:23] [INFO ] Invariant cache hit.
[2023-03-14 00:47:27] [INFO ] Implicit Places using invariants and state equation in 4647 ms returned []
Implicit Place search using SMT with State Equation took 5623 ms to find 0 implicit places.
[2023-03-14 00:47:27] [INFO ] Invariant cache hit.
[2023-03-14 00:47:29] [INFO ] Dead Transitions using invariants and state equation in 1445 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7118 ms. Remains : 1058/1058 places, 1002/1002 transitions.
Treatment of property HirschbergSinclair-PT-50-LTLFireability-07 finished in 93924 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 1 out of 1066 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1066/1066 places, 1010/1010 transitions.
Reduce places removed 50 places and 50 transitions.
Drop transitions removed 445 transitions
Trivial Post-agglo rules discarded 445 transitions
Performed 445 trivial Post agglomeration. Transition count delta: 445
Iterating post reduction 0 with 445 rules applied. Total rules applied 445 place count 1016 transition count 515
Reduce places removed 445 places and 0 transitions.
Iterating post reduction 1 with 445 rules applied. Total rules applied 890 place count 571 transition count 515
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 896 place count 565 transition count 509
Iterating global reduction 2 with 6 rules applied. Total rules applied 902 place count 565 transition count 509
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 2 with 4 rules applied. Total rules applied 906 place count 565 transition count 505
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 910 place count 561 transition count 505
Applied a total of 910 rules in 66 ms. Remains 561 /1066 variables (removed 505) and now considering 505/1010 (removed 505) transitions.
// Phase 1: matrix 505 rows 561 cols
[2023-03-14 00:47:29] [INFO ] Computed 56 place invariants in 3 ms
[2023-03-14 00:47:30] [INFO ] Implicit Places using invariants in 732 ms returned []
[2023-03-14 00:47:30] [INFO ] Invariant cache hit.
[2023-03-14 00:47:33] [INFO ] Implicit Places using invariants and state equation in 2904 ms returned []
Implicit Place search using SMT with State Equation took 3639 ms to find 0 implicit places.
[2023-03-14 00:47:33] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-14 00:47:33] [INFO ] Invariant cache hit.
[2023-03-14 00:47:33] [INFO ] Dead Transitions using invariants and state equation in 659 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 561/1066 places, 505/1010 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4374 ms. Remains : 561/1066 places, 505/1010 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-50-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s261 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 555 steps with 0 reset in 3 ms.
FORMULA HirschbergSinclair-PT-50-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-50-LTLFireability-08 finished in 4432 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(G(p0))))'
Support contains 2 out of 1066 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1066/1066 places, 1010/1010 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 1060 transition count 1004
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 1060 transition count 1004
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 1058 transition count 1002
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 1058 transition count 1002
Applied a total of 16 rules in 185 ms. Remains 1058 /1066 variables (removed 8) and now considering 1002/1010 (removed 8) transitions.
// Phase 1: matrix 1002 rows 1058 cols
[2023-03-14 00:47:34] [INFO ] Computed 56 place invariants in 9 ms
[2023-03-14 00:47:35] [INFO ] Implicit Places using invariants in 957 ms returned []
[2023-03-14 00:47:35] [INFO ] Invariant cache hit.
[2023-03-14 00:47:39] [INFO ] Implicit Places using invariants and state equation in 4630 ms returned []
Implicit Place search using SMT with State Equation took 5590 ms to find 0 implicit places.
[2023-03-14 00:47:39] [INFO ] Invariant cache hit.
[2023-03-14 00:47:41] [INFO ] Dead Transitions using invariants and state equation in 1233 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1058/1066 places, 1002/1010 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7010 ms. Remains : 1058/1066 places, 1002/1010 transitions.
Stuttering acceptance computed with spot in 160 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-50-LTLFireability-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: 2}]], initial=3, aps=[p0:(OR (LT s49 1) (LT s958 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 931 steps with 0 reset in 10 ms.
FORMULA HirschbergSinclair-PT-50-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-50-LTLFireability-13 finished in 7213 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((p0||X(X(F(p1))))) U (X(p3)&&p2)))'
[2023-03-14 00:47:41] [INFO ] Flatten gal took : 102 ms
[2023-03-14 00:47:41] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2023-03-14 00:47:41] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1066 places, 1010 transitions and 3034 arcs took 17 ms.
Total runtime 146182 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1384/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : HirschbergSinclair-PT-50-LTLFireability-07
BK_STOP 1678754864164
--------------------
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
mcc2023
ltl formula name HirschbergSinclair-PT-50-LTLFireability-07
ltl formula formula --ltl=/tmp/1384/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1066 places, 1010 transitions and 3034 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1384/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1384/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1384/ltl_0_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.480 real 0.080 user 0.090 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1384/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***
Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): invalid chunk size
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="HirschbergSinclair-PT-50"
export BK_EXAMINATION="LTLFireability"
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 HirschbergSinclair-PT-50, 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 r201-smll-167840347900500"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/HirschbergSinclair-PT-50.tgz
mv HirschbergSinclair-PT-50 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 '
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 ;