Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r140-tall-162089127100028.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is NQueens-PT-10, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r140-tall-162089127100028
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 456K
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 15K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 101K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.0K Mar 28 16:20 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 28 16:20 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 28 16:20 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:20 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Mar 27 06:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 27 06:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.3K Mar 25 07:18 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 25 07:18 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 96K May 5 16:51 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-10-00
FORMULA_NAME NQueens-PT-10-01
FORMULA_NAME NQueens-PT-10-02
FORMULA_NAME NQueens-PT-10-03
FORMULA_NAME NQueens-PT-10-04
FORMULA_NAME NQueens-PT-10-05
FORMULA_NAME NQueens-PT-10-06
FORMULA_NAME NQueens-PT-10-07
FORMULA_NAME NQueens-PT-10-08
FORMULA_NAME NQueens-PT-10-09
FORMULA_NAME NQueens-PT-10-10
FORMULA_NAME NQueens-PT-10-11
FORMULA_NAME NQueens-PT-10-12
FORMULA_NAME NQueens-PT-10-13
FORMULA_NAME NQueens-PT-10-14
FORMULA_NAME NQueens-PT-10-15

=== Now, execution of the tool begins

BK_START 1620916228018

Running Version 0
[2021-05-13 14:30:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-13 14:30:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 14:30:29] [INFO ] Load time of PNML (sax parser for PT used): 54 ms
[2021-05-13 14:30:29] [INFO ] Transformed 160 places.
[2021-05-13 14:30:29] [INFO ] Transformed 100 transitions.
[2021-05-13 14:30:29] [INFO ] Parsed PT model containing 160 places and 100 transitions in 92 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
Reduce places removed 2 places and 0 transitions.
FORMULA NQueens-PT-10-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NQueens-PT-10-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 38 out of 158 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 158/158 places, 100/100 transitions.
Reduce places removed 74 places and 0 transitions.
Iterating post reduction 0 with 74 rules applied. Total rules applied 74 place count 84 transition count 100
Applied a total of 74 rules in 13 ms. Remains 84 /158 variables (removed 74) and now considering 100/100 (removed 0) transitions.
// Phase 1: matrix 100 rows 84 cols
[2021-05-13 14:30:29] [INFO ] Computed 7 place invariants in 23 ms
[2021-05-13 14:30:29] [INFO ] Implicit Places using invariants in 193 ms returned []
// Phase 1: matrix 100 rows 84 cols
[2021-05-13 14:30:29] [INFO ] Computed 7 place invariants in 4 ms
[2021-05-13 14:30:30] [INFO ] Implicit Places using invariants and state equation in 145 ms returned [46, 65, 83]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 365 ms to find 3 implicit places.
// Phase 1: matrix 100 rows 81 cols
[2021-05-13 14:30:30] [INFO ] Computed 4 place invariants in 3 ms
[2021-05-13 14:30:30] [INFO ] Dead Transitions using invariants and state equation in 70 ms returned []
Starting structural reductions, iteration 1 : 81/158 places, 100/100 transitions.
Applied a total of 0 rules in 2 ms. Remains 81 /81 variables (removed 0) and now considering 100/100 (removed 0) transitions.
// Phase 1: matrix 100 rows 81 cols
[2021-05-13 14:30:30] [INFO ] Computed 4 place invariants in 3 ms
[2021-05-13 14:30:30] [INFO ] Dead Transitions using invariants and state equation in 88 ms returned []
Finished structural reductions, in 2 iterations. Remains : 81/158 places, 100/100 transitions.
[2021-05-13 14:30:30] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-05-13 14:30:30] [INFO ] Flatten gal took : 42 ms
FORMULA NQueens-PT-10-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NQueens-PT-10-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-13 14:30:30] [INFO ] Flatten gal took : 17 ms
[2021-05-13 14:30:30] [INFO ] Input system was already deterministic with 100 transitions.
Incomplete random walk after 100000 steps, including 10679 resets, run finished after 914 ms. (steps per millisecond=109 ) properties (out of 23) seen :15
Running SMT prover for 8 properties.
// Phase 1: matrix 100 rows 81 cols
[2021-05-13 14:30:31] [INFO ] Computed 4 place invariants in 3 ms
[2021-05-13 14:30:31] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 3 ms returned sat
[2021-05-13 14:30:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 14:30:31] [INFO ] [Real]Absence check using state equation in 15 ms returned unsat
[2021-05-13 14:30:31] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 3 ms returned sat
[2021-05-13 14:30:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 14:30:31] [INFO ] [Real]Absence check using state equation in 20 ms returned unsat
[2021-05-13 14:30:31] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 2 ms returned sat
[2021-05-13 14:30:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 14:30:31] [INFO ] [Real]Absence check using state equation in 13 ms returned unsat
[2021-05-13 14:30:31] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 2 ms returned sat
[2021-05-13 14:30:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 14:30:31] [INFO ] [Real]Absence check using state equation in 14 ms returned unsat
[2021-05-13 14:30:31] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 2 ms returned sat
[2021-05-13 14:30:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 14:30:31] [INFO ] [Real]Absence check using state equation in 13 ms returned unsat
[2021-05-13 14:30:31] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 2 ms returned sat
[2021-05-13 14:30:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 14:30:31] [INFO ] [Real]Absence check using state equation in 14 ms returned unsat
[2021-05-13 14:30:31] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 2 ms returned sat
[2021-05-13 14:30:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 14:30:31] [INFO ] [Real]Absence check using state equation in 14 ms returned unsat
[2021-05-13 14:30:31] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 2 ms returned sat
[2021-05-13 14:30:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 14:30:31] [INFO ] [Real]Absence check using state equation in 15 ms returned unsat
Successfully simplified 8 atomic propositions for a total of 12 simplifications.
[2021-05-13 14:30:31] [INFO ] Initial state test concluded for 4 properties.
FORMULA NQueens-PT-10-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NQueens-PT-10-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NQueens-PT-10-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NQueens-PT-10-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NQueens-PT-10-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)&&F(p1)))], workingDir=/home/mcc/execution]
Support contains 3 out of 81 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 81/81 places, 100/100 transitions.
Graph (complete) has 104 edges and 81 vertex of which 55 are kept as prefixes of interest. Removing 26 places using SCC suffix rule.2 ms
Discarding 26 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 8 ms. Remains 55 /81 variables (removed 26) and now considering 100/100 (removed 0) transitions.
// Phase 1: matrix 100 rows 55 cols
[2021-05-13 14:30:31] [INFO ] Computed 4 place invariants in 2 ms
[2021-05-13 14:30:31] [INFO ] Implicit Places using invariants in 59 ms returned []
// Phase 1: matrix 100 rows 55 cols
[2021-05-13 14:30:31] [INFO ] Computed 4 place invariants in 2 ms
[2021-05-13 14:30:31] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
[2021-05-13 14:30:31] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 100 rows 55 cols
[2021-05-13 14:30:31] [INFO ] Computed 4 place invariants in 2 ms
[2021-05-13 14:30:32] [INFO ] Dead Transitions using invariants and state equation in 49 ms returned []
Finished structural reductions, in 1 iterations. Remains : 55/81 places, 100/100 transitions.
Stuttering acceptance computed with spot in 180 ms :[(NOT p0), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : NQueens-PT-10-02 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 p1), acceptance={0} source=2 dest: 0}, { cond=(NOT p0), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=2, aps=[p0:(LEQ 1 s37), p1:(GT s53 s11)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 40 steps with 4 reset in 3 ms.
FORMULA NQueens-PT-10-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-10-02 finished in 459 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0 U (X(p1)||G(p0)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 81 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 81/81 places, 100/100 transitions.
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 57 transition count 100
Applied a total of 24 rules in 2 ms. Remains 57 /81 variables (removed 24) and now considering 100/100 (removed 0) transitions.
// Phase 1: matrix 100 rows 57 cols
[2021-05-13 14:30:32] [INFO ] Computed 4 place invariants in 3 ms
[2021-05-13 14:30:32] [INFO ] Implicit Places using invariants in 61 ms returned []
// Phase 1: matrix 100 rows 57 cols
[2021-05-13 14:30:32] [INFO ] Computed 4 place invariants in 2 ms
[2021-05-13 14:30:32] [INFO ] Implicit Places using invariants and state equation in 122 ms returned [39]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 188 ms to find 1 implicit places.
// Phase 1: matrix 100 rows 56 cols
[2021-05-13 14:30:32] [INFO ] Computed 3 place invariants in 3 ms
[2021-05-13 14:30:32] [INFO ] Dead Transitions using invariants and state equation in 55 ms returned []
Starting structural reductions, iteration 1 : 56/81 places, 100/100 transitions.
Applied a total of 0 rules in 2 ms. Remains 56 /56 variables (removed 0) and now considering 100/100 (removed 0) transitions.
// Phase 1: matrix 100 rows 56 cols
[2021-05-13 14:30:32] [INFO ] Computed 3 place invariants in 2 ms
[2021-05-13 14:30:32] [INFO ] Dead Transitions using invariants and state equation in 53 ms returned []
Finished structural reductions, in 2 iterations. Remains : 56/81 places, 100/100 transitions.
Stuttering acceptance computed with spot in 115 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : NQueens-PT-10-05 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(GT s0 s1), p0:(GT s6 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 17 steps with 1 reset in 0 ms.
FORMULA NQueens-PT-10-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-10-05 finished in 427 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((F(p0) U p1)&&X(p2)))], workingDir=/home/mcc/execution]
Support contains 5 out of 81 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 81/81 places, 100/100 transitions.
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 58 transition count 100
Applied a total of 23 rules in 4 ms. Remains 58 /81 variables (removed 23) and now considering 100/100 (removed 0) transitions.
// Phase 1: matrix 100 rows 58 cols
[2021-05-13 14:30:32] [INFO ] Computed 4 place invariants in 2 ms
[2021-05-13 14:30:32] [INFO ] Implicit Places using invariants in 65 ms returned []
// Phase 1: matrix 100 rows 58 cols
[2021-05-13 14:30:32] [INFO ] Computed 4 place invariants in 3 ms
[2021-05-13 14:30:32] [INFO ] Implicit Places using invariants and state equation in 112 ms returned [40]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 179 ms to find 1 implicit places.
// Phase 1: matrix 100 rows 57 cols
[2021-05-13 14:30:32] [INFO ] Computed 3 place invariants in 8 ms
[2021-05-13 14:30:32] [INFO ] Dead Transitions using invariants and state equation in 56 ms returned []
Starting structural reductions, iteration 1 : 57/81 places, 100/100 transitions.
Applied a total of 0 rules in 4 ms. Remains 57 /57 variables (removed 0) and now considering 100/100 (removed 0) transitions.
// Phase 1: matrix 100 rows 57 cols
[2021-05-13 14:30:32] [INFO ] Computed 3 place invariants in 3 ms
[2021-05-13 14:30:32] [INFO ] Dead Transitions using invariants and state equation in 44 ms returned []
Finished structural reductions, in 2 iterations. Remains : 57/81 places, 100/100 transitions.
Stuttering acceptance computed with spot in 130 ms :[(OR (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2), true]
Running random walk in product with property : NQueens-PT-10-06 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(GT s45 s2), p0:(LEQ 1 s1), p2:(LEQ s0 s38)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1161 ms.
Product exploration explored 100000 steps with 50000 reset in 1150 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 57 transition count 100
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 : [(F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), p1, (NOT p0), p2]
Adopting property with smaller alphabet thanks to knowledge :p1
Stuttering acceptance computed with spot in 50 ms :[true, (AND p1 (NOT p2)), (NOT p2)]
Support contains 4 out of 57 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 57/57 places, 100/100 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 56 transition count 100
Applied a total of 1 rules in 1 ms. Remains 56 /57 variables (removed 1) and now considering 100/100 (removed 0) transitions.
// Phase 1: matrix 100 rows 56 cols
[2021-05-13 14:30:35] [INFO ] Computed 3 place invariants in 2 ms
[2021-05-13 14:30:35] [INFO ] Implicit Places using invariants in 43 ms returned []
// Phase 1: matrix 100 rows 56 cols
[2021-05-13 14:30:35] [INFO ] Computed 3 place invariants in 7 ms
[2021-05-13 14:30:35] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 139 ms to find 0 implicit places.
// Phase 1: matrix 100 rows 56 cols
[2021-05-13 14:30:35] [INFO ] Computed 3 place invariants in 2 ms
[2021-05-13 14:30:35] [INFO ] Dead Transitions using invariants and state equation in 48 ms returned []
Finished structural reductions, in 1 iterations. Remains : 56/57 places, 100/100 transitions.
Stuttering acceptance computed with spot in 51 ms :[true, (AND p1 (NOT p2)), (NOT p2)]
Product exploration explored 100000 steps with 50000 reset in 1080 ms.
Product exploration explored 100000 steps with 50000 reset in 1064 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 59 ms :[true, (AND p1 (NOT p2)), (NOT p2)]
Support contains 4 out of 56 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 56/56 places, 100/100 transitions.
Applied a total of 0 rules in 3 ms. Remains 56 /56 variables (removed 0) and now considering 100/100 (removed 0) transitions.
[2021-05-13 14:30:38] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 100 rows 56 cols
[2021-05-13 14:30:38] [INFO ] Computed 3 place invariants in 3 ms
[2021-05-13 14:30:38] [INFO ] Dead Transitions using invariants and state equation in 41 ms returned []
Finished structural reductions, in 1 iterations. Remains : 56/56 places, 100/100 transitions.
Product exploration explored 100000 steps with 50000 reset in 1008 ms.
Product exploration explored 100000 steps with 50000 reset in 1035 ms.
Starting structural reductions, iteration 0 : 57/57 places, 100/100 transitions.
Applied a total of 0 rules in 2 ms. Remains 57 /57 variables (removed 0) and now considering 100/100 (removed 0) transitions.
// Phase 1: matrix 100 rows 57 cols
[2021-05-13 14:30:40] [INFO ] Computed 3 place invariants in 2 ms
[2021-05-13 14:30:40] [INFO ] Implicit Places using invariants in 90 ms returned []
// Phase 1: matrix 100 rows 57 cols
[2021-05-13 14:30:40] [INFO ] Computed 3 place invariants in 2 ms
[2021-05-13 14:30:40] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 223 ms to find 0 implicit places.
// Phase 1: matrix 100 rows 57 cols
[2021-05-13 14:30:40] [INFO ] Computed 3 place invariants in 3 ms
[2021-05-13 14:30:40] [INFO ] Dead Transitions using invariants and state equation in 95 ms returned []
Finished structural reductions, in 1 iterations. Remains : 57/57 places, 100/100 transitions.
Application raised an uncaught exception null
java.lang.UnsupportedOperationException
at fr.lip6.move.gal.application.MccTranslator.toGal(MccTranslator.java:879)
at fr.lip6.move.gal.application.MccTranslator.lambda$3(MccTranslator.java:862)
at fr.lip6.move.gal.structural.expr.NaryOp.forEachChild(NaryOp.java:153)
at fr.lip6.move.gal.application.MccTranslator.toGal(MccTranslator.java:862)
at fr.lip6.move.gal.application.MccTranslator.toGal(MccTranslator.java:760)
at fr.lip6.move.gal.application.MccTranslator.rebuildSpecification(MccTranslator.java:729)
at fr.lip6.move.gal.application.GlobalPropertySolver.verifyWithSDD(GlobalPropertySolver.java:585)
at fr.lip6.move.gal.application.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:269)
at fr.lip6.move.gal.application.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:60)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:470)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)

BK_STOP 1620916242071

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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-10"
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-4028"
echo " Executing tool itstools"
echo " Input is NQueens-PT-10, 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 r140-tall-162089127100028"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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