Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r065-tajo-171620414700237.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is BugTracking-PT-q3m256, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r065-tajo-171620414700237
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 11K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.3K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 19 15:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 17:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 140K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 19 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 19 15:23 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 16M May 18 16:42 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 BugTracking-PT-q3m256-LTLCardinality-00
FORMULA_NAME BugTracking-PT-q3m256-LTLCardinality-01
FORMULA_NAME BugTracking-PT-q3m256-LTLCardinality-02
FORMULA_NAME BugTracking-PT-q3m256-LTLCardinality-03
FORMULA_NAME BugTracking-PT-q3m256-LTLCardinality-04
FORMULA_NAME BugTracking-PT-q3m256-LTLCardinality-05
FORMULA_NAME BugTracking-PT-q3m256-LTLCardinality-06
FORMULA_NAME BugTracking-PT-q3m256-LTLCardinality-07
FORMULA_NAME BugTracking-PT-q3m256-LTLCardinality-08
FORMULA_NAME BugTracking-PT-q3m256-LTLCardinality-09
FORMULA_NAME BugTracking-PT-q3m256-LTLCardinality-10
FORMULA_NAME BugTracking-PT-q3m256-LTLCardinality-11
FORMULA_NAME BugTracking-PT-q3m256-LTLCardinality-12
FORMULA_NAME BugTracking-PT-q3m256-LTLCardinality-13
FORMULA_NAME BugTracking-PT-q3m256-LTLCardinality-14
FORMULA_NAME BugTracking-PT-q3m256-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716644002430

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BugTracking-PT-q3m256
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-25 13:33:24] [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 13:33:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 13:33:25] [INFO ] Load time of PNML (sax parser for PT used): 814 ms
[2024-05-25 13:33:25] [INFO ] Transformed 754 places.
[2024-05-25 13:33:25] [INFO ] Transformed 27370 transitions.
[2024-05-25 13:33:25] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 988 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Deduced a syphon composed of 514 places in 134 ms
Reduce places removed 514 places and 24601 transitions.
FORMULA BugTracking-PT-q3m256-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 5 out of 240 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 240/240 places, 2769/2769 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 238 transition count 2769
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 237 transition count 2750
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 237 transition count 2750
Applied a total of 4 rules in 70 ms. Remains 237 /240 variables (removed 3) and now considering 2750/2769 (removed 19) transitions.
[2024-05-25 13:33:26] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
// Phase 1: matrix 2626 rows 237 cols
[2024-05-25 13:33:26] [INFO ] Computed 8 invariants in 37 ms
[2024-05-25 13:33:26] [INFO ] Implicit Places using invariants in 535 ms returned []
[2024-05-25 13:33:26] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
[2024-05-25 13:33:26] [INFO ] Invariant cache hit.
[2024-05-25 13:33:27] [INFO ] State equation strengthened by 240 read => feed constraints.
[2024-05-25 13:33:28] [INFO ] Implicit Places using invariants and state equation in 1618 ms returned []
Implicit Place search using SMT with State Equation took 2181 ms to find 0 implicit places.
[2024-05-25 13:33:28] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
[2024-05-25 13:33:28] [INFO ] Invariant cache hit.
[2024-05-25 13:33:29] [INFO ] Dead Transitions using invariants and state equation in 729 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 237/240 places, 2750/2769 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3000 ms. Remains : 237/240 places, 2750/2769 transitions.
Support contains 5 out of 237 places after structural reductions.
[2024-05-25 13:33:29] [INFO ] Flatten gal took : 250 ms
[2024-05-25 13:33:29] [INFO ] Flatten gal took : 143 ms
[2024-05-25 13:33:29] [INFO ] Input system was already deterministic with 2750 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 275 ms. (steps per millisecond=36 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2024-05-25 13:33:30] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
[2024-05-25 13:33:30] [INFO ] Invariant cache hit.
[2024-05-25 13:33:30] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-25 13:33:30] [INFO ] After 88ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-25 13:33:30] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-25 13:33:31] [INFO ] After 576ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-25 13:33:31] [INFO ] State equation strengthened by 240 read => feed constraints.
[2024-05-25 13:33:31] [INFO ] After 565ms SMT Verify possible using 240 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-25 13:33:31] [INFO ] Deduced a trap composed of 8 places in 68 ms of which 5 ms to minimize.
[2024-05-25 13:33:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 195 ms
[2024-05-25 13:33:32] [INFO ] Deduced a trap composed of 12 places in 293 ms of which 1 ms to minimize.
[2024-05-25 13:33:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 345 ms
[2024-05-25 13:33:32] [INFO ] Deduced a trap composed of 27 places in 205 ms of which 1 ms to minimize.
[2024-05-25 13:33:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 333 ms
[2024-05-25 13:33:32] [INFO ] After 1673ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 219 ms.
[2024-05-25 13:33:33] [INFO ] After 2560ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :3
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 343 ms.
Support contains 3 out of 237 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 237/237 places, 2750/2750 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 235 transition count 2753
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 10 place count 235 transition count 2747
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 16 place count 229 transition count 2747
Applied a total of 16 rules in 260 ms. Remains 229 /237 variables (removed 8) and now considering 2747/2750 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 261 ms. Remains : 229/237 places, 2747/2750 transitions.
Incomplete random walk after 10133 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1013 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :2
Running SMT prover for 1 properties.
[2024-05-25 13:33:33] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2024-05-25 13:33:33] [INFO ] Computed 8 invariants in 17 ms
[2024-05-25 13:33:33] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 13:33:33] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-25 13:33:34] [INFO ] After 413ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 13:33:34] [INFO ] State equation strengthened by 241 read => feed constraints.
[2024-05-25 13:33:34] [INFO ] After 203ms SMT Verify possible using 241 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 13:33:34] [INFO ] Deduced a trap composed of 10 places in 272 ms of which 1 ms to minimize.
[2024-05-25 13:33:35] [INFO ] Deduced a trap composed of 14 places in 235 ms of which 1 ms to minimize.
[2024-05-25 13:33:35] [INFO ] Deduced a trap composed of 36 places in 231 ms of which 0 ms to minimize.
[2024-05-25 13:33:35] [INFO ] Deduced a trap composed of 31 places in 209 ms of which 1 ms to minimize.
[2024-05-25 13:33:35] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1181 ms
[2024-05-25 13:33:35] [INFO ] After 1425ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 65 ms.
[2024-05-25 13:33:35] [INFO ] After 1960ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 229 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 50 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 229/229 places, 2747/2747 transitions.
Incomplete random walk after 10116 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2023 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 168243 steps, run timeout after 3001 ms. (steps per millisecond=56 ) properties seen :{}
Probabilistic random walk after 168243 steps, saw 85299 distinct states, run finished after 3002 ms. (steps per millisecond=56 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-25 13:33:38] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2024-05-25 13:33:38] [INFO ] Invariant cache hit.
[2024-05-25 13:33:38] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 13:33:38] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-25 13:33:39] [INFO ] After 433ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 13:33:39] [INFO ] State equation strengthened by 241 read => feed constraints.
[2024-05-25 13:33:39] [INFO ] After 274ms SMT Verify possible using 241 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 13:33:40] [INFO ] Deduced a trap composed of 10 places in 246 ms of which 0 ms to minimize.
[2024-05-25 13:33:40] [INFO ] Deduced a trap composed of 40 places in 256 ms of which 1 ms to minimize.
[2024-05-25 13:33:40] [INFO ] Deduced a trap composed of 36 places in 203 ms of which 1 ms to minimize.
[2024-05-25 13:33:40] [INFO ] Deduced a trap composed of 11 places in 276 ms of which 1 ms to minimize.
[2024-05-25 13:33:41] [INFO ] Deduced a trap composed of 24 places in 288 ms of which 0 ms to minimize.
[2024-05-25 13:33:41] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1628 ms
[2024-05-25 13:33:41] [INFO ] After 1958ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 137 ms.
[2024-05-25 13:33:41] [INFO ] After 2589ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 229 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 71 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73 ms. Remains : 229/229 places, 2747/2747 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 46 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
[2024-05-25 13:33:41] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2024-05-25 13:33:41] [INFO ] Invariant cache hit.
[2024-05-25 13:33:41] [INFO ] Implicit Places using invariants in 322 ms returned []
[2024-05-25 13:33:41] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2024-05-25 13:33:41] [INFO ] Invariant cache hit.
[2024-05-25 13:33:42] [INFO ] State equation strengthened by 241 read => feed constraints.
[2024-05-25 13:33:43] [INFO ] Implicit Places using invariants and state equation in 1727 ms returned []
Implicit Place search using SMT with State Equation took 2054 ms to find 0 implicit places.
[2024-05-25 13:33:43] [INFO ] Redundant transitions in 268 ms returned []
[2024-05-25 13:33:43] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2024-05-25 13:33:43] [INFO ] Invariant cache hit.
[2024-05-25 13:33:44] [INFO ] Dead Transitions using invariants and state equation in 794 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3180 ms. Remains : 229/229 places, 2747/2747 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 124 transitions
Reduce isomorphic transitions removed 130 transitions.
Iterating post reduction 0 with 130 rules applied. Total rules applied 130 place count 229 transition count 2617
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 134 place count 227 transition count 2615
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 135 place count 227 transition count 2614
Free-agglomeration rule applied 4 times.
Iterating global reduction 1 with 4 rules applied. Total rules applied 139 place count 227 transition count 2610
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 143 place count 223 transition count 2610
Applied a total of 143 rules in 379 ms. Remains 223 /229 variables (removed 6) and now considering 2610/2747 (removed 137) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2610 rows 223 cols
[2024-05-25 13:33:45] [INFO ] Computed 9 invariants in 33 ms
[2024-05-25 13:33:45] [INFO ] After 61ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 13:33:45] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-25 13:33:45] [INFO ] After 497ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 13:33:45] [INFO ] After 591ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 43 ms.
[2024-05-25 13:33:45] [INFO ] After 701ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Successfully simplified 1 atomic propositions for a total of 4 simplifications.
FORMULA BugTracking-PT-q3m256-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 6 stabilizing places and 111 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0||X(G(p1))))))'
Support contains 2 out of 237 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 237/237 places, 2750/2750 transitions.
Applied a total of 0 rules in 11 ms. Remains 237 /237 variables (removed 0) and now considering 2750/2750 (removed 0) transitions.
[2024-05-25 13:33:46] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
// Phase 1: matrix 2626 rows 237 cols
[2024-05-25 13:33:46] [INFO ] Computed 8 invariants in 9 ms
[2024-05-25 13:33:46] [INFO ] Implicit Places using invariants in 270 ms returned []
[2024-05-25 13:33:46] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
[2024-05-25 13:33:46] [INFO ] Invariant cache hit.
[2024-05-25 13:33:46] [INFO ] State equation strengthened by 240 read => feed constraints.
[2024-05-25 13:33:47] [INFO ] Implicit Places using invariants and state equation in 1632 ms returned []
Implicit Place search using SMT with State Equation took 1905 ms to find 0 implicit places.
[2024-05-25 13:33:47] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
[2024-05-25 13:33:47] [INFO ] Invariant cache hit.
[2024-05-25 13:33:48] [INFO ] Dead Transitions using invariants and state equation in 843 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2761 ms. Remains : 237/237 places, 2750/2750 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 300 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BugTracking-PT-q3m256-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=3, aps=[p0:(LEQ 1 s76), p1:(GT 3 s148)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, 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 866 steps with 0 reset in 55 ms.
FORMULA BugTracking-PT-q3m256-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BugTracking-PT-q3m256-LTLCardinality-01 finished in 3182 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 237 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 237/237 places, 2750/2750 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 235 transition count 2753
Applied a total of 4 rules in 91 ms. Remains 235 /237 variables (removed 2) and now considering 2753/2750 (removed -3) transitions.
[2024-05-25 13:33:49] [INFO ] Flow matrix only has 2624 transitions (discarded 129 similar events)
// Phase 1: matrix 2624 rows 235 cols
[2024-05-25 13:33:49] [INFO ] Computed 8 invariants in 11 ms
[2024-05-25 13:33:49] [INFO ] Implicit Places using invariants in 311 ms returned []
[2024-05-25 13:33:49] [INFO ] Flow matrix only has 2624 transitions (discarded 129 similar events)
[2024-05-25 13:33:49] [INFO ] Invariant cache hit.
[2024-05-25 13:33:50] [INFO ] State equation strengthened by 241 read => feed constraints.
[2024-05-25 13:33:51] [INFO ] Implicit Places using invariants and state equation in 1532 ms returned []
Implicit Place search using SMT with State Equation took 1846 ms to find 0 implicit places.
[2024-05-25 13:33:51] [INFO ] Redundant transitions in 116 ms returned []
[2024-05-25 13:33:51] [INFO ] Flow matrix only has 2624 transitions (discarded 129 similar events)
[2024-05-25 13:33:51] [INFO ] Invariant cache hit.
[2024-05-25 13:33:51] [INFO ] Dead Transitions using invariants and state equation in 714 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 235/237 places, 2753/2750 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2774 ms. Remains : 235/237 places, 2753/2750 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : BugTracking-PT-q3m256-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s37 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 22 reset in 714 ms.
Product exploration explored 100000 steps with 22 reset in 641 ms.
Computed a total of 6 stabilizing places and 111 stable transitions
Computed a total of 6 stabilizing places and 111 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 71 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 4 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 183092 steps, run timeout after 3001 ms. (steps per millisecond=61 ) properties seen :{}
Probabilistic random walk after 183092 steps, saw 87282 distinct states, run finished after 3001 ms. (steps per millisecond=61 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-25 13:33:56] [INFO ] Flow matrix only has 2624 transitions (discarded 129 similar events)
[2024-05-25 13:33:56] [INFO ] Invariant cache hit.
[2024-05-25 13:33:56] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 13:33:56] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-25 13:33:57] [INFO ] After 443ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 13:33:57] [INFO ] State equation strengthened by 241 read => feed constraints.
[2024-05-25 13:33:57] [INFO ] After 208ms SMT Verify possible using 241 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 13:33:57] [INFO ] Deduced a trap composed of 12 places in 184 ms of which 1 ms to minimize.
[2024-05-25 13:33:57] [INFO ] Deduced a trap composed of 12 places in 190 ms of which 0 ms to minimize.
[2024-05-25 13:33:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 503 ms
[2024-05-25 13:33:57] [INFO ] After 748ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 73 ms.
[2024-05-25 13:33:57] [INFO ] After 1314ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 49 ms.
Support contains 1 out of 235 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 235/235 places, 2753/2753 transitions.
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 235 transition count 2747
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 12 place count 229 transition count 2747
Applied a total of 12 rules in 86 ms. Remains 229 /235 variables (removed 6) and now considering 2747/2753 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 87 ms. Remains : 229/235 places, 2747/2753 transitions.
Incomplete random walk after 10163 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1693 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 185854 steps, run timeout after 3001 ms. (steps per millisecond=61 ) properties seen :{}
Probabilistic random walk after 185854 steps, saw 97101 distinct states, run finished after 3001 ms. (steps per millisecond=61 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-25 13:34:01] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2024-05-25 13:34:01] [INFO ] Computed 8 invariants in 17 ms
[2024-05-25 13:34:01] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 13:34:01] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-25 13:34:01] [INFO ] After 477ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 13:34:01] [INFO ] State equation strengthened by 241 read => feed constraints.
[2024-05-25 13:34:02] [INFO ] After 295ms SMT Verify possible using 241 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 13:34:02] [INFO ] Deduced a trap composed of 10 places in 271 ms of which 0 ms to minimize.
[2024-05-25 13:34:02] [INFO ] Deduced a trap composed of 14 places in 278 ms of which 0 ms to minimize.
[2024-05-25 13:34:03] [INFO ] Deduced a trap composed of 36 places in 265 ms of which 1 ms to minimize.
[2024-05-25 13:34:03] [INFO ] Deduced a trap composed of 31 places in 282 ms of which 1 ms to minimize.
[2024-05-25 13:34:03] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1474 ms
[2024-05-25 13:34:03] [INFO ] After 1845ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 83 ms.
[2024-05-25 13:34:03] [INFO ] After 2464ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 229 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 40 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 229/229 places, 2747/2747 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 39 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
[2024-05-25 13:34:03] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2024-05-25 13:34:03] [INFO ] Invariant cache hit.
[2024-05-25 13:34:03] [INFO ] Implicit Places using invariants in 277 ms returned []
[2024-05-25 13:34:04] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2024-05-25 13:34:04] [INFO ] Invariant cache hit.
[2024-05-25 13:34:04] [INFO ] State equation strengthened by 241 read => feed constraints.
[2024-05-25 13:34:05] [INFO ] Implicit Places using invariants and state equation in 1476 ms returned []
Implicit Place search using SMT with State Equation took 1755 ms to find 0 implicit places.
[2024-05-25 13:34:05] [INFO ] Redundant transitions in 71 ms returned []
[2024-05-25 13:34:05] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2024-05-25 13:34:05] [INFO ] Invariant cache hit.
[2024-05-25 13:34:06] [INFO ] Dead Transitions using invariants and state equation in 793 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2665 ms. Remains : 229/229 places, 2747/2747 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 124 transitions
Reduce isomorphic transitions removed 130 transitions.
Iterating post reduction 0 with 130 rules applied. Total rules applied 130 place count 229 transition count 2617
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 134 place count 227 transition count 2615
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 135 place count 227 transition count 2614
Free-agglomeration rule applied 4 times.
Iterating global reduction 1 with 4 rules applied. Total rules applied 139 place count 227 transition count 2610
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 143 place count 223 transition count 2610
Applied a total of 143 rules in 230 ms. Remains 223 /229 variables (removed 6) and now considering 2610/2747 (removed 137) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2610 rows 223 cols
[2024-05-25 13:34:06] [INFO ] Computed 9 invariants in 11 ms
[2024-05-25 13:34:06] [INFO ] After 50ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 13:34:06] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-25 13:34:07] [INFO ] After 493ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 13:34:07] [INFO ] After 573ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 42 ms.
[2024-05-25 13:34:07] [INFO ] After 666ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 103 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Support contains 1 out of 235 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 235/235 places, 2753/2753 transitions.
Applied a total of 0 rules in 29 ms. Remains 235 /235 variables (removed 0) and now considering 2753/2753 (removed 0) transitions.
[2024-05-25 13:34:07] [INFO ] Flow matrix only has 2624 transitions (discarded 129 similar events)
// Phase 1: matrix 2624 rows 235 cols
[2024-05-25 13:34:07] [INFO ] Computed 8 invariants in 15 ms
[2024-05-25 13:34:07] [INFO ] Implicit Places using invariants in 314 ms returned []
[2024-05-25 13:34:07] [INFO ] Flow matrix only has 2624 transitions (discarded 129 similar events)
[2024-05-25 13:34:07] [INFO ] Invariant cache hit.
[2024-05-25 13:34:08] [INFO ] State equation strengthened by 241 read => feed constraints.
[2024-05-25 13:34:09] [INFO ] Implicit Places using invariants and state equation in 1751 ms returned []
Implicit Place search using SMT with State Equation took 2070 ms to find 0 implicit places.
[2024-05-25 13:34:09] [INFO ] Redundant transitions in 67 ms returned []
[2024-05-25 13:34:09] [INFO ] Flow matrix only has 2624 transitions (discarded 129 similar events)
[2024-05-25 13:34:09] [INFO ] Invariant cache hit.
[2024-05-25 13:34:10] [INFO ] Dead Transitions using invariants and state equation in 821 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3000 ms. Remains : 235/235 places, 2753/2753 transitions.
Computed a total of 6 stabilizing places and 111 stable transitions
Computed a total of 6 stabilizing places and 111 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 91 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 159947 steps, run timeout after 3001 ms. (steps per millisecond=53 ) properties seen :{}
Probabilistic random walk after 159947 steps, saw 76299 distinct states, run finished after 3001 ms. (steps per millisecond=53 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-25 13:34:13] [INFO ] Flow matrix only has 2624 transitions (discarded 129 similar events)
[2024-05-25 13:34:13] [INFO ] Invariant cache hit.
[2024-05-25 13:34:13] [INFO ] After 66ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 13:34:13] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-25 13:34:14] [INFO ] After 509ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 13:34:14] [INFO ] State equation strengthened by 241 read => feed constraints.
[2024-05-25 13:34:14] [INFO ] After 253ms SMT Verify possible using 241 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 13:34:15] [INFO ] Deduced a trap composed of 12 places in 279 ms of which 0 ms to minimize.
[2024-05-25 13:34:15] [INFO ] Deduced a trap composed of 12 places in 257 ms of which 0 ms to minimize.
[2024-05-25 13:34:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 723 ms
[2024-05-25 13:34:15] [INFO ] After 1032ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 91 ms.
[2024-05-25 13:34:15] [INFO ] After 1696ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 49 ms.
Support contains 1 out of 235 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 235/235 places, 2753/2753 transitions.
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 235 transition count 2747
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 12 place count 229 transition count 2747
Applied a total of 12 rules in 101 ms. Remains 229 /235 variables (removed 6) and now considering 2747/2753 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 102 ms. Remains : 229/235 places, 2747/2753 transitions.
Incomplete random walk after 10123 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1687 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 178720 steps, run timeout after 3001 ms. (steps per millisecond=59 ) properties seen :{}
Probabilistic random walk after 178720 steps, saw 92319 distinct states, run finished after 3002 ms. (steps per millisecond=59 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-25 13:34:18] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2024-05-25 13:34:18] [INFO ] Computed 8 invariants in 20 ms
[2024-05-25 13:34:18] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 13:34:18] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-25 13:34:19] [INFO ] After 509ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 13:34:19] [INFO ] State equation strengthened by 241 read => feed constraints.
[2024-05-25 13:34:19] [INFO ] After 251ms SMT Verify possible using 241 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 13:34:20] [INFO ] Deduced a trap composed of 10 places in 289 ms of which 1 ms to minimize.
[2024-05-25 13:34:20] [INFO ] Deduced a trap composed of 14 places in 285 ms of which 1 ms to minimize.
[2024-05-25 13:34:20] [INFO ] Deduced a trap composed of 36 places in 281 ms of which 1 ms to minimize.
[2024-05-25 13:34:21] [INFO ] Deduced a trap composed of 31 places in 314 ms of which 2 ms to minimize.
[2024-05-25 13:34:21] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1527 ms
[2024-05-25 13:34:21] [INFO ] After 1845ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 100 ms.
[2024-05-25 13:34:21] [INFO ] After 2519ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 229 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 46 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 229/229 places, 2747/2747 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 68 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
[2024-05-25 13:34:21] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2024-05-25 13:34:21] [INFO ] Invariant cache hit.
[2024-05-25 13:34:21] [INFO ] Implicit Places using invariants in 384 ms returned []
[2024-05-25 13:34:21] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2024-05-25 13:34:21] [INFO ] Invariant cache hit.
[2024-05-25 13:34:22] [INFO ] State equation strengthened by 241 read => feed constraints.
[2024-05-25 13:34:23] [INFO ] Implicit Places using invariants and state equation in 1721 ms returned []
Implicit Place search using SMT with State Equation took 2109 ms to find 0 implicit places.
[2024-05-25 13:34:23] [INFO ] Redundant transitions in 94 ms returned []
[2024-05-25 13:34:23] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2024-05-25 13:34:23] [INFO ] Invariant cache hit.
[2024-05-25 13:34:24] [INFO ] Dead Transitions using invariants and state equation in 907 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3189 ms. Remains : 229/229 places, 2747/2747 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 124 transitions
Reduce isomorphic transitions removed 130 transitions.
Iterating post reduction 0 with 130 rules applied. Total rules applied 130 place count 229 transition count 2617
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 134 place count 227 transition count 2615
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 135 place count 227 transition count 2614
Free-agglomeration rule applied 4 times.
Iterating global reduction 1 with 4 rules applied. Total rules applied 139 place count 227 transition count 2610
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 143 place count 223 transition count 2610
Applied a total of 143 rules in 281 ms. Remains 223 /229 variables (removed 6) and now considering 2610/2747 (removed 137) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2610 rows 223 cols
[2024-05-25 13:34:24] [INFO ] Computed 9 invariants in 20 ms
[2024-05-25 13:34:24] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 13:34:25] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2024-05-25 13:34:25] [INFO ] After 495ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 13:34:25] [INFO ] After 629ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 53 ms.
[2024-05-25 13:34:25] [INFO ] After 747ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 116 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Product exploration explored 100000 steps with 22 reset in 703 ms.
Product exploration explored 100000 steps with 22 reset in 661 ms.
Built C files in :
/tmp/ltsmin18149372987836514061
[2024-05-25 13:34:27] [INFO ] Too many transitions (2753) to apply POR reductions. Disabling POR matrices.
[2024-05-25 13:34:27] [INFO ] Built C files in 57ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18149372987836514061
Running compilation step : cd /tmp/ltsmin18149372987836514061;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18149372987836514061;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18149372987836514061;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 1 out of 235 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 235/235 places, 2753/2753 transitions.
Applied a total of 0 rules in 56 ms. Remains 235 /235 variables (removed 0) and now considering 2753/2753 (removed 0) transitions.
[2024-05-25 13:34:30] [INFO ] Flow matrix only has 2624 transitions (discarded 129 similar events)
// Phase 1: matrix 2624 rows 235 cols
[2024-05-25 13:34:30] [INFO ] Computed 8 invariants in 17 ms
[2024-05-25 13:34:30] [INFO ] Implicit Places using invariants in 311 ms returned []
[2024-05-25 13:34:30] [INFO ] Flow matrix only has 2624 transitions (discarded 129 similar events)
[2024-05-25 13:34:30] [INFO ] Invariant cache hit.
[2024-05-25 13:34:31] [INFO ] State equation strengthened by 241 read => feed constraints.
[2024-05-25 13:34:32] [INFO ] Implicit Places using invariants and state equation in 1432 ms returned []
Implicit Place search using SMT with State Equation took 1746 ms to find 0 implicit places.
[2024-05-25 13:34:32] [INFO ] Redundant transitions in 46 ms returned []
[2024-05-25 13:34:32] [INFO ] Flow matrix only has 2624 transitions (discarded 129 similar events)
[2024-05-25 13:34:32] [INFO ] Invariant cache hit.
[2024-05-25 13:34:33] [INFO ] Dead Transitions using invariants and state equation in 905 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2758 ms. Remains : 235/235 places, 2753/2753 transitions.
Built C files in :
/tmp/ltsmin17179952160468251481
[2024-05-25 13:34:33] [INFO ] Too many transitions (2753) to apply POR reductions. Disabling POR matrices.
[2024-05-25 13:34:33] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17179952160468251481
Running compilation step : cd /tmp/ltsmin17179952160468251481;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17179952160468251481;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17179952160468251481;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-25 13:34:36] [INFO ] Flatten gal took : 202 ms
[2024-05-25 13:34:36] [INFO ] Flatten gal took : 174 ms
[2024-05-25 13:34:36] [INFO ] Time to serialize gal into /tmp/LTL3585961294161023584.gal : 34 ms
[2024-05-25 13:34:36] [INFO ] Time to serialize properties into /tmp/LTL9062607983702225956.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3585961294161023584.gal' '-t' 'CGAL' '-hoa' '/tmp/aut18055536115423947358.hoa' '-atoms' '/tmp/LTL9062607983702225956.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL9062607983702225956.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut18055536115423947358.hoa
Detected timeout of ITS tools.
[2024-05-25 13:34:52] [INFO ] Flatten gal took : 164 ms
[2024-05-25 13:34:52] [INFO ] Flatten gal took : 160 ms
[2024-05-25 13:34:52] [INFO ] Time to serialize gal into /tmp/LTL6953092018076058089.gal : 27 ms
[2024-05-25 13:34:52] [INFO ] Time to serialize properties into /tmp/LTL1184676145497465921.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6953092018076058089.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1184676145497465921.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F(G("(x0_FIXED_q3<=0)"))))
Formula 0 simplified : GF!"(x0_FIXED_q3<=0)"
Detected timeout of ITS tools.
[2024-05-25 13:35:07] [INFO ] Flatten gal took : 113 ms
[2024-05-25 13:35:07] [INFO ] Applying decomposition
[2024-05-25 13:35:07] [INFO ] Flatten gal took : 103 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph17551561056953102558.txt' '-o' '/tmp/graph17551561056953102558.bin' '-w' '/tmp/graph17551561056953102558.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph17551561056953102558.bin' '-l' '-1' '-v' '-w' '/tmp/graph17551561056953102558.weights' '-q' '0' '-e' '0.001'
[2024-05-25 13:35:08] [INFO ] Decomposing Gal with order
[2024-05-25 13:35:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 13:35:08] [INFO ] Removed a total of 346 redundant transitions.
[2024-05-25 13:35:08] [INFO ] Flatten gal took : 297 ms
[2024-05-25 13:35:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 279 labels/synchronizations in 17 ms.
[2024-05-25 13:35:08] [INFO ] Time to serialize gal into /tmp/LTL11877793629414797201.gal : 25 ms
[2024-05-25 13:35:08] [INFO ] Time to serialize properties into /tmp/LTL2866731943198696382.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11877793629414797201.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2866731943198696382.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F(G("(i0.u1.x0_FIXED_q3<=0)"))))
Formula 0 simplified : GF!"(i0.u1.x0_FIXED_q3<=0)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16921940735581534620
[2024-05-25 13:35:23] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16921940735581534620
Running compilation step : cd /tmp/ltsmin16921940735581534620;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16921940735581534620;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16921940735581534620;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property BugTracking-PT-q3m256-LTLCardinality-10 finished in 97396 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 237 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 237/237 places, 2750/2750 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 235 transition count 2753
Applied a total of 4 rules in 50 ms. Remains 235 /237 variables (removed 2) and now considering 2753/2750 (removed -3) transitions.
[2024-05-25 13:35:26] [INFO ] Flow matrix only has 2624 transitions (discarded 129 similar events)
[2024-05-25 13:35:26] [INFO ] Invariant cache hit.
[2024-05-25 13:35:26] [INFO ] Implicit Places using invariants in 313 ms returned []
[2024-05-25 13:35:26] [INFO ] Flow matrix only has 2624 transitions (discarded 129 similar events)
[2024-05-25 13:35:26] [INFO ] Invariant cache hit.
[2024-05-25 13:35:27] [INFO ] State equation strengthened by 241 read => feed constraints.
[2024-05-25 13:35:28] [INFO ] Implicit Places using invariants and state equation in 1549 ms returned []
Implicit Place search using SMT with State Equation took 1867 ms to find 0 implicit places.
[2024-05-25 13:35:28] [INFO ] Redundant transitions in 48 ms returned []
[2024-05-25 13:35:28] [INFO ] Flow matrix only has 2624 transitions (discarded 129 similar events)
[2024-05-25 13:35:28] [INFO ] Invariant cache hit.
[2024-05-25 13:35:29] [INFO ] Dead Transitions using invariants and state equation in 881 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 235/237 places, 2753/2750 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2858 ms. Remains : 235/237 places, 2753/2750 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : BugTracking-PT-q3m256-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 1 s127)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 4318 steps with 0 reset in 32 ms.
FORMULA BugTracking-PT-q3m256-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BugTracking-PT-q3m256-LTLCardinality-15 finished in 2948 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
[2024-05-25 13:35:29] [INFO ] Flatten gal took : 123 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin10172387275962025494
[2024-05-25 13:35:29] [INFO ] Too many transitions (2750) to apply POR reductions. Disabling POR matrices.
[2024-05-25 13:35:30] [INFO ] Applying decomposition
[2024-05-25 13:35:30] [INFO ] Built C files in 68ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10172387275962025494
Running compilation step : cd /tmp/ltsmin10172387275962025494;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-25 13:35:30] [INFO ] Flatten gal took : 92 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph14683680189582352118.txt' '-o' '/tmp/graph14683680189582352118.bin' '-w' '/tmp/graph14683680189582352118.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph14683680189582352118.bin' '-l' '-1' '-v' '-w' '/tmp/graph14683680189582352118.weights' '-q' '0' '-e' '0.001'
[2024-05-25 13:35:30] [INFO ] Decomposing Gal with order
[2024-05-25 13:35:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 13:35:30] [INFO ] Removed a total of 334 redundant transitions.
[2024-05-25 13:35:30] [INFO ] Flatten gal took : 199 ms
[2024-05-25 13:35:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 274 labels/synchronizations in 13 ms.
[2024-05-25 13:35:30] [INFO ] Time to serialize gal into /tmp/LTLCardinality8843403533302455066.gal : 24 ms
[2024-05-25 13:35:30] [INFO ] Time to serialize properties into /tmp/LTLCardinality14396881727372626159.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality8843403533302455066.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality14396881727372626159.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F(G("(i0.u1.x0_FIXED_q3<=0)"))))
Formula 0 simplified : GF!"(i0.u1.x0_FIXED_q3<=0)"
Compilation finished in 7730 ms.
Running link step : cd /tmp/ltsmin10172387275962025494;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 95 ms.
Running LTSmin : cd /tmp/ltsmin10172387275962025494;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-25 13:56:12] [INFO ] Flatten gal took : 262 ms
[2024-05-25 13:56:12] [INFO ] Time to serialize gal into /tmp/LTLCardinality15604553188666191704.gal : 41 ms
[2024-05-25 13:56:12] [INFO ] Time to serialize properties into /tmp/LTLCardinality17449769712228663477.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality15604553188666191704.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality17449769712228663477.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...299
Read 1 LTL properties
Checking formula 0 : !((F(G("(x0_FIXED_q3<=0)"))))
Formula 0 simplified : GF!"(x0_FIXED_q3<=0)"
Detected timeout of ITS tools.
[2024-05-25 14:16:54] [INFO ] Flatten gal took : 274 ms
[2024-05-25 14:16:55] [INFO ] Input system was already deterministic with 2750 transitions.
[2024-05-25 14:16:55] [INFO ] Transformed 237 places.
[2024-05-25 14:16:55] [INFO ] Transformed 2750 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-25 14:16:55] [INFO ] Time to serialize gal into /tmp/LTLCardinality3435088473432153564.gal : 25 ms
[2024-05-25 14:16:55] [INFO ] Time to serialize properties into /tmp/LTLCardinality2765044765017162319.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality3435088473432153564.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality2765044765017162319.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...342
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F(G("(x0_FIXED_q3<=0)"))))
Formula 0 simplified : GF!"(x0_FIXED_q3<=0)"
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 5217100 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16022668 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /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="BugTracking-PT-q3m256"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2023"
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 gold2023"
echo " Input is BugTracking-PT-q3m256, 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 r065-tajo-171620414700237"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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