Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r226-smll-174903491500508.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool itstools
Input is Sudoku-PT-AN04, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r226-smll-174903491500508
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.2M
-rw-r--r-- 1 mcc users 35K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 191K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 53K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 273K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 29 14:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 25K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 96K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 31K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 118K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 52K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 300K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 151K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 748K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.2K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:33 equiv_col
-rw-r--r-- 1 mcc users 5 May 29 14:33 instance
-rw-r--r-- 1 mcc users 6 May 29 14:33 iscolored
-rw-r--r-- 1 mcc users 44K May 29 14:33 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1749349213981

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Sudoku-PT-AN04
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-08 02:20:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-08 02:20:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-08 02:20:17] [INFO ] Load time of PNML (sax parser for PT used): 287 ms
[2025-06-08 02:20:17] [INFO ] Transformed 112 places.
[2025-06-08 02:20:17] [INFO ] Transformed 64 transitions.
[2025-06-08 02:20:17] [INFO ] Found NUPN structural information;
[2025-06-08 02:20:17] [INFO ] Parsed PT model containing 112 places and 64 transitions and 256 arcs in 514 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 53 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA Sudoku-PT-AN04-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN04-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 48 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 64/64 transitions.
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 48 transition count 64
Applied a total of 64 rules in 29 ms. Remains 48 /112 variables (removed 64) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 48 cols
[2025-06-08 02:20:17] [INFO ] Computed 11 invariants in 15 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 02:20:18] [INFO ] Implicit Places using invariants in 267 ms returned []
[2025-06-08 02:20:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 02:20:18] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 468 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 2ms
Starting structural reductions in LTL mode, iteration 1 : 48/112 places, 64/64 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 530 ms. Remains : 48/112 places, 64/64 transitions.
Support contains 48 out of 48 places after structural reductions.
[2025-06-08 02:20:18] [INFO ] Flatten gal took : 66 ms
[2025-06-08 02:20:19] [INFO ] Flatten gal took : 52 ms
[2025-06-08 02:20:19] [INFO ] Input system was already deterministic with 64 transitions.
Reduction of identical properties reduced properties to check from 21 to 18
RANDOM walk for 51 steps (0 resets) in 17 ms. (2 steps per ms) remains 0/18 properties
FORMULA Sudoku-PT-AN04-LTLFireability-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 48 stabilizing places and 64 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 48 transition count 64
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.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||!(p1 U (X(p1)&&!p1)))))'
Support contains 48 out of 48 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 64/64 transitions.
Applied a total of 0 rules in 1 ms. Remains 48 /48 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2025-06-08 02:20:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 02:20:19] [INFO ] Implicit Places using invariants in 92 ms returned []
[2025-06-08 02:20:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 02:20:20] [INFO ] Implicit Places using invariants and state equation in 167 ms returned []
Implicit Place search using SMT with State Equation took 264 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in LTL mode , in 1 iterations and 266 ms. Remains : 48/48 places, 64/64 transitions.
Stuttering acceptance computed with spot in 550 ms :[true, p1, false, false, false, (NOT p0), (AND (NOT p0) p1)]
Running random walk in product with property : Sudoku-PT-AN04-LTLFireability-00
Product exploration explored 100000 steps with 6956 reset in 1200 ms.
Product exploration explored 100000 steps with 6955 reset in 921 ms.
Computed a total of 48 stabilizing places and 64 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 48 transition count 64
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)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X (AND p1 (NOT p0)))), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 232 ms. Reduced automaton from 7 states, 13 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 152 ms :[true, p1, false, false, false]
RANDOM walk for 54 steps (0 resets) in 6 ms. (7 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X (AND p1 (NOT p0)))), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 15 factoid took 254 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 178 ms :[true, p1, false, false, false]
Stuttering acceptance computed with spot in 181 ms :[true, p1, false, false, false]
Support contains 48 out of 48 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 64/64 transitions.
Applied a total of 0 rules in 1 ms. Remains 48 /48 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2025-06-08 02:20:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 02:20:24] [INFO ] Implicit Places using invariants in 50 ms returned []
[2025-06-08 02:20:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 02:20:24] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 143 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in LTL mode , in 1 iterations and 144 ms. Remains : 48/48 places, 64/64 transitions.
Computed a total of 48 stabilizing places and 64 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 48 transition count 64
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)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [p1, (X (X p1)), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 98 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 204 ms :[true, p1, false, false, false]
RANDOM walk for 52 steps (0 resets) in 6 ms. (7 steps per ms) remains 0/1 properties
Knowledge obtained : [p1, (X (X p1)), (F (G (NOT p1)))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 107 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 163 ms :[true, p1, false, false, false]
Stuttering acceptance computed with spot in 173 ms :[true, p1, false, false, false]
Stuttering acceptance computed with spot in 178 ms :[true, p1, false, false, false]
Product exploration explored 100000 steps with 6952 reset in 778 ms.
Product exploration explored 100000 steps with 6941 reset in 638 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 152 ms :[true, p1, false, false, false]
Support contains 48 out of 48 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 48/48 places, 64/64 transitions.
Applied a total of 0 rules in 12 ms. Remains 48 /48 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-08 02:20:27] [INFO ] Redundant transitions in 1 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 24 ms. Remains : 48/48 places, 64/64 transitions.
Built C files in :
/tmp/ltsmin11368420526787824473
[2025-06-08 02:20:27] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11368420526787824473
Running compilation step : cd /tmp/ltsmin11368420526787824473;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 680 ms.
Running link step : cd /tmp/ltsmin11368420526787824473;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 62 ms.
Running LTSmin : cd /tmp/ltsmin11368420526787824473;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased7152735278197711403.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 48 out of 48 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 64/64 transitions.
Applied a total of 0 rules in 1 ms. Remains 48 /48 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2025-06-08 02:20:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 02:20:42] [INFO ] Implicit Places using invariants in 55 ms returned []
[2025-06-08 02:20:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 02:20:42] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 138 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in LTL mode , in 1 iterations and 139 ms. Remains : 48/48 places, 64/64 transitions.
Built C files in :
/tmp/ltsmin13117605226870482209
[2025-06-08 02:20:42] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13117605226870482209
Running compilation step : cd /tmp/ltsmin13117605226870482209;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 255 ms.
Running link step : cd /tmp/ltsmin13117605226870482209;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin13117605226870482209;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1816784135067870467.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-08 02:20:57] [INFO ] Flatten gal took : 9 ms
[2025-06-08 02:20:57] [INFO ] Flatten gal took : 8 ms
[2025-06-08 02:20:57] [INFO ] Time to serialize gal into /tmp/LTL10239404887905421319.gal : 5 ms
[2025-06-08 02:20:57] [INFO ] Time to serialize properties into /tmp/LTL11630911498872015500.prop : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10239404887905421319.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1701944139537447831.hoa' '-atoms' '/tmp/LTL11630911498872015500.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL11630911498872015500.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1701944139537447831.hoa
Detected timeout of ITS tools.
[2025-06-08 02:21:12] [INFO ] Flatten gal took : 10 ms
[2025-06-08 02:21:12] [INFO ] Flatten gal took : 9 ms
[2025-06-08 02:21:12] [INFO ] Time to serialize gal into /tmp/LTL1761566397656353050.gal : 3 ms
[2025-06-08 02:21:12] [INFO ] Time to serialize properties into /tmp/LTL2059151559443607963.ltl : 10 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1761566397656353050.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2059151559443607963.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X((G("(((((((((Rows_0_1==0)||(Cells_0_1==0))||(Columns_1_1==0))&&(((Rows_2_2==0)||(Cells_2_2==0))||(Columns_2_2==0)))&&((((Rows_3_0...14130
Formula 0 simplified : X(("(((((((((Rows_0_1==1)&&(Cells_0_1==1))&&(Columns_1_1==1))||(((Rows_2_2==1)&&(Cells_2_2==1))&&(Columns_2_2==1)))||((((Rows_3_0==1...14115
Detected timeout of ITS tools.
[2025-06-08 02:21:27] [INFO ] Flatten gal took : 10 ms
[2025-06-08 02:21:27] [INFO ] Applying decomposition
[2025-06-08 02:21:27] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph18010684417634718293.txt' '-o' '/tmp/graph18010684417634718293.bin' '-w' '/tmp/graph18010684417634718293.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph18010684417634718293.bin' '-l' '-1' '-v' '-w' '/tmp/graph18010684417634718293.weights' '-q' '0' '-e' '0.001'
[2025-06-08 02:21:27] [INFO ] Decomposing Gal with order
[2025-06-08 02:21:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-08 02:21:28] [INFO ] Removed a total of 144 redundant transitions.
[2025-06-08 02:21:28] [INFO ] Flatten gal took : 147 ms
[2025-06-08 02:21:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2025-06-08 02:21:28] [INFO ] Time to serialize gal into /tmp/LTL12369220494669895602.gal : 5 ms
[2025-06-08 02:21:28] [INFO ] Time to serialize properties into /tmp/LTL6916342539505263271.ltl : 11 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12369220494669895602.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6916342539505263271.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X((G("(((((((((u1.Rows_0_1==0)||(u17.Cells_0_1==0))||(u37.Columns_1_1==0))&&(((u10.Rows_2_2==0)||(u26.Cells_2_2==0))||(u42.Columns_...17042
Formula 0 simplified : X(("(((((((((u1.Rows_0_1==1)&&(u17.Cells_0_1==1))&&(u37.Columns_1_1==1))||(((u10.Rows_2_2==1)&&(u26.Cells_2_2==1))&&(u42.Columns_2_2...17027
Detected timeout of ITS tools.
Treatment of property Sudoku-PT-AN04-LTLFireability-00 finished in 83468 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(!p1)&&p0)))'
Support contains 48 out of 48 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 64/64 transitions.
Applied a total of 0 rules in 1 ms. Remains 48 /48 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2025-06-08 02:21:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 02:21:43] [INFO ] Implicit Places using invariants in 75 ms returned []
[2025-06-08 02:21:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 02:21:43] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 221 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in LTL mode , in 1 iterations and 222 ms. Remains : 48/48 places, 64/64 transitions.
Stuttering acceptance computed with spot in 207 ms :[true, (OR (NOT p0) p1), p1, (OR (NOT p0) p1)]
Running random walk in product with property : Sudoku-PT-AN04-LTLFireability-01
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Sudoku-PT-AN04-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN04-LTLFireability-01 finished in 455 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 48 out of 48 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 64/64 transitions.
Applied a total of 0 rules in 1 ms. Remains 48 /48 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2025-06-08 02:21:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 02:21:43] [INFO ] Implicit Places using invariants in 67 ms returned []
[2025-06-08 02:21:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 02:21:43] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in LTL mode , in 1 iterations and 162 ms. Remains : 48/48 places, 64/64 transitions.
Stuttering acceptance computed with spot in 143 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN04-LTLFireability-02
Product exploration explored 100000 steps with 33333 reset in 758 ms.
Product exploration explored 100000 steps with 33333 reset in 739 ms.
Computed a total of 48 stabilizing places and 64 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 48 transition count 64
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)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [p0, (X (X p0)), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 19 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-PT-AN04-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN04-LTLFireability-02 finished in 1924 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 48 out of 48 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 48/48 places, 64/64 transitions.
Applied a total of 0 rules in 3 ms. Remains 48 /48 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2025-06-08 02:21:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 02:21:45] [INFO ] Implicit Places using invariants in 57 ms returned []
[2025-06-08 02:21:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 02:21:45] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 149 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-08 02:21:45] [INFO ] Redundant transitions in 1 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 162 ms. Remains : 48/48 places, 64/64 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-PT-AN04-LTLFireability-03
Stuttering criterion allowed to conclude after 13 steps with 0 reset in 0 ms.
FORMULA Sudoku-PT-AN04-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN04-LTLFireability-03 finished in 226 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(!p0)))'
Support contains 48 out of 48 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 48/48 places, 64/64 transitions.
Applied a total of 0 rules in 1 ms. Remains 48 /48 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2025-06-08 02:21:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 02:21:45] [INFO ] Implicit Places using invariants in 44 ms returned []
[2025-06-08 02:21:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 02:21:45] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-08 02:21:46] [INFO ] Redundant transitions in 1 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 129 ms. Remains : 48/48 places, 64/64 transitions.
Stuttering acceptance computed with spot in 89 ms :[p0, p0]
Running random walk in product with property : Sudoku-PT-AN04-LTLFireability-04
Product exploration explored 100000 steps with 6955 reset in 805 ms.
Product exploration explored 100000 steps with 6953 reset in 852 ms.
Computed a total of 48 stabilizing places and 64 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 48 transition count 64
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)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 22 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-PT-AN04-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN04-LTLFireability-04 finished in 2024 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 48 out of 48 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 48/48 places, 64/64 transitions.
Applied a total of 0 rules in 2 ms. Remains 48 /48 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2025-06-08 02:21:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 02:21:47] [INFO ] Implicit Places using invariants in 74 ms returned []
[2025-06-08 02:21:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 02:21:48] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 169 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-08 02:21:48] [INFO ] Redundant transitions in 1 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 1ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 182 ms. Remains : 48/48 places, 64/64 transitions.
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-PT-AN04-LTLFireability-05
Product exploration explored 100000 steps with 6963 reset in 794 ms.
Product exploration explored 100000 steps with 6955 reset in 637 ms.
Computed a total of 48 stabilizing places and 64 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 48 transition count 64
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)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 19 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-PT-AN04-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN04-LTLFireability-05 finished in 1787 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U ((F(p2)&&p1) U X(!p2))))'
Support contains 6 out of 48 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 64/64 transitions.
Applied a total of 0 rules in 6 ms. Remains 48 /48 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2025-06-08 02:21:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 02:21:49] [INFO ] Implicit Places using invariants in 137 ms returned []
[2025-06-08 02:21:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 02:21:49] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 269 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in LTL mode , in 1 iterations and 277 ms. Remains : 48/48 places, 64/64 transitions.
Stuttering acceptance computed with spot in 296 ms :[p2, p2, (AND (NOT p0) p2), p2, p2, true, (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN04-LTLFireability-08
Product exploration explored 100000 steps with 16846 reset in 1018 ms.
Product exploration explored 100000 steps with 16892 reset in 705 ms.
Computed a total of 48 stabilizing places and 64 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 48 transition count 64
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)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND p1 p0 p2), (X (NOT (AND (NOT p1) p2 p0))), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (NOT (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) p2)))), (F (G (NOT p1))), (F (G (NOT p0))), (F (G (NOT p2)))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND p2 p0)), (X (NOT (AND p2 p0))), (X (AND p1 p2 (NOT p0))), (X (NOT (AND p1 p2 (NOT p0)))), (X (AND p2 (NOT p0))), (X (NOT (AND p2 (NOT p0)))), (X (AND p1 p2)), (X (NOT (AND p1 p2))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND p2 p0))), (X (X (NOT (AND p2 p0)))), (X (X (NOT p0))), (X (X p0)), (X (X (AND p1 p2 (NOT p0)))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (AND p2 (NOT p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (AND p1 p2))), (X (X (NOT (AND p1 p2)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 10 factoid took 2480 ms. Reduced automaton from 7 states, 16 edges and 3 AP (stutter sensitive) to 7 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 257 ms :[p2, p2, (AND (NOT p0) p2), p2, p2, true, (NOT p0)]
Reduction of identical properties reduced properties to check from 10 to 7
RANDOM walk for 40000 steps (2785 resets) in 1056 ms. (37 steps per ms) remains 3/7 properties
BEST_FIRST walk for 40004 steps (120 resets) in 336 ms. (118 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (120 resets) in 147 ms. (270 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (120 resets) in 114 ms. (347 steps per ms) remains 3/3 properties
[2025-06-08 02:21:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 36/42 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 36/49 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 6/48 variables, 4/53 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/48 variables, 6/59 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 64/112 variables, 48/107 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/112 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/112 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 112/112 variables, and 107 constraints, problems are : Problem set: 0 solved, 3 unsolved in 184 ms.
Refiners :[Domain max(s): 48/48 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 48/48 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem apf1 is UNSAT
Problem apf2 is UNSAT
Problem apf8 is UNSAT
After SMT solving in domain Int declared 6/112 variables, and 6 constraints, problems are : Problem set: 3 solved, 0 unsolved in 33 ms.
Refiners :[Domain max(s): 6/48 constraints, Generalized P Invariants (flows): 0/11 constraints, State Equation: 0/48 constraints, PredecessorRefiner: 0/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 262ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND p1 p0 p2), (X (NOT (AND (NOT p1) p2 p0))), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (NOT (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) p2)))), (F (G (NOT p1))), (F (G (NOT p0))), (F (G (NOT p2))), (G (OR p1 p0 (NOT p2))), (G (OR p1 (NOT p0) (NOT p2))), (G (OR p1 (NOT p2)))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND p2 p0)), (X (NOT (AND p2 p0))), (X (AND p1 p2 (NOT p0))), (X (NOT (AND p1 p2 (NOT p0)))), (X (AND p2 (NOT p0))), (X (NOT (AND p2 (NOT p0)))), (X (AND p1 p2)), (X (NOT (AND p1 p2))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND p2 p0))), (X (X (NOT (AND p2 p0)))), (X (X (NOT p0))), (X (X p0)), (X (X (AND p1 p2 (NOT p0)))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (AND p2 (NOT p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (AND p1 p2))), (X (X (NOT (AND p1 p2)))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR p0 (NOT p2)))), (F (NOT (OR (NOT p1) p0 (NOT p2)))), (F (NOT p0)), (F (NOT (AND p1 p2))), (F (NOT p2)), (F (NOT (AND p0 p2))), (F (NOT p1))]
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 13 factoid took 469 ms. Reduced automaton from 7 states, 13 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-PT-AN04-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN04-LTLFireability-08 finished in 6400 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U (p1||X(p2))) U X(X(p3))))'
Support contains 15 out of 48 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 64/64 transitions.
Applied a total of 0 rules in 2 ms. Remains 48 /48 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2025-06-08 02:21:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 02:21:56] [INFO ] Implicit Places using invariants in 107 ms returned []
[2025-06-08 02:21:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 02:21:56] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 231 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in LTL mode , in 1 iterations and 233 ms. Remains : 48/48 places, 64/64 transitions.
Stuttering acceptance computed with spot in 596 ms :[(NOT p3), (AND (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p1) (NOT p2) (NOT p3)), (NOT p3), true, (AND (NOT p3) (NOT p2)), (NOT p3), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : Sudoku-PT-AN04-LTLFireability-09
Entered a terminal (fully accepting) state of product in 13 steps with 1 reset in 0 ms.
FORMULA Sudoku-PT-AN04-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN04-LTLFireability-09 finished in 856 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U X((!p1&&G(!p2))))&&(G(F(!p0))||(F(!p0)&&F(!p3)))))'
Support contains 12 out of 48 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 64/64 transitions.
Applied a total of 0 rules in 2 ms. Remains 48 /48 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2025-06-08 02:21:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 02:21:57] [INFO ] Implicit Places using invariants in 144 ms returned []
[2025-06-08 02:21:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 02:21:57] [INFO ] Implicit Places using invariants and state equation in 159 ms returned []
Implicit Place search using SMT with State Equation took 317 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in LTL mode , in 1 iterations and 319 ms. Remains : 48/48 places, 64/64 transitions.
Stuttering acceptance computed with spot in 512 ms :[(OR p0 p1 p2), (OR p1 p2), p0, (AND p3 p0), (OR p2 p1), true, p2, (AND p0 p3), p2]
Running random walk in product with property : Sudoku-PT-AN04-LTLFireability-10
Entered a terminal (fully accepting) state of product in 15 steps with 3 reset in 0 ms.
FORMULA Sudoku-PT-AN04-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN04-LTLFireability-10 finished in 870 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 3 out of 48 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 64/64 transitions.
Applied a total of 0 rules in 6 ms. Remains 48 /48 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2025-06-08 02:21:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 02:21:57] [INFO ] Implicit Places using invariants in 147 ms returned []
[2025-06-08 02:21:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 02:21:58] [INFO ] Implicit Places using invariants and state equation in 164 ms returned []
Implicit Place search using SMT with State Equation took 313 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in LTL mode , in 1 iterations and 319 ms. Remains : 48/48 places, 64/64 transitions.
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN04-LTLFireability-11
Stuttering criterion allowed to conclude after 35 steps with 11 reset in 0 ms.
FORMULA Sudoku-PT-AN04-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN04-LTLFireability-11 finished in 444 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X((p0||G(p1)))) U G((G(!p1)||F(!p2)))))'
Support contains 9 out of 48 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 64/64 transitions.
Applied a total of 0 rules in 4 ms. Remains 48 /48 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2025-06-08 02:21:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 02:21:58] [INFO ] Implicit Places using invariants in 323 ms returned []
[2025-06-08 02:21:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 02:21:58] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 478 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in LTL mode , in 1 iterations and 484 ms. Remains : 48/48 places, 64/64 transitions.
Stuttering acceptance computed with spot in 718 ms :[(AND p1 p2), false, false, (AND p1 p2), (AND p2 (NOT p1) (NOT p0)), (AND p1 p2), false, false, (AND p2 (NOT p1) (NOT p0)), (AND p1 p2), (AND p1 p2), false, (AND p2 (NOT p1)), p2]
Running random walk in product with property : Sudoku-PT-AN04-LTLFireability-12
Product exploration explored 100000 steps with 22452 reset in 969 ms.
Product exploration explored 100000 steps with 22531 reset in 736 ms.
Computed a total of 48 stabilizing places and 64 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 48 transition count 64
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)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND p1 p2 p0), (F (G (NOT p1))), (F (G (NOT p2))), (F (G (NOT p0)))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND p1 p2)), (X (NOT (AND p1 p2))), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) p2))), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p1) p2 (NOT p0)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (AND p1 p2 (NOT p0)))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (AND p1 p2))), (X (X (NOT (AND p1 p2)))), (X (X p0)), (X (X (NOT p0))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (X (X (NOT p1)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 14 ms. Reduced automaton from 14 states, 36 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-PT-AN04-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN04-LTLFireability-12 finished in 3049 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0) U G(p1))&&X(p1)&&F(p2)))'
Support contains 8 out of 48 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 64/64 transitions.
Applied a total of 0 rules in 2 ms. Remains 48 /48 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2025-06-08 02:22:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 02:22:01] [INFO ] Implicit Places using invariants in 101 ms returned []
[2025-06-08 02:22:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 02:22:01] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 235 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in LTL mode , in 1 iterations and 238 ms. Remains : 48/48 places, 64/64 transitions.
Stuttering acceptance computed with spot in 228 ms :[(OR (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p1), (NOT p2), true]
Running random walk in product with property : Sudoku-PT-AN04-LTLFireability-13
Stuttering criterion allowed to conclude after 14 steps with 1 reset in 0 ms.
FORMULA Sudoku-PT-AN04-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN04-LTLFireability-13 finished in 490 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(X(p0))&&X(p1)) U (!X(F(p1))&&!X(p2))))'
Support contains 9 out of 48 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 64/64 transitions.
Applied a total of 0 rules in 3 ms. Remains 48 /48 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2025-06-08 02:22:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 02:22:01] [INFO ] Implicit Places using invariants in 165 ms returned []
[2025-06-08 02:22:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 02:22:02] [INFO ] Implicit Places using invariants and state equation in 172 ms returned []
Implicit Place search using SMT with State Equation took 341 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in LTL mode , in 1 iterations and 345 ms. Remains : 48/48 places, 64/64 transitions.
Stuttering acceptance computed with spot in 229 ms :[(OR p2 p1), (OR p1 p2), true, p1, (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN04-LTLFireability-14
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA Sudoku-PT-AN04-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN04-LTLFireability-14 finished in 592 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||!(p1 U (X(p1)&&!p1)))))'
[2025-06-08 02:22:02] [INFO ] Flatten gal took : 18 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin6061152685181491034
[2025-06-08 02:22:02] [INFO ] Computing symmetric may disable matrix : 64 transitions.
[2025-06-08 02:22:02] [INFO ] Applying decomposition
[2025-06-08 02:22:02] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-08 02:22:02] [INFO ] Computing symmetric may enable matrix : 64 transitions.
[2025-06-08 02:22:02] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-08 02:22:02] [INFO ] Flatten gal took : 16 ms
[2025-06-08 02:22:02] [INFO ] Computing Do-Not-Accords matrix : 64 transitions.
[2025-06-08 02:22:02] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-08 02:22:02] [INFO ] Built C files in 41ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6061152685181491034
Running compilation step : cd /tmp/ltsmin6061152685181491034;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph5090417570886186061.txt' '-o' '/tmp/graph5090417570886186061.bin' '-w' '/tmp/graph5090417570886186061.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph5090417570886186061.bin' '-l' '-1' '-v' '-w' '/tmp/graph5090417570886186061.weights' '-q' '0' '-e' '0.001'
[2025-06-08 02:22:02] [INFO ] Decomposing Gal with order
[2025-06-08 02:22:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-08 02:22:02] [INFO ] Removed a total of 144 redundant transitions.
[2025-06-08 02:22:02] [INFO ] Flatten gal took : 38 ms
[2025-06-08 02:22:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2025-06-08 02:22:02] [INFO ] Time to serialize gal into /tmp/LTLFireability9922192801376905817.gal : 3 ms
[2025-06-08 02:22:02] [INFO ] Time to serialize properties into /tmp/LTLFireability6784361422560692715.ltl : 7 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability9922192801376905817.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability6784361422560692715.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X((G("(((((((((u1.Rows_0_1==0)||(u17.Cells_0_1==0))||(u37.Columns_1_1==0))&&(((u10.Rows_2_2==0)||(u26.Cells_2_2==0))||(u42.Columns_...17042
Formula 0 simplified : X(("(((((((((u1.Rows_0_1==1)&&(u17.Cells_0_1==1))&&(u37.Columns_1_1==1))||(((u10.Rows_2_2==1)&&(u26.Cells_2_2==1))&&(u42.Columns_2_2...17027
Compilation finished in 496 ms.
Running link step : cd /tmp/ltsmin6061152685181491034;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 53 ms.
Running LTSmin : cd /tmp/ltsmin6061152685181491034;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(([]((LTLAPp0==true))||!((LTLAPp1==true) U (X((LTLAPp1==true))&&!(LTLAPp1==true)))))' '--buchi-type=spotba'
LTSmin run took 604579 ms.
FORMULA Sudoku-PT-AN04-LTLFireability-00 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 711445 ms.

BK_STOP 1749349928454

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="Sudoku-PT-AN04"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
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-5832"
echo " Executing tool itstools"
echo " Input is Sudoku-PT-AN04, 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 r226-smll-174903491500508"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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