Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r043-smll-171620180500293.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is BART-PT-020, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r043-smll-171620180500293
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 54M
-rw-r--r-- 1 mcc users 1.2M Apr 12 23:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 4.1M Apr 12 23:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0M Apr 12 23:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 6.4M Apr 12 23:07 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 604K Apr 22 14:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 1.5M Apr 22 14:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 685K Apr 22 14:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 1.7M Apr 22 14:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.6M Apr 13 02:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 9.2M Apr 13 02:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.4M Apr 13 00:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15M Apr 13 00:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 68K Apr 22 14:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 136K Apr 22 14:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 4.8M May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716348252008

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BART-PT-020
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-22 03:24:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-22 03:24:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 03:24:15] [INFO ] Load time of PNML (sax parser for PT used): 715 ms
[2024-05-22 03:24:15] [INFO ] Transformed 2850 places.
[2024-05-22 03:24:15] [INFO ] Transformed 4040 transitions.
[2024-05-22 03:24:15] [INFO ] Found NUPN structural information;
[2024-05-22 03:24:15] [INFO ] Parsed PT model containing 2850 places and 4040 transitions and 32400 arcs in 933 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 107 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-020-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-020-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-020-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-020-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-020-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 2621 out of 2640 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2640/2640 places, 4040/4040 transitions.
Applied a total of 0 rules in 50 ms. Remains 2640 /2640 variables (removed 0) and now considering 4040/4040 (removed 0) transitions.
// Phase 1: matrix 4040 rows 2640 cols
[2024-05-22 03:24:16] [INFO ] Computed 20 invariants in 78 ms
[2024-05-22 03:24:17] [INFO ] Implicit Places using invariants in 1313 ms returned []
[2024-05-22 03:24:17] [INFO ] Invariant cache hit.
[2024-05-22 03:24:18] [INFO ] Implicit Places using invariants and state equation in 818 ms returned []
Implicit Place search using SMT with State Equation took 2186 ms to find 0 implicit places.
[2024-05-22 03:24:18] [INFO ] Invariant cache hit.
[2024-05-22 03:24:22] [INFO ] Dead Transitions using invariants and state equation in 4173 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6416 ms. Remains : 2640/2640 places, 4040/4040 transitions.
Support contains 2621 out of 2640 places after structural reductions.
[2024-05-22 03:24:23] [INFO ] Flatten gal took : 437 ms
[2024-05-22 03:24:24] [INFO ] Flatten gal took : 192 ms
[2024-05-22 03:24:24] [INFO ] Input system was already deterministic with 4040 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 486 ms. (steps per millisecond=20 ) properties (out of 15) seen :14
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 474 ms. (steps per millisecond=21 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-22 03:24:25] [INFO ] Invariant cache hit.
[2024-05-22 03:24:27] [INFO ] [Real]Absence check using 20 positive place invariants in 30 ms returned sat
[2024-05-22 03:24:30] [INFO ] After 2691ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-22 03:24:30] [INFO ] After 3270ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 03:24:30] [INFO ] After 4271ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 03:24:31] [INFO ] [Nat]Absence check using 20 positive place invariants in 35 ms returned sat
[2024-05-22 03:24:34] [INFO ] After 2449ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 03:24:34] [INFO ] After 2864ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 288 ms.
[2024-05-22 03:24:34] [INFO ] After 4114ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 235 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=39 )
Parikh walk visited 1 properties in 11 ms.
FORMULA BART-PT-020-LTLFireability-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 180 out of 2640 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2640/2640 places, 4040/4040 transitions.
Graph (trivial) has 3560 edges and 2640 vertex of which 820 / 2640 are part of one of the 20 SCC in 13 ms
Free SCC test removed 800 places
Ensure Unique test removed 1500 transitions
Reduce isomorphic transitions removed 1500 transitions.
Drop transitions removed 1120 transitions
Trivial Post-agglo rules discarded 1120 transitions
Performed 1120 trivial Post agglomeration. Transition count delta: 1120
Iterating post reduction 0 with 1120 rules applied. Total rules applied 1121 place count 1840 transition count 1420
Reduce places removed 1120 places and 0 transitions.
Ensure Unique test removed 160 transitions
Reduce isomorphic transitions removed 160 transitions.
Drop transitions removed 80 transitions
Trivial Post-agglo rules discarded 80 transitions
Performed 80 trivial Post agglomeration. Transition count delta: 80
Iterating post reduction 1 with 1360 rules applied. Total rules applied 2481 place count 720 transition count 1180
Reduce places removed 80 places and 0 transitions.
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Drop transitions removed 80 transitions
Trivial Post-agglo rules discarded 80 transitions
Performed 80 trivial Post agglomeration. Transition count delta: 80
Iterating post reduction 2 with 240 rules applied. Total rules applied 2721 place count 640 transition count 1020
Reduce places removed 80 places and 0 transitions.
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Drop transitions removed 80 transitions
Trivial Post-agglo rules discarded 80 transitions
Performed 80 trivial Post agglomeration. Transition count delta: 80
Iterating post reduction 3 with 240 rules applied. Total rules applied 2961 place count 560 transition count 860
Reduce places removed 80 places and 0 transitions.
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 4 with 160 rules applied. Total rules applied 3121 place count 480 transition count 780
Discarding 100 places :
Symmetric choice reduction at 5 with 100 rule applications. Total rules 3221 place count 380 transition count 680
Iterating global reduction 5 with 100 rules applied. Total rules applied 3321 place count 380 transition count 680
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Iterating post reduction 5 with 100 rules applied. Total rules applied 3421 place count 380 transition count 580
Drop transitions removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 6 with 20 rules applied. Total rules applied 3441 place count 380 transition count 560
Applied a total of 3441 rules in 191 ms. Remains 380 /2640 variables (removed 2260) and now considering 560/4040 (removed 3480) transitions.
[2024-05-22 03:24:35] [INFO ] Flow matrix only has 541 transitions (discarded 19 similar events)
// Phase 1: matrix 541 rows 380 cols
[2024-05-22 03:24:35] [INFO ] Computed 20 invariants in 4 ms
[2024-05-22 03:24:35] [INFO ] Implicit Places using invariants in 147 ms returned []
[2024-05-22 03:24:35] [INFO ] Flow matrix only has 541 transitions (discarded 19 similar events)
[2024-05-22 03:24:35] [INFO ] Invariant cache hit.
[2024-05-22 03:24:35] [INFO ] Implicit Places using invariants and state equation in 335 ms returned []
Implicit Place search using SMT with State Equation took 488 ms to find 0 implicit places.
[2024-05-22 03:24:36] [INFO ] Redundant transitions in 41 ms returned []
[2024-05-22 03:24:36] [INFO ] Flow matrix only has 541 transitions (discarded 19 similar events)
[2024-05-22 03:24:36] [INFO ] Invariant cache hit.
[2024-05-22 03:24:36] [INFO ] Dead Transitions using invariants and state equation in 383 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 380/2640 places, 560/4040 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1114 ms. Remains : 380/2640 places, 560/4040 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 286 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BART-PT-020-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (NEQ s127 1) (NEQ s20 1) (NEQ s87 1) (NEQ s107 1) (NEQ s277 1) (NEQ s100 1) (NEQ s94 1) (NEQ s270 1) (NEQ s120 1) (NEQ s255 1) (NEQ s34 1) (NEQ s2...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 15 steps with 0 reset in 3 ms.
FORMULA BART-PT-020-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-020-LTLFireability-00 finished in 1478 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1360 out of 2640 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2640/2640 places, 4040/4040 transitions.
Drop transitions removed 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 2640 transition count 3980
Reduce places removed 60 places and 0 transitions.
Performed 540 Post agglomeration using F-continuation condition.Transition count delta: 540
Iterating post reduction 1 with 600 rules applied. Total rules applied 660 place count 2580 transition count 3440
Reduce places removed 540 places and 0 transitions.
Iterating post reduction 2 with 540 rules applied. Total rules applied 1200 place count 2040 transition count 3440
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 1220 place count 2020 transition count 3420
Iterating global reduction 3 with 20 rules applied. Total rules applied 1240 place count 2020 transition count 3420
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 2 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 3 with 160 rules applied. Total rules applied 1400 place count 1940 transition count 3340
Applied a total of 1400 rules in 887 ms. Remains 1940 /2640 variables (removed 700) and now considering 3340/4040 (removed 700) transitions.
// Phase 1: matrix 3340 rows 1940 cols
[2024-05-22 03:24:37] [INFO ] Computed 20 invariants in 27 ms
[2024-05-22 03:24:37] [INFO ] Implicit Places using invariants in 365 ms returned []
[2024-05-22 03:24:37] [INFO ] Invariant cache hit.
[2024-05-22 03:24:38] [INFO ] Implicit Places using invariants and state equation in 802 ms returned []
Implicit Place search using SMT with State Equation took 1176 ms to find 0 implicit places.
[2024-05-22 03:24:38] [INFO ] Redundant transitions in 192 ms returned []
[2024-05-22 03:24:38] [INFO ] Invariant cache hit.
[2024-05-22 03:24:43] [INFO ] Dead Transitions using invariants and state equation in 4137 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1940/2640 places, 3340/4040 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6405 ms. Remains : 1940/2640 places, 3340/4040 transitions.
Stuttering acceptance computed with spot in 64 ms :[(NOT p0)]
Running random walk in product with property : BART-PT-020-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s185 1) (EQ s1288 1) (EQ s261 1) (EQ s701 1) (EQ s632 1) (EQ s1811 1) (EQ s253 1) (EQ s1219 1) (EQ s44 1) (EQ s1719 1) (EQ s1116 1) (EQ s784 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 1717 ms.
Product exploration explored 100000 steps with 0 reset in 2031 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 p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 147 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=0 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F p0)]
Knowledge based reduction with 2 factoid took 198 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
[2024-05-22 03:24:50] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
Support contains 1360 out of 1940 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1940/1940 places, 3340/3340 transitions.
Applied a total of 0 rules in 65 ms. Remains 1940 /1940 variables (removed 0) and now considering 3340/3340 (removed 0) transitions.
[2024-05-22 03:25:05] [INFO ] Invariant cache hit.
[2024-05-22 03:25:06] [INFO ] Implicit Places using invariants in 437 ms returned []
[2024-05-22 03:25:06] [INFO ] Invariant cache hit.
[2024-05-22 03:25:07] [INFO ] Implicit Places using invariants and state equation in 963 ms returned []
Implicit Place search using SMT with State Equation took 1409 ms to find 0 implicit places.
[2024-05-22 03:25:07] [INFO ] Redundant transitions in 180 ms returned []
[2024-05-22 03:25:07] [INFO ] Invariant cache hit.
[2024-05-22 03:25:09] [INFO ] Dead Transitions using invariants and state equation in 2592 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4263 ms. Remains : 1940/1940 places, 3340/3340 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 : [(NOT p0), (X p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 138 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=0 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F p0)]
Knowledge based reduction with 2 factoid took 162 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
[2024-05-22 03:25:13] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 1444 ms.
Product exploration explored 100000 steps with 0 reset in 1940 ms.
Built C files in :
/tmp/ltsmin15241600407192276241
[2024-05-22 03:25:31] [INFO ] Too many transitions (3340) to apply POR reductions. Disabling POR matrices.
[2024-05-22 03:25:31] [INFO ] Built C files in 54ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15241600407192276241
Running compilation step : cd /tmp/ltsmin15241600407192276241;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15241600407192276241;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15241600407192276241;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 1360 out of 1940 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1940/1940 places, 3340/3340 transitions.
Applied a total of 0 rules in 80 ms. Remains 1940 /1940 variables (removed 0) and now considering 3340/3340 (removed 0) transitions.
[2024-05-22 03:25:34] [INFO ] Invariant cache hit.
[2024-05-22 03:25:35] [INFO ] Implicit Places using invariants in 481 ms returned []
[2024-05-22 03:25:35] [INFO ] Invariant cache hit.
[2024-05-22 03:25:36] [INFO ] Implicit Places using invariants and state equation in 997 ms returned []
Implicit Place search using SMT with State Equation took 1485 ms to find 0 implicit places.
[2024-05-22 03:25:36] [INFO ] Redundant transitions in 203 ms returned []
[2024-05-22 03:25:36] [INFO ] Invariant cache hit.
[2024-05-22 03:25:39] [INFO ] Dead Transitions using invariants and state equation in 3326 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5109 ms. Remains : 1940/1940 places, 3340/3340 transitions.
Built C files in :
/tmp/ltsmin16590203223717202936
[2024-05-22 03:25:40] [INFO ] Too many transitions (3340) to apply POR reductions. Disabling POR matrices.
[2024-05-22 03:25:40] [INFO ] Built C files in 46ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16590203223717202936
Running compilation step : cd /tmp/ltsmin16590203223717202936;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16590203223717202936;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16590203223717202936;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-22 03:25:43] [INFO ] Flatten gal took : 147 ms
[2024-05-22 03:25:43] [INFO ] Flatten gal took : 91 ms
[2024-05-22 03:25:43] [INFO ] Time to serialize gal into /tmp/LTL3106317834275522938.gal : 27 ms
[2024-05-22 03:25:43] [INFO ] Time to serialize properties into /tmp/LTL16363846066463986621.prop : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3106317834275522938.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11601167586234598323.hoa' '-atoms' '/tmp/LTL16363846066463986621.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL16363846066463986621.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11601167586234598323.hoa
Detected timeout of ITS tools.
[2024-05-22 03:25:58] [INFO ] Flatten gal took : 74 ms
[2024-05-22 03:25:58] [INFO ] Flatten gal took : 75 ms
[2024-05-22 03:25:58] [INFO ] Time to serialize gal into /tmp/LTL11769254501309240081.gal : 16 ms
[2024-05-22 03:25:58] [INFO ] Time to serialize properties into /tmp/LTL12304013507301675794.ltl : 10 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11769254501309240081.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12304013507301675794.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F(G("((((((((((((TrainState_6_1_7==1)||(TrainState_9_1_27==1))||((TrainState_2_1_9==1)||(TrainState_2_1_17==1)))||(((TrainState_13_...35898
Formula 0 simplified : GF!"((((((((((((TrainState_6_1_7==1)||(TrainState_9_1_27==1))||((TrainState_2_1_9==1)||(TrainState_2_1_17==1)))||(((TrainState_13_4_...35892
Detected timeout of ITS tools.
[2024-05-22 03:26:14] [INFO ] Flatten gal took : 73 ms
[2024-05-22 03:26:14] [INFO ] Applying decomposition
[2024-05-22 03:26:14] [INFO ] Flatten gal took : 74 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph6077956238360881235.txt' '-o' '/tmp/graph6077956238360881235.bin' '-w' '/tmp/graph6077956238360881235.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph6077956238360881235.bin' '-l' '-1' '-v' '-w' '/tmp/graph6077956238360881235.weights' '-q' '0' '-e' '0.001'
[2024-05-22 03:26:14] [INFO ] Decomposing Gal with order
[2024-05-22 03:26:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 03:26:15] [INFO ] Removed a total of 201 redundant transitions.
[2024-05-22 03:26:15] [INFO ] Flatten gal took : 281 ms
[2024-05-22 03:26:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 14 ms.
[2024-05-22 03:26:15] [INFO ] Time to serialize gal into /tmp/LTL6322383931501915617.gal : 35 ms
[2024-05-22 03:26:15] [INFO ] Time to serialize properties into /tmp/LTL12999115163947314880.ltl : 7 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6322383931501915617.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12999115163947314880.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F(G("((((((((((((i18.u371.TrainState_6_1_7==1)||(i11.u44.TrainState_9_1_27==1))||((i10.u42.TrainState_2_1_9==1)||(i10.u42.TrainStat...46720
Formula 0 simplified : GF!"((((((((((((i18.u371.TrainState_6_1_7==1)||(i11.u44.TrainState_9_1_27==1))||((i10.u42.TrainState_2_1_9==1)||(i10.u42.TrainState_...46714
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
221 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,2.63966,70696,1,0,92924,12204,14463,202536,2156,32802,173467
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA BART-PT-020-LTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property BART-PT-020-LTLFireability-01 finished in 101583 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(F(!p0)) U G(p1)) U X(X(p2))))'
Support contains 2440 out of 2640 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2640/2640 places, 4040/4040 transitions.
Applied a total of 0 rules in 11 ms. Remains 2640 /2640 variables (removed 0) and now considering 4040/4040 (removed 0) transitions.
// Phase 1: matrix 4040 rows 2640 cols
[2024-05-22 03:26:18] [INFO ] Computed 20 invariants in 21 ms
[2024-05-22 03:26:19] [INFO ] Implicit Places using invariants in 777 ms returned []
[2024-05-22 03:26:19] [INFO ] Invariant cache hit.
[2024-05-22 03:26:19] [INFO ] Implicit Places using invariants and state equation in 580 ms returned []
Implicit Place search using SMT with State Equation took 1361 ms to find 0 implicit places.
[2024-05-22 03:26:19] [INFO ] Invariant cache hit.
[2024-05-22 03:26:20] [INFO ] Dead Transitions using invariants and state equation in 744 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2119 ms. Remains : 2640/2640 places, 4040/4040 transitions.
Stuttering acceptance computed with spot in 427 ms :[(NOT p2), (AND p1 p0 (NOT p2)), (NOT p2), (AND p1 p0 (NOT p2)), (NOT p2), p0, (AND p0 p1), (NOT p1)]
Running random walk in product with property : BART-PT-020-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}, { cond=true, acceptance={} source=2 dest: 4}], [{ cond=(AND p1 p0 (NOT p2)), acceptance={} source=3 dest: 5}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 6}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 6}, { cond=(NOT p2), acceptance={} source=4 dest: 7}], [{ cond=p0, acceptance={0} source=5 dest: 5}], [{ cond=(AND p1 p0), acceptance={} source=6 dest: 5}, { cond=p1, acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p1) p0), acceptance={} source=7 dest: 5}, { cond=(NOT p1), acceptance={} source=7 dest: 6}, { cond=p1, acceptance={} source=7 dest: 7}, { cond=(NOT p1), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p1:(OR (EQ s2045 1) (EQ s2385 1) (EQ s2514 1) (EQ s1802 1) (EQ s1722 1) (EQ s263 1) (EQ s1965 1) (EQ s478 1) (EQ s558 1) (EQ s2204 1) (EQ s2207 1) (EQ s19...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration timeout after 88600 steps with 29673 reset in 10002 ms.
Product exploration timeout after 96610 steps with 32354 reset in 10001 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 p1) (NOT p0) p2), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X p2))]
False Knowledge obtained : [(X p1), (X (NOT p1))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 45 ms. Reduced automaton from 8 states, 18 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BART-PT-020-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BART-PT-020-LTLFireability-02 finished in 98101 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 20 out of 2640 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2640/2640 places, 4040/4040 transitions.
Drop transitions removed 1280 transitions
Trivial Post-agglo rules discarded 1280 transitions
Performed 1280 trivial Post agglomeration. Transition count delta: 1280
Iterating post reduction 0 with 1280 rules applied. Total rules applied 1280 place count 2640 transition count 2760
Reduce places removed 1280 places and 0 transitions.
Iterating post reduction 1 with 1280 rules applied. Total rules applied 2560 place count 1360 transition count 2760
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 80 Pre rules applied. Total rules applied 2560 place count 1360 transition count 2680
Deduced a syphon composed of 80 places in 1 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 2720 place count 1280 transition count 2680
Discarding 120 places :
Symmetric choice reduction at 2 with 120 rule applications. Total rules 2840 place count 1160 transition count 2560
Iterating global reduction 2 with 120 rules applied. Total rules applied 2960 place count 1160 transition count 2560
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 2980 place count 1160 transition count 2540
Discarding 80 places :
Symmetric choice reduction at 3 with 80 rule applications. Total rules 3060 place count 1080 transition count 2460
Iterating global reduction 3 with 80 rules applied. Total rules applied 3140 place count 1080 transition count 2460
Discarding 60 places :
Symmetric choice reduction at 3 with 60 rule applications. Total rules 3200 place count 1020 transition count 2400
Iterating global reduction 3 with 60 rules applied. Total rules applied 3260 place count 1020 transition count 2400
Discarding 60 places :
Symmetric choice reduction at 3 with 60 rule applications. Total rules 3320 place count 960 transition count 2340
Iterating global reduction 3 with 60 rules applied. Total rules applied 3380 place count 960 transition count 2340
Discarding 40 places :
Symmetric choice reduction at 3 with 40 rule applications. Total rules 3420 place count 920 transition count 2300
Iterating global reduction 3 with 40 rules applied. Total rules applied 3460 place count 920 transition count 2300
Discarding 40 places :
Symmetric choice reduction at 3 with 40 rule applications. Total rules 3500 place count 880 transition count 2260
Iterating global reduction 3 with 40 rules applied. Total rules applied 3540 place count 880 transition count 2260
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 3560 place count 860 transition count 2240
Iterating global reduction 3 with 20 rules applied. Total rules applied 3580 place count 860 transition count 2240
Performed 140 Post agglomeration using F-continuation condition.Transition count delta: 140
Deduced a syphon composed of 140 places in 0 ms
Reduce places removed 140 places and 0 transitions.
Iterating global reduction 3 with 280 rules applied. Total rules applied 3860 place count 720 transition count 2100
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 3 with 80 rules applied. Total rules applied 3940 place count 720 transition count 2020
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 4 with 80 rules applied. Total rules applied 4020 place count 680 transition count 1980
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 4 with 80 rules applied. Total rules applied 4100 place count 680 transition count 1900
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 5 with 80 rules applied. Total rules applied 4180 place count 640 transition count 1860
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 5 with 80 rules applied. Total rules applied 4260 place count 640 transition count 1780
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 6 with 80 rules applied. Total rules applied 4340 place count 600 transition count 1740
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 6 with 80 rules applied. Total rules applied 4420 place count 600 transition count 1660
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 7 with 80 rules applied. Total rules applied 4500 place count 560 transition count 1620
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 7 with 80 rules applied. Total rules applied 4580 place count 560 transition count 1540
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 8 with 80 rules applied. Total rules applied 4660 place count 520 transition count 1500
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 8 with 80 rules applied. Total rules applied 4740 place count 520 transition count 1420
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 9 with 80 rules applied. Total rules applied 4820 place count 480 transition count 1380
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 9 with 80 rules applied. Total rules applied 4900 place count 480 transition count 1300
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 10 with 80 rules applied. Total rules applied 4980 place count 440 transition count 1260
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 10 with 80 rules applied. Total rules applied 5060 place count 440 transition count 1180
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 11 with 80 rules applied. Total rules applied 5140 place count 400 transition count 1140
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 11 with 80 rules applied. Total rules applied 5220 place count 400 transition count 1060
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 12 with 80 rules applied. Total rules applied 5300 place count 360 transition count 1020
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 12 with 80 rules applied. Total rules applied 5380 place count 360 transition count 940
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 13 with 80 rules applied. Total rules applied 5460 place count 320 transition count 900
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 13 with 80 rules applied. Total rules applied 5540 place count 320 transition count 820
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 14 with 80 rules applied. Total rules applied 5620 place count 280 transition count 780
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 14 with 80 rules applied. Total rules applied 5700 place count 280 transition count 700
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 15 with 80 rules applied. Total rules applied 5780 place count 240 transition count 660
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 15 with 80 rules applied. Total rules applied 5860 place count 240 transition count 580
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 16 with 80 rules applied. Total rules applied 5940 place count 200 transition count 540
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 16 with 80 rules applied. Total rules applied 6020 place count 200 transition count 460
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 17 with 80 rules applied. Total rules applied 6100 place count 160 transition count 420
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 17 with 80 rules applied. Total rules applied 6180 place count 160 transition count 340
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 18 with 80 rules applied. Total rules applied 6260 place count 120 transition count 300
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 18 with 80 rules applied. Total rules applied 6340 place count 120 transition count 220
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 19 with 80 rules applied. Total rules applied 6420 place count 80 transition count 180
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 19 with 100 rules applied. Total rules applied 6520 place count 80 transition count 80
Reduce places removed 20 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 20 with 40 rules applied. Total rules applied 6560 place count 60 transition count 60
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 21 with 20 Pre rules applied. Total rules applied 6560 place count 60 transition count 40
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 21 with 40 rules applied. Total rules applied 6600 place count 40 transition count 40
Applied a total of 6600 rules in 1180 ms. Remains 40 /2640 variables (removed 2600) and now considering 40/4040 (removed 4000) transitions.
// Phase 1: matrix 40 rows 40 cols
[2024-05-22 03:27:57] [INFO ] Computed 20 invariants in 0 ms
[2024-05-22 03:27:57] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-22 03:27:57] [INFO ] Invariant cache hit.
[2024-05-22 03:27:57] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
[2024-05-22 03:27:57] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-22 03:27:57] [INFO ] Invariant cache hit.
[2024-05-22 03:27:57] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 40/2640 places, 40/4040 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1319 ms. Remains : 40/2640 places, 40/4040 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Running random walk in product with property : BART-PT-020-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (NEQ s32 1) (NEQ s33 1) (NEQ s34 1) (NEQ s35 1) (NEQ s36 1) (NEQ s37 1) (NEQ s39 1) (NEQ s38 1) (NEQ s20 1) (NEQ s21 1) (NEQ s22 1) (NEQ s23 1) (N...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 294 ms.
Stack based approach found an accepted trace after 12 steps with 0 reset with depth 13 and stack size 13 in 0 ms.
FORMULA BART-PT-020-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property BART-PT-020-LTLFireability-03 finished in 1677 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((!p0 U (G(!p0)||(!p0&&F(!p1)))))))'
Support contains 1940 out of 2640 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2640/2640 places, 4040/4040 transitions.
Graph (trivial) has 520 edges and 2640 vertex of which 120 / 2640 are part of one of the 20 SCC in 2 ms
Free SCC test removed 100 places
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Performed 160 Post agglomeration using F-continuation condition.Transition count delta: 160
Iterating post reduction 0 with 160 rules applied. Total rules applied 161 place count 2540 transition count 3780
Reduce places removed 160 places and 0 transitions.
Iterating post reduction 1 with 160 rules applied. Total rules applied 321 place count 2380 transition count 3780
Performed 240 Post agglomeration using F-continuation condition.Transition count delta: 240
Deduced a syphon composed of 240 places in 2 ms
Reduce places removed 240 places and 0 transitions.
Iterating global reduction 2 with 480 rules applied. Total rules applied 801 place count 2140 transition count 3540
Applied a total of 801 rules in 200 ms. Remains 2140 /2640 variables (removed 500) and now considering 3540/4040 (removed 500) transitions.
[2024-05-22 03:27:58] [INFO ] Flow matrix only has 3521 transitions (discarded 19 similar events)
// Phase 1: matrix 3521 rows 2140 cols
[2024-05-22 03:27:58] [INFO ] Computed 20 invariants in 28 ms
[2024-05-22 03:27:58] [INFO ] Implicit Places using invariants in 509 ms returned []
[2024-05-22 03:27:58] [INFO ] Flow matrix only has 3521 transitions (discarded 19 similar events)
[2024-05-22 03:27:58] [INFO ] Invariant cache hit.
[2024-05-22 03:27:59] [INFO ] Implicit Places using invariants and state equation in 591 ms returned []
Implicit Place search using SMT with State Equation took 1104 ms to find 0 implicit places.
[2024-05-22 03:27:59] [INFO ] Redundant transitions in 142 ms returned []
[2024-05-22 03:27:59] [INFO ] Flow matrix only has 3521 transitions (discarded 19 similar events)
[2024-05-22 03:27:59] [INFO ] Invariant cache hit.
[2024-05-22 03:28:00] [INFO ] Dead Transitions using invariants and state equation in 633 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2140/2640 places, 3540/4040 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2090 ms. Remains : 2140/2640 places, 3540/4040 transitions.
Stuttering acceptance computed with spot in 154 ms :[p0, p0, (AND p0 p1)]
Running random walk in product with property : BART-PT-020-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(AND p1 p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s227 1) (EQ s40 1) (EQ s147 1) (EQ s187 1) (EQ s577 1) (EQ s180 1) (EQ s154 1) (EQ s570 1) (EQ s220 1) (EQ s515 1) (EQ s54 1) (EQ s378 1) (EQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 69 steps with 0 reset in 3 ms.
FORMULA BART-PT-020-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-020-LTLFireability-04 finished in 2278 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 180 out of 2640 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2640/2640 places, 4040/4040 transitions.
Discarding 460 places :
Symmetric choice reduction at 0 with 460 rule applications. Total rules 460 place count 2180 transition count 3580
Iterating global reduction 0 with 460 rules applied. Total rules applied 920 place count 2180 transition count 3580
Discarding 380 places :
Symmetric choice reduction at 0 with 380 rule applications. Total rules 1300 place count 1800 transition count 3200
Iterating global reduction 0 with 380 rules applied. Total rules applied 1680 place count 1800 transition count 3200
Applied a total of 1680 rules in 352 ms. Remains 1800 /2640 variables (removed 840) and now considering 3200/4040 (removed 840) transitions.
// Phase 1: matrix 3200 rows 1800 cols
[2024-05-22 03:28:00] [INFO ] Computed 20 invariants in 22 ms
[2024-05-22 03:28:01] [INFO ] Implicit Places using invariants in 399 ms returned []
[2024-05-22 03:28:01] [INFO ] Invariant cache hit.
[2024-05-22 03:28:02] [INFO ] Implicit Places using invariants and state equation in 981 ms returned []
Implicit Place search using SMT with State Equation took 1389 ms to find 0 implicit places.
[2024-05-22 03:28:02] [INFO ] Invariant cache hit.
[2024-05-22 03:28:05] [INFO ] Dead Transitions using invariants and state equation in 3598 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1800/2640 places, 3200/4040 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5341 ms. Remains : 1800/2640 places, 3200/4040 transitions.
Stuttering acceptance computed with spot in 115 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BART-PT-020-LTLFireability-05 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:(AND (EQ s367 0) (EQ s140 0) (EQ s247 0) (EQ s307 0) (EQ s677 0) (EQ s300 0) (EQ s254 0) (EQ s670 0) (EQ s360 0) (EQ s615 0) (EQ s154 0) (EQ s498 0) (E...], 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 36 steps with 0 reset in 5 ms.
FORMULA BART-PT-020-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-020-LTLFireability-05 finished in 5496 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0&&(p1||X(p2))))))'
Support contains 3 out of 2640 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2640/2640 places, 4040/4040 transitions.
Discarding 639 places :
Symmetric choice reduction at 0 with 639 rule applications. Total rules 639 place count 2001 transition count 3401
Iterating global reduction 0 with 639 rules applied. Total rules applied 1278 place count 2001 transition count 3401
Discarding 539 places :
Symmetric choice reduction at 0 with 539 rule applications. Total rules 1817 place count 1462 transition count 2862
Iterating global reduction 0 with 539 rules applied. Total rules applied 2356 place count 1462 transition count 2862
Discarding 80 places :
Symmetric choice reduction at 0 with 80 rule applications. Total rules 2436 place count 1382 transition count 2782
Iterating global reduction 0 with 80 rules applied. Total rules applied 2516 place count 1382 transition count 2782
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 2576 place count 1322 transition count 2722
Iterating global reduction 0 with 60 rules applied. Total rules applied 2636 place count 1322 transition count 2722
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 2696 place count 1262 transition count 2662
Iterating global reduction 0 with 60 rules applied. Total rules applied 2756 place count 1262 transition count 2662
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 2816 place count 1202 transition count 2602
Iterating global reduction 0 with 60 rules applied. Total rules applied 2876 place count 1202 transition count 2602
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 2936 place count 1142 transition count 2542
Iterating global reduction 0 with 60 rules applied. Total rules applied 2996 place count 1142 transition count 2542
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 3056 place count 1082 transition count 2482
Iterating global reduction 0 with 60 rules applied. Total rules applied 3116 place count 1082 transition count 2482
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 3156 place count 1042 transition count 2442
Iterating global reduction 0 with 40 rules applied. Total rules applied 3196 place count 1042 transition count 2442
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 3236 place count 1002 transition count 2402
Iterating global reduction 0 with 40 rules applied. Total rules applied 3276 place count 1002 transition count 2402
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 3296 place count 982 transition count 2382
Iterating global reduction 0 with 20 rules applied. Total rules applied 3316 place count 982 transition count 2382
Applied a total of 3316 rules in 1231 ms. Remains 982 /2640 variables (removed 1658) and now considering 2382/4040 (removed 1658) transitions.
// Phase 1: matrix 2382 rows 982 cols
[2024-05-22 03:28:07] [INFO ] Computed 20 invariants in 11 ms
[2024-05-22 03:28:07] [INFO ] Implicit Places using invariants in 249 ms returned []
[2024-05-22 03:28:07] [INFO ] Invariant cache hit.
[2024-05-22 03:28:08] [INFO ] Implicit Places using invariants and state equation in 1117 ms returned []
Implicit Place search using SMT with State Equation took 1383 ms to find 0 implicit places.
[2024-05-22 03:28:08] [INFO ] Invariant cache hit.
[2024-05-22 03:28:10] [INFO ] Dead Transitions using invariants and state equation in 2372 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 982/2640 places, 2382/4040 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4988 ms. Remains : 982/2640 places, 2382/4040 transitions.
Stuttering acceptance computed with spot in 130 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : BART-PT-020-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(AND p1 p0), acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 p0 p2), acceptance={} source=1 dest: 0}, { cond=(OR (AND p1 (NOT p2)) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s31 1), p0:(EQ s850 0), p2:(EQ s89 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 0 reset in 601 ms.
Product exploration explored 100000 steps with 0 reset in 589 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 p1) p0 (NOT p2)), (X (NOT (AND (NOT p1) p0 p2))), (X (NOT (AND p1 p0 p2))), (X (NOT (AND p1 p0))), (X (X (NOT (AND p1 p0 p2)))), (X (X (NOT (AND p1 p0))))]
False Knowledge obtained : [(X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) p0 (NOT p2))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (OR (AND p1 (NOT p2)) (NOT p0))), (X (NOT (OR (AND p1 (NOT p2)) (NOT p0)))), (X (NOT p0)), (X p0), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) p0 p2))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (AND (NOT p1) p0 (NOT p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (OR (AND p1 (NOT p2)) (NOT p0)))), (X (X (NOT (OR (AND p1 (NOT p2)) (NOT p0))))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 6 factoid took 641 ms. Reduced automaton from 2 states, 7 edges and 3 AP (stutter sensitive) to 2 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 96 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 259 ms. (steps per millisecond=38 ) properties (out of 7) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-22 03:28:13] [INFO ] Invariant cache hit.
[2024-05-22 03:28:13] [INFO ] [Real]Absence check using 20 positive place invariants in 20 ms returned sat
[2024-05-22 03:28:14] [INFO ] After 1273ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 03:28:15] [INFO ] [Nat]Absence check using 20 positive place invariants in 12 ms returned sat
[2024-05-22 03:28:15] [INFO ] After 753ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 03:28:16] [INFO ] After 920ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 87 ms.
[2024-05-22 03:28:16] [INFO ] After 1208ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 250 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=50 )
Parikh walk visited 1 properties in 8 ms.
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (NOT (AND (NOT p1) p0 p2))), (X (NOT (AND p1 p0 p2))), (X (NOT (AND p1 p0))), (X (X (NOT (AND p1 p0 p2)))), (X (X (NOT (AND p1 p0))))]
False Knowledge obtained : [(X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) p0 (NOT p2))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (OR (AND p1 (NOT p2)) (NOT p0))), (X (NOT (OR (AND p1 (NOT p2)) (NOT p0)))), (X (NOT p0)), (X p0), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) p0 p2))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (AND (NOT p1) p0 (NOT p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (OR (AND p1 (NOT p2)) (NOT p0)))), (X (X (NOT (OR (AND p1 (NOT p2)) (NOT p0))))), (X (X (NOT p0))), (X (X p0)), (F (OR (NOT p0) (AND p1 (NOT p2)))), (F (AND p0 p1 p2)), (F (NOT (AND p0 (NOT p1) (NOT p2)))), (F (AND p0 (NOT p1) p2)), (F (AND p0 p1)), (F (NOT (AND p0 (NOT p1)))), (F (NOT p0))]
Knowledge based reduction with 6 factoid took 1094 ms. Reduced automaton from 2 states, 7 edges and 3 AP (stutter sensitive) to 2 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 114 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 95 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
[2024-05-22 03:28:17] [INFO ] Invariant cache hit.
[2024-05-22 03:28:18] [INFO ] [Real]Absence check using 20 positive place invariants in 7 ms returned unsat
Proved EG (AND (NOT p1) (NOT p2))
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (NOT (AND (NOT p1) p0 p2))), (X (NOT (AND p1 p0 p2))), (X (NOT (AND p1 p0))), (X (X (NOT (AND p1 p0 p2)))), (X (X (NOT (AND p1 p0))))]
False Knowledge obtained : [(X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) p0 (NOT p2))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (OR (AND p1 (NOT p2)) (NOT p0))), (X (NOT (OR (AND p1 (NOT p2)) (NOT p0)))), (X (NOT p0)), (X p0), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) p0 p2))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (AND (NOT p1) p0 (NOT p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (OR (AND p1 (NOT p2)) (NOT p0)))), (X (X (NOT (OR (AND p1 (NOT p2)) (NOT p0))))), (X (X (NOT p0))), (X (X p0)), (F (OR (NOT p0) (AND p1 (NOT p2)))), (F (AND p0 p1 p2)), (F (NOT (AND p0 (NOT p1) (NOT p2)))), (F (AND p0 (NOT p1) p2)), (F (AND p0 p1)), (F (NOT (AND p0 (NOT p1)))), (F (NOT p0)), (G (AND (NOT p1) (NOT p2)))]
Property proved to be false thanks to negative knowledge :(G (AND (NOT p1) (NOT p2)))
Knowledge based reduction with 6 factoid took 1211 ms. Reduced automaton from 2 states, 7 edges and 3 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA BART-PT-020-LTLFireability-09 FALSE TECHNIQUES KNOWLEDGE
Treatment of property BART-PT-020-LTLFireability-09 finished in 14232 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 2640 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2640/2640 places, 4040/4040 transitions.
Discarding 640 places :
Symmetric choice reduction at 0 with 640 rule applications. Total rules 640 place count 2000 transition count 3400
Iterating global reduction 0 with 640 rules applied. Total rules applied 1280 place count 2000 transition count 3400
Discarding 540 places :
Symmetric choice reduction at 0 with 540 rule applications. Total rules 1820 place count 1460 transition count 2860
Iterating global reduction 0 with 540 rules applied. Total rules applied 2360 place count 1460 transition count 2860
Discarding 80 places :
Symmetric choice reduction at 0 with 80 rule applications. Total rules 2440 place count 1380 transition count 2780
Iterating global reduction 0 with 80 rules applied. Total rules applied 2520 place count 1380 transition count 2780
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 2580 place count 1320 transition count 2720
Iterating global reduction 0 with 60 rules applied. Total rules applied 2640 place count 1320 transition count 2720
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 2700 place count 1260 transition count 2660
Iterating global reduction 0 with 60 rules applied. Total rules applied 2760 place count 1260 transition count 2660
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 2820 place count 1200 transition count 2600
Iterating global reduction 0 with 60 rules applied. Total rules applied 2880 place count 1200 transition count 2600
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 2940 place count 1140 transition count 2540
Iterating global reduction 0 with 60 rules applied. Total rules applied 3000 place count 1140 transition count 2540
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 3060 place count 1080 transition count 2480
Iterating global reduction 0 with 60 rules applied. Total rules applied 3120 place count 1080 transition count 2480
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 3160 place count 1040 transition count 2440
Iterating global reduction 0 with 40 rules applied. Total rules applied 3200 place count 1040 transition count 2440
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 3240 place count 1000 transition count 2400
Iterating global reduction 0 with 40 rules applied. Total rules applied 3280 place count 1000 transition count 2400
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 3300 place count 980 transition count 2380
Iterating global reduction 0 with 20 rules applied. Total rules applied 3320 place count 980 transition count 2380
Applied a total of 3320 rules in 764 ms. Remains 980 /2640 variables (removed 1660) and now considering 2380/4040 (removed 1660) transitions.
// Phase 1: matrix 2380 rows 980 cols
[2024-05-22 03:28:20] [INFO ] Computed 20 invariants in 9 ms
[2024-05-22 03:28:21] [INFO ] Implicit Places using invariants in 174 ms returned []
[2024-05-22 03:28:21] [INFO ] Invariant cache hit.
[2024-05-22 03:28:21] [INFO ] Implicit Places using invariants and state equation in 891 ms returned []
Implicit Place search using SMT with State Equation took 1072 ms to find 0 implicit places.
[2024-05-22 03:28:21] [INFO ] Invariant cache hit.
[2024-05-22 03:28:23] [INFO ] Dead Transitions using invariants and state equation in 1923 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 980/2640 places, 2380/4040 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3762 ms. Remains : 980/2640 places, 2380/4040 transitions.
Stuttering acceptance computed with spot in 102 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BART-PT-020-LTLFireability-10 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:(EQ s13 0)], 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 1 steps with 0 reset in 0 ms.
FORMULA BART-PT-020-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-020-LTLFireability-10 finished in 3892 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 2640 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2640/2640 places, 4040/4040 transitions.
Graph (trivial) has 4038 edges and 2640 vertex of which 2508 / 2640 are part of one of the 19 SCC in 2 ms
Free SCC test removed 2489 places
Ensure Unique test removed 3819 transitions
Reduce isomorphic transitions removed 3819 transitions.
Reduce places removed 19 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 82 rules applied. Total rules applied 83 place count 132 transition count 139
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 1 with 64 rules applied. Total rules applied 147 place count 68 transition count 139
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 147 place count 68 transition count 135
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 155 place count 64 transition count 135
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 161 place count 58 transition count 129
Iterating global reduction 2 with 6 rules applied. Total rules applied 167 place count 58 transition count 129
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 168 place count 58 transition count 128
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 172 place count 54 transition count 124
Iterating global reduction 3 with 4 rules applied. Total rules applied 176 place count 54 transition count 124
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 179 place count 51 transition count 121
Iterating global reduction 3 with 3 rules applied. Total rules applied 182 place count 51 transition count 121
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 185 place count 48 transition count 118
Iterating global reduction 3 with 3 rules applied. Total rules applied 188 place count 48 transition count 118
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 190 place count 46 transition count 116
Iterating global reduction 3 with 2 rules applied. Total rules applied 192 place count 46 transition count 116
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 194 place count 44 transition count 114
Iterating global reduction 3 with 2 rules applied. Total rules applied 196 place count 44 transition count 114
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 197 place count 43 transition count 113
Iterating global reduction 3 with 1 rules applied. Total rules applied 198 place count 43 transition count 113
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 212 place count 36 transition count 106
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 216 place count 36 transition count 102
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 220 place count 34 transition count 100
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 224 place count 34 transition count 96
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 228 place count 32 transition count 94
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 232 place count 32 transition count 90
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 236 place count 30 transition count 88
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 240 place count 30 transition count 84
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 244 place count 28 transition count 82
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 248 place count 28 transition count 78
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 252 place count 26 transition count 76
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 256 place count 26 transition count 72
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 260 place count 24 transition count 70
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 264 place count 24 transition count 66
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 4 rules applied. Total rules applied 268 place count 22 transition count 64
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 272 place count 22 transition count 60
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 11 with 4 rules applied. Total rules applied 276 place count 20 transition count 58
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 11 with 4 rules applied. Total rules applied 280 place count 20 transition count 54
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 12 with 4 rules applied. Total rules applied 284 place count 18 transition count 52
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 12 with 4 rules applied. Total rules applied 288 place count 18 transition count 48
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 13 with 4 rules applied. Total rules applied 292 place count 16 transition count 46
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 13 with 4 rules applied. Total rules applied 296 place count 16 transition count 42
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 14 with 4 rules applied. Total rules applied 300 place count 14 transition count 40
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 14 with 4 rules applied. Total rules applied 304 place count 14 transition count 36
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 15 with 4 rules applied. Total rules applied 308 place count 12 transition count 34
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 15 with 4 rules applied. Total rules applied 312 place count 12 transition count 30
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 16 with 4 rules applied. Total rules applied 316 place count 10 transition count 28
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 16 with 4 rules applied. Total rules applied 320 place count 10 transition count 24
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 17 with 4 rules applied. Total rules applied 324 place count 8 transition count 22
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 17 with 4 rules applied. Total rules applied 328 place count 8 transition count 18
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 18 with 4 rules applied. Total rules applied 332 place count 6 transition count 16
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 18 with 4 rules applied. Total rules applied 336 place count 6 transition count 12
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 19 with 4 rules applied. Total rules applied 340 place count 4 transition count 10
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 19 with 5 rules applied. Total rules applied 345 place count 4 transition count 5
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 20 with 2 rules applied. Total rules applied 347 place count 3 transition count 4
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 21 with 1 Pre rules applied. Total rules applied 347 place count 3 transition count 3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 21 with 2 rules applied. Total rules applied 349 place count 2 transition count 3
Applied a total of 349 rules in 53 ms. Remains 2 /2640 variables (removed 2638) and now considering 3/4040 (removed 4037) transitions.
// Phase 1: matrix 3 rows 2 cols
[2024-05-22 03:28:24] [INFO ] Computed 1 invariants in 1 ms
[2024-05-22 03:28:24] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-05-22 03:28:24] [INFO ] Invariant cache hit.
[2024-05-22 03:28:24] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2024-05-22 03:28:24] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-22 03:28:24] [INFO ] Invariant cache hit.
[2024-05-22 03:28:24] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/2640 places, 3/4040 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 128 ms. Remains : 2/2640 places, 3/4040 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : BART-PT-020-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s1 1)], 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]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BART-PT-020-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-020-LTLFireability-14 finished in 188 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 2640 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2640/2640 places, 4040/4040 transitions.
Graph (trivial) has 4036 edges and 2640 vertex of which 2637 / 2640 are part of one of the 20 SCC in 2 ms
Free SCC test removed 2617 places
Ensure Unique test removed 4015 transitions
Reduce isomorphic transitions removed 4015 transitions.
Reduce places removed 19 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 4 transition count 6
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 22 place count 3 transition count 5
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 24 place count 2 transition count 4
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 25 place count 2 transition count 3
Applied a total of 25 rules in 15 ms. Remains 2 /2640 variables (removed 2638) and now considering 3/4040 (removed 4037) transitions.
[2024-05-22 03:28:24] [INFO ] Invariant cache hit.
[2024-05-22 03:28:24] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-05-22 03:28:24] [INFO ] Invariant cache hit.
[2024-05-22 03:28:24] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
[2024-05-22 03:28:24] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-22 03:28:24] [INFO ] Invariant cache hit.
[2024-05-22 03:28:24] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/2640 places, 3/4040 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 82 ms. Remains : 2/2640 places, 3/4040 transitions.
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BART-PT-020-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BART-PT-020-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-020-LTLFireability-15 finished in 195 ms.
All properties solved by simple procedures.
Total runtime 249534 ms.

BK_STOP 1716348505431

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BART-PT-020"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is BART-PT-020, 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 r043-smll-171620180500293"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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