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.r393-oct2-167903716700139.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 ltsminxred
Input is ShieldIIPs-PT-040B, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r393-oct2-167903716700139
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 7.3K Feb 25 16:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Feb 25 16:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 25 16:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 25 16:26 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.4K Feb 25 16:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 16:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Feb 25 16:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 97K Feb 25 16:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 25 16:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 25 16:27 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 675K 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-040B-LTLCardinality-00
FORMULA_NAME ShieldIIPs-PT-040B-LTLCardinality-01
FORMULA_NAME ShieldIIPs-PT-040B-LTLCardinality-02
FORMULA_NAME ShieldIIPs-PT-040B-LTLCardinality-03
FORMULA_NAME ShieldIIPs-PT-040B-LTLCardinality-04
FORMULA_NAME ShieldIIPs-PT-040B-LTLCardinality-05
FORMULA_NAME ShieldIIPs-PT-040B-LTLCardinality-06
FORMULA_NAME ShieldIIPs-PT-040B-LTLCardinality-07
FORMULA_NAME ShieldIIPs-PT-040B-LTLCardinality-08
FORMULA_NAME ShieldIIPs-PT-040B-LTLCardinality-09
FORMULA_NAME ShieldIIPs-PT-040B-LTLCardinality-10
FORMULA_NAME ShieldIIPs-PT-040B-LTLCardinality-11
FORMULA_NAME ShieldIIPs-PT-040B-LTLCardinality-12
FORMULA_NAME ShieldIIPs-PT-040B-LTLCardinality-13
FORMULA_NAME ShieldIIPs-PT-040B-LTLCardinality-14
FORMULA_NAME ShieldIIPs-PT-040B-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679428015174

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=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPs-PT-040B
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-21 19:46:57] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-21 19:46:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 19:46:57] [INFO ] Load time of PNML (sax parser for PT used): 143 ms
[2023-03-21 19:46:57] [INFO ] Transformed 2403 places.
[2023-03-21 19:46:57] [INFO ] Transformed 2363 transitions.
[2023-03-21 19:46:57] [INFO ] Found NUPN structural information;
[2023-03-21 19:46:57] [INFO ] Parsed PT model containing 2403 places and 2363 transitions and 7126 arcs in 292 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA ShieldIIPs-PT-040B-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-040B-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-040B-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-040B-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-040B-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-040B-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-040B-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 26 out of 2403 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2403/2403 places, 2363/2363 transitions.
Discarding 274 places :
Symmetric choice reduction at 0 with 274 rule applications. Total rules 274 place count 2129 transition count 2089
Iterating global reduction 0 with 274 rules applied. Total rules applied 548 place count 2129 transition count 2089
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 549 place count 2128 transition count 2088
Iterating global reduction 0 with 1 rules applied. Total rules applied 550 place count 2128 transition count 2088
Applied a total of 550 rules in 716 ms. Remains 2128 /2403 variables (removed 275) and now considering 2088/2363 (removed 275) transitions.
// Phase 1: matrix 2088 rows 2128 cols
[2023-03-21 19:46:58] [INFO ] Computed 361 place invariants in 52 ms
[2023-03-21 19:47:00] [INFO ] Implicit Places using invariants in 1342 ms returned []
[2023-03-21 19:47:00] [INFO ] Invariant cache hit.
[2023-03-21 19:47:02] [INFO ] Implicit Places using invariants and state equation in 2506 ms returned []
Implicit Place search using SMT with State Equation took 3890 ms to find 0 implicit places.
[2023-03-21 19:47:02] [INFO ] Invariant cache hit.
[2023-03-21 19:47:04] [INFO ] Dead Transitions using invariants and state equation in 1437 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2128/2403 places, 2088/2363 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6046 ms. Remains : 2128/2403 places, 2088/2363 transitions.
Support contains 26 out of 2128 places after structural reductions.
[2023-03-21 19:47:04] [INFO ] Flatten gal took : 151 ms
[2023-03-21 19:47:04] [INFO ] Flatten gal took : 98 ms
[2023-03-21 19:47:04] [INFO ] Input system was already deterministic with 2088 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 473 ms. (steps per millisecond=21 ) properties (out of 15) seen :10
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-21 19:47:05] [INFO ] Invariant cache hit.
[2023-03-21 19:47:05] [INFO ] After 389ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-21 19:47:06] [INFO ] [Nat]Absence check using 361 positive place invariants in 139 ms returned sat
[2023-03-21 19:47:07] [INFO ] After 1525ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-21 19:47:08] [INFO ] Deduced a trap composed of 25 places in 481 ms of which 45 ms to minimize.
[2023-03-21 19:47:09] [INFO ] Deduced a trap composed of 25 places in 429 ms of which 2 ms to minimize.
[2023-03-21 19:47:09] [INFO ] Deduced a trap composed of 16 places in 445 ms of which 5 ms to minimize.
[2023-03-21 19:47:10] [INFO ] Deduced a trap composed of 17 places in 503 ms of which 1 ms to minimize.
[2023-03-21 19:47:10] [INFO ] Deduced a trap composed of 23 places in 434 ms of which 2 ms to minimize.
[2023-03-21 19:47:11] [INFO ] Deduced a trap composed of 28 places in 365 ms of which 6 ms to minimize.
[2023-03-21 19:47:11] [INFO ] Deduced a trap composed of 25 places in 414 ms of which 1 ms to minimize.
[2023-03-21 19:47:12] [INFO ] Deduced a trap composed of 28 places in 407 ms of which 1 ms to minimize.
[2023-03-21 19:47:12] [INFO ] Deduced a trap composed of 31 places in 434 ms of which 5 ms to minimize.
[2023-03-21 19:47:12] [INFO ] Deduced a trap composed of 21 places in 409 ms of which 4 ms to minimize.
[2023-03-21 19:47:13] [INFO ] Deduced a trap composed of 29 places in 370 ms of which 1 ms to minimize.
[2023-03-21 19:47:13] [INFO ] Deduced a trap composed of 18 places in 375 ms of which 1 ms to minimize.
[2023-03-21 19:47:14] [INFO ] Deduced a trap composed of 24 places in 407 ms of which 1 ms to minimize.
[2023-03-21 19:47:14] [INFO ] Deduced a trap composed of 33 places in 356 ms of which 1 ms to minimize.
[2023-03-21 19:47:15] [INFO ] Deduced a trap composed of 21 places in 344 ms of which 1 ms to minimize.
[2023-03-21 19:47:15] [INFO ] Deduced a trap composed of 27 places in 336 ms of which 1 ms to minimize.
[2023-03-21 19:47:15] [INFO ] Deduced a trap composed of 27 places in 369 ms of which 1 ms to minimize.
[2023-03-21 19:47:16] [INFO ] Deduced a trap composed of 38 places in 341 ms of which 1 ms to minimize.
[2023-03-21 19:47:16] [INFO ] Deduced a trap composed of 26 places in 426 ms of which 1 ms to minimize.
[2023-03-21 19:47:17] [INFO ] Deduced a trap composed of 33 places in 320 ms of which 1 ms to minimize.
[2023-03-21 19:47:17] [INFO ] Deduced a trap composed of 36 places in 327 ms of which 3 ms to minimize.
[2023-03-21 19:47:17] [INFO ] Deduced a trap composed of 45 places in 292 ms of which 1 ms to minimize.
[2023-03-21 19:47:18] [INFO ] Deduced a trap composed of 39 places in 343 ms of which 1 ms to minimize.
[2023-03-21 19:47:18] [INFO ] Deduced a trap composed of 47 places in 318 ms of which 1 ms to minimize.
[2023-03-21 19:47:19] [INFO ] Deduced a trap composed of 43 places in 304 ms of which 1 ms to minimize.
[2023-03-21 19:47:19] [INFO ] Deduced a trap composed of 37 places in 318 ms of which 1 ms to minimize.
[2023-03-21 19:47:19] [INFO ] Deduced a trap composed of 39 places in 287 ms of which 1 ms to minimize.
[2023-03-21 19:47:20] [INFO ] Deduced a trap composed of 34 places in 295 ms of which 1 ms to minimize.
[2023-03-21 19:47:20] [INFO ] Deduced a trap composed of 30 places in 268 ms of which 1 ms to minimize.
[2023-03-21 19:47:20] [INFO ] Deduced a trap composed of 30 places in 291 ms of which 1 ms to minimize.
[2023-03-21 19:47:21] [INFO ] Deduced a trap composed of 32 places in 283 ms of which 1 ms to minimize.
[2023-03-21 19:47:21] [INFO ] Deduced a trap composed of 35 places in 268 ms of which 1 ms to minimize.
[2023-03-21 19:47:21] [INFO ] Deduced a trap composed of 38 places in 265 ms of which 0 ms to minimize.
[2023-03-21 19:47:22] [INFO ] Deduced a trap composed of 52 places in 259 ms of which 1 ms to minimize.
[2023-03-21 19:47:22] [INFO ] Deduced a trap composed of 42 places in 299 ms of which 1 ms to minimize.
[2023-03-21 19:47:22] [INFO ] Deduced a trap composed of 43 places in 252 ms of which 1 ms to minimize.
[2023-03-21 19:47:23] [INFO ] Deduced a trap composed of 38 places in 253 ms of which 0 ms to minimize.
[2023-03-21 19:47:23] [INFO ] Deduced a trap composed of 45 places in 278 ms of which 1 ms to minimize.
[2023-03-21 19:47:23] [INFO ] Deduced a trap composed of 61 places in 276 ms of which 1 ms to minimize.
[2023-03-21 19:47:24] [INFO ] Deduced a trap composed of 47 places in 275 ms of which 1 ms to minimize.
[2023-03-21 19:47:24] [INFO ] Deduced a trap composed of 24 places in 284 ms of which 0 ms to minimize.
[2023-03-21 19:47:24] [INFO ] Deduced a trap composed of 43 places in 240 ms of which 1 ms to minimize.
[2023-03-21 19:47:25] [INFO ] Deduced a trap composed of 37 places in 244 ms of which 1 ms to minimize.
[2023-03-21 19:47:25] [INFO ] Deduced a trap composed of 38 places in 220 ms of which 1 ms to minimize.
[2023-03-21 19:47:25] [INFO ] Deduced a trap composed of 45 places in 256 ms of which 1 ms to minimize.
[2023-03-21 19:47:26] [INFO ] Deduced a trap composed of 46 places in 262 ms of which 1 ms to minimize.
[2023-03-21 19:47:26] [INFO ] Deduced a trap composed of 53 places in 238 ms of which 1 ms to minimize.
[2023-03-21 19:47:26] [INFO ] Deduced a trap composed of 60 places in 280 ms of which 1 ms to minimize.
[2023-03-21 19:47:27] [INFO ] Deduced a trap composed of 49 places in 207 ms of which 0 ms to minimize.
[2023-03-21 19:47:27] [INFO ] Deduced a trap composed of 66 places in 194 ms of which 0 ms to minimize.
[2023-03-21 19:47:27] [INFO ] Deduced a trap composed of 52 places in 268 ms of which 1 ms to minimize.
[2023-03-21 19:47:27] [INFO ] Deduced a trap composed of 68 places in 207 ms of which 1 ms to minimize.
[2023-03-21 19:47:28] [INFO ] Deduced a trap composed of 48 places in 268 ms of which 0 ms to minimize.
[2023-03-21 19:47:28] [INFO ] Deduced a trap composed of 48 places in 171 ms of which 1 ms to minimize.
[2023-03-21 19:47:28] [INFO ] Deduced a trap composed of 57 places in 160 ms of which 0 ms to minimize.
[2023-03-21 19:47:29] [INFO ] Deduced a trap composed of 63 places in 229 ms of which 9 ms to minimize.
[2023-03-21 19:47:29] [INFO ] Deduced a trap composed of 52 places in 161 ms of which 0 ms to minimize.
[2023-03-21 19:47:29] [INFO ] Deduced a trap composed of 56 places in 165 ms of which 0 ms to minimize.
[2023-03-21 19:47:29] [INFO ] Deduced a trap composed of 56 places in 208 ms of which 0 ms to minimize.
[2023-03-21 19:47:29] [INFO ] Deduced a trap composed of 61 places in 190 ms of which 0 ms to minimize.
[2023-03-21 19:47:30] [INFO ] Deduced a trap composed of 52 places in 189 ms of which 0 ms to minimize.
[2023-03-21 19:47:30] [INFO ] Deduced a trap composed of 51 places in 162 ms of which 0 ms to minimize.
[2023-03-21 19:47:30] [INFO ] Deduced a trap composed of 53 places in 167 ms of which 1 ms to minimize.
[2023-03-21 19:47:30] [INFO ] Deduced a trap composed of 53 places in 136 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java: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-21 19:47:30] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-21 19:47:30] [INFO ] After 25137ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:5
Parikh walk visited 0 properties in 336 ms.
Support contains 10 out of 2128 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2128/2128 places, 2088/2088 transitions.
Drop transitions removed 196 transitions
Trivial Post-agglo rules discarded 196 transitions
Performed 196 trivial Post agglomeration. Transition count delta: 196
Iterating post reduction 0 with 196 rules applied. Total rules applied 196 place count 2128 transition count 1892
Reduce places removed 196 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 197 rules applied. Total rules applied 393 place count 1932 transition count 1891
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 394 place count 1931 transition count 1891
Performed 201 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 201 Pre rules applied. Total rules applied 394 place count 1931 transition count 1690
Deduced a syphon composed of 201 places in 3 ms
Reduce places removed 201 places and 0 transitions.
Iterating global reduction 3 with 402 rules applied. Total rules applied 796 place count 1730 transition count 1690
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 798 place count 1728 transition count 1688
Iterating global reduction 3 with 2 rules applied. Total rules applied 800 place count 1728 transition count 1688
Performed 716 Post agglomeration using F-continuation condition.Transition count delta: 716
Deduced a syphon composed of 716 places in 3 ms
Reduce places removed 716 places and 0 transitions.
Iterating global reduction 3 with 1432 rules applied. Total rules applied 2232 place count 1012 transition count 972
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 275 times.
Drop transitions removed 275 transitions
Iterating global reduction 3 with 275 rules applied. Total rules applied 2507 place count 1012 transition count 972
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 2508 place count 1011 transition count 971
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2509 place count 1010 transition count 971
Applied a total of 2509 rules in 388 ms. Remains 1010 /2128 variables (removed 1118) and now considering 971/2088 (removed 1117) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 388 ms. Remains : 1010/2128 places, 971/2088 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 173 ms. (steps per millisecond=57 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 971 rows 1010 cols
[2023-03-21 19:47:31] [INFO ] Computed 360 place invariants in 59 ms
[2023-03-21 19:47:32] [INFO ] After 132ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-21 19:47:32] [INFO ] [Nat]Absence check using 359 positive place invariants in 182 ms returned sat
[2023-03-21 19:47:32] [INFO ] [Nat]Absence check using 359 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-21 19:47:32] [INFO ] After 564ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-21 19:47:33] [INFO ] Deduced a trap composed of 7 places in 88 ms of which 1 ms to minimize.
[2023-03-21 19:47:33] [INFO ] Deduced a trap composed of 17 places in 84 ms of which 0 ms to minimize.
[2023-03-21 19:47:33] [INFO ] Deduced a trap composed of 14 places in 85 ms of which 0 ms to minimize.
[2023-03-21 19:47:33] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 0 ms to minimize.
[2023-03-21 19:47:33] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 469 ms
[2023-03-21 19:47:33] [INFO ] After 1129ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 87 ms.
[2023-03-21 19:47:33] [INFO ] After 1530ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 69 ms.
Support contains 6 out of 1010 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1010/1010 places, 971/971 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 1010 transition count 969
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 1008 transition count 969
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 1007 transition count 968
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 7 place count 1007 transition count 968
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 8 place count 1006 transition count 967
Applied a total of 8 rules in 125 ms. Remains 1006 /1010 variables (removed 4) and now considering 967/971 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 134 ms. Remains : 1006/1010 places, 967/971 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 158 ms. (steps per millisecond=63 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 967 rows 1006 cols
[2023-03-21 19:47:34] [INFO ] Computed 360 place invariants in 10 ms
[2023-03-21 19:47:34] [INFO ] After 238ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 19:47:34] [INFO ] [Nat]Absence check using 359 positive place invariants in 49 ms returned sat
[2023-03-21 19:47:34] [INFO ] [Nat]Absence check using 359 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-21 19:47:34] [INFO ] After 410ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 19:47:35] [INFO ] Deduced a trap composed of 8 places in 81 ms of which 1 ms to minimize.
[2023-03-21 19:47:35] [INFO ] Deduced a trap composed of 6 places in 39 ms of which 0 ms to minimize.
[2023-03-21 19:47:35] [INFO ] Deduced a trap composed of 5 places in 69 ms of which 1 ms to minimize.
[2023-03-21 19:47:35] [INFO ] Deduced a trap composed of 8 places in 91 ms of which 0 ms to minimize.
[2023-03-21 19:47:35] [INFO ] Deduced a trap composed of 7 places in 51 ms of which 0 ms to minimize.
[2023-03-21 19:47:35] [INFO ] Deduced a trap composed of 5 places in 94 ms of which 1 ms to minimize.
[2023-03-21 19:47:35] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 685 ms
[2023-03-21 19:47:35] [INFO ] After 1147ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 78 ms.
[2023-03-21 19:47:35] [INFO ] After 1390ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 4 out of 1006 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1006/1006 places, 967/967 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1005 transition count 966
Applied a total of 2 rules in 91 ms. Remains 1005 /1006 variables (removed 1) and now considering 966/967 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 91 ms. Remains : 1005/1006 places, 966/967 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 211557 steps, run timeout after 3001 ms. (steps per millisecond=70 ) properties seen :{}
Probabilistic random walk after 211557 steps, saw 184599 distinct states, run finished after 3004 ms. (steps per millisecond=70 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 966 rows 1005 cols
[2023-03-21 19:47:38] [INFO ] Computed 360 place invariants in 12 ms
[2023-03-21 19:47:39] [INFO ] After 129ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 19:47:39] [INFO ] [Nat]Absence check using 359 positive place invariants in 65 ms returned sat
[2023-03-21 19:47:39] [INFO ] [Nat]Absence check using 359 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-21 19:47:39] [INFO ] After 400ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 19:47:39] [INFO ] Deduced a trap composed of 31 places in 120 ms of which 1 ms to minimize.
[2023-03-21 19:47:39] [INFO ] Deduced a trap composed of 6 places in 118 ms of which 1 ms to minimize.
[2023-03-21 19:47:40] [INFO ] Deduced a trap composed of 11 places in 81 ms of which 1 ms to minimize.
[2023-03-21 19:47:40] [INFO ] Deduced a trap composed of 4 places in 98 ms of which 1 ms to minimize.
[2023-03-21 19:47:40] [INFO ] Deduced a trap composed of 25 places in 118 ms of which 1 ms to minimize.
[2023-03-21 19:47:40] [INFO ] Deduced a trap composed of 23 places in 119 ms of which 0 ms to minimize.
[2023-03-21 19:47:40] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 0 ms to minimize.
[2023-03-21 19:47:40] [INFO ] Deduced a trap composed of 10 places in 70 ms of which 0 ms to minimize.
[2023-03-21 19:47:40] [INFO ] Deduced a trap composed of 21 places in 105 ms of which 0 ms to minimize.
[2023-03-21 19:47:40] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 0 ms to minimize.
[2023-03-21 19:47:41] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 0 ms to minimize.
[2023-03-21 19:47:41] [INFO ] Deduced a trap composed of 16 places in 99 ms of which 0 ms to minimize.
[2023-03-21 19:47:41] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 0 ms to minimize.
[2023-03-21 19:47:41] [INFO ] Deduced a trap composed of 20 places in 75 ms of which 0 ms to minimize.
[2023-03-21 19:47:41] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 0 ms to minimize.
[2023-03-21 19:47:41] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 0 ms to minimize.
[2023-03-21 19:47:41] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 1940 ms
[2023-03-21 19:47:41] [INFO ] After 2366ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 27 ms.
[2023-03-21 19:47:41] [INFO ] After 2576ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 8 ms.
Support contains 4 out of 1005 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1005/1005 places, 966/966 transitions.
Applied a total of 0 rules in 34 ms. Remains 1005 /1005 variables (removed 0) and now considering 966/966 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 1005/1005 places, 966/966 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1005/1005 places, 966/966 transitions.
Applied a total of 0 rules in 21 ms. Remains 1005 /1005 variables (removed 0) and now considering 966/966 (removed 0) transitions.
[2023-03-21 19:47:41] [INFO ] Invariant cache hit.
[2023-03-21 19:47:42] [INFO ] Implicit Places using invariants in 730 ms returned []
[2023-03-21 19:47:42] [INFO ] Invariant cache hit.
[2023-03-21 19:47:43] [INFO ] Implicit Places using invariants and state equation in 1534 ms returned []
Implicit Place search using SMT with State Equation took 2267 ms to find 0 implicit places.
[2023-03-21 19:47:44] [INFO ] Redundant transitions in 54 ms returned []
[2023-03-21 19:47:44] [INFO ] Invariant cache hit.
[2023-03-21 19:47:44] [INFO ] Dead Transitions using invariants and state equation in 439 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2789 ms. Remains : 1005/1005 places, 966/966 transitions.
Applied a total of 0 rules in 19 ms. Remains 1005 /1005 variables (removed 0) and now considering 966/966 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-21 19:47:44] [INFO ] Invariant cache hit.
[2023-03-21 19:47:44] [INFO ] After 95ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 19:47:44] [INFO ] [Nat]Absence check using 359 positive place invariants in 43 ms returned sat
[2023-03-21 19:47:44] [INFO ] [Nat]Absence check using 359 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-21 19:47:45] [INFO ] After 341ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 19:47:45] [INFO ] Deduced a trap composed of 11 places in 95 ms of which 0 ms to minimize.
[2023-03-21 19:47:45] [INFO ] Deduced a trap composed of 4 places in 110 ms of which 1 ms to minimize.
[2023-03-21 19:47:45] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 1 ms to minimize.
[2023-03-21 19:47:45] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 0 ms to minimize.
[2023-03-21 19:47:45] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 0 ms to minimize.
[2023-03-21 19:47:45] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 0 ms to minimize.
[2023-03-21 19:47:45] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 610 ms
[2023-03-21 19:47:45] [INFO ] After 985ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 26 ms.
[2023-03-21 19:47:45] [INFO ] After 1161ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
FORMULA ShieldIIPs-PT-040B-LTLCardinality-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 482 stabilizing places and 482 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' '!(X(X(X(G(p0)))))'
Support contains 1 out of 2128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2128/2128 places, 2088/2088 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 2122 transition count 2082
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 2122 transition count 2082
Applied a total of 12 rules in 138 ms. Remains 2122 /2128 variables (removed 6) and now considering 2082/2088 (removed 6) transitions.
// Phase 1: matrix 2082 rows 2122 cols
[2023-03-21 19:47:46] [INFO ] Computed 361 place invariants in 17 ms
[2023-03-21 19:47:46] [INFO ] Implicit Places using invariants in 682 ms returned []
[2023-03-21 19:47:46] [INFO ] Invariant cache hit.
[2023-03-21 19:47:49] [INFO ] Implicit Places using invariants and state equation in 2179 ms returned []
Implicit Place search using SMT with State Equation took 2864 ms to find 0 implicit places.
[2023-03-21 19:47:49] [INFO ] Invariant cache hit.
[2023-03-21 19:47:50] [INFO ] Dead Transitions using invariants and state equation in 1099 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2122/2128 places, 2082/2088 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4103 ms. Remains : 2122/2128 places, 2082/2088 transitions.
Stuttering acceptance computed with spot in 298 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-040B-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(EQ s1808 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 2 ms.
FORMULA ShieldIIPs-PT-040B-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-040B-LTLCardinality-02 finished in 4524 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((X(p1)||p0))))'
Support contains 4 out of 2128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2128/2128 places, 2088/2088 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 2122 transition count 2082
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 2122 transition count 2082
Applied a total of 12 rules in 138 ms. Remains 2122 /2128 variables (removed 6) and now considering 2082/2088 (removed 6) transitions.
[2023-03-21 19:47:50] [INFO ] Invariant cache hit.
[2023-03-21 19:47:52] [INFO ] Implicit Places using invariants in 1409 ms returned []
[2023-03-21 19:47:52] [INFO ] Invariant cache hit.
[2023-03-21 19:47:54] [INFO ] Implicit Places using invariants and state equation in 1991 ms returned []
Implicit Place search using SMT with State Equation took 3404 ms to find 0 implicit places.
[2023-03-21 19:47:54] [INFO ] Invariant cache hit.
[2023-03-21 19:47:55] [INFO ] Dead Transitions using invariants and state equation in 1107 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2122/2128 places, 2082/2088 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4651 ms. Remains : 2122/2128 places, 2082/2088 transitions.
Stuttering acceptance computed with spot in 132 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPs-PT-040B-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=2, aps=[p1:(OR (EQ s878 0) (EQ s776 1)), p0:(OR (EQ s649 0) (EQ s1117 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 20 reset in 860 ms.
Product exploration explored 100000 steps with 19 reset in 1038 ms.
Computed a total of 479 stabilizing places and 479 stable transitions
Computed a total of 479 stabilizing places and 479 stable transitions
Detected a total of 479/2122 stabilizing places and 479/2082 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X p0), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p1)), (X (X (AND p0 p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 428 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 157 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Finished random walk after 2403 steps, including 0 resets, run visited all 4 properties in 31 ms. (steps per millisecond=77 )
Knowledge obtained : [(AND p1 p0), (X p0), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p1)), (X (X (AND p0 p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (NOT (AND p0 p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 7 factoid took 466 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 124 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 177 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 2122 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2122/2122 places, 2082/2082 transitions.
Applied a total of 0 rules in 103 ms. Remains 2122 /2122 variables (removed 0) and now considering 2082/2082 (removed 0) transitions.
[2023-03-21 19:47:58] [INFO ] Invariant cache hit.
[2023-03-21 19:47:59] [INFO ] Implicit Places using invariants in 788 ms returned []
[2023-03-21 19:47:59] [INFO ] Invariant cache hit.
[2023-03-21 19:48:01] [INFO ] Implicit Places using invariants and state equation in 2124 ms returned []
Implicit Place search using SMT with State Equation took 2914 ms to find 0 implicit places.
[2023-03-21 19:48:01] [INFO ] Invariant cache hit.
[2023-03-21 19:48:02] [INFO ] Dead Transitions using invariants and state equation in 1135 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4153 ms. Remains : 2122/2122 places, 2082/2082 transitions.
Computed a total of 479 stabilizing places and 479 stable transitions
Computed a total of 479 stabilizing places and 479 stable transitions
Detected a total of 479/2122 stabilizing places and 479/2082 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X p0), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p1)), (X (X (AND p0 p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 284 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 118 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Finished random walk after 2334 steps, including 0 resets, run visited all 4 properties in 42 ms. (steps per millisecond=55 )
Knowledge obtained : [(AND p1 p0), (X p0), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p1)), (X (X (AND p0 p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (NOT (AND p0 p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 7 factoid took 316 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 129 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 145 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 124 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 20 reset in 771 ms.
Product exploration explored 100000 steps with 20 reset in 990 ms.
Support contains 4 out of 2122 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2122/2122 places, 2082/2082 transitions.
Applied a total of 0 rules in 72 ms. Remains 2122 /2122 variables (removed 0) and now considering 2082/2082 (removed 0) transitions.
[2023-03-21 19:48:06] [INFO ] Invariant cache hit.
[2023-03-21 19:48:06] [INFO ] Implicit Places using invariants in 733 ms returned []
[2023-03-21 19:48:06] [INFO ] Invariant cache hit.
[2023-03-21 19:48:08] [INFO ] Implicit Places using invariants and state equation in 1810 ms returned []
Implicit Place search using SMT with State Equation took 2544 ms to find 0 implicit places.
[2023-03-21 19:48:08] [INFO ] Invariant cache hit.
[2023-03-21 19:48:09] [INFO ] Dead Transitions using invariants and state equation in 1120 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3737 ms. Remains : 2122/2122 places, 2082/2082 transitions.
Treatment of property ShieldIIPs-PT-040B-LTLCardinality-03 finished in 19372 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 4 out of 2128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2128/2128 places, 2088/2088 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 2123 transition count 2083
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 2123 transition count 2083
Applied a total of 10 rules in 150 ms. Remains 2123 /2128 variables (removed 5) and now considering 2083/2088 (removed 5) transitions.
// Phase 1: matrix 2083 rows 2123 cols
[2023-03-21 19:48:10] [INFO ] Computed 361 place invariants in 8 ms
[2023-03-21 19:48:10] [INFO ] Implicit Places using invariants in 850 ms returned []
[2023-03-21 19:48:10] [INFO ] Invariant cache hit.
[2023-03-21 19:48:13] [INFO ] Implicit Places using invariants and state equation in 2163 ms returned []
Implicit Place search using SMT with State Equation took 3015 ms to find 0 implicit places.
[2023-03-21 19:48:13] [INFO ] Invariant cache hit.
[2023-03-21 19:48:14] [INFO ] Dead Transitions using invariants and state equation in 1120 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2123/2128 places, 2083/2088 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4286 ms. Remains : 2123/2128 places, 2083/2088 transitions.
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-040B-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s1483 0) (EQ s606 1) (EQ s114 0) (EQ s1333 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 1571 ms.
Product exploration explored 100000 steps with 50000 reset in 1521 ms.
Computed a total of 480 stabilizing places and 480 stable transitions
Computed a total of 480 stabilizing places and 480 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 90 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPs-PT-040B-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPs-PT-040B-LTLCardinality-05 finished in 7578 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))'
Support contains 1 out of 2128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2128/2128 places, 2088/2088 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 201 transitions
Trivial Post-agglo rules discarded 201 transitions
Performed 201 trivial Post agglomeration. Transition count delta: 201
Iterating post reduction 0 with 201 rules applied. Total rules applied 201 place count 2127 transition count 1886
Reduce places removed 201 places and 0 transitions.
Iterating post reduction 1 with 201 rules applied. Total rules applied 402 place count 1926 transition count 1886
Performed 201 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 201 Pre rules applied. Total rules applied 402 place count 1926 transition count 1685
Deduced a syphon composed of 201 places in 5 ms
Reduce places removed 201 places and 0 transitions.
Iterating global reduction 2 with 402 rules applied. Total rules applied 804 place count 1725 transition count 1685
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 810 place count 1719 transition count 1679
Iterating global reduction 2 with 6 rules applied. Total rules applied 816 place count 1719 transition count 1679
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 816 place count 1719 transition count 1676
Deduced a syphon composed of 3 places in 4 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 822 place count 1716 transition count 1676
Performed 712 Post agglomeration using F-continuation condition.Transition count delta: 712
Deduced a syphon composed of 712 places in 2 ms
Reduce places removed 712 places and 0 transitions.
Iterating global reduction 2 with 1424 rules applied. Total rules applied 2246 place count 1004 transition count 964
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 2248 place count 1002 transition count 962
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2249 place count 1001 transition count 962
Applied a total of 2249 rules in 398 ms. Remains 1001 /2128 variables (removed 1127) and now considering 962/2088 (removed 1126) transitions.
// Phase 1: matrix 962 rows 1001 cols
[2023-03-21 19:48:17] [INFO ] Computed 360 place invariants in 3 ms
[2023-03-21 19:48:18] [INFO ] Implicit Places using invariants in 443 ms returned []
[2023-03-21 19:48:18] [INFO ] Invariant cache hit.
[2023-03-21 19:48:19] [INFO ] Implicit Places using invariants and state equation in 1013 ms returned []
Implicit Place search using SMT with State Equation took 1457 ms to find 0 implicit places.
[2023-03-21 19:48:19] [INFO ] Redundant transitions in 152 ms returned [961]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 961 rows 1001 cols
[2023-03-21 19:48:19] [INFO ] Computed 360 place invariants in 3 ms
[2023-03-21 19:48:20] [INFO ] Dead Transitions using invariants and state equation in 478 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1001/2128 places, 961/2088 transitions.
Applied a total of 0 rules in 21 ms. Remains 1001 /1001 variables (removed 0) and now considering 961/961 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2512 ms. Remains : 1001/2128 places, 961/2088 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-040B-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s514 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 27216 reset in 1072 ms.
Product exploration explored 100000 steps with 27505 reset in 1109 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/1001 stabilizing places and 2/961 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 165 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 27 ms :[(NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 151 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 65 ms :[(NOT p0)]
[2023-03-21 19:48:22] [INFO ] Invariant cache hit.
[2023-03-21 19:48:23] [INFO ] [Real]Absence check using 360 positive place invariants in 195 ms returned sat
[2023-03-21 19:48:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 19:48:24] [INFO ] [Real]Absence check using state equation in 1545 ms returned sat
[2023-03-21 19:48:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 19:48:25] [INFO ] [Nat]Absence check using 360 positive place invariants in 150 ms returned sat
[2023-03-21 19:48:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 19:48:27] [INFO ] [Nat]Absence check using state equation in 1666 ms returned sat
[2023-03-21 19:48:27] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
[2023-03-21 19:48:27] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 0 ms to minimize.
[2023-03-21 19:48:27] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 0 ms to minimize.
[2023-03-21 19:48:27] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 227 ms
[2023-03-21 19:48:27] [INFO ] Computed and/alt/rep : 957/2388/957 causal constraints (skipped 2 transitions) in 54 ms.
[2023-03-21 19:48:40] [INFO ] Added : 635 causal constraints over 127 iterations in 12395 ms. Result :unknown
Could not prove EG (NOT p0)
Support contains 1 out of 1001 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1001/1001 places, 961/961 transitions.
Applied a total of 0 rules in 52 ms. Remains 1001 /1001 variables (removed 0) and now considering 961/961 (removed 0) transitions.
[2023-03-21 19:48:40] [INFO ] Invariant cache hit.
[2023-03-21 19:48:40] [INFO ] Implicit Places using invariants in 540 ms returned []
[2023-03-21 19:48:40] [INFO ] Invariant cache hit.
[2023-03-21 19:48:42] [INFO ] Implicit Places using invariants and state equation in 1590 ms returned []
Implicit Place search using SMT with State Equation took 2133 ms to find 0 implicit places.
[2023-03-21 19:48:42] [INFO ] Redundant transitions in 190 ms returned []
[2023-03-21 19:48:42] [INFO ] Invariant cache hit.
[2023-03-21 19:48:42] [INFO ] Dead Transitions using invariants and state equation in 434 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2816 ms. Remains : 1001/1001 places, 961/961 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/1001 stabilizing places and 2/961 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 150 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 27 ms :[(NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 173 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 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
[2023-03-21 19:48:43] [INFO ] Invariant cache hit.
[2023-03-21 19:48:44] [INFO ] [Real]Absence check using 360 positive place invariants in 176 ms returned sat
[2023-03-21 19:48:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 19:48:45] [INFO ] [Real]Absence check using state equation in 1490 ms returned sat
[2023-03-21 19:48:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 19:48:46] [INFO ] [Nat]Absence check using 360 positive place invariants in 160 ms returned sat
[2023-03-21 19:48:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 19:48:47] [INFO ] [Nat]Absence check using state equation in 1787 ms returned sat
[2023-03-21 19:48:48] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2023-03-21 19:48:48] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 1 ms to minimize.
[2023-03-21 19:48:48] [INFO ] Deduced a trap composed of 8 places in 53 ms of which 1 ms to minimize.
[2023-03-21 19:48:48] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 249 ms
[2023-03-21 19:48:48] [INFO ] Computed and/alt/rep : 957/2388/957 causal constraints (skipped 2 transitions) in 73 ms.
[2023-03-21 19:49:00] [INFO ] Added : 590 causal constraints over 118 iterations in 12335 ms. Result :unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Product exploration explored 100000 steps with 27361 reset in 1023 ms.
Product exploration explored 100000 steps with 27212 reset in 1132 ms.
Support contains 1 out of 1001 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1001/1001 places, 961/961 transitions.
Applied a total of 0 rules in 20 ms. Remains 1001 /1001 variables (removed 0) and now considering 961/961 (removed 0) transitions.
[2023-03-21 19:49:02] [INFO ] Invariant cache hit.
[2023-03-21 19:49:03] [INFO ] Implicit Places using invariants in 455 ms returned []
[2023-03-21 19:49:03] [INFO ] Invariant cache hit.
[2023-03-21 19:49:04] [INFO ] Implicit Places using invariants and state equation in 1183 ms returned []
Implicit Place search using SMT with State Equation took 1640 ms to find 0 implicit places.
[2023-03-21 19:49:04] [INFO ] Redundant transitions in 109 ms returned []
[2023-03-21 19:49:04] [INFO ] Invariant cache hit.
[2023-03-21 19:49:05] [INFO ] Dead Transitions using invariants and state equation in 517 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2291 ms. Remains : 1001/1001 places, 961/961 transitions.
Treatment of property ShieldIIPs-PT-040B-LTLCardinality-08 finished in 47603 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)&&F(G(p1)))))'
Support contains 2 out of 2128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2128/2128 places, 2088/2088 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 201 transitions
Trivial Post-agglo rules discarded 201 transitions
Performed 201 trivial Post agglomeration. Transition count delta: 201
Iterating post reduction 0 with 201 rules applied. Total rules applied 201 place count 2127 transition count 1886
Reduce places removed 201 places and 0 transitions.
Iterating post reduction 1 with 201 rules applied. Total rules applied 402 place count 1926 transition count 1886
Performed 201 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 201 Pre rules applied. Total rules applied 402 place count 1926 transition count 1685
Deduced a syphon composed of 201 places in 3 ms
Reduce places removed 201 places and 0 transitions.
Iterating global reduction 2 with 402 rules applied. Total rules applied 804 place count 1725 transition count 1685
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 809 place count 1720 transition count 1680
Iterating global reduction 2 with 5 rules applied. Total rules applied 814 place count 1720 transition count 1680
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 814 place count 1720 transition count 1678
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 818 place count 1718 transition count 1678
Performed 714 Post agglomeration using F-continuation condition.Transition count delta: 714
Deduced a syphon composed of 714 places in 2 ms
Reduce places removed 714 places and 0 transitions.
Iterating global reduction 2 with 1428 rules applied. Total rules applied 2246 place count 1004 transition count 964
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 2248 place count 1002 transition count 962
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2249 place count 1001 transition count 962
Applied a total of 2249 rules in 284 ms. Remains 1001 /2128 variables (removed 1127) and now considering 962/2088 (removed 1126) transitions.
// Phase 1: matrix 962 rows 1001 cols
[2023-03-21 19:49:05] [INFO ] Computed 360 place invariants in 3 ms
[2023-03-21 19:49:05] [INFO ] Implicit Places using invariants in 384 ms returned []
[2023-03-21 19:49:05] [INFO ] Invariant cache hit.
[2023-03-21 19:49:06] [INFO ] Implicit Places using invariants and state equation in 1053 ms returned []
Implicit Place search using SMT with State Equation took 1441 ms to find 0 implicit places.
[2023-03-21 19:49:07] [INFO ] Redundant transitions in 154 ms returned [961]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 961 rows 1001 cols
[2023-03-21 19:49:07] [INFO ] Computed 360 place invariants in 2 ms
[2023-03-21 19:49:07] [INFO ] Dead Transitions using invariants and state equation in 412 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1001/2128 places, 961/2088 transitions.
Applied a total of 0 rules in 23 ms. Remains 1001 /1001 variables (removed 0) and now considering 961/961 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2334 ms. Remains : 1001/2128 places, 961/2088 transitions.
Stuttering acceptance computed with spot in 102 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldIIPs-PT-040B-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s813 1), p1:(EQ s144 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 2420 steps with 2 reset in 19 ms.
FORMULA ShieldIIPs-PT-040B-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-040B-LTLCardinality-09 finished in 2482 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) U ((!p0&&X(!p0))||X(G(!p0)))) U (G((X(!p0) U ((!p0&&X(!p0))||X(G(!p0)))))||((!p1||F(!p2))&&(X(!p0) U ((!p0&&X(!p0))||X(G(!p0))))))) U (G((X(!p0) U ((!p0&&X(!p0))||X(G(!p0)))))||(X(!p1)&&((X(!p0) U ((!p0&&X(!p0))||X(G(!p0)))) U (G((X(!p0) U ((!p0&&X(!p0))||X(G(!p0)))))||((!p1||F(!p2))&&(X(!p0) U ((!p0&&X(!p0))||X(G(!p0)))))))))))'
Support contains 6 out of 2128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2128/2128 places, 2088/2088 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 2123 transition count 2083
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 2123 transition count 2083
Applied a total of 10 rules in 156 ms. Remains 2123 /2128 variables (removed 5) and now considering 2083/2088 (removed 5) transitions.
// Phase 1: matrix 2083 rows 2123 cols
[2023-03-21 19:49:07] [INFO ] Computed 361 place invariants in 6 ms
[2023-03-21 19:49:08] [INFO ] Implicit Places using invariants in 774 ms returned []
[2023-03-21 19:49:08] [INFO ] Invariant cache hit.
[2023-03-21 19:49:10] [INFO ] Implicit Places using invariants and state equation in 2391 ms returned []
Implicit Place search using SMT with State Equation took 3174 ms to find 0 implicit places.
[2023-03-21 19:49:10] [INFO ] Invariant cache hit.
[2023-03-21 19:49:12] [INFO ] Dead Transitions using invariants and state equation in 1066 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2123/2128 places, 2083/2088 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4402 ms. Remains : 2123/2128 places, 2083/2088 transitions.
Stuttering acceptance computed with spot in 310 ms :[true, p2, (AND p2 p0), p0, p0, p0, p0, p0]
Running random walk in product with property : ShieldIIPs-PT-040B-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p2, acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 p2), acceptance={} source=2 dest: 1}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=3 dest: 6}, { cond=p0, acceptance={} source=3 dest: 7}], [{ cond=p0, acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=4 dest: 6}], [{ cond=p0, acceptance={} source=5 dest: 0}], [{ cond=p0, acceptance={} source=6 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=6 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=6 dest: 6}], [{ cond=p0, acceptance={} source=7 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=7 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=7 dest: 5}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=7 dest: 6}]], initial=3, aps=[p2:(OR (EQ s1191 0) (EQ s241 1)), p0:(OR (EQ s144 0) (EQ s425 1)), p1:(OR (EQ s2112 0) (EQ s31 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, 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-040B-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-040B-LTLCardinality-11 finished in 4753 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)&&X(F(p1)))))'
Support contains 3 out of 2128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2128/2128 places, 2088/2088 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 2123 transition count 2083
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 2123 transition count 2083
Applied a total of 10 rules in 162 ms. Remains 2123 /2128 variables (removed 5) and now considering 2083/2088 (removed 5) transitions.
// Phase 1: matrix 2083 rows 2123 cols
[2023-03-21 19:49:12] [INFO ] Computed 361 place invariants in 15 ms
[2023-03-21 19:49:13] [INFO ] Implicit Places using invariants in 794 ms returned []
[2023-03-21 19:49:13] [INFO ] Invariant cache hit.
[2023-03-21 19:49:15] [INFO ] Implicit Places using invariants and state equation in 2009 ms returned []
Implicit Place search using SMT with State Equation took 2807 ms to find 0 implicit places.
[2023-03-21 19:49:15] [INFO ] Invariant cache hit.
[2023-03-21 19:49:16] [INFO ] Dead Transitions using invariants and state equation in 1153 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2123/2128 places, 2083/2088 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4124 ms. Remains : 2123/2128 places, 2083/2088 transitions.
Stuttering acceptance computed with spot in 90 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldIIPs-PT-040B-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s395 1), p1:(OR (AND (EQ s283 0) (EQ s1824 1)) (EQ s395 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 4928 steps with 0 reset in 80 ms.
FORMULA ShieldIIPs-PT-040B-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-040B-LTLCardinality-13 finished in 4330 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(X((G(F(p0))||(p1&&F(G(p1)))))))'
Support contains 3 out of 2128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2128/2128 places, 2088/2088 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 2123 transition count 2083
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 2123 transition count 2083
Applied a total of 10 rules in 131 ms. Remains 2123 /2128 variables (removed 5) and now considering 2083/2088 (removed 5) transitions.
// Phase 1: matrix 2083 rows 2123 cols
[2023-03-21 19:49:16] [INFO ] Computed 361 place invariants in 13 ms
[2023-03-21 19:49:17] [INFO ] Implicit Places using invariants in 850 ms returned []
[2023-03-21 19:49:17] [INFO ] Invariant cache hit.
[2023-03-21 19:49:20] [INFO ] Implicit Places using invariants and state equation in 3009 ms returned []
Implicit Place search using SMT with State Equation took 3864 ms to find 0 implicit places.
[2023-03-21 19:49:20] [INFO ] Invariant cache hit.
[2023-03-21 19:49:21] [INFO ] Dead Transitions using invariants and state equation in 1112 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2123/2128 places, 2083/2088 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5117 ms. Remains : 2123/2128 places, 2083/2088 transitions.
Stuttering acceptance computed with spot in 298 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPs-PT-040B-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(NOT p1), acceptance={} source=2 dest: 4}, { cond=p1, acceptance={} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 5}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p0) p1), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(OR (EQ s663 0) (EQ s2007 1)), p1:(EQ s481 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25 reset in 801 ms.
Product exploration explored 100000 steps with 26 reset in 891 ms.
Computed a total of 479 stabilizing places and 479 stable transitions
Computed a total of 479 stabilizing places and 479 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 194 ms. Reduced automaton from 7 states, 12 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 242164 steps, run timeout after 3001 ms. (steps per millisecond=80 ) properties seen :{}
Probabilistic random walk after 242164 steps, saw 225669 distinct states, run finished after 3001 ms. (steps per millisecond=80 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-21 19:49:27] [INFO ] Invariant cache hit.
[2023-03-21 19:49:27] [INFO ] After 242ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 19:49:27] [INFO ] [Nat]Absence check using 361 positive place invariants in 113 ms returned sat
[2023-03-21 19:49:28] [INFO ] After 1042ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 19:49:29] [INFO ] Deduced a trap composed of 25 places in 546 ms of which 1 ms to minimize.
[2023-03-21 19:49:30] [INFO ] Deduced a trap composed of 21 places in 468 ms of which 1 ms to minimize.
[2023-03-21 19:49:30] [INFO ] Deduced a trap composed of 20 places in 424 ms of which 1 ms to minimize.
[2023-03-21 19:49:31] [INFO ] Deduced a trap composed of 18 places in 437 ms of which 1 ms to minimize.
[2023-03-21 19:49:31] [INFO ] Deduced a trap composed of 33 places in 563 ms of which 2 ms to minimize.
[2023-03-21 19:49:32] [INFO ] Deduced a trap composed of 33 places in 694 ms of which 1 ms to minimize.
[2023-03-21 19:49:33] [INFO ] Deduced a trap composed of 15 places in 555 ms of which 1 ms to minimize.
[2023-03-21 19:49:33] [INFO ] Deduced a trap composed of 24 places in 730 ms of which 1 ms to minimize.
[2023-03-21 19:49:34] [INFO ] Deduced a trap composed of 18 places in 606 ms of which 1 ms to minimize.
[2023-03-21 19:49:35] [INFO ] Deduced a trap composed of 36 places in 474 ms of which 1 ms to minimize.
[2023-03-21 19:49:35] [INFO ] Deduced a trap composed of 18 places in 578 ms of which 2 ms to minimize.
[2023-03-21 19:49:36] [INFO ] Deduced a trap composed of 18 places in 421 ms of which 1 ms to minimize.
[2023-03-21 19:49:36] [INFO ] Deduced a trap composed of 20 places in 502 ms of which 1 ms to minimize.
[2023-03-21 19:49:37] [INFO ] Deduced a trap composed of 16 places in 459 ms of which 1 ms to minimize.
[2023-03-21 19:49:37] [INFO ] Deduced a trap composed of 22 places in 446 ms of which 1 ms to minimize.
[2023-03-21 19:49:38] [INFO ] Deduced a trap composed of 23 places in 521 ms of which 2 ms to minimize.
[2023-03-21 19:49:38] [INFO ] Deduced a trap composed of 25 places in 421 ms of which 1 ms to minimize.
[2023-03-21 19:49:39] [INFO ] Deduced a trap composed of 23 places in 395 ms of which 1 ms to minimize.
[2023-03-21 19:49:40] [INFO ] Deduced a trap composed of 21 places in 512 ms of which 1 ms to minimize.
[2023-03-21 19:49:40] [INFO ] Deduced a trap composed of 35 places in 494 ms of which 1 ms to minimize.
[2023-03-21 19:49:41] [INFO ] Deduced a trap composed of 47 places in 463 ms of which 1 ms to minimize.
[2023-03-21 19:49:41] [INFO ] Deduced a trap composed of 26 places in 487 ms of which 1 ms to minimize.
[2023-03-21 19:49:42] [INFO ] Deduced a trap composed of 26 places in 460 ms of which 1 ms to minimize.
[2023-03-21 19:49:42] [INFO ] Deduced a trap composed of 25 places in 440 ms of which 1 ms to minimize.
[2023-03-21 19:49:43] [INFO ] Deduced a trap composed of 25 places in 434 ms of which 1 ms to minimize.
[2023-03-21 19:49:43] [INFO ] Deduced a trap composed of 20 places in 479 ms of which 1 ms to minimize.
[2023-03-21 19:49:44] [INFO ] Deduced a trap composed of 21 places in 450 ms of which 1 ms to minimize.
[2023-03-21 19:49:44] [INFO ] Deduced a trap composed of 27 places in 408 ms of which 1 ms to minimize.
[2023-03-21 19:49:45] [INFO ] Deduced a trap composed of 22 places in 468 ms of which 2 ms to minimize.
[2023-03-21 19:49:45] [INFO ] Deduced a trap composed of 33 places in 412 ms of which 1 ms to minimize.
[2023-03-21 19:49:46] [INFO ] Deduced a trap composed of 31 places in 505 ms of which 1 ms to minimize.
[2023-03-21 19:49:47] [INFO ] Deduced a trap composed of 29 places in 373 ms of which 1 ms to minimize.
[2023-03-21 19:49:47] [INFO ] Deduced a trap composed of 34 places in 488 ms of which 1 ms to minimize.
[2023-03-21 19:49:48] [INFO ] Deduced a trap composed of 29 places in 384 ms of which 1 ms to minimize.
[2023-03-21 19:49:48] [INFO ] Deduced a trap composed of 35 places in 401 ms of which 1 ms to minimize.
[2023-03-21 19:49:48] [INFO ] Deduced a trap composed of 52 places in 381 ms of which 1 ms to minimize.
[2023-03-21 19:49:49] [INFO ] Deduced a trap composed of 28 places in 413 ms of which 1 ms to minimize.
[2023-03-21 19:49:49] [INFO ] Deduced a trap composed of 24 places in 428 ms of which 1 ms to minimize.
[2023-03-21 19:49:50] [INFO ] Deduced a trap composed of 36 places in 374 ms of which 1 ms to minimize.
[2023-03-21 19:49:50] [INFO ] Deduced a trap composed of 40 places in 355 ms of which 1 ms to minimize.
[2023-03-21 19:49:51] [INFO ] Deduced a trap composed of 41 places in 383 ms of which 0 ms to minimize.
[2023-03-21 19:49:51] [INFO ] Deduced a trap composed of 36 places in 367 ms of which 1 ms to minimize.
[2023-03-21 19:49:52] [INFO ] Deduced a trap composed of 42 places in 412 ms of which 1 ms to minimize.
[2023-03-21 19:49:52] [INFO ] Deduced a trap composed of 50 places in 444 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java: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.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
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-21 19:49:52] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-21 19:49:52] [INFO ] After 25259ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 17 ms.
Support contains 2 out of 2123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2123/2123 places, 2083/2083 transitions.
Drop transitions removed 201 transitions
Trivial Post-agglo rules discarded 201 transitions
Performed 201 trivial Post agglomeration. Transition count delta: 201
Iterating post reduction 0 with 201 rules applied. Total rules applied 201 place count 2123 transition count 1882
Reduce places removed 201 places and 0 transitions.
Iterating post reduction 1 with 201 rules applied. Total rules applied 402 place count 1922 transition count 1882
Performed 201 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 201 Pre rules applied. Total rules applied 402 place count 1922 transition count 1681
Deduced a syphon composed of 201 places in 3 ms
Reduce places removed 201 places and 0 transitions.
Iterating global reduction 2 with 402 rules applied. Total rules applied 804 place count 1721 transition count 1681
Performed 719 Post agglomeration using F-continuation condition.Transition count delta: 719
Deduced a syphon composed of 719 places in 2 ms
Reduce places removed 719 places and 0 transitions.
Iterating global reduction 2 with 1438 rules applied. Total rules applied 2242 place count 1002 transition count 962
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 277 times.
Drop transitions removed 277 transitions
Iterating global reduction 2 with 277 rules applied. Total rules applied 2519 place count 1002 transition count 962
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 2520 place count 1001 transition count 961
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2521 place count 1000 transition count 961
Applied a total of 2521 rules in 213 ms. Remains 1000 /2123 variables (removed 1123) and now considering 961/2083 (removed 1122) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 213 ms. Remains : 1000/2123 places, 961/2083 transitions.
Finished random walk after 2064 steps, including 0 resets, run visited all 1 properties in 20 ms. (steps per millisecond=103 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 138 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 106 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 117 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 2123 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 : 2123/2123 places, 2083/2083 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 201 transitions
Trivial Post-agglo rules discarded 201 transitions
Performed 201 trivial Post agglomeration. Transition count delta: 201
Iterating post reduction 0 with 201 rules applied. Total rules applied 201 place count 2122 transition count 1881
Reduce places removed 201 places and 0 transitions.
Iterating post reduction 1 with 201 rules applied. Total rules applied 402 place count 1921 transition count 1881
Performed 201 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 201 Pre rules applied. Total rules applied 402 place count 1921 transition count 1680
Deduced a syphon composed of 201 places in 7 ms
Reduce places removed 201 places and 0 transitions.
Iterating global reduction 2 with 402 rules applied. Total rules applied 804 place count 1720 transition count 1680
Performed 716 Post agglomeration using F-continuation condition.Transition count delta: 716
Deduced a syphon composed of 716 places in 2 ms
Reduce places removed 716 places and 0 transitions.
Iterating global reduction 2 with 1432 rules applied. Total rules applied 2236 place count 1004 transition count 964
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 2238 place count 1002 transition count 962
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2239 place count 1001 transition count 962
Applied a total of 2239 rules in 308 ms. Remains 1001 /2123 variables (removed 1122) and now considering 962/2083 (removed 1121) transitions.
// Phase 1: matrix 962 rows 1001 cols
[2023-03-21 19:49:53] [INFO ] Computed 360 place invariants in 2 ms
[2023-03-21 19:49:54] [INFO ] Implicit Places using invariants in 395 ms returned []
[2023-03-21 19:49:54] [INFO ] Invariant cache hit.
[2023-03-21 19:49:55] [INFO ] Implicit Places using invariants and state equation in 1056 ms returned []
Implicit Place search using SMT with State Equation took 1463 ms to find 0 implicit places.
[2023-03-21 19:49:55] [INFO ] Redundant transitions in 224 ms returned [961]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 961 rows 1001 cols
[2023-03-21 19:49:55] [INFO ] Computed 360 place invariants in 2 ms
[2023-03-21 19:49:55] [INFO ] Dead Transitions using invariants and state equation in 459 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1001/2123 places, 961/2083 transitions.
Applied a total of 0 rules in 17 ms. Remains 1001 /1001 variables (removed 0) and now considering 961/961 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2477 ms. Remains : 1001/2123 places, 961/2083 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 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 62 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1523 steps, including 0 resets, run visited all 1 properties in 25 ms. (steps per millisecond=60 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 227 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 110 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 132 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 60 reset in 858 ms.
Product exploration explored 100000 steps with 61 reset in 878 ms.
Support contains 2 out of 1001 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1001/1001 places, 961/961 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1000 transition count 960
Applied a total of 2 rules in 29 ms. Remains 1000 /1001 variables (removed 1) and now considering 960/961 (removed 1) transitions.
// Phase 1: matrix 960 rows 1000 cols
[2023-03-21 19:49:58] [INFO ] Computed 360 place invariants in 5 ms
[2023-03-21 19:49:58] [INFO ] Implicit Places using invariants in 412 ms returned []
[2023-03-21 19:49:58] [INFO ] Invariant cache hit.
[2023-03-21 19:49:59] [INFO ] Implicit Places using invariants and state equation in 1008 ms returned []
Implicit Place search using SMT with State Equation took 1421 ms to find 0 implicit places.
[2023-03-21 19:50:00] [INFO ] Redundant transitions in 229 ms returned []
[2023-03-21 19:50:00] [INFO ] Invariant cache hit.
[2023-03-21 19:50:00] [INFO ] Dead Transitions using invariants and state equation in 455 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1000/1001 places, 960/961 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2159 ms. Remains : 1000/1001 places, 960/961 transitions.
Treatment of property ShieldIIPs-PT-040B-LTLCardinality-14 finished in 43992 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((X(p1)||p0))))'
Found a Lengthening insensitive property : ShieldIIPs-PT-040B-LTLCardinality-03
Stuttering acceptance computed with spot in 183 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 2128 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 2128/2128 places, 2088/2088 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 201 transitions
Trivial Post-agglo rules discarded 201 transitions
Performed 201 trivial Post agglomeration. Transition count delta: 201
Iterating post reduction 0 with 201 rules applied. Total rules applied 201 place count 2127 transition count 1886
Reduce places removed 201 places and 0 transitions.
Iterating post reduction 1 with 201 rules applied. Total rules applied 402 place count 1926 transition count 1886
Performed 199 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 199 Pre rules applied. Total rules applied 402 place count 1926 transition count 1687
Deduced a syphon composed of 199 places in 4 ms
Reduce places removed 199 places and 0 transitions.
Iterating global reduction 2 with 398 rules applied. Total rules applied 800 place count 1727 transition count 1687
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 806 place count 1721 transition count 1681
Iterating global reduction 2 with 6 rules applied. Total rules applied 812 place count 1721 transition count 1681
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 812 place count 1721 transition count 1678
Deduced a syphon composed of 3 places in 4 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 818 place count 1718 transition count 1678
Performed 710 Post agglomeration using F-continuation condition.Transition count delta: 710
Deduced a syphon composed of 710 places in 2 ms
Reduce places removed 710 places and 0 transitions.
Iterating global reduction 2 with 1420 rules applied. Total rules applied 2238 place count 1008 transition count 968
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 2240 place count 1006 transition count 966
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2241 place count 1005 transition count 966
Applied a total of 2241 rules in 311 ms. Remains 1005 /2128 variables (removed 1123) and now considering 966/2088 (removed 1122) transitions.
// Phase 1: matrix 966 rows 1005 cols
[2023-03-21 19:50:01] [INFO ] Computed 360 place invariants in 3 ms
[2023-03-21 19:50:01] [INFO ] Implicit Places using invariants in 451 ms returned []
[2023-03-21 19:50:01] [INFO ] Invariant cache hit.
[2023-03-21 19:50:02] [INFO ] Implicit Places using invariants and state equation in 1121 ms returned []
Implicit Place search using SMT with State Equation took 1583 ms to find 0 implicit places.
[2023-03-21 19:50:02] [INFO ] Invariant cache hit.
[2023-03-21 19:50:03] [INFO ] Dead Transitions using invariants and state equation in 475 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 1005/2128 places, 966/2088 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 2369 ms. Remains : 1005/2128 places, 966/2088 transitions.
Running random walk in product with property : ShieldIIPs-PT-040B-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=2, aps=[p1:(OR (EQ s406 0) (EQ s354 1)), p0:(OR (EQ s294 0) (EQ s524 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4310 steps with 2 reset in 33 ms.
Treatment of property ShieldIIPs-PT-040B-LTLCardinality-03 finished in 2701 ms.
FORMULA ShieldIIPs-PT-040B-LTLCardinality-03 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
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))'
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(X((G(F(p0))||(p1&&F(G(p1)))))))'
[2023-03-21 19:50:03] [INFO ] Flatten gal took : 74 ms
[2023-03-21 19:50:03] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-21 19:50:03] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 2128 places, 2088 transitions and 6576 arcs took 16 ms.
Total runtime 186203 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1771/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1771/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1771/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : ShieldIIPs-PT-040B-LTLCardinality-03
Could not compute solution for formula : ShieldIIPs-PT-040B-LTLCardinality-08
Could not compute solution for formula : ShieldIIPs-PT-040B-LTLCardinality-14

