Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r246-tall-171654351500395.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-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-5568
Executing tool itstools
Input is NQueens-PT-30, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r246-tall-171654351500395
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 8.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 99K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 19 07:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 18:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Apr 12 03:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 200K Apr 12 03:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 12 03:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 86K Apr 12 03:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 759K May 18 16:43 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 NQueens-PT-30-LTLCardinality-00
FORMULA_NAME NQueens-PT-30-LTLCardinality-01
FORMULA_NAME NQueens-PT-30-LTLCardinality-02
FORMULA_NAME NQueens-PT-30-LTLCardinality-03
FORMULA_NAME NQueens-PT-30-LTLCardinality-04
FORMULA_NAME NQueens-PT-30-LTLCardinality-05
FORMULA_NAME NQueens-PT-30-LTLCardinality-06
FORMULA_NAME NQueens-PT-30-LTLCardinality-07
FORMULA_NAME NQueens-PT-30-LTLCardinality-08
FORMULA_NAME NQueens-PT-30-LTLCardinality-09
FORMULA_NAME NQueens-PT-30-LTLCardinality-10
FORMULA_NAME NQueens-PT-30-LTLCardinality-11
FORMULA_NAME NQueens-PT-30-LTLCardinality-12
FORMULA_NAME NQueens-PT-30-LTLCardinality-13
FORMULA_NAME NQueens-PT-30-LTLCardinality-14
FORMULA_NAME NQueens-PT-30-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716675646094

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NQueens-PT-30
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-05-25 22:20:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-25 22:20:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 22:20:47] [INFO ] Load time of PNML (sax parser for PT used): 141 ms
[2024-05-25 22:20:47] [INFO ] Transformed 1080 places.
[2024-05-25 22:20:47] [INFO ] Transformed 900 transitions.
[2024-05-25 22:20:47] [INFO ] Found NUPN structural information;
[2024-05-25 22:20:47] [INFO ] Parsed PT model containing 1080 places and 900 transitions and 4500 arcs in 246 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Reduce places removed 2 places and 0 transitions.
FORMULA NQueens-PT-30-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NQueens-PT-30-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NQueens-PT-30-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NQueens-PT-30-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NQueens-PT-30-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NQueens-PT-30-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NQueens-PT-30-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 29 out of 1078 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1078/1078 places, 900/900 transitions.
Reduce places removed 878 places and 0 transitions.
Iterating post reduction 0 with 878 rules applied. Total rules applied 878 place count 200 transition count 900
Applied a total of 878 rules in 53 ms. Remains 200 /1078 variables (removed 878) and now considering 900/900 (removed 0) transitions.
// Phase 1: matrix 900 rows 200 cols
[2024-05-25 22:20:47] [INFO ] Invariants computation overflowed in 172 ms
[2024-05-25 22:20:48] [INFO ] Implicit Places using invariants in 658 ms returned []
// Phase 1: matrix 900 rows 200 cols
[2024-05-25 22:20:48] [INFO ] Invariants computation overflowed in 127 ms
[2024-05-25 22:21:41] [INFO ] Performed 23/200 implicitness test of which 0 returned IMPLICIT in 32 seconds.
[2024-05-25 22:22:13] [INFO ] Performed 25/200 implicitness test of which 0 returned IMPLICIT in 64 seconds.
[2024-05-25 22:22:45] [INFO ] Performed 27/200 implicitness test of which 0 returned IMPLICIT in 96 seconds.
[2024-05-25 22:23:17] [INFO ] Performed 29/200 implicitness test of which 0 returned IMPLICIT in 128 seconds.
[2024-05-25 22:23:17] [INFO ] Timeout of Implicit test with SMT after 128 seconds.
[2024-05-25 22:23:17] [INFO ] Implicit Places using invariants and state equation in 149566 ms returned []
Implicit Place search using SMT with State Equation took 150256 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 : 200/1078 places, 900/900 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 150331 ms. Remains : 200/1078 places, 900/900 transitions.
Support contains 29 out of 200 places after structural reductions.
[2024-05-25 22:23:18] [INFO ] Flatten gal took : 112 ms
[2024-05-25 22:23:18] [INFO ] Flatten gal took : 68 ms
[2024-05-25 22:23:18] [INFO ] Input system was already deterministic with 900 transitions.
RANDOM walk for 36530 steps (1308 resets) in 3640 ms. (10 steps per ms) remains 0/16 properties
FORMULA NQueens-PT-30-LTLCardinality-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 200 stabilizing places and 900 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 200 transition count 900
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.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X(F(p1)))))'
Support contains 2 out of 200 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 900/900 transitions.
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 179 transition count 900
Applied a total of 21 rules in 9 ms. Remains 179 /200 variables (removed 21) and now considering 900/900 (removed 0) transitions.
// Phase 1: matrix 900 rows 179 cols
[2024-05-25 22:23:19] [INFO ] Invariants computation overflowed in 98 ms
[2024-05-25 22:23:20] [INFO ] Implicit Places using invariants in 368 ms returned []
// Phase 1: matrix 900 rows 179 cols
[2024-05-25 22:23:20] [INFO ] Invariants computation overflowed in 85 ms
[2024-05-25 22:24:10] [INFO ] Performed 31/179 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-25 22:24:22] [INFO ] Implicit Places using invariants and state equation in 62708 ms returned [61, 119, 120]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 63082 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 176/200 places, 900/900 transitions.
Applied a total of 0 rules in 6 ms. Remains 176 /176 variables (removed 0) and now considering 900/900 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 63097 ms. Remains : 176/200 places, 900/900 transitions.
Stuttering acceptance computed with spot in 227 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : NQueens-PT-30-LTLCardinality-00
Product exploration explored 100000 steps with 49212 reset in 9903 ms.
Product exploration explored 100000 steps with 49254 reset in 9783 ms.
Computed a total of 176 stabilizing places and 900 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 176 transition count 900
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 p0 (NOT p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 3 factoid took 266 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 94 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 64 steps (1 resets) in 15 ms. (4 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 (NOT p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p1))), (X (X p1)), (F (NOT p0)), (F p1)]
Knowledge based reduction with 3 factoid took 272 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 2 out of 176 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 900/900 transitions.
Applied a total of 0 rules in 6 ms. Remains 176 /176 variables (removed 0) and now considering 900/900 (removed 0) transitions.
// Phase 1: matrix 900 rows 176 cols
[2024-05-25 22:24:45] [INFO ] Invariants computation overflowed in 76 ms
[2024-05-25 22:24:46] [INFO ] Implicit Places using invariants in 558 ms returned []
// Phase 1: matrix 900 rows 176 cols
[2024-05-25 22:24:46] [INFO ] Invariants computation overflowed in 90 ms
[2024-05-25 22:25:42] [INFO ] Performed 2/176 implicitness test of which 0 returned IMPLICIT in 32 seconds.
[2024-05-25 22:26:14] [INFO ] Performed 4/176 implicitness test of which 0 returned IMPLICIT in 64 seconds.
[2024-05-25 22:26:46] [INFO ] Performed 6/176 implicitness test of which 0 returned IMPLICIT in 96 seconds.
[2024-05-25 22:27:18] [INFO ] Performed 8/176 implicitness test of which 0 returned IMPLICIT in 128 seconds.
[2024-05-25 22:27:18] [INFO ] Timeout of Implicit test with SMT after 128 seconds.
[2024-05-25 22:27:18] [INFO ] Implicit Places using invariants and state equation in 152065 ms returned []
Implicit Place search using SMT with State Equation took 152626 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 1ms
Finished structural reductions in LTL mode , in 1 iterations and 152634 ms. Remains : 176/176 places, 900/900 transitions.
Computed a total of 176 stabilizing places and 900 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 176 transition count 900
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 p0 (NOT p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 3 factoid took 280 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 133 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 27 steps (0 resets) in 14 ms. (1 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 (NOT p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p1))), (X (X p1)), (F (NOT p0)), (F p1)]
Knowledge based reduction with 3 factoid took 351 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 133 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 121 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 117 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 49223 reset in 9793 ms.
Product exploration explored 100000 steps with 49214 reset in 9861 ms.
Applying partial POR strategy [false, false, true]
Stuttering acceptance computed with spot in 121 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 2 out of 176 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 176/176 places, 900/900 transitions.
Applied a total of 0 rules in 27 ms. Remains 176 /176 variables (removed 0) and now considering 900/900 (removed 0) transitions.
[2024-05-25 22:27:41] [INFO ] Redundant transitions in 59 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 98 ms. Remains : 176/176 places, 900/900 transitions.
Built C files in :
/tmp/ltsmin9974226748194643636
[2024-05-25 22:27:41] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9974226748194643636
Running compilation step : cd /tmp/ltsmin9974226748194643636;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2134 ms.
Running link step : cd /tmp/ltsmin9974226748194643636;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin9974226748194643636;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased11230428990522852596.hoa' '--buchi-type=spotba'
LTSmin run took 1819 ms.
FORMULA NQueens-PT-30-LTLCardinality-00 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property NQueens-PT-30-LTLCardinality-00 finished in 266067 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(p0))||G(p1))))'
Support contains 4 out of 200 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 200/200 places, 900/900 transitions.
Graph (complete) has 88 edges and 200 vertex of which 180 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.2 ms
Discarding 20 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 15 ms. Remains 180 /200 variables (removed 20) and now considering 900/900 (removed 0) transitions.
// Phase 1: matrix 900 rows 180 cols
[2024-05-25 22:27:45] [INFO ] Invariants computation overflowed in 86 ms
[2024-05-25 22:27:46] [INFO ] Implicit Places using invariants in 334 ms returned []
// Phase 1: matrix 900 rows 180 cols
[2024-05-25 22:27:46] [INFO ] Invariants computation overflowed in 78 ms
[2024-05-25 22:29:25] [INFO ] Performed 5/180 implicitness test of which 0 returned IMPLICIT in 32 seconds.
[2024-05-25 22:29:57] [INFO ] Performed 7/180 implicitness test of which 0 returned IMPLICIT in 64 seconds.
[2024-05-25 22:30:26] [INFO ] Implicit Places using invariants and state equation in 160097 ms returned []
Implicit Place search using SMT with State Equation took 160435 ms to find 0 implicit places.
[2024-05-25 22:30:26] [INFO ] Redundant transitions in 15 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Starting structural reductions in SI_LTL mode, iteration 1 : 180/200 places, 900/900 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 160483 ms. Remains : 180/200 places, 900/900 transitions.
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : NQueens-PT-30-LTLCardinality-01
Stuttering criterion allowed to conclude after 1168 steps with 41 reset in 70 ms.
FORMULA NQueens-PT-30-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-30-LTLCardinality-01 finished in 160654 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 200 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 900/900 transitions.
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 179 transition count 900
Applied a total of 21 rules in 6 ms. Remains 179 /200 variables (removed 21) and now considering 900/900 (removed 0) transitions.
// Phase 1: matrix 900 rows 179 cols
[2024-05-25 22:30:26] [INFO ] Invariants computation overflowed in 76 ms
[2024-05-25 22:30:26] [INFO ] Implicit Places using invariants in 342 ms returned []
// Phase 1: matrix 900 rows 179 cols
[2024-05-25 22:30:26] [INFO ] Invariants computation overflowed in 76 ms
[2024-05-25 22:31:31] [INFO ] Performed 2/179 implicitness test of which 0 returned IMPLICIT in 32 seconds.
[2024-05-25 22:32:03] [INFO ] Performed 4/179 implicitness test of which 0 returned IMPLICIT in 64 seconds.
[2024-05-25 22:32:35] [INFO ] Performed 6/179 implicitness test of which 0 returned IMPLICIT in 96 seconds.
[2024-05-25 22:33:06] [INFO ] Performed 8/179 implicitness test of which 0 returned IMPLICIT in 127 seconds.
[2024-05-25 22:33:06] [INFO ] Timeout of Implicit test with SMT after 127 seconds.
[2024-05-25 22:33:06] [INFO ] Implicit Places using invariants and state equation in 160093 ms returned []
Implicit Place search using SMT with State Equation took 160436 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Starting structural reductions in LTL mode, iteration 1 : 179/200 places, 900/900 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 160444 ms. Remains : 179/200 places, 900/900 transitions.
Stuttering acceptance computed with spot in 97 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : NQueens-PT-30-LTLCardinality-08
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA NQueens-PT-30-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-30-LTLCardinality-08 finished in 160574 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 200 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 200/200 places, 900/900 transitions.
Graph (complete) has 88 edges and 200 vertex of which 175 are kept as prefixes of interest. Removing 25 places using SCC suffix rule.1 ms
Discarding 25 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 10 ms. Remains 175 /200 variables (removed 25) and now considering 900/900 (removed 0) transitions.
// Phase 1: matrix 900 rows 175 cols
[2024-05-25 22:33:07] [INFO ] Invariants computation overflowed in 104 ms
[2024-05-25 22:33:07] [INFO ] Implicit Places using invariants in 362 ms returned []
// Phase 1: matrix 900 rows 175 cols
[2024-05-25 22:33:07] [INFO ] Invariants computation overflowed in 104 ms
[2024-05-25 22:34:10] [INFO ] Performed 3/175 implicitness test of which 0 returned IMPLICIT in 32 seconds.
[2024-05-25 22:34:42] [INFO ] Performed 5/175 implicitness test of which 0 returned IMPLICIT in 64 seconds.
[2024-05-25 22:35:14] [INFO ] Performed 7/175 implicitness test of which 0 returned IMPLICIT in 96 seconds.
[2024-05-25 22:35:46] [INFO ] Performed 9/175 implicitness test of which 0 returned IMPLICIT in 128 seconds.
[2024-05-25 22:35:46] [INFO ] Timeout of Implicit test with SMT after 128 seconds.
[2024-05-25 22:35:46] [INFO ] Implicit Places using invariants and state equation in 159506 ms returned []
Implicit Place search using SMT with State Equation took 159879 ms to find 0 implicit places.
[2024-05-25 22:35:46] [INFO ] Redundant transitions in 10 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Starting structural reductions in SI_LTL mode, iteration 1 : 175/200 places, 900/900 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 159910 ms. Remains : 175/200 places, 900/900 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : NQueens-PT-30-LTLCardinality-09
Stuttering criterion allowed to conclude after 26 steps with 0 reset in 2 ms.
FORMULA NQueens-PT-30-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-30-LTLCardinality-09 finished in 159962 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(p1)&&p0)))'
Support contains 6 out of 200 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 900/900 transitions.
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 180 transition count 900
Applied a total of 20 rules in 4 ms. Remains 180 /200 variables (removed 20) and now considering 900/900 (removed 0) transitions.
// Phase 1: matrix 900 rows 180 cols
[2024-05-25 22:35:47] [INFO ] Invariants computation overflowed in 79 ms
[2024-05-25 22:35:47] [INFO ] Implicit Places using invariants in 314 ms returned []
// Phase 1: matrix 900 rows 180 cols
[2024-05-25 22:35:47] [INFO ] Invariants computation overflowed in 92 ms
[2024-05-25 22:36:47] [INFO ] Performed 3/180 implicitness test of which 0 returned IMPLICIT in 32 seconds.
[2024-05-25 22:37:19] [INFO ] Performed 5/180 implicitness test of which 0 returned IMPLICIT in 64 seconds.
[2024-05-25 22:37:51] [INFO ] Performed 7/180 implicitness test of which 0 returned IMPLICIT in 96 seconds.
[2024-05-25 22:38:23] [INFO ] Performed 9/180 implicitness test of which 0 returned IMPLICIT in 128 seconds.
[2024-05-25 22:38:23] [INFO ] Timeout of Implicit test with SMT after 128 seconds.
[2024-05-25 22:38:23] [INFO ] Implicit Places using invariants and state equation in 156109 ms returned []
Implicit Place search using SMT with State Equation took 156430 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Starting structural reductions in LTL mode, iteration 1 : 180/200 places, 900/900 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 156436 ms. Remains : 180/200 places, 900/900 transitions.
Stuttering acceptance computed with spot in 130 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : NQueens-PT-30-LTLCardinality-10
Stuttering criterion allowed to conclude after 28 steps with 0 reset in 2 ms.
FORMULA NQueens-PT-30-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-30-LTLCardinality-10 finished in 156587 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0 U p1))))'
Support contains 5 out of 200 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 900/900 transitions.
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 183 transition count 900
Applied a total of 17 rules in 10 ms. Remains 183 /200 variables (removed 17) and now considering 900/900 (removed 0) transitions.
// Phase 1: matrix 900 rows 183 cols
[2024-05-25 22:38:23] [INFO ] Invariants computation overflowed in 74 ms
[2024-05-25 22:38:23] [INFO ] Implicit Places using invariants in 311 ms returned []
// Phase 1: matrix 900 rows 183 cols
[2024-05-25 22:38:24] [INFO ] Invariants computation overflowed in 74 ms
[2024-05-25 22:40:00] [INFO ] Performed 6/183 implicitness test of which 0 returned IMPLICIT in 32 seconds.
[2024-05-25 22:40:32] [INFO ] Performed 8/183 implicitness test of which 0 returned IMPLICIT in 64 seconds.
[2024-05-25 22:41:04] [INFO ] Performed 10/183 implicitness test of which 0 returned IMPLICIT in 95 seconds.
[2024-05-25 22:41:04] [INFO ] Implicit Places using invariants and state equation in 160105 ms returned []
Implicit Place search using SMT with State Equation took 160427 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Starting structural reductions in LTL mode, iteration 1 : 183/200 places, 900/900 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 160438 ms. Remains : 183/200 places, 900/900 transitions.
Stuttering acceptance computed with spot in 152 ms :[(NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : NQueens-PT-30-LTLCardinality-11
Entered a terminal (fully accepting) state of product in 129 steps with 4 reset in 14 ms.
FORMULA NQueens-PT-30-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-30-LTLCardinality-11 finished in 160639 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(((X(p1)&&G(p2))||p0))))'
Support contains 6 out of 200 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 900/900 transitions.
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 182 transition count 900
Applied a total of 18 rules in 10 ms. Remains 182 /200 variables (removed 18) and now considering 900/900 (removed 0) transitions.
// Phase 1: matrix 900 rows 182 cols
[2024-05-25 22:41:04] [INFO ] Invariants computation overflowed in 71 ms
[2024-05-25 22:41:04] [INFO ] Implicit Places using invariants in 320 ms returned []
// Phase 1: matrix 900 rows 182 cols
[2024-05-25 22:41:04] [INFO ] Invariants computation overflowed in 67 ms
[2024-05-25 22:43:00] [INFO ] Performed 5/182 implicitness test of which 0 returned IMPLICIT in 32 seconds.
[2024-05-25 22:43:32] [INFO ] Performed 7/182 implicitness test of which 0 returned IMPLICIT in 64 seconds.
[2024-05-25 22:43:44] [INFO ] Implicit Places using invariants and state equation in 160079 ms returned []
Implicit Place search using SMT with State Equation took 160412 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Starting structural reductions in LTL mode, iteration 1 : 182/200 places, 900/900 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 160423 ms. Remains : 182/200 places, 900/900 transitions.
Stuttering acceptance computed with spot in 197 ms :[true, (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (NOT p1))]
Running random walk in product with property : NQueens-PT-30-LTLCardinality-12
Product exploration explored 100000 steps with 3584 reset in 5603 ms.
Product exploration explored 100000 steps with 3586 reset in 5593 ms.
Computed a total of 182 stabilizing places and 900 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 182 transition count 900
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 p2 p0 p1), (X p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p2))), (X p0), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (OR (NOT p2) (NOT p1)))), (X (X (NOT (OR (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) p2 p1))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (AND p0 p2 p1))), (X (X (NOT (AND p0 p2 p1)))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 9 factoid took 2003 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 171 ms :[true, (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (NOT p1))]
RANDOM walk for 40000 steps (1432 resets) in 2414 ms. (16 steps per ms) remains 2/9 properties
BEST_FIRST walk for 15978 steps (1 resets) in 94 ms. (168 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p2 p0 p1), (X p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p2))), (X p0), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (OR (NOT p2) (NOT p1)))), (X (X (NOT (OR (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) p2 p1))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (AND p0 p2 p1))), (X (X (NOT (AND p0 p2 p1)))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT (AND p1 p2))), (F (NOT (OR p2 p0))), (F (NOT (OR (NOT p1) (NOT p2) p0))), (F (NOT p2)), (F (NOT (AND p1 p2 p0))), (F (NOT (OR (NOT p2) p0))), (F (NOT (AND p2 p0))), (F (NOT p1)), (F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT (OR p2 p0)))
Knowledge based reduction with 9 factoid took 2242 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA NQueens-PT-30-LTLCardinality-12 FALSE TECHNIQUES KNOWLEDGE
Treatment of property NQueens-PT-30-LTLCardinality-12 finished in 179187 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0||X(p0)))))'
Support contains 1 out of 200 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 900/900 transitions.
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 179 transition count 900
Applied a total of 21 rules in 10 ms. Remains 179 /200 variables (removed 21) and now considering 900/900 (removed 0) transitions.
// Phase 1: matrix 900 rows 179 cols
[2024-05-25 22:44:03] [INFO ] Invariants computation overflowed in 81 ms
[2024-05-25 22:44:03] [INFO ] Implicit Places using invariants in 337 ms returned []
// Phase 1: matrix 900 rows 179 cols
[2024-05-25 22:44:03] [INFO ] Invariants computation overflowed in 80 ms
[2024-05-25 22:45:44] [INFO ] Performed 2/179 implicitness test of which 0 returned IMPLICIT in 32 seconds.
[2024-05-25 22:46:16] [INFO ] Performed 4/179 implicitness test of which 0 returned IMPLICIT in 64 seconds.
[2024-05-25 22:46:43] [INFO ] Implicit Places using invariants and state equation in 160092 ms returned []
Implicit Place search using SMT with State Equation took 160435 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Starting structural reductions in LTL mode, iteration 1 : 179/200 places, 900/900 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 160448 ms. Remains : 179/200 places, 900/900 transitions.
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NQueens-PT-30-LTLCardinality-15
Stuttering criterion allowed to conclude after 27 steps with 0 reset in 5 ms.
FORMULA NQueens-PT-30-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-30-LTLCardinality-15 finished in 160564 ms.
All properties solved by simple procedures.
Total runtime 1556795 ms.

BK_STOP 1716677204349

--------------------
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -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="NQueens-PT-30"
export BK_EXAMINATION="LTLCardinality"
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-5568"
echo " Executing tool itstools"
echo " Input is NQueens-PT-30, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r246-tall-171654351500395"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/NQueens-PT-30.tgz
mv NQueens-PT-30 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;