Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 56M
-rw-r--r-- 1 mcc users 2.3M Apr 29 22:08 CTLCardinality.txt
-rw-r--r-- 1 mcc users 8.2M Apr 29 22:08 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.8M Apr 29 21:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 12M Apr 29 21:06 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 1.9M May 9 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 5.0M May 9 07:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2M May 9 07:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 5.2M May 9 07:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 323K May 9 07:06 UpperBounds.txt
-rw-r--r-- 1 mcc users 651K May 9 07:06 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 15M May 10 09:33 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1652668398843

Running Version 202205111006
[2022-05-16 02:33:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-16 02:33:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 02:33:20] [INFO ] Load time of PNML (sax parser for PT used): 685 ms
[2022-05-16 02:33:20] [INFO ] Transformed 8130 places.
[2022-05-16 02:33:21] [INFO ] Transformed 12120 transitions.
[2022-05-16 02:33:21] [INFO ] Found NUPN structural information;
[2022-05-16 02:33:21] [INFO ] Parsed PT model containing 8130 places and 12120 transitions in 891 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 135 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Reduce places removed 210 places and 0 transitions.
FORMULA BART-PT-060-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-060-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-060-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 7862 out of 7920 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7920/7920 places, 12120/12120 transitions.
Applied a total of 0 rules in 78 ms. Remains 7920 /7920 variables (removed 0) and now considering 12120/12120 (removed 0) transitions.
// Phase 1: matrix 12120 rows 7920 cols
[2022-05-16 02:33:22] [INFO ] Computed 60 place invariants in 126 ms
[2022-05-16 02:33:23] [INFO ] Implicit Places using invariants in 1141 ms returned []
Implicit Place search using SMT only with invariants took 1167 ms to find 0 implicit places.
// Phase 1: matrix 12120 rows 7920 cols
[2022-05-16 02:33:23] [INFO ] Computed 60 place invariants in 75 ms
[2022-05-16 02:33:24] [INFO ] Dead Transitions using invariants and state equation in 1405 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 7920/7920 places, 12120/12120 transitions.
Support contains 7862 out of 7920 places after structural reductions.
[2022-05-16 02:33:25] [INFO ] Flatten gal took : 541 ms
[2022-05-16 02:33:27] [INFO ] Flatten gal took : 465 ms
[2022-05-16 02:33:28] [INFO ] Input system was already deterministic with 12120 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 667 ms. (steps per millisecond=14 ) properties (out of 22) seen :18
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 12120 rows 7920 cols
[2022-05-16 02:33:29] [INFO ] Computed 60 place invariants in 81 ms
[2022-05-16 02:33:31] [INFO ] [Real]Absence check using 60 positive place invariants in 95 ms returned sat
[2022-05-16 02:33:37] [INFO ] After 6266ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-16 02:33:39] [INFO ] After 7393ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-16 02:33:39] [INFO ] After 9191ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-16 02:33:40] [INFO ] [Nat]Absence check using 60 positive place invariants in 113 ms returned sat
[2022-05-16 02:33:47] [INFO ] After 6746ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-16 02:33:48] [INFO ] After 7740ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 416 ms.
[2022-05-16 02:33:49] [INFO ] After 9999ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 225 steps, including 0 resets, run visited all 1 properties in 10 ms. (steps per millisecond=22 )
Parikh walk visited 1 properties in 20 ms.
FORMULA BART-PT-060-LTLFireability-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!F(G(!(X(p0)&&p1))) U F(p2)))'
Support contains 4140 out of 7920 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7920/7920 places, 12120/12120 transitions.
Drop transitions removed 180 transitions
Trivial Post-agglo rules discarded 180 transitions
Performed 180 trivial Post agglomeration. Transition count delta: 180
Iterating post reduction 0 with 180 rules applied. Total rules applied 180 place count 7920 transition count 11940
Reduce places removed 180 places and 0 transitions.
Performed 1560 Post agglomeration using F-continuation condition.Transition count delta: 1560
Iterating post reduction 1 with 1740 rules applied. Total rules applied 1920 place count 7740 transition count 10380
Reduce places removed 1560 places and 0 transitions.
Iterating post reduction 2 with 1560 rules applied. Total rules applied 3480 place count 6180 transition count 10380
Discarding 60 places :
Symmetric choice reduction at 3 with 60 rule applications. Total rules 3540 place count 6120 transition count 10320
Iterating global reduction 3 with 60 rules applied. Total rules applied 3600 place count 6120 transition count 10320
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 3 with 480 rules applied. Total rules applied 4080 place count 5880 transition count 10080
Applied a total of 4080 rules in 1673 ms. Remains 5880 /7920 variables (removed 2040) and now considering 10080/12120 (removed 2040) transitions.
// Phase 1: matrix 10080 rows 5880 cols
[2022-05-16 02:33:51] [INFO ] Computed 60 place invariants in 55 ms
[2022-05-16 02:33:51] [INFO ] Implicit Places using invariants in 520 ms returned []
Implicit Place search using SMT only with invariants took 522 ms to find 0 implicit places.
// Phase 1: matrix 10080 rows 5880 cols
[2022-05-16 02:33:51] [INFO ] Computed 60 place invariants in 56 ms
[2022-05-16 02:33:57] [INFO ] Dead Transitions using invariants and state equation in 5983 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5880/7920 places, 10080/12120 transitions.
Finished structural reductions, in 1 iterations. Remains : 5880/7920 places, 10080/12120 transitions.
Stuttering acceptance computed with spot in 197 ms :[(NOT p2)]
Running random walk in product with property : BART-PT-060-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p2:(AND (OR (EQ s64 1) (EQ s66 1) (EQ s68 1) (EQ s70 1) (EQ s72 1) (EQ s74 1) (EQ s76 1) (EQ s78 1) (EQ s80 1) (EQ s82 1) (EQ s84 1) (EQ s86 1) (EQ s88 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]]
Product exploration explored 100000 steps with 519 reset in 3070 ms.
Product exploration explored 100000 steps with 535 reset in 3068 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 p2), (X (NOT p2))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 96 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 32 ms :[(NOT p2)]
Finished random walk after 195 steps, including 0 resets, run visited all 1 properties in 9 ms. (steps per millisecond=21 )
Knowledge obtained : [(NOT p2), (X (NOT p2))]
False Knowledge obtained : [(F p2)]
Knowledge based reduction with 2 factoid took 88 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 26 ms :[(NOT p2)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p2)]
[2022-05-16 02:35:27] [WARNING] OOM error produced while checking expression EG (NOT p2)
Could not prove EG (NOT p2)
Support contains 4140 out of 5880 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5880/5880 places, 10080/10080 transitions.
Applied a total of 0 rules in 150 ms. Remains 5880 /5880 variables (removed 0) and now considering 10080/10080 (removed 0) transitions.
// Phase 1: matrix 10080 rows 5880 cols
[2022-05-16 02:35:27] [INFO ] Computed 60 place invariants in 64 ms
[2022-05-16 02:35:28] [INFO ] Implicit Places using invariants in 725 ms returned []
Implicit Place search using SMT only with invariants took 727 ms to find 0 implicit places.
// Phase 1: matrix 10080 rows 5880 cols
[2022-05-16 02:35:28] [INFO ] Computed 60 place invariants in 30 ms
[2022-05-16 02:35:33] [INFO ] Dead Transitions using invariants and state equation in 5541 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5880/5880 places, 10080/10080 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 p2), (X (NOT p2))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 87 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 35 ms :[(NOT p2)]
Finished random walk after 189 steps, including 0 resets, run visited all 1 properties in 7 ms. (steps per millisecond=27 )
Knowledge obtained : [(NOT p2), (X (NOT p2))]
False Knowledge obtained : [(F p2)]
Knowledge based reduction with 2 factoid took 108 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 37 ms :[(NOT p2)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p2)]
[2022-05-16 02:37:21] [WARNING] OOM error produced while checking expression EG (NOT p2)
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 39 ms :[(NOT p2)]
Product exploration explored 100000 steps with 530 reset in 3482 ms.
Product exploration explored 100000 steps with 537 reset in 3332 ms.
Built C files in :
/tmp/ltsmin15705752544175327816
[2022-05-16 02:37:28] [INFO ] Too many transitions (10080) to apply POR reductions. Disabling POR matrices.
[2022-05-16 02:37:28] [INFO ] Built C files in 95ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15705752544175327816
Running compilation step : cd /tmp/ltsmin15705752544175327816;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15705752544175327816;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15705752544175327816;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 4140 out of 5880 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5880/5880 places, 10080/10080 transitions.
Applied a total of 0 rules in 221 ms. Remains 5880 /5880 variables (removed 0) and now considering 10080/10080 (removed 0) transitions.
// Phase 1: matrix 10080 rows 5880 cols
[2022-05-16 02:37:31] [INFO ] Computed 60 place invariants in 47 ms
[2022-05-16 02:37:32] [INFO ] Implicit Places using invariants in 861 ms returned []
Implicit Place search using SMT only with invariants took 863 ms to find 0 implicit places.
// Phase 1: matrix 10080 rows 5880 cols
[2022-05-16 02:37:32] [INFO ] Computed 60 place invariants in 31 ms
[2022-05-16 02:37:47] [INFO ] Dead Transitions using invariants and state equation in 14825 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5880/5880 places, 10080/10080 transitions.
Built C files in :
/tmp/ltsmin11131036513997031168
[2022-05-16 02:37:47] [INFO ] Too many transitions (10080) to apply POR reductions. Disabling POR matrices.
[2022-05-16 02:37:47] [INFO ] Built C files in 124ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11131036513997031168
Running compilation step : cd /tmp/ltsmin11131036513997031168;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11131036513997031168;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11131036513997031168;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-16 02:37:51] [INFO ] Flatten gal took : 248 ms
[2022-05-16 02:37:52] [INFO ] Flatten gal took : 376 ms
[2022-05-16 02:37:52] [INFO ] Time to serialize gal into /tmp/LTL2952500777817759245.gal : 97 ms
[2022-05-16 02:37:52] [INFO ] Time to serialize properties into /tmp/LTL5983667447882397005.ltl : 19 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2952500777817759245.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5983667447882397005.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL2952500...266
Read 1 LTL properties
Checking formula 0 : !(((!(F(G(!((X("(((((((((((((TrainState_7_1_10==1)||(TrainState_45_3_11==1))||((TrainState_37_1_26==1)||(TrainState_5_1_38==1)))||(((T...220807
Formula 0 simplified : !(!FG!("(((((((TrainState_5_1_1==1)||(TrainState_7_1_1==1))||((TrainState_9_1_1==1)||(TrainState_11_1_1==1)))||(((TrainState_13_1_1=...220792
Detected timeout of ITS tools.
[2022-05-16 02:38:07] [INFO ] Flatten gal took : 388 ms
[2022-05-16 02:38:07] [INFO ] Applying decomposition
[2022-05-16 02:38:08] [INFO ] Flatten gal took : 457 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph5912595633743385996.txt' '-o' '/tmp/graph5912595633743385996.bin' '-w' '/tmp/graph5912595633743385996.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph5912595633743385996.bin' '-l' '-1' '-v' '-w' '/tmp/graph5912595633743385996.weights' '-q' '0' '-e' '0.001'
[2022-05-16 02:38:10] [INFO ] Decomposing Gal with order
[2022-05-16 02:38:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 02:38:13] [INFO ] Removed a total of 561 redundant transitions.
[2022-05-16 02:38:13] [INFO ] Flatten gal took : 1296 ms
[2022-05-16 02:38:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 77 ms.
[2022-05-16 02:38:14] [INFO ] Time to serialize gal into /tmp/LTL4883359425612701459.gal : 95 ms
[2022-05-16 02:38:14] [INFO ] Time to serialize properties into /tmp/LTL17127403620616124435.ltl : 54 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4883359425612701459.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17127403620616124435.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL4883359...246
Read 1 LTL properties
Checking formula 0 : !(((!(F(G(!((X("(((((((((((((i3.u113.TrainState_7_1_10==1)||(i11.u373.TrainState_45_3_11==1))||((i29.u155.TrainState_37_1_26==1)||(i19...295901
Formula 0 simplified : !(!FG!("(((((((i19.u30.TrainState_5_1_1==1)||(i3.u1.TrainState_7_1_1==1))||((i46.u3.TrainState_9_1_1==1)||(i4.u33.TrainState_11_1_1=...295886
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
1044 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,11.0993,272216,1,0,498030,19581,36145,883121,3478,61113,645964
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA BART-PT-060-LTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property BART-PT-060-LTLFireability-00 finished in 277966 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X((F(p0)||p1))||G(p2)))'
Support contains 5880 out of 7920 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7920/7920 places, 12120/12120 transitions.
Applied a total of 0 rules in 160 ms. Remains 7920 /7920 variables (removed 0) and now considering 12120/12120 (removed 0) transitions.
// Phase 1: matrix 12120 rows 7920 cols
[2022-05-16 02:38:27] [INFO ] Computed 60 place invariants in 127 ms
[2022-05-16 02:38:29] [INFO ] Implicit Places using invariants in 1358 ms returned []
Implicit Place search using SMT only with invariants took 1372 ms to find 0 implicit places.
// Phase 1: matrix 12120 rows 7920 cols
[2022-05-16 02:38:29] [INFO ] Computed 60 place invariants in 37 ms
[2022-05-16 02:38:29] [INFO ] Dead Transitions using invariants and state equation in 870 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 7920/7920 places, 12120/12120 transitions.
Stuttering acceptance computed with spot in 255 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : BART-PT-060-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 0}], [{ cond=(NOT p2), acceptance={} source=2 dest: 1}, { cond=p2, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=4 dest: 0}, { cond=(AND p2 (NOT p0)), acceptance={} source=4 dest: 4}]], initial=2, aps=[p0:(OR (EQ s3876 1) (EQ s4244 1) (EQ s7630 1) (EQ s2583 1) (EQ s6052 1) (EQ s1833 1) (EQ s7217 1) (EQ s1649 1) (EQ s1884 1) (EQ s4810 1) (EQ s4759 1) (EQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 9201 ms.
Product exploration explored 100000 steps with 50000 reset in 8816 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p1) (NOT p0))))
Knowledge based reduction with 4 factoid took 104 ms. Reduced automaton from 5 states, 8 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA BART-PT-060-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BART-PT-060-LTLFireability-02 finished in 20995 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X((G((F(p0)&&p1))||G(p1)))))'
Support contains 60 out of 7920 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7920/7920 places, 12120/12120 transitions.
Drop transitions removed 3840 transitions
Trivial Post-agglo rules discarded 3840 transitions
Performed 3840 trivial Post agglomeration. Transition count delta: 3840
Iterating post reduction 0 with 3840 rules applied. Total rules applied 3840 place count 7920 transition count 8280
Reduce places removed 3840 places and 0 transitions.
Iterating post reduction 1 with 3840 rules applied. Total rules applied 7680 place count 4080 transition count 8280
Performed 240 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 240 Pre rules applied. Total rules applied 7680 place count 4080 transition count 8040
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 8160 place count 3840 transition count 8040
Discarding 360 places :
Symmetric choice reduction at 2 with 360 rule applications. Total rules 8520 place count 3480 transition count 7680
Iterating global reduction 2 with 360 rules applied. Total rules applied 8880 place count 3480 transition count 7680
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 2 with 60 rules applied. Total rules applied 8940 place count 3480 transition count 7620
Discarding 240 places :
Symmetric choice reduction at 3 with 240 rule applications. Total rules 9180 place count 3240 transition count 7380
Iterating global reduction 3 with 240 rules applied. Total rules applied 9420 place count 3240 transition count 7380
Discarding 180 places :
Symmetric choice reduction at 3 with 180 rule applications. Total rules 9600 place count 3060 transition count 7200
Iterating global reduction 3 with 180 rules applied. Total rules applied 9780 place count 3060 transition count 7200
Discarding 180 places :
Symmetric choice reduction at 3 with 180 rule applications. Total rules 9960 place count 2880 transition count 7020
Iterating global reduction 3 with 180 rules applied. Total rules applied 10140 place count 2880 transition count 7020
Discarding 120 places :
Symmetric choice reduction at 3 with 120 rule applications. Total rules 10260 place count 2760 transition count 6900
Iterating global reduction 3 with 120 rules applied. Total rules applied 10380 place count 2760 transition count 6900
Discarding 120 places :
Symmetric choice reduction at 3 with 120 rule applications. Total rules 10500 place count 2640 transition count 6780
Iterating global reduction 3 with 120 rules applied. Total rules applied 10620 place count 2640 transition count 6780
Discarding 60 places :
Symmetric choice reduction at 3 with 60 rule applications. Total rules 10680 place count 2580 transition count 6720
Iterating global reduction 3 with 60 rules applied. Total rules applied 10740 place count 2580 transition count 6720
Performed 420 Post agglomeration using F-continuation condition.Transition count delta: 420
Deduced a syphon composed of 420 places in 1 ms
Reduce places removed 420 places and 0 transitions.
Iterating global reduction 3 with 840 rules applied. Total rules applied 11580 place count 2160 transition count 6300
Ensure Unique test removed 240 transitions
Reduce isomorphic transitions removed 240 transitions.
Iterating post reduction 3 with 240 rules applied. Total rules applied 11820 place count 2160 transition count 6060
Performed 120 Post agglomeration using F-continuation condition.Transition count delta: 120
Deduced a syphon composed of 120 places in 1 ms
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 4 with 240 rules applied. Total rules applied 12060 place count 2040 transition count 5940
Ensure Unique test removed 240 transitions
Reduce isomorphic transitions removed 240 transitions.
Iterating post reduction 4 with 240 rules applied. Total rules applied 12300 place count 2040 transition count 5700
Performed 120 Post agglomeration using F-continuation condition.Transition count delta: 120
Deduced a syphon composed of 120 places in 1 ms
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 5 with 240 rules applied. Total rules applied 12540 place count 1920 transition count 5580
Ensure Unique test removed 240 transitions
Reduce isomorphic transitions removed 240 transitions.
Iterating post reduction 5 with 240 rules applied. Total rules applied 12780 place count 1920 transition count 5340
Performed 120 Post agglomeration using F-continuation condition.Transition count delta: 120
Deduced a syphon composed of 120 places in 1 ms
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 6 with 240 rules applied. Total rules applied 13020 place count 1800 transition count 5220
Ensure Unique test removed 240 transitions
Reduce isomorphic transitions removed 240 transitions.
Iterating post reduction 6 with 240 rules applied. Total rules applied 13260 place count 1800 transition count 4980
Performed 120 Post agglomeration using F-continuation condition.Transition count delta: 120
Deduced a syphon composed of 120 places in 0 ms
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 7 with 240 rules applied. Total rules applied 13500 place count 1680 transition count 4860
Ensure Unique test removed 240 transitions
Reduce isomorphic transitions removed 240 transitions.
Iterating post reduction 7 with 240 rules applied. Total rules applied 13740 place count 1680 transition count 4620
Performed 120 Post agglomeration using F-continuation condition.Transition count delta: 120
Deduced a syphon composed of 120 places in 0 ms
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 8 with 240 rules applied. Total rules applied 13980 place count 1560 transition count 4500
Ensure Unique test removed 240 transitions
Reduce isomorphic transitions removed 240 transitions.
Iterating post reduction 8 with 240 rules applied. Total rules applied 14220 place count 1560 transition count 4260
Performed 120 Post agglomeration using F-continuation condition.Transition count delta: 120
Deduced a syphon composed of 120 places in 1 ms
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 9 with 240 rules applied. Total rules applied 14460 place count 1440 transition count 4140
Ensure Unique test removed 240 transitions
Reduce isomorphic transitions removed 240 transitions.
Iterating post reduction 9 with 240 rules applied. Total rules applied 14700 place count 1440 transition count 3900
Performed 120 Post agglomeration using F-continuation condition.Transition count delta: 120
Deduced a syphon composed of 120 places in 0 ms
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 10 with 240 rules applied. Total rules applied 14940 place count 1320 transition count 3780
Ensure Unique test removed 240 transitions
Reduce isomorphic transitions removed 240 transitions.
Iterating post reduction 10 with 240 rules applied. Total rules applied 15180 place count 1320 transition count 3540
Performed 120 Post agglomeration using F-continuation condition.Transition count delta: 120
Deduced a syphon composed of 120 places in 0 ms
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 11 with 240 rules applied. Total rules applied 15420 place count 1200 transition count 3420
Ensure Unique test removed 240 transitions
Reduce isomorphic transitions removed 240 transitions.
Iterating post reduction 11 with 240 rules applied. Total rules applied 15660 place count 1200 transition count 3180
Performed 120 Post agglomeration using F-continuation condition.Transition count delta: 120
Deduced a syphon composed of 120 places in 0 ms
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 12 with 240 rules applied. Total rules applied 15900 place count 1080 transition count 3060
Ensure Unique test removed 240 transitions
Reduce isomorphic transitions removed 240 transitions.
Iterating post reduction 12 with 240 rules applied. Total rules applied 16140 place count 1080 transition count 2820
Performed 120 Post agglomeration using F-continuation condition.Transition count delta: 120
Deduced a syphon composed of 120 places in 0 ms
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 13 with 240 rules applied. Total rules applied 16380 place count 960 transition count 2700
Ensure Unique test removed 240 transitions
Reduce isomorphic transitions removed 240 transitions.
Iterating post reduction 13 with 240 rules applied. Total rules applied 16620 place count 960 transition count 2460
Performed 120 Post agglomeration using F-continuation condition.Transition count delta: 120
Deduced a syphon composed of 120 places in 0 ms
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 14 with 240 rules applied. Total rules applied 16860 place count 840 transition count 2340
Ensure Unique test removed 240 transitions
Reduce isomorphic transitions removed 240 transitions.
Iterating post reduction 14 with 240 rules applied. Total rules applied 17100 place count 840 transition count 2100
Performed 120 Post agglomeration using F-continuation condition.Transition count delta: 120
Deduced a syphon composed of 120 places in 1 ms
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 15 with 240 rules applied. Total rules applied 17340 place count 720 transition count 1980
Ensure Unique test removed 240 transitions
Reduce isomorphic transitions removed 240 transitions.
Iterating post reduction 15 with 240 rules applied. Total rules applied 17580 place count 720 transition count 1740
Performed 120 Post agglomeration using F-continuation condition.Transition count delta: 120
Deduced a syphon composed of 120 places in 0 ms
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 16 with 240 rules applied. Total rules applied 17820 place count 600 transition count 1620
Ensure Unique test removed 240 transitions
Reduce isomorphic transitions removed 240 transitions.
Iterating post reduction 16 with 240 rules applied. Total rules applied 18060 place count 600 transition count 1380
Performed 120 Post agglomeration using F-continuation condition.Transition count delta: 120
Deduced a syphon composed of 120 places in 0 ms
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 17 with 240 rules applied. Total rules applied 18300 place count 480 transition count 1260
Ensure Unique test removed 240 transitions
Reduce isomorphic transitions removed 240 transitions.
Iterating post reduction 17 with 240 rules applied. Total rules applied 18540 place count 480 transition count 1020
Performed 120 Post agglomeration using F-continuation condition.Transition count delta: 120
Deduced a syphon composed of 120 places in 0 ms
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 18 with 240 rules applied. Total rules applied 18780 place count 360 transition count 900
Ensure Unique test removed 240 transitions
Reduce isomorphic transitions removed 240 transitions.
Iterating post reduction 18 with 240 rules applied. Total rules applied 19020 place count 360 transition count 660
Performed 120 Post agglomeration using F-continuation condition.Transition count delta: 120
Deduced a syphon composed of 120 places in 0 ms
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 19 with 240 rules applied. Total rules applied 19260 place count 240 transition count 540
Ensure Unique test removed 240 transitions
Reduce isomorphic transitions removed 240 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 19 with 300 rules applied. Total rules applied 19560 place count 240 transition count 240
Reduce places removed 60 places and 0 transitions.
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 20 with 120 rules applied. Total rules applied 19680 place count 180 transition count 180
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 21 with 60 Pre rules applied. Total rules applied 19680 place count 180 transition count 120
Deduced a syphon composed of 60 places in 0 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 21 with 120 rules applied. Total rules applied 19800 place count 120 transition count 120
Applied a total of 19800 rules in 3130 ms. Remains 120 /7920 variables (removed 7800) and now considering 120/12120 (removed 12000) transitions.
// Phase 1: matrix 120 rows 120 cols
[2022-05-16 02:38:51] [INFO ] Computed 60 place invariants in 1 ms
[2022-05-16 02:38:51] [INFO ] Implicit Places using invariants in 72 ms returned []
// Phase 1: matrix 120 rows 120 cols
[2022-05-16 02:38:51] [INFO ] Computed 60 place invariants in 0 ms
[2022-05-16 02:38:51] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 170 ms to find 0 implicit places.
[2022-05-16 02:38:51] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 120 rows 120 cols
[2022-05-16 02:38:51] [INFO ] Computed 60 place invariants in 1 ms
[2022-05-16 02:38:52] [INFO ] Dead Transitions using invariants and state equation in 155 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 120/7920 places, 120/12120 transitions.
Finished structural reductions, in 1 iterations. Remains : 120/7920 places, 120/12120 transitions.
Stuttering acceptance computed with spot in 61 ms :[(NOT p1)]
Running random walk in product with property : BART-PT-060-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(OR (EQ s64 1) (EQ s66 1) (EQ s68 1) (EQ s70 1) (EQ s72 1) (EQ s74 1) (EQ s76 1) (EQ s78 1) (EQ s80 1) (EQ s82 1) (EQ s84 1) (EQ s86 1) (EQ s88 1) (EQ ...], 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 615 ms.
Product exploration explored 100000 steps with 0 reset in 851 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 p1), (X p1)]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 2 factoid took 140 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 31 ms :[(NOT p1)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p1), (X p1)]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1))), (F p1)]
Knowledge based reduction with 2 factoid took 149 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 31 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 27 ms :[(NOT p1)]
// Phase 1: matrix 120 rows 120 cols
[2022-05-16 02:38:53] [INFO ] Computed 60 place invariants in 0 ms
[2022-05-16 02:38:54] [INFO ] [Real]Absence check using 60 positive place invariants in 35 ms returned sat
[2022-05-16 02:38:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 02:38:54] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2022-05-16 02:38:54] [INFO ] Computed and/alt/rep : 60/60/60 causal constraints (skipped 0 transitions) in 7 ms.
[2022-05-16 02:38:54] [INFO ] Added : 0 causal constraints over 0 iterations in 18 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 60 out of 120 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 120/120 places, 120/120 transitions.
Applied a total of 0 rules in 2 ms. Remains 120 /120 variables (removed 0) and now considering 120/120 (removed 0) transitions.
// Phase 1: matrix 120 rows 120 cols
[2022-05-16 02:38:54] [INFO ] Computed 60 place invariants in 0 ms
[2022-05-16 02:38:54] [INFO ] Implicit Places using invariants in 40 ms returned []
// Phase 1: matrix 120 rows 120 cols
[2022-05-16 02:38:54] [INFO ] Computed 60 place invariants in 1 ms
[2022-05-16 02:38:54] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
[2022-05-16 02:38:54] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 120 rows 120 cols
[2022-05-16 02:38:54] [INFO ] Computed 60 place invariants in 0 ms
[2022-05-16 02:38:54] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 120/120 places, 120/120 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 p1), (X p1)]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 2 factoid took 111 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 28 ms :[(NOT p1)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p1), (X p1)]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1))), (F p1)]
Knowledge based reduction with 2 factoid took 118 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 35 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 51 ms :[(NOT p1)]
// Phase 1: matrix 120 rows 120 cols
[2022-05-16 02:38:54] [INFO ] Computed 60 place invariants in 0 ms
[2022-05-16 02:38:55] [INFO ] [Real]Absence check using 60 positive place invariants in 13 ms returned sat
[2022-05-16 02:38:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 02:38:55] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2022-05-16 02:38:55] [INFO ] Computed and/alt/rep : 60/60/60 causal constraints (skipped 0 transitions) in 8 ms.
[2022-05-16 02:38:55] [INFO ] Added : 0 causal constraints over 0 iterations in 21 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 32 ms :[(NOT p1)]
Product exploration explored 100000 steps with 0 reset in 463 ms.
Product exploration explored 100000 steps with 0 reset in 649 ms.
Built C files in :
/tmp/ltsmin615701246277299497
[2022-05-16 02:38:56] [INFO ] Computing symmetric may disable matrix : 120 transitions.
[2022-05-16 02:38:56] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 02:38:56] [INFO ] Computing symmetric may enable matrix : 120 transitions.
[2022-05-16 02:38:56] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 02:38:56] [INFO ] Computing Do-Not-Accords matrix : 120 transitions.
[2022-05-16 02:38:56] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 02:38:56] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin615701246277299497
Running compilation step : cd /tmp/ltsmin615701246277299497;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 302 ms.
Running link step : cd /tmp/ltsmin615701246277299497;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 69 ms.
Running LTSmin : cd /tmp/ltsmin615701246277299497;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased18250484215329344339.hoa' '--buchi-type=spotba'
LTSmin run took 153 ms.
FORMULA BART-PT-060-LTLFireability-04 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property BART-PT-060-LTLFireability-04 finished in 8360 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((G((X(p1)||p0)) U G((G(p1)&&G(p2))))))'
Support contains 4680 out of 7920 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7920/7920 places, 12120/12120 transitions.
Applied a total of 0 rules in 313 ms. Remains 7920 /7920 variables (removed 0) and now considering 12120/12120 (removed 0) transitions.
// Phase 1: matrix 12120 rows 7920 cols
[2022-05-16 02:38:57] [INFO ] Computed 60 place invariants in 68 ms
[2022-05-16 02:38:58] [INFO ] Implicit Places using invariants in 1384 ms returned []
Implicit Place search using SMT only with invariants took 1388 ms to find 0 implicit places.
// Phase 1: matrix 12120 rows 7920 cols
[2022-05-16 02:38:58] [INFO ] Computed 60 place invariants in 67 ms
[2022-05-16 02:38:59] [INFO ] Dead Transitions using invariants and state equation in 1221 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 7920/7920 places, 12120/12120 transitions.
Stuttering acceptance computed with spot in 159 ms :[(OR (NOT p2) (NOT p1)), (NOT p1), true]
Running random walk in product with property : BART-PT-060-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(AND p1 p2), acceptance={} source=0 dest: 0}, { cond=(OR (NOT p1) (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(OR (EQ s1146 1) (EQ s1484 1) (EQ s4956 1) (EQ s7624 1) (EQ s2507 1) (EQ s2704 1) (EQ s4412 1) (EQ s1343 1) (EQ s3051 1) (EQ s1287 1) (EQ s6857 1) (EQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 16204 steps with 5420 reset in 2808 ms.
FORMULA BART-PT-060-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-060-LTLFireability-05 finished in 5945 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((!(!(F(p1)||p0) U p1)||(G(p2) U p3))))'
Support contains 7320 out of 7920 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7920/7920 places, 12120/12120 transitions.
Applied a total of 0 rules in 27 ms. Remains 7920 /7920 variables (removed 0) and now considering 12120/12120 (removed 0) transitions.
// Phase 1: matrix 12120 rows 7920 cols
[2022-05-16 02:39:02] [INFO ] Computed 60 place invariants in 66 ms
[2022-05-16 02:39:04] [INFO ] Implicit Places using invariants in 1221 ms returned []
Implicit Place search using SMT only with invariants took 1222 ms to find 0 implicit places.
// Phase 1: matrix 12120 rows 7920 cols
[2022-05-16 02:39:04] [INFO ] Computed 60 place invariants in 34 ms
[2022-05-16 02:39:05] [INFO ] Dead Transitions using invariants and state equation in 1257 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 7920/7920 places, 12120/12120 transitions.
Stuttering acceptance computed with spot in 116 ms :[(NOT p2), (AND p1 (NOT p3)), (OR (NOT p2) (NOT p3)), true, (AND p1 (NOT p3))]
Running random walk in product with property : BART-PT-060-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=(AND p1 (NOT p3) p2), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p3) (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(AND p3 p2), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p3) p2), acceptance={0} source=2 dest: 2}, { cond=(NOT p2), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=4, aps=[p2:(OR (EQ s1146 1) (EQ s1484 1) (EQ s4956 1) (EQ s7624 1) (EQ s2507 1) (EQ s2704 1) (EQ s4412 1) (EQ s1343 1) (EQ s3051 1) (EQ s1287 1) (EQ s6857 1) (EQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 2280 ms.
Product exploration explored 100000 steps with 0 reset in 2807 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p3)), (X (NOT (AND p1 (NOT p3) (NOT p2))))]
False Knowledge obtained : [(X (AND p1 (NOT p3) p2)), (X (NOT (AND p1 (NOT p3) p2)))]
Knowledge based reduction with 2 factoid took 153 ms. Reduced automaton from 5 states, 9 edges and 3 AP to 5 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 119 ms :[(NOT p2), (AND p1 (NOT p3)), (OR (NOT p2) (NOT p3)), true, (AND p1 (NOT p3))]
Finished random walk after 227 steps, including 0 resets, run visited all 4 properties in 10 ms. (steps per millisecond=22 )
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p3)), (X (NOT (AND p1 (NOT p3) (NOT p2))))]
False Knowledge obtained : [(X (AND p1 (NOT p3) p2)), (X (NOT (AND p1 (NOT p3) p2))), (F (AND p2 (NOT p3))), (F p2), (F (AND p2 p3)), (F (AND p1 (NOT p3)))]
Knowledge based reduction with 2 factoid took 325 ms. Reduced automaton from 5 states, 8 edges and 3 AP to 5 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 158 ms :[(NOT p2), (AND p1 (NOT p3)), (OR (NOT p2) (NOT p3)), true, (AND p1 (NOT p3))]
Stuttering acceptance computed with spot in 219 ms :[(NOT p2), (AND p1 (NOT p3)), (OR (NOT p2) (NOT p3)), true, (AND p1 (NOT p3))]
Support contains 7320 out of 7920 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7920/7920 places, 12120/12120 transitions.
Applied a total of 0 rules in 44 ms. Remains 7920 /7920 variables (removed 0) and now considering 12120/12120 (removed 0) transitions.
// Phase 1: matrix 12120 rows 7920 cols
[2022-05-16 02:39:12] [INFO ] Computed 60 place invariants in 72 ms
[2022-05-16 02:39:13] [INFO ] Implicit Places using invariants in 1417 ms returned []
Implicit Place search using SMT only with invariants took 1419 ms to find 0 implicit places.
// Phase 1: matrix 12120 rows 7920 cols
[2022-05-16 02:39:13] [INFO ] Computed 60 place invariants in 37 ms
[2022-05-16 02:39:14] [INFO ] Dead Transitions using invariants and state equation in 942 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 7920/7920 places, 12120/12120 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p3))]
False Knowledge obtained : [(X (AND p1 (NOT p3))), (X (NOT (AND p1 (NOT p3))))]
Knowledge based reduction with 1 factoid took 118 ms. Reduced automaton from 5 states, 8 edges and 3 AP to 5 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 212 ms :[(NOT p2), (AND p1 (NOT p3)), (OR (NOT p2) (NOT p3)), true, (AND p1 (NOT p3))]
Finished random walk after 245 steps, including 0 resets, run visited all 4 properties in 17 ms. (steps per millisecond=14 )
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p3))]
False Knowledge obtained : [(X (AND p1 (NOT p3))), (X (NOT (AND p1 (NOT p3)))), (F (AND p2 (NOT p3))), (F p2), (F (AND p2 p3)), (F (AND p1 (NOT p3)))]
Knowledge based reduction with 1 factoid took 234 ms. Reduced automaton from 5 states, 8 edges and 3 AP to 5 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 202 ms :[(NOT p2), (AND p1 (NOT p3)), (OR (NOT p2) (NOT p3)), true, (AND p1 (NOT p3))]
Stuttering acceptance computed with spot in 222 ms :[(NOT p2), (AND p1 (NOT p3)), (OR (NOT p2) (NOT p3)), true, (AND p1 (NOT p3))]
Stuttering acceptance computed with spot in 197 ms :[(NOT p2), (AND p1 (NOT p3)), (OR (NOT p2) (NOT p3)), true, (AND p1 (NOT p3))]
Product exploration explored 100000 steps with 0 reset in 2228 ms.
Product exploration explored 100000 steps with 0 reset in 2111 ms.
Applying partial POR strategy [true, false, true, true, false]
Stuttering acceptance computed with spot in 206 ms :[(NOT p2), (AND p1 (NOT p3)), (OR (NOT p2) (NOT p3)), true, (AND p1 (NOT p3))]
Support contains 7320 out of 7920 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7920/7920 places, 12120/12120 transitions.
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 7920 transition count 12120
Performed 240 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 300 places in 4 ms
Iterating global reduction 1 with 240 rules applied. Total rules applied 300 place count 7920 transition count 12120
Discarding 120 places :
Symmetric choice reduction at 1 with 120 rule applications. Total rules 420 place count 7800 transition count 12000
Deduced a syphon composed of 180 places in 3 ms
Iterating global reduction 1 with 120 rules applied. Total rules applied 540 place count 7800 transition count 12000
Deduced a syphon composed of 180 places in 3 ms
Applied a total of 540 rules in 554 ms. Remains 7800 /7920 variables (removed 120) and now considering 12000/12120 (removed 120) transitions.
// Phase 1: matrix 12000 rows 7800 cols
[2022-05-16 02:39:21] [INFO ] Computed 60 place invariants in 74 ms
[2022-05-16 02:39:22] [INFO ] Dead Transitions using invariants and state equation in 959 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 7800/7920 places, 12000/12120 transitions.
Finished structural reductions, in 1 iterations. Remains : 7800/7920 places, 12000/12120 transitions.
Product exploration explored 100000 steps with 0 reset in 2212 ms.
Product exploration explored 100000 steps with 0 reset in 2035 ms.
Built C files in :
/tmp/ltsmin11573683178975706080
[2022-05-16 02:39:26] [INFO ] Built C files in 149ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11573683178975706080
Running compilation step : cd /tmp/ltsmin11573683178975706080;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11573683178975706080;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11573683178975706080;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 7320 out of 7920 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7920/7920 places, 12120/12120 transitions.
Applied a total of 0 rules in 33 ms. Remains 7920 /7920 variables (removed 0) and now considering 12120/12120 (removed 0) transitions.
// Phase 1: matrix 12120 rows 7920 cols
[2022-05-16 02:39:29] [INFO ] Computed 60 place invariants in 68 ms
[2022-05-16 02:39:30] [INFO ] Implicit Places using invariants in 918 ms returned []
Implicit Place search using SMT only with invariants took 929 ms to find 0 implicit places.
// Phase 1: matrix 12120 rows 7920 cols
[2022-05-16 02:39:30] [INFO ] Computed 60 place invariants in 34 ms
[2022-05-16 02:39:31] [INFO ] Dead Transitions using invariants and state equation in 1352 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 7920/7920 places, 12120/12120 transitions.
Built C files in :
/tmp/ltsmin2942576075572645070
[2022-05-16 02:39:32] [INFO ] Built C files in 133ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2942576075572645070
Running compilation step : cd /tmp/ltsmin2942576075572645070;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2942576075572645070;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2942576075572645070;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-16 02:39:35] [INFO ] Flatten gal took : 311 ms
[2022-05-16 02:39:36] [INFO ] Flatten gal took : 270 ms
[2022-05-16 02:39:36] [INFO ] Time to serialize gal into /tmp/LTL17841194684166450239.gal : 38 ms
[2022-05-16 02:39:36] [INFO ] Time to serialize properties into /tmp/LTL8227875539260081303.ltl : 44 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17841194684166450239.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8227875539260081303.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1784119...267
Read 1 LTL properties
Checking formula 0 : !((X((!((!(((((((((((((F("((((((((((((((TrainState_37_3_21==1)||(TrainState_45_1_23==1))||((TrainState_11_1_38==1)||(TrainState_4_2_16...502360
Formula 0 simplified : !X(!(!("((((((((((((TrainState_45_4_18==1)||(TrainState_38_1_5==1))||((TrainState_29_1_26==1)||(TrainState_5_4_22==1)))||(((TrainSta...502313
Detected timeout of ITS tools.
[2022-05-16 02:39:51] [INFO ] Flatten gal took : 270 ms
[2022-05-16 02:39:51] [INFO ] Applying decomposition
[2022-05-16 02:39:52] [INFO ] Flatten gal took : 303 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph15112892041225981913.txt' '-o' '/tmp/graph15112892041225981913.bin' '-w' '/tmp/graph15112892041225981913.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph15112892041225981913.bin' '-l' '-1' '-v' '-w' '/tmp/graph15112892041225981913.weights' '-q' '0' '-e' '0.001'
[2022-05-16 02:39:52] [INFO ] Decomposing Gal with order
[2022-05-16 02:39:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 02:39:56] [INFO ] Removed a total of 861 redundant transitions.
[2022-05-16 02:39:56] [INFO ] Flatten gal took : 722 ms
[2022-05-16 02:40:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 70 ms.
[2022-05-16 02:40:15] [INFO ] Time to serialize gal into /tmp/LTL3356819649709868302.gal : 72 ms
[2022-05-16 02:40:15] [INFO ] Time to serialize properties into /tmp/LTL8236854681092506683.ltl : 42 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3356819649709868302.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8236854681092506683.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL3356819...245
Read 1 LTL properties
Checking formula 0 : !((X((!((!(((((((((((((F("((((((((((((((i5.i4.u1271.TrainState_37_3_21==1)||(i29.i0.u166.TrainState_45_1_23==1))||((i23.i0.u121.TrainS...733005
Formula 0 simplified : !X(!(!("((((((((((((i29.i0.u1276.TrainState_45_4_18==1)||(i54.i6.u1389.TrainState_38_1_5==1))||((i49.i0.u436.TrainState_29_1_26==1)|...732958
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin228905383782521939
[2022-05-16 02:40:30] [INFO ] Built C files in 125ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin228905383782521939
Running compilation step : cd /tmp/ltsmin228905383782521939;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin228905383782521939;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin228905383782521939;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property BART-PT-060-LTLFireability-06 finished in 90563 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 4080 out of 7920 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7920/7920 places, 12120/12120 transitions.
Drop transitions removed 180 transitions
Trivial Post-agglo rules discarded 180 transitions
Performed 180 trivial Post agglomeration. Transition count delta: 180
Iterating post reduction 0 with 180 rules applied. Total rules applied 180 place count 7920 transition count 11940
Reduce places removed 180 places and 0 transitions.
Performed 1620 Post agglomeration using F-continuation condition.Transition count delta: 1620
Iterating post reduction 1 with 1800 rules applied. Total rules applied 1980 place count 7740 transition count 10320
Reduce places removed 1620 places and 0 transitions.
Iterating post reduction 2 with 1620 rules applied. Total rules applied 3600 place count 6120 transition count 10320
Discarding 60 places :
Symmetric choice reduction at 3 with 60 rule applications. Total rules 3660 place count 6060 transition count 10260
Iterating global reduction 3 with 60 rules applied. Total rules applied 3720 place count 6060 transition count 10260
Performed 240 Post agglomeration using F-continuation condition.Transition count delta: 240
Deduced a syphon composed of 240 places in 3 ms
Reduce places removed 240 places and 0 transitions.
Iterating global reduction 3 with 480 rules applied. Total rules applied 4200 place count 5820 transition count 10020
Applied a total of 4200 rules in 1280 ms. Remains 5820 /7920 variables (removed 2100) and now considering 10020/12120 (removed 2100) transitions.
// Phase 1: matrix 10020 rows 5820 cols
[2022-05-16 02:40:34] [INFO ] Computed 60 place invariants in 58 ms
[2022-05-16 02:40:35] [INFO ] Implicit Places using invariants in 770 ms returned []
Implicit Place search using SMT only with invariants took 771 ms to find 0 implicit places.
// Phase 1: matrix 10020 rows 5820 cols
[2022-05-16 02:40:35] [INFO ] Computed 60 place invariants in 32 ms
[2022-05-16 02:40:40] [INFO ] Dead Transitions using invariants and state equation in 4865 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5820/7920 places, 10020/12120 transitions.
Finished structural reductions, in 1 iterations. Remains : 5820/7920 places, 10020/12120 transitions.
Stuttering acceptance computed with spot in 56 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BART-PT-060-LTLFireability-07 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:(OR (EQ s966 1) (EQ s1184 1) (EQ s3696 1) (EQ s5644 1) (EQ s1907 1) (EQ s2044 1) (EQ s3272 1) (EQ s1103 1) (EQ s2271 1) (EQ s1047 1) (EQ s5117 1) (EQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 1688 ms.
Product exploration explored 100000 steps with 0 reset in 1632 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 : []
Knowledge based reduction with 2 factoid took 60 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 55 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=0 )
Knowledge obtained : [(NOT p0), (X p0)]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 78 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 56 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 52 ms :[(NOT p0), (NOT p0)]
[2022-05-16 02:42:26] [WARNING] OOM error produced while checking expression EG (NOT p0)
Could not prove EG (NOT p0)
Support contains 4080 out of 5820 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5820/5820 places, 10020/10020 transitions.
Applied a total of 0 rules in 206 ms. Remains 5820 /5820 variables (removed 0) and now considering 10020/10020 (removed 0) transitions.
// Phase 1: matrix 10020 rows 5820 cols
[2022-05-16 02:42:27] [INFO ] Computed 60 place invariants in 53 ms
[2022-05-16 02:42:27] [INFO ] Implicit Places using invariants in 762 ms returned []
Implicit Place search using SMT only with invariants took 763 ms to find 0 implicit places.
// Phase 1: matrix 10020 rows 5820 cols
[2022-05-16 02:42:27] [INFO ] Computed 60 place invariants in 26 ms
[2022-05-16 02:42:33] [INFO ] Dead Transitions using invariants and state equation in 5248 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5820/5820 places, 10020/10020 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 : []
Knowledge based reduction with 2 factoid took 92 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=0 )
Knowledge obtained : [(NOT p0), (X p0)]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 128 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
[2022-05-16 02:44:07] [WARNING] OOM error produced while checking expression EG (NOT p0)
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 1508 ms.
Product exploration explored 100000 steps with 1 reset in 1755 ms.
Built C files in :
/tmp/ltsmin12032344874678118368
[2022-05-16 02:44:10] [INFO ] Too many transitions (10020) to apply POR reductions. Disabling POR matrices.
[2022-05-16 02:44:10] [INFO ] Built C files in 103ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12032344874678118368
Running compilation step : cd /tmp/ltsmin12032344874678118368;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12032344874678118368;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12032344874678118368;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 4080 out of 5820 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5820/5820 places, 10020/10020 transitions.
Applied a total of 0 rules in 177 ms. Remains 5820 /5820 variables (removed 0) and now considering 10020/10020 (removed 0) transitions.
// Phase 1: matrix 10020 rows 5820 cols
[2022-05-16 02:44:14] [INFO ] Computed 60 place invariants in 58 ms
[2022-05-16 02:44:14] [INFO ] Implicit Places using invariants in 648 ms returned []
Implicit Place search using SMT only with invariants took 649 ms to find 0 implicit places.
// Phase 1: matrix 10020 rows 5820 cols
[2022-05-16 02:44:14] [INFO ] Computed 60 place invariants in 57 ms
[2022-05-16 02:44:20] [INFO ] Dead Transitions using invariants and state equation in 5388 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5820/5820 places, 10020/10020 transitions.
Built C files in :
/tmp/ltsmin2080598544071158702
[2022-05-16 02:44:20] [INFO ] Too many transitions (10020) to apply POR reductions. Disabling POR matrices.
[2022-05-16 02:44:20] [INFO ] Built C files in 48ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2080598544071158702
Running compilation step : cd /tmp/ltsmin2080598544071158702;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2080598544071158702;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2080598544071158702;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-16 02:44:23] [INFO ] Flatten gal took : 162 ms
[2022-05-16 02:44:23] [INFO ] Flatten gal took : 178 ms
[2022-05-16 02:44:23] [INFO ] Time to serialize gal into /tmp/LTL10109238299555576317.gal : 20 ms
[2022-05-16 02:44:23] [INFO ] Time to serialize properties into /tmp/LTL13592368318288033541.ltl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10109238299555576317.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13592368318288033541.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1010923...268
Read 1 LTL properties
Checking formula 0 : !((G(F("(((((((((((((TrainState_7_1_10==1)||(TrainState_45_3_11==1))||((TrainState_37_1_26==1)||(TrainState_5_1_38==1)))||(((TrainStat...108858
Formula 0 simplified : !GF"(((((((((((((TrainState_7_1_10==1)||(TrainState_45_3_11==1))||((TrainState_37_1_26==1)||(TrainState_5_1_38==1)))||(((TrainState_...108852
Detected timeout of ITS tools.
[2022-05-16 02:44:39] [INFO ] Flatten gal took : 156 ms
[2022-05-16 02:44:39] [INFO ] Applying decomposition
[2022-05-16 02:44:39] [INFO ] Flatten gal took : 167 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph13268992055897874831.txt' '-o' '/tmp/graph13268992055897874831.bin' '-w' '/tmp/graph13268992055897874831.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph13268992055897874831.bin' '-l' '-1' '-v' '-w' '/tmp/graph13268992055897874831.weights' '-q' '0' '-e' '0.001'
[2022-05-16 02:44:40] [INFO ] Decomposing Gal with order
[2022-05-16 02:44:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 02:44:41] [INFO ] Removed a total of 1002 redundant transitions.
[2022-05-16 02:44:41] [INFO ] Flatten gal took : 351 ms
[2022-05-16 02:44:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 18 ms.
[2022-05-16 02:44:41] [INFO ] Time to serialize gal into /tmp/LTL15849009671253740597.gal : 27 ms
[2022-05-16 02:44:42] [INFO ] Time to serialize properties into /tmp/LTL2328457768698641904.ltl : 6 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15849009671253740597.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2328457768698641904.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1584900...246
Read 1 LTL properties
Checking formula 0 : !((G(F("(((((((((((((i1.u242.TrainState_7_1_10==1)||(i0.u238.TrainState_45_3_11==1))||((i17.u122.TrainState_37_1_26==1)||(i25.u1679.Tr...145859
Formula 0 simplified : !GF"(((((((((((((i1.u242.TrainState_7_1_10==1)||(i0.u238.TrainState_45_3_11==1))||((i17.u122.TrainState_37_1_26==1)||(i25.u1679.Trai...145853
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
2 unique states visited
0 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
581 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,6.50206,80180,1,0,56410,16496,46049,46594,3456,39469,204560
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA BART-PT-060-LTLFireability-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property BART-PT-060-LTLFireability-07 finished in 255338 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0) U X((G(X(p1))&&p2)))))'
Support contains 3 out of 7920 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7920/7920 places, 12120/12120 transitions.
Discarding 1920 places :
Symmetric choice reduction at 0 with 1920 rule applications. Total rules 1920 place count 6000 transition count 10200
Iterating global reduction 0 with 1920 rules applied. Total rules applied 3840 place count 6000 transition count 10200
Discarding 1620 places :
Symmetric choice reduction at 0 with 1620 rule applications. Total rules 5460 place count 4380 transition count 8580
Iterating global reduction 0 with 1620 rules applied. Total rules applied 7080 place count 4380 transition count 8580
Discarding 240 places :
Symmetric choice reduction at 0 with 240 rule applications. Total rules 7320 place count 4140 transition count 8340
Iterating global reduction 0 with 240 rules applied. Total rules applied 7560 place count 4140 transition count 8340
Discarding 180 places :
Symmetric choice reduction at 0 with 180 rule applications. Total rules 7740 place count 3960 transition count 8160
Iterating global reduction 0 with 180 rules applied. Total rules applied 7920 place count 3960 transition count 8160
Discarding 180 places :
Symmetric choice reduction at 0 with 180 rule applications. Total rules 8100 place count 3780 transition count 7980
Iterating global reduction 0 with 180 rules applied. Total rules applied 8280 place count 3780 transition count 7980
Discarding 180 places :
Symmetric choice reduction at 0 with 180 rule applications. Total rules 8460 place count 3600 transition count 7800
Iterating global reduction 0 with 180 rules applied. Total rules applied 8640 place count 3600 transition count 7800
Discarding 180 places :
Symmetric choice reduction at 0 with 180 rule applications. Total rules 8820 place count 3420 transition count 7620
Iterating global reduction 0 with 180 rules applied. Total rules applied 9000 place count 3420 transition count 7620
Discarding 180 places :
Symmetric choice reduction at 0 with 180 rule applications. Total rules 9180 place count 3240 transition count 7440
Iterating global reduction 0 with 180 rules applied. Total rules applied 9360 place count 3240 transition count 7440
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 9480 place count 3120 transition count 7320
Iterating global reduction 0 with 120 rules applied. Total rules applied 9600 place count 3120 transition count 7320
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 9720 place count 3000 transition count 7200
Iterating global reduction 0 with 120 rules applied. Total rules applied 9840 place count 3000 transition count 7200
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 9900 place count 2940 transition count 7140
Iterating global reduction 0 with 60 rules applied. Total rules applied 9960 place count 2940 transition count 7140
Applied a total of 9960 rules in 3393 ms. Remains 2940 /7920 variables (removed 4980) and now considering 7140/12120 (removed 4980) transitions.
// Phase 1: matrix 7140 rows 2940 cols
[2022-05-16 02:44:52] [INFO ] Computed 60 place invariants in 15 ms
[2022-05-16 02:44:52] [INFO ] Implicit Places using invariants in 239 ms returned []
// Phase 1: matrix 7140 rows 2940 cols
[2022-05-16 02:44:52] [INFO ] Computed 60 place invariants in 33 ms
[2022-05-16 02:44:53] [INFO ] Implicit Places using invariants and state equation in 970 ms returned []
Implicit Place search using SMT with State Equation took 1211 ms to find 0 implicit places.
// Phase 1: matrix 7140 rows 2940 cols
[2022-05-16 02:44:53] [INFO ] Computed 60 place invariants in 63 ms
[2022-05-16 02:44:55] [INFO ] Dead Transitions using invariants and state equation in 2520 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2940/7920 places, 7140/12120 transitions.
Finished structural reductions, in 1 iterations. Remains : 2940/7920 places, 7140/12120 transitions.
Stuttering acceptance computed with spot in 188 ms :[(OR (NOT p2) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (NOT p1)), (NOT p0), (AND (NOT p0) p2 (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : BART-PT-060-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p2), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(NOT p2), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 5}, { cond=p2, acceptance={0} source=2 dest: 6}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=4 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=5 dest: 3}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p0) p1)), acceptance={} source=5 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=6 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=6 dest: 2}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p0) p1)), acceptance={} source=6 dest: 5}, { cond=p1, acceptance={} source=6 dest: 6}, { cond=(AND p2 (NOT p1)), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(EQ s118 1), p2:(NEQ s97 1), p1:(EQ s91 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 148 reset in 1517 ms.
Product exploration explored 100000 steps with 151 reset in 1463 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND (NOT p0) p2))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 275 ms. Reduced automaton from 7 states, 18 edges and 3 AP to 7 states, 18 edges and 3 AP.
Stuttering acceptance computed with spot in 242 ms :[(OR (NOT p2) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (NOT p1)), (NOT p0), (AND (NOT p0) p2 (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Finished random walk after 976 steps, including 0 resets, run visited all 10 properties in 64 ms. (steps per millisecond=15 )
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND (NOT p0) p2))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p0) p2))), (F (NOT p2)), (F (NOT (OR (AND p1 (NOT p0)) (AND (NOT p0) p2)))), (F (AND (NOT p1) (NOT p0) (NOT p2))), (F p0), (F (NOT (AND (NOT p0) p2))), (F (AND (NOT p0) (NOT p2))), (F p1), (F (AND (NOT p1) (NOT p2))), (F (NOT (AND (NOT p1) p2)))]
Knowledge based reduction with 4 factoid took 386 ms. Reduced automaton from 7 states, 18 edges and 3 AP to 7 states, 18 edges and 3 AP.
Stuttering acceptance computed with spot in 222 ms :[(OR (NOT p2) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (NOT p1)), (NOT p0), (AND (NOT p0) p2 (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 269 ms :[(OR (NOT p2) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (NOT p1)), (NOT p0), (AND (NOT p0) p2 (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
// Phase 1: matrix 7140 rows 2940 cols
[2022-05-16 02:45:00] [INFO ] Computed 60 place invariants in 19 ms
[2022-05-16 02:45:02] [INFO ] [Real]Absence check using 60 positive place invariants in 6 ms returned unsat
Proved EG (NOT p1)
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND (NOT p0) p2))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p0) p2))), (F (NOT p2)), (F (NOT (OR (AND p1 (NOT p0)) (AND (NOT p0) p2)))), (F (AND (NOT p1) (NOT p0) (NOT p2))), (F p0), (F (NOT (AND (NOT p0) p2))), (F (AND (NOT p0) (NOT p2))), (F p1), (F (AND (NOT p1) (NOT p2))), (F (NOT (AND (NOT p1) p2))), (G (NOT p1))]
Property proved to be false thanks to negative knowledge :(G (NOT p1))
Knowledge based reduction with 4 factoid took 335 ms. Reduced automaton from 7 states, 18 edges and 3 AP to 1 states, 1 edges and 0 AP.
FORMULA BART-PT-060-LTLFireability-09 FALSE TECHNIQUES KNOWLEDGE
Treatment of property BART-PT-060-LTLFireability-09 finished in 14085 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 7920 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7920/7920 places, 12120/12120 transitions.
Graph (trivial) has 12116 edges and 7920 vertex of which 7917 / 7920 are part of one of the 60 SCC in 8 ms
Free SCC test removed 7857 places
Ensure Unique test removed 12055 transitions
Reduce isomorphic transitions removed 12055 transitions.
Reduce places removed 59 places and 0 transitions.
Ensure Unique test removed 58 transitions
Reduce isomorphic transitions removed 58 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 59 rules applied. Total rules applied 60 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 62 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 64 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 65 place count 2 transition count 3
Applied a total of 65 rules in 51 ms. Remains 2 /7920 variables (removed 7918) and now considering 3/12120 (removed 12117) transitions.
// Phase 1: matrix 3 rows 2 cols
[2022-05-16 02:45:02] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 02:45:02] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2022-05-16 02:45:02] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 02:45:02] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2022-05-16 02:45:02] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2022-05-16 02:45:02] [INFO ] Computed 1 place invariants in 7 ms
[2022-05-16 02:45:02] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/7920 places, 3/12120 transitions.
Finished structural reductions, in 1 iterations. Remains : 2/7920 places, 3/12120 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BART-PT-060-LTLFireability-10 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:(NEQ 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 4 steps with 0 reset in 0 ms.
FORMULA BART-PT-060-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-060-LTLFireability-10 finished in 216 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(G((F(p1)&&X(p2))))&&p0)))'
Support contains 4 out of 7920 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7920/7920 places, 12120/12120 transitions.
Discarding 1919 places :
Symmetric choice reduction at 0 with 1919 rule applications. Total rules 1919 place count 6001 transition count 10201
Iterating global reduction 0 with 1919 rules applied. Total rules applied 3838 place count 6001 transition count 10201
Discarding 1619 places :
Symmetric choice reduction at 0 with 1619 rule applications. Total rules 5457 place count 4382 transition count 8582
Iterating global reduction 0 with 1619 rules applied. Total rules applied 7076 place count 4382 transition count 8582
Discarding 240 places :
Symmetric choice reduction at 0 with 240 rule applications. Total rules 7316 place count 4142 transition count 8342
Iterating global reduction 0 with 240 rules applied. Total rules applied 7556 place count 4142 transition count 8342
Discarding 180 places :
Symmetric choice reduction at 0 with 180 rule applications. Total rules 7736 place count 3962 transition count 8162
Iterating global reduction 0 with 180 rules applied. Total rules applied 7916 place count 3962 transition count 8162
Discarding 180 places :
Symmetric choice reduction at 0 with 180 rule applications. Total rules 8096 place count 3782 transition count 7982
Iterating global reduction 0 with 180 rules applied. Total rules applied 8276 place count 3782 transition count 7982
Discarding 180 places :
Symmetric choice reduction at 0 with 180 rule applications. Total rules 8456 place count 3602 transition count 7802
Iterating global reduction 0 with 180 rules applied. Total rules applied 8636 place count 3602 transition count 7802
Discarding 180 places :
Symmetric choice reduction at 0 with 180 rule applications. Total rules 8816 place count 3422 transition count 7622
Iterating global reduction 0 with 180 rules applied. Total rules applied 8996 place count 3422 transition count 7622
Discarding 180 places :
Symmetric choice reduction at 0 with 180 rule applications. Total rules 9176 place count 3242 transition count 7442
Iterating global reduction 0 with 180 rules applied. Total rules applied 9356 place count 3242 transition count 7442
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 9476 place count 3122 transition count 7322
Iterating global reduction 0 with 120 rules applied. Total rules applied 9596 place count 3122 transition count 7322
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 9716 place count 3002 transition count 7202
Iterating global reduction 0 with 120 rules applied. Total rules applied 9836 place count 3002 transition count 7202
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 9896 place count 2942 transition count 7142
Iterating global reduction 0 with 60 rules applied. Total rules applied 9956 place count 2942 transition count 7142
Applied a total of 9956 rules in 3053 ms. Remains 2942 /7920 variables (removed 4978) and now considering 7142/12120 (removed 4978) transitions.
// Phase 1: matrix 7142 rows 2942 cols
[2022-05-16 02:45:06] [INFO ] Computed 60 place invariants in 38 ms
[2022-05-16 02:45:06] [INFO ] Implicit Places using invariants in 281 ms returned []
// Phase 1: matrix 7142 rows 2942 cols
[2022-05-16 02:45:06] [INFO ] Computed 60 place invariants in 14 ms
[2022-05-16 02:45:07] [INFO ] Implicit Places using invariants and state equation in 963 ms returned []
Implicit Place search using SMT with State Equation took 1249 ms to find 0 implicit places.
// Phase 1: matrix 7142 rows 2942 cols
[2022-05-16 02:45:07] [INFO ] Computed 60 place invariants in 16 ms
[2022-05-16 02:45:10] [INFO ] Dead Transitions using invariants and state equation in 2996 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2942/7920 places, 7142/12120 transitions.
Finished structural reductions, in 1 iterations. Remains : 2942/7920 places, 7142/12120 transitions.
Stuttering acceptance computed with spot in 203 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (NOT p2)]
Running random walk in product with property : BART-PT-060-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={0} source=1 dest: 3}, { cond=p0, acceptance={0} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={0} source=3 dest: 1}], [{ cond=(NOT p2), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=4 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s103 1) (EQ s38 1)), p1:(AND (EQ s2557 1) (EQ s38 1)), p2:(EQ s960 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 1 reset in 1036 ms.
Product exploration explored 100000 steps with 3 reset in 1022 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT p0))]
False Knowledge obtained : [(X (NOT p1)), (X p1)]
Knowledge based reduction with 2 factoid took 175 ms. Reduced automaton from 5 states, 13 edges and 3 AP to 5 states, 13 edges and 3 AP.
Stuttering acceptance computed with spot in 251 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (NOT p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 433 ms. (steps per millisecond=23 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 7142 rows 2942 cols
[2022-05-16 02:45:13] [INFO ] Computed 60 place invariants in 33 ms
[2022-05-16 02:45:14] [INFO ] After 619ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-16 02:45:14] [INFO ] [Nat]Absence check using 60 positive place invariants in 59 ms returned sat
[2022-05-16 02:45:17] [INFO ] After 2765ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-05-16 02:45:19] [INFO ] After 4363ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 935 ms.
[2022-05-16 02:45:20] [INFO ] After 6085ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Finished Parikh walk after 785 steps, including 0 resets, run visited all 4 properties in 34 ms. (steps per millisecond=23 )
Parikh walk visited 4 properties in 36 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT p0))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (F (NOT p2)), (F (AND p0 (NOT p2))), (F (AND (NOT p1) (NOT p2))), (F p0), (F (AND (NOT p0) (NOT p2))), (F p1)]
Knowledge based reduction with 2 factoid took 309 ms. Reduced automaton from 5 states, 13 edges and 3 AP to 5 states, 13 edges and 3 AP.
Stuttering acceptance computed with spot in 273 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 287 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (NOT p2)]
// Phase 1: matrix 7142 rows 2942 cols
[2022-05-16 02:45:21] [INFO ] Computed 60 place invariants in 38 ms
Proved EG (NOT p0)
// Phase 1: matrix 7142 rows 2942 cols
[2022-05-16 02:45:23] [INFO ] Computed 60 place invariants in 16 ms
Proved EG (NOT p1)
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT p0))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (F (NOT p2)), (F (AND p0 (NOT p2))), (F (AND (NOT p1) (NOT p2))), (F p0), (F (AND (NOT p0) (NOT p2))), (F p1), (G (NOT p0)), (G (NOT p1))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 2 factoid took 177 ms. Reduced automaton from 5 states, 13 edges and 3 AP to 1 states, 1 edges and 0 AP.
FORMULA BART-PT-060-LTLFireability-11 FALSE TECHNIQUES KNOWLEDGE
Treatment of property BART-PT-060-LTLFireability-11 finished in 22956 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 7920 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7920/7920 places, 12120/12120 transitions.
Discarding 1919 places :
Symmetric choice reduction at 0 with 1919 rule applications. Total rules 1919 place count 6001 transition count 10201
Iterating global reduction 0 with 1919 rules applied. Total rules applied 3838 place count 6001 transition count 10201
Discarding 1619 places :
Symmetric choice reduction at 0 with 1619 rule applications. Total rules 5457 place count 4382 transition count 8582
Iterating global reduction 0 with 1619 rules applied. Total rules applied 7076 place count 4382 transition count 8582
Discarding 239 places :
Symmetric choice reduction at 0 with 239 rule applications. Total rules 7315 place count 4143 transition count 8343
Iterating global reduction 0 with 239 rules applied. Total rules applied 7554 place count 4143 transition count 8343
Discarding 179 places :
Symmetric choice reduction at 0 with 179 rule applications. Total rules 7733 place count 3964 transition count 8164
Iterating global reduction 0 with 179 rules applied. Total rules applied 7912 place count 3964 transition count 8164
Discarding 179 places :
Symmetric choice reduction at 0 with 179 rule applications. Total rules 8091 place count 3785 transition count 7985
Iterating global reduction 0 with 179 rules applied. Total rules applied 8270 place count 3785 transition count 7985
Discarding 179 places :
Symmetric choice reduction at 0 with 179 rule applications. Total rules 8449 place count 3606 transition count 7806
Iterating global reduction 0 with 179 rules applied. Total rules applied 8628 place count 3606 transition count 7806
Discarding 179 places :
Symmetric choice reduction at 0 with 179 rule applications. Total rules 8807 place count 3427 transition count 7627
Iterating global reduction 0 with 179 rules applied. Total rules applied 8986 place count 3427 transition count 7627
Discarding 179 places :
Symmetric choice reduction at 0 with 179 rule applications. Total rules 9165 place count 3248 transition count 7448
Iterating global reduction 0 with 179 rules applied. Total rules applied 9344 place count 3248 transition count 7448
Discarding 119 places :
Symmetric choice reduction at 0 with 119 rule applications. Total rules 9463 place count 3129 transition count 7329
Iterating global reduction 0 with 119 rules applied. Total rules applied 9582 place count 3129 transition count 7329
Discarding 119 places :
Symmetric choice reduction at 0 with 119 rule applications. Total rules 9701 place count 3010 transition count 7210
Iterating global reduction 0 with 119 rules applied. Total rules applied 9820 place count 3010 transition count 7210
Discarding 59 places :
Symmetric choice reduction at 0 with 59 rule applications. Total rules 9879 place count 2951 transition count 7151
Iterating global reduction 0 with 59 rules applied. Total rules applied 9938 place count 2951 transition count 7151
Applied a total of 9938 rules in 2790 ms. Remains 2951 /7920 variables (removed 4969) and now considering 7151/12120 (removed 4969) transitions.
// Phase 1: matrix 7151 rows 2951 cols
[2022-05-16 02:45:28] [INFO ] Computed 60 place invariants in 35 ms
[2022-05-16 02:45:29] [INFO ] Implicit Places using invariants in 446 ms returned []
// Phase 1: matrix 7151 rows 2951 cols
[2022-05-16 02:45:29] [INFO ] Computed 60 place invariants in 19 ms
[2022-05-16 02:45:30] [INFO ] Implicit Places using invariants and state equation in 1163 ms returned []
Implicit Place search using SMT with State Equation took 1612 ms to find 0 implicit places.
// Phase 1: matrix 7151 rows 2951 cols
[2022-05-16 02:45:30] [INFO ] Computed 60 place invariants in 25 ms
[2022-05-16 02:45:33] [INFO ] Dead Transitions using invariants and state equation in 3124 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2951/7920 places, 7151/12120 transitions.
Finished structural reductions, in 1 iterations. Remains : 2951/7920 places, 7151/12120 transitions.
Stuttering acceptance computed with spot in 109 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BART-PT-060-LTLFireability-13 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 s300 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 539 steps with 0 reset in 13 ms.
FORMULA BART-PT-060-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-060-LTLFireability-13 finished in 7678 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(X(X(p0))) U !(!X(p1)&&X(!p1)))))'
Support contains 1 out of 7920 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 7920/7920 places, 12120/12120 transitions.
Discarding 1920 places :
Symmetric choice reduction at 0 with 1920 rule applications. Total rules 1920 place count 6000 transition count 10200
Iterating global reduction 0 with 1920 rules applied. Total rules applied 3840 place count 6000 transition count 10200
Discarding 1620 places :
Symmetric choice reduction at 0 with 1620 rule applications. Total rules 5460 place count 4380 transition count 8580
Iterating global reduction 0 with 1620 rules applied. Total rules applied 7080 place count 4380 transition count 8580
Discarding 240 places :
Symmetric choice reduction at 0 with 240 rule applications. Total rules 7320 place count 4140 transition count 8340
Iterating global reduction 0 with 240 rules applied. Total rules applied 7560 place count 4140 transition count 8340
Discarding 180 places :
Symmetric choice reduction at 0 with 180 rule applications. Total rules 7740 place count 3960 transition count 8160
Iterating global reduction 0 with 180 rules applied. Total rules applied 7920 place count 3960 transition count 8160
Discarding 180 places :
Symmetric choice reduction at 0 with 180 rule applications. Total rules 8100 place count 3780 transition count 7980
Iterating global reduction 0 with 180 rules applied. Total rules applied 8280 place count 3780 transition count 7980
Discarding 180 places :
Symmetric choice reduction at 0 with 180 rule applications. Total rules 8460 place count 3600 transition count 7800
Iterating global reduction 0 with 180 rules applied. Total rules applied 8640 place count 3600 transition count 7800
Discarding 180 places :
Symmetric choice reduction at 0 with 180 rule applications. Total rules 8820 place count 3420 transition count 7620
Iterating global reduction 0 with 180 rules applied. Total rules applied 9000 place count 3420 transition count 7620
Discarding 180 places :
Symmetric choice reduction at 0 with 180 rule applications. Total rules 9180 place count 3240 transition count 7440
Iterating global reduction 0 with 180 rules applied. Total rules applied 9360 place count 3240 transition count 7440
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 9480 place count 3120 transition count 7320
Iterating global reduction 0 with 120 rules applied. Total rules applied 9600 place count 3120 transition count 7320
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 9720 place count 3000 transition count 7200
Iterating global reduction 0 with 120 rules applied. Total rules applied 9840 place count 3000 transition count 7200
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 9900 place count 2940 transition count 7140
Iterating global reduction 0 with 60 rules applied. Total rules applied 9960 place count 2940 transition count 7140
Applied a total of 9960 rules in 2770 ms. Remains 2940 /7920 variables (removed 4980) and now considering 7140/12120 (removed 4980) transitions.
// Phase 1: matrix 7140 rows 2940 cols
[2022-05-16 02:45:36] [INFO ] Computed 60 place invariants in 36 ms
[2022-05-16 02:45:36] [INFO ] Implicit Places using invariants in 424 ms returned []
// Phase 1: matrix 7140 rows 2940 cols
[2022-05-16 02:45:36] [INFO ] Computed 60 place invariants in 32 ms
[2022-05-16 02:45:38] [INFO ] Implicit Places using invariants and state equation in 1133 ms returned []
Implicit Place search using SMT with State Equation took 1563 ms to find 0 implicit places.
// Phase 1: matrix 7140 rows 2940 cols
[2022-05-16 02:45:38] [INFO ] Computed 60 place invariants in 35 ms
[2022-05-16 02:45:40] [INFO ] Dead Transitions using invariants and state equation in 2745 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2940/7920 places, 7140/12120 transitions.
Finished structural reductions, in 1 iterations. Remains : 2940/7920 places, 7140/12120 transitions.
Stuttering acceptance computed with spot in 48 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : BART-PT-060-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(NEQ s1073 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 49195 reset in 4671 ms.
Product exploration explored 100000 steps with 48951 reset in 5177 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 : [p1]
False Knowledge obtained : [(X (NOT p1)), (X p1)]
Knowledge based reduction with 1 factoid took 111 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 2 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 70 ms :[(NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 1) seen :0
Finished Best-First random walk after 2161 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=540 )
Knowledge obtained : [p1]
False Knowledge obtained : [(X (NOT p1)), (X p1), (F (NOT p1))]
Knowledge based reduction with 1 factoid took 131 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 2 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 78 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 64 ms :[(NOT p1), (NOT p1)]
Support contains 1 out of 2940 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 2940/2940 places, 7140/7140 transitions.
Applied a total of 0 rules in 170 ms. Remains 2940 /2940 variables (removed 0) and now considering 7140/7140 (removed 0) transitions.
// Phase 1: matrix 7140 rows 2940 cols
[2022-05-16 02:45:51] [INFO ] Computed 60 place invariants in 36 ms
[2022-05-16 02:45:51] [INFO ] Implicit Places using invariants in 480 ms returned []
// Phase 1: matrix 7140 rows 2940 cols
[2022-05-16 02:45:51] [INFO ] Computed 60 place invariants in 19 ms
[2022-05-16 02:45:53] [INFO ] Implicit Places using invariants and state equation in 1220 ms returned []
Implicit Place search using SMT with State Equation took 1702 ms to find 0 implicit places.
// Phase 1: matrix 7140 rows 2940 cols
[2022-05-16 02:45:53] [INFO ] Computed 60 place invariants in 19 ms
[2022-05-16 02:45:56] [INFO ] Dead Transitions using invariants and state equation in 3220 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2940/2940 places, 7140/7140 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 : [p1]
False Knowledge obtained : [(X (NOT p1)), (X p1)]
Knowledge based reduction with 1 factoid took 68 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 2 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 90 ms :[(NOT p1), (NOT p1)]
Finished random walk after 6732 steps, including 2 resets, run visited all 1 properties in 76 ms. (steps per millisecond=88 )
Knowledge obtained : [p1]
False Knowledge obtained : [(X (NOT p1)), (X p1), (F (NOT p1))]
Knowledge based reduction with 1 factoid took 149 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 2 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 81 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 82 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 88 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 49085 reset in 4902 ms.
Product exploration explored 100000 steps with 48770 reset in 4616 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 100 ms :[(NOT p1), (NOT p1)]
Support contains 1 out of 2940 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2940/2940 places, 7140/7140 transitions.
Graph (trivial) has 7136 edges and 2940 vertex of which 2939 / 2940 are part of one of the 60 SCC in 3 ms
Free SCC test removed 2879 places
Ensure Unique test removed 7078 transitions
Reduce isomorphic transitions removed 7078 transitions.
Reduce places removed 59 places and 0 transitions.
Ensure Unique test removed 58 transitions
Reduce isomorphic transitions removed 58 transitions.
Iterating post reduction 0 with 58 rules applied. Total rules applied 59 place count 2 transition count 4
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 60 place count 2 transition count 3
Applied a total of 60 rules in 19 ms. Remains 2 /2940 variables (removed 2938) and now considering 3/7140 (removed 7137) transitions.
[2022-05-16 02:46:06] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2022-05-16 02:46:06] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 02:46:06] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/2940 places, 3/7140 transitions.
Finished structural reductions, in 1 iterations. Remains : 2/2940 places, 3/7140 transitions.
Stuttering criterion allowed to conclude after 11653 steps with 5826 reset in 449 ms.
FORMULA BART-PT-060-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-060-LTLFireability-14 finished in 33715 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((((p0 U p1) U X(p2))&&F(p2)))'
Support contains 3 out of 7920 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7920/7920 places, 12120/12120 transitions.
Discarding 1918 places :
Symmetric choice reduction at 0 with 1918 rule applications. Total rules 1918 place count 6002 transition count 10202
Iterating global reduction 0 with 1918 rules applied. Total rules applied 3836 place count 6002 transition count 10202
Discarding 1619 places :
Symmetric choice reduction at 0 with 1619 rule applications. Total rules 5455 place count 4383 transition count 8583
Iterating global reduction 0 with 1619 rules applied. Total rules applied 7074 place count 4383 transition count 8583
Discarding 239 places :
Symmetric choice reduction at 0 with 239 rule applications. Total rules 7313 place count 4144 transition count 8344
Iterating global reduction 0 with 239 rules applied. Total rules applied 7552 place count 4144 transition count 8344
Discarding 179 places :
Symmetric choice reduction at 0 with 179 rule applications. Total rules 7731 place count 3965 transition count 8165
Iterating global reduction 0 with 179 rules applied. Total rules applied 7910 place count 3965 transition count 8165
Discarding 178 places :
Symmetric choice reduction at 0 with 178 rule applications. Total rules 8088 place count 3787 transition count 7987
Iterating global reduction 0 with 178 rules applied. Total rules applied 8266 place count 3787 transition count 7987
Discarding 178 places :
Symmetric choice reduction at 0 with 178 rule applications. Total rules 8444 place count 3609 transition count 7809
Iterating global reduction 0 with 178 rules applied. Total rules applied 8622 place count 3609 transition count 7809
Discarding 178 places :
Symmetric choice reduction at 0 with 178 rule applications. Total rules 8800 place count 3431 transition count 7631
Iterating global reduction 0 with 178 rules applied. Total rules applied 8978 place count 3431 transition count 7631
Discarding 178 places :
Symmetric choice reduction at 0 with 178 rule applications. Total rules 9156 place count 3253 transition count 7453
Iterating global reduction 0 with 178 rules applied. Total rules applied 9334 place count 3253 transition count 7453
Discarding 118 places :
Symmetric choice reduction at 0 with 118 rule applications. Total rules 9452 place count 3135 transition count 7335
Iterating global reduction 0 with 118 rules applied. Total rules applied 9570 place count 3135 transition count 7335
Discarding 118 places :
Symmetric choice reduction at 0 with 118 rule applications. Total rules 9688 place count 3017 transition count 7217
Iterating global reduction 0 with 118 rules applied. Total rules applied 9806 place count 3017 transition count 7217
Discarding 59 places :
Symmetric choice reduction at 0 with 59 rule applications. Total rules 9865 place count 2958 transition count 7158
Iterating global reduction 0 with 59 rules applied. Total rules applied 9924 place count 2958 transition count 7158
Applied a total of 9924 rules in 2954 ms. Remains 2958 /7920 variables (removed 4962) and now considering 7158/12120 (removed 4962) transitions.
// Phase 1: matrix 7158 rows 2958 cols
[2022-05-16 02:46:10] [INFO ] Computed 60 place invariants in 33 ms
[2022-05-16 02:46:10] [INFO ] Implicit Places using invariants in 468 ms returned []
// Phase 1: matrix 7158 rows 2958 cols
[2022-05-16 02:46:10] [INFO ] Computed 60 place invariants in 20 ms
[2022-05-16 02:46:11] [INFO ] Implicit Places using invariants and state equation in 1130 ms returned []
Implicit Place search using SMT with State Equation took 1600 ms to find 0 implicit places.
// Phase 1: matrix 7158 rows 2958 cols
[2022-05-16 02:46:11] [INFO ] Computed 60 place invariants in 34 ms
[2022-05-16 02:46:14] [INFO ] Dead Transitions using invariants and state equation in 3011 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2958/7920 places, 7158/12120 transitions.
Finished structural reductions, in 1 iterations. Remains : 2958/7920 places, 7158/12120 transitions.
Stuttering acceptance computed with spot in 158 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), true, (NOT p1)]
Running random walk in product with property : BART-PT-060-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}, { cond=(OR p1 p0), acceptance={} source=0 dest: 3}], [{ cond=(NOT p2), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(EQ s540 1), p0:(EQ s3 1), p2:(EQ s661 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 43 steps with 0 reset in 3 ms.
FORMULA BART-PT-060-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-060-LTLFireability-15 finished in 7774 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((!(!(F(p1)||p0) U p1)||(G(p2) U p3))))'
[2022-05-16 02:46:15] [INFO ] Flatten gal took : 307 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin15687102180663204331
[2022-05-16 02:46:15] [INFO ] Too many transitions (12120) to apply POR reductions. Disabling POR matrices.
[2022-05-16 02:46:15] [INFO ] Built C files in 139ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15687102180663204331
Running compilation step : cd /tmp/ltsmin15687102180663204331;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-05-16 02:46:16] [INFO ] Applying decomposition
[2022-05-16 02:46:16] [INFO ] Flatten gal took : 388 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph5991937446328185761.txt' '-o' '/tmp/graph5991937446328185761.bin' '-w' '/tmp/graph5991937446328185761.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph5991937446328185761.bin' '-l' '-1' '-v' '-w' '/tmp/graph5991937446328185761.weights' '-q' '0' '-e' '0.001'
[2022-05-16 02:46:17] [INFO ] Decomposing Gal with order
[2022-05-16 02:46:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 02:46:20] [INFO ] Removed a total of 1222 redundant transitions.
[2022-05-16 02:46:20] [INFO ] Flatten gal took : 521 ms
[2022-05-16 02:46:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 24 ms.
[2022-05-16 02:46:38] [INFO ] Time to serialize gal into /tmp/LTLFireability6842522432533309924.gal : 39 ms
[2022-05-16 02:46:38] [INFO ] Time to serialize properties into /tmp/LTLFireability3925420088665847059.ltl : 64 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability6842522432533309924.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability3925420088665847059.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...267
Read 1 LTL properties
Checking formula 0 : !((X((!((!(((((((((((((F("((((((((((((((i17.i2.u1309.TrainState_37_3_21==1)||(i33.i0.u171.TrainState_45_1_23==1))||((i52.i0.u155.Train...734169
Formula 0 simplified : !X(!(!("((((((((((((i33.i5.u1076.TrainState_45_4_18==1)||(i6.i0.u137.TrainState_38_1_5==1))||((i15.i0.u1723.TrainState_29_1_26==1)||...734122
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
7 unique states visited
7 strongly connected components in search stack
8 transitions explored
7 items max in DFS search stack
4889 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,50.4531,1078160,1,0,1.77784e+06,12324,86950,5.23546e+06,3938,29688,2727560
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA BART-PT-060-LTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Compilation finished in 76122 ms.
Running link step : cd /tmp/ltsmin15687102180663204331;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 159 ms.
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 852196 ms.

BK_STOP 1652669252408

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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