BK_STOP 1679428206494

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2023
ltl formula name ShieldIIPs-PT-040B-LTLCardinality-03
ltl formula formula --ltl=/tmp/1771/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 2128 places, 2088 transitions and 6576 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.370 real 0.090 user 0.130 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1771/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1771/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1771/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1771/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
ltl formula name ShieldIIPs-PT-040B-LTLCardinality-08
ltl formula formula --ltl=/tmp/1771/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 2128 places, 2088 transitions and 6576 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.300 real 0.080 user 0.160 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1771/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1771/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1771/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1771/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 1 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
0: pnml2lts-mc(+0xa23f4) [0x55a6d3f003f4]
1: pnml2lts-mc(+0xa2496) [0x55a6d3f00496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7f47598ff140]
3: pnml2lts-mc(+0x405be5) [0x55a6d4263be5]
4: pnml2lts-mc(+0x16b3f9) [0x55a6d3fc93f9]
5: pnml2lts-mc(+0x164ac4) [0x55a6d3fc2ac4]
6: pnml2lts-mc(+0x272e0a) [0x55a6d40d0e0a]
7: pnml2lts-mc(+0xb61f0) [0x55a6d3f141f0]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7f47597524d7]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7f475975267a]
10: pnml2lts-mc(+0xa1581) [0x55a6d3eff581]
11: pnml2lts-mc(+0xa1910) [0x55a6d3eff910]
12: pnml2lts-mc(+0xa32a2) [0x55a6d3f012a2]
13: pnml2lts-mc(+0xa50f4) [0x55a6d3f030f4]
14: pnml2lts-mc(+0xa516b) [0x55a6d3f0316b]
15: pnml2lts-mc(+0x3f34b3) [0x55a6d42514b3]
16: pnml2lts-mc(+0x7c63d) [0x55a6d3eda63d]
17: pnml2lts-mc(+0x67d86) [0x55a6d3ec5d86]
18: pnml2lts-mc(+0x60a8a) [0x55a6d3ebea8a]
19: pnml2lts-mc(+0x5eb15) [0x55a6d3ebcb15]
20: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7f475973ad0a]
21: pnml2lts-mc(+0x6075e) [0x55a6d3ebe75e]
ltl formula name ShieldIIPs-PT-040B-LTLCardinality-14
ltl formula formula --ltl=/tmp/1771/ltl_2_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 2128 places, 2088 transitions and 6576 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.410 real 0.130 user 0.190 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1771/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1771/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1771/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1771/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 8 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)

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-040B"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is ShieldIIPs-PT-040B, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r393-oct2-167903716700139"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPs-PT-040B.tgz
mv ShieldIIPs-PT-040B execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;