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.r536-tall-171690532700587.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 ltsminxred
Input is Sudoku-PT-AN03, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r536-tall-171690532700587
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.7M
-rw-r--r-- 1 mcc users 27K Apr 12 10:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 183K Apr 12 10:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 44K Apr 12 10:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 243K Apr 12 10:07 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 14K Apr 23 08:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 56K Apr 23 08:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 13K Apr 23 08:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 53K Apr 23 08:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 59K Apr 12 10:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 382K Apr 12 10:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 87K Apr 12 10:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 463K Apr 12 10:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 08:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.8K Apr 23 08:00 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 21K 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 Sudoku-PT-AN03-LTLCardinality-00
FORMULA_NAME Sudoku-PT-AN03-LTLCardinality-01
FORMULA_NAME Sudoku-PT-AN03-LTLCardinality-02
FORMULA_NAME Sudoku-PT-AN03-LTLCardinality-03
FORMULA_NAME Sudoku-PT-AN03-LTLCardinality-04
FORMULA_NAME Sudoku-PT-AN03-LTLCardinality-05
FORMULA_NAME Sudoku-PT-AN03-LTLCardinality-06
FORMULA_NAME Sudoku-PT-AN03-LTLCardinality-07
FORMULA_NAME Sudoku-PT-AN03-LTLCardinality-08
FORMULA_NAME Sudoku-PT-AN03-LTLCardinality-09
FORMULA_NAME Sudoku-PT-AN03-LTLCardinality-10
FORMULA_NAME Sudoku-PT-AN03-LTLCardinality-11
FORMULA_NAME Sudoku-PT-AN03-LTLCardinality-12
FORMULA_NAME Sudoku-PT-AN03-LTLCardinality-13
FORMULA_NAME Sudoku-PT-AN03-LTLCardinality-14
FORMULA_NAME Sudoku-PT-AN03-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717268612084

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Sudoku-PT-AN03
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 19:03:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 19:03:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 19:03:33] [INFO ] Load time of PNML (sax parser for PT used): 57 ms
[2024-06-01 19:03:33] [INFO ] Transformed 54 places.
[2024-06-01 19:03:33] [INFO ] Transformed 27 transitions.
[2024-06-01 19:03:33] [INFO ] Found NUPN structural information;
[2024-06-01 19:03:33] [INFO ] Parsed PT model containing 54 places and 27 transitions and 108 arcs in 155 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 16 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA Sudoku-PT-AN03-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN03-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN03-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN03-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN03-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN03-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN03-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 54 out of 54 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 27/27 transitions.
Applied a total of 0 rules in 9 ms. Remains 54 /54 variables (removed 0) and now considering 27/27 (removed 0) transitions.
// Phase 1: matrix 27 rows 54 cols
[2024-06-01 19:03:33] [INFO ] Computed 27 invariants in 19 ms
[2024-06-01 19:03:34] [INFO ] Implicit Places using invariants in 263 ms returned []
[2024-06-01 19:03:34] [INFO ] Invariant cache hit.
[2024-06-01 19:03:34] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 419 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 445 ms. Remains : 54/54 places, 27/27 transitions.
Support contains 54 out of 54 places after structural reductions.
[2024-06-01 19:03:34] [INFO ] Flatten gal took : 17 ms
[2024-06-01 19:03:34] [INFO ] Flatten gal took : 7 ms
[2024-06-01 19:03:34] [INFO ] Input system was already deterministic with 27 transitions.
RANDOM walk for 40000 steps (4691 resets) in 1828 ms. (21 steps per ms) remains 2/14 properties
BEST_FIRST walk for 40003 steps (440 resets) in 143 ms. (277 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (441 resets) in 188 ms. (211 steps per ms) remains 2/2 properties
[2024-06-01 19:03:35] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 54/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp7 is UNSAT
After SMT solving in domain Real declared 54/81 variables, and 81 constraints, problems are : Problem set: 2 solved, 0 unsolved in 92 ms.
Refiners :[Domain max(s): 54/54 constraints, Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 0/54 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 136ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA Sudoku-PT-AN03-LTLCardinality-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 8 simplifications.
Computed a total of 54 stabilizing places and 27 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 54 transition count 27
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
FORMULA Sudoku-PT-AN03-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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))'
Support contains 27 out of 54 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 27/27 transitions.
Applied a total of 0 rules in 3 ms. Remains 54 /54 variables (removed 0) and now considering 27/27 (removed 0) transitions.
[2024-06-01 19:03:35] [INFO ] Invariant cache hit.
[2024-06-01 19:03:35] [INFO ] Implicit Places using invariants in 102 ms returned []
[2024-06-01 19:03:35] [INFO ] Invariant cache hit.
[2024-06-01 19:03:36] [INFO ] Implicit Places using invariants and state equation in 151 ms returned []
Implicit Place search using SMT with State Equation took 255 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 258 ms. Remains : 54/54 places, 27/27 transitions.
Stuttering acceptance computed with spot in 261 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : Sudoku-PT-AN03-LTLCardinality-01
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Sudoku-PT-AN03-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN03-LTLCardinality-01 finished in 605 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' '!(G(F(p0)))'
Support contains 36 out of 54 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 54/54 places, 27/27 transitions.
Applied a total of 0 rules in 4 ms. Remains 54 /54 variables (removed 0) and now considering 27/27 (removed 0) transitions.
[2024-06-01 19:03:36] [INFO ] Invariant cache hit.
[2024-06-01 19:03:36] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-06-01 19:03:36] [INFO ] Invariant cache hit.
[2024-06-01 19:03:36] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 191 ms to find 0 implicit places.
[2024-06-01 19:03:36] [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 201 ms. Remains : 54/54 places, 27/27 transitions.
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN03-LTLCardinality-02
Product exploration explored 100000 steps with 16458 reset in 438 ms.
Product exploration explored 100000 steps with 16452 reset in 388 ms.
Computed a total of 54 stabilizing places and 27 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 54 transition count 27
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 152 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 20 steps (0 resets) in 5 ms. (3 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 126 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
[2024-06-01 19:03:38] [INFO ] Invariant cache hit.
[2024-06-01 19:03:38] [INFO ] [Real]Absence check using 27 positive place invariants in 7 ms returned sat
[2024-06-01 19:03:38] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2024-06-01 19:03:38] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 19:03:38] [INFO ] [Nat]Absence check using 27 positive place invariants in 9 ms returned sat
[2024-06-01 19:03:38] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2024-06-01 19:03:38] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 19:03:38] [INFO ] Added : 0 causal constraints over 0 iterations in 13 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 36 out of 54 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 54/54 places, 27/27 transitions.
Applied a total of 0 rules in 2 ms. Remains 54 /54 variables (removed 0) and now considering 27/27 (removed 0) transitions.
[2024-06-01 19:03:38] [INFO ] Invariant cache hit.
[2024-06-01 19:03:38] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-06-01 19:03:38] [INFO ] Invariant cache hit.
[2024-06-01 19:03:38] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
[2024-06-01 19:03:38] [INFO ] Redundant transitions in 0 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 119 ms. Remains : 54/54 places, 27/27 transitions.
Computed a total of 54 stabilizing places and 27 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 54 transition count 27
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 113 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 20 steps (0 resets) in 4 ms. (4 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 115 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
[2024-06-01 19:03:38] [INFO ] Invariant cache hit.
[2024-06-01 19:03:39] [INFO ] [Real]Absence check using 27 positive place invariants in 6 ms returned sat
[2024-06-01 19:03:39] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2024-06-01 19:03:39] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 19:03:39] [INFO ] [Nat]Absence check using 27 positive place invariants in 9 ms returned sat
[2024-06-01 19:03:39] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2024-06-01 19:03:39] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 19:03:39] [INFO ] Added : 0 causal constraints over 0 iterations in 14 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 16455 reset in 328 ms.
Product exploration explored 100000 steps with 16451 reset in 321 ms.
Support contains 36 out of 54 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 54/54 places, 27/27 transitions.
Applied a total of 0 rules in 1 ms. Remains 54 /54 variables (removed 0) and now considering 27/27 (removed 0) transitions.
[2024-06-01 19:03:39] [INFO ] Invariant cache hit.
[2024-06-01 19:03:39] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-06-01 19:03:39] [INFO ] Invariant cache hit.
[2024-06-01 19:03:39] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
[2024-06-01 19:03:40] [INFO ] Redundant transitions in 0 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 106 ms. Remains : 54/54 places, 27/27 transitions.
Treatment of property Sudoku-PT-AN03-LTLCardinality-02 finished in 3721 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' '!(G((X(p0) U (X(G(p0))||(!p1&&X((p0&&F(G(!p1)))))))))'
Support contains 9 out of 54 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 27/27 transitions.
Applied a total of 0 rules in 1 ms. Remains 54 /54 variables (removed 0) and now considering 27/27 (removed 0) transitions.
[2024-06-01 19:03:40] [INFO ] Invariant cache hit.
[2024-06-01 19:03:40] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-06-01 19:03:40] [INFO ] Invariant cache hit.
[2024-06-01 19:03:40] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 141 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 142 ms. Remains : 54/54 places, 27/27 transitions.
Stuttering acceptance computed with spot in 118 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN03-LTLCardinality-05
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Sudoku-PT-AN03-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN03-LTLCardinality-05 finished in 279 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(X((p0&&G(p1)))))'
Support contains 54 out of 54 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 27/27 transitions.
Applied a total of 0 rules in 0 ms. Remains 54 /54 variables (removed 0) and now considering 27/27 (removed 0) transitions.
[2024-06-01 19:03:40] [INFO ] Invariant cache hit.
[2024-06-01 19:03:40] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-06-01 19:03:40] [INFO ] Invariant cache hit.
[2024-06-01 19:03:40] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 81 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 81 ms. Remains : 54/54 places, 27/27 transitions.
Stuttering acceptance computed with spot in 306 ms :[true, (NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : Sudoku-PT-AN03-LTLCardinality-07
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 0 ms.
FORMULA Sudoku-PT-AN03-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN03-LTLCardinality-07 finished in 429 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 54 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 54/54 places, 27/27 transitions.
Graph (complete) has 81 edges and 54 vertex of which 28 are kept as prefixes of interest. Removing 26 places using SCC suffix rule.1 ms
Discarding 26 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 9 ms. Remains 28 /54 variables (removed 26) and now considering 27/27 (removed 0) transitions.
// Phase 1: matrix 27 rows 28 cols
[2024-06-01 19:03:40] [INFO ] Computed 8 invariants in 5 ms
[2024-06-01 19:03:40] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-06-01 19:03:40] [INFO ] Invariant cache hit.
[2024-06-01 19:03:40] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
[2024-06-01 19:03:40] [INFO ] Redundant transitions in 0 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 : 28/54 places, 27/27 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 108 ms. Remains : 28/54 places, 27/27 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-PT-AN03-LTLCardinality-10
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA Sudoku-PT-AN03-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN03-LTLCardinality-10 finished in 163 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' '!((G(p0)||F(G(p1))))'
Support contains 3 out of 54 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 54/54 places, 27/27 transitions.
Graph (complete) has 81 edges and 54 vertex of which 27 are kept as prefixes of interest. Removing 27 places using SCC suffix rule.0 ms
Discarding 27 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 2 ms. Remains 27 /54 variables (removed 27) and now considering 27/27 (removed 0) transitions.
// Phase 1: matrix 27 rows 27 cols
[2024-06-01 19:03:40] [INFO ] Computed 8 invariants in 3 ms
[2024-06-01 19:03:40] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-06-01 19:03:40] [INFO ] Invariant cache hit.
[2024-06-01 19:03:41] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
[2024-06-01 19:03:41] [INFO ] Redundant transitions in 0 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 : 27/54 places, 27/27 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 96 ms. Remains : 27/54 places, 27/27 transitions.
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : Sudoku-PT-AN03-LTLCardinality-13
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA Sudoku-PT-AN03-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN03-LTLCardinality-13 finished in 182 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' '!(G(F(p0)))'
Support contains 2 out of 54 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 54/54 places, 27/27 transitions.
Graph (complete) has 81 edges and 54 vertex of which 28 are kept as prefixes of interest. Removing 26 places using SCC suffix rule.1 ms
Discarding 26 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 3 ms. Remains 28 /54 variables (removed 26) and now considering 27/27 (removed 0) transitions.
// Phase 1: matrix 27 rows 28 cols
[2024-06-01 19:03:41] [INFO ] Computed 8 invariants in 3 ms
[2024-06-01 19:03:41] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-06-01 19:03:41] [INFO ] Invariant cache hit.
[2024-06-01 19:03:41] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
[2024-06-01 19:03:41] [INFO ] Redundant transitions in 0 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 : 28/54 places, 27/27 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 93 ms. Remains : 28/54 places, 27/27 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN03-LTLCardinality-14
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA Sudoku-PT-AN03-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN03-LTLCardinality-14 finished in 176 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' '!(G(F(p0)))'
[2024-06-01 19:03:41] [INFO ] Flatten gal took : 11 ms
[2024-06-01 19:03:41] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-06-01 19:03:41] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 54 places, 27 transitions and 108 arcs took 3 ms.
Total runtime 8002 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA Sudoku-PT-AN03-LTLCardinality-02 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717268622252

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2024
ltl formula name Sudoku-PT-AN03-LTLCardinality-02
ltl formula formula --ltl=/tmp/793/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 54 places, 27 transitions and 108 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/793/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/793/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/793/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/793/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 29 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 55, there are 30 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): ~10 levels ~10000 states ~47816 transitions
pnml2lts-mc( 2/ 4): ~10 levels ~20000 states ~115584 transitions
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 20263
pnml2lts-mc( 0/ 4): unique states count: 20263
pnml2lts-mc( 0/ 4): unique transitions count: 128748
pnml2lts-mc( 0/ 4): - self-loop count: 390
pnml2lts-mc( 0/ 4): - claim dead count: 108633
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 20426
pnml2lts-mc( 0/ 4): - cum. max stack depth: 40
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 20426 states 132070 transitions, fanout: 6.466
pnml2lts-mc( 0/ 4): Total exploration time 0.170 sec (0.170 sec minimum, 0.170 sec on average)
pnml2lts-mc( 0/ 4): States per second: 120153, Transitions per second: 776882
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.5MB, 24.6 B/state, compr.: 11.1%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 27 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.5MB (~256.0MB paged-in)

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-AN03"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is Sudoku-PT-AN03, 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 r536-tall-171690532700587"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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