Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r389-oct2-167903713200172.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is ShieldIIPs-PT-100B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r389-oct2-167903713200172
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.2M
-rw-r--r-- 1 mcc users 8.9K Feb 25 16:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 99K Feb 25 16:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 25 16:40 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 25 16:40 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 25 16:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 143K Feb 25 16:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Feb 25 16:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 25 16:41 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 1.7M Mar 5 18:23 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-100B-LTLFireability-00
FORMULA_NAME ShieldIIPs-PT-100B-LTLFireability-01
FORMULA_NAME ShieldIIPs-PT-100B-LTLFireability-02
FORMULA_NAME ShieldIIPs-PT-100B-LTLFireability-03
FORMULA_NAME ShieldIIPs-PT-100B-LTLFireability-04
FORMULA_NAME ShieldIIPs-PT-100B-LTLFireability-05
FORMULA_NAME ShieldIIPs-PT-100B-LTLFireability-06
FORMULA_NAME ShieldIIPs-PT-100B-LTLFireability-07
FORMULA_NAME ShieldIIPs-PT-100B-LTLFireability-08
FORMULA_NAME ShieldIIPs-PT-100B-LTLFireability-09
FORMULA_NAME ShieldIIPs-PT-100B-LTLFireability-10
FORMULA_NAME ShieldIIPs-PT-100B-LTLFireability-11
FORMULA_NAME ShieldIIPs-PT-100B-LTLFireability-12
FORMULA_NAME ShieldIIPs-PT-100B-LTLFireability-13
FORMULA_NAME ShieldIIPs-PT-100B-LTLFireability-14
FORMULA_NAME ShieldIIPs-PT-100B-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679182853697

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPs-PT-100B
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-18 23:40:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-18 23:40:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 23:40:55] [INFO ] Load time of PNML (sax parser for PT used): 284 ms
[2023-03-18 23:40:56] [INFO ] Transformed 6003 places.
[2023-03-18 23:40:56] [INFO ] Transformed 5903 transitions.
[2023-03-18 23:40:56] [INFO ] Found NUPN structural information;
[2023-03-18 23:40:56] [INFO ] Parsed PT model containing 6003 places and 5903 transitions and 17806 arcs in 709 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA ShieldIIPs-PT-100B-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 61 out of 6003 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6003/6003 places, 5903/5903 transitions.
Discarding 689 places :
Symmetric choice reduction at 0 with 689 rule applications. Total rules 689 place count 5314 transition count 5214
Iterating global reduction 0 with 689 rules applied. Total rules applied 1378 place count 5314 transition count 5214
Applied a total of 1378 rules in 1379 ms. Remains 5314 /6003 variables (removed 689) and now considering 5214/5903 (removed 689) transitions.
// Phase 1: matrix 5214 rows 5314 cols
[2023-03-18 23:40:58] [INFO ] Computed 901 place invariants in 57 ms
[2023-03-18 23:41:01] [INFO ] Implicit Places using invariants in 3027 ms returned []
[2023-03-18 23:41:01] [INFO ] Invariant cache hit.
[2023-03-18 23:41:04] [INFO ] Implicit Places using invariants and state equation in 3133 ms returned []
Implicit Place search using SMT with State Equation took 6251 ms to find 0 implicit places.
[2023-03-18 23:41:04] [INFO ] Invariant cache hit.
[2023-03-18 23:41:09] [INFO ] Dead Transitions using invariants and state equation in 4935 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5314/6003 places, 5214/5903 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12575 ms. Remains : 5314/6003 places, 5214/5903 transitions.
Support contains 61 out of 5314 places after structural reductions.
[2023-03-18 23:41:09] [INFO ] Flatten gal took : 340 ms
[2023-03-18 23:41:10] [INFO ] Flatten gal took : 216 ms
[2023-03-18 23:41:10] [INFO ] Input system was already deterministic with 5214 transitions.
Support contains 59 out of 5314 places (down from 61) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 646 ms. (steps per millisecond=15 ) properties (out of 39) seen :14
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 25) seen :0
Running SMT prover for 25 properties.
[2023-03-18 23:41:11] [INFO ] Invariant cache hit.
[2023-03-18 23:41:14] [INFO ] [Real]Absence check using 901 positive place invariants in 736 ms returned sat
[2023-03-18 23:41:14] [INFO ] After 3463ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:25
[2023-03-18 23:41:18] [INFO ] [Nat]Absence check using 901 positive place invariants in 905 ms returned sat
[2023-03-18 23:41:28] [INFO ] After 8107ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :25
[2023-03-18 23:41:30] [INFO ] Deduced a trap composed of 20 places in 1893 ms of which 25 ms to minimize.
[2023-03-18 23:41:32] [INFO ] Deduced a trap composed of 30 places in 2238 ms of which 17 ms to minimize.
[2023-03-18 23:41:34] [INFO ] Deduced a trap composed of 37 places in 1896 ms of which 15 ms to minimize.
[2023-03-18 23:41:37] [INFO ] Deduced a trap composed of 31 places in 2262 ms of which 15 ms to minimize.
[2023-03-18 23:41:39] [INFO ] Deduced a trap composed of 24 places in 1760 ms of which 2 ms to minimize.
[2023-03-18 23:41:41] [INFO ] Deduced a trap composed of 13 places in 2174 ms of which 3 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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
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:402)
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:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
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)
[2023-03-18 23:41:41] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 23:41:41] [INFO ] After 26849ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:25
Fused 25 Parikh solutions to 23 different solutions.
Parikh walk visited 3 properties in 8312 ms.
Support contains 39 out of 5314 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5314/5314 places, 5214/5214 transitions.
Drop transitions removed 494 transitions
Trivial Post-agglo rules discarded 494 transitions
Performed 494 trivial Post agglomeration. Transition count delta: 494
Iterating post reduction 0 with 494 rules applied. Total rules applied 494 place count 5314 transition count 4720
Reduce places removed 494 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 495 rules applied. Total rules applied 989 place count 4820 transition count 4719
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 990 place count 4819 transition count 4719
Performed 498 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 498 Pre rules applied. Total rules applied 990 place count 4819 transition count 4221
Deduced a syphon composed of 498 places in 28 ms
Reduce places removed 498 places and 0 transitions.
Iterating global reduction 3 with 996 rules applied. Total rules applied 1986 place count 4321 transition count 4221
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 1994 place count 4313 transition count 4213
Iterating global reduction 3 with 8 rules applied. Total rules applied 2002 place count 4313 transition count 4213
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 2002 place count 4313 transition count 4210
Deduced a syphon composed of 3 places in 20 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 2008 place count 4310 transition count 4210
Performed 1787 Post agglomeration using F-continuation condition.Transition count delta: 1787
Deduced a syphon composed of 1787 places in 38 ms
Reduce places removed 1787 places and 0 transitions.
Iterating global reduction 3 with 3574 rules applied. Total rules applied 5582 place count 2523 transition count 2423
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 677 times.
Drop transitions removed 677 transitions
Iterating global reduction 3 with 677 rules applied. Total rules applied 6259 place count 2523 transition count 2423
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 6260 place count 2522 transition count 2422
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 6261 place count 2521 transition count 2422
Applied a total of 6261 rules in 2103 ms. Remains 2521 /5314 variables (removed 2793) and now considering 2422/5214 (removed 2792) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2104 ms. Remains : 2521/5314 places, 2422/5214 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 407 ms. (steps per millisecond=24 ) properties (out of 22) seen :9
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 137 ms. (steps per millisecond=72 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 177 ms. (steps per millisecond=56 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 182 ms. (steps per millisecond=54 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 164 ms. (steps per millisecond=60 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 273 ms. (steps per millisecond=36 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 249 ms. (steps per millisecond=40 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 158 ms. (steps per millisecond=63 ) properties (out of 13) seen :0
Running SMT prover for 13 properties.
// Phase 1: matrix 2422 rows 2521 cols
[2023-03-18 23:41:54] [INFO ] Computed 900 place invariants in 136 ms
[2023-03-18 23:41:56] [INFO ] [Real]Absence check using 889 positive place invariants in 620 ms returned sat
[2023-03-18 23:41:56] [INFO ] [Real]Absence check using 889 positive and 11 generalized place invariants in 5 ms returned sat
[2023-03-18 23:41:56] [INFO ] After 1593ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2023-03-18 23:41:57] [INFO ] [Nat]Absence check using 889 positive place invariants in 171 ms returned sat
[2023-03-18 23:41:57] [INFO ] [Nat]Absence check using 889 positive and 11 generalized place invariants in 4 ms returned sat
[2023-03-18 23:42:00] [INFO ] After 2545ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :13
[2023-03-18 23:42:00] [INFO ] Deduced a trap composed of 3 places in 111 ms of which 0 ms to minimize.
[2023-03-18 23:42:00] [INFO ] Deduced a trap composed of 5 places in 215 ms of which 1 ms to minimize.
[2023-03-18 23:42:01] [INFO ] Deduced a trap composed of 7 places in 292 ms of which 0 ms to minimize.
[2023-03-18 23:42:01] [INFO ] Deduced a trap composed of 4 places in 265 ms of which 2 ms to minimize.
[2023-03-18 23:42:01] [INFO ] Deduced a trap composed of 4 places in 268 ms of which 0 ms to minimize.
[2023-03-18 23:42:02] [INFO ] Deduced a trap composed of 17 places in 269 ms of which 2 ms to minimize.
[2023-03-18 23:42:02] [INFO ] Deduced a trap composed of 8 places in 253 ms of which 4 ms to minimize.
[2023-03-18 23:42:02] [INFO ] Deduced a trap composed of 8 places in 288 ms of which 1 ms to minimize.
[2023-03-18 23:42:03] [INFO ] Deduced a trap composed of 6 places in 433 ms of which 1 ms to minimize.
[2023-03-18 23:42:03] [INFO ] Deduced a trap composed of 12 places in 295 ms of which 0 ms to minimize.
[2023-03-18 23:42:04] [INFO ] Deduced a trap composed of 9 places in 342 ms of which 0 ms to minimize.
[2023-03-18 23:42:04] [INFO ] Deduced a trap composed of 18 places in 215 ms of which 0 ms to minimize.
[2023-03-18 23:42:04] [INFO ] Deduced a trap composed of 11 places in 228 ms of which 1 ms to minimize.
[2023-03-18 23:42:05] [INFO ] Deduced a trap composed of 17 places in 267 ms of which 1 ms to minimize.
[2023-03-18 23:42:05] [INFO ] Deduced a trap composed of 20 places in 197 ms of which 1 ms to minimize.
[2023-03-18 23:42:05] [INFO ] Deduced a trap composed of 17 places in 235 ms of which 14 ms to minimize.
[2023-03-18 23:42:05] [INFO ] Deduced a trap composed of 11 places in 234 ms of which 1 ms to minimize.
[2023-03-18 23:42:06] [INFO ] Deduced a trap composed of 23 places in 255 ms of which 1 ms to minimize.
[2023-03-18 23:42:06] [INFO ] Deduced a trap composed of 20 places in 242 ms of which 1 ms to minimize.
[2023-03-18 23:42:06] [INFO ] Deduced a trap composed of 17 places in 266 ms of which 1 ms to minimize.
[2023-03-18 23:42:07] [INFO ] Deduced a trap composed of 19 places in 320 ms of which 0 ms to minimize.
[2023-03-18 23:42:07] [INFO ] Deduced a trap composed of 14 places in 269 ms of which 1 ms to minimize.
[2023-03-18 23:42:08] [INFO ] Deduced a trap composed of 18 places in 414 ms of which 0 ms to minimize.
[2023-03-18 23:42:08] [INFO ] Deduced a trap composed of 14 places in 259 ms of which 0 ms to minimize.
[2023-03-18 23:42:08] [INFO ] Deduced a trap composed of 17 places in 321 ms of which 2 ms to minimize.
[2023-03-18 23:42:09] [INFO ] Deduced a trap composed of 17 places in 330 ms of which 6 ms to minimize.
[2023-03-18 23:42:09] [INFO ] Deduced a trap composed of 25 places in 342 ms of which 0 ms to minimize.
[2023-03-18 23:42:10] [INFO ] Deduced a trap composed of 22 places in 226 ms of which 17 ms to minimize.
[2023-03-18 23:42:10] [INFO ] Deduced a trap composed of 25 places in 196 ms of which 1 ms to minimize.
[2023-03-18 23:42:10] [INFO ] Deduced a trap composed of 8 places in 190 ms of which 0 ms to minimize.
[2023-03-18 23:42:11] [INFO ] Deduced a trap composed of 25 places in 269 ms of which 1 ms to minimize.
[2023-03-18 23:42:11] [INFO ] Trap strengthening (SAT) tested/added 32/31 trap constraints in 10849 ms
[2023-03-18 23:42:11] [INFO ] Deduced a trap composed of 11 places in 141 ms of which 1 ms to minimize.
[2023-03-18 23:42:12] [INFO ] Deduced a trap composed of 8 places in 402 ms of which 0 ms to minimize.
[2023-03-18 23:42:12] [INFO ] Deduced a trap composed of 5 places in 125 ms of which 2 ms to minimize.
[2023-03-18 23:42:12] [INFO ] Deduced a trap composed of 9 places in 216 ms of which 1 ms to minimize.
[2023-03-18 23:42:12] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1355 ms
[2023-03-18 23:42:12] [INFO ] Deduced a trap composed of 5 places in 104 ms of which 0 ms to minimize.
[2023-03-18 23:42:13] [INFO ] Deduced a trap composed of 4 places in 109 ms of which 1 ms to minimize.
[2023-03-18 23:42:13] [INFO ] Deduced a trap composed of 14 places in 121 ms of which 0 ms to minimize.
[2023-03-18 23:42:13] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 655 ms
[2023-03-18 23:42:13] [INFO ] Deduced a trap composed of 8 places in 277 ms of which 1 ms to minimize.
[2023-03-18 23:42:14] [INFO ] Deduced a trap composed of 8 places in 189 ms of which 0 ms to minimize.
[2023-03-18 23:42:14] [INFO ] Deduced a trap composed of 18 places in 136 ms of which 1 ms to minimize.
[2023-03-18 23:42:14] [INFO ] Deduced a trap composed of 9 places in 214 ms of which 0 ms to minimize.
[2023-03-18 23:42:14] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1224 ms
[2023-03-18 23:42:15] [INFO ] Deduced a trap composed of 17 places in 184 ms of which 0 ms to minimize.
[2023-03-18 23:42:15] [INFO ] Deduced a trap composed of 4 places in 204 ms of which 0 ms to minimize.
[2023-03-18 23:42:15] [INFO ] Deduced a trap composed of 8 places in 157 ms of which 1 ms to minimize.
[2023-03-18 23:42:15] [INFO ] Deduced a trap composed of 4 places in 126 ms of which 0 ms to minimize.
[2023-03-18 23:42:16] [INFO ] Deduced a trap composed of 9 places in 178 ms of which 0 ms to minimize.
[2023-03-18 23:42:16] [INFO ] Deduced a trap composed of 8 places in 201 ms of which 1 ms to minimize.
[2023-03-18 23:42:16] [INFO ] Deduced a trap composed of 17 places in 192 ms of which 1 ms to minimize.
[2023-03-18 23:42:17] [INFO ] Deduced a trap composed of 11 places in 280 ms of which 13 ms to minimize.
[2023-03-18 23:42:17] [INFO ] Deduced a trap composed of 4 places in 238 ms of which 1 ms to minimize.
[2023-03-18 23:42:17] [INFO ] Deduced a trap composed of 7 places in 174 ms of which 0 ms to minimize.
[2023-03-18 23:42:17] [INFO ] Deduced a trap composed of 18 places in 138 ms of which 0 ms to minimize.
[2023-03-18 23:42:18] [INFO ] Deduced a trap composed of 11 places in 227 ms of which 0 ms to minimize.
[2023-03-18 23:42:18] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 3479 ms
[2023-03-18 23:42:19] [INFO ] Deduced a trap composed of 8 places in 231 ms of which 1 ms to minimize.
[2023-03-18 23:42:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 419 ms
[2023-03-18 23:42:20] [INFO ] Deduced a trap composed of 8 places in 233 ms of which 1 ms to minimize.
[2023-03-18 23:42:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 387 ms
[2023-03-18 23:42:20] [INFO ] After 22531ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :13
Attempting to minimize the solution found.
Minimization took 1265 ms.
[2023-03-18 23:42:21] [INFO ] After 25057ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :13
Parikh walk visited 0 properties in 883 ms.
Support contains 25 out of 2521 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2521/2521 places, 2422/2422 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 2521 transition count 2419
Deduced a syphon composed of 3 places in 7 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 2518 transition count 2419
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 6 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 20 place count 2511 transition count 2412
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 0 with 7 rules applied. Total rules applied 27 place count 2511 transition count 2412
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 2510 transition count 2411
Applied a total of 28 rules in 318 ms. Remains 2510 /2521 variables (removed 11) and now considering 2411/2422 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 319 ms. Remains : 2510/2521 places, 2411/2422 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 448 ms. (steps per millisecond=22 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 150 ms. (steps per millisecond=66 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 176 ms. (steps per millisecond=56 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 145 ms. (steps per millisecond=68 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 145 ms. (steps per millisecond=68 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 159 ms. (steps per millisecond=62 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 159 ms. (steps per millisecond=62 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 13) seen :0
Interrupted probabilistic random walk after 128631 steps, run timeout after 6003 ms. (steps per millisecond=21 ) properties seen :{1=1, 10=1}
Probabilistic random walk after 128631 steps, saw 126712 distinct states, run finished after 6005 ms. (steps per millisecond=21 ) properties seen :2
Running SMT prover for 11 properties.
// Phase 1: matrix 2411 rows 2510 cols
[2023-03-18 23:42:30] [INFO ] Computed 900 place invariants in 25 ms
[2023-03-18 23:42:32] [INFO ] [Real]Absence check using 893 positive place invariants in 472 ms returned sat
[2023-03-18 23:42:32] [INFO ] [Real]Absence check using 893 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-18 23:42:35] [INFO ] After 4613ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-18 23:42:36] [INFO ] [Nat]Absence check using 893 positive place invariants in 361 ms returned sat
[2023-03-18 23:42:36] [INFO ] [Nat]Absence check using 893 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-18 23:42:40] [INFO ] After 2577ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-18 23:42:40] [INFO ] Deduced a trap composed of 4 places in 155 ms of which 0 ms to minimize.
[2023-03-18 23:42:40] [INFO ] Deduced a trap composed of 3 places in 178 ms of which 8 ms to minimize.
[2023-03-18 23:42:40] [INFO ] Deduced a trap composed of 4 places in 164 ms of which 1 ms to minimize.
[2023-03-18 23:42:41] [INFO ] Deduced a trap composed of 5 places in 195 ms of which 0 ms to minimize.
[2023-03-18 23:42:41] [INFO ] Deduced a trap composed of 9 places in 276 ms of which 1 ms to minimize.
[2023-03-18 23:42:41] [INFO ] Deduced a trap composed of 5 places in 167 ms of which 1 ms to minimize.
[2023-03-18 23:42:42] [INFO ] Deduced a trap composed of 6 places in 124 ms of which 0 ms to minimize.
[2023-03-18 23:42:42] [INFO ] Deduced a trap composed of 8 places in 145 ms of which 0 ms to minimize.
[2023-03-18 23:42:42] [INFO ] Deduced a trap composed of 4 places in 186 ms of which 1 ms to minimize.
[2023-03-18 23:42:42] [INFO ] Deduced a trap composed of 8 places in 217 ms of which 1 ms to minimize.
[2023-03-18 23:42:43] [INFO ] Deduced a trap composed of 3 places in 174 ms of which 0 ms to minimize.
[2023-03-18 23:42:43] [INFO ] Deduced a trap composed of 6 places in 186 ms of which 0 ms to minimize.
[2023-03-18 23:42:43] [INFO ] Deduced a trap composed of 4 places in 171 ms of which 0 ms to minimize.
[2023-03-18 23:42:43] [INFO ] Deduced a trap composed of 4 places in 181 ms of which 1 ms to minimize.
[2023-03-18 23:42:44] [INFO ] Deduced a trap composed of 7 places in 177 ms of which 1 ms to minimize.
[2023-03-18 23:42:44] [INFO ] Deduced a trap composed of 8 places in 164 ms of which 1 ms to minimize.
[2023-03-18 23:42:44] [INFO ] Deduced a trap composed of 16 places in 167 ms of which 0 ms to minimize.
[2023-03-18 23:42:45] [INFO ] Deduced a trap composed of 8 places in 156 ms of which 1 ms to minimize.
[2023-03-18 23:42:45] [INFO ] Deduced a trap composed of 17 places in 161 ms of which 0 ms to minimize.
[2023-03-18 23:42:45] [INFO ] Deduced a trap composed of 8 places in 129 ms of which 0 ms to minimize.
[2023-03-18 23:42:45] [INFO ] Deduced a trap composed of 11 places in 128 ms of which 0 ms to minimize.
[2023-03-18 23:42:45] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 5638 ms
[2023-03-18 23:42:46] [INFO ] Deduced a trap composed of 11 places in 187 ms of which 0 ms to minimize.
[2023-03-18 23:42:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 373 ms
[2023-03-18 23:42:46] [INFO ] Deduced a trap composed of 8 places in 140 ms of which 0 ms to minimize.
[2023-03-18 23:42:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 353 ms
[2023-03-18 23:42:47] [INFO ] Deduced a trap composed of 9 places in 181 ms of which 1 ms to minimize.
[2023-03-18 23:42:47] [INFO ] Deduced a trap composed of 18 places in 119 ms of which 0 ms to minimize.
[2023-03-18 23:42:47] [INFO ] Deduced a trap composed of 9 places in 160 ms of which 3 ms to minimize.
[2023-03-18 23:42:47] [INFO ] Deduced a trap composed of 17 places in 213 ms of which 1 ms to minimize.
[2023-03-18 23:42:48] [INFO ] Deduced a trap composed of 18 places in 256 ms of which 0 ms to minimize.
[2023-03-18 23:42:48] [INFO ] Deduced a trap composed of 17 places in 168 ms of which 1 ms to minimize.
[2023-03-18 23:42:48] [INFO ] Deduced a trap composed of 11 places in 160 ms of which 0 ms to minimize.
[2023-03-18 23:42:49] [INFO ] Deduced a trap composed of 9 places in 207 ms of which 1 ms to minimize.
[2023-03-18 23:42:49] [INFO ] Deduced a trap composed of 16 places in 246 ms of which 1 ms to minimize.
[2023-03-18 23:42:49] [INFO ] Deduced a trap composed of 23 places in 160 ms of which 0 ms to minimize.
[2023-03-18 23:42:49] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2752 ms
[2023-03-18 23:42:49] [INFO ] Deduced a trap composed of 4 places in 93 ms of which 0 ms to minimize.
[2023-03-18 23:42:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 248 ms
[2023-03-18 23:42:50] [INFO ] Deduced a trap composed of 4 places in 123 ms of which 1 ms to minimize.
[2023-03-18 23:42:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 278 ms
[2023-03-18 23:42:50] [INFO ] Deduced a trap composed of 11 places in 169 ms of which 1 ms to minimize.
[2023-03-18 23:42:51] [INFO ] Deduced a trap composed of 11 places in 161 ms of which 1 ms to minimize.
[2023-03-18 23:42:51] [INFO ] Deduced a trap composed of 8 places in 177 ms of which 0 ms to minimize.
[2023-03-18 23:42:51] [INFO ] Deduced a trap composed of 8 places in 155 ms of which 1 ms to minimize.
[2023-03-18 23:42:51] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1103 ms
[2023-03-18 23:42:51] [INFO ] After 14324ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 1141 ms.
[2023-03-18 23:42:53] [INFO ] After 17445ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Parikh walk visited 0 properties in 711 ms.
Support contains 22 out of 2510 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2510/2510 places, 2411/2411 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 7 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 2508 transition count 2409
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 2508 transition count 2409
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 2507 transition count 2408
Applied a total of 8 rules in 307 ms. Remains 2507 /2510 variables (removed 3) and now considering 2408/2411 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 308 ms. Remains : 2507/2510 places, 2408/2411 transitions.
Computed a total of 1207 stabilizing places and 1207 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U G(p1))&&X((!p0&&G(F(p2))))))'
Support contains 3 out of 5314 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5314/5314 places, 5214/5214 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 5302 transition count 5202
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 5302 transition count 5202
Applied a total of 24 rules in 840 ms. Remains 5302 /5314 variables (removed 12) and now considering 5202/5214 (removed 12) transitions.
// Phase 1: matrix 5202 rows 5302 cols
[2023-03-18 23:42:55] [INFO ] Computed 901 place invariants in 19 ms
[2023-03-18 23:42:57] [INFO ] Implicit Places using invariants in 2221 ms returned []
[2023-03-18 23:42:57] [INFO ] Invariant cache hit.
[2023-03-18 23:42:59] [INFO ] Implicit Places using invariants and state equation in 1924 ms returned []
Implicit Place search using SMT with State Equation took 4148 ms to find 0 implicit places.
[2023-03-18 23:42:59] [INFO ] Invariant cache hit.
[2023-03-18 23:43:04] [INFO ] Dead Transitions using invariants and state equation in 4452 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5302/5314 places, 5202/5214 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9458 ms. Remains : 5302/5314 places, 5202/5214 transitions.
Stuttering acceptance computed with spot in 556 ms :[(OR (NOT p1) (NOT p2) p0), true, (NOT p1), (NOT p1), (OR (NOT p2) p0), (NOT p2), (NOT p2)]
Running random walk in product with property : ShieldIIPs-PT-100B-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}, { cond=(OR p1 p0), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(AND p1 p0), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}], [{ cond=p0, acceptance={} source=4 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 5}, { cond=(NOT p0), acceptance={} source=4 dest: 6}], [{ cond=(NOT p2), acceptance={0} source=5 dest: 5}], [{ cond=(NOT p2), acceptance={} source=6 dest: 5}, { cond=true, acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(EQ s1379 1), p0:(NEQ s4785 1), p2:(EQ s2315 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 4 ms.
FORMULA ShieldIIPs-PT-100B-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-100B-LTLFireability-00 finished in 10172 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U X(G((p1||G(p2))))))'
Support contains 6 out of 5314 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5314/5314 places, 5214/5214 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 5303 transition count 5203
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 5303 transition count 5203
Applied a total of 22 rules in 966 ms. Remains 5303 /5314 variables (removed 11) and now considering 5203/5214 (removed 11) transitions.
// Phase 1: matrix 5203 rows 5303 cols
[2023-03-18 23:43:05] [INFO ] Computed 901 place invariants in 26 ms
[2023-03-18 23:43:07] [INFO ] Implicit Places using invariants in 1849 ms returned []
[2023-03-18 23:43:07] [INFO ] Invariant cache hit.
[2023-03-18 23:43:09] [INFO ] Implicit Places using invariants and state equation in 1958 ms returned []
Implicit Place search using SMT with State Equation took 3828 ms to find 0 implicit places.
[2023-03-18 23:43:09] [INFO ] Invariant cache hit.
[2023-03-18 23:43:13] [INFO ] Dead Transitions using invariants and state equation in 4119 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5303/5314 places, 5203/5214 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8919 ms. Remains : 5303/5314 places, 5203/5214 transitions.
Stuttering acceptance computed with spot in 385 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2)), true, (NOT p2), (NOT p0), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldIIPs-PT-100B-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 0}, { cond=(AND p0 p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=1 dest: 4}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=1 dest: 5}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=1 dest: 6}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 1}, { cond=(OR (AND p0 p1) (AND p0 p2)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0, 1} source=2 dest: 2}, { cond=(AND p0 (NOT p1) p2), acceptance={1} source=2 dest: 7}], [{ cond=true, acceptance={0, 1} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=p2, acceptance={} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 3}, { cond=p0, acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p0) p2), acceptance={} source=6 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={} source=6 dest: 5}, { cond=(AND p0 p2), acceptance={} source=6 dest: 6}], [{ cond=(NOT p0), acceptance={} source=7 dest: 0}, { cond=p0, acceptance={} source=7 dest: 1}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=7 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0, 1} source=7 dest: 2}, { cond=(AND p0 p1 p2), acceptance={} source=7 dest: 7}, { cond=(AND p0 (NOT p1) p2), acceptance={1} source=7 dest: 7}]], initial=2, aps=[p1:(NEQ s1538 1), p2:(OR (NEQ s548 1) (EQ s5205 1)), p0:(AND (EQ s4988 1) (EQ s4433 1) (EQ s4449 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 10942 steps with 0 reset in 240 ms.
FORMULA ShieldIIPs-PT-100B-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-100B-LTLFireability-01 finished in 9605 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0))||G(p1)))'
Support contains 4 out of 5314 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5314/5314 places, 5214/5214 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 499 transitions
Trivial Post-agglo rules discarded 499 transitions
Performed 499 trivial Post agglomeration. Transition count delta: 499
Iterating post reduction 0 with 499 rules applied. Total rules applied 499 place count 5313 transition count 4714
Reduce places removed 499 places and 0 transitions.
Iterating post reduction 1 with 499 rules applied. Total rules applied 998 place count 4814 transition count 4714
Performed 501 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 501 Pre rules applied. Total rules applied 998 place count 4814 transition count 4213
Deduced a syphon composed of 501 places in 19 ms
Reduce places removed 501 places and 0 transitions.
Iterating global reduction 2 with 1002 rules applied. Total rules applied 2000 place count 4313 transition count 4213
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 2012 place count 4301 transition count 4201
Iterating global reduction 2 with 12 rules applied. Total rules applied 2024 place count 4301 transition count 4201
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 2024 place count 4301 transition count 4197
Deduced a syphon composed of 4 places in 19 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 2032 place count 4297 transition count 4197
Performed 1794 Post agglomeration using F-continuation condition.Transition count delta: 1794
Deduced a syphon composed of 1794 places in 12 ms
Reduce places removed 1794 places and 0 transitions.
Iterating global reduction 2 with 3588 rules applied. Total rules applied 5620 place count 2503 transition count 2403
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 5622 place count 2501 transition count 2401
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5623 place count 2500 transition count 2401
Applied a total of 5623 rules in 1278 ms. Remains 2500 /5314 variables (removed 2814) and now considering 2401/5214 (removed 2813) transitions.
// Phase 1: matrix 2401 rows 2500 cols
[2023-03-18 23:43:15] [INFO ] Computed 900 place invariants in 5 ms
[2023-03-18 23:43:17] [INFO ] Implicit Places using invariants in 1887 ms returned []
[2023-03-18 23:43:17] [INFO ] Invariant cache hit.
[2023-03-18 23:43:21] [INFO ] Implicit Places using invariants and state equation in 4212 ms returned []
Implicit Place search using SMT with State Equation took 6102 ms to find 0 implicit places.
[2023-03-18 23:43:23] [INFO ] Redundant transitions in 1637 ms returned [2400]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 2400 rows 2500 cols
[2023-03-18 23:43:23] [INFO ] Computed 900 place invariants in 5 ms
[2023-03-18 23:43:24] [INFO ] Dead Transitions using invariants and state equation in 1421 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2500/5314 places, 2400/5214 transitions.
Applied a total of 0 rules in 85 ms. Remains 2500 /2500 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 10568 ms. Remains : 2500/5314 places, 2400/5214 transitions.
Stuttering acceptance computed with spot in 125 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-100B-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (EQ s412 1) (EQ s421 1) (EQ s427 1)), p0:(EQ s1616 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 4979 steps with 0 reset in 84 ms.
FORMULA ShieldIIPs-PT-100B-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-100B-LTLFireability-02 finished in 10835 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X(X(G(p1))))))'
Support contains 4 out of 5314 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5314/5314 places, 5214/5214 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 5302 transition count 5202
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 5302 transition count 5202
Applied a total of 24 rules in 868 ms. Remains 5302 /5314 variables (removed 12) and now considering 5202/5214 (removed 12) transitions.
// Phase 1: matrix 5202 rows 5302 cols
[2023-03-18 23:43:26] [INFO ] Computed 901 place invariants in 52 ms
[2023-03-18 23:43:28] [INFO ] Implicit Places using invariants in 2019 ms returned []
[2023-03-18 23:43:28] [INFO ] Invariant cache hit.
[2023-03-18 23:43:30] [INFO ] Implicit Places using invariants and state equation in 2199 ms returned []
Implicit Place search using SMT with State Equation took 4222 ms to find 0 implicit places.
[2023-03-18 23:43:30] [INFO ] Invariant cache hit.
[2023-03-18 23:43:34] [INFO ] Dead Transitions using invariants and state equation in 4563 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5302/5314 places, 5202/5214 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9655 ms. Remains : 5302/5314 places, 5202/5214 transitions.
Stuttering acceptance computed with spot in 282 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPs-PT-100B-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=4, aps=[p0:(EQ s3696 1), p1:(AND (EQ s438 1) (EQ s454 1) (EQ s463 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA ShieldIIPs-PT-100B-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-100B-LTLFireability-03 finished in 10014 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||G(p1))))'
Support contains 3 out of 5314 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5314/5314 places, 5214/5214 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 5304 transition count 5204
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 5304 transition count 5204
Applied a total of 20 rules in 962 ms. Remains 5304 /5314 variables (removed 10) and now considering 5204/5214 (removed 10) transitions.
// Phase 1: matrix 5204 rows 5304 cols
[2023-03-18 23:43:36] [INFO ] Computed 901 place invariants in 29 ms
[2023-03-18 23:43:38] [INFO ] Implicit Places using invariants in 2113 ms returned []
[2023-03-18 23:43:38] [INFO ] Invariant cache hit.
[2023-03-18 23:43:40] [INFO ] Implicit Places using invariants and state equation in 2268 ms returned []
Implicit Place search using SMT with State Equation took 4387 ms to find 0 implicit places.
[2023-03-18 23:43:40] [INFO ] Invariant cache hit.
[2023-03-18 23:43:45] [INFO ] Dead Transitions using invariants and state equation in 4950 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5304/5314 places, 5204/5214 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10300 ms. Remains : 5304/5314 places, 5204/5214 transitions.
Stuttering acceptance computed with spot in 129 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPs-PT-100B-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(EQ s291 1), p0:(AND (EQ s4420 0) (EQ s2684 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 2818 ms.
Product exploration explored 100000 steps with 50000 reset in 2942 ms.
Computed a total of 1201 stabilizing places and 1201 stable transitions
Computed a total of 1201 stabilizing places and 1201 stable transitions
Detected a total of 1201/5304 stabilizing places and 1201/5204 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), true, (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) p1)))
Knowledge based reduction with 6 factoid took 203 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPs-PT-100B-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPs-PT-100B-LTLFireability-05 finished in 16562 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X((G((p1||G(p2))) U (!p3&&G((p1||G(p2))))))||p0))))'
Support contains 8 out of 5314 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5314/5314 places, 5214/5214 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 5303 transition count 5203
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 5303 transition count 5203
Applied a total of 22 rules in 934 ms. Remains 5303 /5314 variables (removed 11) and now considering 5203/5214 (removed 11) transitions.
// Phase 1: matrix 5203 rows 5303 cols
[2023-03-18 23:43:52] [INFO ] Computed 901 place invariants in 45 ms
[2023-03-18 23:43:55] [INFO ] Implicit Places using invariants in 2498 ms returned []
[2023-03-18 23:43:55] [INFO ] Invariant cache hit.
[2023-03-18 23:43:57] [INFO ] Implicit Places using invariants and state equation in 2187 ms returned []
Implicit Place search using SMT with State Equation took 4706 ms to find 0 implicit places.
[2023-03-18 23:43:57] [INFO ] Invariant cache hit.
[2023-03-18 23:44:01] [INFO ] Dead Transitions using invariants and state equation in 3910 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5303/5314 places, 5203/5214 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9553 ms. Remains : 5303/5314 places, 5203/5214 transitions.
Stuttering acceptance computed with spot in 323 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) p3)), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) p3)), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) p3)), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2) p3)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldIIPs-PT-100B-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(OR (AND (NOT p0) p3) (AND (NOT p0) (NOT p1) (NOT p2))), acceptance={0, 1} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p3) (NOT p1) p2), acceptance={1} source=2 dest: 3}, { cond=(OR (AND (NOT p0) (NOT p3) p1) (AND (NOT p0) (NOT p3) p2)), acceptance={0} source=2 dest: 4}], [{ cond=(OR (AND (NOT p0) p3 (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p2))), acceptance={0, 1} source=3 dest: 2}, { cond=(OR (AND (NOT p0) p3 p2) (AND (NOT p0) (NOT p1) p2)), acceptance={1} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p3) p1 (NOT p2)), acceptance={0} source=3 dest: 4}, { cond=(AND (NOT p0) (NOT p3) p1 p2), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0, 1} source=4 dest: 2}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={1} source=4 dest: 3}, { cond=(OR (AND (NOT p0) p1) (AND (NOT p0) p2)), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0, 1} source=5 dest: 2}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={1} source=5 dest: 3}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=5 dest: 4}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(OR (NEQ s3974 1) (NEQ s3992 1) (NEQ s3999 1) (NEQ s695 1) (NEQ s705 1) (NEQ s724 1)), p3:(AND (EQ s3974 1) (EQ s3992 1) (EQ s3999 1) (EQ s695 1) (EQ s...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 2954 ms.
Product exploration explored 100000 steps with 50000 reset in 2883 ms.
Computed a total of 1200 stabilizing places and 1200 stable transitions
Computed a total of 1200 stabilizing places and 1200 stable transitions
Knowledge obtained : [(AND p0 (NOT p3) (NOT p1) (NOT p2)), (X p0), (X (X (NOT (OR (AND (NOT p0) p3) (AND (NOT p0) (NOT p1) (NOT p2)))))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p1) p2)))), (X (X (NOT (OR (AND (NOT p0) (NOT p3) p1) (AND (NOT p0) (NOT p3) p2)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 5 factoid took 156 ms. Reduced automaton from 6 states, 16 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPs-PT-100B-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPs-PT-100B-LTLFireability-06 finished in 16069 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(G(p1))))'
Support contains 4 out of 5314 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5314/5314 places, 5214/5214 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 5302 transition count 5202
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 5302 transition count 5202
Applied a total of 24 rules in 897 ms. Remains 5302 /5314 variables (removed 12) and now considering 5202/5214 (removed 12) transitions.
// Phase 1: matrix 5202 rows 5302 cols
[2023-03-18 23:44:08] [INFO ] Computed 901 place invariants in 42 ms
[2023-03-18 23:44:10] [INFO ] Implicit Places using invariants in 2164 ms returned []
[2023-03-18 23:44:10] [INFO ] Invariant cache hit.
[2023-03-18 23:44:13] [INFO ] Implicit Places using invariants and state equation in 2213 ms returned []
Implicit Place search using SMT with State Equation took 4393 ms to find 0 implicit places.
[2023-03-18 23:44:13] [INFO ] Invariant cache hit.
[2023-03-18 23:44:17] [INFO ] Dead Transitions using invariants and state equation in 4488 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5302/5314 places, 5202/5214 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9780 ms. Remains : 5302/5314 places, 5202/5214 transitions.
Stuttering acceptance computed with spot in 213 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-100B-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(AND (EQ s4754 1) (EQ s4770 1) (EQ s4779 1)), p1:(EQ s4031 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3657 steps with 0 reset in 48 ms.
FORMULA ShieldIIPs-PT-100B-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-100B-LTLFireability-07 finished in 10087 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 5314 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5314/5314 places, 5214/5214 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 5302 transition count 5202
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 5302 transition count 5202
Applied a total of 24 rules in 949 ms. Remains 5302 /5314 variables (removed 12) and now considering 5202/5214 (removed 12) transitions.
[2023-03-18 23:44:18] [INFO ] Invariant cache hit.
[2023-03-18 23:44:21] [INFO ] Implicit Places using invariants in 2273 ms returned []
[2023-03-18 23:44:21] [INFO ] Invariant cache hit.
[2023-03-18 23:44:23] [INFO ] Implicit Places using invariants and state equation in 2069 ms returned []
Implicit Place search using SMT with State Equation took 4350 ms to find 0 implicit places.
[2023-03-18 23:44:23] [INFO ] Invariant cache hit.
[2023-03-18 23:44:28] [INFO ] Dead Transitions using invariants and state equation in 4752 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5302/5314 places, 5202/5214 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10055 ms. Remains : 5302/5314 places, 5202/5214 transitions.
Stuttering acceptance computed with spot in 108 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-100B-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s4849 1) (EQ s4864 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]]
Stuttering criterion allowed to conclude after 13571 steps with 1 reset in 226 ms.
FORMULA ShieldIIPs-PT-100B-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-100B-LTLFireability-08 finished in 10463 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||G((F(p1)&&F(G(p2)))))))'
Support contains 4 out of 5314 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5314/5314 places, 5214/5214 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 5303 transition count 5203
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 5303 transition count 5203
Applied a total of 22 rules in 885 ms. Remains 5303 /5314 variables (removed 11) and now considering 5203/5214 (removed 11) transitions.
// Phase 1: matrix 5203 rows 5303 cols
[2023-03-18 23:44:29] [INFO ] Computed 901 place invariants in 44 ms
[2023-03-18 23:44:31] [INFO ] Implicit Places using invariants in 2132 ms returned []
[2023-03-18 23:44:31] [INFO ] Invariant cache hit.
[2023-03-18 23:44:33] [INFO ] Implicit Places using invariants and state equation in 2192 ms returned []
Implicit Place search using SMT with State Equation took 4344 ms to find 0 implicit places.
[2023-03-18 23:44:33] [INFO ] Invariant cache hit.
[2023-03-18 23:44:38] [INFO ] Dead Transitions using invariants and state equation in 5018 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5303/5314 places, 5203/5214 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10250 ms. Remains : 5303/5314 places, 5203/5214 transitions.
Stuttering acceptance computed with spot in 314 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldIIPs-PT-100B-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=p2, acceptance={} source=3 dest: 3}, { cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 2}, { cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s2768 1) (EQ s254 1)), p1:(AND (EQ s2199 1) (EQ s2201 1)), p2:(EQ s2768 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 20344 steps with 1 reset in 386 ms.
FORMULA ShieldIIPs-PT-100B-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-100B-LTLFireability-09 finished in 11043 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))||G(p1)||(X(F(p2))&&G(p3))))'
Support contains 6 out of 5314 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5314/5314 places, 5214/5214 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 5304 transition count 5204
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 5304 transition count 5204
Applied a total of 20 rules in 872 ms. Remains 5304 /5314 variables (removed 10) and now considering 5204/5214 (removed 10) transitions.
// Phase 1: matrix 5204 rows 5304 cols
[2023-03-18 23:44:40] [INFO ] Computed 901 place invariants in 47 ms
[2023-03-18 23:44:42] [INFO ] Implicit Places using invariants in 2102 ms returned []
[2023-03-18 23:44:42] [INFO ] Invariant cache hit.
[2023-03-18 23:44:44] [INFO ] Implicit Places using invariants and state equation in 2046 ms returned []
Implicit Place search using SMT with State Equation took 4151 ms to find 0 implicit places.
[2023-03-18 23:44:44] [INFO ] Invariant cache hit.
[2023-03-18 23:44:49] [INFO ] Dead Transitions using invariants and state equation in 4909 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5304/5314 places, 5204/5214 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9956 ms. Remains : 5304/5314 places, 5204/5214 transitions.
Stuttering acceptance computed with spot in 735 ms :[true, (OR (NOT p3) (NOT p2)), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2))), (NOT p3), (AND (NOT p3) (NOT p0)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (AND (NOT p3) (NOT p1)), (AND (NOT p3) (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : ShieldIIPs-PT-100B-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p3), acceptance={0} source=1 dest: 0}, { cond=(AND p3 (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND p3 p2), acceptance={0} source=1 dest: 5}], [{ cond=(AND (NOT p1) p3), acceptance={} source=2 dest: 3}, { cond=(AND p1 p3), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p1) (NOT p3)), acceptance={} source=2 dest: 10}, { cond=(AND p1 (NOT p3)), acceptance={} source=2 dest: 11}], [{ cond=(AND (NOT p3) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND p3 (NOT p0) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND p3 p0 (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND p3 (NOT p0) p2), acceptance={} source=3 dest: 5}, { cond=(AND p3 p0 p2), acceptance={} source=3 dest: 6}, { cond=(AND (NOT p3) p0), acceptance={} source=3 dest: 10}], [{ cond=(AND (NOT p1) (NOT p3) (NOT p0)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p1) p3 (NOT p0) (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) p3 p0 (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(AND p1 p3 p0 (NOT p2)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) p3 (NOT p0) p2), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p1) p3 p0 p2), acceptance={} source=4 dest: 6}, { cond=(AND p1 p3 (NOT p0) (NOT p2)), acceptance={} source=4 dest: 7}, { cond=(AND p1 p3 (NOT p0) p2), acceptance={} source=4 dest: 8}, { cond=(AND p1 p3 p0 p2), acceptance={} source=4 dest: 9}, { cond=(AND (NOT p1) (NOT p3) p0), acceptance={} source=4 dest: 10}, { cond=(AND p1 (NOT p3) p0), acceptance={} source=4 dest: 11}, { cond=(AND p1 (NOT p3) (NOT p0)), acceptance={} source=4 dest: 12}], [{ cond=(NOT p3), acceptance={} source=5 dest: 0}, { cond=p3, acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p3) (NOT p0)), acceptance={} source=6 dest: 0}, { cond=(AND p3 (NOT p0)), acceptance={} source=6 dest: 5}, { cond=(AND p3 p0), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p3) p0), acceptance={} source=6 dest: 10}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=7 dest: 0}, { cond=(AND (NOT p1) p3 (NOT p2)), acceptance={} source=7 dest: 1}, { cond=(AND (NOT p1) p3 p2), acceptance={} source=7 dest: 5}, { cond=(AND p1 p3 (NOT p2)), acceptance={} source=7 dest: 7}, { cond=(AND p1 p3 p2), acceptance={} source=7 dest: 8}, { cond=(AND p1 (NOT p3)), acceptance={} source=7 dest: 12}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=8 dest: 0}, { cond=(AND (NOT p1) p3), acceptance={} source=8 dest: 5}, { cond=(AND p1 p3), acceptance={} source=8 dest: 8}, { cond=(AND p1 (NOT p3)), acceptance={} source=8 dest: 12}], [{ cond=(AND (NOT p1) (NOT p3) (NOT p0)), acceptance={} source=9 dest: 0}, { cond=(AND (NOT p1) p3 (NOT p0)), acceptance={} source=9 dest: 5}, { cond=(AND (NOT p1) p3 p0), acceptance={} source=9 dest: 6}, { cond=(AND p1 p3 (NOT p0)), acceptance={} source=9 dest: 8}, { cond=(AND p1 p3 p0), acceptance={} source=9 dest: 9}, { cond=(AND (NOT p1) (NOT p3) p0), acceptance={} source=9 dest: 10}, { cond=(AND p1 (NOT p3) p0), acceptance={} source=9 dest: 11}, { cond=(AND p1 (NOT p3) (NOT p0)), acceptance={} source=9 dest: 12}], [{ cond=(NOT p0), acceptance={} source=10 dest: 0}, { cond=p0, acceptance={} source=10 dest: 10}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=11 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=11 dest: 10}, { cond=(AND p1 p0), acceptance={} source=11 dest: 11}, { cond=(AND p1 (NOT p0)), acceptance={} source=11 dest: 12}], [{ cond=(NOT p1), acceptance={} source=12 dest: 0}, { cond=p1, acceptance={} source=12 dest: 12}]], initial=2, aps=[p3:(EQ s3413 1), p2:(AND (EQ s1788 1) (EQ s1856 1)), p1:(OR (EQ s3406 0) (EQ s3451 0)), p0:(EQ s3215 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 5470 steps with 0 reset in 94 ms.
FORMULA ShieldIIPs-PT-100B-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-100B-LTLFireability-10 finished in 10891 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 5314 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5314/5314 places, 5214/5214 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 500 transitions
Trivial Post-agglo rules discarded 500 transitions
Performed 500 trivial Post agglomeration. Transition count delta: 500
Iterating post reduction 0 with 500 rules applied. Total rules applied 500 place count 5313 transition count 4713
Reduce places removed 500 places and 0 transitions.
Iterating post reduction 1 with 500 rules applied. Total rules applied 1000 place count 4813 transition count 4713
Performed 500 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 500 Pre rules applied. Total rules applied 1000 place count 4813 transition count 4213
Deduced a syphon composed of 500 places in 19 ms
Reduce places removed 500 places and 0 transitions.
Iterating global reduction 2 with 1000 rules applied. Total rules applied 2000 place count 4313 transition count 4213
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 2012 place count 4301 transition count 4201
Iterating global reduction 2 with 12 rules applied. Total rules applied 2024 place count 4301 transition count 4201
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 2024 place count 4301 transition count 4197
Deduced a syphon composed of 4 places in 17 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 2032 place count 4297 transition count 4197
Performed 1794 Post agglomeration using F-continuation condition.Transition count delta: 1794
Deduced a syphon composed of 1794 places in 12 ms
Reduce places removed 1794 places and 0 transitions.
Iterating global reduction 2 with 3588 rules applied. Total rules applied 5620 place count 2503 transition count 2403
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 5622 place count 2501 transition count 2401
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5623 place count 2500 transition count 2401
Applied a total of 5623 rules in 1263 ms. Remains 2500 /5314 variables (removed 2814) and now considering 2401/5214 (removed 2813) transitions.
// Phase 1: matrix 2401 rows 2500 cols
[2023-03-18 23:44:51] [INFO ] Computed 900 place invariants in 9 ms
[2023-03-18 23:44:53] [INFO ] Implicit Places using invariants in 2357 ms returned []
[2023-03-18 23:44:53] [INFO ] Invariant cache hit.
[2023-03-18 23:44:58] [INFO ] Implicit Places using invariants and state equation in 4663 ms returned []
Implicit Place search using SMT with State Equation took 7036 ms to find 0 implicit places.
[2023-03-18 23:44:59] [INFO ] Redundant transitions in 540 ms returned [2400]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 2400 rows 2500 cols
[2023-03-18 23:44:59] [INFO ] Computed 900 place invariants in 4 ms
[2023-03-18 23:45:00] [INFO ] Dead Transitions using invariants and state equation in 1568 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2500/5314 places, 2400/5214 transitions.
Applied a total of 0 rules in 77 ms. Remains 2500 /2500 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 10525 ms. Remains : 2500/5314 places, 2400/5214 transitions.
Stuttering acceptance computed with spot in 120 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-100B-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:(AND (EQ s1328 1) (EQ s1344 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 45 reset in 1524 ms.
Product exploration explored 100000 steps with 45 reset in 1885 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 273 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 170 ms :[(NOT p0), (NOT p0)]
Finished random walk after 2206 steps, including 0 resets, run visited all 1 properties in 42 ms. (steps per millisecond=52 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 267 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 114 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 118 ms :[(NOT p0), (NOT p0)]
[2023-03-18 23:45:05] [INFO ] Invariant cache hit.
[2023-03-18 23:45:10] [INFO ] [Real]Absence check using 900 positive place invariants in 1115 ms returned sat
[2023-03-18 23:45:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 23:45:20] [INFO ] [Real]Absence check using state equation in 10291 ms returned unknown
Could not prove EG (NOT p0)
Support contains 2 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 2400/2400 transitions.
Applied a total of 0 rules in 85 ms. Remains 2500 /2500 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
[2023-03-18 23:45:20] [INFO ] Invariant cache hit.
[2023-03-18 23:45:22] [INFO ] Implicit Places using invariants in 2067 ms returned []
[2023-03-18 23:45:22] [INFO ] Invariant cache hit.
[2023-03-18 23:45:27] [INFO ] Implicit Places using invariants and state equation in 4339 ms returned []
Implicit Place search using SMT with State Equation took 6421 ms to find 0 implicit places.
[2023-03-18 23:45:27] [INFO ] Redundant transitions in 472 ms returned []
[2023-03-18 23:45:27] [INFO ] Invariant cache hit.
[2023-03-18 23:45:29] [INFO ] Dead Transitions using invariants and state equation in 1492 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8476 ms. Remains : 2500/2500 places, 2400/2400 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 132 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Finished random walk after 2251 steps, including 0 resets, run visited all 1 properties in 45 ms. (steps per millisecond=50 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 212 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 127 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (NOT p0)]
[2023-03-18 23:45:29] [INFO ] Invariant cache hit.
[2023-03-18 23:45:33] [INFO ] [Real]Absence check using 900 positive place invariants in 872 ms returned sat
[2023-03-18 23:45:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 23:45:44] [INFO ] [Real]Absence check using state equation in 11107 ms returned unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 45 reset in 1514 ms.
Product exploration explored 100000 steps with 45 reset in 1906 ms.
Built C files in :
/tmp/ltsmin5416960015468369451
[2023-03-18 23:45:48] [INFO ] Too many transitions (2400) to apply POR reductions. Disabling POR matrices.
[2023-03-18 23:45:48] [INFO ] Built C files in 62ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5416960015468369451
Running compilation step : cd /tmp/ltsmin5416960015468369451;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin5416960015468369451;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin5416960015468369451;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 2 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 2400/2400 transitions.
Applied a total of 0 rules in 102 ms. Remains 2500 /2500 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
[2023-03-18 23:45:51] [INFO ] Invariant cache hit.
[2023-03-18 23:45:53] [INFO ] Implicit Places using invariants in 1571 ms returned []
[2023-03-18 23:45:53] [INFO ] Invariant cache hit.
[2023-03-18 23:45:56] [INFO ] Implicit Places using invariants and state equation in 3526 ms returned []
Implicit Place search using SMT with State Equation took 5101 ms to find 0 implicit places.
[2023-03-18 23:45:57] [INFO ] Redundant transitions in 464 ms returned []
[2023-03-18 23:45:57] [INFO ] Invariant cache hit.
[2023-03-18 23:45:58] [INFO ] Dead Transitions using invariants and state equation in 1698 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7392 ms. Remains : 2500/2500 places, 2400/2400 transitions.
Built C files in :
/tmp/ltsmin7232290113653779501
[2023-03-18 23:45:58] [INFO ] Too many transitions (2400) to apply POR reductions. Disabling POR matrices.
[2023-03-18 23:45:59] [INFO ] Built C files in 39ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7232290113653779501
Running compilation step : cd /tmp/ltsmin7232290113653779501;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin7232290113653779501;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin7232290113653779501;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-18 23:46:02] [INFO ] Flatten gal took : 93 ms
[2023-03-18 23:46:02] [INFO ] Flatten gal took : 92 ms
[2023-03-18 23:46:02] [INFO ] Time to serialize gal into /tmp/LTL16485124715829049152.gal : 27 ms
[2023-03-18 23:46:02] [INFO ] Time to serialize properties into /tmp/LTL12082214671759838608.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16485124715829049152.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4033257944867434037.hoa' '-atoms' '/tmp/LTL12082214671759838608.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL12082214671759838608.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4033257944867434037.hoa
Detected timeout of ITS tools.
[2023-03-18 23:46:18] [INFO ] Flatten gal took : 195 ms
[2023-03-18 23:46:18] [INFO ] Flatten gal took : 154 ms
[2023-03-18 23:46:18] [INFO ] Time to serialize gal into /tmp/LTL17945439982307799261.gal : 33 ms
[2023-03-18 23:46:18] [INFO ] Time to serialize properties into /tmp/LTL7941219998513932268.ltl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17945439982307799261.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7941219998513932268.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F("((p3240==1)&&(p3267==1))"))))
Formula 0 simplified : FG!"((p3240==1)&&(p3267==1))"
Detected timeout of ITS tools.
[2023-03-18 23:46:33] [INFO ] Flatten gal took : 109 ms
[2023-03-18 23:46:33] [INFO ] Applying decomposition
[2023-03-18 23:46:33] [INFO ] Flatten gal took : 87 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph10933975699304500523.txt' '-o' '/tmp/graph10933975699304500523.bin' '-w' '/tmp/graph10933975699304500523.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph10933975699304500523.bin' '-l' '-1' '-v' '-w' '/tmp/graph10933975699304500523.weights' '-q' '0' '-e' '0.001'
[2023-03-18 23:46:34] [INFO ] Decomposing Gal with order
[2023-03-18 23:46:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 23:46:34] [INFO ] Removed a total of 1595 redundant transitions.
[2023-03-18 23:46:34] [INFO ] Flatten gal took : 247 ms
[2023-03-18 23:46:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 1528 labels/synchronizations in 41 ms.
[2023-03-18 23:46:34] [INFO ] Time to serialize gal into /tmp/LTL15226172456877458108.gal : 25 ms
[2023-03-18 23:46:34] [INFO ] Time to serialize properties into /tmp/LTL118065064675302054.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15226172456877458108.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL118065064675302054.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((G(F("((i24.i0.i2.u478.p3240==1)&&(i24.i0.i2.u484.p3267==1))"))))
Formula 0 simplified : FG!"((i24.i0.i2.u478.p3240==1)&&(i24.i0.i2.u484.p3267==1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12469765003791310088
[2023-03-18 23:46:49] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12469765003791310088
Running compilation step : cd /tmp/ltsmin12469765003791310088;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin12469765003791310088;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin12469765003791310088;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property ShieldIIPs-PT-100B-LTLFireability-11 finished in 122563 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(((p0 U (G(p0)||(p0&&G(p1))))||(F(p2)&&F(p3))))))'
Support contains 2 out of 5314 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5314/5314 places, 5214/5214 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 499 transitions
Trivial Post-agglo rules discarded 499 transitions
Performed 499 trivial Post agglomeration. Transition count delta: 499
Iterating post reduction 0 with 499 rules applied. Total rules applied 499 place count 5313 transition count 4714
Reduce places removed 499 places and 0 transitions.
Iterating post reduction 1 with 499 rules applied. Total rules applied 998 place count 4814 transition count 4714
Performed 500 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 500 Pre rules applied. Total rules applied 998 place count 4814 transition count 4214
Deduced a syphon composed of 500 places in 51 ms
Reduce places removed 500 places and 0 transitions.
Iterating global reduction 2 with 1000 rules applied. Total rules applied 1998 place count 4314 transition count 4214
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 2010 place count 4302 transition count 4202
Iterating global reduction 2 with 12 rules applied. Total rules applied 2022 place count 4302 transition count 4202
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 2022 place count 4302 transition count 4198
Deduced a syphon composed of 4 places in 20 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 2030 place count 4298 transition count 4198
Performed 1792 Post agglomeration using F-continuation condition.Transition count delta: 1792
Deduced a syphon composed of 1792 places in 14 ms
Reduce places removed 1792 places and 0 transitions.
Iterating global reduction 2 with 3584 rules applied. Total rules applied 5614 place count 2506 transition count 2406
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 5616 place count 2504 transition count 2404
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5617 place count 2503 transition count 2404
Applied a total of 5617 rules in 1347 ms. Remains 2503 /5314 variables (removed 2811) and now considering 2404/5214 (removed 2810) transitions.
// Phase 1: matrix 2404 rows 2503 cols
[2023-03-18 23:46:54] [INFO ] Computed 900 place invariants in 3 ms
[2023-03-18 23:46:56] [INFO ] Implicit Places using invariants in 1776 ms returned []
[2023-03-18 23:46:56] [INFO ] Invariant cache hit.
[2023-03-18 23:47:01] [INFO ] Implicit Places using invariants and state equation in 5255 ms returned []
Implicit Place search using SMT with State Equation took 7034 ms to find 0 implicit places.
[2023-03-18 23:47:01] [INFO ] Redundant transitions in 301 ms returned [2403]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 2403 rows 2503 cols
[2023-03-18 23:47:01] [INFO ] Computed 900 place invariants in 4 ms
[2023-03-18 23:47:03] [INFO ] Dead Transitions using invariants and state equation in 2202 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2503/5314 places, 2403/5214 transitions.
Applied a total of 0 rules in 77 ms. Remains 2503 /2503 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 10980 ms. Remains : 2503/5314 places, 2403/5214 transitions.
Stuttering acceptance computed with spot in 202 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p3)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0) (NOT p3))]
Running random walk in product with property : ShieldIIPs-PT-100B-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p2) (NOT p1)) (AND (NOT p2) (NOT p0))), acceptance={} source=0 dest: 1}, { cond=(OR (AND (NOT p3) (NOT p1)) (AND (NOT p3) (NOT p0))), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p3) (NOT p1) p0), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p3) (NOT p0)), acceptance={0, 1} source=2 dest: 2}, { cond=(AND (NOT p3) p1 p0), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0, 1} source=3 dest: 1}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={1} source=3 dest: 3}], [{ cond=(AND (NOT p3) (NOT p1) p0), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p3) (NOT p1) (NOT p0)), acceptance={0, 1} source=4 dest: 2}, { cond=(AND (NOT p3) p1 p0), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p3) p1 (NOT p0)), acceptance={1} source=4 dest: 4}]], initial=0, aps=[p2:(EQ s2230 0), p1:(NEQ s2230 1), p0:(NEQ s349 1), p3:(EQ s349 0)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Product exploration explored 100000 steps with 429 reset in 1550 ms.
Product exploration explored 100000 steps with 315 reset in 1912 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/2503 stabilizing places and 2/2403 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/4 atomic propositions.
Knowledge obtained : [(AND p2 p1 p0 p3), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p3) (NOT p1) p0))), (X (NOT (AND (NOT p2) p1 p0))), (X (NOT (AND (NOT p3) p1 p0))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (NOT (AND (NOT p3) p1 p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p2) (NOT p1) p0)), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (AND (NOT p3) (NOT p0))), (X (NOT (AND (NOT p3) (NOT p0)))), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (AND (NOT p3) p1 (NOT p0)))), (X (X (NOT (AND (NOT p3) p1 (NOT p0))))), (X (X (AND (NOT p3) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p3) (NOT p1) (NOT p0))))), (X (X (AND (NOT p2) (NOT p1) p0))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND (NOT p3) (NOT p0)))), (X (X (NOT (AND (NOT p3) (NOT p0)))))]
Knowledge based reduction with 11 factoid took 972 ms. Reduced automaton from 5 states, 17 edges and 4 AP (stutter insensitive) to 5 states, 17 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 312 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 344 ms. (steps per millisecond=29 ) properties (out of 12) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-18 23:47:09] [INFO ] Invariant cache hit.
[2023-03-18 23:47:10] [INFO ] [Real]Absence check using 900 positive place invariants in 241 ms returned sat
[2023-03-18 23:47:10] [INFO ] After 892ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-18 23:47:11] [INFO ] [Nat]Absence check using 900 positive place invariants in 273 ms returned sat
[2023-03-18 23:47:11] [INFO ] After 622ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :0
Fused 4 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 4 invariant AP formulas.
Knowledge obtained : [(AND p2 p1 p0 p3), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p3) (NOT p1) p0))), (X (NOT (AND (NOT p2) p1 p0))), (X (NOT (AND (NOT p3) p1 p0))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (NOT (AND (NOT p3) p1 p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND p0 p1 (NOT p3)))), (G (NOT (AND (NOT p0) p1 (NOT p2)))), (G (NOT (AND p0 p1 (NOT p2)))), (G (NOT (AND p0 (NOT p1) (NOT p3))))]
False Knowledge obtained : [(X (AND (NOT p2) (NOT p1) p0)), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (AND (NOT p3) (NOT p0))), (X (NOT (AND (NOT p3) (NOT p0)))), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (AND (NOT p3) p1 (NOT p0)))), (X (X (NOT (AND (NOT p3) p1 (NOT p0))))), (X (X (AND (NOT p3) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p3) (NOT p1) (NOT p0))))), (X (X (AND (NOT p2) (NOT p1) p0))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND (NOT p3) (NOT p0)))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND (NOT p0) (NOT p2))), (F (AND (NOT p0) (NOT p3))), (F (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))), (F (AND p0 (NOT p1) (NOT p2))), (F (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3)))), (F (AND (NOT p0) p1 (NOT p3))), (F (AND (NOT p0) (NOT p1) (NOT p3)))]
Knowledge based reduction with 15 factoid took 1535 ms. Reduced automaton from 5 states, 17 edges and 4 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 143 ms :[(OR (NOT p3) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (NOT p3)]
Stuttering acceptance computed with spot in 176 ms :[(OR (NOT p3) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (NOT p3)]
Support contains 2 out of 2503 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Applied a total of 0 rules in 78 ms. Remains 2503 /2503 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
[2023-03-18 23:47:13] [INFO ] Invariant cache hit.
[2023-03-18 23:47:14] [INFO ] Implicit Places using invariants in 1489 ms returned []
[2023-03-18 23:47:14] [INFO ] Invariant cache hit.
[2023-03-18 23:47:18] [INFO ] Implicit Places using invariants and state equation in 3869 ms returned []
Implicit Place search using SMT with State Equation took 5370 ms to find 0 implicit places.
[2023-03-18 23:47:19] [INFO ] Redundant transitions in 378 ms returned []
[2023-03-18 23:47:19] [INFO ] Invariant cache hit.
[2023-03-18 23:47:20] [INFO ] Dead Transitions using invariants and state equation in 1475 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7313 ms. Remains : 2503/2503 places, 2403/2403 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/2503 stabilizing places and 2/2403 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 p2 p3), (X (NOT (AND (NOT p0) (NOT p2)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (AND p0 p3 (NOT p2))), (X (NOT (AND p0 p3 (NOT p2)))), (X (NOT p3)), (X p3), (X (X (AND p0 p3 (NOT p2)))), (X (X (NOT (AND p0 p3 (NOT p2))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p3))), (X (X p3))]
Knowledge based reduction with 3 factoid took 468 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 120 ms :[(OR (NOT p3) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (NOT p3)]
Finished random walk after 3336 steps, including 1 resets, run visited all 4 properties in 66 ms. (steps per millisecond=50 )
Knowledge obtained : [(AND p0 p2 p3), (X (NOT (AND (NOT p0) (NOT p2)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (AND p0 p3 (NOT p2))), (X (NOT (AND p0 p3 (NOT p2)))), (X (NOT p3)), (X p3), (X (X (AND p0 p3 (NOT p2)))), (X (X (NOT (AND p0 p3 (NOT p2))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p3))), (X (X p3)), (F (AND (NOT p2) (NOT p0))), (F (OR (AND p3 (NOT p2)) (AND (NOT p2) (NOT p0)))), (F (AND p3 (NOT p2) p0)), (F (NOT p3))]
Knowledge based reduction with 3 factoid took 477 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 157 ms :[(OR (NOT p3) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (NOT p3)]
Stuttering acceptance computed with spot in 160 ms :[(OR (NOT p3) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (NOT p3)]
Stuttering acceptance computed with spot in 124 ms :[(OR (NOT p3) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (NOT p3)]
Product exploration explored 100000 steps with 458 reset in 1538 ms.
Product exploration explored 100000 steps with 318 reset in 2045 ms.
Built C files in :
/tmp/ltsmin9718441513811036805
[2023-03-18 23:47:25] [INFO ] Too many transitions (2403) to apply POR reductions. Disabling POR matrices.
[2023-03-18 23:47:25] [INFO ] Built C files in 56ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9718441513811036805
Running compilation step : cd /tmp/ltsmin9718441513811036805;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin9718441513811036805;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin9718441513811036805;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 2 out of 2503 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Applied a total of 0 rules in 77 ms. Remains 2503 /2503 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
[2023-03-18 23:47:28] [INFO ] Invariant cache hit.
[2023-03-18 23:47:30] [INFO ] Implicit Places using invariants in 1410 ms returned []
[2023-03-18 23:47:30] [INFO ] Invariant cache hit.
[2023-03-18 23:47:34] [INFO ] Implicit Places using invariants and state equation in 3619 ms returned []
Implicit Place search using SMT with State Equation took 5045 ms to find 0 implicit places.
[2023-03-18 23:47:34] [INFO ] Redundant transitions in 480 ms returned []
[2023-03-18 23:47:34] [INFO ] Invariant cache hit.
[2023-03-18 23:47:35] [INFO ] Dead Transitions using invariants and state equation in 1415 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7045 ms. Remains : 2503/2503 places, 2403/2403 transitions.
Built C files in :
/tmp/ltsmin13079206234867855076
[2023-03-18 23:47:35] [INFO ] Too many transitions (2403) to apply POR reductions. Disabling POR matrices.
[2023-03-18 23:47:35] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13079206234867855076
Running compilation step : cd /tmp/ltsmin13079206234867855076;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin13079206234867855076;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin13079206234867855076;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-18 23:47:39] [INFO ] Flatten gal took : 86 ms
[2023-03-18 23:47:39] [INFO ] Flatten gal took : 89 ms
[2023-03-18 23:47:39] [INFO ] Time to serialize gal into /tmp/LTL5487841224129621285.gal : 17 ms
[2023-03-18 23:47:39] [INFO ] Time to serialize properties into /tmp/LTL17972175766663229745.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5487841224129621285.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7907973207827377322.hoa' '-atoms' '/tmp/LTL17972175766663229745.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL17972175766663229745.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7907973207827377322.hoa
Detected timeout of ITS tools.
[2023-03-18 23:47:54] [INFO ] Flatten gal took : 79 ms
[2023-03-18 23:47:54] [INFO ] Flatten gal took : 80 ms
[2023-03-18 23:47:54] [INFO ] Time to serialize gal into /tmp/LTL9282949672009710148.gal : 12 ms
[2023-03-18 23:47:54] [INFO ] Time to serialize properties into /tmp/LTL15458447812819034983.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9282949672009710148.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15458447812819034983.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F((("(p916!=1)")U((G("(p916!=1)"))||(("(p916!=1)")&&(G("(p5361!=1)")))))||((F("(p5361==0)"))&&(F("(p916==0)")))))))
Formula 0 simplified : FG((G!"(p5361==0)" | G!"(p916==0)") & (F!"(p5361!=1)" U !"(p916!=1)"))
Detected timeout of ITS tools.
[2023-03-18 23:48:09] [INFO ] Flatten gal took : 84 ms
[2023-03-18 23:48:09] [INFO ] Applying decomposition
[2023-03-18 23:48:09] [INFO ] Flatten gal took : 82 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph12458719454374017258.txt' '-o' '/tmp/graph12458719454374017258.bin' '-w' '/tmp/graph12458719454374017258.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph12458719454374017258.bin' '-l' '-1' '-v' '-w' '/tmp/graph12458719454374017258.weights' '-q' '0' '-e' '0.001'
[2023-03-18 23:48:10] [INFO ] Decomposing Gal with order
[2023-03-18 23:48:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 23:48:10] [INFO ] Removed a total of 1597 redundant transitions.
[2023-03-18 23:48:10] [INFO ] Flatten gal took : 128 ms
[2023-03-18 23:48:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 1540 labels/synchronizations in 31 ms.
[2023-03-18 23:48:10] [INFO ] Time to serialize gal into /tmp/LTL4186713981992470157.gal : 21 ms
[2023-03-18 23:48:10] [INFO ] Time to serialize properties into /tmp/LTL14285770731720577298.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4186713981992470157.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14285770731720577298.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(F((("(i6.u125.p916!=1)")U((G("(i6.u125.p916!=1)"))||(("(i6.u125.p916!=1)")&&(G("(i42.i1.i0.u803.p5361!=1)")))))||((F("(i42.i1.i0....203
Formula 0 simplified : FG((G!"(i42.i1.i0.u803.p5361==0)" | G!"(i6.u125.p916==0)") & (F!"(i42.i1.i0.u803.p5361!=1)" U !"(i6.u125.p916!=1)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12312843477138985974
[2023-03-18 23:48:25] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12312843477138985974
Running compilation step : cd /tmp/ltsmin12312843477138985974;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin12312843477138985974;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin12312843477138985974;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property ShieldIIPs-PT-100B-LTLFireability-12 finished in 95849 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U G((p1||X((p2||G(p3)))))))'
Support contains 4 out of 5314 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5314/5314 places, 5214/5214 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 5303 transition count 5203
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 5303 transition count 5203
Applied a total of 22 rules in 985 ms. Remains 5303 /5314 variables (removed 11) and now considering 5203/5214 (removed 11) transitions.
// Phase 1: matrix 5203 rows 5303 cols
[2023-03-18 23:48:29] [INFO ] Computed 901 place invariants in 17 ms
[2023-03-18 23:48:32] [INFO ] Implicit Places using invariants in 2371 ms returned []
[2023-03-18 23:48:32] [INFO ] Invariant cache hit.
[2023-03-18 23:48:33] [INFO ] Implicit Places using invariants and state equation in 1814 ms returned []
Implicit Place search using SMT with State Equation took 4194 ms to find 0 implicit places.
[2023-03-18 23:48:33] [INFO ] Invariant cache hit.
[2023-03-18 23:48:37] [INFO ] Dead Transitions using invariants and state equation in 3989 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5303/5314 places, 5203/5214 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9171 ms. Remains : 5303/5314 places, 5203/5214 transitions.
Stuttering acceptance computed with spot in 300 ms :[(AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), true, (NOT p3), (AND (NOT p1) (NOT p2) (NOT p3))]
Running random walk in product with property : ShieldIIPs-PT-100B-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=0 dest: 3}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p2) p3), acceptance={} source=1 dest: 5}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND p0 (NOT p2) (NOT p3)), acceptance={1} source=3 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) p0 (NOT p2) p3), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p1) p0 (NOT p2) (NOT p3)), acceptance={0, 1} source=3 dest: 3}, { cond=(AND p0 (NOT p2) p3), acceptance={} source=3 dest: 6}], [{ cond=true, acceptance={0, 1} source=4 dest: 4}], [{ cond=(NOT p3), acceptance={} source=5 dest: 4}, { cond=p3, acceptance={} source=5 dest: 5}], [{ cond=(AND p0 (NOT p3)), acceptance={1} source=6 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=6 dest: 1}, { cond=(NOT p0), acceptance={} source=6 dest: 2}, { cond=(AND (NOT p1) p0 p3), acceptance={0} source=6 dest: 3}, { cond=(AND (NOT p1) p0 (NOT p3)), acceptance={0, 1} source=6 dest: 3}, { cond=(AND p0 p3), acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(EQ s2239 1), p1:(EQ s101 1), p2:(EQ s1123 1), p3:(EQ s3946 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ShieldIIPs-PT-100B-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-100B-LTLFireability-13 finished in 9551 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U X(p1)))'
Support contains 5 out of 5314 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5314/5314 places, 5214/5214 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 5303 transition count 5203
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 5303 transition count 5203
Applied a total of 22 rules in 915 ms. Remains 5303 /5314 variables (removed 11) and now considering 5203/5214 (removed 11) transitions.
// Phase 1: matrix 5203 rows 5303 cols
[2023-03-18 23:48:39] [INFO ] Computed 901 place invariants in 44 ms
[2023-03-18 23:48:41] [INFO ] Implicit Places using invariants in 1951 ms returned []
[2023-03-18 23:48:41] [INFO ] Invariant cache hit.
[2023-03-18 23:48:42] [INFO ] Implicit Places using invariants and state equation in 1791 ms returned []
Implicit Place search using SMT with State Equation took 3744 ms to find 0 implicit places.
[2023-03-18 23:48:42] [INFO ] Invariant cache hit.
[2023-03-18 23:48:46] [INFO ] Dead Transitions using invariants and state equation in 3982 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5303/5314 places, 5203/5214 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8670 ms. Remains : 5303/5314 places, 5203/5214 transitions.
Stuttering acceptance computed with spot in 222 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-100B-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s464 1), p1:(OR (EQ s2576 1) (AND (EQ s4183 1) (EQ s4199 1) (EQ s4208 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldIIPs-PT-100B-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-100B-LTLFireability-14 finished in 8934 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||G(p1)))'
Support contains 2 out of 5314 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5314/5314 places, 5214/5214 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 499 transitions
Trivial Post-agglo rules discarded 499 transitions
Performed 499 trivial Post agglomeration. Transition count delta: 499
Iterating post reduction 0 with 499 rules applied. Total rules applied 499 place count 5313 transition count 4714
Reduce places removed 499 places and 0 transitions.
Iterating post reduction 1 with 499 rules applied. Total rules applied 998 place count 4814 transition count 4714
Performed 501 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 501 Pre rules applied. Total rules applied 998 place count 4814 transition count 4213
Deduced a syphon composed of 501 places in 19 ms
Reduce places removed 501 places and 0 transitions.
Iterating global reduction 2 with 1002 rules applied. Total rules applied 2000 place count 4313 transition count 4213
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 2010 place count 4303 transition count 4203
Iterating global reduction 2 with 10 rules applied. Total rules applied 2020 place count 4303 transition count 4203
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2020 place count 4303 transition count 4201
Deduced a syphon composed of 2 places in 17 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 2024 place count 4301 transition count 4201
Performed 1795 Post agglomeration using F-continuation condition.Transition count delta: 1795
Deduced a syphon composed of 1795 places in 12 ms
Reduce places removed 1795 places and 0 transitions.
Iterating global reduction 2 with 3590 rules applied. Total rules applied 5614 place count 2506 transition count 2406
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 5616 place count 2504 transition count 2404
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5617 place count 2503 transition count 2404
Applied a total of 5617 rules in 1227 ms. Remains 2503 /5314 variables (removed 2811) and now considering 2404/5214 (removed 2810) transitions.
// Phase 1: matrix 2404 rows 2503 cols
[2023-03-18 23:48:48] [INFO ] Computed 900 place invariants in 9 ms
[2023-03-18 23:48:50] [INFO ] Implicit Places using invariants in 1616 ms returned []
[2023-03-18 23:48:50] [INFO ] Invariant cache hit.
[2023-03-18 23:48:52] [INFO ] Implicit Places using invariants and state equation in 1951 ms returned []
Implicit Place search using SMT with State Equation took 3569 ms to find 0 implicit places.
[2023-03-18 23:48:52] [INFO ] Redundant transitions in 437 ms returned [2403]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 2403 rows 2503 cols
[2023-03-18 23:48:52] [INFO ] Computed 900 place invariants in 9 ms
[2023-03-18 23:48:53] [INFO ] Dead Transitions using invariants and state equation in 1396 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2503/5314 places, 2403/5214 transitions.
Applied a total of 0 rules in 78 ms. Remains 2503 /2503 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 6716 ms. Remains : 2503/5314 places, 2403/5214 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPs-PT-100B-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(EQ s1693 1), p1:(EQ s2489 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 27310 reset in 1832 ms.
Product exploration explored 100000 steps with 27291 reset in 2170 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/2503 stabilizing places and 2/2403 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 (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) 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 (NOT p0)), (X p0), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 4 factoid took 430 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 140 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=0 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) 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 (NOT p0)), (X p0), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 4 factoid took 687 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 57 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
[2023-03-18 23:48:59] [INFO ] Invariant cache hit.
[2023-03-18 23:49:02] [INFO ] [Real]Absence check using 900 positive place invariants in 852 ms returned sat
[2023-03-18 23:49:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 23:49:14] [INFO ] [Real]Absence check using state equation in 11711 ms returned unknown
Could not prove EG (NOT p0)
Support contains 1 out of 2503 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 : 2503/2503 places, 2403/2403 transitions.
Applied a total of 0 rules in 121 ms. Remains 2503 /2503 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
[2023-03-18 23:49:14] [INFO ] Invariant cache hit.
[2023-03-18 23:49:19] [INFO ] Implicit Places using invariants in 4375 ms returned []
[2023-03-18 23:49:19] [INFO ] Invariant cache hit.
[2023-03-18 23:49:23] [INFO ] Implicit Places using invariants and state equation in 4163 ms returned []
Implicit Place search using SMT with State Equation took 8540 ms to find 0 implicit places.
[2023-03-18 23:49:23] [INFO ] Redundant transitions in 679 ms returned []
[2023-03-18 23:49:23] [INFO ] Invariant cache hit.
[2023-03-18 23:49:25] [INFO ] Dead Transitions using invariants and state equation in 1516 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10889 ms. Remains : 2503/2503 places, 2403/2403 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/2503 stabilizing places and 2/2403 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 129 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=0 )
Knowledge obtained : [(NOT p0), (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 306 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
[2023-03-18 23:49:26] [INFO ] Invariant cache hit.
[2023-03-18 23:49:29] [INFO ] [Real]Absence check using 900 positive place invariants in 941 ms returned sat
[2023-03-18 23:49:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 23:49:41] [INFO ] [Real]Absence check using state equation in 11390 ms returned unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 56 ms :[(NOT p0)]
Product exploration explored 100000 steps with 27154 reset in 1841 ms.
Product exploration explored 100000 steps with 27327 reset in 2128 ms.
Built C files in :
/tmp/ltsmin4020151150750286203
[2023-03-18 23:49:45] [INFO ] Too many transitions (2403) to apply POR reductions. Disabling POR matrices.
[2023-03-18 23:49:45] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4020151150750286203
Running compilation step : cd /tmp/ltsmin4020151150750286203;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin4020151150750286203;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin4020151150750286203;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 1 out of 2503 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 14 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 2501 transition count 2401
Applied a total of 4 rules in 213 ms. Remains 2501 /2503 variables (removed 2) and now considering 2401/2403 (removed 2) transitions.
// Phase 1: matrix 2401 rows 2501 cols
[2023-03-18 23:49:48] [INFO ] Computed 900 place invariants in 10 ms
[2023-03-18 23:49:50] [INFO ] Implicit Places using invariants in 1988 ms returned []
[2023-03-18 23:49:50] [INFO ] Invariant cache hit.
[2023-03-18 23:49:54] [INFO ] Implicit Places using invariants and state equation in 4054 ms returned []
Implicit Place search using SMT with State Equation took 6045 ms to find 0 implicit places.
[2023-03-18 23:49:54] [INFO ] Redundant transitions in 291 ms returned []
[2023-03-18 23:49:54] [INFO ] Invariant cache hit.
[2023-03-18 23:49:56] [INFO ] Dead Transitions using invariants and state equation in 1385 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2501/2503 places, 2401/2403 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7954 ms. Remains : 2501/2503 places, 2401/2403 transitions.
Built C files in :
/tmp/ltsmin568683484970651245
[2023-03-18 23:49:56] [INFO ] Too many transitions (2401) to apply POR reductions. Disabling POR matrices.
[2023-03-18 23:49:56] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin568683484970651245
Running compilation step : cd /tmp/ltsmin568683484970651245;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin568683484970651245;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin568683484970651245;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-18 23:49:59] [INFO ] Flatten gal took : 78 ms
[2023-03-18 23:49:59] [INFO ] Flatten gal took : 79 ms
[2023-03-18 23:49:59] [INFO ] Time to serialize gal into /tmp/LTL3353425890457384699.gal : 12 ms
[2023-03-18 23:49:59] [INFO ] Time to serialize properties into /tmp/LTL16216583119002331350.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3353425890457384699.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6100164405185116096.hoa' '-atoms' '/tmp/LTL16216583119002331350.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL16216583119002331350.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6100164405185116096.hoa
Detected timeout of ITS tools.
[2023-03-18 23:50:14] [INFO ] Flatten gal took : 77 ms
[2023-03-18 23:50:14] [INFO ] Flatten gal took : 78 ms
[2023-03-18 23:50:14] [INFO ] Time to serialize gal into /tmp/LTL414255794399097481.gal : 11 ms
[2023-03-18 23:50:14] [INFO ] Time to serialize properties into /tmp/LTL2335914637771279066.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL414255794399097481.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2335914637771279066.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...274
Read 1 LTL properties
Checking formula 0 : !(((F("(p4089==1)"))||(G("(p5970==1)"))))
Formula 0 simplified : G!"(p4089==1)" & F!"(p5970==1)"
Detected timeout of ITS tools.
[2023-03-18 23:50:30] [INFO ] Flatten gal took : 113 ms
[2023-03-18 23:50:30] [INFO ] Applying decomposition
[2023-03-18 23:50:30] [INFO ] Flatten gal took : 78 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph13272564326271702008.txt' '-o' '/tmp/graph13272564326271702008.bin' '-w' '/tmp/graph13272564326271702008.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph13272564326271702008.bin' '-l' '-1' '-v' '-w' '/tmp/graph13272564326271702008.weights' '-q' '0' '-e' '0.001'
[2023-03-18 23:50:30] [INFO ] Decomposing Gal with order
[2023-03-18 23:50:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 23:50:30] [INFO ] Removed a total of 1597 redundant transitions.
[2023-03-18 23:50:30] [INFO ] Flatten gal took : 130 ms
[2023-03-18 23:50:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 1526 labels/synchronizations in 30 ms.
[2023-03-18 23:50:30] [INFO ] Time to serialize gal into /tmp/LTL15178376949997000688.gal : 21 ms
[2023-03-18 23:50:30] [INFO ] Time to serialize properties into /tmp/LTL14101888481638044898.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15178376949997000688.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14101888481638044898.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !(((F("(i31.i0.i2.u610.p4089==1)"))||(G("(i43.i1.i1.u897.p5970==1)"))))
Formula 0 simplified : G!"(i31.i0.i2.u610.p4089==1)" & F!"(i43.i1.i1.u897.p5970==1)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7516291234675150048
[2023-03-18 23:50:46] [INFO ] Built C files in 56ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7516291234675150048
Running compilation step : cd /tmp/ltsmin7516291234675150048;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin7516291234675150048;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin7516291234675150048;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property ShieldIIPs-PT-100B-LTLFireability-15 finished in 121815 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(((p0 U (G(p0)||(p0&&G(p1))))||(F(p2)&&F(p3))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||G(p1)))'
[2023-03-18 23:50:49] [INFO ] Flatten gal took : 147 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin14923470616401446901
[2023-03-18 23:50:49] [INFO ] Too many transitions (5214) to apply POR reductions. Disabling POR matrices.
[2023-03-18 23:50:49] [INFO ] Applying decomposition
[2023-03-18 23:50:49] [INFO ] Built C files in 83ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14923470616401446901
Running compilation step : cd /tmp/ltsmin14923470616401446901;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '240' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2023-03-18 23:50:49] [INFO ] Flatten gal took : 133 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph8650931615096538267.txt' '-o' '/tmp/graph8650931615096538267.bin' '-w' '/tmp/graph8650931615096538267.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph8650931615096538267.bin' '-l' '-1' '-v' '-w' '/tmp/graph8650931615096538267.weights' '-q' '0' '-e' '0.001'
[2023-03-18 23:50:50] [INFO ] Decomposing Gal with order
[2023-03-18 23:50:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 23:50:51] [INFO ] Removed a total of 2300 redundant transitions.
[2023-03-18 23:50:51] [INFO ] Flatten gal took : 244 ms
[2023-03-18 23:50:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 13 ms.
[2023-03-18 23:50:51] [INFO ] Time to serialize gal into /tmp/LTLFireability9287824056658684811.gal : 51 ms
[2023-03-18 23:50:51] [INFO ] Time to serialize properties into /tmp/LTLFireability13579932686088810289.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability9287824056658684811.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability13579932686088810289.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 3 LTL properties
Checking formula 0 : !((G(F("((i35.u1083.p3240==1)&&(i35.u1092.p3267==1))"))))
Formula 0 simplified : FG!"((i35.u1083.p3240==1)&&(i35.u1092.p3267==1))"
Compilation finished in 18664 ms.
Running link step : cd /tmp/ltsmin14923470616401446901;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 76 ms.
Running LTSmin : cd /tmp/ltsmin14923470616401446901;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>1200 s) on command cd /tmp/ltsmin14923470616401446901;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin14923470616401446901;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((((LTLAPp1==true) U ([]((LTLAPp1==true))||((LTLAPp1==true)&&[]((LTLAPp2==true)))))||(<>((LTLAPp3==true))&&<>((LTLAPp4==true))))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2023-03-19 00:14:13] [INFO ] Applying decomposition
[2023-03-19 00:14:14] [INFO ] Flatten gal took : 1252 ms
[2023-03-19 00:14:16] [INFO ] Decomposing Gal with order
[2023-03-19 00:14:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 00:14:30] [INFO ] Removed a total of 1600 redundant transitions.
[2023-03-19 00:14:30] [INFO ] Flatten gal took : 587 ms
[2023-03-19 00:14:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 2000 labels/synchronizations in 225 ms.
[2023-03-19 00:14:33] [INFO ] Time to serialize gal into /tmp/LTLFireability5274318759851855494.gal : 137 ms
[2023-03-19 00:14:33] [INFO ] Time to serialize properties into /tmp/LTLFireability15548096721180691183.ltl : 20 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability5274318759851855494.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability15548096721180691183.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 3 LTL properties
Checking formula 0 : !((G(F("((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i...376
Formula 0 simplified : FG!"((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0....370
WARNING : LTSmin timed out (>1200 s) on command cd /tmp/ltsmin14923470616401446901;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((((LTLAPp1==true) U ([]((LTLAPp1==true))||((LTLAPp1==true)&&[]((LTLAPp2==true)))))||(<>((LTLAPp3==true))&&<>((LTLAPp4==true))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin14923470616401446901;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '(<>((LTLAPp5==true))||[]((LTLAPp6==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2023-03-19 00:37:55] [INFO ] Flatten gal took : 1478 ms
[2023-03-19 00:37:56] [INFO ] Input system was already deterministic with 5214 transitions.
[2023-03-19 00:37:57] [INFO ] Transformed 5314 places.
[2023-03-19 00:37:57] [INFO ] Transformed 5214 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2023-03-19 00:38:04] [INFO ] Time to serialize gal into /tmp/LTLFireability12425470523843304455.gal : 55 ms
[2023-03-19 00:38:04] [INFO ] Time to serialize properties into /tmp/LTLFireability4585403072266126005.ltl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability12425470523843304455.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability4585403072266126005.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...343
Read 3 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(F("((p3240==1)&&(p3267==1))"))))
Formula 0 simplified : FG!"((p3240==1)&&(p3267==1))"
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 14510964 kB
After kill :
MemTotal: 16393220 kB
MemFree: 15845112 kB

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldIIPs-PT-100B"
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-5348"
echo " Executing tool itstools"
echo " Input is ShieldIIPs-PT-100B, 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 r389-oct2-167903713200172"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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