Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2022-input.r006-tajo-165245689600636.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2022-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.....................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is BART-PT-040, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r006-tajo-165245689600636
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 38M
-rw-r--r-- 1 mcc users 2.1M Apr 29 21:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 7.1M Apr 29 21:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3M Apr 29 20:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 7.3M Apr 29 20:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 1.5M May 9 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 3.8M May 9 07:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 909K May 9 07:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 2.5M May 9 07:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 326K May 9 07:06 UpperBounds.txt
-rw-r--r-- 1 mcc users 658K May 9 07:06 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 9.5M May 10 09:33 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1652668030370

Running Version 202205111006
[2022-05-16 02:27:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-16 02:27:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 02:27:12] [INFO ] Load time of PNML (sax parser for PT used): 633 ms
[2022-05-16 02:27:12] [INFO ] Transformed 5490 places.
[2022-05-16 02:27:12] [INFO ] Transformed 8080 transitions.
[2022-05-16 02:27:12] [INFO ] Found NUPN structural information;
[2022-05-16 02:27:12] [INFO ] Parsed PT model containing 5490 places and 8080 transitions in 807 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 116 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Reduce places removed 210 places and 0 transitions.
FORMULA BART-PT-040-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-040-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-040-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-040-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-040-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 3162 out of 5280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5280/5280 places, 8080/8080 transitions.
Applied a total of 0 rules in 302 ms. Remains 5280 /5280 variables (removed 0) and now considering 8080/8080 (removed 0) transitions.
// Phase 1: matrix 8080 rows 5280 cols
[2022-05-16 02:27:13] [INFO ] Computed 40 place invariants in 71 ms
[2022-05-16 02:27:14] [INFO ] Implicit Places using invariants in 1147 ms returned []
// Phase 1: matrix 8080 rows 5280 cols
[2022-05-16 02:27:14] [INFO ] Computed 40 place invariants in 33 ms
[2022-05-16 02:27:15] [INFO ] Implicit Places using invariants and state equation in 917 ms returned []
Implicit Place search using SMT with State Equation took 2104 ms to find 0 implicit places.
// Phase 1: matrix 8080 rows 5280 cols
[2022-05-16 02:27:15] [INFO ] Computed 40 place invariants in 55 ms
[2022-05-16 02:27:20] [INFO ] Dead Transitions using invariants and state equation in 4634 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5280/5280 places, 8080/8080 transitions.
Support contains 3162 out of 5280 places after structural reductions.
[2022-05-16 02:27:21] [INFO ] Flatten gal took : 557 ms
[2022-05-16 02:27:21] [INFO ] Flatten gal took : 317 ms
[2022-05-16 02:27:22] [INFO ] Input system was already deterministic with 8080 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 355 ms. (steps per millisecond=28 ) properties (out of 22) seen :20
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
// Phase 1: matrix 8080 rows 5280 cols
[2022-05-16 02:27:23] [INFO ] Computed 40 place invariants in 83 ms
[2022-05-16 02:27:24] [INFO ] [Real]Absence check using 40 positive place invariants in 93 ms returned sat
[2022-05-16 02:27:27] [INFO ] After 3389ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-16 02:27:28] [INFO ] After 4008ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 371 ms.
[2022-05-16 02:27:28] [INFO ] After 5641ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Finished Parikh walk after 234 steps, including 0 resets, run visited all 1 properties in 23 ms. (steps per millisecond=10 )
Parikh walk visited 1 properties in 51 ms.
FORMULA BART-PT-040-LTLFireability-13 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 40 out of 5280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5280/5280 places, 8080/8080 transitions.
Discarding 1280 places :
Symmetric choice reduction at 0 with 1280 rule applications. Total rules 1280 place count 4000 transition count 6800
Iterating global reduction 0 with 1280 rules applied. Total rules applied 2560 place count 4000 transition count 6800
Discarding 1080 places :
Symmetric choice reduction at 0 with 1080 rule applications. Total rules 3640 place count 2920 transition count 5720
Iterating global reduction 0 with 1080 rules applied. Total rules applied 4720 place count 2920 transition count 5720
Discarding 160 places :
Symmetric choice reduction at 0 with 160 rule applications. Total rules 4880 place count 2760 transition count 5560
Iterating global reduction 0 with 160 rules applied. Total rules applied 5040 place count 2760 transition count 5560
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 5160 place count 2640 transition count 5440
Iterating global reduction 0 with 120 rules applied. Total rules applied 5280 place count 2640 transition count 5440
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 5400 place count 2520 transition count 5320
Iterating global reduction 0 with 120 rules applied. Total rules applied 5520 place count 2520 transition count 5320
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 5640 place count 2400 transition count 5200
Iterating global reduction 0 with 120 rules applied. Total rules applied 5760 place count 2400 transition count 5200
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 5880 place count 2280 transition count 5080
Iterating global reduction 0 with 120 rules applied. Total rules applied 6000 place count 2280 transition count 5080
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 6120 place count 2160 transition count 4960
Iterating global reduction 0 with 120 rules applied. Total rules applied 6240 place count 2160 transition count 4960
Discarding 80 places :
Symmetric choice reduction at 0 with 80 rule applications. Total rules 6320 place count 2080 transition count 4880
Iterating global reduction 0 with 80 rules applied. Total rules applied 6400 place count 2080 transition count 4880
Discarding 80 places :
Symmetric choice reduction at 0 with 80 rule applications. Total rules 6480 place count 2000 transition count 4800
Iterating global reduction 0 with 80 rules applied. Total rules applied 6560 place count 2000 transition count 4800
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 6600 place count 1960 transition count 4760
Iterating global reduction 0 with 40 rules applied. Total rules applied 6640 place count 1960 transition count 4760
Applied a total of 6640 rules in 2089 ms. Remains 1960 /5280 variables (removed 3320) and now considering 4760/8080 (removed 3320) transitions.
// Phase 1: matrix 4760 rows 1960 cols
[2022-05-16 02:27:31] [INFO ] Computed 40 place invariants in 26 ms
[2022-05-16 02:27:31] [INFO ] Implicit Places using invariants in 374 ms returned []
// Phase 1: matrix 4760 rows 1960 cols
[2022-05-16 02:27:32] [INFO ] Computed 40 place invariants in 23 ms
[2022-05-16 02:27:32] [INFO ] Implicit Places using invariants and state equation in 832 ms returned []
Implicit Place search using SMT with State Equation took 1208 ms to find 0 implicit places.
// Phase 1: matrix 4760 rows 1960 cols
[2022-05-16 02:27:32] [INFO ] Computed 40 place invariants in 17 ms
[2022-05-16 02:27:34] [INFO ] Dead Transitions using invariants and state equation in 2027 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1960/5280 places, 4760/8080 transitions.
Finished structural reductions, in 1 iterations. Remains : 1960/5280 places, 4760/8080 transitions.
Stuttering acceptance computed with spot in 158 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BART-PT-040-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s6 1) (EQ s27 1) (EQ s25 1) (EQ s30 1) (EQ s35 1) (EQ s20 1) (EQ s0 1) (EQ s12 1) (EQ s36 1) (EQ s22 1) (EQ s16 1) (EQ s5 1) (EQ s2 1) (EQ s34 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 48 steps with 0 reset in 7 ms.
FORMULA BART-PT-040-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-040-LTLFireability-00 finished in 5583 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(X(p0))||X(p0)))'
Support contains 40 out of 5280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5280/5280 places, 8080/8080 transitions.
Discarding 1280 places :
Symmetric choice reduction at 0 with 1280 rule applications. Total rules 1280 place count 4000 transition count 6800
Iterating global reduction 0 with 1280 rules applied. Total rules applied 2560 place count 4000 transition count 6800
Discarding 1080 places :
Symmetric choice reduction at 0 with 1080 rule applications. Total rules 3640 place count 2920 transition count 5720
Iterating global reduction 0 with 1080 rules applied. Total rules applied 4720 place count 2920 transition count 5720
Discarding 160 places :
Symmetric choice reduction at 0 with 160 rule applications. Total rules 4880 place count 2760 transition count 5560
Iterating global reduction 0 with 160 rules applied. Total rules applied 5040 place count 2760 transition count 5560
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 5160 place count 2640 transition count 5440
Iterating global reduction 0 with 120 rules applied. Total rules applied 5280 place count 2640 transition count 5440
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 5400 place count 2520 transition count 5320
Iterating global reduction 0 with 120 rules applied. Total rules applied 5520 place count 2520 transition count 5320
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 5640 place count 2400 transition count 5200
Iterating global reduction 0 with 120 rules applied. Total rules applied 5760 place count 2400 transition count 5200
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 5880 place count 2280 transition count 5080
Iterating global reduction 0 with 120 rules applied. Total rules applied 6000 place count 2280 transition count 5080
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 6120 place count 2160 transition count 4960
Iterating global reduction 0 with 120 rules applied. Total rules applied 6240 place count 2160 transition count 4960
Discarding 80 places :
Symmetric choice reduction at 0 with 80 rule applications. Total rules 6320 place count 2080 transition count 4880
Iterating global reduction 0 with 80 rules applied. Total rules applied 6400 place count 2080 transition count 4880
Discarding 80 places :
Symmetric choice reduction at 0 with 80 rule applications. Total rules 6480 place count 2000 transition count 4800
Iterating global reduction 0 with 80 rules applied. Total rules applied 6560 place count 2000 transition count 4800
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 6600 place count 1960 transition count 4760
Iterating global reduction 0 with 40 rules applied. Total rules applied 6640 place count 1960 transition count 4760
Applied a total of 6640 rules in 1737 ms. Remains 1960 /5280 variables (removed 3320) and now considering 4760/8080 (removed 3320) transitions.
// Phase 1: matrix 4760 rows 1960 cols
[2022-05-16 02:27:36] [INFO ] Computed 40 place invariants in 32 ms
[2022-05-16 02:27:37] [INFO ] Implicit Places using invariants in 414 ms returned []
// Phase 1: matrix 4760 rows 1960 cols
[2022-05-16 02:27:37] [INFO ] Computed 40 place invariants in 16 ms
[2022-05-16 02:27:38] [INFO ] Implicit Places using invariants and state equation in 816 ms returned []
Implicit Place search using SMT with State Equation took 1234 ms to find 0 implicit places.
// Phase 1: matrix 4760 rows 1960 cols
[2022-05-16 02:27:38] [INFO ] Computed 40 place invariants in 15 ms
[2022-05-16 02:27:39] [INFO ] Dead Transitions using invariants and state equation in 1779 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1960/5280 places, 4760/8080 transitions.
Finished structural reductions, in 1 iterations. Remains : 1960/5280 places, 4760/8080 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : BART-PT-040-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s65 1) (EQ s64 1) (EQ s67 1) (EQ s66 1) (EQ s69 1) (EQ s68 1) (EQ s71 1) (EQ s70 1) (EQ s73 1) (EQ s72 1) (EQ s75 1) (EQ s74 1) (EQ s77 1) (EQ ...], 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA BART-PT-040-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-040-LTLFireability-01 finished in 4849 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(X(p1))&&p0)))'
Support contains 400 out of 5280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5280/5280 places, 8080/8080 transitions.
Discarding 920 places :
Symmetric choice reduction at 0 with 920 rule applications. Total rules 920 place count 4360 transition count 7160
Iterating global reduction 0 with 920 rules applied. Total rules applied 1840 place count 4360 transition count 7160
Discarding 760 places :
Symmetric choice reduction at 0 with 760 rule applications. Total rules 2600 place count 3600 transition count 6400
Iterating global reduction 0 with 760 rules applied. Total rules applied 3360 place count 3600 transition count 6400
Applied a total of 3360 rules in 608 ms. Remains 3600 /5280 variables (removed 1680) and now considering 6400/8080 (removed 1680) transitions.
// Phase 1: matrix 6400 rows 3600 cols
[2022-05-16 02:27:40] [INFO ] Computed 40 place invariants in 23 ms
[2022-05-16 02:27:40] [INFO ] Implicit Places using invariants in 413 ms returned []
// Phase 1: matrix 6400 rows 3600 cols
[2022-05-16 02:27:40] [INFO ] Computed 40 place invariants in 43 ms
[2022-05-16 02:27:41] [INFO ] Implicit Places using invariants and state equation in 1068 ms returned []
Implicit Place search using SMT with State Equation took 1487 ms to find 0 implicit places.
// Phase 1: matrix 6400 rows 3600 cols
[2022-05-16 02:27:42] [INFO ] Computed 40 place invariants in 38 ms
[2022-05-16 02:27:45] [INFO ] Dead Transitions using invariants and state equation in 3160 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3600/5280 places, 6400/8080 transitions.
Finished structural reductions, in 1 iterations. Remains : 3600/5280 places, 6400/8080 transitions.
Stuttering acceptance computed with spot in 171 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : BART-PT-040-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 2}, { cond=(NOT p0), acceptance={0} source=0 dest: 3}], [{ cond=p0, acceptance={0} source=1 dest: 0}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 1}]], initial=1, aps=[p0:(AND (EQ s6 0) (EQ s27 0) (EQ s25 0) (EQ s30 0) (EQ s35 0) (EQ s20 0) (EQ s0 0) (EQ s12 0) (EQ s36 0) (EQ s22 0) (EQ s16 0) (EQ s5 0) (EQ s2 0) (EQ s34...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 1382 reset in 3291 ms.
Product exploration explored 100000 steps with 1382 reset in 3219 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 4 factoid took 247 ms. Reduced automaton from 4 states, 8 edges and 2 AP to 4 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 124 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Finished random walk after 45 steps, including 0 resets, run visited all 3 properties in 12 ms. (steps per millisecond=3 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F p0), (F (NOT (AND (NOT p1) (NOT p0)))), (F (AND (NOT p1) p0))]
Knowledge based reduction with 4 factoid took 218 ms. Reduced automaton from 4 states, 8 edges and 2 AP to 4 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 152 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 135 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
// Phase 1: matrix 6400 rows 3600 cols
[2022-05-16 02:27:55] [INFO ] Computed 40 place invariants in 42 ms
[2022-05-16 02:27:58] [INFO ] [Real]Absence check using 40 positive place invariants in 4 ms returned unsat
Proved EG (NOT p0)
// Phase 1: matrix 6400 rows 3600 cols
[2022-05-16 02:27:58] [INFO ] Computed 40 place invariants in 29 ms
[2022-05-16 02:28:09] [INFO ] [Real]Absence check using 40 positive place invariants in 72 ms returned sat
[2022-05-16 02:28:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 02:28:13] [INFO ] [Real]Absence check using state equation in 4120 ms returned unknown
Could not prove EG (NOT p1)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F p0), (F (NOT (AND (NOT p1) (NOT p0)))), (F (AND (NOT p1) p0)), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 4 factoid took 140 ms. Reduced automaton from 4 states, 8 edges and 2 AP to 1 states, 1 edges and 0 AP.
FORMULA BART-PT-040-LTLFireability-02 FALSE TECHNIQUES KNOWLEDGE
Treatment of property BART-PT-040-LTLFireability-02 finished in 33874 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2720 out of 5280 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5280/5280 places, 8080/8080 transitions.
Drop transitions removed 120 transitions
Trivial Post-agglo rules discarded 120 transitions
Performed 120 trivial Post agglomeration. Transition count delta: 120
Iterating post reduction 0 with 120 rules applied. Total rules applied 120 place count 5280 transition count 7960
Reduce places removed 120 places and 0 transitions.
Performed 1080 Post agglomeration using F-continuation condition.Transition count delta: 1080
Iterating post reduction 1 with 1200 rules applied. Total rules applied 1320 place count 5160 transition count 6880
Reduce places removed 1080 places and 0 transitions.
Iterating post reduction 2 with 1080 rules applied. Total rules applied 2400 place count 4080 transition count 6880
Discarding 40 places :
Symmetric choice reduction at 3 with 40 rule applications. Total rules 2440 place count 4040 transition count 6840
Iterating global reduction 3 with 40 rules applied. Total rules applied 2480 place count 4040 transition count 6840
Performed 160 Post agglomeration using F-continuation condition.Transition count delta: 160
Deduced a syphon composed of 160 places in 1 ms
Reduce places removed 160 places and 0 transitions.
Iterating global reduction 3 with 320 rules applied. Total rules applied 2800 place count 3880 transition count 6680
Applied a total of 2800 rules in 838 ms. Remains 3880 /5280 variables (removed 1400) and now considering 6680/8080 (removed 1400) transitions.
// Phase 1: matrix 6680 rows 3880 cols
[2022-05-16 02:28:14] [INFO ] Computed 40 place invariants in 67 ms
[2022-05-16 02:28:15] [INFO ] Implicit Places using invariants in 471 ms returned []
// Phase 1: matrix 6680 rows 3880 cols
[2022-05-16 02:28:15] [INFO ] Computed 40 place invariants in 49 ms
[2022-05-16 02:28:16] [INFO ] Implicit Places using invariants and state equation in 1088 ms returned []
Implicit Place search using SMT with State Equation took 1576 ms to find 0 implicit places.
[2022-05-16 02:28:16] [INFO ] Redundant transitions in 618 ms returned []
// Phase 1: matrix 6680 rows 3880 cols
[2022-05-16 02:28:16] [INFO ] Computed 40 place invariants in 43 ms
[2022-05-16 02:28:20] [INFO ] Dead Transitions using invariants and state equation in 3340 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3880/5280 places, 6680/8080 transitions.
Finished structural reductions, in 1 iterations. Remains : 3880/5280 places, 6680/8080 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : BART-PT-040-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s290 1) (EQ s444 1) (EQ s3524 1) (EQ s1450 1) (EQ s2048 1) (EQ s2646 1) (EQ s3244 1) (EQ s1026 1) (EQ s459 1) (EQ s1727 1) (EQ s2063 1) (EQ s32...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 50000 reset in 9341 ms.
Product exploration explored 100000 steps with 50000 reset in 9404 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 2 factoid took 96 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA BART-PT-040-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BART-PT-040-LTLFireability-03 finished in 28324 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(X((X(G((X(p0) U p1)))||(!G(p2) U p2))))))'
Support contains 3120 out of 5280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5280/5280 places, 8080/8080 transitions.
Applied a total of 0 rules in 120 ms. Remains 5280 /5280 variables (removed 0) and now considering 8080/8080 (removed 0) transitions.
// Phase 1: matrix 8080 rows 5280 cols
[2022-05-16 02:28:42] [INFO ] Computed 40 place invariants in 39 ms
[2022-05-16 02:28:43] [INFO ] Implicit Places using invariants in 837 ms returned []
// Phase 1: matrix 8080 rows 5280 cols
[2022-05-16 02:28:43] [INFO ] Computed 40 place invariants in 40 ms
[2022-05-16 02:28:43] [INFO ] Implicit Places using invariants and state equation in 855 ms returned []
Implicit Place search using SMT with State Equation took 1694 ms to find 0 implicit places.
// Phase 1: matrix 8080 rows 5280 cols
[2022-05-16 02:28:43] [INFO ] Computed 40 place invariants in 59 ms
[2022-05-16 02:28:44] [INFO ] Dead Transitions using invariants and state equation in 820 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5280/5280 places, 8080/8080 transitions.
Stuttering acceptance computed with spot in 306 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2)]
Running random walk in product with property : BART-PT-040-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(NOT p2), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=4 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p2:(OR (EQ s330 1) (EQ s524 1) (EQ s4724 1) (EQ s1970 1) (EQ s2768 1) (EQ s3566 1) (EQ s4364 1) (EQ s1306 1) (EQ s539 1) (EQ s2327 1) (EQ s2783 1) (EQ s43...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 1208 ms.
Product exploration explored 100000 steps with 0 reset in 1438 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), true]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2))]
Knowledge based reduction with 2 factoid took 141 ms. Reduced automaton from 6 states, 8 edges and 3 AP to 6 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 243 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 158 ms. (steps per millisecond=63 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 561 ms. (steps per millisecond=17 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 8080 rows 5280 cols
[2022-05-16 02:28:51] [INFO ] Computed 40 place invariants in 60 ms
[2022-05-16 02:28:54] [INFO ] [Real]Absence check using 40 positive place invariants in 68 ms returned sat
[2022-05-16 02:28:58] [INFO ] After 3433ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-16 02:28:58] [INFO ] After 4116ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 338 ms.
[2022-05-16 02:28:59] [INFO ] After 5656ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Finished Parikh walk after 478 steps, including 0 resets, run visited all 1 properties in 11 ms. (steps per millisecond=43 )
Parikh walk visited 1 properties in 14 ms.
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), true]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (F (AND (NOT p2) (NOT p0))), (F p2), (F (NOT (AND (NOT p2) (NOT p1) p0))), (F (NOT (AND (NOT p2) (NOT p1))))]
Knowledge based reduction with 2 factoid took 237 ms. Reduced automaton from 6 states, 8 edges and 3 AP to 6 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 215 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2)]
Stuttering acceptance computed with spot in 207 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2)]
// Phase 1: matrix 8080 rows 5280 cols
[2022-05-16 02:29:11] [INFO ] Computed 40 place invariants in 60 ms
Could not prove EG (AND (NOT p1) (NOT p2))
Support contains 3120 out of 5280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5280/5280 places, 8080/8080 transitions.
Applied a total of 0 rules in 238 ms. Remains 5280 /5280 variables (removed 0) and now considering 8080/8080 (removed 0) transitions.
// Phase 1: matrix 8080 rows 5280 cols
[2022-05-16 02:29:26] [INFO ] Computed 40 place invariants in 52 ms
[2022-05-16 02:29:27] [INFO ] Implicit Places using invariants in 1004 ms returned []
// Phase 1: matrix 8080 rows 5280 cols
[2022-05-16 02:29:27] [INFO ] Computed 40 place invariants in 27 ms
[2022-05-16 02:29:28] [INFO ] Implicit Places using invariants and state equation in 820 ms returned []
Implicit Place search using SMT with State Equation took 1838 ms to find 0 implicit places.
// Phase 1: matrix 8080 rows 5280 cols
[2022-05-16 02:29:28] [INFO ] Computed 40 place invariants in 59 ms
[2022-05-16 02:29:29] [INFO ] Dead Transitions using invariants and state equation in 958 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5280/5280 places, 8080/8080 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), true]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2))]
Knowledge based reduction with 2 factoid took 166 ms. Reduced automaton from 6 states, 8 edges and 3 AP to 6 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 241 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 173 ms. (steps per millisecond=57 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 844 ms. (steps per millisecond=11 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 8080 rows 5280 cols
[2022-05-16 02:29:34] [INFO ] Computed 40 place invariants in 53 ms
[2022-05-16 02:29:36] [INFO ] [Real]Absence check using 40 positive place invariants in 67 ms returned sat
[2022-05-16 02:29:40] [INFO ] After 3570ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-16 02:29:41] [INFO ] After 4189ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 331 ms.
[2022-05-16 02:29:41] [INFO ] After 5668ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Finished Parikh walk after 478 steps, including 0 resets, run visited all 1 properties in 12 ms. (steps per millisecond=39 )
Parikh walk visited 1 properties in 13 ms.
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), true]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (F (AND (NOT p2) (NOT p0))), (F p2), (F (NOT (AND (NOT p2) (NOT p1) p0))), (F (NOT (AND (NOT p2) (NOT p1))))]
Knowledge based reduction with 2 factoid took 213 ms. Reduced automaton from 6 states, 8 edges and 3 AP to 6 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 215 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2)]
Stuttering acceptance computed with spot in 204 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2)]
// Phase 1: matrix 8080 rows 5280 cols
[2022-05-16 02:29:52] [INFO ] Computed 40 place invariants in 62 ms
Could not prove EG (AND (NOT p1) (NOT p2))
Stuttering acceptance computed with spot in 217 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2)]
Product exploration explored 100000 steps with 0 reset in 1791 ms.
Product exploration explored 100000 steps with 0 reset in 1672 ms.
Applying partial POR strategy [false, false, false, false, true, true]
Stuttering acceptance computed with spot in 205 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2)]
Support contains 3120 out of 5280 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5280/5280 places, 8080/8080 transitions.
Performed 920 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 920 rules applied. Total rules applied 920 place count 5280 transition count 8080
Deduced a syphon composed of 920 places in 1 ms
Applied a total of 920 rules in 610 ms. Remains 5280 /5280 variables (removed 0) and now considering 8080/8080 (removed 0) transitions.
[2022-05-16 02:30:13] [INFO ] Redundant transitions in 1030 ms returned []
// Phase 1: matrix 8080 rows 5280 cols
[2022-05-16 02:30:13] [INFO ] Computed 40 place invariants in 54 ms
[2022-05-16 02:30:14] [INFO ] Dead Transitions using invariants and state equation in 1020 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5280/5280 places, 8080/8080 transitions.
Finished structural reductions, in 1 iterations. Remains : 5280/5280 places, 8080/8080 transitions.
Product exploration explored 100000 steps with 0 reset in 1148 ms.
Product exploration explored 100000 steps with 0 reset in 1274 ms.
Built C files in :
/tmp/ltsmin2812162848963450069
[2022-05-16 02:30:17] [INFO ] Built C files in 80ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2812162848963450069
Running compilation step : cd /tmp/ltsmin2812162848963450069;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin2812162848963450069;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin2812162848963450069;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 3120 out of 5280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5280/5280 places, 8080/8080 transitions.
Applied a total of 0 rules in 184 ms. Remains 5280 /5280 variables (removed 0) and now considering 8080/8080 (removed 0) transitions.
// Phase 1: matrix 8080 rows 5280 cols
[2022-05-16 02:30:20] [INFO ] Computed 40 place invariants in 36 ms
[2022-05-16 02:30:20] [INFO ] Implicit Places using invariants in 716 ms returned []
// Phase 1: matrix 8080 rows 5280 cols
[2022-05-16 02:30:20] [INFO ] Computed 40 place invariants in 39 ms
[2022-05-16 02:30:22] [INFO ] Implicit Places using invariants and state equation in 1326 ms returned []
Implicit Place search using SMT with State Equation took 2056 ms to find 0 implicit places.
// Phase 1: matrix 8080 rows 5280 cols
[2022-05-16 02:30:22] [INFO ] Computed 40 place invariants in 32 ms
[2022-05-16 02:30:23] [INFO ] Dead Transitions using invariants and state equation in 1399 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5280/5280 places, 8080/8080 transitions.
Built C files in :
/tmp/ltsmin11376725224698404831
[2022-05-16 02:30:23] [INFO ] Built C files in 145ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11376725224698404831
Running compilation step : cd /tmp/ltsmin11376725224698404831;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin11376725224698404831;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin11376725224698404831;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-16 02:30:27] [INFO ] Flatten gal took : 347 ms
[2022-05-16 02:30:28] [INFO ] Flatten gal took : 235 ms
[2022-05-16 02:30:28] [INFO ] Time to serialize gal into /tmp/LTL14625402420716054882.gal : 57 ms
[2022-05-16 02:30:28] [INFO ] Time to serialize properties into /tmp/LTL5897198858495795474.ltl : 21 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14625402420716054882.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5897198858495795474.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1462540...267
Read 1 LTL properties
Checking formula 0 : !((X(G(X((X(G((X("((((((((((((TrainState_7_0_0==1)||(TrainState_28_0_0==1))||((TrainState_26_0_0==1)||(TrainState_31_0_0==1)))||(((Tra...191284
Formula 0 simplified : !XGX(XG(X"((((((((((((TrainState_7_0_0==1)||(TrainState_28_0_0==1))||((TrainState_26_0_0==1)||(TrainState_31_0_0==1)))||(((TrainStat...191265
Detected timeout of ITS tools.
[2022-05-16 02:30:43] [INFO ] Flatten gal took : 186 ms
[2022-05-16 02:30:43] [INFO ] Applying decomposition
[2022-05-16 02:30:43] [INFO ] Flatten gal took : 257 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph15325769423565920738.txt' '-o' '/tmp/graph15325769423565920738.bin' '-w' '/tmp/graph15325769423565920738.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph15325769423565920738.bin' '-l' '-1' '-v' '-w' '/tmp/graph15325769423565920738.weights' '-q' '0' '-e' '0.001'
[2022-05-16 02:30:45] [INFO ] Decomposing Gal with order
[2022-05-16 02:30:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 02:30:47] [INFO ] Removed a total of 576 redundant transitions.
[2022-05-16 02:30:48] [INFO ] Flatten gal took : 1339 ms
[2022-05-16 02:30:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 100 ms.
[2022-05-16 02:30:54] [INFO ] Time to serialize gal into /tmp/LTL17650919328263447593.gal : 98 ms
[2022-05-16 02:30:54] [INFO ] Time to serialize properties into /tmp/LTL1818956570174062858.ltl : 33 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17650919328263447593.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1818956570174062858.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1765091...246
Read 1 LTL properties
Checking formula 0 : !((X(G(X((X(G((X("((((((((((((i0.i0.u116.TrainState_7_0_0==1)||(i19.i0.u123.TrainState_28_0_0==1))||((i37.i0.u98.TrainState_26_0_0==1)...276089
Formula 0 simplified : !XGX(XG(X"((((((((((((i0.i0.u116.TrainState_7_0_0==1)||(i19.i0.u123.TrainState_28_0_0==1))||((i37.i0.u98.TrainState_26_0_0==1)||(i8....276070
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
45 unique states visited
0 strongly connected components in search stack
45 transitions explored
44 items max in DFS search stack
1125 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,11.8299,242104,1,0,406518,9373,41205,788466,2178,20542,684260
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA BART-PT-040-LTLFireability-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property BART-PT-040-LTLFireability-07 finished in 145860 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U !F((F(p0)&&X(p1))))&&X(F(p2))))'
Support contains 3 out of 5280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5280/5280 places, 8080/8080 transitions.
Discarding 1278 places :
Symmetric choice reduction at 0 with 1278 rule applications. Total rules 1278 place count 4002 transition count 6802
Iterating global reduction 0 with 1278 rules applied. Total rules applied 2556 place count 4002 transition count 6802
Discarding 1077 places :
Symmetric choice reduction at 0 with 1077 rule applications. Total rules 3633 place count 2925 transition count 5725
Iterating global reduction 0 with 1077 rules applied. Total rules applied 4710 place count 2925 transition count 5725
Discarding 158 places :
Symmetric choice reduction at 0 with 158 rule applications. Total rules 4868 place count 2767 transition count 5567
Iterating global reduction 0 with 158 rules applied. Total rules applied 5026 place count 2767 transition count 5567
Discarding 118 places :
Symmetric choice reduction at 0 with 118 rule applications. Total rules 5144 place count 2649 transition count 5449
Iterating global reduction 0 with 118 rules applied. Total rules applied 5262 place count 2649 transition count 5449
Discarding 118 places :
Symmetric choice reduction at 0 with 118 rule applications. Total rules 5380 place count 2531 transition count 5331
Iterating global reduction 0 with 118 rules applied. Total rules applied 5498 place count 2531 transition count 5331
Discarding 118 places :
Symmetric choice reduction at 0 with 118 rule applications. Total rules 5616 place count 2413 transition count 5213
Iterating global reduction 0 with 118 rules applied. Total rules applied 5734 place count 2413 transition count 5213
Discarding 118 places :
Symmetric choice reduction at 0 with 118 rule applications. Total rules 5852 place count 2295 transition count 5095
Iterating global reduction 0 with 118 rules applied. Total rules applied 5970 place count 2295 transition count 5095
Discarding 118 places :
Symmetric choice reduction at 0 with 118 rule applications. Total rules 6088 place count 2177 transition count 4977
Iterating global reduction 0 with 118 rules applied. Total rules applied 6206 place count 2177 transition count 4977
Discarding 78 places :
Symmetric choice reduction at 0 with 78 rule applications. Total rules 6284 place count 2099 transition count 4899
Iterating global reduction 0 with 78 rules applied. Total rules applied 6362 place count 2099 transition count 4899
Discarding 78 places :
Symmetric choice reduction at 0 with 78 rule applications. Total rules 6440 place count 2021 transition count 4821
Iterating global reduction 0 with 78 rules applied. Total rules applied 6518 place count 2021 transition count 4821
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 6558 place count 1981 transition count 4781
Iterating global reduction 0 with 40 rules applied. Total rules applied 6598 place count 1981 transition count 4781
Applied a total of 6598 rules in 1411 ms. Remains 1981 /5280 variables (removed 3299) and now considering 4781/8080 (removed 3299) transitions.
// Phase 1: matrix 4781 rows 1981 cols
[2022-05-16 02:31:09] [INFO ] Computed 40 place invariants in 25 ms
[2022-05-16 02:31:09] [INFO ] Implicit Places using invariants in 429 ms returned []
// Phase 1: matrix 4781 rows 1981 cols
[2022-05-16 02:31:09] [INFO ] Computed 40 place invariants in 13 ms
[2022-05-16 02:31:10] [INFO ] Implicit Places using invariants and state equation in 1170 ms returned []
Implicit Place search using SMT with State Equation took 1611 ms to find 0 implicit places.
// Phase 1: matrix 4781 rows 1981 cols
[2022-05-16 02:31:10] [INFO ] Computed 40 place invariants in 13 ms
[2022-05-16 02:31:12] [INFO ] Dead Transitions using invariants and state equation in 1684 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1981/5280 places, 4781/8080 transitions.
Finished structural reductions, in 1 iterations. Remains : 1981/5280 places, 4781/8080 transitions.
Stuttering acceptance computed with spot in 314 ms :[(OR (NOT p2) (AND p0 p1)), (AND p0 p1), (NOT p2), (AND p0 p1), (AND p0 p1), false, p1, true, (AND p0 (NOT p1))]
Running random walk in product with property : BART-PT-040-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}, { cond=p0, acceptance={} source=0 dest: 4}, { cond=p0, acceptance={} source=0 dest: 5}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 6}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 p1), acceptance={} source=3 dest: 7}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 8}], [{ cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 3}, { cond=(AND p0 p1), acceptance={0} source=4 dest: 4}, { cond=(AND p0 p1), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=5 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 5}], [{ cond=p1, acceptance={} source=6 dest: 7}], [{ cond=true, acceptance={0} source=7 dest: 7}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=8 dest: 7}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=8 dest: 8}]], initial=0, aps=[p0:(EQ s970 1), p2:(EQ s321 1), p1:(EQ s320 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 216 reset in 857 ms.
Product exploration explored 100000 steps with 237 reset in 762 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (NOT p2)), (X (AND (NOT p0) (NOT p1))), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p2))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 12 factoid took 991 ms. Reduced automaton from 9 states, 23 edges and 3 AP to 6 states, 11 edges and 3 AP.
Stuttering acceptance computed with spot in 227 ms :[(OR (NOT p2) (AND p0 p1)), (AND p1 p0), (NOT p2), (AND (NOT p0) p1), true, (AND p0 (NOT p1))]
Finished random walk after 1894 steps, including 0 resets, run visited all 6 properties in 58 ms. (steps per millisecond=32 )
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (NOT p2)), (X (AND (NOT p0) (NOT p1))), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p2))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F p2), (F (AND (NOT p0) p1)), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (AND p0 p1)), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 12 factoid took 876 ms. Reduced automaton from 6 states, 11 edges and 3 AP to 6 states, 11 edges and 3 AP.
Stuttering acceptance computed with spot in 197 ms :[(OR (NOT p2) (AND p0 p1)), (AND p1 p0), (NOT p2), (AND (NOT p0) p1), true, (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 197 ms :[(OR (NOT p2) (AND p0 p1)), (AND p1 p0), (NOT p2), (AND (NOT p0) p1), true, (AND p0 (NOT p1))]
// Phase 1: matrix 4781 rows 1981 cols
[2022-05-16 02:31:19] [INFO ] Computed 40 place invariants in 26 ms
[2022-05-16 02:31:20] [INFO ] [Real]Absence check using 40 positive place invariants in 2 ms returned unsat
Proved EG (NOT p2)
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (NOT p2)), (X (AND (NOT p0) (NOT p1))), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p2))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F p2), (F (AND (NOT p0) p1)), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (AND p0 p1)), (F (AND p0 (NOT p1))), (G (NOT p2))]
Property proved to be false thanks to negative knowledge :(G (NOT p2))
Knowledge based reduction with 12 factoid took 386 ms. Reduced automaton from 6 states, 11 edges and 3 AP to 1 states, 1 edges and 0 AP.
FORMULA BART-PT-040-LTLFireability-08 FALSE TECHNIQUES KNOWLEDGE
Treatment of property BART-PT-040-LTLFireability-08 finished in 12883 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 5280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5280/5280 places, 8080/8080 transitions.
Discarding 1280 places :
Symmetric choice reduction at 0 with 1280 rule applications. Total rules 1280 place count 4000 transition count 6800
Iterating global reduction 0 with 1280 rules applied. Total rules applied 2560 place count 4000 transition count 6800
Discarding 1080 places :
Symmetric choice reduction at 0 with 1080 rule applications. Total rules 3640 place count 2920 transition count 5720
Iterating global reduction 0 with 1080 rules applied. Total rules applied 4720 place count 2920 transition count 5720
Discarding 160 places :
Symmetric choice reduction at 0 with 160 rule applications. Total rules 4880 place count 2760 transition count 5560
Iterating global reduction 0 with 160 rules applied. Total rules applied 5040 place count 2760 transition count 5560
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 5160 place count 2640 transition count 5440
Iterating global reduction 0 with 120 rules applied. Total rules applied 5280 place count 2640 transition count 5440
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 5400 place count 2520 transition count 5320
Iterating global reduction 0 with 120 rules applied. Total rules applied 5520 place count 2520 transition count 5320
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 5640 place count 2400 transition count 5200
Iterating global reduction 0 with 120 rules applied. Total rules applied 5760 place count 2400 transition count 5200
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 5880 place count 2280 transition count 5080
Iterating global reduction 0 with 120 rules applied. Total rules applied 6000 place count 2280 transition count 5080
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 6120 place count 2160 transition count 4960
Iterating global reduction 0 with 120 rules applied. Total rules applied 6240 place count 2160 transition count 4960
Discarding 80 places :
Symmetric choice reduction at 0 with 80 rule applications. Total rules 6320 place count 2080 transition count 4880
Iterating global reduction 0 with 80 rules applied. Total rules applied 6400 place count 2080 transition count 4880
Discarding 80 places :
Symmetric choice reduction at 0 with 80 rule applications. Total rules 6480 place count 2000 transition count 4800
Iterating global reduction 0 with 80 rules applied. Total rules applied 6560 place count 2000 transition count 4800
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 6600 place count 1960 transition count 4760
Iterating global reduction 0 with 40 rules applied. Total rules applied 6640 place count 1960 transition count 4760
Applied a total of 6640 rules in 1166 ms. Remains 1960 /5280 variables (removed 3320) and now considering 4760/8080 (removed 3320) transitions.
// Phase 1: matrix 4760 rows 1960 cols
[2022-05-16 02:31:22] [INFO ] Computed 40 place invariants in 25 ms
[2022-05-16 02:31:22] [INFO ] Implicit Places using invariants in 290 ms returned []
// Phase 1: matrix 4760 rows 1960 cols
[2022-05-16 02:31:22] [INFO ] Computed 40 place invariants in 27 ms
[2022-05-16 02:31:22] [INFO ] Implicit Places using invariants and state equation in 665 ms returned []
Implicit Place search using SMT with State Equation took 964 ms to find 0 implicit places.
// Phase 1: matrix 4760 rows 1960 cols
[2022-05-16 02:31:22] [INFO ] Computed 40 place invariants in 25 ms
[2022-05-16 02:31:24] [INFO ] Dead Transitions using invariants and state equation in 1933 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1960/5280 places, 4760/8080 transitions.
Finished structural reductions, in 1 iterations. Remains : 1960/5280 places, 4760/8080 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BART-PT-040-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s34 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 6945 reset in 1229 ms.
Product exploration explored 100000 steps with 6754 reset in 1207 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 148 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 2 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Finished random walk after 41 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=20 )
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 183 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 2 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 1960 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1960/1960 places, 4760/4760 transitions.
Applied a total of 0 rules in 78 ms. Remains 1960 /1960 variables (removed 0) and now considering 4760/4760 (removed 0) transitions.
// Phase 1: matrix 4760 rows 1960 cols
[2022-05-16 02:31:29] [INFO ] Computed 40 place invariants in 27 ms
[2022-05-16 02:31:29] [INFO ] Implicit Places using invariants in 305 ms returned []
// Phase 1: matrix 4760 rows 1960 cols
[2022-05-16 02:31:29] [INFO ] Computed 40 place invariants in 27 ms
[2022-05-16 02:31:30] [INFO ] Implicit Places using invariants and state equation in 1302 ms returned []
Implicit Place search using SMT with State Equation took 1610 ms to find 0 implicit places.
// Phase 1: matrix 4760 rows 1960 cols
[2022-05-16 02:31:30] [INFO ] Computed 40 place invariants in 28 ms
[2022-05-16 02:31:32] [INFO ] Dead Transitions using invariants and state equation in 1826 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1960/1960 places, 4760/4760 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 128 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 2 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0), (NOT p0)]
Finished random walk after 35 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=17 )
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 102 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 2 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 43 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 44 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 6665 reset in 1135 ms.
Product exploration explored 100000 steps with 7235 reset in 1427 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 1960 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1960/1960 places, 4760/4760 transitions.
Graph (trivial) has 4723 edges and 1960 vertex of which 1911 / 1960 are part of one of the 39 SCC in 6 ms
Free SCC test removed 1872 places
Ensure Unique test removed 4602 transitions
Reduce isomorphic transitions removed 4602 transitions.
Reduce places removed 39 places and 0 transitions.
Ensure Unique test removed 38 transitions
Reduce isomorphic transitions removed 38 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 40 rules applied. Total rules applied 41 place count 49 transition count 120
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 41 place count 49 transition count 120
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 42 place count 49 transition count 120
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 44 place count 47 transition count 118
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 46 place count 47 transition count 118
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 11 places in 0 ms
Iterating global reduction 1 with 10 rules applied. Total rules applied 56 place count 47 transition count 119
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 59 place count 47 transition count 116
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 67 place count 39 transition count 108
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 2 with 8 rules applied. Total rules applied 75 place count 39 transition count 108
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 76 place count 39 transition count 108
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 78 place count 39 transition count 106
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 79 place count 38 transition count 105
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 80 place count 38 transition count 105
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 81 place count 38 transition count 105
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 83 place count 38 transition count 103
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 84 place count 37 transition count 102
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 85 place count 37 transition count 102
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 86 place count 37 transition count 102
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 88 place count 37 transition count 100
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 89 place count 36 transition count 99
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 5 with 1 rules applied. Total rules applied 90 place count 36 transition count 99
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 5 with 1 rules applied. Total rules applied 91 place count 36 transition count 99
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 93 place count 36 transition count 97
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 94 place count 35 transition count 96
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 6 with 1 rules applied. Total rules applied 95 place count 35 transition count 96
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 6 with 1 rules applied. Total rules applied 96 place count 35 transition count 96
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 98 place count 35 transition count 94
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 99 place count 34 transition count 93
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 7 with 1 rules applied. Total rules applied 100 place count 34 transition count 93
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 7 with 1 rules applied. Total rules applied 101 place count 34 transition count 93
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 103 place count 34 transition count 91
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 104 place count 33 transition count 90
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 8 with 1 rules applied. Total rules applied 105 place count 33 transition count 90
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 8 with 1 rules applied. Total rules applied 106 place count 33 transition count 90
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 108 place count 33 transition count 88
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 109 place count 32 transition count 87
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 9 with 1 rules applied. Total rules applied 110 place count 32 transition count 87
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 13 ms
Iterating global reduction 9 with 1 rules applied. Total rules applied 111 place count 32 transition count 87
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 113 place count 32 transition count 85
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 114 place count 31 transition count 84
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 10 with 1 rules applied. Total rules applied 115 place count 31 transition count 84
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 10 with 1 rules applied. Total rules applied 116 place count 31 transition count 84
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 118 place count 31 transition count 82
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 119 place count 30 transition count 81
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 11 with 1 rules applied. Total rules applied 120 place count 30 transition count 81
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 11 with 1 rules applied. Total rules applied 121 place count 30 transition count 81
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 123 place count 30 transition count 79
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 124 place count 29 transition count 78
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 12 with 1 rules applied. Total rules applied 125 place count 29 transition count 78
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 12 with 1 rules applied. Total rules applied 126 place count 29 transition count 78
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 128 place count 29 transition count 76
Discarding 1 places :
Symmetric choice reduction at 13 with 1 rule applications. Total rules 129 place count 28 transition count 75
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 13 with 1 rules applied. Total rules applied 130 place count 28 transition count 75
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 13 with 1 rules applied. Total rules applied 131 place count 28 transition count 75
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 13 with 2 rules applied. Total rules applied 133 place count 28 transition count 73
Discarding 1 places :
Symmetric choice reduction at 14 with 1 rule applications. Total rules 134 place count 27 transition count 72
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 14 with 1 rules applied. Total rules applied 135 place count 27 transition count 72
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 14 with 1 rules applied. Total rules applied 136 place count 27 transition count 72
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 14 with 2 rules applied. Total rules applied 138 place count 27 transition count 70
Discarding 1 places :
Symmetric choice reduction at 15 with 1 rule applications. Total rules 139 place count 26 transition count 69
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 15 with 1 rules applied. Total rules applied 140 place count 26 transition count 69
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 15 with 1 rules applied. Total rules applied 141 place count 26 transition count 69
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 15 with 2 rules applied. Total rules applied 143 place count 26 transition count 67
Discarding 1 places :
Symmetric choice reduction at 16 with 1 rule applications. Total rules 144 place count 25 transition count 66
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 16 with 1 rules applied. Total rules applied 145 place count 25 transition count 66
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 16 with 1 rules applied. Total rules applied 146 place count 25 transition count 66
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 16 with 2 rules applied. Total rules applied 148 place count 25 transition count 64
Discarding 1 places :
Symmetric choice reduction at 17 with 1 rule applications. Total rules 149 place count 24 transition count 63
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 17 with 1 rules applied. Total rules applied 150 place count 24 transition count 63
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 17 with 1 rules applied. Total rules applied 151 place count 24 transition count 63
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 17 with 2 rules applied. Total rules applied 153 place count 24 transition count 61
Discarding 1 places :
Symmetric choice reduction at 18 with 1 rule applications. Total rules 154 place count 23 transition count 60
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 18 with 1 rules applied. Total rules applied 155 place count 23 transition count 60
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 18 with 1 rules applied. Total rules applied 156 place count 23 transition count 60
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 18 with 2 rules applied. Total rules applied 158 place count 23 transition count 58
Discarding 1 places :
Symmetric choice reduction at 19 with 1 rule applications. Total rules 159 place count 22 transition count 57
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 19 with 1 rules applied. Total rules applied 160 place count 22 transition count 57
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 19 with 1 rules applied. Total rules applied 161 place count 22 transition count 57
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 19 with 2 rules applied. Total rules applied 163 place count 22 transition count 55
Discarding 1 places :
Symmetric choice reduction at 20 with 1 rule applications. Total rules 164 place count 21 transition count 54
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 20 with 1 rules applied. Total rules applied 165 place count 21 transition count 54
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 20 with 1 rules applied. Total rules applied 166 place count 21 transition count 54
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 20 with 2 rules applied. Total rules applied 168 place count 21 transition count 52
Discarding 1 places :
Symmetric choice reduction at 21 with 1 rule applications. Total rules 169 place count 20 transition count 51
Deduced a syphon composed of 3 places in 1 ms
Iterating global reduction 21 with 1 rules applied. Total rules applied 170 place count 20 transition count 51
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 21 with 1 rules applied. Total rules applied 171 place count 20 transition count 51
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 21 with 2 rules applied. Total rules applied 173 place count 20 transition count 49
Discarding 1 places :
Symmetric choice reduction at 22 with 1 rule applications. Total rules 174 place count 19 transition count 48
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 22 with 1 rules applied. Total rules applied 175 place count 19 transition count 48
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 22 with 1 rules applied. Total rules applied 176 place count 19 transition count 48
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 22 with 2 rules applied. Total rules applied 178 place count 19 transition count 46
Discarding 1 places :
Symmetric choice reduction at 23 with 1 rule applications. Total rules 179 place count 18 transition count 45
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 23 with 1 rules applied. Total rules applied 180 place count 18 transition count 45
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 23 with 1 rules applied. Total rules applied 181 place count 18 transition count 45
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 23 with 2 rules applied. Total rules applied 183 place count 18 transition count 43
Discarding 1 places :
Symmetric choice reduction at 24 with 1 rule applications. Total rules 184 place count 17 transition count 42
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 24 with 1 rules applied. Total rules applied 185 place count 17 transition count 42
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 24 with 1 rules applied. Total rules applied 186 place count 17 transition count 42
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 24 with 2 rules applied. Total rules applied 188 place count 17 transition count 40
Discarding 1 places :
Symmetric choice reduction at 25 with 1 rule applications. Total rules 189 place count 16 transition count 39
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 25 with 1 rules applied. Total rules applied 190 place count 16 transition count 39
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 25 with 1 rules applied. Total rules applied 191 place count 16 transition count 39
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 25 with 2 rules applied. Total rules applied 193 place count 16 transition count 37
Discarding 1 places :
Symmetric choice reduction at 26 with 1 rule applications. Total rules 194 place count 15 transition count 36
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 26 with 1 rules applied. Total rules applied 195 place count 15 transition count 36
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 26 with 1 rules applied. Total rules applied 196 place count 15 transition count 36
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 26 with 2 rules applied. Total rules applied 198 place count 15 transition count 34
Discarding 1 places :
Symmetric choice reduction at 27 with 1 rule applications. Total rules 199 place count 14 transition count 33
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 27 with 1 rules applied. Total rules applied 200 place count 14 transition count 33
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 27 with 1 rules applied. Total rules applied 201 place count 14 transition count 33
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 27 with 2 rules applied. Total rules applied 203 place count 14 transition count 31
Discarding 1 places :
Symmetric choice reduction at 28 with 1 rule applications. Total rules 204 place count 13 transition count 30
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 28 with 1 rules applied. Total rules applied 205 place count 13 transition count 30
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 28 with 1 rules applied. Total rules applied 206 place count 13 transition count 30
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 28 with 2 rules applied. Total rules applied 208 place count 13 transition count 28
Discarding 1 places :
Symmetric choice reduction at 29 with 1 rule applications. Total rules 209 place count 12 transition count 27
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 29 with 1 rules applied. Total rules applied 210 place count 12 transition count 27
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 29 with 1 rules applied. Total rules applied 211 place count 12 transition count 27
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 29 with 2 rules applied. Total rules applied 213 place count 12 transition count 25
Discarding 1 places :
Symmetric choice reduction at 30 with 1 rule applications. Total rules 214 place count 11 transition count 24
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 30 with 1 rules applied. Total rules applied 215 place count 11 transition count 24
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 30 with 1 rules applied. Total rules applied 216 place count 11 transition count 24
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 30 with 2 rules applied. Total rules applied 218 place count 11 transition count 22
Discarding 1 places :
Symmetric choice reduction at 31 with 1 rule applications. Total rules 219 place count 10 transition count 21
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 31 with 1 rules applied. Total rules applied 220 place count 10 transition count 21
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 31 with 1 rules applied. Total rules applied 221 place count 10 transition count 21
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 31 with 2 rules applied. Total rules applied 223 place count 10 transition count 19
Discarding 1 places :
Symmetric choice reduction at 32 with 1 rule applications. Total rules 224 place count 9 transition count 18
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 32 with 1 rules applied. Total rules applied 225 place count 9 transition count 18
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 32 with 1 rules applied. Total rules applied 226 place count 9 transition count 18
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 32 with 2 rules applied. Total rules applied 228 place count 9 transition count 16
Discarding 1 places :
Symmetric choice reduction at 33 with 1 rule applications. Total rules 229 place count 8 transition count 15
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 33 with 1 rules applied. Total rules applied 230 place count 8 transition count 15
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 33 with 1 rules applied. Total rules applied 231 place count 8 transition count 15
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 33 with 2 rules applied. Total rules applied 233 place count 8 transition count 13
Discarding 1 places :
Symmetric choice reduction at 34 with 1 rule applications. Total rules 234 place count 7 transition count 12
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 34 with 1 rules applied. Total rules applied 235 place count 7 transition count 12
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 34 with 1 rules applied. Total rules applied 236 place count 7 transition count 12
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 34 with 2 rules applied. Total rules applied 238 place count 7 transition count 10
Discarding 1 places :
Symmetric choice reduction at 35 with 1 rule applications. Total rules 239 place count 6 transition count 9
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 35 with 1 rules applied. Total rules applied 240 place count 6 transition count 9
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 35 with 1 rules applied. Total rules applied 241 place count 6 transition count 9
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 35 with 2 rules applied. Total rules applied 243 place count 6 transition count 7
Discarding 2 places :
Symmetric choice reduction at 36 with 2 rule applications. Total rules 245 place count 4 transition count 5
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 36 with 2 rules applied. Total rules applied 247 place count 4 transition count 5
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 247 rules in 131 ms. Remains 4 /1960 variables (removed 1956) and now considering 5/4760 (removed 4755) transitions.
[2022-05-16 02:31:37] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 5 rows 4 cols
[2022-05-16 02:31:37] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 02:31:37] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/1960 places, 5/4760 transitions.
Finished structural reductions, in 1 iterations. Remains : 4/1960 places, 5/4760 transitions.
Stuttering criterion allowed to conclude after 17 steps with 8 reset in 2 ms.
FORMULA BART-PT-040-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-040-LTLFireability-09 finished in 16702 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((G(X(G(p0)))||G(p1)||p2)))))'
Support contains 3 out of 5280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5280/5280 places, 8080/8080 transitions.
Discarding 1280 places :
Symmetric choice reduction at 0 with 1280 rule applications. Total rules 1280 place count 4000 transition count 6800
Iterating global reduction 0 with 1280 rules applied. Total rules applied 2560 place count 4000 transition count 6800
Discarding 1080 places :
Symmetric choice reduction at 0 with 1080 rule applications. Total rules 3640 place count 2920 transition count 5720
Iterating global reduction 0 with 1080 rules applied. Total rules applied 4720 place count 2920 transition count 5720
Discarding 160 places :
Symmetric choice reduction at 0 with 160 rule applications. Total rules 4880 place count 2760 transition count 5560
Iterating global reduction 0 with 160 rules applied. Total rules applied 5040 place count 2760 transition count 5560
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 5160 place count 2640 transition count 5440
Iterating global reduction 0 with 120 rules applied. Total rules applied 5280 place count 2640 transition count 5440
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 5400 place count 2520 transition count 5320
Iterating global reduction 0 with 120 rules applied. Total rules applied 5520 place count 2520 transition count 5320
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 5640 place count 2400 transition count 5200
Iterating global reduction 0 with 120 rules applied. Total rules applied 5760 place count 2400 transition count 5200
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 5880 place count 2280 transition count 5080
Iterating global reduction 0 with 120 rules applied. Total rules applied 6000 place count 2280 transition count 5080
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 6120 place count 2160 transition count 4960
Iterating global reduction 0 with 120 rules applied. Total rules applied 6240 place count 2160 transition count 4960
Discarding 80 places :
Symmetric choice reduction at 0 with 80 rule applications. Total rules 6320 place count 2080 transition count 4880
Iterating global reduction 0 with 80 rules applied. Total rules applied 6400 place count 2080 transition count 4880
Discarding 80 places :
Symmetric choice reduction at 0 with 80 rule applications. Total rules 6480 place count 2000 transition count 4800
Iterating global reduction 0 with 80 rules applied. Total rules applied 6560 place count 2000 transition count 4800
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 6600 place count 1960 transition count 4760
Iterating global reduction 0 with 40 rules applied. Total rules applied 6640 place count 1960 transition count 4760
Applied a total of 6640 rules in 1139 ms. Remains 1960 /5280 variables (removed 3320) and now considering 4760/8080 (removed 3320) transitions.
// Phase 1: matrix 4760 rows 1960 cols
[2022-05-16 02:31:38] [INFO ] Computed 40 place invariants in 10 ms
[2022-05-16 02:31:38] [INFO ] Implicit Places using invariants in 231 ms returned []
// Phase 1: matrix 4760 rows 1960 cols
[2022-05-16 02:31:38] [INFO ] Computed 40 place invariants in 26 ms
[2022-05-16 02:31:39] [INFO ] Implicit Places using invariants and state equation in 788 ms returned []
Implicit Place search using SMT with State Equation took 1034 ms to find 0 implicit places.
// Phase 1: matrix 4760 rows 1960 cols
[2022-05-16 02:31:39] [INFO ] Computed 40 place invariants in 15 ms
[2022-05-16 02:31:41] [INFO ] Dead Transitions using invariants and state equation in 2118 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1960/5280 places, 4760/8080 transitions.
Finished structural reductions, in 1 iterations. Remains : 1960/5280 places, 4760/8080 transitions.
Stuttering acceptance computed with spot in 183 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (NOT p1)]
Running random walk in product with property : BART-PT-040-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 0}, { cond=(AND p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 5}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 6}], [{ cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 1}, { cond=p2, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=(NOT p0), acceptance={} source=5 dest: 0}, { cond=p0, acceptance={} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={} source=6 dest: 0}, { cond=p1, acceptance={} source=6 dest: 6}]], initial=4, aps=[p1:(EQ s1276 0), p0:(EQ s251 1), p2:(EQ s55 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 22 steps with 0 reset in 2 ms.
FORMULA BART-PT-040-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-040-LTLFireability-10 finished in 4513 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!(p0 U (X(!X(F(G(p1))))&&G(X(p2)))))'
Support contains 3 out of 5280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5280/5280 places, 8080/8080 transitions.
Discarding 1280 places :
Symmetric choice reduction at 0 with 1280 rule applications. Total rules 1280 place count 4000 transition count 6800
Iterating global reduction 0 with 1280 rules applied. Total rules applied 2560 place count 4000 transition count 6800
Discarding 1079 places :
Symmetric choice reduction at 0 with 1079 rule applications. Total rules 3639 place count 2921 transition count 5721
Iterating global reduction 0 with 1079 rules applied. Total rules applied 4718 place count 2921 transition count 5721
Discarding 160 places :
Symmetric choice reduction at 0 with 160 rule applications. Total rules 4878 place count 2761 transition count 5561
Iterating global reduction 0 with 160 rules applied. Total rules applied 5038 place count 2761 transition count 5561
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 5158 place count 2641 transition count 5441
Iterating global reduction 0 with 120 rules applied. Total rules applied 5278 place count 2641 transition count 5441
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 5398 place count 2521 transition count 5321
Iterating global reduction 0 with 120 rules applied. Total rules applied 5518 place count 2521 transition count 5321
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 5638 place count 2401 transition count 5201
Iterating global reduction 0 with 120 rules applied. Total rules applied 5758 place count 2401 transition count 5201
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 5878 place count 2281 transition count 5081
Iterating global reduction 0 with 120 rules applied. Total rules applied 5998 place count 2281 transition count 5081
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 6118 place count 2161 transition count 4961
Iterating global reduction 0 with 120 rules applied. Total rules applied 6238 place count 2161 transition count 4961
Discarding 80 places :
Symmetric choice reduction at 0 with 80 rule applications. Total rules 6318 place count 2081 transition count 4881
Iterating global reduction 0 with 80 rules applied. Total rules applied 6398 place count 2081 transition count 4881
Discarding 80 places :
Symmetric choice reduction at 0 with 80 rule applications. Total rules 6478 place count 2001 transition count 4801
Iterating global reduction 0 with 80 rules applied. Total rules applied 6558 place count 2001 transition count 4801
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 6598 place count 1961 transition count 4761
Iterating global reduction 0 with 40 rules applied. Total rules applied 6638 place count 1961 transition count 4761
Applied a total of 6638 rules in 1599 ms. Remains 1961 /5280 variables (removed 3319) and now considering 4761/8080 (removed 3319) transitions.
// Phase 1: matrix 4761 rows 1961 cols
[2022-05-16 02:31:43] [INFO ] Computed 40 place invariants in 28 ms
[2022-05-16 02:31:43] [INFO ] Implicit Places using invariants in 312 ms returned []
// Phase 1: matrix 4761 rows 1961 cols
[2022-05-16 02:31:43] [INFO ] Computed 40 place invariants in 23 ms
[2022-05-16 02:31:44] [INFO ] Implicit Places using invariants and state equation in 854 ms returned []
Implicit Place search using SMT with State Equation took 1172 ms to find 0 implicit places.
// Phase 1: matrix 4761 rows 1961 cols
[2022-05-16 02:31:44] [INFO ] Computed 40 place invariants in 14 ms
[2022-05-16 02:31:46] [INFO ] Dead Transitions using invariants and state equation in 1920 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1961/5280 places, 4761/8080 transitions.
Finished structural reductions, in 1 iterations. Remains : 1961/5280 places, 4761/8080 transitions.
Stuttering acceptance computed with spot in 48 ms :[(AND (NOT p1) p2), (AND p2 (NOT p1))]
Running random walk in product with property : BART-PT-040-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p2 p1), acceptance={} source=1 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s25 1), p2:(AND (EQ s26 1) (EQ s25 1)), p1:(EQ s1160 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 6676 reset in 4090 ms.
Product exploration explored 100000 steps with 6640 reset in 4136 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (NOT (AND p2 p1))), true]
False Knowledge obtained : [(X (AND p2 (NOT p1))), (X (NOT (AND p2 (NOT p1)))), (X p0), (X (NOT p0)), (X (X (AND p2 p1))), (X (X (NOT (AND p2 p1)))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 3 factoid took 235 ms. Reduced automaton from 2 states, 4 edges and 3 AP to 2 states, 4 edges and 3 AP.
Stuttering acceptance computed with spot in 60 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 4761 rows 1961 cols
[2022-05-16 02:31:56] [INFO ] Computed 40 place invariants in 27 ms
[2022-05-16 02:31:56] [INFO ] [Real]Absence check using 40 positive place invariants in 15 ms returned sat
[2022-05-16 02:31:58] [INFO ] After 1481ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-16 02:31:58] [INFO ] [Nat]Absence check using 40 positive place invariants in 29 ms returned sat
[2022-05-16 02:31:59] [INFO ] After 1025ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-16 02:31:59] [INFO ] After 1283ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 145 ms.
[2022-05-16 02:31:59] [INFO ] After 1725ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 183 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=45 )
Parikh walk visited 1 properties in 6 ms.
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (NOT (AND p2 p1))), true]
False Knowledge obtained : [(X (AND p2 (NOT p1))), (X (NOT (AND p2 (NOT p1)))), (X p0), (X (NOT p0)), (X (X (AND p2 p1))), (X (X (NOT (AND p2 p1)))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (F (NOT p0)), (F (NOT (AND (NOT p1) p2))), (F (AND p1 p2))]
Knowledge based reduction with 3 factoid took 488 ms. Reduced automaton from 2 states, 4 edges and 3 AP to 2 states, 4 edges and 3 AP.
Stuttering acceptance computed with spot in 93 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2)]
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2)]
// Phase 1: matrix 4761 rows 1961 cols
[2022-05-16 02:32:00] [INFO ] Computed 40 place invariants in 29 ms
[2022-05-16 02:32:01] [INFO ] [Real]Absence check using 40 positive place invariants in 2 ms returned unsat
Proved EG (AND (NOT p1) p2)
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (NOT (AND p2 p1))), true]
False Knowledge obtained : [(X (AND p2 (NOT p1))), (X (NOT (AND p2 (NOT p1)))), (X p0), (X (NOT p0)), (X (X (AND p2 p1))), (X (X (NOT (AND p2 p1)))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (F (NOT p0)), (F (NOT (AND (NOT p1) p2))), (F (AND p1 p2)), (G (AND (NOT p1) p2))]
Property proved to be false thanks to negative knowledge :(G (AND (NOT p1) p2))
Knowledge based reduction with 3 factoid took 216 ms. Reduced automaton from 2 states, 4 edges and 3 AP to 1 states, 1 edges and 0 AP.
FORMULA BART-PT-040-LTLFireability-11 FALSE TECHNIQUES KNOWLEDGE
Treatment of property BART-PT-040-LTLFireability-11 finished in 20147 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((((p0 U p1) U X(!p0))||G(p2)))'
Support contains 3 out of 5280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5280/5280 places, 8080/8080 transitions.
Discarding 1280 places :
Symmetric choice reduction at 0 with 1280 rule applications. Total rules 1280 place count 4000 transition count 6800
Iterating global reduction 0 with 1280 rules applied. Total rules applied 2560 place count 4000 transition count 6800
Discarding 1080 places :
Symmetric choice reduction at 0 with 1080 rule applications. Total rules 3640 place count 2920 transition count 5720
Iterating global reduction 0 with 1080 rules applied. Total rules applied 4720 place count 2920 transition count 5720
Discarding 160 places :
Symmetric choice reduction at 0 with 160 rule applications. Total rules 4880 place count 2760 transition count 5560
Iterating global reduction 0 with 160 rules applied. Total rules applied 5040 place count 2760 transition count 5560
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 5160 place count 2640 transition count 5440
Iterating global reduction 0 with 120 rules applied. Total rules applied 5280 place count 2640 transition count 5440
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 5400 place count 2520 transition count 5320
Iterating global reduction 0 with 120 rules applied. Total rules applied 5520 place count 2520 transition count 5320
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 5640 place count 2400 transition count 5200
Iterating global reduction 0 with 120 rules applied. Total rules applied 5760 place count 2400 transition count 5200
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 5880 place count 2280 transition count 5080
Iterating global reduction 0 with 120 rules applied. Total rules applied 6000 place count 2280 transition count 5080
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 6120 place count 2160 transition count 4960
Iterating global reduction 0 with 120 rules applied. Total rules applied 6240 place count 2160 transition count 4960
Discarding 80 places :
Symmetric choice reduction at 0 with 80 rule applications. Total rules 6320 place count 2080 transition count 4880
Iterating global reduction 0 with 80 rules applied. Total rules applied 6400 place count 2080 transition count 4880
Discarding 80 places :
Symmetric choice reduction at 0 with 80 rule applications. Total rules 6480 place count 2000 transition count 4800
Iterating global reduction 0 with 80 rules applied. Total rules applied 6560 place count 2000 transition count 4800
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 6600 place count 1960 transition count 4760
Iterating global reduction 0 with 40 rules applied. Total rules applied 6640 place count 1960 transition count 4760
Applied a total of 6640 rules in 1140 ms. Remains 1960 /5280 variables (removed 3320) and now considering 4760/8080 (removed 3320) transitions.
// Phase 1: matrix 4760 rows 1960 cols
[2022-05-16 02:32:03] [INFO ] Computed 40 place invariants in 27 ms
[2022-05-16 02:32:03] [INFO ] Implicit Places using invariants in 293 ms returned []
// Phase 1: matrix 4760 rows 1960 cols
[2022-05-16 02:32:03] [INFO ] Computed 40 place invariants in 28 ms
[2022-05-16 02:32:04] [INFO ] Implicit Places using invariants and state equation in 678 ms returned []
Implicit Place search using SMT with State Equation took 977 ms to find 0 implicit places.
// Phase 1: matrix 4760 rows 1960 cols
[2022-05-16 02:32:04] [INFO ] Computed 40 place invariants in 19 ms
[2022-05-16 02:32:06] [INFO ] Dead Transitions using invariants and state equation in 1775 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1960/5280 places, 4760/8080 transitions.
Finished structural reductions, in 1 iterations. Remains : 1960/5280 places, 4760/8080 transitions.
Stuttering acceptance computed with spot in 388 ms :[true, (OR (NOT p1) p0), (AND p0 (NOT p2)), (NOT p2), (AND (NOT p2) p0), (AND p0 (NOT p2)), (AND p0 (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), p0, p0, p0]
Running random walk in product with property : BART-PT-040-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={0} source=1 dest: 9}], [{ cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=2 dest: 4}, { cond=(AND p1 p2), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=2 dest: 6}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=2 dest: 8}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 9}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=2 dest: 10}], [{ cond=(NOT p2), acceptance={} source=3 dest: 0}, { cond=p2, acceptance={} source=3 dest: 3}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND p0 p2), acceptance={} source=4 dest: 3}], [{ cond=(AND p1 p0 p2), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=5 dest: 6}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=5 dest: 9}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=5 dest: 10}], [{ cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=6 dest: 1}, { cond=(AND p1 p0 p2), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=6 dest: 7}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=6 dest: 9}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=7 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=7 dest: 1}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=7 dest: 3}, { cond=(AND p1 p0 p2), acceptance={} source=7 dest: 5}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=7 dest: 7}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=7 dest: 9}], [{ cond=p0, acceptance={} source=8 dest: 0}], [{ cond=(AND p1 p0), acceptance={0} source=9 dest: 9}, { cond=(AND (NOT p1) p0), acceptance={0} source=9 dest: 10}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=10 dest: 1}, { cond=(AND p1 p0), acceptance={0} source=10 dest: 9}]], initial=2, aps=[p1:(EQ s13 1), p0:(EQ s1586 1), p2:(EQ s278 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 7344 steps with 487 reset in 111 ms.
FORMULA BART-PT-040-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-040-LTLFireability-14 finished in 4436 ms.
All properties solved by simple procedures.
Total runtime 294894 ms.

BK_STOP 1652668326802

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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="BART-PT-040"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is BART-PT-040, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r006-tajo-165245689600636"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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