About the Execution of ITS-Tools for ShieldIIPs-PT-030B
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16216.287 | 3600000.00 | 13534350.00 | 15106.70 | TTTFFF?FTF??FFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2022-input.r222-tall-165286024700124.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is ShieldIIPs-PT-030B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r222-tall-165286024700124
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 764K
-rw-r--r-- 1 mcc users 8.5K Apr 29 15:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 99K Apr 29 15:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Apr 29 15:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Apr 29 15:01 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K May 9 08:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 08:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 9 08:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 14K May 9 08:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 503K May 10 09:34 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 ShieldIIPs-PT-030B-LTLFireability-00
FORMULA_NAME ShieldIIPs-PT-030B-LTLFireability-01
FORMULA_NAME ShieldIIPs-PT-030B-LTLFireability-02
FORMULA_NAME ShieldIIPs-PT-030B-LTLFireability-03
FORMULA_NAME ShieldIIPs-PT-030B-LTLFireability-04
FORMULA_NAME ShieldIIPs-PT-030B-LTLFireability-05
FORMULA_NAME ShieldIIPs-PT-030B-LTLFireability-06
FORMULA_NAME ShieldIIPs-PT-030B-LTLFireability-07
FORMULA_NAME ShieldIIPs-PT-030B-LTLFireability-08
FORMULA_NAME ShieldIIPs-PT-030B-LTLFireability-09
FORMULA_NAME ShieldIIPs-PT-030B-LTLFireability-10
FORMULA_NAME ShieldIIPs-PT-030B-LTLFireability-11
FORMULA_NAME ShieldIIPs-PT-030B-LTLFireability-12
FORMULA_NAME ShieldIIPs-PT-030B-LTLFireability-13
FORMULA_NAME ShieldIIPs-PT-030B-LTLFireability-14
FORMULA_NAME ShieldIIPs-PT-030B-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1652934193221
Running Version 202205111006
[2022-05-19 04:23:14] [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-19 04:23:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-19 04:23:14] [INFO ] Load time of PNML (sax parser for PT used): 171 ms
[2022-05-19 04:23:14] [INFO ] Transformed 1803 places.
[2022-05-19 04:23:14] [INFO ] Transformed 1773 transitions.
[2022-05-19 04:23:14] [INFO ] Found NUPN structural information;
[2022-05-19 04:23:14] [INFO ] Parsed PT model containing 1803 places and 1773 transitions in 333 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
FORMULA ShieldIIPs-PT-030B-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-030B-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-030B-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-030B-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-030B-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-030B-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 31 out of 1803 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1803/1803 places, 1773/1773 transitions.
Discarding 208 places :
Symmetric choice reduction at 0 with 208 rule applications. Total rules 208 place count 1595 transition count 1565
Iterating global reduction 0 with 208 rules applied. Total rules applied 416 place count 1595 transition count 1565
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 417 place count 1594 transition count 1564
Iterating global reduction 0 with 1 rules applied. Total rules applied 418 place count 1594 transition count 1564
Applied a total of 418 rules in 449 ms. Remains 1594 /1803 variables (removed 209) and now considering 1564/1773 (removed 209) transitions.
// Phase 1: matrix 1564 rows 1594 cols
[2022-05-19 04:23:15] [INFO ] Computed 271 place invariants in 35 ms
[2022-05-19 04:23:16] [INFO ] Implicit Places using invariants in 719 ms returned []
// Phase 1: matrix 1564 rows 1594 cols
[2022-05-19 04:23:16] [INFO ] Computed 271 place invariants in 17 ms
[2022-05-19 04:23:20] [INFO ] Implicit Places using invariants and state equation in 3982 ms returned []
Implicit Place search using SMT with State Equation took 4727 ms to find 0 implicit places.
// Phase 1: matrix 1564 rows 1594 cols
[2022-05-19 04:23:20] [INFO ] Computed 271 place invariants in 14 ms
[2022-05-19 04:23:21] [INFO ] Dead Transitions using invariants and state equation in 822 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1594/1803 places, 1564/1773 transitions.
Finished structural reductions, in 1 iterations. Remains : 1594/1803 places, 1564/1773 transitions.
Support contains 31 out of 1594 places after structural reductions.
[2022-05-19 04:23:23] [INFO ] Flatten gal took : 153 ms
[2022-05-19 04:23:24] [INFO ] Flatten gal took : 86 ms
[2022-05-19 04:23:24] [INFO ] Input system was already deterministic with 1564 transitions.
Finished random walk after 2832 steps, including 0 resets, run visited all 21 properties in 204 ms. (steps per millisecond=13 )
Computed a total of 360 stabilizing places and 360 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(p0) U X(X(!(X(p0)||p1))))))'
Support contains 2 out of 1594 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1594/1594 places, 1564/1564 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1592 transition count 1562
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1592 transition count 1562
Applied a total of 4 rules in 98 ms. Remains 1592 /1594 variables (removed 2) and now considering 1562/1564 (removed 2) transitions.
// Phase 1: matrix 1562 rows 1592 cols
[2022-05-19 04:23:24] [INFO ] Computed 271 place invariants in 10 ms
[2022-05-19 04:23:25] [INFO ] Implicit Places using invariants in 479 ms returned []
// Phase 1: matrix 1562 rows 1592 cols
[2022-05-19 04:23:25] [INFO ] Computed 271 place invariants in 6 ms
[2022-05-19 04:23:26] [INFO ] Implicit Places using invariants and state equation in 1545 ms returned []
Implicit Place search using SMT with State Equation took 2026 ms to find 0 implicit places.
// Phase 1: matrix 1562 rows 1592 cols
[2022-05-19 04:23:26] [INFO ] Computed 271 place invariants in 15 ms
[2022-05-19 04:23:27] [INFO ] Dead Transitions using invariants and state equation in 851 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1592/1594 places, 1562/1564 transitions.
Finished structural reductions, in 1 iterations. Remains : 1592/1594 places, 1562/1564 transitions.
Stuttering acceptance computed with spot in 523 ms :[p0, p0, p0, (OR p1 p0), (OR p1 p0), (OR p1 p0), (OR p1 p0), (OR p1 p0), true]
Running random walk in product with property : ShieldIIPs-PT-030B-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 8}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND p0 p1), acceptance={} source=1 dest: 8}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={0} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={} source=3 dest: 4}, { cond=p0, acceptance={} source=3 dest: 5}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=p1, acceptance={} source=4 dest: 8}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=5 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=5 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=5 dest: 4}, { cond=(AND p0 p1), acceptance={0} source=5 dest: 5}], [{ cond=true, acceptance={} source=6 dest: 3}], [{ cond=true, acceptance={} source=7 dest: 6}], [{ cond=true, acceptance={0} source=8 dest: 8}]], initial=7, aps=[p0:(EQ s1414 1), p1:(EQ s1025 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 20000 reset in 443 ms.
Product exploration explored 100000 steps with 20000 reset in 355 ms.
Computed a total of 359 stabilizing places and 359 stable transitions
Computed a total of 359 stabilizing places and 359 stable transitions
Detected a total of 359/1592 stabilizing places and 359/1562 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 137 ms. Reduced automaton from 9 states, 16 edges and 2 AP to 6 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 217 ms :[p0, (OR p1 p0), (OR p1 p0), (OR p1 p0), (OR p1 p0), true]
Finished random walk after 7552 steps, including 2 resets, run visited all 2 properties in 66 ms. (steps per millisecond=114 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p0), (F p1)]
Knowledge based reduction with 3 factoid took 143 ms. Reduced automaton from 6 states, 7 edges and 2 AP to 6 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 172 ms :[p0, (OR p1 p0), (OR p1 p0), (OR p1 p0), (OR p1 p0), true]
Stuttering acceptance computed with spot in 204 ms :[p0, (OR p1 p0), (OR p1 p0), (OR p1 p0), (OR p1 p0), true]
Support contains 2 out of 1592 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1592/1592 places, 1562/1562 transitions.
Applied a total of 0 rules in 74 ms. Remains 1592 /1592 variables (removed 0) and now considering 1562/1562 (removed 0) transitions.
// Phase 1: matrix 1562 rows 1592 cols
[2022-05-19 04:23:30] [INFO ] Computed 271 place invariants in 9 ms
[2022-05-19 04:23:30] [INFO ] Implicit Places using invariants in 514 ms returned []
// Phase 1: matrix 1562 rows 1592 cols
[2022-05-19 04:23:30] [INFO ] Computed 271 place invariants in 5 ms
[2022-05-19 04:23:32] [INFO ] Implicit Places using invariants and state equation in 1639 ms returned []
Implicit Place search using SMT with State Equation took 2158 ms to find 0 implicit places.
// Phase 1: matrix 1562 rows 1592 cols
[2022-05-19 04:23:32] [INFO ] Computed 271 place invariants in 6 ms
[2022-05-19 04:23:33] [INFO ] Dead Transitions using invariants and state equation in 823 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1592/1592 places, 1562/1562 transitions.
Computed a total of 359 stabilizing places and 359 stable transitions
Computed a total of 359 stabilizing places and 359 stable transitions
Detected a total of 359/1592 stabilizing places and 359/1562 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), true, (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 144 ms. Reduced automaton from 6 states, 7 edges and 2 AP to 6 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 205 ms :[p0, (OR p1 p0), (OR p1 p0), (OR p1 p0), (OR p1 p0), true]
Finished random walk after 708 steps, including 0 resets, run visited all 2 properties in 8 ms. (steps per millisecond=88 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), true, (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p0), (F p1)]
Knowledge based reduction with 3 factoid took 151 ms. Reduced automaton from 6 states, 7 edges and 2 AP to 6 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 202 ms :[p0, (OR p1 p0), (OR p1 p0), (OR p1 p0), (OR p1 p0), true]
Stuttering acceptance computed with spot in 205 ms :[p0, (OR p1 p0), (OR p1 p0), (OR p1 p0), (OR p1 p0), true]
Stuttering acceptance computed with spot in 208 ms :[p0, (OR p1 p0), (OR p1 p0), (OR p1 p0), (OR p1 p0), true]
Product exploration explored 100000 steps with 20000 reset in 320 ms.
Product exploration explored 100000 steps with 20000 reset in 285 ms.
Applying partial POR strategy [true, false, false, false, false, true]
Stuttering acceptance computed with spot in 229 ms :[p0, (OR p1 p0), (OR p1 p0), (OR p1 p0), (OR p1 p0), true]
Support contains 2 out of 1592 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1592/1592 places, 1562/1562 transitions.
Performed 150 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 150 rules applied. Total rules applied 150 place count 1592 transition count 1562
Performed 61 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 61 Pre rules applied. Total rules applied 150 place count 1592 transition count 1564
Deduced a syphon composed of 211 places in 3 ms
Iterating global reduction 1 with 61 rules applied. Total rules applied 211 place count 1592 transition count 1564
Performed 628 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 839 places in 2 ms
Iterating global reduction 1 with 628 rules applied. Total rules applied 839 place count 1592 transition count 1564
Renaming transitions due to excessive name length > 1024 char.
Discarding 211 places :
Symmetric choice reduction at 1 with 211 rule applications. Total rules 1050 place count 1381 transition count 1353
Deduced a syphon composed of 628 places in 3 ms
Iterating global reduction 1 with 211 rules applied. Total rules applied 1261 place count 1381 transition count 1353
Deduced a syphon composed of 628 places in 3 ms
Applied a total of 1261 rules in 667 ms. Remains 1381 /1592 variables (removed 211) and now considering 1353/1562 (removed 209) transitions.
[2022-05-19 04:23:36] [INFO ] Redundant transitions in 189 ms returned [1352]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 1352 rows 1381 cols
[2022-05-19 04:23:36] [INFO ] Computed 271 place invariants in 11 ms
[2022-05-19 04:23:36] [INFO ] Dead Transitions using invariants and state equation in 728 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1381/1592 places, 1352/1562 transitions.
Deduced a syphon composed of 628 places in 2 ms
Applied a total of 0 rules in 63 ms. Remains 1381 /1381 variables (removed 0) and now considering 1352/1352 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 1381/1592 places, 1352/1562 transitions.
Product exploration explored 100000 steps with 20000 reset in 1680 ms.
Product exploration explored 100000 steps with 20000 reset in 1570 ms.
Built C files in :
/tmp/ltsmin4177632943641904634
[2022-05-19 04:23:40] [INFO ] Built C files in 55ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4177632943641904634
Running compilation step : cd /tmp/ltsmin4177632943641904634;'/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/ltsmin4177632943641904634;'/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/ltsmin4177632943641904634;'/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 2 out of 1592 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1592/1592 places, 1562/1562 transitions.
Applied a total of 0 rules in 105 ms. Remains 1592 /1592 variables (removed 0) and now considering 1562/1562 (removed 0) transitions.
// Phase 1: matrix 1562 rows 1592 cols
[2022-05-19 04:23:43] [INFO ] Computed 271 place invariants in 5 ms
[2022-05-19 04:23:44] [INFO ] Implicit Places using invariants in 802 ms returned []
// Phase 1: matrix 1562 rows 1592 cols
[2022-05-19 04:23:44] [INFO ] Computed 271 place invariants in 5 ms
[2022-05-19 04:23:45] [INFO ] Implicit Places using invariants and state equation in 1644 ms returned []
Implicit Place search using SMT with State Equation took 2465 ms to find 0 implicit places.
// Phase 1: matrix 1562 rows 1592 cols
[2022-05-19 04:23:45] [INFO ] Computed 271 place invariants in 4 ms
[2022-05-19 04:23:46] [INFO ] Dead Transitions using invariants and state equation in 867 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1592/1592 places, 1562/1562 transitions.
Built C files in :
/tmp/ltsmin643209398907986784
[2022-05-19 04:23:46] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin643209398907986784
Running compilation step : cd /tmp/ltsmin643209398907986784;'/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 2844 ms.
Running link step : cd /tmp/ltsmin643209398907986784;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin643209398907986784;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased13292311684463608669.hoa' '--buchi-type=spotba'
LTSmin run took 383 ms.
FORMULA ShieldIIPs-PT-030B-LTLFireability-01 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldIIPs-PT-030B-LTLFireability-01 finished in 25410 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(X((!G(p0) U p1))) U X(p0))))'
Support contains 1 out of 1594 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 1594/1594 places, 1564/1564 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1592 transition count 1562
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1592 transition count 1562
Applied a total of 4 rules in 98 ms. Remains 1592 /1594 variables (removed 2) and now considering 1562/1564 (removed 2) transitions.
// Phase 1: matrix 1562 rows 1592 cols
[2022-05-19 04:23:50] [INFO ] Computed 271 place invariants in 6 ms
[2022-05-19 04:23:50] [INFO ] Implicit Places using invariants in 477 ms returned []
// Phase 1: matrix 1562 rows 1592 cols
[2022-05-19 04:23:50] [INFO ] Computed 271 place invariants in 4 ms
[2022-05-19 04:23:52] [INFO ] Implicit Places using invariants and state equation in 1573 ms returned []
Implicit Place search using SMT with State Equation took 2053 ms to find 0 implicit places.
// Phase 1: matrix 1562 rows 1592 cols
[2022-05-19 04:23:52] [INFO ] Computed 271 place invariants in 11 ms
[2022-05-19 04:23:53] [INFO ] Dead Transitions using invariants and state equation in 795 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1592/1594 places, 1562/1564 transitions.
Finished structural reductions, in 1 iterations. Remains : 1592/1594 places, 1562/1564 transitions.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-030B-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s1513 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 1751 reset in 253 ms.
Product exploration explored 100000 steps with 1792 reset in 305 ms.
Computed a total of 359 stabilizing places and 359 stable transitions
Computed a total of 359 stabilizing places and 359 stable transitions
Detected a total of 359/1592 stabilizing places and 359/1562 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 159 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Finished random walk after 48 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=24 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 157 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 24 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
// Phase 1: matrix 1562 rows 1592 cols
[2022-05-19 04:23:54] [INFO ] Computed 271 place invariants in 8 ms
[2022-05-19 04:23:55] [INFO ] [Real]Absence check using 271 positive place invariants in 247 ms returned sat
[2022-05-19 04:23:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 04:24:03] [INFO ] [Real]Absence check using state equation in 7846 ms returned sat
[2022-05-19 04:24:03] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 04:24:04] [INFO ] [Nat]Absence check using 271 positive place invariants in 267 ms returned sat
[2022-05-19 04:24:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 04:24:12] [INFO ] [Nat]Absence check using state equation in 8073 ms returned sat
[2022-05-19 04:24:12] [INFO ] Deduced a trap composed of 43 places in 47 ms of which 2 ms to minimize.
[2022-05-19 04:24:12] [INFO ] Deduced a trap composed of 25 places in 63 ms of which 0 ms to minimize.
[2022-05-19 04:24:12] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 2 ms to minimize.
[2022-05-19 04:24:12] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 1 ms to minimize.
[2022-05-19 04:24:12] [INFO ] Deduced a trap composed of 30 places in 60 ms of which 1 ms to minimize.
[2022-05-19 04:24:13] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 0 ms to minimize.
[2022-05-19 04:24:13] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1157 ms
[2022-05-19 04:24:13] [INFO ] Computed and/alt/rep : 1561/3512/1561 causal constraints (skipped 0 transitions) in 93 ms.
[2022-05-19 04:24:18] [INFO ] Added : 130 causal constraints over 26 iterations in 4860 ms. Result :unknown
Could not prove EG (NOT p0)
Support contains 1 out of 1592 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 1592/1592 places, 1562/1562 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 149 transitions
Trivial Post-agglo rules discarded 149 transitions
Performed 149 trivial Post agglomeration. Transition count delta: 149
Iterating post reduction 0 with 149 rules applied. Total rules applied 149 place count 1591 transition count 1412
Reduce places removed 149 places and 0 transitions.
Iterating post reduction 1 with 149 rules applied. Total rules applied 298 place count 1442 transition count 1412
Performed 151 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 151 Pre rules applied. Total rules applied 298 place count 1442 transition count 1261
Deduced a syphon composed of 151 places in 2 ms
Reduce places removed 151 places and 0 transitions.
Iterating global reduction 2 with 302 rules applied. Total rules applied 600 place count 1291 transition count 1261
Performed 535 Post agglomeration using F-continuation condition.Transition count delta: 535
Deduced a syphon composed of 535 places in 1 ms
Reduce places removed 535 places and 0 transitions.
Iterating global reduction 2 with 1070 rules applied. Total rules applied 1670 place count 756 transition count 726
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1672 place count 754 transition count 724
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1673 place count 753 transition count 724
Applied a total of 1673 rules in 237 ms. Remains 753 /1592 variables (removed 839) and now considering 724/1562 (removed 838) transitions.
// Phase 1: matrix 724 rows 753 cols
[2022-05-19 04:24:18] [INFO ] Computed 270 place invariants in 3 ms
[2022-05-19 04:24:18] [INFO ] Implicit Places using invariants in 339 ms returned []
// Phase 1: matrix 724 rows 753 cols
[2022-05-19 04:24:18] [INFO ] Computed 270 place invariants in 2 ms
[2022-05-19 04:24:19] [INFO ] Implicit Places using invariants and state equation in 720 ms returned []
Implicit Place search using SMT with State Equation took 1062 ms to find 0 implicit places.
[2022-05-19 04:24:19] [INFO ] Redundant transitions in 167 ms returned [723]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 723 rows 753 cols
[2022-05-19 04:24:19] [INFO ] Computed 270 place invariants in 2 ms
[2022-05-19 04:24:19] [INFO ] Dead Transitions using invariants and state equation in 341 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 753/1592 places, 723/1562 transitions.
Applied a total of 0 rules in 19 ms. Remains 753 /753 variables (removed 0) and now considering 723/723 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 753/1592 places, 723/1562 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/753 stabilizing places and 2/723 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 162 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 27 ms :[(NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 139 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 24 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
// Phase 1: matrix 723 rows 753 cols
[2022-05-19 04:24:20] [INFO ] Computed 270 place invariants in 2 ms
[2022-05-19 04:24:20] [INFO ] [Real]Absence check using 270 positive place invariants in 120 ms returned sat
[2022-05-19 04:24:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 04:24:22] [INFO ] [Real]Absence check using state equation in 1067 ms returned sat
[2022-05-19 04:24:22] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 04:24:22] [INFO ] [Nat]Absence check using 270 positive place invariants in 110 ms returned sat
[2022-05-19 04:24:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 04:24:23] [INFO ] [Nat]Absence check using state equation in 1337 ms returned sat
[2022-05-19 04:24:23] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2022-05-19 04:24:24] [INFO ] Deduced a trap composed of 8 places in 57 ms of which 1 ms to minimize.
[2022-05-19 04:24:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 212 ms
[2022-05-19 04:24:24] [INFO ] Computed and/alt/rep : 718/1805/718 causal constraints (skipped 1 transitions) in 43 ms.
[2022-05-19 04:24:28] [INFO ] Added : 357 causal constraints over 72 iterations in 4839 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Product exploration explored 100000 steps with 23546 reset in 634 ms.
Product exploration explored 100000 steps with 23575 reset in 687 ms.
Built C files in :
/tmp/ltsmin3027482607651357047
[2022-05-19 04:24:30] [INFO ] Computing symmetric may disable matrix : 723 transitions.
[2022-05-19 04:24:30] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 04:24:30] [INFO ] Computing symmetric may enable matrix : 723 transitions.
[2022-05-19 04:24:30] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 04:24:30] [INFO ] Computing Do-Not-Accords matrix : 723 transitions.
[2022-05-19 04:24:30] [INFO ] Computation of Completed DNA matrix. took 21 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 04:24:30] [INFO ] Built C files in 103ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3027482607651357047
Running compilation step : cd /tmp/ltsmin3027482607651357047;'/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 1879 ms.
Running link step : cd /tmp/ltsmin3027482607651357047;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin3027482607651357047;'/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/stateBased17089575452415184722.hoa' '--buchi-type=spotba'
LTSmin run took 3953 ms.
FORMULA ShieldIIPs-PT-030B-LTLFireability-02 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldIIPs-PT-030B-LTLFireability-02 finished in 46372 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))&&F(p1))))'
Support contains 2 out of 1594 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1594/1594 places, 1564/1564 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 151 transitions
Trivial Post-agglo rules discarded 151 transitions
Performed 151 trivial Post agglomeration. Transition count delta: 151
Iterating post reduction 0 with 151 rules applied. Total rules applied 151 place count 1593 transition count 1412
Reduce places removed 151 places and 0 transitions.
Iterating post reduction 1 with 151 rules applied. Total rules applied 302 place count 1442 transition count 1412
Performed 151 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 151 Pre rules applied. Total rules applied 302 place count 1442 transition count 1261
Deduced a syphon composed of 151 places in 1 ms
Reduce places removed 151 places and 0 transitions.
Iterating global reduction 2 with 302 rules applied. Total rules applied 604 place count 1291 transition count 1261
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 606 place count 1289 transition count 1259
Iterating global reduction 2 with 2 rules applied. Total rules applied 608 place count 1289 transition count 1259
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 608 place count 1289 transition count 1258
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 610 place count 1288 transition count 1258
Performed 534 Post agglomeration using F-continuation condition.Transition count delta: 534
Deduced a syphon composed of 534 places in 1 ms
Reduce places removed 534 places and 0 transitions.
Iterating global reduction 2 with 1068 rules applied. Total rules applied 1678 place count 754 transition count 724
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1680 place count 752 transition count 722
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1681 place count 751 transition count 722
Applied a total of 1681 rules in 256 ms. Remains 751 /1594 variables (removed 843) and now considering 722/1564 (removed 842) transitions.
// Phase 1: matrix 722 rows 751 cols
[2022-05-19 04:24:36] [INFO ] Computed 270 place invariants in 2 ms
[2022-05-19 04:24:37] [INFO ] Implicit Places using invariants in 306 ms returned []
// Phase 1: matrix 722 rows 751 cols
[2022-05-19 04:24:37] [INFO ] Computed 270 place invariants in 1 ms
[2022-05-19 04:24:37] [INFO ] Implicit Places using invariants and state equation in 684 ms returned []
Implicit Place search using SMT with State Equation took 994 ms to find 0 implicit places.
[2022-05-19 04:24:37] [INFO ] Redundant transitions in 75 ms returned [721]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 721 rows 751 cols
[2022-05-19 04:24:37] [INFO ] Computed 270 place invariants in 1 ms
[2022-05-19 04:24:38] [INFO ] Dead Transitions using invariants and state equation in 342 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 751/1594 places, 721/1564 transitions.
Applied a total of 0 rules in 15 ms. Remains 751 /751 variables (removed 0) and now considering 721/721 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 751/1594 places, 721/1564 transitions.
Stuttering acceptance computed with spot in 90 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldIIPs-PT-030B-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s185 1), p1:(NEQ s204 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 1598 steps with 0 reset in 16 ms.
FORMULA ShieldIIPs-PT-030B-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-030B-LTLFireability-03 finished in 1827 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!G(X(!p0)) U (G(p1) U X(X(p2)))))'
Support contains 4 out of 1594 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1594/1594 places, 1564/1564 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1592 transition count 1562
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1592 transition count 1562
Applied a total of 4 rules in 68 ms. Remains 1592 /1594 variables (removed 2) and now considering 1562/1564 (removed 2) transitions.
// Phase 1: matrix 1562 rows 1592 cols
[2022-05-19 04:24:38] [INFO ] Computed 271 place invariants in 9 ms
[2022-05-19 04:24:38] [INFO ] Implicit Places using invariants in 486 ms returned []
// Phase 1: matrix 1562 rows 1592 cols
[2022-05-19 04:24:38] [INFO ] Computed 271 place invariants in 10 ms
[2022-05-19 04:24:40] [INFO ] Implicit Places using invariants and state equation in 1664 ms returned []
Implicit Place search using SMT with State Equation took 2154 ms to find 0 implicit places.
// Phase 1: matrix 1562 rows 1592 cols
[2022-05-19 04:24:40] [INFO ] Computed 271 place invariants in 4 ms
[2022-05-19 04:24:41] [INFO ] Dead Transitions using invariants and state equation in 817 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1592/1594 places, 1562/1564 transitions.
Finished structural reductions, in 1 iterations. Remains : 1592/1594 places, 1562/1564 transitions.
Stuttering acceptance computed with spot in 573 ms :[(AND (NOT p0) (NOT p1)), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p0), (NOT p2), (OR (NOT p0) (NOT p2))]
Running random walk in product with property : ShieldIIPs-PT-030B-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 8}], [{ cond=(AND p1 (NOT p0) p2), acceptance={0} source=1 dest: 0}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=1 dest: 6}, { cond=(AND p1 p0 (NOT p2)), acceptance={0} source=1 dest: 7}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={0} source=1 dest: 8}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 10}], [{ cond=(NOT p1), acceptance={} source=2 dest: 4}, { cond=p1, acceptance={} source=2 dest: 5}], [{ cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=3 dest: 6}, { cond=(AND p1 p0 (NOT p2)), acceptance={0} source=3 dest: 7}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 10}], [{ cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 6}, { cond=(AND p1 p0), acceptance={} source=4 dest: 7}, { cond=(NOT p0), acceptance={} source=4 dest: 9}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=5 dest: 6}, { cond=(AND p1 p0), acceptance={} source=5 dest: 7}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 9}], [{ cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=6 dest: 6}, { cond=(AND p1 p0 (NOT p2)), acceptance={0} source=6 dest: 7}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=6 dest: 9}], [{ cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0} source=7 dest: 3}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=7 dest: 6}, { cond=(AND p1 p0 (NOT p2)), acceptance={0} source=7 dest: 7}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=7 dest: 9}], [{ cond=(NOT p0), acceptance={0} source=8 dest: 8}], [{ cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=9 dest: 6}, { cond=(AND p1 p0 (NOT p2)), acceptance={0} source=9 dest: 7}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=9 dest: 10}], [{ cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=10 dest: 6}, { cond=(AND p1 p0 (NOT p2)), acceptance={0} source=10 dest: 7}, { cond=(AND (NOT p0) p2), acceptance={0} source=10 dest: 8}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=10 dest: 10}]], initial=2, aps=[p1:(EQ s443 1), p0:(AND (EQ s1349 1) (EQ s1373 1)), p2:(EQ s384 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 3753 steps with 0 reset in 47 ms.
FORMULA ShieldIIPs-PT-030B-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-030B-LTLFireability-04 finished in 3687 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(!X(F(p0))) U X(p1)))'
Support contains 4 out of 1594 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1594/1594 places, 1564/1564 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1593 transition count 1563
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1593 transition count 1563
Applied a total of 2 rules in 77 ms. Remains 1593 /1594 variables (removed 1) and now considering 1563/1564 (removed 1) transitions.
// Phase 1: matrix 1563 rows 1593 cols
[2022-05-19 04:24:42] [INFO ] Computed 271 place invariants in 9 ms
[2022-05-19 04:24:42] [INFO ] Implicit Places using invariants in 443 ms returned []
// Phase 1: matrix 1563 rows 1593 cols
[2022-05-19 04:24:42] [INFO ] Computed 271 place invariants in 4 ms
[2022-05-19 04:24:44] [INFO ] Implicit Places using invariants and state equation in 1593 ms returned []
Implicit Place search using SMT with State Equation took 2039 ms to find 0 implicit places.
// Phase 1: matrix 1563 rows 1593 cols
[2022-05-19 04:24:44] [INFO ] Computed 271 place invariants in 7 ms
[2022-05-19 04:24:44] [INFO ] Dead Transitions using invariants and state equation in 801 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1593/1594 places, 1563/1564 transitions.
Finished structural reductions, in 1 iterations. Remains : 1593/1594 places, 1563/1564 transitions.
Stuttering acceptance computed with spot in 109 ms :[(NOT p1), (NOT p1), p0]
Running random walk in product with property : ShieldIIPs-PT-030B-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}, { cond=p0, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(OR (EQ s1567 1) (AND (EQ s1041 1) (EQ s1051 1) (EQ s1071 1))), p0:(AND (EQ s1041 1) (EQ s1051 1) (EQ s1071 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 26 reset in 676 ms.
Product exploration explored 100000 steps with 27 reset in 775 ms.
Computed a total of 359 stabilizing places and 359 stable transitions
Computed a total of 359 stabilizing places and 359 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 2087 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 100 ms :[(OR (NOT p1) p0), (NOT p1), p0]
Finished random walk after 1580 steps, including 0 resets, run visited all 3 properties in 28 ms. (steps per millisecond=56 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p1), (F p0), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 4 factoid took 154 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 104 ms :[(OR (NOT p1) p0), (NOT p1), p0]
Stuttering acceptance computed with spot in 669 ms :[(OR (NOT p1) p0), (NOT p1), p0]
// Phase 1: matrix 1563 rows 1593 cols
[2022-05-19 04:24:50] [INFO ] Computed 271 place invariants in 8 ms
[2022-05-19 04:24:51] [INFO ] [Real]Absence check using 271 positive place invariants in 266 ms returned sat
[2022-05-19 04:24:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 04:24:57] [INFO ] [Real]Absence check using state equation in 6648 ms returned sat
[2022-05-19 04:24:57] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 04:24:59] [INFO ] [Nat]Absence check using 271 positive place invariants in 277 ms returned sat
[2022-05-19 04:24:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 04:25:06] [INFO ] [Nat]Absence check using state equation in 7907 ms returned sat
[2022-05-19 04:25:07] [INFO ] Computed and/alt/rep : 1562/3513/1562 causal constraints (skipped 0 transitions) in 86 ms.
[2022-05-19 04:25:12] [INFO ] Added : 145 causal constraints over 29 iterations in 5877 ms. Result :unknown
Could not prove EG (NOT p1)
Support contains 4 out of 1593 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1593/1593 places, 1563/1563 transitions.
Applied a total of 0 rules in 38 ms. Remains 1593 /1593 variables (removed 0) and now considering 1563/1563 (removed 0) transitions.
// Phase 1: matrix 1563 rows 1593 cols
[2022-05-19 04:25:12] [INFO ] Computed 271 place invariants in 10 ms
[2022-05-19 04:25:13] [INFO ] Implicit Places using invariants in 457 ms returned []
// Phase 1: matrix 1563 rows 1593 cols
[2022-05-19 04:25:13] [INFO ] Computed 271 place invariants in 6 ms
[2022-05-19 04:25:15] [INFO ] Implicit Places using invariants and state equation in 1656 ms returned []
Implicit Place search using SMT with State Equation took 2114 ms to find 0 implicit places.
// Phase 1: matrix 1563 rows 1593 cols
[2022-05-19 04:25:15] [INFO ] Computed 271 place invariants in 8 ms
[2022-05-19 04:25:15] [INFO ] Dead Transitions using invariants and state equation in 797 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1593/1593 places, 1563/1563 transitions.
Computed a total of 359 stabilizing places and 359 stable transitions
Computed a total of 359 stabilizing places and 359 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 250 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 123 ms :[(OR (NOT p1) p0), (NOT p1), p0]
Finished random walk after 1553 steps, including 0 resets, run visited all 3 properties in 29 ms. (steps per millisecond=53 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p1), (F p0), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 7 factoid took 266 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 106 ms :[(OR (NOT p1) p0), (NOT p1), p0]
Stuttering acceptance computed with spot in 106 ms :[(OR (NOT p1) p0), (NOT p1), p0]
// Phase 1: matrix 1563 rows 1593 cols
[2022-05-19 04:25:16] [INFO ] Computed 271 place invariants in 7 ms
[2022-05-19 04:25:17] [INFO ] [Real]Absence check using 271 positive place invariants in 255 ms returned sat
[2022-05-19 04:25:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 04:25:24] [INFO ] [Real]Absence check using state equation in 6524 ms returned sat
[2022-05-19 04:25:24] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 04:25:25] [INFO ] [Nat]Absence check using 271 positive place invariants in 280 ms returned sat
[2022-05-19 04:25:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 04:25:33] [INFO ] [Nat]Absence check using state equation in 7731 ms returned sat
[2022-05-19 04:25:33] [INFO ] Computed and/alt/rep : 1562/3513/1562 causal constraints (skipped 0 transitions) in 83 ms.
[2022-05-19 04:25:40] [INFO ] Deduced a trap composed of 21 places in 660 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1179)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:521)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:677)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:652)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:356)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:322)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:78)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:686)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-19 04:25:40] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p1)
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 130 ms :[(OR (NOT p1) p0), (NOT p1), p0]
Product exploration explored 100000 steps with 26 reset in 685 ms.
Product exploration explored 100000 steps with 26 reset in 745 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 112 ms :[(OR (NOT p1) p0), (NOT p1), p0]
Support contains 4 out of 1593 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1593/1593 places, 1563/1563 transitions.
Performed 148 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 148 rules applied. Total rules applied 148 place count 1593 transition count 1563
Performed 63 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 63 Pre rules applied. Total rules applied 148 place count 1593 transition count 1565
Deduced a syphon composed of 211 places in 2 ms
Iterating global reduction 1 with 63 rules applied. Total rules applied 211 place count 1593 transition count 1565
Performed 628 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 839 places in 2 ms
Iterating global reduction 1 with 628 rules applied. Total rules applied 839 place count 1593 transition count 1565
Renaming transitions due to excessive name length > 1024 char.
Discarding 207 places :
Symmetric choice reduction at 1 with 207 rule applications. Total rules 1046 place count 1386 transition count 1358
Deduced a syphon composed of 632 places in 1 ms
Iterating global reduction 1 with 207 rules applied. Total rules applied 1253 place count 1386 transition count 1358
Deduced a syphon composed of 632 places in 1 ms
Applied a total of 1253 rules in 342 ms. Remains 1386 /1593 variables (removed 207) and now considering 1358/1563 (removed 205) transitions.
[2022-05-19 04:25:42] [INFO ] Redundant transitions in 95 ms returned [1357]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 1357 rows 1386 cols
[2022-05-19 04:25:42] [INFO ] Computed 271 place invariants in 9 ms
[2022-05-19 04:25:42] [INFO ] Dead Transitions using invariants and state equation in 676 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1386/1593 places, 1357/1563 transitions.
Deduced a syphon composed of 632 places in 7 ms
Applied a total of 0 rules in 46 ms. Remains 1386 /1386 variables (removed 0) and now considering 1357/1357 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 1386/1593 places, 1357/1563 transitions.
Product exploration explored 100000 steps with 64 reset in 701 ms.
Product exploration explored 100000 steps with 64 reset in 785 ms.
Built C files in :
/tmp/ltsmin15425802018186519128
[2022-05-19 04:25:44] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15425802018186519128
Running compilation step : cd /tmp/ltsmin15425802018186519128;'/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 2814 ms.
Running link step : cd /tmp/ltsmin15425802018186519128;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin15425802018186519128;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased4629736930947563017.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 1593 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1593/1593 places, 1563/1563 transitions.
Applied a total of 0 rules in 49 ms. Remains 1593 /1593 variables (removed 0) and now considering 1563/1563 (removed 0) transitions.
// Phase 1: matrix 1563 rows 1593 cols
[2022-05-19 04:25:59] [INFO ] Computed 271 place invariants in 11 ms
[2022-05-19 04:26:00] [INFO ] Implicit Places using invariants in 475 ms returned []
// Phase 1: matrix 1563 rows 1593 cols
[2022-05-19 04:26:00] [INFO ] Computed 271 place invariants in 4 ms
[2022-05-19 04:26:01] [INFO ] Implicit Places using invariants and state equation in 1558 ms returned []
Implicit Place search using SMT with State Equation took 2037 ms to find 0 implicit places.
// Phase 1: matrix 1563 rows 1593 cols
[2022-05-19 04:26:01] [INFO ] Computed 271 place invariants in 11 ms
[2022-05-19 04:26:02] [INFO ] Dead Transitions using invariants and state equation in 798 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1593/1593 places, 1563/1563 transitions.
Built C files in :
/tmp/ltsmin1990308480257955053
[2022-05-19 04:26:02] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1990308480257955053
Running compilation step : cd /tmp/ltsmin1990308480257955053;'/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 2795 ms.
Running link step : cd /tmp/ltsmin1990308480257955053;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin1990308480257955053;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased2187173250823042814.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-19 04:26:18] [INFO ] Flatten gal took : 62 ms
[2022-05-19 04:26:18] [INFO ] Flatten gal took : 60 ms
[2022-05-19 04:26:18] [INFO ] Time to serialize gal into /tmp/LTL12645706169094700031.gal : 17 ms
[2022-05-19 04:26:18] [INFO ] Time to serialize properties into /tmp/LTL12976494302379803081.ltl : 1 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/LTL12645706169094700031.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12976494302379803081.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/LTL1264570...268
Read 1 LTL properties
Checking formula 0 : !(((F(!(X(F("(((p1174==1)&&(p1185==1))&&(p1210==1))")))))U(X("((p1771==1)||(((p1174==1)&&(p1185==1))&&(p1210==1)))"))))
Formula 0 simplified : !(F!XF"(((p1174==1)&&(p1185==1))&&(p1210==1))" U X"((p1771==1)||(((p1174==1)&&(p1185==1))&&(p1210==1)))")
Detected timeout of ITS tools.
[2022-05-19 04:26:33] [INFO ] Flatten gal took : 55 ms
[2022-05-19 04:26:33] [INFO ] Applying decomposition
[2022-05-19 04:26:33] [INFO ] Flatten gal took : 53 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/graph8498838119432722486.txt' '-o' '/tmp/graph8498838119432722486.bin' '-w' '/tmp/graph8498838119432722486.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph8498838119432722486.bin' '-l' '-1' '-v' '-w' '/tmp/graph8498838119432722486.weights' '-q' '0' '-e' '0.001'
[2022-05-19 04:26:33] [INFO ] Decomposing Gal with order
[2022-05-19 04:26:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 04:26:33] [INFO ] Removed a total of 690 redundant transitions.
[2022-05-19 04:26:34] [INFO ] Flatten gal took : 235 ms
[2022-05-19 04:26:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 20 ms.
[2022-05-19 04:26:34] [INFO ] Time to serialize gal into /tmp/LTL10253311533554898085.gal : 18 ms
[2022-05-19 04:26:34] [INFO ] Time to serialize properties into /tmp/LTL1031677953974292614.ltl : 1 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/LTL10253311533554898085.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1031677953974292614.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/LTL1025331...246
Read 1 LTL properties
Checking formula 0 : !(((F(!(X(F("(((i19.i5.u390.p1174==1)&&(i19.i2.u394.p1185==1))&&(i19.i5.u401.p1210==1))")))))U(X("((i28.u588.p1771==1)||(((i19.i5.u390...221
Formula 0 simplified : !(F!XF"(((i19.i5.u390.p1174==1)&&(i19.i2.u394.p1185==1))&&(i19.i5.u401.p1210==1))" U X"((i28.u588.p1771==1)||(((i19.i5.u390.p1174==1...209
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1831590510450665765
[2022-05-19 04:26:49] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1831590510450665765
Running compilation step : cd /tmp/ltsmin1831590510450665765;'/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 2926 ms.
Running link step : cd /tmp/ltsmin1831590510450665765;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin1831590510450665765;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(<>(!X(<>((LTLAPp0==true)))) U X((LTLAPp1==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldIIPs-PT-030B-LTLFireability-06 finished in 142285 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(G(((X(p1)&&p0)||(X(G(p2))&&p3))))))'
Support contains 5 out of 1594 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1594/1594 places, 1564/1564 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1592 transition count 1562
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1592 transition count 1562
Applied a total of 4 rules in 92 ms. Remains 1592 /1594 variables (removed 2) and now considering 1562/1564 (removed 2) transitions.
// Phase 1: matrix 1562 rows 1592 cols
[2022-05-19 04:27:04] [INFO ] Computed 271 place invariants in 4 ms
[2022-05-19 04:27:04] [INFO ] Implicit Places using invariants in 453 ms returned []
// Phase 1: matrix 1562 rows 1592 cols
[2022-05-19 04:27:04] [INFO ] Computed 271 place invariants in 4 ms
[2022-05-19 04:27:06] [INFO ] Implicit Places using invariants and state equation in 1647 ms returned []
Implicit Place search using SMT with State Equation took 2102 ms to find 0 implicit places.
// Phase 1: matrix 1562 rows 1592 cols
[2022-05-19 04:27:06] [INFO ] Computed 271 place invariants in 13 ms
[2022-05-19 04:27:07] [INFO ] Dead Transitions using invariants and state equation in 806 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1592/1594 places, 1562/1564 transitions.
Finished structural reductions, in 1 iterations. Remains : 1592/1594 places, 1562/1564 transitions.
Stuttering acceptance computed with spot in 131 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (AND p0 (NOT p1) p2 (NOT p3)), (AND (NOT p0) p1 (NOT p2) p3)]
Running random walk in product with property : ShieldIIPs-PT-030B-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(OR (AND p0 p1) (AND p0 p2) (AND p3 p1) (AND p3 p2)), acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p2))), acceptance={0} source=0 dest: 0}, { cond=(OR (AND p0 (NOT p3) p1) (AND p0 (NOT p3) p2)), acceptance={} source=0 dest: 1}, { cond=(OR (AND (NOT p0) p3 p1) (AND p0 (NOT p1) p2) (AND p3 (NOT p1) p2)), acceptance={} source=0 dest: 2}], [{ cond=(OR (AND p0 (NOT p1) p2) (AND p3 (NOT p1) p2)), acceptance={0} source=1 dest: 0}], [{ cond=(OR (AND p0 p1 (NOT p2)) (AND p3 p1 (NOT p2))), acceptance={0} source=2 dest: 0}, { cond=(OR (AND (NOT p0) (NOT p3) p2) (AND p0 p1 p2)), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s1457 1) (EQ s1465 1) (EQ s1487 1)), p1:(AND (EQ s1457 1) (EQ s1465 1) (EQ s1487 1)), p2:(EQ s523 1), p3:(EQ s1524 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 4524 steps with 1 reset in 39 ms.
FORMULA ShieldIIPs-PT-030B-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-030B-LTLFireability-07 finished in 3211 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((F(p0)||p1))))'
Support contains 4 out of 1594 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1594/1594 places, 1564/1564 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 149 transitions
Trivial Post-agglo rules discarded 149 transitions
Performed 149 trivial Post agglomeration. Transition count delta: 149
Iterating post reduction 0 with 149 rules applied. Total rules applied 149 place count 1593 transition count 1414
Reduce places removed 149 places and 0 transitions.
Iterating post reduction 1 with 149 rules applied. Total rules applied 298 place count 1444 transition count 1414
Performed 151 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 151 Pre rules applied. Total rules applied 298 place count 1444 transition count 1263
Deduced a syphon composed of 151 places in 4 ms
Reduce places removed 151 places and 0 transitions.
Iterating global reduction 2 with 302 rules applied. Total rules applied 600 place count 1293 transition count 1263
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 602 place count 1291 transition count 1261
Iterating global reduction 2 with 2 rules applied. Total rules applied 604 place count 1291 transition count 1261
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 604 place count 1291 transition count 1260
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 606 place count 1290 transition count 1260
Performed 534 Post agglomeration using F-continuation condition.Transition count delta: 534
Deduced a syphon composed of 534 places in 1 ms
Reduce places removed 534 places and 0 transitions.
Iterating global reduction 2 with 1068 rules applied. Total rules applied 1674 place count 756 transition count 726
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1676 place count 754 transition count 724
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1677 place count 753 transition count 724
Applied a total of 1677 rules in 239 ms. Remains 753 /1594 variables (removed 841) and now considering 724/1564 (removed 840) transitions.
// Phase 1: matrix 724 rows 753 cols
[2022-05-19 04:27:07] [INFO ] Computed 270 place invariants in 1 ms
[2022-05-19 04:27:08] [INFO ] Implicit Places using invariants in 302 ms returned []
// Phase 1: matrix 724 rows 753 cols
[2022-05-19 04:27:08] [INFO ] Computed 270 place invariants in 1 ms
[2022-05-19 04:27:08] [INFO ] Implicit Places using invariants and state equation in 745 ms returned []
Implicit Place search using SMT with State Equation took 1049 ms to find 0 implicit places.
[2022-05-19 04:27:08] [INFO ] Redundant transitions in 138 ms returned [723]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 723 rows 753 cols
[2022-05-19 04:27:08] [INFO ] Computed 270 place invariants in 1 ms
[2022-05-19 04:27:09] [INFO ] Dead Transitions using invariants and state equation in 396 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 753/1594 places, 723/1564 transitions.
Applied a total of 0 rules in 16 ms. Remains 753 /753 variables (removed 0) and now considering 723/723 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 753/1594 places, 723/1564 transitions.
Stuttering acceptance computed with spot in 89 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPs-PT-030B-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s178 0), p1:(AND (EQ s614 1) (EQ s625 1) (EQ s630 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]]
Product exploration explored 100000 steps with 293 reset in 680 ms.
Product exploration explored 100000 steps with 297 reset in 734 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/753 stabilizing places and 2/723 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 2 factoid took 178 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 6 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=6 )
Knowledge obtained : [(AND p0 (NOT p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 2 factoid took 167 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 46 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 57 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 753 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 753/753 places, 723/723 transitions.
Applied a total of 0 rules in 16 ms. Remains 753 /753 variables (removed 0) and now considering 723/723 (removed 0) transitions.
// Phase 1: matrix 723 rows 753 cols
[2022-05-19 04:27:11] [INFO ] Computed 270 place invariants in 3 ms
[2022-05-19 04:27:11] [INFO ] Implicit Places using invariants in 304 ms returned []
// Phase 1: matrix 723 rows 753 cols
[2022-05-19 04:27:11] [INFO ] Computed 270 place invariants in 1 ms
[2022-05-19 04:27:12] [INFO ] Implicit Places using invariants and state equation in 725 ms returned []
Implicit Place search using SMT with State Equation took 1033 ms to find 0 implicit places.
[2022-05-19 04:27:13] [INFO ] Redundant transitions in 481 ms returned []
// Phase 1: matrix 723 rows 753 cols
[2022-05-19 04:27:13] [INFO ] Computed 270 place invariants in 3 ms
[2022-05-19 04:27:13] [INFO ] Dead Transitions using invariants and state equation in 354 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 753/753 places, 723/723 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/753 stabilizing places and 2/723 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Knowledge based reduction with 2 factoid took 703 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 48 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 6 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=6 )
Knowledge obtained : [(AND (NOT p1) p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 2 factoid took 139 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 52 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 333 reset in 674 ms.
Product exploration explored 100000 steps with 299 reset in 783 ms.
Built C files in :
/tmp/ltsmin16596951816134910008
[2022-05-19 04:27:15] [INFO ] Computing symmetric may disable matrix : 723 transitions.
[2022-05-19 04:27:15] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 04:27:15] [INFO ] Computing symmetric may enable matrix : 723 transitions.
[2022-05-19 04:27:15] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 04:27:16] [INFO ] Computing Do-Not-Accords matrix : 723 transitions.
[2022-05-19 04:27:16] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 04:27:16] [INFO ] Built C files in 68ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16596951816134910008
Running compilation step : cd /tmp/ltsmin16596951816134910008;'/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 1795 ms.
Running link step : cd /tmp/ltsmin16596951816134910008;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin16596951816134910008;'/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/stateBased374442424965225696.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 753 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 753/753 places, 723/723 transitions.
Applied a total of 0 rules in 13 ms. Remains 753 /753 variables (removed 0) and now considering 723/723 (removed 0) transitions.
// Phase 1: matrix 723 rows 753 cols
[2022-05-19 04:27:31] [INFO ] Computed 270 place invariants in 8 ms
[2022-05-19 04:27:31] [INFO ] Implicit Places using invariants in 353 ms returned []
// Phase 1: matrix 723 rows 753 cols
[2022-05-19 04:27:31] [INFO ] Computed 270 place invariants in 1 ms
[2022-05-19 04:27:32] [INFO ] Implicit Places using invariants and state equation in 712 ms returned []
Implicit Place search using SMT with State Equation took 1069 ms to find 0 implicit places.
[2022-05-19 04:27:32] [INFO ] Redundant transitions in 78 ms returned []
// Phase 1: matrix 723 rows 753 cols
[2022-05-19 04:27:32] [INFO ] Computed 270 place invariants in 6 ms
[2022-05-19 04:27:32] [INFO ] Dead Transitions using invariants and state equation in 343 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 753/753 places, 723/723 transitions.
Built C files in :
/tmp/ltsmin16818664253338272960
[2022-05-19 04:27:32] [INFO ] Computing symmetric may disable matrix : 723 transitions.
[2022-05-19 04:27:32] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 04:27:32] [INFO ] Computing symmetric may enable matrix : 723 transitions.
[2022-05-19 04:27:32] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 04:27:32] [INFO ] Computing Do-Not-Accords matrix : 723 transitions.
[2022-05-19 04:27:32] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 04:27:32] [INFO ] Built C files in 62ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16818664253338272960
Running compilation step : cd /tmp/ltsmin16818664253338272960;'/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 1789 ms.
Running link step : cd /tmp/ltsmin16818664253338272960;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin16818664253338272960;'/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/stateBased541087726545135900.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-19 04:27:47] [INFO ] Flatten gal took : 33 ms
[2022-05-19 04:27:47] [INFO ] Flatten gal took : 31 ms
[2022-05-19 04:27:47] [INFO ] Time to serialize gal into /tmp/LTL4395827171645752907.gal : 7 ms
[2022-05-19 04:27:47] [INFO ] Time to serialize properties into /tmp/LTL18295050628495493353.ltl : 1 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/LTL4395827171645752907.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18295050628495493353.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/LTL4395827...267
Read 1 LTL properties
Checking formula 0 : !((G(F((F("(p450==0)"))||("(((p1472==1)&&(p1494==1))&&(p1505==1))")))))
Formula 0 simplified : !GF("(((p1472==1)&&(p1494==1))&&(p1505==1))" | F"(p450==0)")
Detected timeout of ITS tools.
[2022-05-19 04:28:02] [INFO ] Flatten gal took : 31 ms
[2022-05-19 04:28:02] [INFO ] Applying decomposition
[2022-05-19 04:28:02] [INFO ] Flatten gal took : 27 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/graph17445345969430696822.txt' '-o' '/tmp/graph17445345969430696822.bin' '-w' '/tmp/graph17445345969430696822.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph17445345969430696822.bin' '-l' '-1' '-v' '-w' '/tmp/graph17445345969430696822.weights' '-q' '0' '-e' '0.001'
[2022-05-19 04:28:02] [INFO ] Decomposing Gal with order
[2022-05-19 04:28:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 04:28:03] [INFO ] Removed a total of 480 redundant transitions.
[2022-05-19 04:28:03] [INFO ] Flatten gal took : 58 ms
[2022-05-19 04:28:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 448 labels/synchronizations in 11 ms.
[2022-05-19 04:28:03] [INFO ] Time to serialize gal into /tmp/LTL1901151723618150819.gal : 6 ms
[2022-05-19 04:28:03] [INFO ] Time to serialize properties into /tmp/LTL10448570138063715749.ltl : 1 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/LTL1901151723618150819.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10448570138063715749.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/LTL1901151...246
Read 1 LTL properties
Checking formula 0 : !((G(F((F("(i7.i0.u70.p450==0)"))||("(((i24.i3.u221.p1472==1)&&(i24.i1.u224.p1494==1))&&(i24.i3.u226.p1505==1))")))))
Formula 0 simplified : !GF("(((i24.i3.u221.p1472==1)&&(i24.i1.u224.p1494==1))&&(i24.i3.u226.p1505==1))" | F"(i7.i0.u70.p450==0)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9393731764375654398
[2022-05-19 04:28:18] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9393731764375654398
Running compilation step : cd /tmp/ltsmin9393731764375654398;'/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 1199 ms.
Running link step : cd /tmp/ltsmin9393731764375654398;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin9393731764375654398;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>((<>((LTLAPp0==true))||(LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldIIPs-PT-030B-LTLFireability-10 finished in 85698 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(X(X(F(p0))))))'
Support contains 3 out of 1594 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1594/1594 places, 1564/1564 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 151 transitions
Trivial Post-agglo rules discarded 151 transitions
Performed 151 trivial Post agglomeration. Transition count delta: 151
Iterating post reduction 0 with 151 rules applied. Total rules applied 151 place count 1593 transition count 1412
Reduce places removed 151 places and 0 transitions.
Iterating post reduction 1 with 151 rules applied. Total rules applied 302 place count 1442 transition count 1412
Performed 150 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 150 Pre rules applied. Total rules applied 302 place count 1442 transition count 1262
Deduced a syphon composed of 150 places in 2 ms
Reduce places removed 150 places and 0 transitions.
Iterating global reduction 2 with 300 rules applied. Total rules applied 602 place count 1292 transition count 1262
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 603 place count 1291 transition count 1261
Iterating global reduction 2 with 1 rules applied. Total rules applied 604 place count 1291 transition count 1261
Performed 537 Post agglomeration using F-continuation condition.Transition count delta: 537
Deduced a syphon composed of 537 places in 1 ms
Reduce places removed 537 places and 0 transitions.
Iterating global reduction 2 with 1074 rules applied. Total rules applied 1678 place count 754 transition count 724
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1680 place count 752 transition count 722
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1681 place count 751 transition count 722
Applied a total of 1681 rules in 179 ms. Remains 751 /1594 variables (removed 843) and now considering 722/1564 (removed 842) transitions.
// Phase 1: matrix 722 rows 751 cols
[2022-05-19 04:28:33] [INFO ] Computed 270 place invariants in 3 ms
[2022-05-19 04:28:33] [INFO ] Implicit Places using invariants in 306 ms returned []
// Phase 1: matrix 722 rows 751 cols
[2022-05-19 04:28:33] [INFO ] Computed 270 place invariants in 3 ms
[2022-05-19 04:28:34] [INFO ] Implicit Places using invariants and state equation in 661 ms returned []
Implicit Place search using SMT with State Equation took 970 ms to find 0 implicit places.
[2022-05-19 04:28:34] [INFO ] Redundant transitions in 71 ms returned [721]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 721 rows 751 cols
[2022-05-19 04:28:34] [INFO ] Computed 270 place invariants in 3 ms
[2022-05-19 04:28:34] [INFO ] Dead Transitions using invariants and state equation in 337 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 751/1594 places, 721/1564 transitions.
Applied a total of 0 rules in 12 ms. Remains 751 /751 variables (removed 0) and now considering 721/721 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 751/1594 places, 721/1564 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-030B-LTLFireability-11 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 s13 0) (AND (EQ s29 1) (EQ s45 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]]
Product exploration explored 100000 steps with 70 reset in 648 ms.
Product exploration explored 100000 steps with 69 reset in 750 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 942 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 54 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1331 steps, including 0 resets, run visited all 1 properties in 14 ms. (steps per millisecond=95 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 110 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 54 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Support contains 3 out of 751 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 751/751 places, 721/721 transitions.
Applied a total of 0 rules in 16 ms. Remains 751 /751 variables (removed 0) and now considering 721/721 (removed 0) transitions.
// Phase 1: matrix 721 rows 751 cols
[2022-05-19 04:28:37] [INFO ] Computed 270 place invariants in 3 ms
[2022-05-19 04:28:37] [INFO ] Implicit Places using invariants in 316 ms returned []
// Phase 1: matrix 721 rows 751 cols
[2022-05-19 04:28:37] [INFO ] Computed 270 place invariants in 1 ms
[2022-05-19 04:28:38] [INFO ] Implicit Places using invariants and state equation in 675 ms returned []
Implicit Place search using SMT with State Equation took 993 ms to find 0 implicit places.
[2022-05-19 04:28:38] [INFO ] Redundant transitions in 66 ms returned []
// Phase 1: matrix 721 rows 751 cols
[2022-05-19 04:28:38] [INFO ] Computed 270 place invariants in 1 ms
[2022-05-19 04:28:38] [INFO ] Dead Transitions using invariants and state equation in 309 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 751/751 places, 721/721 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 93 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 76 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1459 steps, including 0 resets, run visited all 1 properties in 12 ms. (steps per millisecond=121 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 329 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 78 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 69 reset in 637 ms.
Product exploration explored 100000 steps with 69 reset in 738 ms.
Built C files in :
/tmp/ltsmin12650734632862756313
[2022-05-19 04:28:41] [INFO ] Computing symmetric may disable matrix : 721 transitions.
[2022-05-19 04:28:41] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 04:28:41] [INFO ] Computing symmetric may enable matrix : 721 transitions.
[2022-05-19 04:28:41] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 04:28:41] [INFO ] Computing Do-Not-Accords matrix : 721 transitions.
[2022-05-19 04:28:41] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 04:28:41] [INFO ] Built C files in 76ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12650734632862756313
Running compilation step : cd /tmp/ltsmin12650734632862756313;'/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 1792 ms.
Running link step : cd /tmp/ltsmin12650734632862756313;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin12650734632862756313;'/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/stateBased12983579465116980037.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 751 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 751/751 places, 721/721 transitions.
Applied a total of 0 rules in 17 ms. Remains 751 /751 variables (removed 0) and now considering 721/721 (removed 0) transitions.
// Phase 1: matrix 721 rows 751 cols
[2022-05-19 04:28:56] [INFO ] Computed 270 place invariants in 3 ms
[2022-05-19 04:28:56] [INFO ] Implicit Places using invariants in 335 ms returned []
// Phase 1: matrix 721 rows 751 cols
[2022-05-19 04:28:56] [INFO ] Computed 270 place invariants in 2 ms
[2022-05-19 04:28:57] [INFO ] Implicit Places using invariants and state equation in 682 ms returned []
Implicit Place search using SMT with State Equation took 1019 ms to find 0 implicit places.
[2022-05-19 04:28:57] [INFO ] Redundant transitions in 63 ms returned []
// Phase 1: matrix 721 rows 751 cols
[2022-05-19 04:28:57] [INFO ] Computed 270 place invariants in 5 ms
[2022-05-19 04:28:57] [INFO ] Dead Transitions using invariants and state equation in 346 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 751/751 places, 721/721 transitions.
Built C files in :
/tmp/ltsmin16484252095464337953
[2022-05-19 04:28:57] [INFO ] Computing symmetric may disable matrix : 721 transitions.
[2022-05-19 04:28:57] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 04:28:57] [INFO ] Computing symmetric may enable matrix : 721 transitions.
[2022-05-19 04:28:57] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 04:28:57] [INFO ] Computing Do-Not-Accords matrix : 721 transitions.
[2022-05-19 04:28:57] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 04:28:57] [INFO ] Built C files in 60ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16484252095464337953
Running compilation step : cd /tmp/ltsmin16484252095464337953;'/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 1862 ms.
Running link step : cd /tmp/ltsmin16484252095464337953;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin16484252095464337953;'/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/stateBased10436608548574850940.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-19 04:29:12] [INFO ] Flatten gal took : 27 ms
[2022-05-19 04:29:12] [INFO ] Flatten gal took : 28 ms
[2022-05-19 04:29:12] [INFO ] Time to serialize gal into /tmp/LTL15113976958975096414.gal : 19 ms
[2022-05-19 04:29:12] [INFO ] Time to serialize properties into /tmp/LTL10339113176609829348.ltl : 1 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/LTL15113976958975096414.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10339113176609829348.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/LTL1511397...268
Read 1 LTL properties
Checking formula 0 : !((G(X(X(X(F("((p58==0)||((p102==1)&&(p129==1)))")))))))
Formula 0 simplified : !GXXXF"((p58==0)||((p102==1)&&(p129==1)))"
Detected timeout of ITS tools.
[2022-05-19 04:29:27] [INFO ] Flatten gal took : 28 ms
[2022-05-19 04:29:27] [INFO ] Applying decomposition
[2022-05-19 04:29:27] [INFO ] Flatten gal took : 27 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/graph1891467836801694192.txt' '-o' '/tmp/graph1891467836801694192.bin' '-w' '/tmp/graph1891467836801694192.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph1891467836801694192.bin' '-l' '-1' '-v' '-w' '/tmp/graph1891467836801694192.weights' '-q' '0' '-e' '0.001'
[2022-05-19 04:29:28] [INFO ] Decomposing Gal with order
[2022-05-19 04:29:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 04:29:28] [INFO ] Removed a total of 477 redundant transitions.
[2022-05-19 04:29:28] [INFO ] Flatten gal took : 46 ms
[2022-05-19 04:29:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 454 labels/synchronizations in 9 ms.
[2022-05-19 04:29:28] [INFO ] Time to serialize gal into /tmp/LTL5394664446147448672.gal : 5 ms
[2022-05-19 04:29:28] [INFO ] Time to serialize properties into /tmp/LTL1382131778594011621.ltl : 1 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/LTL5394664446147448672.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1382131778594011621.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/LTL5394664...245
Read 1 LTL properties
Checking formula 0 : !((G(X(X(X(F("((i0.i2.u7.p58==0)||((i1.i0.u11.p102==1)&&(i1.i0.u17.p129==1)))")))))))
Formula 0 simplified : !GXXXF"((i0.i2.u7.p58==0)||((i1.i0.u11.p102==1)&&(i1.i0.u17.p129==1)))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4499336870985732740
[2022-05-19 04:29:43] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4499336870985732740
Running compilation step : cd /tmp/ltsmin4499336870985732740;'/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 2090 ms.
Running link step : cd /tmp/ltsmin4499336870985732740;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin4499336870985732740;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](X(X(X(<>((LTLAPp0==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldIIPs-PT-030B-LTLFireability-11 finished in 85083 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(G(F(G(p0))))))'
Support contains 1 out of 1594 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1594/1594 places, 1564/1564 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 150 transitions
Trivial Post-agglo rules discarded 150 transitions
Performed 150 trivial Post agglomeration. Transition count delta: 150
Iterating post reduction 0 with 150 rules applied. Total rules applied 150 place count 1593 transition count 1413
Reduce places removed 150 places and 0 transitions.
Iterating post reduction 1 with 150 rules applied. Total rules applied 300 place count 1443 transition count 1413
Performed 150 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 150 Pre rules applied. Total rules applied 300 place count 1443 transition count 1263
Deduced a syphon composed of 150 places in 2 ms
Reduce places removed 150 places and 0 transitions.
Iterating global reduction 2 with 300 rules applied. Total rules applied 600 place count 1293 transition count 1263
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 602 place count 1291 transition count 1261
Iterating global reduction 2 with 2 rules applied. Total rules applied 604 place count 1291 transition count 1261
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 604 place count 1291 transition count 1260
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 606 place count 1290 transition count 1260
Performed 536 Post agglomeration using F-continuation condition.Transition count delta: 536
Deduced a syphon composed of 536 places in 1 ms
Reduce places removed 536 places and 0 transitions.
Iterating global reduction 2 with 1072 rules applied. Total rules applied 1678 place count 754 transition count 724
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1680 place count 752 transition count 722
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1681 place count 751 transition count 722
Applied a total of 1681 rules in 236 ms. Remains 751 /1594 variables (removed 843) and now considering 722/1564 (removed 842) transitions.
// Phase 1: matrix 722 rows 751 cols
[2022-05-19 04:29:58] [INFO ] Computed 270 place invariants in 4 ms
[2022-05-19 04:29:59] [INFO ] Implicit Places using invariants in 303 ms returned []
// Phase 1: matrix 722 rows 751 cols
[2022-05-19 04:29:59] [INFO ] Computed 270 place invariants in 5 ms
[2022-05-19 04:29:59] [INFO ] Implicit Places using invariants and state equation in 682 ms returned []
Implicit Place search using SMT with State Equation took 987 ms to find 0 implicit places.
[2022-05-19 04:29:59] [INFO ] Redundant transitions in 76 ms returned [721]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 721 rows 751 cols
[2022-05-19 04:29:59] [INFO ] Computed 270 place invariants in 2 ms
[2022-05-19 04:30:00] [INFO ] Dead Transitions using invariants and state equation in 333 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 751/1594 places, 721/1564 transitions.
Applied a total of 0 rules in 11 ms. Remains 751 /751 variables (removed 0) and now considering 721/721 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 751/1594 places, 721/1564 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-030B-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s168 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 1589 steps with 0 reset in 14 ms.
FORMULA ShieldIIPs-PT-030B-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-030B-LTLFireability-12 finished in 1937 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U p1))'
Support contains 2 out of 1594 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1594/1594 places, 1564/1564 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 149 transitions
Trivial Post-agglo rules discarded 149 transitions
Performed 149 trivial Post agglomeration. Transition count delta: 149
Iterating post reduction 0 with 149 rules applied. Total rules applied 149 place count 1593 transition count 1414
Reduce places removed 149 places and 0 transitions.
Iterating post reduction 1 with 149 rules applied. Total rules applied 298 place count 1444 transition count 1414
Performed 149 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 149 Pre rules applied. Total rules applied 298 place count 1444 transition count 1265
Deduced a syphon composed of 149 places in 2 ms
Reduce places removed 149 places and 0 transitions.
Iterating global reduction 2 with 298 rules applied. Total rules applied 596 place count 1295 transition count 1265
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 598 place count 1293 transition count 1263
Iterating global reduction 2 with 2 rules applied. Total rules applied 600 place count 1293 transition count 1263
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 600 place count 1293 transition count 1262
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 602 place count 1292 transition count 1262
Performed 536 Post agglomeration using F-continuation condition.Transition count delta: 536
Deduced a syphon composed of 536 places in 2 ms
Reduce places removed 536 places and 0 transitions.
Iterating global reduction 2 with 1072 rules applied. Total rules applied 1674 place count 756 transition count 726
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1676 place count 754 transition count 724
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1677 place count 753 transition count 724
Applied a total of 1677 rules in 208 ms. Remains 753 /1594 variables (removed 841) and now considering 724/1564 (removed 840) transitions.
// Phase 1: matrix 724 rows 753 cols
[2022-05-19 04:30:00] [INFO ] Computed 270 place invariants in 2 ms
[2022-05-19 04:30:00] [INFO ] Implicit Places using invariants in 304 ms returned []
// Phase 1: matrix 724 rows 753 cols
[2022-05-19 04:30:00] [INFO ] Computed 270 place invariants in 3 ms
[2022-05-19 04:30:01] [INFO ] Implicit Places using invariants and state equation in 703 ms returned []
Implicit Place search using SMT with State Equation took 1016 ms to find 0 implicit places.
[2022-05-19 04:30:01] [INFO ] Redundant transitions in 68 ms returned [723]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 723 rows 753 cols
[2022-05-19 04:30:01] [INFO ] Computed 270 place invariants in 1 ms
[2022-05-19 04:30:01] [INFO ] Dead Transitions using invariants and state equation in 327 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 753/1594 places, 723/1564 transitions.
Applied a total of 0 rules in 12 ms. Remains 753 /753 variables (removed 0) and now considering 723/723 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 753/1594 places, 723/1564 transitions.
Stuttering acceptance computed with spot in 505 ms :[(NOT p1), true, (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-030B-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(EQ s470 1), p0:(NEQ s449 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldIIPs-PT-030B-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-030B-LTLFireability-13 finished in 2192 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(!X(F(p0))) U X(p1)))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((F(p0)||p1))))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(X(X(F(p0))))))'
[2022-05-19 04:30:02] [INFO ] Flatten gal took : 43 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin8711391651053441752
[2022-05-19 04:30:02] [INFO ] Too many transitions (1564) to apply POR reductions. Disabling POR matrices.
[2022-05-19 04:30:02] [INFO ] Applying decomposition
[2022-05-19 04:30:02] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8711391651053441752
Running compilation step : cd /tmp/ltsmin8711391651053441752;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '240' '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-19 04:30:02] [INFO ] Flatten gal took : 43 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/graph15889803058834948707.txt' '-o' '/tmp/graph15889803058834948707.bin' '-w' '/tmp/graph15889803058834948707.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph15889803058834948707.bin' '-l' '-1' '-v' '-w' '/tmp/graph15889803058834948707.weights' '-q' '0' '-e' '0.001'
[2022-05-19 04:30:02] [INFO ] Decomposing Gal with order
[2022-05-19 04:30:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 04:30:03] [INFO ] Removed a total of 690 redundant transitions.
[2022-05-19 04:30:03] [INFO ] Flatten gal took : 69 ms
[2022-05-19 04:30:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 6 ms.
[2022-05-19 04:30:03] [INFO ] Time to serialize gal into /tmp/LTLFireability9928692870378669213.gal : 11 ms
[2022-05-19 04:30:03] [INFO ] Time to serialize properties into /tmp/LTLFireability15418752169310682660.ltl : 0 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/LTLFireability9928692870378669213.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability15418752169310682660.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...268
Read 3 LTL properties
Checking formula 0 : !(((F(!(X(F("(((i19.i4.u393.p1174==1)&&(i19.i5.u397.p1185==1))&&(i19.i7.u404.p1210==1))")))))U(X("((i29.i3.u590.p1771==1)||(((i19.i4.u...224
Formula 0 simplified : !(F!XF"(((i19.i4.u393.p1174==1)&&(i19.i5.u397.p1185==1))&&(i19.i7.u404.p1210==1))" U X"((i29.i3.u590.p1771==1)||(((i19.i4.u393.p1174...212
Compilation finished in 2976 ms.
Running link step : cd /tmp/ltsmin8711391651053441752;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin8711391651053441752;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(<>(!X(<>((LTLAPp0==true)))) U X((LTLAPp1==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>1200 s) on command cd /tmp/ltsmin8711391651053441752;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(<>(!X(<>((LTLAPp0==true)))) U X((LTLAPp1==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin8711391651053441752;'/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' '--ltl' '[](<>((<>((LTLAPp2==true))||(LTLAPp3==true))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-05-19 04:52:20] [INFO ] Applying decomposition
[2022-05-19 04:52:20] [INFO ] Flatten gal took : 108 ms
[2022-05-19 04:52:20] [INFO ] Decomposing Gal with order
[2022-05-19 04:52:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 04:52:20] [INFO ] Removed a total of 480 redundant transitions.
[2022-05-19 04:52:20] [INFO ] Flatten gal took : 181 ms
[2022-05-19 04:52:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 600 labels/synchronizations in 142 ms.
[2022-05-19 04:52:21] [INFO ] Time to serialize gal into /tmp/LTLFireability2941453911192422562.gal : 26 ms
[2022-05-19 04:52:21] [INFO ] Time to serialize properties into /tmp/LTLFireability16459519154999148866.ltl : 1 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/LTLFireability2941453911192422562.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability16459519154999148866.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...268
Read 3 LTL properties
Checking formula 0 : !(((F(!(X(F("(((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.i0.i0.u365.p1174==1)&&(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.u367.p1185=...433
Formula 0 simplified : !(F!XF"(((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.i0.i0.u365.p1174==1)&&(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.u367.p1185==1))...421
WARNING : LTSmin timed out (>1200 s) on command cd /tmp/ltsmin8711391651053441752;'/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' '--ltl' '[](<>((<>((LTLAPp2==true))||(LTLAPp3==true))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin8711391651053441752;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](X(X(X(<>((LTLAPp4==true))))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-05-19 05:14:40] [INFO ] Flatten gal took : 277 ms
[2022-05-19 05:14:42] [INFO ] Input system was already deterministic with 1564 transitions.
[2022-05-19 05:14:42] [INFO ] Transformed 1594 places.
[2022-05-19 05:14:42] [INFO ] Transformed 1564 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-05-19 05:14:42] [INFO ] Time to serialize gal into /tmp/LTLFireability299268153461446747.gal : 24 ms
[2022-05-19 05:14:42] [INFO ] Time to serialize properties into /tmp/LTLFireability5808994102967476153.ltl : 2 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/LTLFireability299268153461446747.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability5808994102967476153.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--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/LTLFireabi...332
Read 3 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !(((F(!(X(F("(((p1174==1)&&(p1185==1))&&(p1210==1))")))))U(X("((p1771==1)||(((p1174==1)&&(p1185==1))&&(p1210==1)))"))))
Formula 0 simplified : !(F!XF"(((p1174==1)&&(p1185==1))&&(p1210==1))" U X"((p1771==1)||(((p1174==1)&&(p1185==1))&&(p1210==1)))")
BK_TIME_CONFINEMENT_REACHED
--------------------
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="ShieldIIPs-PT-030B"
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 ShieldIIPs-PT-030B, 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 r222-tall-165286024700124"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPs-PT-030B.tgz
mv ShieldIIPs-PT-030B 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 '
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 ;