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-167903717100524.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 ShieldPPPs-PT-100B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r393-oct2-167903717100524
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.2M
-rw-r--r-- 1 mcc users 7.3K Feb 26 02:08 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Feb 26 02:08 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Feb 26 02:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Feb 26 02:07 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.7K Feb 25 16:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.8K Feb 26 02:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 62K Feb 26 02:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Feb 26 02:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K Feb 26 02:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:59 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 1.8M 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 ShieldPPPs-PT-100B-LTLFireability-00
FORMULA_NAME ShieldPPPs-PT-100B-LTLFireability-01
FORMULA_NAME ShieldPPPs-PT-100B-LTLFireability-02
FORMULA_NAME ShieldPPPs-PT-100B-LTLFireability-03
FORMULA_NAME ShieldPPPs-PT-100B-LTLFireability-04
FORMULA_NAME ShieldPPPs-PT-100B-LTLFireability-05
FORMULA_NAME ShieldPPPs-PT-100B-LTLFireability-06
FORMULA_NAME ShieldPPPs-PT-100B-LTLFireability-07
FORMULA_NAME ShieldPPPs-PT-100B-LTLFireability-08
FORMULA_NAME ShieldPPPs-PT-100B-LTLFireability-09
FORMULA_NAME ShieldPPPs-PT-100B-LTLFireability-10
FORMULA_NAME ShieldPPPs-PT-100B-LTLFireability-11
FORMULA_NAME ShieldPPPs-PT-100B-LTLFireability-12
FORMULA_NAME ShieldPPPs-PT-100B-LTLFireability-13
FORMULA_NAME ShieldPPPs-PT-100B-LTLFireability-14
FORMULA_NAME ShieldPPPs-PT-100B-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679458741090

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=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPs-PT-100B
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-22 04:19:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-22 04:19:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 04:19:04] [INFO ] Load time of PNML (sax parser for PT used): 248 ms
[2023-03-22 04:19:04] [INFO ] Transformed 6803 places.
[2023-03-22 04:19:04] [INFO ] Transformed 6303 transitions.
[2023-03-22 04:19:04] [INFO ] Found NUPN structural information;
[2023-03-22 04:19:04] [INFO ] Parsed PT model containing 6803 places and 6303 transitions and 17406 arcs in 621 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 18 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA ShieldPPPs-PT-100B-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-100B-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-100B-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-100B-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Initial state reduction rules removed 1 formulas.
FORMULA ShieldPPPs-PT-100B-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 36 out of 6803 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6803/6803 places, 6303/6303 transitions.
Discarding 698 places :
Symmetric choice reduction at 0 with 698 rule applications. Total rules 698 place count 6105 transition count 5605
Iterating global reduction 0 with 698 rules applied. Total rules applied 1396 place count 6105 transition count 5605
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1397 place count 6104 transition count 5604
Iterating global reduction 0 with 1 rules applied. Total rules applied 1398 place count 6104 transition count 5604
Applied a total of 1398 rules in 3116 ms. Remains 6104 /6803 variables (removed 699) and now considering 5604/6303 (removed 699) transitions.
// Phase 1: matrix 5604 rows 6104 cols
[2023-03-22 04:19:08] [INFO ] Computed 1101 place invariants in 76 ms
[2023-03-22 04:19:12] [INFO ] Implicit Places using invariants in 4484 ms returned []
[2023-03-22 04:19:12] [INFO ] Invariant cache hit.
[2023-03-22 04:19:15] [INFO ] Implicit Places using invariants and state equation in 2773 ms returned []
Implicit Place search using SMT with State Equation took 7319 ms to find 0 implicit places.
[2023-03-22 04:19:15] [INFO ] Invariant cache hit.
[2023-03-22 04:19:20] [INFO ] Dead Transitions using invariants and state equation in 5420 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6104/6803 places, 5604/6303 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15875 ms. Remains : 6104/6803 places, 5604/6303 transitions.
Support contains 36 out of 6104 places after structural reductions.
[2023-03-22 04:19:21] [INFO ] Flatten gal took : 421 ms
[2023-03-22 04:19:21] [INFO ] Flatten gal took : 222 ms
[2023-03-22 04:19:22] [INFO ] Input system was already deterministic with 5604 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 849 ms. (steps per millisecond=11 ) properties (out of 24) seen :5
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Running SMT prover for 19 properties.
[2023-03-22 04:19:23] [INFO ] Invariant cache hit.
[2023-03-22 04:19:25] [INFO ] After 2683ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:19
[2023-03-22 04:19:30] [INFO ] [Nat]Absence check using 1101 positive place invariants in 1390 ms returned sat
[2023-03-22 04:19:41] [INFO ] After 9434ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :19
[2023-03-22 04:19:44] [INFO ] Deduced a trap composed of 26 places in 3130 ms of which 10 ms to minimize.
[2023-03-22 04:19:48] [INFO ] Deduced a trap composed of 14 places in 3845 ms of which 32 ms to minimize.
[2023-03-22 04:19:51] [INFO ] Deduced a trap composed of 26 places in 2733 ms of which 3 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-22 04:19:51] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 04:19:51] [INFO ] After 25949ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:19
Fused 19 Parikh solutions to 16 different solutions.
Parikh walk visited 1 properties in 4836 ms.
Support contains 28 out of 6104 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6104/6104 places, 5604/5604 transitions.
Drop transitions removed 693 transitions
Trivial Post-agglo rules discarded 693 transitions
Performed 693 trivial Post agglomeration. Transition count delta: 693
Iterating post reduction 0 with 693 rules applied. Total rules applied 693 place count 6104 transition count 4911
Reduce places removed 693 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 694 rules applied. Total rules applied 1387 place count 5411 transition count 4910
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1388 place count 5410 transition count 4910
Performed 502 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 502 Pre rules applied. Total rules applied 1388 place count 5410 transition count 4408
Deduced a syphon composed of 502 places in 26 ms
Reduce places removed 502 places and 0 transitions.
Iterating global reduction 3 with 1004 rules applied. Total rules applied 2392 place count 4908 transition count 4408
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 2393 place count 4907 transition count 4407
Iterating global reduction 3 with 1 rules applied. Total rules applied 2394 place count 4907 transition count 4407
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 2394 place count 4907 transition count 4406
Deduced a syphon composed of 1 places in 28 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2396 place count 4906 transition count 4406
Performed 1784 Post agglomeration using F-continuation condition.Transition count delta: 1784
Deduced a syphon composed of 1784 places in 20 ms
Reduce places removed 1784 places and 0 transitions.
Iterating global reduction 3 with 3568 rules applied. Total rules applied 5964 place count 3122 transition count 2622
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 883 times.
Drop transitions removed 883 transitions
Iterating global reduction 3 with 883 rules applied. Total rules applied 6847 place count 3122 transition count 2622
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 6848 place count 3121 transition count 2621
Applied a total of 6848 rules in 2852 ms. Remains 3121 /6104 variables (removed 2983) and now considering 2621/5604 (removed 2983) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2853 ms. Remains : 3121/6104 places, 2621/5604 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 377 ms. (steps per millisecond=26 ) properties (out of 18) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 217 ms. (steps per millisecond=46 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 312 ms. (steps per millisecond=32 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 323 ms. (steps per millisecond=30 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 285 ms. (steps per millisecond=35 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 276 ms. (steps per millisecond=36 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 287 ms. (steps per millisecond=34 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 177 ms. (steps per millisecond=56 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 281 ms. (steps per millisecond=35 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 254 ms. (steps per millisecond=39 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 216 ms. (steps per millisecond=46 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 150 ms. (steps per millisecond=66 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 164 ms. (steps per millisecond=60 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 158 ms. (steps per millisecond=63 ) properties (out of 13) seen :0
Running SMT prover for 13 properties.
// Phase 1: matrix 2621 rows 3121 cols
[2023-03-22 04:20:03] [INFO ] Computed 1101 place invariants in 137 ms
[2023-03-22 04:20:05] [INFO ] [Real]Absence check using 1049 positive place invariants in 346 ms returned sat
[2023-03-22 04:20:05] [INFO ] [Real]Absence check using 1049 positive and 52 generalized place invariants in 11 ms returned sat
[2023-03-22 04:20:05] [INFO ] After 1844ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2023-03-22 04:20:07] [INFO ] [Nat]Absence check using 1049 positive place invariants in 620 ms returned sat
[2023-03-22 04:20:07] [INFO ] [Nat]Absence check using 1049 positive and 52 generalized place invariants in 17 ms returned sat
[2023-03-22 04:20:12] [INFO ] After 4119ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :13
[2023-03-22 04:20:12] [INFO ] Deduced a trap composed of 6 places in 388 ms of which 18 ms to minimize.
[2023-03-22 04:20:13] [INFO ] Deduced a trap composed of 5 places in 378 ms of which 20 ms to minimize.
[2023-03-22 04:20:13] [INFO ] Deduced a trap composed of 6 places in 418 ms of which 0 ms to minimize.
[2023-03-22 04:20:14] [INFO ] Deduced a trap composed of 11 places in 333 ms of which 26 ms to minimize.
[2023-03-22 04:20:14] [INFO ] Deduced a trap composed of 4 places in 332 ms of which 1 ms to minimize.
[2023-03-22 04:20:15] [INFO ] Deduced a trap composed of 4 places in 304 ms of which 0 ms to minimize.
[2023-03-22 04:20:15] [INFO ] Deduced a trap composed of 6 places in 340 ms of which 0 ms to minimize.
[2023-03-22 04:20:15] [INFO ] Deduced a trap composed of 5 places in 319 ms of which 0 ms to minimize.
[2023-03-22 04:20:16] [INFO ] Deduced a trap composed of 4 places in 336 ms of which 10 ms to minimize.
[2023-03-22 04:20:16] [INFO ] Deduced a trap composed of 4 places in 358 ms of which 1 ms to minimize.
[2023-03-22 04:20:17] [INFO ] Deduced a trap composed of 6 places in 265 ms of which 1 ms to minimize.
[2023-03-22 04:20:17] [INFO ] Deduced a trap composed of 4 places in 268 ms of which 15 ms to minimize.
[2023-03-22 04:20:18] [INFO ] Deduced a trap composed of 6 places in 433 ms of which 0 ms to minimize.
[2023-03-22 04:20:18] [INFO ] Deduced a trap composed of 5 places in 233 ms of which 1 ms to minimize.
[2023-03-22 04:20:18] [INFO ] Deduced a trap composed of 4 places in 229 ms of which 1 ms to minimize.
[2023-03-22 04:20:19] [INFO ] Deduced a trap composed of 6 places in 240 ms of which 0 ms to minimize.
[2023-03-22 04:20:19] [INFO ] Deduced a trap composed of 6 places in 247 ms of which 0 ms to minimize.
[2023-03-22 04:20:19] [INFO ] Deduced a trap composed of 8 places in 252 ms of which 1 ms to minimize.
[2023-03-22 04:20:20] [INFO ] Deduced a trap composed of 5 places in 216 ms of which 1 ms to minimize.
[2023-03-22 04:20:20] [INFO ] Deduced a trap composed of 6 places in 204 ms of which 0 ms to minimize.
[2023-03-22 04:20:20] [INFO ] Deduced a trap composed of 6 places in 294 ms of which 1 ms to minimize.
[2023-03-22 04:20:21] [INFO ] Deduced a trap composed of 6 places in 342 ms of which 1 ms to minimize.
[2023-03-22 04:20:21] [INFO ] Deduced a trap composed of 6 places in 225 ms of which 0 ms to minimize.
[2023-03-22 04:20:22] [INFO ] Deduced a trap composed of 6 places in 335 ms of which 0 ms to minimize.
[2023-03-22 04:20:22] [INFO ] Deduced a trap composed of 6 places in 136 ms of which 0 ms to minimize.
[2023-03-22 04:20:22] [INFO ] Deduced a trap composed of 6 places in 236 ms of which 0 ms to minimize.
[2023-03-22 04:20:23] [INFO ] Deduced a trap composed of 6 places in 232 ms of which 0 ms to minimize.
[2023-03-22 04:20:23] [INFO ] Deduced a trap composed of 6 places in 219 ms of which 0 ms to minimize.
[2023-03-22 04:20:23] [INFO ] Deduced a trap composed of 4 places in 150 ms of which 1 ms to minimize.
[2023-03-22 04:20:23] [INFO ] Deduced a trap composed of 9 places in 227 ms of which 1 ms to minimize.
[2023-03-22 04:20:24] [INFO ] Deduced a trap composed of 9 places in 206 ms of which 4 ms to minimize.
[2023-03-22 04:20:24] [INFO ] Deduced a trap composed of 6 places in 195 ms of which 0 ms to minimize.
[2023-03-22 04:20:24] [INFO ] Deduced a trap composed of 9 places in 294 ms of which 45 ms to minimize.
[2023-03-22 04:20:25] [INFO ] Deduced a trap composed of 4 places in 223 ms of which 0 ms to minimize.
[2023-03-22 04:20:25] [INFO ] Deduced a trap composed of 6 places in 249 ms of which 0 ms to minimize.
[2023-03-22 04:20:25] [INFO ] Deduced a trap composed of 6 places in 145 ms of which 0 ms to minimize.
[2023-03-22 04:20:26] [INFO ] Deduced a trap composed of 4 places in 222 ms of which 26 ms to minimize.
[2023-03-22 04:20:26] [INFO ] Deduced a trap composed of 5 places in 210 ms of which 1 ms to minimize.
[2023-03-22 04:20:26] [INFO ] Deduced a trap composed of 6 places in 195 ms of which 1 ms to minimize.
[2023-03-22 04:20:26] [INFO ] Deduced a trap composed of 6 places in 193 ms of which 26 ms to minimize.
[2023-03-22 04:20:27] [INFO ] Deduced a trap composed of 18 places in 157 ms of which 1 ms to minimize.
[2023-03-22 04:20:27] [INFO ] Deduced a trap composed of 6 places in 377 ms of which 1 ms to minimize.
[2023-03-22 04:20:28] [INFO ] Deduced a trap composed of 6 places in 155 ms of which 1 ms to minimize.
[2023-03-22 04:20:28] [INFO ] Deduced a trap composed of 4 places in 270 ms of which 1 ms to minimize.
[2023-03-22 04:20:28] [INFO ] Deduced a trap composed of 9 places in 323 ms of which 0 ms to minimize.
[2023-03-22 04:20:29] [INFO ] Deduced a trap composed of 12 places in 193 ms of which 0 ms to minimize.
[2023-03-22 04:20:29] [INFO ] Deduced a trap composed of 8 places in 164 ms of which 1 ms to minimize.
[2023-03-22 04:20:29] [INFO ] Deduced a trap composed of 6 places in 178 ms of which 15 ms to minimize.
[2023-03-22 04:20:29] [INFO ] Trap strengthening (SAT) tested/added 49/48 trap constraints in 17427 ms
[2023-03-22 04:20:30] [INFO ] Deduced a trap composed of 6 places in 256 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-22 04:20:30] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 04:20:30] [INFO ] After 25226ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:13
Parikh walk visited 0 properties in 2160 ms.
Support contains 21 out of 3121 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3121/3121 places, 2621/2621 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 3121 transition count 2619
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 3119 transition count 2619
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 4 place count 3119 transition count 2617
Deduced a syphon composed of 2 places in 6 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 3117 transition count 2617
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 7 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 14 place count 3114 transition count 2614
Applied a total of 14 rules in 404 ms. Remains 3114 /3121 variables (removed 7) and now considering 2614/2621 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 404 ms. Remains : 3114/3121 places, 2614/2621 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 596 ms. (steps per millisecond=16 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 190 ms. (steps per millisecond=52 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 178 ms. (steps per millisecond=56 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 161 ms. (steps per millisecond=62 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 161 ms. (steps per millisecond=62 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 155 ms. (steps per millisecond=64 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 162 ms. (steps per millisecond=61 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 156 ms. (steps per millisecond=64 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 173 ms. (steps per millisecond=57 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 185 ms. (steps per millisecond=54 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 181 ms. (steps per millisecond=55 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 172 ms. (steps per millisecond=58 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 159 ms. (steps per millisecond=62 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 159 ms. (steps per millisecond=62 ) properties (out of 13) seen :0
Interrupted probabilistic random walk after 99935 steps, run timeout after 6001 ms. (steps per millisecond=16 ) properties seen :{}
Probabilistic random walk after 99935 steps, saw 92884 distinct states, run finished after 6007 ms. (steps per millisecond=16 ) properties seen :0
Running SMT prover for 13 properties.
// Phase 1: matrix 2614 rows 3114 cols
[2023-03-22 04:20:41] [INFO ] Computed 1101 place invariants in 94 ms
[2023-03-22 04:20:42] [INFO ] [Real]Absence check using 1037 positive place invariants in 247 ms returned sat
[2023-03-22 04:20:42] [INFO ] [Real]Absence check using 1037 positive and 64 generalized place invariants in 56 ms returned sat
[2023-03-22 04:20:42] [INFO ] After 1147ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2023-03-22 04:20:44] [INFO ] [Nat]Absence check using 1037 positive place invariants in 219 ms returned sat
[2023-03-22 04:20:44] [INFO ] [Nat]Absence check using 1037 positive and 64 generalized place invariants in 29 ms returned sat
[2023-03-22 04:20:48] [INFO ] After 3681ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :13
[2023-03-22 04:20:48] [INFO ] Deduced a trap composed of 6 places in 405 ms of which 1 ms to minimize.
[2023-03-22 04:20:49] [INFO ] Deduced a trap composed of 4 places in 538 ms of which 1 ms to minimize.
[2023-03-22 04:20:50] [INFO ] Deduced a trap composed of 4 places in 428 ms of which 1 ms to minimize.
[2023-03-22 04:20:50] [INFO ] Deduced a trap composed of 4 places in 455 ms of which 13 ms to minimize.
[2023-03-22 04:20:51] [INFO ] Deduced a trap composed of 6 places in 496 ms of which 2 ms to minimize.
[2023-03-22 04:20:52] [INFO ] Deduced a trap composed of 6 places in 705 ms of which 1 ms to minimize.
[2023-03-22 04:20:52] [INFO ] Deduced a trap composed of 7 places in 604 ms of which 2 ms to minimize.
[2023-03-22 04:20:53] [INFO ] Deduced a trap composed of 4 places in 512 ms of which 2 ms to minimize.
[2023-03-22 04:20:54] [INFO ] Deduced a trap composed of 6 places in 479 ms of which 1 ms to minimize.
[2023-03-22 04:20:54] [INFO ] Deduced a trap composed of 4 places in 734 ms of which 1 ms to minimize.
[2023-03-22 04:20:55] [INFO ] Deduced a trap composed of 6 places in 490 ms of which 2 ms to minimize.
[2023-03-22 04:20:56] [INFO ] Deduced a trap composed of 6 places in 527 ms of which 1 ms to minimize.
[2023-03-22 04:20:56] [INFO ] Deduced a trap composed of 6 places in 604 ms of which 4 ms to minimize.
[2023-03-22 04:20:57] [INFO ] Deduced a trap composed of 6 places in 860 ms of which 2 ms to minimize.
[2023-03-22 04:20:58] [INFO ] Deduced a trap composed of 6 places in 668 ms of which 1 ms to minimize.
[2023-03-22 04:20:59] [INFO ] Deduced a trap composed of 4 places in 914 ms of which 51 ms to minimize.
[2023-03-22 04:21:00] [INFO ] Deduced a trap composed of 5 places in 468 ms of which 1 ms to minimize.
[2023-03-22 04:21:01] [INFO ] Deduced a trap composed of 6 places in 568 ms of which 1 ms to minimize.
[2023-03-22 04:21:01] [INFO ] Deduced a trap composed of 4 places in 675 ms of which 1 ms to minimize.
[2023-03-22 04:21:02] [INFO ] Deduced a trap composed of 4 places in 418 ms of which 1 ms to minimize.
[2023-03-22 04:21:02] [INFO ] Deduced a trap composed of 6 places in 402 ms of which 1 ms to minimize.
[2023-03-22 04:21:03] [INFO ] Deduced a trap composed of 6 places in 481 ms of which 1 ms to minimize.
[2023-03-22 04:21:04] [INFO ] Deduced a trap composed of 4 places in 575 ms of which 1 ms to minimize.
[2023-03-22 04:21:04] [INFO ] Deduced a trap composed of 4 places in 483 ms of which 1 ms to minimize.
[2023-03-22 04:21:05] [INFO ] Deduced a trap composed of 6 places in 474 ms of which 1 ms to minimize.
[2023-03-22 04:21:05] [INFO ] Deduced a trap composed of 4 places in 470 ms of which 0 ms to minimize.
[2023-03-22 04:21:06] [INFO ] Deduced a trap composed of 6 places in 374 ms of which 1 ms to minimize.
[2023-03-22 04:21:06] [INFO ] Deduced a trap composed of 5 places in 488 ms of which 1 ms to minimize.
[2023-03-22 04:21:07] [INFO ] Deduced a trap composed of 4 places in 580 ms of which 3 ms to minimize.
[2023-03-22 04:21:08] [INFO ] Deduced a trap composed of 4 places in 508 ms of which 5 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-22 04:21:08] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 04:21:08] [INFO ] After 25353ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:13
Fused 13 Parikh solutions to 12 different solutions.
Parikh walk visited 0 properties in 1640 ms.
Support contains 21 out of 3114 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3114/3114 places, 2614/2614 transitions.
Applied a total of 0 rules in 150 ms. Remains 3114 /3114 variables (removed 0) and now considering 2614/2614 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 151 ms. Remains : 3114/3114 places, 2614/2614 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3114/3114 places, 2614/2614 transitions.
Applied a total of 0 rules in 179 ms. Remains 3114 /3114 variables (removed 0) and now considering 2614/2614 (removed 0) transitions.
[2023-03-22 04:21:10] [INFO ] Invariant cache hit.
[2023-03-22 04:21:13] [INFO ] Implicit Places using invariants in 2955 ms returned []
[2023-03-22 04:21:13] [INFO ] Invariant cache hit.
[2023-03-22 04:21:20] [INFO ] Implicit Places using invariants and state equation in 6801 ms returned []
Implicit Place search using SMT with State Equation took 9773 ms to find 0 implicit places.
[2023-03-22 04:21:20] [INFO ] Redundant transitions in 159 ms returned []
[2023-03-22 04:21:20] [INFO ] Invariant cache hit.
[2023-03-22 04:21:22] [INFO ] Dead Transitions using invariants and state equation in 2077 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12241 ms. Remains : 3114/3114 places, 2614/2614 transitions.
Computed a total of 1200 stabilizing places and 1200 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((G(p1)&&p0))))'
Support contains 6 out of 6104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6104/6104 places, 5604/5604 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 6102 transition count 5602
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 6102 transition count 5602
Applied a total of 4 rules in 1883 ms. Remains 6102 /6104 variables (removed 2) and now considering 5602/5604 (removed 2) transitions.
// Phase 1: matrix 5602 rows 6102 cols
[2023-03-22 04:21:24] [INFO ] Computed 1101 place invariants in 61 ms
[2023-03-22 04:21:27] [INFO ] Implicit Places using invariants in 2919 ms returned []
[2023-03-22 04:21:27] [INFO ] Invariant cache hit.
[2023-03-22 04:21:30] [INFO ] Implicit Places using invariants and state equation in 2641 ms returned []
Implicit Place search using SMT with State Equation took 5562 ms to find 0 implicit places.
[2023-03-22 04:21:30] [INFO ] Invariant cache hit.
[2023-03-22 04:21:36] [INFO ] Dead Transitions using invariants and state equation in 5806 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6102/6104 places, 5602/5604 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13258 ms. Remains : 6102/6104 places, 5602/5604 transitions.
Stuttering acceptance computed with spot in 583 ms :[true, (NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPs-PT-100B-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p1:(AND (EQ s2399 1) (EQ s2431 1)), p0:(AND (OR (EQ s3786 0) (EQ s3821 0)) (OR (EQ s2817 0) (EQ s2841 0)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 2 ms.
FORMULA ShieldPPPs-PT-100B-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-100B-LTLFireability-01 finished in 13961 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&&G(p1)&&X(F(p0))))))'
Support contains 4 out of 6104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6104/6104 places, 5604/5604 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 6102 transition count 5602
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 6102 transition count 5602
Applied a total of 4 rules in 1857 ms. Remains 6102 /6104 variables (removed 2) and now considering 5602/5604 (removed 2) transitions.
[2023-03-22 04:21:38] [INFO ] Invariant cache hit.
[2023-03-22 04:21:41] [INFO ] Implicit Places using invariants in 2992 ms returned []
[2023-03-22 04:21:41] [INFO ] Invariant cache hit.
[2023-03-22 04:21:43] [INFO ] Implicit Places using invariants and state equation in 2368 ms returned []
Implicit Place search using SMT with State Equation took 5385 ms to find 0 implicit places.
[2023-03-22 04:21:43] [INFO ] Invariant cache hit.
[2023-03-22 04:21:49] [INFO ] Dead Transitions using invariants and state equation in 5783 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6102/6104 places, 5602/5604 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13052 ms. Remains : 6102/6104 places, 5602/5604 transitions.
Stuttering acceptance computed with spot in 243 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-100B-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}, { cond=(AND p0 p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s2039 0) (EQ s2072 0)), p1:(OR (EQ s2637 0) (EQ s2661 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 12 reset in 1942 ms.
Product exploration explored 100000 steps with 15 reset in 2091 ms.
Computed a total of 1199 stabilizing places and 1199 stable transitions
Computed a total of 1199 stabilizing places and 1199 stable transitions
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (OR (NOT p0) (NOT p1)))), (X (X (AND p0 p1))), (X (X p0)), (X (X p1)), (X (X (NOT (OR (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 556 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 325 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 299 ms. (steps per millisecond=33 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 4) 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 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 113599 steps, run timeout after 3001 ms. (steps per millisecond=37 ) properties seen :{}
Probabilistic random walk after 113599 steps, saw 111775 distinct states, run finished after 3001 ms. (steps per millisecond=37 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-22 04:21:58] [INFO ] Invariant cache hit.
[2023-03-22 04:21:59] [INFO ] After 1026ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-22 04:22:01] [INFO ] [Nat]Absence check using 1101 positive place invariants in 686 ms returned sat
[2023-03-22 04:22:08] [INFO ] After 6299ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-22 04:22:11] [INFO ] Deduced a trap composed of 18 places in 3112 ms of which 4 ms to minimize.
[2023-03-22 04:22:14] [INFO ] Deduced a trap composed of 25 places in 3109 ms of which 3 ms to minimize.
[2023-03-22 04:22:18] [INFO ] Deduced a trap composed of 22 places in 3561 ms of which 3 ms to minimize.
[2023-03-22 04:22:22] [INFO ] Deduced a trap composed of 22 places in 3443 ms of which 3 ms to minimize.
[2023-03-22 04:22:25] [INFO ] Deduced a trap composed of 16 places in 3452 ms of which 4 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-22 04:22:25] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 04:22:25] [INFO ] After 26035ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 732 ms.
Support contains 4 out of 6102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6102/6102 places, 5602/5602 transitions.
Drop transitions removed 700 transitions
Trivial Post-agglo rules discarded 700 transitions
Performed 700 trivial Post agglomeration. Transition count delta: 700
Iterating post reduction 0 with 700 rules applied. Total rules applied 700 place count 6102 transition count 4902
Reduce places removed 700 places and 0 transitions.
Iterating post reduction 1 with 700 rules applied. Total rules applied 1400 place count 5402 transition count 4902
Performed 500 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 500 Pre rules applied. Total rules applied 1400 place count 5402 transition count 4402
Deduced a syphon composed of 500 places in 20 ms
Reduce places removed 500 places and 0 transitions.
Iterating global reduction 2 with 1000 rules applied. Total rules applied 2400 place count 4902 transition count 4402
Performed 1797 Post agglomeration using F-continuation condition.Transition count delta: 1797
Deduced a syphon composed of 1797 places in 6 ms
Reduce places removed 1797 places and 0 transitions.
Iterating global reduction 2 with 3594 rules applied. Total rules applied 5994 place count 3105 transition count 2605
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 897 times.
Drop transitions removed 897 transitions
Iterating global reduction 2 with 897 rules applied. Total rules applied 6891 place count 3105 transition count 2605
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 6892 place count 3104 transition count 2604
Applied a total of 6892 rules in 1827 ms. Remains 3104 /6102 variables (removed 2998) and now considering 2604/5602 (removed 2998) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1828 ms. Remains : 3104/6102 places, 2604/5602 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 523 ms. (steps per millisecond=19 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 144 ms. (steps per millisecond=69 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 144 ms. (steps per millisecond=69 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 145 ms. (steps per millisecond=68 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 166 ms. (steps per millisecond=60 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 56142 steps, run timeout after 3002 ms. (steps per millisecond=18 ) properties seen :{}
Probabilistic random walk after 56142 steps, saw 52339 distinct states, run finished after 3002 ms. (steps per millisecond=18 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 2604 rows 3104 cols
[2023-03-22 04:22:32] [INFO ] Computed 1101 place invariants in 21 ms
[2023-03-22 04:22:33] [INFO ] After 471ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-22 04:22:33] [INFO ] [Nat]Absence check using 1048 positive place invariants in 243 ms returned sat
[2023-03-22 04:22:33] [INFO ] [Nat]Absence check using 1048 positive and 53 generalized place invariants in 28 ms returned sat
[2023-03-22 04:22:36] [INFO ] After 2306ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-22 04:22:36] [INFO ] Deduced a trap composed of 6 places in 334 ms of which 1 ms to minimize.
[2023-03-22 04:22:37] [INFO ] Deduced a trap composed of 4 places in 280 ms of which 0 ms to minimize.
[2023-03-22 04:22:37] [INFO ] Deduced a trap composed of 5 places in 298 ms of which 1 ms to minimize.
[2023-03-22 04:22:38] [INFO ] Deduced a trap composed of 4 places in 309 ms of which 1 ms to minimize.
[2023-03-22 04:22:38] [INFO ] Deduced a trap composed of 4 places in 289 ms of which 1 ms to minimize.
[2023-03-22 04:22:38] [INFO ] Deduced a trap composed of 4 places in 304 ms of which 1 ms to minimize.
[2023-03-22 04:22:39] [INFO ] Deduced a trap composed of 6 places in 314 ms of which 1 ms to minimize.
[2023-03-22 04:22:39] [INFO ] Deduced a trap composed of 6 places in 276 ms of which 1 ms to minimize.
[2023-03-22 04:22:40] [INFO ] Deduced a trap composed of 4 places in 288 ms of which 1 ms to minimize.
[2023-03-22 04:22:40] [INFO ] Deduced a trap composed of 5 places in 337 ms of which 1 ms to minimize.
[2023-03-22 04:22:40] [INFO ] Deduced a trap composed of 5 places in 348 ms of which 1 ms to minimize.
[2023-03-22 04:22:41] [INFO ] Deduced a trap composed of 6 places in 222 ms of which 1 ms to minimize.
[2023-03-22 04:22:41] [INFO ] Deduced a trap composed of 5 places in 280 ms of which 0 ms to minimize.
[2023-03-22 04:22:42] [INFO ] Deduced a trap composed of 4 places in 339 ms of which 1 ms to minimize.
[2023-03-22 04:22:42] [INFO ] Deduced a trap composed of 6 places in 337 ms of which 1 ms to minimize.
[2023-03-22 04:22:42] [INFO ] Deduced a trap composed of 6 places in 262 ms of which 0 ms to minimize.
[2023-03-22 04:22:43] [INFO ] Deduced a trap composed of 9 places in 275 ms of which 1 ms to minimize.
[2023-03-22 04:22:43] [INFO ] Deduced a trap composed of 6 places in 290 ms of which 0 ms to minimize.
[2023-03-22 04:22:44] [INFO ] Deduced a trap composed of 6 places in 269 ms of which 1 ms to minimize.
[2023-03-22 04:22:44] [INFO ] Deduced a trap composed of 4 places in 305 ms of which 10 ms to minimize.
[2023-03-22 04:22:44] [INFO ] Deduced a trap composed of 5 places in 259 ms of which 0 ms to minimize.
[2023-03-22 04:22:45] [INFO ] Deduced a trap composed of 6 places in 226 ms of which 1 ms to minimize.
[2023-03-22 04:22:45] [INFO ] Deduced a trap composed of 6 places in 278 ms of which 0 ms to minimize.
[2023-03-22 04:22:45] [INFO ] Deduced a trap composed of 4 places in 257 ms of which 1 ms to minimize.
[2023-03-22 04:22:46] [INFO ] Deduced a trap composed of 4 places in 241 ms of which 1 ms to minimize.
[2023-03-22 04:22:46] [INFO ] Deduced a trap composed of 4 places in 208 ms of which 0 ms to minimize.
[2023-03-22 04:22:46] [INFO ] Deduced a trap composed of 6 places in 310 ms of which 1 ms to minimize.
[2023-03-22 04:22:47] [INFO ] Deduced a trap composed of 6 places in 208 ms of which 0 ms to minimize.
[2023-03-22 04:22:47] [INFO ] Deduced a trap composed of 9 places in 223 ms of which 0 ms to minimize.
[2023-03-22 04:22:47] [INFO ] Deduced a trap composed of 8 places in 188 ms of which 0 ms to minimize.
[2023-03-22 04:22:48] [INFO ] Deduced a trap composed of 6 places in 270 ms of which 0 ms to minimize.
[2023-03-22 04:22:48] [INFO ] Deduced a trap composed of 6 places in 246 ms of which 1 ms to minimize.
[2023-03-22 04:22:48] [INFO ] Deduced a trap composed of 6 places in 246 ms of which 0 ms to minimize.
[2023-03-22 04:22:49] [INFO ] Deduced a trap composed of 4 places in 259 ms of which 1 ms to minimize.
[2023-03-22 04:22:49] [INFO ] Deduced a trap composed of 6 places in 233 ms of which 1 ms to minimize.
[2023-03-22 04:22:49] [INFO ] Deduced a trap composed of 6 places in 213 ms of which 5 ms to minimize.
[2023-03-22 04:22:50] [INFO ] Deduced a trap composed of 6 places in 265 ms of which 1 ms to minimize.
[2023-03-22 04:22:50] [INFO ] Deduced a trap composed of 6 places in 256 ms of which 1 ms to minimize.
[2023-03-22 04:22:50] [INFO ] Deduced a trap composed of 6 places in 263 ms of which 1 ms to minimize.
[2023-03-22 04:22:51] [INFO ] Deduced a trap composed of 6 places in 169 ms of which 0 ms to minimize.
[2023-03-22 04:22:51] [INFO ] Deduced a trap composed of 4 places in 365 ms of which 1 ms to minimize.
[2023-03-22 04:22:51] [INFO ] Deduced a trap composed of 9 places in 182 ms of which 1 ms to minimize.
[2023-03-22 04:22:52] [INFO ] Deduced a trap composed of 8 places in 176 ms of which 1 ms to minimize.
[2023-03-22 04:22:52] [INFO ] Deduced a trap composed of 6 places in 164 ms of which 0 ms to minimize.
[2023-03-22 04:22:52] [INFO ] Deduced a trap composed of 9 places in 307 ms of which 1 ms to minimize.
[2023-03-22 04:22:53] [INFO ] Deduced a trap composed of 6 places in 255 ms of which 1 ms to minimize.
[2023-03-22 04:22:53] [INFO ] Deduced a trap composed of 6 places in 252 ms of which 1 ms to minimize.
[2023-03-22 04:22:53] [INFO ] Deduced a trap composed of 6 places in 307 ms of which 0 ms to minimize.
[2023-03-22 04:22:54] [INFO ] Deduced a trap composed of 6 places in 293 ms of which 2 ms to minimize.
[2023-03-22 04:22:54] [INFO ] Deduced a trap composed of 6 places in 244 ms of which 0 ms to minimize.
[2023-03-22 04:22:54] [INFO ] Deduced a trap composed of 6 places in 235 ms of which 0 ms to minimize.
[2023-03-22 04:22:55] [INFO ] Deduced a trap composed of 5 places in 296 ms of which 1 ms to minimize.
[2023-03-22 04:22:55] [INFO ] Deduced a trap composed of 6 places in 200 ms of which 1 ms to minimize.
[2023-03-22 04:22:55] [INFO ] Deduced a trap composed of 16 places in 260 ms of which 0 ms to minimize.
[2023-03-22 04:22:56] [INFO ] Deduced a trap composed of 8 places in 212 ms of which 14 ms to minimize.
[2023-03-22 04:22:56] [INFO ] Deduced a trap composed of 7 places in 195 ms of which 0 ms to minimize.
[2023-03-22 04:22:56] [INFO ] Deduced a trap composed of 6 places in 178 ms of which 0 ms to minimize.
[2023-03-22 04:22:57] [INFO ] Deduced a trap composed of 13 places in 142 ms of which 0 ms to minimize.
[2023-03-22 04:22:57] [INFO ] Deduced a trap composed of 8 places in 224 ms of which 1 ms to minimize.
[2023-03-22 04:22:57] [INFO ] Deduced a trap composed of 6 places in 300 ms of which 1 ms to minimize.
[2023-03-22 04:22:58] [INFO ] Deduced a trap composed of 4 places in 183 ms of which 0 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-22 04:22:58] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 04:22:58] [INFO ] After 25100ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
Parikh walk visited 0 properties in 856 ms.
Support contains 4 out of 3104 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3104/3104 places, 2604/2604 transitions.
Applied a total of 0 rules in 204 ms. Remains 3104 /3104 variables (removed 0) and now considering 2604/2604 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 204 ms. Remains : 3104/3104 places, 2604/2604 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3104/3104 places, 2604/2604 transitions.
Applied a total of 0 rules in 196 ms. Remains 3104 /3104 variables (removed 0) and now considering 2604/2604 (removed 0) transitions.
[2023-03-22 04:22:59] [INFO ] Invariant cache hit.
[2023-03-22 04:23:02] [INFO ] Implicit Places using invariants in 3003 ms returned []
[2023-03-22 04:23:02] [INFO ] Invariant cache hit.
[2023-03-22 04:23:10] [INFO ] Implicit Places using invariants and state equation in 8503 ms returned []
Implicit Place search using SMT with State Equation took 11542 ms to find 0 implicit places.
[2023-03-22 04:23:11] [INFO ] Redundant transitions in 106 ms returned []
[2023-03-22 04:23:11] [INFO ] Invariant cache hit.
[2023-03-22 04:23:13] [INFO ] Dead Transitions using invariants and state equation in 2127 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13989 ms. Remains : 3104/3104 places, 2604/2604 transitions.
Applied a total of 0 rules in 187 ms. Remains 3104 /3104 variables (removed 0) and now considering 2604/2604 (removed 0) transitions.
Running SMT prover for 4 properties.
[2023-03-22 04:23:13] [INFO ] Invariant cache hit.
[2023-03-22 04:23:14] [INFO ] After 652ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-22 04:23:14] [INFO ] [Nat]Absence check using 1048 positive place invariants in 279 ms returned sat
[2023-03-22 04:23:14] [INFO ] [Nat]Absence check using 1048 positive and 53 generalized place invariants in 25 ms returned sat
[2023-03-22 04:23:18] [INFO ] After 3162ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-22 04:23:19] [INFO ] Deduced a trap composed of 4 places in 616 ms of which 1 ms to minimize.
[2023-03-22 04:23:19] [INFO ] Deduced a trap composed of 5 places in 676 ms of which 1 ms to minimize.
[2023-03-22 04:23:20] [INFO ] Deduced a trap composed of 4 places in 657 ms of which 2 ms to minimize.
[2023-03-22 04:23:21] [INFO ] Deduced a trap composed of 6 places in 657 ms of which 1 ms to minimize.
[2023-03-22 04:23:22] [INFO ] Deduced a trap composed of 5 places in 661 ms of which 1 ms to minimize.
[2023-03-22 04:23:22] [INFO ] Deduced a trap composed of 6 places in 644 ms of which 2 ms to minimize.
[2023-03-22 04:23:23] [INFO ] Deduced a trap composed of 4 places in 815 ms of which 1 ms to minimize.
[2023-03-22 04:23:24] [INFO ] Deduced a trap composed of 4 places in 542 ms of which 1 ms to minimize.
[2023-03-22 04:23:25] [INFO ] Deduced a trap composed of 5 places in 573 ms of which 2 ms to minimize.
[2023-03-22 04:23:26] [INFO ] Deduced a trap composed of 6 places in 689 ms of which 1 ms to minimize.
[2023-03-22 04:23:26] [INFO ] Deduced a trap composed of 6 places in 614 ms of which 1 ms to minimize.
[2023-03-22 04:23:27] [INFO ] Deduced a trap composed of 6 places in 587 ms of which 2 ms to minimize.
[2023-03-22 04:23:28] [INFO ] Deduced a trap composed of 4 places in 515 ms of which 1 ms to minimize.
[2023-03-22 04:23:28] [INFO ] Deduced a trap composed of 4 places in 730 ms of which 1 ms to minimize.
[2023-03-22 04:23:29] [INFO ] Deduced a trap composed of 6 places in 605 ms of which 1 ms to minimize.
[2023-03-22 04:23:30] [INFO ] Deduced a trap composed of 8 places in 605 ms of which 1 ms to minimize.
[2023-03-22 04:23:30] [INFO ] Deduced a trap composed of 5 places in 506 ms of which 1 ms to minimize.
[2023-03-22 04:23:31] [INFO ] Deduced a trap composed of 6 places in 586 ms of which 1 ms to minimize.
[2023-03-22 04:23:32] [INFO ] Deduced a trap composed of 9 places in 548 ms of which 1 ms to minimize.
[2023-03-22 04:23:32] [INFO ] Deduced a trap composed of 6 places in 469 ms of which 2 ms to minimize.
[2023-03-22 04:23:33] [INFO ] Deduced a trap composed of 4 places in 557 ms of which 1 ms to minimize.
[2023-03-22 04:23:34] [INFO ] Deduced a trap composed of 9 places in 569 ms of which 1 ms to minimize.
[2023-03-22 04:23:34] [INFO ] Deduced a trap composed of 4 places in 533 ms of which 1 ms to minimize.
[2023-03-22 04:23:35] [INFO ] Deduced a trap composed of 6 places in 575 ms of which 1 ms to minimize.
[2023-03-22 04:23:35] [INFO ] Deduced a trap composed of 9 places in 522 ms of which 1 ms to minimize.
[2023-03-22 04:23:36] [INFO ] Deduced a trap composed of 6 places in 462 ms of which 1 ms to minimize.
[2023-03-22 04:23:37] [INFO ] Deduced a trap composed of 6 places in 444 ms of which 1 ms to minimize.
[2023-03-22 04:23:37] [INFO ] Deduced a trap composed of 6 places in 439 ms of which 1 ms to minimize.
[2023-03-22 04:23:38] [INFO ] Deduced a trap composed of 4 places in 416 ms of which 0 ms to minimize.
[2023-03-22 04:23:38] [INFO ] Deduced a trap composed of 8 places in 418 ms of which 1 ms to minimize.
[2023-03-22 04:23:39] [INFO ] Deduced a trap composed of 6 places in 482 ms of which 1 ms to minimize.
[2023-03-22 04:23:39] [INFO ] Deduced a trap composed of 6 places in 434 ms of which 0 ms to minimize.
[2023-03-22 04:23:40] [INFO ] Deduced a trap composed of 6 places in 450 ms of which 1 ms to minimize.
[2023-03-22 04:23:40] [INFO ] Deduced a trap composed of 6 places in 480 ms of which 1 ms to minimize.
[2023-03-22 04:23:41] [INFO ] Deduced a trap composed of 12 places in 482 ms of which 1 ms to minimize.
[2023-03-22 04:23:42] [INFO ] Deduced a trap composed of 6 places in 504 ms of which 1 ms to minimize.
[2023-03-22 04:23:42] [INFO ] Deduced a trap composed of 23 places in 387 ms of which 0 ms to minimize.
[2023-03-22 04:23:43] [INFO ] Deduced a trap composed of 4 places in 401 ms of which 1 ms to minimize.
[2023-03-22 04:23:43] [INFO ] Deduced a trap composed of 6 places in 393 ms of which 0 ms to minimize.
[2023-03-22 04:23:44] [INFO ] Deduced a trap composed of 8 places in 351 ms of which 1 ms to minimize.
[2023-03-22 04:23:44] [INFO ] Deduced a trap composed of 17 places in 444 ms of which 1 ms to minimize.
[2023-03-22 04:23:45] [INFO ] Deduced a trap composed of 4 places in 513 ms of which 8 ms to minimize.
[2023-03-22 04:23:45] [INFO ] Deduced a trap composed of 6 places in 399 ms of which 1 ms to minimize.
[2023-03-22 04:23:46] [INFO ] Deduced a trap composed of 23 places in 355 ms of which 1 ms to minimize.
[2023-03-22 04:23:46] [INFO ] Deduced a trap composed of 28 places in 576 ms of which 1 ms to minimize.
[2023-03-22 04:23:47] [INFO ] Deduced a trap composed of 5 places in 364 ms of which 1 ms to minimize.
[2023-03-22 04:23:47] [INFO ] Deduced a trap composed of 17 places in 368 ms of which 0 ms to minimize.
[2023-03-22 04:23:48] [INFO ] Deduced a trap composed of 6 places in 381 ms of which 18 ms to minimize.
[2023-03-22 04:23:48] [INFO ] Deduced a trap composed of 4 places in 454 ms of which 0 ms to minimize.
[2023-03-22 04:23:49] [INFO ] Deduced a trap composed of 17 places in 341 ms of which 1 ms to minimize.
[2023-03-22 04:23:49] [INFO ] Deduced a trap composed of 17 places in 436 ms of which 1 ms to minimize.
[2023-03-22 04:23:50] [INFO ] Deduced a trap composed of 39 places in 398 ms of which 1 ms to minimize.
[2023-03-22 04:23:50] [INFO ] Deduced a trap composed of 34 places in 350 ms of which 0 ms to minimize.
[2023-03-22 04:23:50] [INFO ] Trap strengthening (SAT) tested/added 54/53 trap constraints in 32418 ms
[2023-03-22 04:23:51] [INFO ] After 36336ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 403 ms.
[2023-03-22 04:23:52] [INFO ] After 37975ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (OR (NOT p0) (NOT p1)))), (X (X (AND p0 p1))), (X (X p0)), (X (X p1)), (X (X (NOT (OR (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 472 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 275 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 188 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Support contains 4 out of 6102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6102/6102 places, 5602/5602 transitions.
Applied a total of 0 rules in 918 ms. Remains 6102 /6102 variables (removed 0) and now considering 5602/5602 (removed 0) transitions.
// Phase 1: matrix 5602 rows 6102 cols
[2023-03-22 04:23:53] [INFO ] Computed 1101 place invariants in 66 ms
[2023-03-22 04:23:56] [INFO ] Implicit Places using invariants in 2493 ms returned []
[2023-03-22 04:23:56] [INFO ] Invariant cache hit.
[2023-03-22 04:23:58] [INFO ] Implicit Places using invariants and state equation in 2503 ms returned []
Implicit Place search using SMT with State Equation took 5018 ms to find 0 implicit places.
[2023-03-22 04:23:58] [INFO ] Invariant cache hit.
[2023-03-22 04:24:04] [INFO ] Dead Transitions using invariants and state equation in 5343 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11296 ms. Remains : 6102/6102 places, 5602/5602 transitions.
Computed a total of 1199 stabilizing places and 1199 stable transitions
Computed a total of 1199 stabilizing places and 1199 stable transitions
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (OR (NOT p0) (NOT p1)))), (X (X (AND p0 p1))), (X (X p0)), (X (X p1)), (X (X (NOT (OR (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 346 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 266 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 441 ms. (steps per millisecond=22 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 122249 steps, run timeout after 3002 ms. (steps per millisecond=40 ) properties seen :{}
Probabilistic random walk after 122249 steps, saw 120335 distinct states, run finished after 3003 ms. (steps per millisecond=40 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-22 04:24:08] [INFO ] Invariant cache hit.
[2023-03-22 04:24:09] [INFO ] After 1002ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-22 04:24:11] [INFO ] [Nat]Absence check using 1101 positive place invariants in 900 ms returned sat
[2023-03-22 04:24:17] [INFO ] After 5804ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-22 04:24:20] [INFO ] Deduced a trap composed of 18 places in 2586 ms of which 3 ms to minimize.
[2023-03-22 04:24:23] [INFO ] Deduced a trap composed of 25 places in 2465 ms of which 3 ms to minimize.
[2023-03-22 04:24:26] [INFO ] Deduced a trap composed of 22 places in 3106 ms of which 3 ms to minimize.
[2023-03-22 04:24:29] [INFO ] Deduced a trap composed of 22 places in 3402 ms of which 4 ms to minimize.
[2023-03-22 04:24:33] [INFO ] Deduced a trap composed of 16 places in 3287 ms of which 4 ms to minimize.
[2023-03-22 04:24:36] [INFO ] Deduced a trap composed of 23 places in 2678 ms of which 3 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.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:261)
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-22 04:24:36] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 04:24:36] [INFO ] After 26588ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 1072 ms.
Support contains 4 out of 6102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6102/6102 places, 5602/5602 transitions.
Drop transitions removed 700 transitions
Trivial Post-agglo rules discarded 700 transitions
Performed 700 trivial Post agglomeration. Transition count delta: 700
Iterating post reduction 0 with 700 rules applied. Total rules applied 700 place count 6102 transition count 4902
Reduce places removed 700 places and 0 transitions.
Iterating post reduction 1 with 700 rules applied. Total rules applied 1400 place count 5402 transition count 4902
Performed 500 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 500 Pre rules applied. Total rules applied 1400 place count 5402 transition count 4402
Deduced a syphon composed of 500 places in 27 ms
Reduce places removed 500 places and 0 transitions.
Iterating global reduction 2 with 1000 rules applied. Total rules applied 2400 place count 4902 transition count 4402
Performed 1797 Post agglomeration using F-continuation condition.Transition count delta: 1797
Deduced a syphon composed of 1797 places in 7 ms
Reduce places removed 1797 places and 0 transitions.
Iterating global reduction 2 with 3594 rules applied. Total rules applied 5994 place count 3105 transition count 2605
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 897 times.
Drop transitions removed 897 transitions
Iterating global reduction 2 with 897 rules applied. Total rules applied 6891 place count 3105 transition count 2605
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 6892 place count 3104 transition count 2604
Applied a total of 6892 rules in 1703 ms. Remains 3104 /6102 variables (removed 2998) and now considering 2604/5602 (removed 2998) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1703 ms. Remains : 3104/6102 places, 2604/5602 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 320 ms. (steps per millisecond=31 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 174 ms. (steps per millisecond=57 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 182 ms. (steps per millisecond=54 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 218 ms. (steps per millisecond=45 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 35248 steps, run timeout after 3006 ms. (steps per millisecond=11 ) properties seen :{}
Probabilistic random walk after 35248 steps, saw 32562 distinct states, run finished after 3006 ms. (steps per millisecond=11 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 2604 rows 3104 cols
[2023-03-22 04:24:43] [INFO ] Computed 1101 place invariants in 28 ms
[2023-03-22 04:24:43] [INFO ] After 564ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-22 04:24:44] [INFO ] [Nat]Absence check using 1048 positive place invariants in 490 ms returned sat
[2023-03-22 04:24:44] [INFO ] [Nat]Absence check using 1048 positive and 53 generalized place invariants in 28 ms returned sat
[2023-03-22 04:24:48] [INFO ] After 3439ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-22 04:24:48] [INFO ] Deduced a trap composed of 6 places in 340 ms of which 1 ms to minimize.
[2023-03-22 04:24:49] [INFO ] Deduced a trap composed of 4 places in 298 ms of which 1 ms to minimize.
[2023-03-22 04:24:49] [INFO ] Deduced a trap composed of 5 places in 273 ms of which 0 ms to minimize.
[2023-03-22 04:24:50] [INFO ] Deduced a trap composed of 4 places in 388 ms of which 1 ms to minimize.
[2023-03-22 04:24:50] [INFO ] Deduced a trap composed of 4 places in 471 ms of which 1 ms to minimize.
[2023-03-22 04:24:51] [INFO ] Deduced a trap composed of 4 places in 296 ms of which 1 ms to minimize.
[2023-03-22 04:24:51] [INFO ] Deduced a trap composed of 6 places in 469 ms of which 1 ms to minimize.
[2023-03-22 04:24:52] [INFO ] Deduced a trap composed of 6 places in 271 ms of which 1 ms to minimize.
[2023-03-22 04:24:52] [INFO ] Deduced a trap composed of 4 places in 253 ms of which 1 ms to minimize.
[2023-03-22 04:24:52] [INFO ] Deduced a trap composed of 5 places in 219 ms of which 1 ms to minimize.
[2023-03-22 04:24:53] [INFO ] Deduced a trap composed of 5 places in 195 ms of which 1 ms to minimize.
[2023-03-22 04:24:53] [INFO ] Deduced a trap composed of 6 places in 312 ms of which 0 ms to minimize.
[2023-03-22 04:24:53] [INFO ] Deduced a trap composed of 5 places in 236 ms of which 1 ms to minimize.
[2023-03-22 04:24:54] [INFO ] Deduced a trap composed of 4 places in 259 ms of which 1 ms to minimize.
[2023-03-22 04:24:54] [INFO ] Deduced a trap composed of 6 places in 331 ms of which 1 ms to minimize.
[2023-03-22 04:24:55] [INFO ] Deduced a trap composed of 6 places in 250 ms of which 0 ms to minimize.
[2023-03-22 04:24:55] [INFO ] Deduced a trap composed of 9 places in 264 ms of which 1 ms to minimize.
[2023-03-22 04:24:55] [INFO ] Deduced a trap composed of 6 places in 208 ms of which 1 ms to minimize.
[2023-03-22 04:24:56] [INFO ] Deduced a trap composed of 6 places in 376 ms of which 0 ms to minimize.
[2023-03-22 04:24:56] [INFO ] Deduced a trap composed of 4 places in 311 ms of which 0 ms to minimize.
[2023-03-22 04:24:57] [INFO ] Deduced a trap composed of 5 places in 295 ms of which 1 ms to minimize.
[2023-03-22 04:24:57] [INFO ] Deduced a trap composed of 6 places in 307 ms of which 1 ms to minimize.
[2023-03-22 04:24:58] [INFO ] Deduced a trap composed of 6 places in 393 ms of which 2 ms to minimize.
[2023-03-22 04:24:58] [INFO ] Deduced a trap composed of 4 places in 223 ms of which 13 ms to minimize.
[2023-03-22 04:24:58] [INFO ] Deduced a trap composed of 4 places in 260 ms of which 0 ms to minimize.
[2023-03-22 04:24:58] [INFO ] Deduced a trap composed of 4 places in 228 ms of which 1 ms to minimize.
[2023-03-22 04:24:59] [INFO ] Deduced a trap composed of 6 places in 226 ms of which 0 ms to minimize.
[2023-03-22 04:24:59] [INFO ] Deduced a trap composed of 6 places in 242 ms of which 1 ms to minimize.
[2023-03-22 04:25:00] [INFO ] Deduced a trap composed of 9 places in 512 ms of which 1 ms to minimize.
[2023-03-22 04:25:00] [INFO ] Deduced a trap composed of 8 places in 264 ms of which 0 ms to minimize.
[2023-03-22 04:25:01] [INFO ] Deduced a trap composed of 6 places in 293 ms of which 0 ms to minimize.
[2023-03-22 04:25:01] [INFO ] Deduced a trap composed of 6 places in 206 ms of which 1 ms to minimize.
[2023-03-22 04:25:01] [INFO ] Deduced a trap composed of 6 places in 371 ms of which 1 ms to minimize.
[2023-03-22 04:25:02] [INFO ] Deduced a trap composed of 4 places in 210 ms of which 0 ms to minimize.
[2023-03-22 04:25:02] [INFO ] Deduced a trap composed of 6 places in 229 ms of which 1 ms to minimize.
[2023-03-22 04:25:02] [INFO ] Deduced a trap composed of 6 places in 314 ms of which 0 ms to minimize.
[2023-03-22 04:25:03] [INFO ] Deduced a trap composed of 6 places in 222 ms of which 0 ms to minimize.
[2023-03-22 04:25:03] [INFO ] Deduced a trap composed of 6 places in 210 ms of which 1 ms to minimize.
[2023-03-22 04:25:03] [INFO ] Deduced a trap composed of 6 places in 204 ms of which 0 ms to minimize.
[2023-03-22 04:25:04] [INFO ] Deduced a trap composed of 6 places in 289 ms of which 0 ms to minimize.
[2023-03-22 04:25:04] [INFO ] Deduced a trap composed of 4 places in 411 ms of which 1 ms to minimize.
[2023-03-22 04:25:05] [INFO ] Deduced a trap composed of 9 places in 290 ms of which 14 ms to minimize.
[2023-03-22 04:25:05] [INFO ] Deduced a trap composed of 8 places in 314 ms of which 14 ms to minimize.
[2023-03-22 04:25:06] [INFO ] Deduced a trap composed of 6 places in 501 ms of which 0 ms to minimize.
[2023-03-22 04:25:06] [INFO ] Deduced a trap composed of 9 places in 261 ms of which 1 ms to minimize.
[2023-03-22 04:25:07] [INFO ] Deduced a trap composed of 6 places in 344 ms of which 1 ms to minimize.
[2023-03-22 04:25:07] [INFO ] Deduced a trap composed of 6 places in 259 ms of which 0 ms to minimize.
[2023-03-22 04:25:07] [INFO ] Deduced a trap composed of 6 places in 200 ms of which 1 ms to minimize.
[2023-03-22 04:25:08] [INFO ] Deduced a trap composed of 6 places in 262 ms of which 0 ms to minimize.
[2023-03-22 04:25:08] [INFO ] Deduced a trap composed of 6 places in 209 ms of which 1 ms to minimize.
[2023-03-22 04:25:08] [INFO ] Deduced a trap composed of 6 places in 307 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:261)
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-22 04:25:08] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 04:25:08] [INFO ] After 25184ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
Parikh walk visited 0 properties in 684 ms.
Support contains 4 out of 3104 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3104/3104 places, 2604/2604 transitions.
Applied a total of 0 rules in 181 ms. Remains 3104 /3104 variables (removed 0) and now considering 2604/2604 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 181 ms. Remains : 3104/3104 places, 2604/2604 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3104/3104 places, 2604/2604 transitions.
Applied a total of 0 rules in 184 ms. Remains 3104 /3104 variables (removed 0) and now considering 2604/2604 (removed 0) transitions.
[2023-03-22 04:25:09] [INFO ] Invariant cache hit.
[2023-03-22 04:25:13] [INFO ] Implicit Places using invariants in 3066 ms returned []
[2023-03-22 04:25:13] [INFO ] Invariant cache hit.
[2023-03-22 04:25:22] [INFO ] Implicit Places using invariants and state equation in 9242 ms returned []
Implicit Place search using SMT with State Equation took 12342 ms to find 0 implicit places.
[2023-03-22 04:25:22] [INFO ] Redundant transitions in 168 ms returned []
[2023-03-22 04:25:22] [INFO ] Invariant cache hit.
[2023-03-22 04:25:24] [INFO ] Dead Transitions using invariants and state equation in 2453 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15157 ms. Remains : 3104/3104 places, 2604/2604 transitions.
Applied a total of 0 rules in 206 ms. Remains 3104 /3104 variables (removed 0) and now considering 2604/2604 (removed 0) transitions.
Running SMT prover for 4 properties.
[2023-03-22 04:25:25] [INFO ] Invariant cache hit.
[2023-03-22 04:25:25] [INFO ] After 441ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-22 04:25:26] [INFO ] [Nat]Absence check using 1048 positive place invariants in 333 ms returned sat
[2023-03-22 04:25:26] [INFO ] [Nat]Absence check using 1048 positive and 53 generalized place invariants in 17 ms returned sat
[2023-03-22 04:25:29] [INFO ] After 2406ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-22 04:25:29] [INFO ] Deduced a trap composed of 4 places in 670 ms of which 1 ms to minimize.
[2023-03-22 04:25:30] [INFO ] Deduced a trap composed of 5 places in 654 ms of which 2 ms to minimize.
[2023-03-22 04:25:31] [INFO ] Deduced a trap composed of 4 places in 700 ms of which 1 ms to minimize.
[2023-03-22 04:25:32] [INFO ] Deduced a trap composed of 6 places in 736 ms of which 12 ms to minimize.
[2023-03-22 04:25:32] [INFO ] Deduced a trap composed of 5 places in 683 ms of which 2 ms to minimize.
[2023-03-22 04:25:33] [INFO ] Deduced a trap composed of 6 places in 685 ms of which 1 ms to minimize.
[2023-03-22 04:25:34] [INFO ] Deduced a trap composed of 4 places in 631 ms of which 1 ms to minimize.
[2023-03-22 04:25:35] [INFO ] Deduced a trap composed of 4 places in 762 ms of which 1 ms to minimize.
[2023-03-22 04:25:36] [INFO ] Deduced a trap composed of 5 places in 603 ms of which 1 ms to minimize.
[2023-03-22 04:25:37] [INFO ] Deduced a trap composed of 6 places in 787 ms of which 1 ms to minimize.
[2023-03-22 04:25:37] [INFO ] Deduced a trap composed of 6 places in 763 ms of which 1 ms to minimize.
[2023-03-22 04:25:38] [INFO ] Deduced a trap composed of 6 places in 632 ms of which 2 ms to minimize.
[2023-03-22 04:25:39] [INFO ] Deduced a trap composed of 4 places in 488 ms of which 1 ms to minimize.
[2023-03-22 04:25:39] [INFO ] Deduced a trap composed of 4 places in 581 ms of which 1 ms to minimize.
[2023-03-22 04:25:40] [INFO ] Deduced a trap composed of 6 places in 603 ms of which 2 ms to minimize.
[2023-03-22 04:25:41] [INFO ] Deduced a trap composed of 8 places in 540 ms of which 2 ms to minimize.
[2023-03-22 04:25:41] [INFO ] Deduced a trap composed of 5 places in 493 ms of which 1 ms to minimize.
[2023-03-22 04:25:42] [INFO ] Deduced a trap composed of 6 places in 544 ms of which 0 ms to minimize.
[2023-03-22 04:25:43] [INFO ] Deduced a trap composed of 9 places in 584 ms of which 1 ms to minimize.
[2023-03-22 04:25:44] [INFO ] Deduced a trap composed of 6 places in 626 ms of which 1 ms to minimize.
[2023-03-22 04:25:44] [INFO ] Deduced a trap composed of 4 places in 651 ms of which 1 ms to minimize.
[2023-03-22 04:25:45] [INFO ] Deduced a trap composed of 9 places in 470 ms of which 1 ms to minimize.
[2023-03-22 04:25:45] [INFO ] Deduced a trap composed of 4 places in 427 ms of which 1 ms to minimize.
[2023-03-22 04:25:46] [INFO ] Deduced a trap composed of 6 places in 450 ms of which 1 ms to minimize.
[2023-03-22 04:25:47] [INFO ] Deduced a trap composed of 9 places in 697 ms of which 1 ms to minimize.
[2023-03-22 04:25:47] [INFO ] Deduced a trap composed of 6 places in 605 ms of which 1 ms to minimize.
[2023-03-22 04:25:48] [INFO ] Deduced a trap composed of 6 places in 587 ms of which 1 ms to minimize.
[2023-03-22 04:25:49] [INFO ] Deduced a trap composed of 6 places in 444 ms of which 1 ms to minimize.
[2023-03-22 04:25:49] [INFO ] Deduced a trap composed of 4 places in 502 ms of which 1 ms to minimize.
[2023-03-22 04:25:50] [INFO ] Deduced a trap composed of 8 places in 396 ms of which 1 ms to minimize.
[2023-03-22 04:25:50] [INFO ] Deduced a trap composed of 6 places in 513 ms of which 1 ms to minimize.
[2023-03-22 04:25:51] [INFO ] Deduced a trap composed of 6 places in 467 ms of which 0 ms to minimize.
[2023-03-22 04:25:52] [INFO ] Deduced a trap composed of 6 places in 770 ms of which 6 ms to minimize.
[2023-03-22 04:25:52] [INFO ] Deduced a trap composed of 6 places in 459 ms of which 1 ms to minimize.
[2023-03-22 04:25:53] [INFO ] Deduced a trap composed of 12 places in 789 ms of which 1 ms to minimize.
[2023-03-22 04:25:54] [INFO ] Deduced a trap composed of 6 places in 545 ms of which 1 ms to minimize.
[2023-03-22 04:25:55] [INFO ] Deduced a trap composed of 23 places in 837 ms of which 1 ms to minimize.
[2023-03-22 04:25:55] [INFO ] Deduced a trap composed of 4 places in 341 ms of which 1 ms to minimize.
[2023-03-22 04:25:56] [INFO ] Deduced a trap composed of 6 places in 375 ms of which 1 ms to minimize.
[2023-03-22 04:25:57] [INFO ] Deduced a trap composed of 8 places in 1252 ms of which 2 ms to minimize.
[2023-03-22 04:25:58] [INFO ] Deduced a trap composed of 17 places in 371 ms of which 1 ms to minimize.
[2023-03-22 04:25:58] [INFO ] Deduced a trap composed of 4 places in 370 ms of which 1 ms to minimize.
[2023-03-22 04:25:59] [INFO ] Deduced a trap composed of 6 places in 421 ms of which 0 ms to minimize.
[2023-03-22 04:25:59] [INFO ] Deduced a trap composed of 23 places in 394 ms of which 1 ms to minimize.
[2023-03-22 04:26:00] [INFO ] Deduced a trap composed of 28 places in 371 ms of which 1 ms to minimize.
[2023-03-22 04:26:00] [INFO ] Deduced a trap composed of 5 places in 316 ms of which 1 ms to minimize.
[2023-03-22 04:26:01] [INFO ] Deduced a trap composed of 17 places in 401 ms of which 0 ms to minimize.
[2023-03-22 04:26:01] [INFO ] Deduced a trap composed of 6 places in 398 ms of which 0 ms to minimize.
[2023-03-22 04:26:02] [INFO ] Deduced a trap composed of 4 places in 364 ms of which 1 ms to minimize.
[2023-03-22 04:26:02] [INFO ] Deduced a trap composed of 17 places in 314 ms of which 1 ms to minimize.
[2023-03-22 04:26:03] [INFO ] Deduced a trap composed of 17 places in 335 ms of which 1 ms to minimize.
[2023-03-22 04:26:03] [INFO ] Deduced a trap composed of 39 places in 374 ms of which 1 ms to minimize.
[2023-03-22 04:26:03] [INFO ] Deduced a trap composed of 34 places in 411 ms of which 1 ms to minimize.
[2023-03-22 04:26:04] [INFO ] Trap strengthening (SAT) tested/added 54/53 trap constraints in 35063 ms
[2023-03-22 04:26:04] [INFO ] After 38085ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 438 ms.
[2023-03-22 04:26:05] [INFO ] After 39545ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (OR (NOT p0) (NOT p1)))), (X (X (AND p0 p1))), (X (X p0)), (X (X p1)), (X (X (NOT (OR (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 440 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 301 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 217 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 282 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Product exploration explored 100000 steps with 17 reset in 1783 ms.
Product exploration explored 100000 steps with 17 reset in 2147 ms.
Applying partial POR strategy [false, false, false, true]
Stuttering acceptance computed with spot in 229 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Support contains 4 out of 6102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6102/6102 places, 5602/5602 transitions.
Performed 699 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 699 rules applied. Total rules applied 699 place count 6102 transition count 5602
Performed 203 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 203 Pre rules applied. Total rules applied 699 place count 6102 transition count 5603
Deduced a syphon composed of 902 places in 32 ms
Iterating global reduction 1 with 203 rules applied. Total rules applied 902 place count 6102 transition count 5603
Performed 2095 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2997 places in 10 ms
Iterating global reduction 1 with 2095 rules applied. Total rules applied 2997 place count 6102 transition count 5603
Renaming transitions due to excessive name length > 1024 char.
Discarding 698 places :
Symmetric choice reduction at 1 with 698 rule applications. Total rules 3695 place count 5404 transition count 4905
Deduced a syphon composed of 2299 places in 11 ms
Iterating global reduction 1 with 698 rules applied. Total rules applied 4393 place count 5404 transition count 4905
Deduced a syphon composed of 2299 places in 9 ms
Applied a total of 4393 rules in 6054 ms. Remains 5404 /6102 variables (removed 698) and now considering 4905/5602 (removed 697) transitions.
[2023-03-22 04:26:17] [INFO ] Redundant transitions in 253 ms returned []
// Phase 1: matrix 4905 rows 5404 cols
[2023-03-22 04:26:17] [INFO ] Computed 1101 place invariants in 148 ms
[2023-03-22 04:26:21] [INFO ] Dead Transitions using invariants and state equation in 4171 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5404/6102 places, 4905/5602 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10515 ms. Remains : 5404/6102 places, 4905/5602 transitions.
Support contains 4 out of 6102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6102/6102 places, 5602/5602 transitions.
Applied a total of 0 rules in 822 ms. Remains 6102 /6102 variables (removed 0) and now considering 5602/5602 (removed 0) transitions.
// Phase 1: matrix 5602 rows 6102 cols
[2023-03-22 04:26:22] [INFO ] Computed 1101 place invariants in 20 ms
[2023-03-22 04:26:22] [INFO ] Implicit Places using invariants in 694 ms returned []
[2023-03-22 04:26:22] [INFO ] Invariant cache hit.
[2023-03-22 04:26:25] [INFO ] Implicit Places using invariants and state equation in 2654 ms returned []
Implicit Place search using SMT with State Equation took 3368 ms to find 0 implicit places.
[2023-03-22 04:26:25] [INFO ] Invariant cache hit.
[2023-03-22 04:26:30] [INFO ] Dead Transitions using invariants and state equation in 4825 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9031 ms. Remains : 6102/6102 places, 5602/5602 transitions.
Treatment of property ShieldPPPs-PT-100B-LTLFireability-03 finished in 294156 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)))'
Support contains 1 out of 6104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6104/6104 places, 5604/5604 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 702 transitions
Trivial Post-agglo rules discarded 702 transitions
Performed 702 trivial Post agglomeration. Transition count delta: 702
Iterating post reduction 0 with 702 rules applied. Total rules applied 702 place count 6103 transition count 4901
Reduce places removed 702 places and 0 transitions.
Iterating post reduction 1 with 702 rules applied. Total rules applied 1404 place count 5401 transition count 4901
Performed 500 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 500 Pre rules applied. Total rules applied 1404 place count 5401 transition count 4401
Deduced a syphon composed of 500 places in 27 ms
Reduce places removed 500 places and 0 transitions.
Iterating global reduction 2 with 1000 rules applied. Total rules applied 2404 place count 4901 transition count 4401
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 2406 place count 4899 transition count 4399
Iterating global reduction 2 with 2 rules applied. Total rules applied 2408 place count 4899 transition count 4399
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2408 place count 4899 transition count 4398
Deduced a syphon composed of 1 places in 24 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 2410 place count 4898 transition count 4398
Performed 1795 Post agglomeration using F-continuation condition.Transition count delta: 1795
Deduced a syphon composed of 1795 places in 7 ms
Reduce places removed 1795 places and 0 transitions.
Iterating global reduction 2 with 3590 rules applied. Total rules applied 6000 place count 3103 transition count 2603
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 6002 place count 3101 transition count 2601
Applied a total of 6002 rules in 1929 ms. Remains 3101 /6104 variables (removed 3003) and now considering 2601/5604 (removed 3003) transitions.
// Phase 1: matrix 2601 rows 3101 cols
[2023-03-22 04:26:32] [INFO ] Computed 1101 place invariants in 16 ms
[2023-03-22 04:26:35] [INFO ] Implicit Places using invariants in 2573 ms returned []
[2023-03-22 04:26:35] [INFO ] Invariant cache hit.
[2023-03-22 04:26:40] [INFO ] Implicit Places using invariants and state equation in 5588 ms returned []
Implicit Place search using SMT with State Equation took 8169 ms to find 0 implicit places.
[2023-03-22 04:26:41] [INFO ] Redundant transitions in 117 ms returned []
[2023-03-22 04:26:41] [INFO ] Invariant cache hit.
[2023-03-22 04:26:42] [INFO ] Dead Transitions using invariants and state equation in 1662 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3101/6104 places, 2601/5604 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11897 ms. Remains : 3101/6104 places, 2601/5604 transitions.
Stuttering acceptance computed with spot in 80 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-100B-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s387 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 6762 steps with 0 reset in 148 ms.
FORMULA ShieldPPPs-PT-100B-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-100B-LTLFireability-04 finished in 12168 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&&X(p1))))'
Support contains 2 out of 6104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6104/6104 places, 5604/5604 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 6103 transition count 5603
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 6103 transition count 5603
Applied a total of 2 rules in 1605 ms. Remains 6103 /6104 variables (removed 1) and now considering 5603/5604 (removed 1) transitions.
// Phase 1: matrix 5603 rows 6103 cols
[2023-03-22 04:26:44] [INFO ] Computed 1101 place invariants in 46 ms
[2023-03-22 04:26:47] [INFO ] Implicit Places using invariants in 3171 ms returned []
[2023-03-22 04:26:47] [INFO ] Invariant cache hit.
[2023-03-22 04:26:50] [INFO ] Implicit Places using invariants and state equation in 2498 ms returned []
Implicit Place search using SMT with State Equation took 5670 ms to find 0 implicit places.
[2023-03-22 04:26:50] [INFO ] Invariant cache hit.
[2023-03-22 04:26:54] [INFO ] Dead Transitions using invariants and state equation in 4475 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6103/6104 places, 5603/5604 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11753 ms. Remains : 6103/6104 places, 5603/5604 transitions.
Stuttering acceptance computed with spot in 122 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : ShieldPPPs-PT-100B-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(NEQ s3627 1), p1:(NEQ s1831 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 3766 ms.
Product exploration explored 100000 steps with 50000 reset in 3681 ms.
Computed a total of 1199 stabilizing places and 1199 stable transitions
Computed a total of 1199 stabilizing places and 1199 stable transitions
Detected a total of 1199/6103 stabilizing places and 1199/5603 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p0 p1)
Knowledge based reduction with 8 factoid took 226 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPs-PT-100B-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPs-PT-100B-LTLFireability-05 finished in 19731 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((G(p0)||(p1&&X(p2))))))'
Support contains 4 out of 6104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6104/6104 places, 5604/5604 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 6102 transition count 5602
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 6102 transition count 5602
Applied a total of 4 rules in 1516 ms. Remains 6102 /6104 variables (removed 2) and now considering 5602/5604 (removed 2) transitions.
// Phase 1: matrix 5602 rows 6102 cols
[2023-03-22 04:27:04] [INFO ] Computed 1101 place invariants in 49 ms
[2023-03-22 04:27:07] [INFO ] Implicit Places using invariants in 3092 ms returned []
[2023-03-22 04:27:07] [INFO ] Invariant cache hit.
[2023-03-22 04:27:10] [INFO ] Implicit Places using invariants and state equation in 3180 ms returned []
Implicit Place search using SMT with State Equation took 6307 ms to find 0 implicit places.
[2023-03-22 04:27:10] [INFO ] Invariant cache hit.
[2023-03-22 04:27:15] [INFO ] Dead Transitions using invariants and state equation in 4935 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6102/6104 places, 5602/5604 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12770 ms. Remains : 6102/6104 places, 5602/5604 transitions.
Stuttering acceptance computed with spot in 190 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ShieldPPPs-PT-100B-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s2526 0) (EQ s2560 0)), p1:(OR (EQ s4242 0) (EQ s1886 0)), p2:(EQ s4242 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 7 reset in 1739 ms.
Product exploration explored 100000 steps with 7 reset in 2102 ms.
Computed a total of 1199 stabilizing places and 1199 stable transitions
Computed a total of 1199 stabilizing places and 1199 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 941 ms. Reduced automaton from 3 states, 11 edges and 3 AP (stutter sensitive) to 3 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 190 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 187 ms. (steps per millisecond=53 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2023-03-22 04:27:21] [INFO ] Invariant cache hit.
[2023-03-22 04:27:22] [INFO ] After 1308ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-22 04:27:24] [INFO ] [Nat]Absence check using 1101 positive place invariants in 817 ms returned sat
[2023-03-22 04:27:33] [INFO ] After 7744ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-22 04:27:36] [INFO ] Deduced a trap composed of 20 places in 3285 ms of which 10 ms to minimize.
[2023-03-22 04:27:40] [INFO ] Deduced a trap composed of 24 places in 3341 ms of which 4 ms to minimize.
[2023-03-22 04:27:43] [INFO ] Deduced a trap composed of 22 places in 3099 ms of which 11 ms to minimize.
[2023-03-22 04:27:47] [INFO ] Deduced a trap composed of 23 places in 3558 ms of which 11 ms to minimize.
[2023-03-22 04:27:51] [INFO ] Deduced a trap composed of 14 places in 3425 ms of which 4 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-22 04:27:51] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 04:27:51] [INFO ] After 28491ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:7
Fused 7 Parikh solutions to 5 different solutions.
Parikh walk visited 3 properties in 1492 ms.
Support contains 4 out of 6102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6102/6102 places, 5602/5602 transitions.
Drop transitions removed 701 transitions
Trivial Post-agglo rules discarded 701 transitions
Performed 701 trivial Post agglomeration. Transition count delta: 701
Iterating post reduction 0 with 701 rules applied. Total rules applied 701 place count 6102 transition count 4901
Reduce places removed 701 places and 0 transitions.
Iterating post reduction 1 with 701 rules applied. Total rules applied 1402 place count 5401 transition count 4901
Performed 499 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 499 Pre rules applied. Total rules applied 1402 place count 5401 transition count 4402
Deduced a syphon composed of 499 places in 28 ms
Reduce places removed 499 places and 0 transitions.
Iterating global reduction 2 with 998 rules applied. Total rules applied 2400 place count 4902 transition count 4402
Performed 1796 Post agglomeration using F-continuation condition.Transition count delta: 1796
Deduced a syphon composed of 1796 places in 6 ms
Reduce places removed 1796 places and 0 transitions.
Iterating global reduction 2 with 3592 rules applied. Total rules applied 5992 place count 3106 transition count 2606
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 896 times.
Drop transitions removed 896 transitions
Iterating global reduction 2 with 896 rules applied. Total rules applied 6888 place count 3106 transition count 2606
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 6889 place count 3105 transition count 2605
Applied a total of 6889 rules in 1502 ms. Remains 3105 /6102 variables (removed 2997) and now considering 2605/5602 (removed 2997) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1502 ms. Remains : 3105/6102 places, 2605/5602 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 479 ms. (steps per millisecond=20 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 227 ms. (steps per millisecond=44 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 145 ms. (steps per millisecond=68 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 42029 steps, run timeout after 3001 ms. (steps per millisecond=14 ) properties seen :{}
Probabilistic random walk after 42029 steps, saw 38122 distinct states, run finished after 3001 ms. (steps per millisecond=14 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 2605 rows 3105 cols
[2023-03-22 04:27:58] [INFO ] Computed 1101 place invariants in 22 ms
[2023-03-22 04:27:58] [INFO ] After 445ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-22 04:27:59] [INFO ] [Nat]Absence check using 1055 positive place invariants in 234 ms returned sat
[2023-03-22 04:27:59] [INFO ] [Nat]Absence check using 1055 positive and 46 generalized place invariants in 12 ms returned sat
[2023-03-22 04:28:02] [INFO ] After 2791ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-22 04:28:03] [INFO ] Deduced a trap composed of 6 places in 453 ms of which 1 ms to minimize.
[2023-03-22 04:28:03] [INFO ] Deduced a trap composed of 6 places in 498 ms of which 1 ms to minimize.
[2023-03-22 04:28:04] [INFO ] Deduced a trap composed of 5 places in 522 ms of which 1 ms to minimize.
[2023-03-22 04:28:04] [INFO ] Deduced a trap composed of 4 places in 507 ms of which 1 ms to minimize.
[2023-03-22 04:28:05] [INFO ] Deduced a trap composed of 5 places in 515 ms of which 1 ms to minimize.
[2023-03-22 04:28:06] [INFO ] Deduced a trap composed of 6 places in 479 ms of which 1 ms to minimize.
[2023-03-22 04:28:06] [INFO ] Deduced a trap composed of 6 places in 617 ms of which 1 ms to minimize.
[2023-03-22 04:28:07] [INFO ] Deduced a trap composed of 6 places in 901 ms of which 3 ms to minimize.
[2023-03-22 04:28:09] [INFO ] Deduced a trap composed of 6 places in 1056 ms of which 2 ms to minimize.
[2023-03-22 04:28:09] [INFO ] Deduced a trap composed of 5 places in 494 ms of which 1 ms to minimize.
[2023-03-22 04:28:10] [INFO ] Deduced a trap composed of 5 places in 520 ms of which 0 ms to minimize.
[2023-03-22 04:28:10] [INFO ] Deduced a trap composed of 6 places in 547 ms of which 2 ms to minimize.
[2023-03-22 04:28:11] [INFO ] Deduced a trap composed of 5 places in 486 ms of which 1 ms to minimize.
[2023-03-22 04:28:12] [INFO ] Deduced a trap composed of 5 places in 396 ms of which 1 ms to minimize.
[2023-03-22 04:28:12] [INFO ] Deduced a trap composed of 9 places in 482 ms of which 1 ms to minimize.
[2023-03-22 04:28:13] [INFO ] Deduced a trap composed of 4 places in 463 ms of which 1 ms to minimize.
[2023-03-22 04:28:13] [INFO ] Deduced a trap composed of 5 places in 568 ms of which 0 ms to minimize.
[2023-03-22 04:28:14] [INFO ] Deduced a trap composed of 8 places in 504 ms of which 2 ms to minimize.
[2023-03-22 04:28:15] [INFO ] Deduced a trap composed of 4 places in 420 ms of which 1 ms to minimize.
[2023-03-22 04:28:15] [INFO ] Deduced a trap composed of 6 places in 465 ms of which 1 ms to minimize.
[2023-03-22 04:28:16] [INFO ] Deduced a trap composed of 6 places in 375 ms of which 1 ms to minimize.
[2023-03-22 04:28:16] [INFO ] Deduced a trap composed of 11 places in 379 ms of which 1 ms to minimize.
[2023-03-22 04:28:17] [INFO ] Deduced a trap composed of 5 places in 361 ms of which 0 ms to minimize.
[2023-03-22 04:28:17] [INFO ] Deduced a trap composed of 6 places in 409 ms of which 1 ms to minimize.
[2023-03-22 04:28:17] [INFO ] Deduced a trap composed of 5 places in 359 ms of which 1 ms to minimize.
[2023-03-22 04:28:18] [INFO ] Deduced a trap composed of 8 places in 330 ms of which 1 ms to minimize.
[2023-03-22 04:28:18] [INFO ] Deduced a trap composed of 6 places in 364 ms of which 1 ms to minimize.
[2023-03-22 04:28:19] [INFO ] Deduced a trap composed of 8 places in 363 ms of which 1 ms to minimize.
[2023-03-22 04:28:20] [INFO ] Deduced a trap composed of 4 places in 450 ms of which 1 ms to minimize.
[2023-03-22 04:28:20] [INFO ] Deduced a trap composed of 6 places in 381 ms of which 1 ms to minimize.
[2023-03-22 04:28:21] [INFO ] Deduced a trap composed of 9 places in 409 ms of which 1 ms to minimize.
[2023-03-22 04:28:21] [INFO ] Deduced a trap composed of 6 places in 428 ms of which 0 ms to minimize.
[2023-03-22 04:28:22] [INFO ] Deduced a trap composed of 8 places in 360 ms of which 1 ms to minimize.
[2023-03-22 04:28:22] [INFO ] Deduced a trap composed of 5 places in 431 ms of which 2 ms to minimize.
[2023-03-22 04:28:23] [INFO ] Deduced a trap composed of 6 places in 363 ms of which 1 ms to minimize.
[2023-03-22 04:28:23] [INFO ] Deduced a trap composed of 9 places in 298 ms of which 0 ms to minimize.
[2023-03-22 04:28:23] [INFO ] Deduced a trap composed of 14 places in 385 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-22 04:28:23] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 04:28:23] [INFO ] After 25269ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 425 ms.
Support contains 4 out of 3105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3105/3105 places, 2605/2605 transitions.
Applied a total of 0 rules in 171 ms. Remains 3105 /3105 variables (removed 0) and now considering 2605/2605 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 172 ms. Remains : 3105/3105 places, 2605/2605 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3105/3105 places, 2605/2605 transitions.
Applied a total of 0 rules in 167 ms. Remains 3105 /3105 variables (removed 0) and now considering 2605/2605 (removed 0) transitions.
[2023-03-22 04:28:24] [INFO ] Invariant cache hit.
[2023-03-22 04:28:27] [INFO ] Implicit Places using invariants in 2984 ms returned []
[2023-03-22 04:28:27] [INFO ] Invariant cache hit.
[2023-03-22 04:28:34] [INFO ] Implicit Places using invariants and state equation in 6436 ms returned []
Implicit Place search using SMT with State Equation took 9426 ms to find 0 implicit places.
[2023-03-22 04:28:34] [INFO ] Redundant transitions in 64 ms returned []
[2023-03-22 04:28:34] [INFO ] Invariant cache hit.
[2023-03-22 04:28:36] [INFO ] Dead Transitions using invariants and state equation in 1937 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11614 ms. Remains : 3105/3105 places, 2605/2605 transitions.
Applied a total of 0 rules in 183 ms. Remains 3105 /3105 variables (removed 0) and now considering 2605/2605 (removed 0) transitions.
Running SMT prover for 4 properties.
[2023-03-22 04:28:36] [INFO ] Invariant cache hit.
[2023-03-22 04:28:36] [INFO ] After 568ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-22 04:28:37] [INFO ] [Nat]Absence check using 1055 positive place invariants in 258 ms returned sat
[2023-03-22 04:28:37] [INFO ] [Nat]Absence check using 1055 positive and 46 generalized place invariants in 13 ms returned sat
[2023-03-22 04:28:40] [INFO ] After 2234ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-22 04:28:40] [INFO ] Deduced a trap composed of 5 places in 503 ms of which 1 ms to minimize.
[2023-03-22 04:28:41] [INFO ] Deduced a trap composed of 4 places in 438 ms of which 1 ms to minimize.
[2023-03-22 04:28:42] [INFO ] Deduced a trap composed of 6 places in 474 ms of which 1 ms to minimize.
[2023-03-22 04:28:42] [INFO ] Deduced a trap composed of 6 places in 481 ms of which 1 ms to minimize.
[2023-03-22 04:28:43] [INFO ] Deduced a trap composed of 5 places in 498 ms of which 1 ms to minimize.
[2023-03-22 04:28:43] [INFO ] Deduced a trap composed of 6 places in 529 ms of which 1 ms to minimize.
[2023-03-22 04:28:44] [INFO ] Deduced a trap composed of 6 places in 538 ms of which 1 ms to minimize.
[2023-03-22 04:28:45] [INFO ] Deduced a trap composed of 6 places in 565 ms of which 1 ms to minimize.
[2023-03-22 04:28:46] [INFO ] Deduced a trap composed of 4 places in 666 ms of which 2 ms to minimize.
[2023-03-22 04:28:46] [INFO ] Deduced a trap composed of 4 places in 440 ms of which 1 ms to minimize.
[2023-03-22 04:28:47] [INFO ] Deduced a trap composed of 4 places in 418 ms of which 1 ms to minimize.
[2023-03-22 04:28:47] [INFO ] Deduced a trap composed of 4 places in 841 ms of which 1 ms to minimize.
[2023-03-22 04:28:48] [INFO ] Deduced a trap composed of 4 places in 486 ms of which 2 ms to minimize.
[2023-03-22 04:28:49] [INFO ] Deduced a trap composed of 4 places in 557 ms of which 1 ms to minimize.
[2023-03-22 04:28:49] [INFO ] Deduced a trap composed of 4 places in 529 ms of which 0 ms to minimize.
[2023-03-22 04:28:50] [INFO ] Deduced a trap composed of 6 places in 460 ms of which 1 ms to minimize.
[2023-03-22 04:28:51] [INFO ] Deduced a trap composed of 4 places in 370 ms of which 1 ms to minimize.
[2023-03-22 04:28:51] [INFO ] Deduced a trap composed of 4 places in 350 ms of which 1 ms to minimize.
[2023-03-22 04:28:51] [INFO ] Deduced a trap composed of 6 places in 416 ms of which 1 ms to minimize.
[2023-03-22 04:28:52] [INFO ] Deduced a trap composed of 6 places in 311 ms of which 1 ms to minimize.
[2023-03-22 04:28:52] [INFO ] Deduced a trap composed of 6 places in 268 ms of which 13 ms to minimize.
[2023-03-22 04:28:53] [INFO ] Deduced a trap composed of 5 places in 294 ms of which 1 ms to minimize.
[2023-03-22 04:28:53] [INFO ] Deduced a trap composed of 4 places in 434 ms of which 1 ms to minimize.
[2023-03-22 04:28:54] [INFO ] Deduced a trap composed of 6 places in 269 ms of which 0 ms to minimize.
[2023-03-22 04:28:54] [INFO ] Deduced a trap composed of 4 places in 280 ms of which 1 ms to minimize.
[2023-03-22 04:28:54] [INFO ] Deduced a trap composed of 6 places in 323 ms of which 1 ms to minimize.
[2023-03-22 04:28:55] [INFO ] Deduced a trap composed of 6 places in 301 ms of which 1 ms to minimize.
[2023-03-22 04:28:55] [INFO ] Deduced a trap composed of 4 places in 282 ms of which 1 ms to minimize.
[2023-03-22 04:28:55] [INFO ] Deduced a trap composed of 8 places in 244 ms of which 1 ms to minimize.
[2023-03-22 04:28:56] [INFO ] Deduced a trap composed of 6 places in 282 ms of which 0 ms to minimize.
[2023-03-22 04:28:56] [INFO ] Deduced a trap composed of 4 places in 310 ms of which 1 ms to minimize.
[2023-03-22 04:28:57] [INFO ] Deduced a trap composed of 6 places in 266 ms of which 0 ms to minimize.
[2023-03-22 04:28:57] [INFO ] Deduced a trap composed of 27 places in 239 ms of which 1 ms to minimize.
[2023-03-22 04:28:57] [INFO ] Deduced a trap composed of 8 places in 253 ms of which 0 ms to minimize.
[2023-03-22 04:28:58] [INFO ] Deduced a trap composed of 5 places in 385 ms of which 1 ms to minimize.
[2023-03-22 04:28:58] [INFO ] Deduced a trap composed of 4 places in 227 ms of which 1 ms to minimize.
[2023-03-22 04:28:59] [INFO ] Deduced a trap composed of 8 places in 266 ms of which 0 ms to minimize.
[2023-03-22 04:28:59] [INFO ] Deduced a trap composed of 6 places in 201 ms of which 1 ms to minimize.
[2023-03-22 04:28:59] [INFO ] Deduced a trap composed of 5 places in 193 ms of which 1 ms to minimize.
[2023-03-22 04:29:00] [INFO ] Deduced a trap composed of 11 places in 247 ms of which 0 ms to minimize.
[2023-03-22 04:29:00] [INFO ] Deduced a trap composed of 6 places in 187 ms of which 0 ms to minimize.
[2023-03-22 04:29:00] [INFO ] Deduced a trap composed of 9 places in 206 ms of which 0 ms to minimize.
[2023-03-22 04:29:00] [INFO ] Deduced a trap composed of 9 places in 151 ms of which 1 ms to minimize.
[2023-03-22 04:29:01] [INFO ] Deduced a trap composed of 6 places in 194 ms of which 0 ms to minimize.
[2023-03-22 04:29:01] [INFO ] Deduced a trap composed of 6 places in 139 ms of which 0 ms to minimize.
[2023-03-22 04:29:01] [INFO ] Deduced a trap composed of 6 places in 161 ms of which 1 ms to minimize.
[2023-03-22 04:29:01] [INFO ] Trap strengthening (SAT) tested/added 47/46 trap constraints in 21524 ms
[2023-03-22 04:29:02] [INFO ] Deduced a trap composed of 12 places in 284 ms of which 1 ms to minimize.
[2023-03-22 04:29:02] [INFO ] Deduced a trap composed of 7 places in 305 ms of which 2 ms to minimize.
[2023-03-22 04:29:03] [INFO ] Deduced a trap composed of 6 places in 230 ms of which 1 ms to minimize.
[2023-03-22 04:29:03] [INFO ] Deduced a trap composed of 7 places in 236 ms of which 0 ms to minimize.
[2023-03-22 04:29:03] [INFO ] Deduced a trap composed of 5 places in 226 ms of which 0 ms to minimize.
[2023-03-22 04:29:04] [INFO ] Deduced a trap composed of 14 places in 221 ms of which 1 ms to minimize.
[2023-03-22 04:29:04] [INFO ] Deduced a trap composed of 7 places in 250 ms of which 1 ms to minimize.
[2023-03-22 04:29:04] [INFO ] Deduced a trap composed of 11 places in 254 ms of which 1 ms to minimize.
[2023-03-22 04:29:05] [INFO ] Deduced a trap composed of 8 places in 206 ms of which 0 ms to minimize.
[2023-03-22 04:29:05] [INFO ] Deduced a trap composed of 5 places in 267 ms of which 1 ms to minimize.
[2023-03-22 04:29:05] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 3637 ms
[2023-03-22 04:29:06] [INFO ] Deduced a trap composed of 12 places in 561 ms of which 1 ms to minimize.
[2023-03-22 04:29:06] [INFO ] Deduced a trap composed of 4 places in 219 ms of which 0 ms to minimize.
[2023-03-22 04:29:07] [INFO ] Deduced a trap composed of 9 places in 244 ms of which 1 ms to minimize.
[2023-03-22 04:29:07] [INFO ] Deduced a trap composed of 11 places in 238 ms of which 1 ms to minimize.
[2023-03-22 04:29:07] [INFO ] Deduced a trap composed of 4 places in 287 ms of which 0 ms to minimize.
[2023-03-22 04:29:08] [INFO ] Deduced a trap composed of 8 places in 233 ms of which 1 ms to minimize.
[2023-03-22 04:29:08] [INFO ] Deduced a trap composed of 9 places in 187 ms of which 1 ms to minimize.
[2023-03-22 04:29:08] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2834 ms
[2023-03-22 04:29:08] [INFO ] After 30711ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 489 ms.
[2023-03-22 04:29:09] [INFO ] After 32333ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Knowledge obtained : [(AND p0 p1 p2), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p2) p0 (NOT p1))), (F (NOT (AND p0 p1))), (F (AND (NOT p2) p0 p1)), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 17 factoid took 974 ms. Reduced automaton from 3 states, 11 edges and 3 AP (stutter sensitive) to 3 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 205 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 191 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Support contains 4 out of 6102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6102/6102 places, 5602/5602 transitions.
Applied a total of 0 rules in 741 ms. Remains 6102 /6102 variables (removed 0) and now considering 5602/5602 (removed 0) transitions.
// Phase 1: matrix 5602 rows 6102 cols
[2023-03-22 04:29:11] [INFO ] Computed 1101 place invariants in 47 ms
[2023-03-22 04:29:14] [INFO ] Implicit Places using invariants in 2945 ms returned []
[2023-03-22 04:29:14] [INFO ] Invariant cache hit.
[2023-03-22 04:29:17] [INFO ] Implicit Places using invariants and state equation in 2597 ms returned []
Implicit Place search using SMT with State Equation took 5574 ms to find 0 implicit places.
[2023-03-22 04:29:17] [INFO ] Invariant cache hit.
[2023-03-22 04:29:21] [INFO ] Dead Transitions using invariants and state equation in 4683 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11011 ms. Remains : 6102/6102 places, 5602/5602 transitions.
Computed a total of 1199 stabilizing places and 1199 stable transitions
Computed a total of 1199 stabilizing places and 1199 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X (AND p0 p1)), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) p0 p1))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 706 ms. Reduced automaton from 3 states, 11 edges and 3 AP (stutter sensitive) to 3 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 148 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 323 ms. (steps per millisecond=30 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2023-03-22 04:29:23] [INFO ] Invariant cache hit.
[2023-03-22 04:29:24] [INFO ] After 1385ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-22 04:29:26] [INFO ] [Nat]Absence check using 1101 positive place invariants in 923 ms returned sat
[2023-03-22 04:29:33] [INFO ] After 6152ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-22 04:29:37] [INFO ] Deduced a trap composed of 20 places in 3213 ms of which 4 ms to minimize.
[2023-03-22 04:29:40] [INFO ] Deduced a trap composed of 24 places in 2798 ms of which 4 ms to minimize.
[2023-03-22 04:29:43] [INFO ] Deduced a trap composed of 22 places in 2926 ms of which 5 ms to minimize.
[2023-03-22 04:29:46] [INFO ] Deduced a trap composed of 23 places in 2767 ms of which 3 ms to minimize.
[2023-03-22 04:29:49] [INFO ] Deduced a trap composed of 14 places in 3100 ms of which 3 ms to minimize.
[2023-03-22 04:29:56] [INFO ] Deduced a trap composed of 11 places in 6922 ms of which 6 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:261)
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-22 04:29:56] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 04:29:56] [INFO ] After 31943ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:7
Fused 7 Parikh solutions to 5 different solutions.
Parikh walk visited 3 properties in 1443 ms.
Support contains 4 out of 6102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6102/6102 places, 5602/5602 transitions.
Drop transitions removed 701 transitions
Trivial Post-agglo rules discarded 701 transitions
Performed 701 trivial Post agglomeration. Transition count delta: 701
Iterating post reduction 0 with 701 rules applied. Total rules applied 701 place count 6102 transition count 4901
Reduce places removed 701 places and 0 transitions.
Iterating post reduction 1 with 701 rules applied. Total rules applied 1402 place count 5401 transition count 4901
Performed 499 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 499 Pre rules applied. Total rules applied 1402 place count 5401 transition count 4402
Deduced a syphon composed of 499 places in 20 ms
Reduce places removed 499 places and 0 transitions.
Iterating global reduction 2 with 998 rules applied. Total rules applied 2400 place count 4902 transition count 4402
Performed 1796 Post agglomeration using F-continuation condition.Transition count delta: 1796
Deduced a syphon composed of 1796 places in 7 ms
Reduce places removed 1796 places and 0 transitions.
Iterating global reduction 2 with 3592 rules applied. Total rules applied 5992 place count 3106 transition count 2606
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 896 times.
Drop transitions removed 896 transitions
Iterating global reduction 2 with 896 rules applied. Total rules applied 6888 place count 3106 transition count 2606
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 6889 place count 3105 transition count 2605
Applied a total of 6889 rules in 1439 ms. Remains 3105 /6102 variables (removed 2997) and now considering 2605/5602 (removed 2997) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1439 ms. Remains : 3105/6102 places, 2605/5602 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 490 ms. (steps per millisecond=20 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 185 ms. (steps per millisecond=54 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 162 ms. (steps per millisecond=61 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 165 ms. (steps per millisecond=60 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 164 ms. (steps per millisecond=60 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 55473 steps, run timeout after 3018 ms. (steps per millisecond=18 ) properties seen :{}
Probabilistic random walk after 55473 steps, saw 50854 distinct states, run finished after 3018 ms. (steps per millisecond=18 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 2605 rows 3105 cols
[2023-03-22 04:30:03] [INFO ] Computed 1101 place invariants in 34 ms
[2023-03-22 04:30:04] [INFO ] After 481ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-22 04:30:05] [INFO ] [Nat]Absence check using 1055 positive place invariants in 230 ms returned sat
[2023-03-22 04:30:05] [INFO ] [Nat]Absence check using 1055 positive and 46 generalized place invariants in 11 ms returned sat
[2023-03-22 04:30:07] [INFO ] After 2354ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-22 04:30:08] [INFO ] Deduced a trap composed of 6 places in 538 ms of which 1 ms to minimize.
[2023-03-22 04:30:08] [INFO ] Deduced a trap composed of 6 places in 510 ms of which 1 ms to minimize.
[2023-03-22 04:30:09] [INFO ] Deduced a trap composed of 5 places in 518 ms of which 1 ms to minimize.
[2023-03-22 04:30:10] [INFO ] Deduced a trap composed of 4 places in 515 ms of which 1 ms to minimize.
[2023-03-22 04:30:10] [INFO ] Deduced a trap composed of 5 places in 428 ms of which 1 ms to minimize.
[2023-03-22 04:30:11] [INFO ] Deduced a trap composed of 6 places in 450 ms of which 1 ms to minimize.
[2023-03-22 04:30:11] [INFO ] Deduced a trap composed of 6 places in 526 ms of which 1 ms to minimize.
[2023-03-22 04:30:12] [INFO ] Deduced a trap composed of 6 places in 425 ms of which 1 ms to minimize.
[2023-03-22 04:30:13] [INFO ] Deduced a trap composed of 6 places in 700 ms of which 1 ms to minimize.
[2023-03-22 04:30:13] [INFO ] Deduced a trap composed of 5 places in 436 ms of which 1 ms to minimize.
[2023-03-22 04:30:14] [INFO ] Deduced a trap composed of 5 places in 469 ms of which 1 ms to minimize.
[2023-03-22 04:30:14] [INFO ] Deduced a trap composed of 6 places in 456 ms of which 1 ms to minimize.
[2023-03-22 04:30:15] [INFO ] Deduced a trap composed of 5 places in 462 ms of which 1 ms to minimize.
[2023-03-22 04:30:15] [INFO ] Deduced a trap composed of 5 places in 427 ms of which 0 ms to minimize.
[2023-03-22 04:30:16] [INFO ] Deduced a trap composed of 9 places in 425 ms of which 0 ms to minimize.
[2023-03-22 04:30:16] [INFO ] Deduced a trap composed of 4 places in 383 ms of which 1 ms to minimize.
[2023-03-22 04:30:17] [INFO ] Deduced a trap composed of 5 places in 394 ms of which 1 ms to minimize.
[2023-03-22 04:30:17] [INFO ] Deduced a trap composed of 8 places in 452 ms of which 1 ms to minimize.
[2023-03-22 04:30:18] [INFO ] Deduced a trap composed of 4 places in 461 ms of which 1 ms to minimize.
[2023-03-22 04:30:18] [INFO ] Deduced a trap composed of 6 places in 345 ms of which 1 ms to minimize.
[2023-03-22 04:30:19] [INFO ] Deduced a trap composed of 6 places in 386 ms of which 1 ms to minimize.
[2023-03-22 04:30:19] [INFO ] Deduced a trap composed of 11 places in 388 ms of which 1 ms to minimize.
[2023-03-22 04:30:20] [INFO ] Deduced a trap composed of 5 places in 388 ms of which 0 ms to minimize.
[2023-03-22 04:30:20] [INFO ] Deduced a trap composed of 6 places in 374 ms of which 0 ms to minimize.
[2023-03-22 04:30:21] [INFO ] Deduced a trap composed of 5 places in 327 ms of which 1 ms to minimize.
[2023-03-22 04:30:21] [INFO ] Deduced a trap composed of 8 places in 601 ms of which 1 ms to minimize.
[2023-03-22 04:30:22] [INFO ] Deduced a trap composed of 6 places in 404 ms of which 1 ms to minimize.
[2023-03-22 04:30:22] [INFO ] Deduced a trap composed of 8 places in 364 ms of which 0 ms to minimize.
[2023-03-22 04:30:23] [INFO ] Deduced a trap composed of 4 places in 461 ms of which 1 ms to minimize.
[2023-03-22 04:30:23] [INFO ] Deduced a trap composed of 6 places in 425 ms of which 0 ms to minimize.
[2023-03-22 04:30:24] [INFO ] Deduced a trap composed of 9 places in 334 ms of which 1 ms to minimize.
[2023-03-22 04:30:24] [INFO ] Deduced a trap composed of 6 places in 358 ms of which 0 ms to minimize.
[2023-03-22 04:30:25] [INFO ] Deduced a trap composed of 8 places in 311 ms of which 0 ms to minimize.
[2023-03-22 04:30:25] [INFO ] Deduced a trap composed of 5 places in 367 ms of which 1 ms to minimize.
[2023-03-22 04:30:26] [INFO ] Deduced a trap composed of 6 places in 350 ms of which 1 ms to minimize.
[2023-03-22 04:30:26] [INFO ] Deduced a trap composed of 9 places in 373 ms of which 1 ms to minimize.
[2023-03-22 04:30:27] [INFO ] Deduced a trap composed of 14 places in 370 ms of which 1 ms to minimize.
[2023-03-22 04:30:27] [INFO ] Deduced a trap composed of 4 places in 375 ms of which 1 ms to minimize.
[2023-03-22 04:30:27] [INFO ] Deduced a trap composed of 9 places in 320 ms of which 0 ms to minimize.
[2023-03-22 04:30:28] [INFO ] Deduced a trap composed of 4 places in 330 ms of which 0 ms to minimize.
[2023-03-22 04:30:28] [INFO ] Deduced a trap composed of 6 places in 362 ms of which 1 ms to minimize.
[2023-03-22 04:30:28] [INFO ] Trap strengthening (SAT) tested/added 42/41 trap constraints in 21293 ms
[2023-03-22 04:30:29] [INFO ] Deduced a trap composed of 7 places in 293 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:261)
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-22 04:30:29] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 04:30:29] [INFO ] After 25178ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
Parikh walk visited 0 properties in 635 ms.
Support contains 4 out of 3105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3105/3105 places, 2605/2605 transitions.
Applied a total of 0 rules in 165 ms. Remains 3105 /3105 variables (removed 0) and now considering 2605/2605 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 165 ms. Remains : 3105/3105 places, 2605/2605 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3105/3105 places, 2605/2605 transitions.
Applied a total of 0 rules in 164 ms. Remains 3105 /3105 variables (removed 0) and now considering 2605/2605 (removed 0) transitions.
[2023-03-22 04:30:30] [INFO ] Invariant cache hit.
[2023-03-22 04:30:33] [INFO ] Implicit Places using invariants in 2642 ms returned []
[2023-03-22 04:30:33] [INFO ] Invariant cache hit.
[2023-03-22 04:30:39] [INFO ] Implicit Places using invariants and state equation in 6230 ms returned []
Implicit Place search using SMT with State Equation took 8898 ms to find 0 implicit places.
[2023-03-22 04:30:39] [INFO ] Redundant transitions in 64 ms returned []
[2023-03-22 04:30:39] [INFO ] Invariant cache hit.
[2023-03-22 04:30:41] [INFO ] Dead Transitions using invariants and state equation in 1874 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11025 ms. Remains : 3105/3105 places, 2605/2605 transitions.
Applied a total of 0 rules in 161 ms. Remains 3105 /3105 variables (removed 0) and now considering 2605/2605 (removed 0) transitions.
Running SMT prover for 4 properties.
[2023-03-22 04:30:41] [INFO ] Invariant cache hit.
[2023-03-22 04:30:42] [INFO ] After 564ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-22 04:30:42] [INFO ] [Nat]Absence check using 1055 positive place invariants in 230 ms returned sat
[2023-03-22 04:30:42] [INFO ] [Nat]Absence check using 1055 positive and 46 generalized place invariants in 65 ms returned sat
[2023-03-22 04:30:45] [INFO ] After 2341ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-22 04:30:46] [INFO ] Deduced a trap composed of 5 places in 507 ms of which 1 ms to minimize.
[2023-03-22 04:30:46] [INFO ] Deduced a trap composed of 4 places in 462 ms of which 1 ms to minimize.
[2023-03-22 04:30:47] [INFO ] Deduced a trap composed of 6 places in 528 ms of which 0 ms to minimize.
[2023-03-22 04:30:47] [INFO ] Deduced a trap composed of 6 places in 429 ms of which 1 ms to minimize.
[2023-03-22 04:30:48] [INFO ] Deduced a trap composed of 5 places in 442 ms of which 1 ms to minimize.
[2023-03-22 04:30:48] [INFO ] Deduced a trap composed of 6 places in 429 ms of which 1 ms to minimize.
[2023-03-22 04:30:49] [INFO ] Deduced a trap composed of 6 places in 571 ms of which 1 ms to minimize.
[2023-03-22 04:30:49] [INFO ] Deduced a trap composed of 6 places in 478 ms of which 1 ms to minimize.
[2023-03-22 04:30:50] [INFO ] Deduced a trap composed of 4 places in 404 ms of which 1 ms to minimize.
[2023-03-22 04:30:51] [INFO ] Deduced a trap composed of 4 places in 503 ms of which 1 ms to minimize.
[2023-03-22 04:30:51] [INFO ] Deduced a trap composed of 4 places in 492 ms of which 1 ms to minimize.
[2023-03-22 04:30:52] [INFO ] Deduced a trap composed of 4 places in 458 ms of which 1 ms to minimize.
[2023-03-22 04:30:52] [INFO ] Deduced a trap composed of 4 places in 342 ms of which 1 ms to minimize.
[2023-03-22 04:30:53] [INFO ] Deduced a trap composed of 4 places in 354 ms of which 1 ms to minimize.
[2023-03-22 04:30:53] [INFO ] Deduced a trap composed of 4 places in 426 ms of which 1 ms to minimize.
[2023-03-22 04:30:53] [INFO ] Deduced a trap composed of 6 places in 323 ms of which 0 ms to minimize.
[2023-03-22 04:30:54] [INFO ] Deduced a trap composed of 4 places in 319 ms of which 1 ms to minimize.
[2023-03-22 04:30:54] [INFO ] Deduced a trap composed of 4 places in 349 ms of which 1 ms to minimize.
[2023-03-22 04:30:55] [INFO ] Deduced a trap composed of 6 places in 365 ms of which 1 ms to minimize.
[2023-03-22 04:30:55] [INFO ] Deduced a trap composed of 6 places in 302 ms of which 0 ms to minimize.
[2023-03-22 04:30:56] [INFO ] Deduced a trap composed of 6 places in 289 ms of which 1 ms to minimize.
[2023-03-22 04:30:56] [INFO ] Deduced a trap composed of 5 places in 267 ms of which 1 ms to minimize.
[2023-03-22 04:30:56] [INFO ] Deduced a trap composed of 4 places in 321 ms of which 0 ms to minimize.
[2023-03-22 04:30:57] [INFO ] Deduced a trap composed of 6 places in 313 ms of which 1 ms to minimize.
[2023-03-22 04:30:57] [INFO ] Deduced a trap composed of 4 places in 306 ms of which 1 ms to minimize.
[2023-03-22 04:30:58] [INFO ] Deduced a trap composed of 6 places in 297 ms of which 2 ms to minimize.
[2023-03-22 04:30:58] [INFO ] Deduced a trap composed of 6 places in 358 ms of which 1 ms to minimize.
[2023-03-22 04:30:59] [INFO ] Deduced a trap composed of 4 places in 332 ms of which 0 ms to minimize.
[2023-03-22 04:30:59] [INFO ] Deduced a trap composed of 8 places in 365 ms of which 1 ms to minimize.
[2023-03-22 04:30:59] [INFO ] Deduced a trap composed of 6 places in 287 ms of which 1 ms to minimize.
[2023-03-22 04:31:00] [INFO ] Deduced a trap composed of 4 places in 557 ms of which 0 ms to minimize.
[2023-03-22 04:31:00] [INFO ] Deduced a trap composed of 6 places in 284 ms of which 1 ms to minimize.
[2023-03-22 04:31:01] [INFO ] Deduced a trap composed of 27 places in 245 ms of which 0 ms to minimize.
[2023-03-22 04:31:01] [INFO ] Deduced a trap composed of 8 places in 359 ms of which 1 ms to minimize.
[2023-03-22 04:31:02] [INFO ] Deduced a trap composed of 5 places in 232 ms of which 1 ms to minimize.
[2023-03-22 04:31:02] [INFO ] Deduced a trap composed of 4 places in 282 ms of which 0 ms to minimize.
[2023-03-22 04:31:02] [INFO ] Deduced a trap composed of 8 places in 208 ms of which 1 ms to minimize.
[2023-03-22 04:31:03] [INFO ] Deduced a trap composed of 6 places in 1088 ms of which 0 ms to minimize.
[2023-03-22 04:31:04] [INFO ] Deduced a trap composed of 5 places in 286 ms of which 0 ms to minimize.
[2023-03-22 04:31:04] [INFO ] Deduced a trap composed of 11 places in 286 ms of which 1 ms to minimize.
[2023-03-22 04:31:04] [INFO ] Deduced a trap composed of 6 places in 153 ms of which 0 ms to minimize.
[2023-03-22 04:31:05] [INFO ] Deduced a trap composed of 9 places in 160 ms of which 1 ms to minimize.
[2023-03-22 04:31:05] [INFO ] Deduced a trap composed of 9 places in 244 ms of which 0 ms to minimize.
[2023-03-22 04:31:05] [INFO ] Deduced a trap composed of 6 places in 221 ms of which 30 ms to minimize.
[2023-03-22 04:31:06] [INFO ] Deduced a trap composed of 6 places in 181 ms of which 1 ms to minimize.
[2023-03-22 04:31:06] [INFO ] Deduced a trap composed of 6 places in 174 ms of which 0 ms to minimize.
[2023-03-22 04:31:06] [INFO ] Trap strengthening (SAT) tested/added 47/46 trap constraints in 21191 ms
[2023-03-22 04:31:07] [INFO ] Deduced a trap composed of 12 places in 311 ms of which 1 ms to minimize.
[2023-03-22 04:31:07] [INFO ] Deduced a trap composed of 7 places in 277 ms of which 0 ms to minimize.
[2023-03-22 04:31:07] [INFO ] Deduced a trap composed of 6 places in 300 ms of which 1 ms to minimize.
[2023-03-22 04:31:08] [INFO ] Deduced a trap composed of 7 places in 209 ms of which 1 ms to minimize.
[2023-03-22 04:31:08] [INFO ] Deduced a trap composed of 5 places in 260 ms of which 1 ms to minimize.
[2023-03-22 04:31:08] [INFO ] Deduced a trap composed of 14 places in 174 ms of which 1 ms to minimize.
[2023-03-22 04:31:09] [INFO ] Deduced a trap composed of 7 places in 217 ms of which 1 ms to minimize.
[2023-03-22 04:31:09] [INFO ] Deduced a trap composed of 11 places in 225 ms of which 0 ms to minimize.
[2023-03-22 04:31:09] [INFO ] Deduced a trap composed of 8 places in 195 ms of which 1 ms to minimize.
[2023-03-22 04:31:10] [INFO ] Deduced a trap composed of 5 places in 196 ms of which 1 ms to minimize.
[2023-03-22 04:31:10] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 3433 ms
[2023-03-22 04:31:10] [INFO ] Deduced a trap composed of 12 places in 184 ms of which 0 ms to minimize.
[2023-03-22 04:31:11] [INFO ] Deduced a trap composed of 4 places in 226 ms of which 0 ms to minimize.
[2023-03-22 04:31:11] [INFO ] Deduced a trap composed of 9 places in 305 ms of which 0 ms to minimize.
[2023-03-22 04:31:11] [INFO ] Deduced a trap composed of 11 places in 249 ms of which 1 ms to minimize.
[2023-03-22 04:31:12] [INFO ] Deduced a trap composed of 4 places in 236 ms of which 1 ms to minimize.
[2023-03-22 04:31:12] [INFO ] Deduced a trap composed of 8 places in 294 ms of which 0 ms to minimize.
[2023-03-22 04:31:12] [INFO ] Deduced a trap composed of 9 places in 234 ms of which 0 ms to minimize.
[2023-03-22 04:31:13] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2595 ms
[2023-03-22 04:31:13] [INFO ] After 30170ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 445 ms.
[2023-03-22 04:31:13] [INFO ] After 31647ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Knowledge obtained : [(AND p0 p1 p2), (X (AND p0 p1)), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) p0 p1))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p2) p0 (NOT p1))), (F (NOT (AND p0 p1))), (F (AND (NOT p2) p0 p1)), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 17 factoid took 1014 ms. Reduced automaton from 3 states, 11 edges and 3 AP (stutter sensitive) to 3 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 147 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 182 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 181 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 8 reset in 1688 ms.
Product exploration explored 100000 steps with 8 reset in 2038 ms.
Support contains 4 out of 6102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6102/6102 places, 5602/5602 transitions.
Applied a total of 0 rules in 758 ms. Remains 6102 /6102 variables (removed 0) and now considering 5602/5602 (removed 0) transitions.
// Phase 1: matrix 5602 rows 6102 cols
[2023-03-22 04:31:19] [INFO ] Computed 1101 place invariants in 108 ms
[2023-03-22 04:31:22] [INFO ] Implicit Places using invariants in 2390 ms returned []
[2023-03-22 04:31:22] [INFO ] Invariant cache hit.
[2023-03-22 04:31:24] [INFO ] Implicit Places using invariants and state equation in 2109 ms returned []
Implicit Place search using SMT with State Equation took 4522 ms to find 0 implicit places.
[2023-03-22 04:31:24] [INFO ] Invariant cache hit.
[2023-03-22 04:31:28] [INFO ] Dead Transitions using invariants and state equation in 4510 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9794 ms. Remains : 6102/6102 places, 5602/5602 transitions.
Treatment of property ShieldPPPs-PT-100B-LTLFireability-06 finished in 266271 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(p0))&&(F(p1)||X(G(p2)))))'
Support contains 2 out of 6104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6104/6104 places, 5604/5604 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 6102 transition count 5602
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 6102 transition count 5602
Applied a total of 4 rules in 1524 ms. Remains 6102 /6104 variables (removed 2) and now considering 5602/5604 (removed 2) transitions.
[2023-03-22 04:31:30] [INFO ] Invariant cache hit.
[2023-03-22 04:31:33] [INFO ] Implicit Places using invariants in 2639 ms returned []
[2023-03-22 04:31:33] [INFO ] Invariant cache hit.
[2023-03-22 04:31:36] [INFO ] Implicit Places using invariants and state equation in 3180 ms returned []
Implicit Place search using SMT with State Equation took 5848 ms to find 0 implicit places.
[2023-03-22 04:31:36] [INFO ] Invariant cache hit.
[2023-03-22 04:31:40] [INFO ] Dead Transitions using invariants and state equation in 4352 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6102/6104 places, 5602/5604 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11765 ms. Remains : 6102/6104 places, 5602/5604 transitions.
Stuttering acceptance computed with spot in 206 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (NOT p0), true, (NOT p1)]
Running random walk in product with property : ShieldPPPs-PT-100B-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(EQ s4375 0), p2:(EQ s2719 1), p0:(EQ s4375 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ShieldPPPs-PT-100B-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-100B-LTLFireability-07 finished in 12046 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||G(((p1&&F(!p1)) U (!p1&&F(p2)))))))'
Support contains 3 out of 6104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6104/6104 places, 5604/5604 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 6103 transition count 5603
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 6103 transition count 5603
Applied a total of 2 rules in 1571 ms. Remains 6103 /6104 variables (removed 1) and now considering 5603/5604 (removed 1) transitions.
// Phase 1: matrix 5603 rows 6103 cols
[2023-03-22 04:31:42] [INFO ] Computed 1101 place invariants in 43 ms
[2023-03-22 04:31:45] [INFO ] Implicit Places using invariants in 3122 ms returned []
[2023-03-22 04:31:45] [INFO ] Invariant cache hit.
[2023-03-22 04:31:48] [INFO ] Implicit Places using invariants and state equation in 2664 ms returned []
Implicit Place search using SMT with State Equation took 5799 ms to find 0 implicit places.
[2023-03-22 04:31:48] [INFO ] Invariant cache hit.
[2023-03-22 04:31:52] [INFO ] Dead Transitions using invariants and state equation in 4403 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6103/6104 places, 5603/5604 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11795 ms. Remains : 6103/6104 places, 5603/5604 transitions.
Stuttering acceptance computed with spot in 245 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (NOT p2), (OR (NOT p2) p1), (OR (NOT p2) p1)]
Running random walk in product with property : ShieldPPPs-PT-100B-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 3}, { cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=p1, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 2}, { cond=p1, acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s6023 1), p1:(NEQ s3669 1), p2:(EQ s4570 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 15200 steps with 0 reset in 254 ms.
FORMULA ShieldPPPs-PT-100B-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-100B-LTLFireability-08 finished in 12342 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 3 out of 6104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6104/6104 places, 5604/5604 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 700 transitions
Trivial Post-agglo rules discarded 700 transitions
Performed 700 trivial Post agglomeration. Transition count delta: 700
Iterating post reduction 0 with 700 rules applied. Total rules applied 700 place count 6103 transition count 4903
Reduce places removed 700 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 701 rules applied. Total rules applied 1401 place count 5403 transition count 4902
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1402 place count 5402 transition count 4902
Performed 501 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 501 Pre rules applied. Total rules applied 1402 place count 5402 transition count 4401
Deduced a syphon composed of 501 places in 21 ms
Reduce places removed 501 places and 0 transitions.
Iterating global reduction 3 with 1002 rules applied. Total rules applied 2404 place count 4901 transition count 4401
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 2406 place count 4899 transition count 4399
Iterating global reduction 3 with 2 rules applied. Total rules applied 2408 place count 4899 transition count 4399
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 2408 place count 4899 transition count 4398
Deduced a syphon composed of 1 places in 19 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2410 place count 4898 transition count 4398
Performed 1793 Post agglomeration using F-continuation condition.Transition count delta: 1793
Deduced a syphon composed of 1793 places in 6 ms
Reduce places removed 1793 places and 0 transitions.
Iterating global reduction 3 with 3586 rules applied. Total rules applied 5996 place count 3105 transition count 2605
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 5997 place count 3104 transition count 2604
Applied a total of 5997 rules in 1821 ms. Remains 3104 /6104 variables (removed 3000) and now considering 2604/5604 (removed 3000) transitions.
// Phase 1: matrix 2604 rows 3104 cols
[2023-03-22 04:31:55] [INFO ] Computed 1101 place invariants in 10 ms
[2023-03-22 04:31:57] [INFO ] Implicit Places using invariants in 2105 ms returned []
[2023-03-22 04:31:57] [INFO ] Invariant cache hit.
[2023-03-22 04:32:02] [INFO ] Implicit Places using invariants and state equation in 5495 ms returned []
Implicit Place search using SMT with State Equation took 7607 ms to find 0 implicit places.
[2023-03-22 04:32:02] [INFO ] Redundant transitions in 61 ms returned []
[2023-03-22 04:32:02] [INFO ] Invariant cache hit.
[2023-03-22 04:32:05] [INFO ] Dead Transitions using invariants and state equation in 2902 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3104/6104 places, 2604/5604 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 12411 ms. Remains : 3104/6104 places, 2604/5604 transitions.
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-100B-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s2465 1) (EQ s2508 1) (EQ s3043 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 95 reset in 1799 ms.
Product exploration explored 100000 steps with 95 reset in 2087 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 192 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 90 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1122 steps, including 0 resets, run visited all 1 properties in 35 ms. (steps per millisecond=32 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 176 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 63 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
[2023-03-22 04:32:10] [INFO ] Invariant cache hit.
[2023-03-22 04:32:15] [INFO ] [Real]Absence check using 1101 positive place invariants in 1690 ms returned sat
[2023-03-22 04:32:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 04:32:25] [INFO ] [Real]Absence check using state equation in 9953 ms returned unknown
Could not prove EG (NOT p0)
Support contains 3 out of 3104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3104/3104 places, 2604/2604 transitions.
Applied a total of 0 rules in 169 ms. Remains 3104 /3104 variables (removed 0) and now considering 2604/2604 (removed 0) transitions.
[2023-03-22 04:32:25] [INFO ] Invariant cache hit.
[2023-03-22 04:32:27] [INFO ] Implicit Places using invariants in 1968 ms returned []
[2023-03-22 04:32:27] [INFO ] Invariant cache hit.
[2023-03-22 04:32:32] [INFO ] Implicit Places using invariants and state equation in 5121 ms returned []
Implicit Place search using SMT with State Equation took 7100 ms to find 0 implicit places.
[2023-03-22 04:32:32] [INFO ] Redundant transitions in 77 ms returned []
[2023-03-22 04:32:32] [INFO ] Invariant cache hit.
[2023-03-22 04:32:35] [INFO ] Dead Transitions using invariants and state equation in 2076 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9445 ms. Remains : 3104/3104 places, 2604/2604 transitions.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 183 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 132 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1077 steps, including 0 resets, run visited all 1 properties in 21 ms. (steps per millisecond=51 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 162 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 128 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
[2023-03-22 04:32:35] [INFO ] Invariant cache hit.
[2023-03-22 04:32:41] [INFO ] [Real]Absence check using 1101 positive place invariants in 1680 ms returned sat
[2023-03-22 04:32:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 04:32:50] [INFO ] [Real]Absence check using state equation in 9482 ms returned unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 130 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 96 reset in 1652 ms.
Product exploration explored 100000 steps with 96 reset in 2032 ms.
Support contains 3 out of 3104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3104/3104 places, 2604/2604 transitions.
Applied a total of 0 rules in 160 ms. Remains 3104 /3104 variables (removed 0) and now considering 2604/2604 (removed 0) transitions.
[2023-03-22 04:32:54] [INFO ] Invariant cache hit.
[2023-03-22 04:32:57] [INFO ] Implicit Places using invariants in 2704 ms returned []
[2023-03-22 04:32:57] [INFO ] Invariant cache hit.
[2023-03-22 04:33:02] [INFO ] Implicit Places using invariants and state equation in 4865 ms returned []
Implicit Place search using SMT with State Equation took 7572 ms to find 0 implicit places.
[2023-03-22 04:33:02] [INFO ] Redundant transitions in 62 ms returned []
[2023-03-22 04:33:02] [INFO ] Invariant cache hit.
[2023-03-22 04:33:03] [INFO ] Dead Transitions using invariants and state equation in 1452 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9252 ms. Remains : 3104/3104 places, 2604/2604 transitions.
Treatment of property ShieldPPPs-PT-100B-LTLFireability-10 finished in 70638 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)&&X(X(X(X(X(X(X(X(F(p1))))))))))))'
Support contains 4 out of 6104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6104/6104 places, 5604/5604 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 6102 transition count 5602
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 6102 transition count 5602
Applied a total of 4 rules in 1458 ms. Remains 6102 /6104 variables (removed 2) and now considering 5602/5604 (removed 2) transitions.
// Phase 1: matrix 5602 rows 6102 cols
[2023-03-22 04:33:05] [INFO ] Computed 1101 place invariants in 45 ms
[2023-03-22 04:33:08] [INFO ] Implicit Places using invariants in 2787 ms returned []
[2023-03-22 04:33:08] [INFO ] Invariant cache hit.
[2023-03-22 04:33:11] [INFO ] Implicit Places using invariants and state equation in 3030 ms returned []
Implicit Place search using SMT with State Equation took 5819 ms to find 0 implicit places.
[2023-03-22 04:33:11] [INFO ] Invariant cache hit.
[2023-03-22 04:33:16] [INFO ] Dead Transitions using invariants and state equation in 5324 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6102/6104 places, 5602/5604 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12606 ms. Remains : 6102/6104 places, 5602/5604 transitions.
Stuttering acceptance computed with spot in 752 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true]
Running random walk in product with property : ShieldPPPs-PT-100B-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 11}], [{ cond=(AND p0 p1), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 11}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 11}], [{ cond=p0, acceptance={} source=3 dest: 2}, { cond=(NOT p0), acceptance={} source=3 dest: 11}], [{ cond=p0, acceptance={} source=4 dest: 3}, { cond=(NOT p0), acceptance={} source=4 dest: 11}], [{ cond=p0, acceptance={} source=5 dest: 4}, { cond=(NOT p0), acceptance={} source=5 dest: 11}], [{ cond=p0, acceptance={} source=6 dest: 5}, { cond=(NOT p0), acceptance={} source=6 dest: 11}], [{ cond=p0, acceptance={} source=7 dest: 6}, { cond=(NOT p0), acceptance={} source=7 dest: 11}], [{ cond=p0, acceptance={} source=8 dest: 7}, { cond=(NOT p0), acceptance={} source=8 dest: 11}], [{ cond=p0, acceptance={} source=9 dest: 8}, { cond=(NOT p0), acceptance={} source=9 dest: 11}], [{ cond=true, acceptance={} source=10 dest: 9}], [{ cond=true, acceptance={0} source=11 dest: 11}]], initial=10, aps=[p0:(AND (EQ s668 1) (EQ s748 1)), p1:(OR (EQ s1318 0) (EQ s1320 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ShieldPPPs-PT-100B-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-100B-LTLFireability-11 finished in 13457 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((F(p0)&&X(G((F(p2)&&p1)))))))'
Support contains 5 out of 6104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6104/6104 places, 5604/5604 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 6102 transition count 5602
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 6102 transition count 5602
Applied a total of 4 rules in 1492 ms. Remains 6102 /6104 variables (removed 2) and now considering 5602/5604 (removed 2) transitions.
[2023-03-22 04:33:19] [INFO ] Invariant cache hit.
[2023-03-22 04:33:21] [INFO ] Implicit Places using invariants in 2563 ms returned []
[2023-03-22 04:33:21] [INFO ] Invariant cache hit.
[2023-03-22 04:33:24] [INFO ] Implicit Places using invariants and state equation in 2566 ms returned []
Implicit Place search using SMT with State Equation took 5149 ms to find 0 implicit places.
[2023-03-22 04:33:24] [INFO ] Invariant cache hit.
[2023-03-22 04:33:29] [INFO ] Dead Transitions using invariants and state equation in 5723 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6102/6104 places, 5602/5604 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12371 ms. Remains : 6102/6104 places, 5602/5604 transitions.
Stuttering acceptance computed with spot in 282 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (OR (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : ShieldPPPs-PT-100B-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s77 0), p1:(AND (EQ s791 1) (EQ s819 1)), p2:(AND (EQ s1508 1) (EQ s1588 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 32 reset in 1112 ms.
Stuttering criterion allowed to conclude after 60103 steps with 14 reset in 959 ms.
FORMULA ShieldPPPs-PT-100B-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-100B-LTLFireability-13 finished in 14803 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(X((p0 U p1)))))'
Support contains 2 out of 6104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6104/6104 places, 5604/5604 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 6102 transition count 5602
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 6102 transition count 5602
Applied a total of 4 rules in 1513 ms. Remains 6102 /6104 variables (removed 2) and now considering 5602/5604 (removed 2) transitions.
[2023-03-22 04:33:33] [INFO ] Invariant cache hit.
[2023-03-22 04:33:37] [INFO ] Implicit Places using invariants in 3530 ms returned []
[2023-03-22 04:33:37] [INFO ] Invariant cache hit.
[2023-03-22 04:33:40] [INFO ] Implicit Places using invariants and state equation in 3377 ms returned []
Implicit Place search using SMT with State Equation took 6918 ms to find 0 implicit places.
[2023-03-22 04:33:40] [INFO ] Invariant cache hit.
[2023-03-22 04:33:45] [INFO ] Dead Transitions using invariants and state equation in 4534 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6102/6104 places, 5602/5604 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12974 ms. Remains : 6102/6104 places, 5602/5604 transitions.
Stuttering acceptance computed with spot in 275 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Running random walk in product with property : ShieldPPPs-PT-100B-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 4}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p1:(OR (NEQ s712 1) (EQ s1891 1)), p0:(NEQ s1891 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, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 2001 ms.
Product exploration explored 100000 steps with 25000 reset in 1922 ms.
Computed a total of 1199 stabilizing places and 1199 stable transitions
Computed a total of 1199 stabilizing places and 1199 stable transitions
Knowledge obtained : [(AND p1 p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 126 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 278 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 304 ms. (steps per millisecond=32 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 161640 steps, run timeout after 3002 ms. (steps per millisecond=53 ) properties seen :{}
Probabilistic random walk after 161640 steps, saw 159233 distinct states, run finished after 3002 ms. (steps per millisecond=53 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-22 04:33:53] [INFO ] Invariant cache hit.
[2023-03-22 04:33:55] [INFO ] [Real]Absence check using 1101 positive place invariants in 1003 ms returned sat
[2023-03-22 04:33:55] [INFO ] After 1674ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2023-03-22 04:33:56] [INFO ] [Nat]Absence check using 1101 positive place invariants in 792 ms returned sat
[2023-03-22 04:34:02] [INFO ] After 5391ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2023-03-22 04:34:05] [INFO ] Deduced a trap composed of 22 places in 2937 ms of which 17 ms to minimize.
[2023-03-22 04:34:08] [INFO ] Deduced a trap composed of 20 places in 3525 ms of which 4 ms to minimize.
[2023-03-22 04:34:12] [INFO ] Deduced a trap composed of 30 places in 3110 ms of which 3 ms to minimize.
[2023-03-22 04:34:15] [INFO ] Deduced a trap composed of 35 places in 2562 ms of which 4 ms to minimize.
[2023-03-22 04:34:18] [INFO ] Deduced a trap composed of 16 places in 2951 ms of which 4 ms to minimize.
[2023-03-22 04:34:21] [INFO ] Deduced a trap composed of 25 places in 3196 ms of which 3 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.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-22 04:34:21] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 04:34:21] [INFO ] After 26374ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0 real:1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 113 ms.
Support contains 2 out of 6102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6102/6102 places, 5602/5602 transitions.
Drop transitions removed 702 transitions
Trivial Post-agglo rules discarded 702 transitions
Performed 702 trivial Post agglomeration. Transition count delta: 702
Iterating post reduction 0 with 702 rules applied. Total rules applied 702 place count 6102 transition count 4900
Reduce places removed 702 places and 0 transitions.
Iterating post reduction 1 with 702 rules applied. Total rules applied 1404 place count 5400 transition count 4900
Performed 500 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 500 Pre rules applied. Total rules applied 1404 place count 5400 transition count 4400
Deduced a syphon composed of 500 places in 31 ms
Reduce places removed 500 places and 0 transitions.
Iterating global reduction 2 with 1000 rules applied. Total rules applied 2404 place count 4900 transition count 4400
Performed 1798 Post agglomeration using F-continuation condition.Transition count delta: 1798
Deduced a syphon composed of 1798 places in 6 ms
Reduce places removed 1798 places and 0 transitions.
Iterating global reduction 2 with 3596 rules applied. Total rules applied 6000 place count 3102 transition count 2602
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 896 times.
Drop transitions removed 896 transitions
Iterating global reduction 2 with 896 rules applied. Total rules applied 6896 place count 3102 transition count 2602
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 6897 place count 3101 transition count 2601
Applied a total of 6897 rules in 1563 ms. Remains 3101 /6102 variables (removed 3001) and now considering 2601/5602 (removed 3001) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1563 ms. Remains : 3101/6102 places, 2601/5602 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 178 ms. (steps per millisecond=56 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 98442 steps, run timeout after 3001 ms. (steps per millisecond=32 ) properties seen :{}
Probabilistic random walk after 98442 steps, saw 92419 distinct states, run finished after 3002 ms. (steps per millisecond=32 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2601 rows 3101 cols
[2023-03-22 04:34:26] [INFO ] Computed 1101 place invariants in 22 ms
[2023-03-22 04:34:27] [INFO ] [Real]Absence check using 1052 positive place invariants in 235 ms returned sat
[2023-03-22 04:34:27] [INFO ] [Real]Absence check using 1052 positive and 49 generalized place invariants in 148 ms returned sat
[2023-03-22 04:34:27] [INFO ] After 785ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 04:34:28] [INFO ] [Nat]Absence check using 1052 positive place invariants in 742 ms returned sat
[2023-03-22 04:34:28] [INFO ] [Nat]Absence check using 1052 positive and 49 generalized place invariants in 14 ms returned sat
[2023-03-22 04:34:31] [INFO ] After 2514ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 04:34:31] [INFO ] Deduced a trap composed of 6 places in 374 ms of which 1 ms to minimize.
[2023-03-22 04:34:32] [INFO ] Deduced a trap composed of 5 places in 373 ms of which 12 ms to minimize.
[2023-03-22 04:34:32] [INFO ] Deduced a trap composed of 4 places in 390 ms of which 2 ms to minimize.
[2023-03-22 04:34:32] [INFO ] Deduced a trap composed of 4 places in 301 ms of which 0 ms to minimize.
[2023-03-22 04:34:33] [INFO ] Deduced a trap composed of 14 places in 309 ms of which 0 ms to minimize.
[2023-03-22 04:34:33] [INFO ] Deduced a trap composed of 4 places in 330 ms of which 1 ms to minimize.
[2023-03-22 04:34:34] [INFO ] Deduced a trap composed of 4 places in 298 ms of which 1 ms to minimize.
[2023-03-22 04:34:34] [INFO ] Deduced a trap composed of 9 places in 258 ms of which 0 ms to minimize.
[2023-03-22 04:34:34] [INFO ] Deduced a trap composed of 4 places in 256 ms of which 1 ms to minimize.
[2023-03-22 04:34:35] [INFO ] Deduced a trap composed of 4 places in 330 ms of which 0 ms to minimize.
[2023-03-22 04:34:35] [INFO ] Deduced a trap composed of 5 places in 272 ms of which 0 ms to minimize.
[2023-03-22 04:34:36] [INFO ] Deduced a trap composed of 6 places in 309 ms of which 1 ms to minimize.
[2023-03-22 04:34:36] [INFO ] Deduced a trap composed of 6 places in 283 ms of which 1 ms to minimize.
[2023-03-22 04:34:37] [INFO ] Deduced a trap composed of 4 places in 300 ms of which 0 ms to minimize.
[2023-03-22 04:34:37] [INFO ] Deduced a trap composed of 5 places in 299 ms of which 0 ms to minimize.
[2023-03-22 04:34:38] [INFO ] Deduced a trap composed of 5 places in 245 ms of which 1 ms to minimize.
[2023-03-22 04:34:38] [INFO ] Deduced a trap composed of 6 places in 220 ms of which 0 ms to minimize.
[2023-03-22 04:34:38] [INFO ] Deduced a trap composed of 6 places in 263 ms of which 0 ms to minimize.
[2023-03-22 04:34:39] [INFO ] Deduced a trap composed of 8 places in 274 ms of which 1 ms to minimize.
[2023-03-22 04:34:39] [INFO ] Deduced a trap composed of 6 places in 246 ms of which 1 ms to minimize.
[2023-03-22 04:34:40] [INFO ] Deduced a trap composed of 4 places in 860 ms of which 1 ms to minimize.
[2023-03-22 04:34:40] [INFO ] Deduced a trap composed of 6 places in 212 ms of which 0 ms to minimize.
[2023-03-22 04:34:41] [INFO ] Deduced a trap composed of 5 places in 182 ms of which 1 ms to minimize.
[2023-03-22 04:34:41] [INFO ] Deduced a trap composed of 5 places in 205 ms of which 1 ms to minimize.
[2023-03-22 04:34:41] [INFO ] Deduced a trap composed of 4 places in 212 ms of which 0 ms to minimize.
[2023-03-22 04:34:41] [INFO ] Deduced a trap composed of 6 places in 173 ms of which 0 ms to minimize.
[2023-03-22 04:34:42] [INFO ] Deduced a trap composed of 8 places in 162 ms of which 0 ms to minimize.
[2023-03-22 04:34:42] [INFO ] Deduced a trap composed of 5 places in 125 ms of which 0 ms to minimize.
[2023-03-22 04:34:42] [INFO ] Deduced a trap composed of 6 places in 268 ms of which 0 ms to minimize.
[2023-03-22 04:34:43] [INFO ] Deduced a trap composed of 9 places in 242 ms of which 0 ms to minimize.
[2023-03-22 04:34:43] [INFO ] Deduced a trap composed of 4 places in 176 ms of which 0 ms to minimize.
[2023-03-22 04:34:43] [INFO ] Deduced a trap composed of 6 places in 277 ms of which 1 ms to minimize.
[2023-03-22 04:34:43] [INFO ] Deduced a trap composed of 12 places in 145 ms of which 1 ms to minimize.
[2023-03-22 04:34:44] [INFO ] Deduced a trap composed of 11 places in 131 ms of which 1 ms to minimize.
[2023-03-22 04:34:44] [INFO ] Deduced a trap composed of 4 places in 180 ms of which 0 ms to minimize.
[2023-03-22 04:34:44] [INFO ] Deduced a trap composed of 6 places in 159 ms of which 0 ms to minimize.
[2023-03-22 04:34:44] [INFO ] Deduced a trap composed of 11 places in 146 ms of which 1 ms to minimize.
[2023-03-22 04:34:45] [INFO ] Deduced a trap composed of 17 places in 128 ms of which 1 ms to minimize.
[2023-03-22 04:34:45] [INFO ] Trap strengthening (SAT) tested/added 39/38 trap constraints in 14142 ms
[2023-03-22 04:34:45] [INFO ] After 16719ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 111 ms.
[2023-03-22 04:34:45] [INFO ] After 18009ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 308 ms.
Support contains 2 out of 3101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3101/3101 places, 2601/2601 transitions.
Applied a total of 0 rules in 180 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 180 ms. Remains : 3101/3101 places, 2601/2601 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3101/3101 places, 2601/2601 transitions.
Applied a total of 0 rules in 184 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
[2023-03-22 04:34:46] [INFO ] Invariant cache hit.
[2023-03-22 04:34:49] [INFO ] Implicit Places using invariants in 3420 ms returned []
[2023-03-22 04:34:49] [INFO ] Invariant cache hit.
[2023-03-22 04:34:57] [INFO ] Implicit Places using invariants and state equation in 7787 ms returned []
Implicit Place search using SMT with State Equation took 11224 ms to find 0 implicit places.
[2023-03-22 04:34:57] [INFO ] Redundant transitions in 64 ms returned []
[2023-03-22 04:34:57] [INFO ] Invariant cache hit.
[2023-03-22 04:35:01] [INFO ] Dead Transitions using invariants and state equation in 4385 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15896 ms. Remains : 3101/3101 places, 2601/2601 transitions.
Applied a total of 0 rules in 176 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-22 04:35:02] [INFO ] Invariant cache hit.
[2023-03-22 04:35:03] [INFO ] [Real]Absence check using 1052 positive place invariants in 1079 ms returned sat
[2023-03-22 04:35:03] [INFO ] [Real]Absence check using 1052 positive and 49 generalized place invariants in 13 ms returned sat
[2023-03-22 04:35:03] [INFO ] After 1591ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 04:35:04] [INFO ] [Nat]Absence check using 1052 positive place invariants in 257 ms returned sat
[2023-03-22 04:35:04] [INFO ] [Nat]Absence check using 1052 positive and 49 generalized place invariants in 18 ms returned sat
[2023-03-22 04:35:07] [INFO ] After 2960ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 04:35:07] [INFO ] Deduced a trap composed of 5 places in 313 ms of which 1 ms to minimize.
[2023-03-22 04:35:08] [INFO ] Deduced a trap composed of 4 places in 369 ms of which 0 ms to minimize.
[2023-03-22 04:35:08] [INFO ] Deduced a trap composed of 6 places in 300 ms of which 1 ms to minimize.
[2023-03-22 04:35:09] [INFO ] Deduced a trap composed of 5 places in 352 ms of which 1 ms to minimize.
[2023-03-22 04:35:09] [INFO ] Deduced a trap composed of 8 places in 260 ms of which 1 ms to minimize.
[2023-03-22 04:35:09] [INFO ] Deduced a trap composed of 6 places in 277 ms of which 1 ms to minimize.
[2023-03-22 04:35:10] [INFO ] Deduced a trap composed of 9 places in 230 ms of which 1 ms to minimize.
[2023-03-22 04:35:10] [INFO ] Deduced a trap composed of 7 places in 332 ms of which 1 ms to minimize.
[2023-03-22 04:35:10] [INFO ] Deduced a trap composed of 5 places in 273 ms of which 1 ms to minimize.
[2023-03-22 04:35:11] [INFO ] Deduced a trap composed of 6 places in 209 ms of which 1 ms to minimize.
[2023-03-22 04:35:11] [INFO ] Deduced a trap composed of 4 places in 236 ms of which 1 ms to minimize.
[2023-03-22 04:35:12] [INFO ] Deduced a trap composed of 4 places in 422 ms of which 1 ms to minimize.
[2023-03-22 04:35:12] [INFO ] Deduced a trap composed of 6 places in 356 ms of which 1 ms to minimize.
[2023-03-22 04:35:13] [INFO ] Deduced a trap composed of 8 places in 496 ms of which 2 ms to minimize.
[2023-03-22 04:35:13] [INFO ] Deduced a trap composed of 11 places in 326 ms of which 0 ms to minimize.
[2023-03-22 04:35:13] [INFO ] Deduced a trap composed of 6 places in 203 ms of which 0 ms to minimize.
[2023-03-22 04:35:14] [INFO ] Deduced a trap composed of 6 places in 185 ms of which 1 ms to minimize.
[2023-03-22 04:35:14] [INFO ] Deduced a trap composed of 6 places in 154 ms of which 1 ms to minimize.
[2023-03-22 04:35:14] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 7269 ms
[2023-03-22 04:35:14] [INFO ] After 10289ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 103 ms.
[2023-03-22 04:35:14] [INFO ] After 11108ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), true, (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 198 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 197 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 203 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Support contains 2 out of 6102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6102/6102 places, 5602/5602 transitions.
Applied a total of 0 rules in 710 ms. Remains 6102 /6102 variables (removed 0) and now considering 5602/5602 (removed 0) transitions.
// Phase 1: matrix 5602 rows 6102 cols
[2023-03-22 04:35:16] [INFO ] Computed 1101 place invariants in 55 ms
[2023-03-22 04:35:18] [INFO ] Implicit Places using invariants in 2631 ms returned []
[2023-03-22 04:35:18] [INFO ] Invariant cache hit.
[2023-03-22 04:35:21] [INFO ] Implicit Places using invariants and state equation in 2394 ms returned []
Implicit Place search using SMT with State Equation took 5051 ms to find 0 implicit places.
[2023-03-22 04:35:21] [INFO ] Invariant cache hit.
[2023-03-22 04:35:27] [INFO ] Dead Transitions using invariants and state equation in 6257 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12032 ms. Remains : 6102/6102 places, 5602/5602 transitions.
Computed a total of 1199 stabilizing places and 1199 stable transitions
Computed a total of 1199 stabilizing places and 1199 stable transitions
Knowledge obtained : [p1, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 193 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 352 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 212057 steps, run timeout after 3001 ms. (steps per millisecond=70 ) properties seen :{}
Probabilistic random walk after 212057 steps, saw 207314 distinct states, run finished after 3001 ms. (steps per millisecond=70 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 04:35:31] [INFO ] Invariant cache hit.
[2023-03-22 04:35:33] [INFO ] [Real]Absence check using 1101 positive place invariants in 925 ms returned sat
[2023-03-22 04:35:38] [INFO ] After 7323ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 04:35:40] [INFO ] [Nat]Absence check using 1101 positive place invariants in 937 ms returned sat
[2023-03-22 04:35:46] [INFO ] After 5857ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 04:35:49] [INFO ] Deduced a trap composed of 27 places in 3034 ms of which 4 ms to minimize.
[2023-03-22 04:35:52] [INFO ] Deduced a trap composed of 20 places in 3245 ms of which 3 ms to minimize.
[2023-03-22 04:35:56] [INFO ] Deduced a trap composed of 25 places in 3084 ms of which 4 ms to minimize.
[2023-03-22 04:35:59] [INFO ] Deduced a trap composed of 21 places in 3368 ms of which 4 ms to minimize.
[2023-03-22 04:36:03] [INFO ] Deduced a trap composed of 14 places in 3013 ms of which 4 ms to minimize.
[2023-03-22 04:36:06] [INFO ] Deduced a trap composed of 24 places in 3437 ms of which 5 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:261)
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-22 04:36:06] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 04:36:06] [INFO ] After 28053ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 123 ms.
Support contains 2 out of 6102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6102/6102 places, 5602/5602 transitions.
Drop transitions removed 702 transitions
Trivial Post-agglo rules discarded 702 transitions
Performed 702 trivial Post agglomeration. Transition count delta: 702
Iterating post reduction 0 with 702 rules applied. Total rules applied 702 place count 6102 transition count 4900
Reduce places removed 702 places and 0 transitions.
Iterating post reduction 1 with 702 rules applied. Total rules applied 1404 place count 5400 transition count 4900
Performed 500 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 500 Pre rules applied. Total rules applied 1404 place count 5400 transition count 4400
Deduced a syphon composed of 500 places in 31 ms
Reduce places removed 500 places and 0 transitions.
Iterating global reduction 2 with 1000 rules applied. Total rules applied 2404 place count 4900 transition count 4400
Performed 1798 Post agglomeration using F-continuation condition.Transition count delta: 1798
Deduced a syphon composed of 1798 places in 7 ms
Reduce places removed 1798 places and 0 transitions.
Iterating global reduction 2 with 3596 rules applied. Total rules applied 6000 place count 3102 transition count 2602
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 896 times.
Drop transitions removed 896 transitions
Iterating global reduction 2 with 896 rules applied. Total rules applied 6896 place count 3102 transition count 2602
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 6897 place count 3101 transition count 2601
Applied a total of 6897 rules in 1640 ms. Remains 3101 /6102 variables (removed 3001) and now considering 2601/5602 (removed 3001) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1640 ms. Remains : 3101/6102 places, 2601/5602 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 186 ms. (steps per millisecond=53 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 98780 steps, run timeout after 3001 ms. (steps per millisecond=32 ) properties seen :{}
Probabilistic random walk after 98780 steps, saw 92748 distinct states, run finished after 3001 ms. (steps per millisecond=32 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2601 rows 3101 cols
[2023-03-22 04:36:11] [INFO ] Computed 1101 place invariants in 24 ms
[2023-03-22 04:36:12] [INFO ] [Real]Absence check using 1052 positive place invariants in 484 ms returned sat
[2023-03-22 04:36:12] [INFO ] [Real]Absence check using 1052 positive and 49 generalized place invariants in 12 ms returned sat
[2023-03-22 04:36:12] [INFO ] After 1064ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 04:36:13] [INFO ] [Nat]Absence check using 1052 positive place invariants in 225 ms returned sat
[2023-03-22 04:36:13] [INFO ] [Nat]Absence check using 1052 positive and 49 generalized place invariants in 14 ms returned sat
[2023-03-22 04:36:15] [INFO ] After 2461ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 04:36:16] [INFO ] Deduced a trap composed of 4 places in 438 ms of which 1 ms to minimize.
[2023-03-22 04:36:16] [INFO ] Deduced a trap composed of 6 places in 371 ms of which 1 ms to minimize.
[2023-03-22 04:36:17] [INFO ] Deduced a trap composed of 6 places in 486 ms of which 1 ms to minimize.
[2023-03-22 04:36:17] [INFO ] Deduced a trap composed of 6 places in 306 ms of which 1 ms to minimize.
[2023-03-22 04:36:18] [INFO ] Deduced a trap composed of 6 places in 307 ms of which 0 ms to minimize.
[2023-03-22 04:36:18] [INFO ] Deduced a trap composed of 6 places in 303 ms of which 1 ms to minimize.
[2023-03-22 04:36:19] [INFO ] Deduced a trap composed of 5 places in 320 ms of which 1 ms to minimize.
[2023-03-22 04:36:19] [INFO ] Deduced a trap composed of 4 places in 270 ms of which 0 ms to minimize.
[2023-03-22 04:36:19] [INFO ] Deduced a trap composed of 6 places in 306 ms of which 1 ms to minimize.
[2023-03-22 04:36:20] [INFO ] Deduced a trap composed of 5 places in 272 ms of which 0 ms to minimize.
[2023-03-22 04:36:20] [INFO ] Deduced a trap composed of 6 places in 247 ms of which 1 ms to minimize.
[2023-03-22 04:36:21] [INFO ] Deduced a trap composed of 4 places in 302 ms of which 1 ms to minimize.
[2023-03-22 04:36:21] [INFO ] Deduced a trap composed of 9 places in 264 ms of which 1 ms to minimize.
[2023-03-22 04:36:21] [INFO ] Deduced a trap composed of 4 places in 334 ms of which 0 ms to minimize.
[2023-03-22 04:36:22] [INFO ] Deduced a trap composed of 5 places in 397 ms of which 1 ms to minimize.
[2023-03-22 04:36:22] [INFO ] Deduced a trap composed of 6 places in 264 ms of which 0 ms to minimize.
[2023-03-22 04:36:23] [INFO ] Deduced a trap composed of 5 places in 224 ms of which 1 ms to minimize.
[2023-03-22 04:36:23] [INFO ] Deduced a trap composed of 6 places in 198 ms of which 1 ms to minimize.
[2023-03-22 04:36:23] [INFO ] Deduced a trap composed of 6 places in 295 ms of which 1 ms to minimize.
[2023-03-22 04:36:24] [INFO ] Deduced a trap composed of 5 places in 769 ms of which 1 ms to minimize.
[2023-03-22 04:36:25] [INFO ] Deduced a trap composed of 6 places in 313 ms of which 0 ms to minimize.
[2023-03-22 04:36:25] [INFO ] Deduced a trap composed of 5 places in 177 ms of which 0 ms to minimize.
[2023-03-22 04:36:25] [INFO ] Deduced a trap composed of 5 places in 285 ms of which 0 ms to minimize.
[2023-03-22 04:36:26] [INFO ] Deduced a trap composed of 5 places in 220 ms of which 1 ms to minimize.
[2023-03-22 04:36:26] [INFO ] Deduced a trap composed of 6 places in 193 ms of which 0 ms to minimize.
[2023-03-22 04:36:26] [INFO ] Deduced a trap composed of 5 places in 235 ms of which 0 ms to minimize.
[2023-03-22 04:36:27] [INFO ] Deduced a trap composed of 5 places in 177 ms of which 0 ms to minimize.
[2023-03-22 04:36:27] [INFO ] Deduced a trap composed of 8 places in 190 ms of which 1 ms to minimize.
[2023-03-22 04:36:27] [INFO ] Deduced a trap composed of 9 places in 145 ms of which 0 ms to minimize.
[2023-03-22 04:36:27] [INFO ] Deduced a trap composed of 5 places in 176 ms of which 1 ms to minimize.
[2023-03-22 04:36:28] [INFO ] Deduced a trap composed of 8 places in 256 ms of which 0 ms to minimize.
[2023-03-22 04:36:28] [INFO ] Deduced a trap composed of 6 places in 173 ms of which 1 ms to minimize.
[2023-03-22 04:36:28] [INFO ] Deduced a trap composed of 6 places in 176 ms of which 13 ms to minimize.
[2023-03-22 04:36:29] [INFO ] Deduced a trap composed of 5 places in 302 ms of which 0 ms to minimize.
[2023-03-22 04:36:29] [INFO ] Deduced a trap composed of 9 places in 232 ms of which 0 ms to minimize.
[2023-03-22 04:36:29] [INFO ] Deduced a trap composed of 4 places in 156 ms of which 0 ms to minimize.
[2023-03-22 04:36:30] [INFO ] Deduced a trap composed of 5 places in 203 ms of which 1 ms to minimize.
[2023-03-22 04:36:30] [INFO ] Deduced a trap composed of 6 places in 123 ms of which 0 ms to minimize.
[2023-03-22 04:36:30] [INFO ] Deduced a trap composed of 11 places in 174 ms of which 1 ms to minimize.
[2023-03-22 04:36:31] [INFO ] Deduced a trap composed of 17 places in 208 ms of which 1 ms to minimize.
[2023-03-22 04:36:31] [INFO ] Deduced a trap composed of 6 places in 189 ms of which 0 ms to minimize.
[2023-03-22 04:36:31] [INFO ] Deduced a trap composed of 6 places in 145 ms of which 0 ms to minimize.
[2023-03-22 04:36:31] [INFO ] Deduced a trap composed of 8 places in 111 ms of which 0 ms to minimize.
[2023-03-22 04:36:32] [INFO ] Deduced a trap composed of 23 places in 140 ms of which 0 ms to minimize.
[2023-03-22 04:36:32] [INFO ] Deduced a trap composed of 4 places in 108 ms of which 0 ms to minimize.
[2023-03-22 04:36:32] [INFO ] Trap strengthening (SAT) tested/added 46/45 trap constraints in 16498 ms
[2023-03-22 04:36:32] [INFO ] After 19070ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 144 ms.
[2023-03-22 04:36:32] [INFO ] After 19801ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 217 ms.
Support contains 2 out of 3101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3101/3101 places, 2601/2601 transitions.
Applied a total of 0 rules in 155 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 155 ms. Remains : 3101/3101 places, 2601/2601 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3101/3101 places, 2601/2601 transitions.
Applied a total of 0 rules in 244 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
[2023-03-22 04:36:33] [INFO ] Invariant cache hit.
[2023-03-22 04:36:36] [INFO ] Implicit Places using invariants in 3044 ms returned []
[2023-03-22 04:36:36] [INFO ] Invariant cache hit.
[2023-03-22 04:36:43] [INFO ] Implicit Places using invariants and state equation in 7448 ms returned []
Implicit Place search using SMT with State Equation took 10517 ms to find 0 implicit places.
[2023-03-22 04:36:43] [INFO ] Redundant transitions in 80 ms returned []
[2023-03-22 04:36:43] [INFO ] Invariant cache hit.
[2023-03-22 04:36:45] [INFO ] Dead Transitions using invariants and state equation in 1812 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12685 ms. Remains : 3101/3101 places, 2601/2601 transitions.
Applied a total of 0 rules in 170 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-22 04:36:45] [INFO ] Invariant cache hit.
[2023-03-22 04:36:46] [INFO ] [Real]Absence check using 1052 positive place invariants in 250 ms returned sat
[2023-03-22 04:36:46] [INFO ] [Real]Absence check using 1052 positive and 49 generalized place invariants in 29 ms returned sat
[2023-03-22 04:36:48] [INFO ] After 2225ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 04:36:48] [INFO ] [Nat]Absence check using 1052 positive place invariants in 277 ms returned sat
[2023-03-22 04:36:48] [INFO ] [Nat]Absence check using 1052 positive and 49 generalized place invariants in 53 ms returned sat
[2023-03-22 04:36:51] [INFO ] After 2372ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 04:36:52] [INFO ] Deduced a trap composed of 6 places in 920 ms of which 1 ms to minimize.
[2023-03-22 04:36:53] [INFO ] Deduced a trap composed of 5 places in 1185 ms of which 0 ms to minimize.
[2023-03-22 04:36:54] [INFO ] Deduced a trap composed of 4 places in 508 ms of which 0 ms to minimize.
[2023-03-22 04:36:55] [INFO ] Deduced a trap composed of 4 places in 961 ms of which 1 ms to minimize.
[2023-03-22 04:36:55] [INFO ] Deduced a trap composed of 6 places in 430 ms of which 0 ms to minimize.
[2023-03-22 04:36:56] [INFO ] Deduced a trap composed of 4 places in 238 ms of which 1 ms to minimize.
[2023-03-22 04:36:56] [INFO ] Deduced a trap composed of 4 places in 190 ms of which 1 ms to minimize.
[2023-03-22 04:36:56] [INFO ] Deduced a trap composed of 4 places in 250 ms of which 0 ms to minimize.
[2023-03-22 04:36:57] [INFO ] Deduced a trap composed of 9 places in 199 ms of which 0 ms to minimize.
[2023-03-22 04:36:57] [INFO ] Deduced a trap composed of 9 places in 291 ms of which 0 ms to minimize.
[2023-03-22 04:36:57] [INFO ] Deduced a trap composed of 8 places in 162 ms of which 0 ms to minimize.
[2023-03-22 04:36:58] [INFO ] Deduced a trap composed of 6 places in 315 ms of which 1 ms to minimize.
[2023-03-22 04:36:58] [INFO ] Deduced a trap composed of 6 places in 300 ms of which 0 ms to minimize.
[2023-03-22 04:36:58] [INFO ] Deduced a trap composed of 6 places in 194 ms of which 1 ms to minimize.
[2023-03-22 04:36:59] [INFO ] Deduced a trap composed of 6 places in 190 ms of which 0 ms to minimize.
[2023-03-22 04:36:59] [INFO ] Deduced a trap composed of 5 places in 210 ms of which 1 ms to minimize.
[2023-03-22 04:36:59] [INFO ] Deduced a trap composed of 5 places in 208 ms of which 0 ms to minimize.
[2023-03-22 04:37:00] [INFO ] Deduced a trap composed of 6 places in 145 ms of which 0 ms to minimize.
[2023-03-22 04:37:00] [INFO ] Deduced a trap composed of 4 places in 215 ms of which 1 ms to minimize.
[2023-03-22 04:37:00] [INFO ] Deduced a trap composed of 6 places in 159 ms of which 1 ms to minimize.
[2023-03-22 04:37:00] [INFO ] Deduced a trap composed of 6 places in 228 ms of which 1 ms to minimize.
[2023-03-22 04:37:01] [INFO ] Deduced a trap composed of 6 places in 169 ms of which 0 ms to minimize.
[2023-03-22 04:37:01] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 9942 ms
[2023-03-22 04:37:01] [INFO ] After 12390ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 125 ms.
[2023-03-22 04:37:01] [INFO ] After 13342ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p1, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 88 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 176 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 142 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 226 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 25000 reset in 1977 ms.
Product exploration explored 100000 steps with 25000 reset in 1925 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 215 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Support contains 2 out of 6102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6102/6102 places, 5602/5602 transitions.
Performed 701 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 701 rules applied. Total rules applied 701 place count 6102 transition count 5602
Performed 201 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 201 Pre rules applied. Total rules applied 701 place count 6102 transition count 5603
Deduced a syphon composed of 902 places in 41 ms
Iterating global reduction 1 with 201 rules applied. Total rules applied 902 place count 6102 transition count 5603
Performed 2098 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3000 places in 10 ms
Iterating global reduction 1 with 2098 rules applied. Total rules applied 3000 place count 6102 transition count 5603
Renaming transitions due to excessive name length > 1024 char.
Discarding 702 places :
Symmetric choice reduction at 1 with 702 rule applications. Total rules 3702 place count 5400 transition count 4901
Deduced a syphon composed of 2298 places in 10 ms
Iterating global reduction 1 with 702 rules applied. Total rules applied 4404 place count 5400 transition count 4901
Deduced a syphon composed of 2298 places in 9 ms
Applied a total of 4404 rules in 5343 ms. Remains 5400 /6102 variables (removed 702) and now considering 4901/5602 (removed 701) transitions.
[2023-03-22 04:37:11] [INFO ] Redundant transitions in 224 ms returned []
// Phase 1: matrix 4901 rows 5400 cols
[2023-03-22 04:37:12] [INFO ] Computed 1101 place invariants in 123 ms
[2023-03-22 04:37:15] [INFO ] Dead Transitions using invariants and state equation in 3472 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5400/6102 places, 4901/5602 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9055 ms. Remains : 5400/6102 places, 4901/5602 transitions.
Support contains 2 out of 6102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6102/6102 places, 5602/5602 transitions.
Applied a total of 0 rules in 705 ms. Remains 6102 /6102 variables (removed 0) and now considering 5602/5602 (removed 0) transitions.
// Phase 1: matrix 5602 rows 6102 cols
[2023-03-22 04:37:16] [INFO ] Computed 1101 place invariants in 46 ms
[2023-03-22 04:37:18] [INFO ] Implicit Places using invariants in 2722 ms returned []
[2023-03-22 04:37:18] [INFO ] Invariant cache hit.
[2023-03-22 04:37:21] [INFO ] Implicit Places using invariants and state equation in 3093 ms returned []
Implicit Place search using SMT with State Equation took 5817 ms to find 0 implicit places.
[2023-03-22 04:37:21] [INFO ] Invariant cache hit.
[2023-03-22 04:37:27] [INFO ] Dead Transitions using invariants and state equation in 5754 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12281 ms. Remains : 6102/6102 places, 5602/5602 transitions.
Treatment of property ShieldPPPs-PT-100B-LTLFireability-15 finished in 235606 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&&G(p1)&&X(F(p0))))))'
Found a Shortening insensitive property : ShieldPPPs-PT-100B-LTLFireability-03
Stuttering acceptance computed with spot in 243 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Support contains 4 out of 6104 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 6104/6104 places, 5604/5604 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 700 transitions
Trivial Post-agglo rules discarded 700 transitions
Performed 700 trivial Post agglomeration. Transition count delta: 700
Iterating post reduction 0 with 700 rules applied. Total rules applied 700 place count 6103 transition count 4903
Reduce places removed 700 places and 0 transitions.
Iterating post reduction 1 with 700 rules applied. Total rules applied 1400 place count 5403 transition count 4903
Performed 500 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 500 Pre rules applied. Total rules applied 1400 place count 5403 transition count 4403
Deduced a syphon composed of 500 places in 21 ms
Reduce places removed 500 places and 0 transitions.
Iterating global reduction 2 with 1000 rules applied. Total rules applied 2400 place count 4903 transition count 4403
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 2402 place count 4901 transition count 4401
Iterating global reduction 2 with 2 rules applied. Total rules applied 2404 place count 4901 transition count 4401
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2404 place count 4901 transition count 4400
Deduced a syphon composed of 1 places in 21 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 2406 place count 4900 transition count 4400
Performed 1794 Post agglomeration using F-continuation condition.Transition count delta: 1794
Deduced a syphon composed of 1794 places in 7 ms
Reduce places removed 1794 places and 0 transitions.
Iterating global reduction 2 with 3588 rules applied. Total rules applied 5994 place count 3106 transition count 2606
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 5996 place count 3104 transition count 2604
Applied a total of 5996 rules in 1951 ms. Remains 3104 /6104 variables (removed 3000) and now considering 2604/5604 (removed 3000) transitions.
// Phase 1: matrix 2604 rows 3104 cols
[2023-03-22 04:37:30] [INFO ] Computed 1101 place invariants in 9 ms
[2023-03-22 04:37:32] [INFO ] Implicit Places using invariants in 2549 ms returned []
[2023-03-22 04:37:32] [INFO ] Invariant cache hit.
[2023-03-22 04:37:40] [INFO ] Implicit Places using invariants and state equation in 7896 ms returned []
Implicit Place search using SMT with State Equation took 10446 ms to find 0 implicit places.
[2023-03-22 04:37:40] [INFO ] Invariant cache hit.
[2023-03-22 04:37:42] [INFO ] Dead Transitions using invariants and state equation in 2080 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 3104/6104 places, 2604/5604 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 14481 ms. Remains : 3104/6104 places, 2604/5604 transitions.
Running random walk in product with property : ShieldPPPs-PT-100B-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}, { cond=(AND p0 p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s1000 0) (EQ s1022 0)), p1:(OR (EQ s1310 0) (EQ s1328 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 39 reset in 1741 ms.
Product exploration explored 100000 steps with 41 reset in 2320 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (OR (NOT p0) (NOT p1)))), (X (X (AND p0 p1))), (X (X p0)), (X (X p1)), (X (X (NOT (OR (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 521 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 271 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 483 ms. (steps per millisecond=20 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 210 ms. (steps per millisecond=47 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 213 ms. (steps per millisecond=46 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 151 ms. (steps per millisecond=66 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 152 ms. (steps per millisecond=65 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 42066 steps, run timeout after 3001 ms. (steps per millisecond=14 ) properties seen :{}
Probabilistic random walk after 42066 steps, saw 37885 distinct states, run finished after 3001 ms. (steps per millisecond=14 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-22 04:37:51] [INFO ] Invariant cache hit.
[2023-03-22 04:37:52] [INFO ] After 527ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-22 04:37:53] [INFO ] [Nat]Absence check using 1101 positive place invariants in 443 ms returned sat
[2023-03-22 04:37:55] [INFO ] After 2013ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-22 04:37:56] [INFO ] Deduced a trap composed of 23 places in 172 ms of which 1 ms to minimize.
[2023-03-22 04:37:56] [INFO ] Deduced a trap composed of 23 places in 205 ms of which 0 ms to minimize.
[2023-03-22 04:37:56] [INFO ] Deduced a trap composed of 17 places in 236 ms of which 1 ms to minimize.
[2023-03-22 04:37:56] [INFO ] Deduced a trap composed of 17 places in 159 ms of which 0 ms to minimize.
[2023-03-22 04:37:57] [INFO ] Deduced a trap composed of 23 places in 116 ms of which 2 ms to minimize.
[2023-03-22 04:37:57] [INFO ] Deduced a trap composed of 23 places in 89 ms of which 1 ms to minimize.
[2023-03-22 04:37:57] [INFO ] Deduced a trap composed of 17 places in 83 ms of which 0 ms to minimize.
[2023-03-22 04:37:57] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 0 ms to minimize.
[2023-03-22 04:37:58] [INFO ] Deduced a trap composed of 17 places in 102 ms of which 1 ms to minimize.
[2023-03-22 04:37:58] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 2485 ms
[2023-03-22 04:37:59] [INFO ] After 5391ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 531 ms.
[2023-03-22 04:37:59] [INFO ] After 7196ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 249 ms.
Support contains 4 out of 3104 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3104/3104 places, 2604/2604 transitions.
Partial Free-agglomeration rule applied 598 times.
Drop transitions removed 598 transitions
Iterating global reduction 0 with 598 rules applied. Total rules applied 598 place count 3104 transition count 2604
Applied a total of 598 rules in 296 ms. Remains 3104 /3104 variables (removed 0) and now considering 2604/2604 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 296 ms. Remains : 3104/3104 places, 2604/2604 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 503 ms. (steps per millisecond=19 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 161 ms. (steps per millisecond=62 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 173 ms. (steps per millisecond=57 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 161 ms. (steps per millisecond=62 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 148 ms. (steps per millisecond=67 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 55739 steps, run timeout after 3010 ms. (steps per millisecond=18 ) properties seen :{}
Probabilistic random walk after 55739 steps, saw 54840 distinct states, run finished after 3010 ms. (steps per millisecond=18 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 2604 rows 3104 cols
[2023-03-22 04:38:04] [INFO ] Computed 1101 place invariants in 21 ms
[2023-03-22 04:38:04] [INFO ] After 501ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-22 04:38:05] [INFO ] [Nat]Absence check using 1101 positive place invariants in 596 ms returned sat
[2023-03-22 04:38:10] [INFO ] After 4480ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-22 04:38:11] [INFO ] Deduced a trap composed of 23 places in 472 ms of which 1 ms to minimize.
[2023-03-22 04:38:11] [INFO ] Deduced a trap composed of 19 places in 215 ms of which 0 ms to minimize.
[2023-03-22 04:38:12] [INFO ] Deduced a trap composed of 17 places in 437 ms of which 1 ms to minimize.
[2023-03-22 04:38:12] [INFO ] Deduced a trap composed of 17 places in 135 ms of which 0 ms to minimize.
[2023-03-22 04:38:12] [INFO ] Deduced a trap composed of 17 places in 143 ms of which 2 ms to minimize.
[2023-03-22 04:38:12] [INFO ] Deduced a trap composed of 23 places in 133 ms of which 0 ms to minimize.
[2023-03-22 04:38:13] [INFO ] Deduced a trap composed of 17 places in 126 ms of which 0 ms to minimize.
[2023-03-22 04:38:13] [INFO ] Deduced a trap composed of 23 places in 597 ms of which 1 ms to minimize.
[2023-03-22 04:38:14] [INFO ] Deduced a trap composed of 17 places in 93 ms of which 0 ms to minimize.
[2023-03-22 04:38:14] [INFO ] Deduced a trap composed of 17 places in 199 ms of which 0 ms to minimize.
[2023-03-22 04:38:15] [INFO ] Deduced a trap composed of 28 places in 1256 ms of which 0 ms to minimize.
[2023-03-22 04:38:15] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 5224 ms
[2023-03-22 04:38:16] [INFO ] Deduced a trap composed of 17 places in 134 ms of which 0 ms to minimize.
[2023-03-22 04:38:16] [INFO ] Deduced a trap composed of 29 places in 159 ms of which 1 ms to minimize.
[2023-03-22 04:38:16] [INFO ] Deduced a trap composed of 40 places in 135 ms of which 0 ms to minimize.
[2023-03-22 04:38:17] [INFO ] Deduced a trap composed of 29 places in 136 ms of which 0 ms to minimize.
[2023-03-22 04:38:17] [INFO ] Deduced a trap composed of 34 places in 144 ms of which 0 ms to minimize.
[2023-03-22 04:38:17] [INFO ] Deduced a trap composed of 29 places in 80 ms of which 0 ms to minimize.
[2023-03-22 04:38:17] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1604 ms
[2023-03-22 04:38:18] [INFO ] After 11911ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 393 ms.
[2023-03-22 04:38:18] [INFO ] After 13574ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 604 ms.
Support contains 4 out of 3104 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3104/3104 places, 2604/2604 transitions.
Applied a total of 0 rules in 154 ms. Remains 3104 /3104 variables (removed 0) and now considering 2604/2604 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 167 ms. Remains : 3104/3104 places, 2604/2604 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3104/3104 places, 2604/2604 transitions.
Applied a total of 0 rules in 167 ms. Remains 3104 /3104 variables (removed 0) and now considering 2604/2604 (removed 0) transitions.
[2023-03-22 04:38:19] [INFO ] Invariant cache hit.
[2023-03-22 04:38:21] [INFO ] Implicit Places using invariants in 2498 ms returned []
[2023-03-22 04:38:21] [INFO ] Invariant cache hit.
[2023-03-22 04:38:31] [INFO ] Implicit Places using invariants and state equation in 10014 ms returned []
Implicit Place search using SMT with State Equation took 12517 ms to find 0 implicit places.
[2023-03-22 04:38:32] [INFO ] Redundant transitions in 87 ms returned []
[2023-03-22 04:38:32] [INFO ] Invariant cache hit.
[2023-03-22 04:38:34] [INFO ] Dead Transitions using invariants and state equation in 2201 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14994 ms. Remains : 3104/3104 places, 2604/2604 transitions.
Applied a total of 0 rules in 185 ms. Remains 3104 /3104 variables (removed 0) and now considering 2604/2604 (removed 0) transitions.
Running SMT prover for 4 properties.
[2023-03-22 04:38:34] [INFO ] Invariant cache hit.
[2023-03-22 04:38:35] [INFO ] After 600ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-22 04:38:36] [INFO ] [Nat]Absence check using 1101 positive place invariants in 499 ms returned sat
[2023-03-22 04:38:40] [INFO ] After 3817ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-22 04:38:40] [INFO ] Deduced a trap composed of 17 places in 289 ms of which 1 ms to minimize.
[2023-03-22 04:38:41] [INFO ] Deduced a trap composed of 19 places in 245 ms of which 0 ms to minimize.
[2023-03-22 04:38:41] [INFO ] Deduced a trap composed of 23 places in 398 ms of which 1 ms to minimize.
[2023-03-22 04:38:42] [INFO ] Deduced a trap composed of 17 places in 907 ms of which 1 ms to minimize.
[2023-03-22 04:38:42] [INFO ] Deduced a trap composed of 34 places in 237 ms of which 1 ms to minimize.
[2023-03-22 04:38:43] [INFO ] Deduced a trap composed of 17 places in 697 ms of which 2 ms to minimize.
[2023-03-22 04:38:43] [INFO ] Deduced a trap composed of 17 places in 191 ms of which 0 ms to minimize.
[2023-03-22 04:38:44] [INFO ] Deduced a trap composed of 23 places in 235 ms of which 1 ms to minimize.
[2023-03-22 04:38:44] [INFO ] Deduced a trap composed of 28 places in 241 ms of which 2 ms to minimize.
[2023-03-22 04:38:45] [INFO ] Deduced a trap composed of 17 places in 412 ms of which 1 ms to minimize.
[2023-03-22 04:38:46] [INFO ] Deduced a trap composed of 29 places in 840 ms of which 1 ms to minimize.
[2023-03-22 04:38:46] [INFO ] Deduced a trap composed of 17 places in 153 ms of which 0 ms to minimize.
[2023-03-22 04:38:46] [INFO ] Deduced a trap composed of 36 places in 131 ms of which 0 ms to minimize.
[2023-03-22 04:38:46] [INFO ] Deduced a trap composed of 19 places in 111 ms of which 1 ms to minimize.
[2023-03-22 04:38:48] [INFO ] Deduced a trap composed of 23 places in 1050 ms of which 1 ms to minimize.
[2023-03-22 04:38:48] [INFO ] Deduced a trap composed of 34 places in 412 ms of which 1 ms to minimize.
[2023-03-22 04:38:48] [INFO ] Deduced a trap composed of 23 places in 179 ms of which 1 ms to minimize.
[2023-03-22 04:38:49] [INFO ] Deduced a trap composed of 40 places in 131 ms of which 0 ms to minimize.
[2023-03-22 04:38:49] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 8936 ms
[2023-03-22 04:38:49] [INFO ] After 13273ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 637 ms.
[2023-03-22 04:38:50] [INFO ] After 15399ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (OR (NOT p0) (NOT p1)))), (X (X (AND p0 p1))), (X (X p0)), (X (X p1)), (X (X (NOT (OR (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 454 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 203 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 222 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Support contains 4 out of 3104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3104/3104 places, 2604/2604 transitions.
Applied a total of 0 rules in 183 ms. Remains 3104 /3104 variables (removed 0) and now considering 2604/2604 (removed 0) transitions.
// Phase 1: matrix 2604 rows 3104 cols
[2023-03-22 04:38:51] [INFO ] Computed 1101 place invariants in 5 ms
[2023-03-22 04:38:54] [INFO ] Implicit Places using invariants in 2627 ms returned []
[2023-03-22 04:38:54] [INFO ] Invariant cache hit.
[2023-03-22 04:38:59] [INFO ] Implicit Places using invariants and state equation in 5719 ms returned []
Implicit Place search using SMT with State Equation took 8355 ms to find 0 implicit places.
[2023-03-22 04:38:59] [INFO ] Invariant cache hit.
[2023-03-22 04:39:02] [INFO ] Dead Transitions using invariants and state equation in 2164 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10708 ms. Remains : 3104/3104 places, 2604/2604 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (OR (NOT p0) (NOT p1)))), (X (X (AND p0 p1))), (X (X p0)), (X (X p1)), (X (X (NOT (OR (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 435 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 266 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 619 ms. (steps per millisecond=16 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 208 ms. (steps per millisecond=48 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 155 ms. (steps per millisecond=64 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 187 ms. (steps per millisecond=53 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 161 ms. (steps per millisecond=62 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 35494 steps, run timeout after 3001 ms. (steps per millisecond=11 ) properties seen :{}
Probabilistic random walk after 35494 steps, saw 31906 distinct states, run finished after 3001 ms. (steps per millisecond=11 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-22 04:39:07] [INFO ] Invariant cache hit.
[2023-03-22 04:39:07] [INFO ] After 554ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-22 04:39:08] [INFO ] [Nat]Absence check using 1101 positive place invariants in 307 ms returned sat
[2023-03-22 04:39:11] [INFO ] After 2417ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-22 04:39:11] [INFO ] Deduced a trap composed of 23 places in 334 ms of which 1 ms to minimize.
[2023-03-22 04:39:12] [INFO ] Deduced a trap composed of 23 places in 184 ms of which 0 ms to minimize.
[2023-03-22 04:39:12] [INFO ] Deduced a trap composed of 17 places in 159 ms of which 1 ms to minimize.
[2023-03-22 04:39:12] [INFO ] Deduced a trap composed of 17 places in 175 ms of which 14 ms to minimize.
[2023-03-22 04:39:12] [INFO ] Deduced a trap composed of 23 places in 88 ms of which 0 ms to minimize.
[2023-03-22 04:39:13] [INFO ] Deduced a trap composed of 23 places in 101 ms of which 0 ms to minimize.
[2023-03-22 04:39:13] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 1 ms to minimize.
[2023-03-22 04:39:13] [INFO ] Deduced a trap composed of 17 places in 143 ms of which 1 ms to minimize.
[2023-03-22 04:39:13] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 0 ms to minimize.
[2023-03-22 04:39:13] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 2257 ms
[2023-03-22 04:39:14] [INFO ] After 5280ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 438 ms.
[2023-03-22 04:39:14] [INFO ] After 6961ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 253 ms.
Support contains 4 out of 3104 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3104/3104 places, 2604/2604 transitions.
Partial Free-agglomeration rule applied 598 times.
Drop transitions removed 598 transitions
Iterating global reduction 0 with 598 rules applied. Total rules applied 598 place count 3104 transition count 2604
Applied a total of 598 rules in 329 ms. Remains 3104 /3104 variables (removed 0) and now considering 2604/2604 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 329 ms. Remains : 3104/3104 places, 2604/2604 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 359 ms. (steps per millisecond=27 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 230 ms. (steps per millisecond=43 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 160 ms. (steps per millisecond=62 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 214 ms. (steps per millisecond=46 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 69245 steps, run timeout after 3001 ms. (steps per millisecond=23 ) properties seen :{}
Probabilistic random walk after 69245 steps, saw 68259 distinct states, run finished after 3003 ms. (steps per millisecond=23 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 2604 rows 3104 cols
[2023-03-22 04:39:19] [INFO ] Computed 1101 place invariants in 59 ms
[2023-03-22 04:39:20] [INFO ] After 569ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-22 04:39:20] [INFO ] [Nat]Absence check using 1101 positive place invariants in 298 ms returned sat
[2023-03-22 04:39:23] [INFO ] After 2317ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-22 04:39:23] [INFO ] Deduced a trap composed of 23 places in 315 ms of which 0 ms to minimize.
[2023-03-22 04:39:24] [INFO ] Deduced a trap composed of 19 places in 244 ms of which 0 ms to minimize.
[2023-03-22 04:39:24] [INFO ] Deduced a trap composed of 17 places in 129 ms of which 1 ms to minimize.
[2023-03-22 04:39:24] [INFO ] Deduced a trap composed of 17 places in 141 ms of which 0 ms to minimize.
[2023-03-22 04:39:24] [INFO ] Deduced a trap composed of 17 places in 89 ms of which 0 ms to minimize.
[2023-03-22 04:39:25] [INFO ] Deduced a trap composed of 23 places in 250 ms of which 1 ms to minimize.
[2023-03-22 04:39:25] [INFO ] Deduced a trap composed of 17 places in 135 ms of which 0 ms to minimize.
[2023-03-22 04:39:25] [INFO ] Deduced a trap composed of 23 places in 99 ms of which 0 ms to minimize.
[2023-03-22 04:39:25] [INFO ] Deduced a trap composed of 17 places in 86 ms of which 0 ms to minimize.
[2023-03-22 04:39:25] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 0 ms to minimize.
[2023-03-22 04:39:26] [INFO ] Deduced a trap composed of 28 places in 67 ms of which 0 ms to minimize.
[2023-03-22 04:39:26] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 2773 ms
[2023-03-22 04:39:26] [INFO ] Deduced a trap composed of 17 places in 146 ms of which 1 ms to minimize.
[2023-03-22 04:39:26] [INFO ] Deduced a trap composed of 29 places in 146 ms of which 0 ms to minimize.
[2023-03-22 04:39:27] [INFO ] Deduced a trap composed of 40 places in 59 ms of which 0 ms to minimize.
[2023-03-22 04:39:27] [INFO ] Deduced a trap composed of 29 places in 164 ms of which 0 ms to minimize.
[2023-03-22 04:39:27] [INFO ] Deduced a trap composed of 34 places in 110 ms of which 1 ms to minimize.
[2023-03-22 04:39:27] [INFO ] Deduced a trap composed of 29 places in 182 ms of which 1 ms to minimize.
[2023-03-22 04:39:28] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1599 ms
[2023-03-22 04:39:28] [INFO ] After 7157ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 440 ms.
[2023-03-22 04:39:28] [INFO ] After 8666ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 266 ms.
Support contains 4 out of 3104 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3104/3104 places, 2604/2604 transitions.
Applied a total of 0 rules in 150 ms. Remains 3104 /3104 variables (removed 0) and now considering 2604/2604 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 150 ms. Remains : 3104/3104 places, 2604/2604 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3104/3104 places, 2604/2604 transitions.
Applied a total of 0 rules in 149 ms. Remains 3104 /3104 variables (removed 0) and now considering 2604/2604 (removed 0) transitions.
[2023-03-22 04:39:29] [INFO ] Invariant cache hit.
[2023-03-22 04:39:32] [INFO ] Implicit Places using invariants in 3176 ms returned []
[2023-03-22 04:39:32] [INFO ] Invariant cache hit.
[2023-03-22 04:39:38] [INFO ] Implicit Places using invariants and state equation in 5715 ms returned []
Implicit Place search using SMT with State Equation took 8895 ms to find 0 implicit places.
[2023-03-22 04:39:38] [INFO ] Redundant transitions in 67 ms returned []
[2023-03-22 04:39:38] [INFO ] Invariant cache hit.
[2023-03-22 04:39:40] [INFO ] Dead Transitions using invariants and state equation in 2502 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11654 ms. Remains : 3104/3104 places, 2604/2604 transitions.
Applied a total of 0 rules in 144 ms. Remains 3104 /3104 variables (removed 0) and now considering 2604/2604 (removed 0) transitions.
Running SMT prover for 4 properties.
[2023-03-22 04:39:40] [INFO ] Invariant cache hit.
[2023-03-22 04:39:41] [INFO ] After 628ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-22 04:39:42] [INFO ] [Nat]Absence check using 1101 positive place invariants in 387 ms returned sat
[2023-03-22 04:39:45] [INFO ] After 2627ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-22 04:39:45] [INFO ] Deduced a trap composed of 17 places in 329 ms of which 0 ms to minimize.
[2023-03-22 04:39:46] [INFO ] Deduced a trap composed of 19 places in 224 ms of which 0 ms to minimize.
[2023-03-22 04:39:46] [INFO ] Deduced a trap composed of 23 places in 247 ms of which 1 ms to minimize.
[2023-03-22 04:39:46] [INFO ] Deduced a trap composed of 17 places in 221 ms of which 1 ms to minimize.
[2023-03-22 04:39:47] [INFO ] Deduced a trap composed of 34 places in 328 ms of which 1 ms to minimize.
[2023-03-22 04:39:47] [INFO ] Deduced a trap composed of 17 places in 231 ms of which 1 ms to minimize.
[2023-03-22 04:39:47] [INFO ] Deduced a trap composed of 17 places in 214 ms of which 0 ms to minimize.
[2023-03-22 04:39:48] [INFO ] Deduced a trap composed of 23 places in 227 ms of which 0 ms to minimize.
[2023-03-22 04:39:48] [INFO ] Deduced a trap composed of 28 places in 219 ms of which 0 ms to minimize.
[2023-03-22 04:39:48] [INFO ] Deduced a trap composed of 17 places in 165 ms of which 0 ms to minimize.
[2023-03-22 04:39:49] [INFO ] Deduced a trap composed of 29 places in 290 ms of which 0 ms to minimize.
[2023-03-22 04:39:49] [INFO ] Deduced a trap composed of 17 places in 157 ms of which 0 ms to minimize.
[2023-03-22 04:39:49] [INFO ] Deduced a trap composed of 36 places in 143 ms of which 0 ms to minimize.
[2023-03-22 04:39:49] [INFO ] Deduced a trap composed of 19 places in 164 ms of which 1 ms to minimize.
[2023-03-22 04:39:50] [INFO ] Deduced a trap composed of 23 places in 191 ms of which 1 ms to minimize.
[2023-03-22 04:39:50] [INFO ] Deduced a trap composed of 34 places in 137 ms of which 0 ms to minimize.
[2023-03-22 04:39:50] [INFO ] Deduced a trap composed of 23 places in 169 ms of which 0 ms to minimize.
[2023-03-22 04:39:50] [INFO ] Deduced a trap composed of 40 places in 158 ms of which 0 ms to minimize.
[2023-03-22 04:39:50] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 5617 ms
[2023-03-22 04:39:51] [INFO ] After 8903ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 519 ms.
[2023-03-22 04:39:52] [INFO ] After 10540ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (OR (NOT p0) (NOT p1)))), (X (X (AND p0 p1))), (X (X p0)), (X (X p1)), (X (X (NOT (OR (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 546 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 265 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 216 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 268 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Product exploration explored 100000 steps with 56 reset in 1746 ms.
Product exploration explored 100000 steps with 59 reset in 2216 ms.
Applying partial POR strategy [false, false, false, true]
Stuttering acceptance computed with spot in 252 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Support contains 4 out of 3104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3104/3104 places, 2604/2604 transitions.
Applied a total of 0 rules in 232 ms. Remains 3104 /3104 variables (removed 0) and now considering 2604/2604 (removed 0) transitions.
[2023-03-22 04:39:58] [INFO ] Redundant transitions in 66 ms returned []
// Phase 1: matrix 2604 rows 3104 cols
[2023-03-22 04:39:58] [INFO ] Computed 1101 place invariants in 4 ms
[2023-03-22 04:39:59] [INFO ] Dead Transitions using invariants and state equation in 1842 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2160 ms. Remains : 3104/3104 places, 2604/2604 transitions.
Support contains 4 out of 3104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3104/3104 places, 2604/2604 transitions.
Applied a total of 0 rules in 142 ms. Remains 3104 /3104 variables (removed 0) and now considering 2604/2604 (removed 0) transitions.
[2023-03-22 04:40:00] [INFO ] Invariant cache hit.
[2023-03-22 04:40:02] [INFO ] Implicit Places using invariants in 2095 ms returned []
[2023-03-22 04:40:02] [INFO ] Invariant cache hit.
[2023-03-22 04:40:09] [INFO ] Implicit Places using invariants and state equation in 7261 ms returned []
Implicit Place search using SMT with State Equation took 9357 ms to find 0 implicit places.
[2023-03-22 04:40:09] [INFO ] Invariant cache hit.
[2023-03-22 04:40:11] [INFO ] Dead Transitions using invariants and state equation in 2391 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11895 ms. Remains : 3104/3104 places, 2604/2604 transitions.
Treatment of property ShieldPPPs-PT-100B-LTLFireability-03 finished in 164149 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((G(p0)||(p1&&X(p2))))))'
Found a Shortening insensitive property : ShieldPPPs-PT-100B-LTLFireability-06
Stuttering acceptance computed with spot in 192 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Support contains 4 out of 6104 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 6104/6104 places, 5604/5604 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 701 transitions
Trivial Post-agglo rules discarded 701 transitions
Performed 701 trivial Post agglomeration. Transition count delta: 701
Iterating post reduction 0 with 701 rules applied. Total rules applied 701 place count 6103 transition count 4902
Reduce places removed 701 places and 0 transitions.
Iterating post reduction 1 with 701 rules applied. Total rules applied 1402 place count 5402 transition count 4902
Performed 499 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 499 Pre rules applied. Total rules applied 1402 place count 5402 transition count 4403
Deduced a syphon composed of 499 places in 20 ms
Reduce places removed 499 places and 0 transitions.
Iterating global reduction 2 with 998 rules applied. Total rules applied 2400 place count 4903 transition count 4403
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 2402 place count 4901 transition count 4401
Iterating global reduction 2 with 2 rules applied. Total rules applied 2404 place count 4901 transition count 4401
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2404 place count 4901 transition count 4400
Deduced a syphon composed of 1 places in 18 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 2406 place count 4900 transition count 4400
Performed 1793 Post agglomeration using F-continuation condition.Transition count delta: 1793
Deduced a syphon composed of 1793 places in 6 ms
Reduce places removed 1793 places and 0 transitions.
Iterating global reduction 2 with 3586 rules applied. Total rules applied 5992 place count 3107 transition count 2607
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 5994 place count 3105 transition count 2605
Applied a total of 5994 rules in 1809 ms. Remains 3105 /6104 variables (removed 2999) and now considering 2605/5604 (removed 2999) transitions.
// Phase 1: matrix 2605 rows 3105 cols
[2023-03-22 04:40:14] [INFO ] Computed 1101 place invariants in 11 ms
[2023-03-22 04:40:16] [INFO ] Implicit Places using invariants in 1997 ms returned []
[2023-03-22 04:40:16] [INFO ] Invariant cache hit.
[2023-03-22 04:40:21] [INFO ] Implicit Places using invariants and state equation in 5372 ms returned []
Implicit Place search using SMT with State Equation took 7418 ms to find 0 implicit places.
[2023-03-22 04:40:21] [INFO ] Invariant cache hit.
[2023-03-22 04:40:23] [INFO ] Dead Transitions using invariants and state equation in 2000 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 3105/6104 places, 2605/5604 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 11237 ms. Remains : 3105/6104 places, 2605/5604 transitions.
Running random walk in product with property : ShieldPPPs-PT-100B-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s1255 0) (EQ s1275 0)), p1:(OR (EQ s2145 0) (EQ s925 0)), p2:(EQ s2145 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 20 reset in 1814 ms.
Product exploration explored 100000 steps with 21 reset in 2312 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (AND p0 p1 (NOT p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2)))))]
Knowledge based reduction with 12 factoid took 1104 ms. Reduced automaton from 3 states, 11 edges and 3 AP (stutter sensitive) to 3 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 243 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 382 ms. (steps per millisecond=26 ) properties (out of 8) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 155 ms. (steps per millisecond=64 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 187 ms. (steps per millisecond=53 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 145 ms. (steps per millisecond=68 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-22 04:40:30] [INFO ] Invariant cache hit.
[2023-03-22 04:40:30] [INFO ] After 548ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-22 04:40:31] [INFO ] [Nat]Absence check using 1101 positive place invariants in 290 ms returned sat
[2023-03-22 04:40:33] [INFO ] After 1990ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-22 04:40:34] [INFO ] Deduced a trap composed of 17 places in 324 ms of which 1 ms to minimize.
[2023-03-22 04:40:34] [INFO ] Deduced a trap composed of 17 places in 141 ms of which 1 ms to minimize.
[2023-03-22 04:40:34] [INFO ] Deduced a trap composed of 7 places in 190 ms of which 0 ms to minimize.
[2023-03-22 04:40:35] [INFO ] Deduced a trap composed of 17 places in 192 ms of which 0 ms to minimize.
[2023-03-22 04:40:35] [INFO ] Deduced a trap composed of 19 places in 122 ms of which 1 ms to minimize.
[2023-03-22 04:40:35] [INFO ] Deduced a trap composed of 23 places in 122 ms of which 1 ms to minimize.
[2023-03-22 04:40:35] [INFO ] Deduced a trap composed of 22 places in 125 ms of which 0 ms to minimize.
[2023-03-22 04:40:36] [INFO ] Deduced a trap composed of 17 places in 153 ms of which 0 ms to minimize.
[2023-03-22 04:40:36] [INFO ] Deduced a trap composed of 17 places in 191 ms of which 1 ms to minimize.
[2023-03-22 04:40:36] [INFO ] Deduced a trap composed of 30 places in 181 ms of which 6 ms to minimize.
[2023-03-22 04:40:36] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 0 ms to minimize.
[2023-03-22 04:40:37] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 3162 ms
[2023-03-22 04:40:37] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 0 ms to minimize.
[2023-03-22 04:40:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 356 ms
[2023-03-22 04:40:37] [INFO ] After 6020ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 522 ms.
[2023-03-22 04:40:38] [INFO ] After 7646ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 360 ms.
Support contains 4 out of 3105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3105/3105 places, 2605/2605 transitions.
Partial Free-agglomeration rule applied 600 times.
Drop transitions removed 600 transitions
Iterating global reduction 0 with 600 rules applied. Total rules applied 600 place count 3105 transition count 2605
Applied a total of 600 rules in 376 ms. Remains 3105 /3105 variables (removed 0) and now considering 2605/2605 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 390 ms. Remains : 3105/3105 places, 2605/2605 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 554 ms. (steps per millisecond=18 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 236 ms. (steps per millisecond=42 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 291 ms. (steps per millisecond=34 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 150 ms. (steps per millisecond=66 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 161 ms. (steps per millisecond=62 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 56805 steps, run timeout after 3007 ms. (steps per millisecond=18 ) properties seen :{}
Probabilistic random walk after 56805 steps, saw 55623 distinct states, run finished after 3007 ms. (steps per millisecond=18 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 2605 rows 3105 cols
[2023-03-22 04:40:43] [INFO ] Computed 1101 place invariants in 20 ms
[2023-03-22 04:40:44] [INFO ] After 868ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-22 04:40:46] [INFO ] [Nat]Absence check using 1101 positive place invariants in 1316 ms returned sat
[2023-03-22 04:40:49] [INFO ] After 2358ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-22 04:40:49] [INFO ] Deduced a trap composed of 5 places in 286 ms of which 0 ms to minimize.
[2023-03-22 04:40:49] [INFO ] Deduced a trap composed of 5 places in 236 ms of which 1 ms to minimize.
[2023-03-22 04:40:50] [INFO ] Deduced a trap composed of 17 places in 230 ms of which 0 ms to minimize.
[2023-03-22 04:40:50] [INFO ] Deduced a trap composed of 17 places in 221 ms of which 1 ms to minimize.
[2023-03-22 04:40:50] [INFO ] Deduced a trap composed of 17 places in 264 ms of which 1 ms to minimize.
[2023-03-22 04:40:51] [INFO ] Deduced a trap composed of 23 places in 243 ms of which 1 ms to minimize.
[2023-03-22 04:40:51] [INFO ] Deduced a trap composed of 28 places in 295 ms of which 1 ms to minimize.
[2023-03-22 04:40:52] [INFO ] Deduced a trap composed of 17 places in 294 ms of which 1 ms to minimize.
[2023-03-22 04:40:52] [INFO ] Deduced a trap composed of 23 places in 227 ms of which 1 ms to minimize.
[2023-03-22 04:40:52] [INFO ] Deduced a trap composed of 17 places in 219 ms of which 0 ms to minimize.
[2023-03-22 04:40:52] [INFO ] Deduced a trap composed of 56 places in 144 ms of which 0 ms to minimize.
[2023-03-22 04:40:53] [INFO ] Deduced a trap composed of 23 places in 173 ms of which 0 ms to minimize.
[2023-03-22 04:40:53] [INFO ] Deduced a trap composed of 34 places in 249 ms of which 2 ms to minimize.
[2023-03-22 04:40:53] [INFO ] Deduced a trap composed of 17 places in 171 ms of which 0 ms to minimize.
[2023-03-22 04:40:54] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 4771 ms
[2023-03-22 04:40:54] [INFO ] After 7889ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 546 ms.
[2023-03-22 04:40:55] [INFO ] After 10810ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 359 ms.
Support contains 4 out of 3105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3105/3105 places, 2605/2605 transitions.
Applied a total of 0 rules in 159 ms. Remains 3105 /3105 variables (removed 0) and now considering 2605/2605 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 159 ms. Remains : 3105/3105 places, 2605/2605 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3105/3105 places, 2605/2605 transitions.
Applied a total of 0 rules in 147 ms. Remains 3105 /3105 variables (removed 0) and now considering 2605/2605 (removed 0) transitions.
[2023-03-22 04:40:55] [INFO ] Invariant cache hit.
[2023-03-22 04:40:59] [INFO ] Implicit Places using invariants in 3298 ms returned []
[2023-03-22 04:40:59] [INFO ] Invariant cache hit.
[2023-03-22 04:41:05] [INFO ] Implicit Places using invariants and state equation in 6456 ms returned []
Implicit Place search using SMT with State Equation took 9788 ms to find 0 implicit places.
[2023-03-22 04:41:05] [INFO ] Redundant transitions in 80 ms returned []
[2023-03-22 04:41:05] [INFO ] Invariant cache hit.
[2023-03-22 04:41:09] [INFO ] Dead Transitions using invariants and state equation in 3418 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13490 ms. Remains : 3105/3105 places, 2605/2605 transitions.
Applied a total of 0 rules in 163 ms. Remains 3105 /3105 variables (removed 0) and now considering 2605/2605 (removed 0) transitions.
Running SMT prover for 4 properties.
[2023-03-22 04:41:09] [INFO ] Invariant cache hit.
[2023-03-22 04:41:10] [INFO ] After 609ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-22 04:41:10] [INFO ] [Nat]Absence check using 1101 positive place invariants in 231 ms returned sat
[2023-03-22 04:41:13] [INFO ] After 2450ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-22 04:41:14] [INFO ] Deduced a trap composed of 17 places in 323 ms of which 1 ms to minimize.
[2023-03-22 04:41:14] [INFO ] Deduced a trap composed of 6 places in 282 ms of which 0 ms to minimize.
[2023-03-22 04:41:14] [INFO ] Deduced a trap composed of 28 places in 264 ms of which 1 ms to minimize.
[2023-03-22 04:41:15] [INFO ] Deduced a trap composed of 17 places in 233 ms of which 1 ms to minimize.
[2023-03-22 04:41:15] [INFO ] Deduced a trap composed of 17 places in 273 ms of which 1 ms to minimize.
[2023-03-22 04:41:15] [INFO ] Deduced a trap composed of 23 places in 234 ms of which 0 ms to minimize.
[2023-03-22 04:41:16] [INFO ] Deduced a trap composed of 23 places in 222 ms of which 0 ms to minimize.
[2023-03-22 04:41:16] [INFO ] Deduced a trap composed of 6 places in 224 ms of which 0 ms to minimize.
[2023-03-22 04:41:16] [INFO ] Deduced a trap composed of 17 places in 348 ms of which 1 ms to minimize.
[2023-03-22 04:41:17] [INFO ] Deduced a trap composed of 14 places in 246 ms of which 1 ms to minimize.
[2023-03-22 04:41:17] [INFO ] Deduced a trap composed of 17 places in 349 ms of which 1 ms to minimize.
[2023-03-22 04:41:18] [INFO ] Deduced a trap composed of 12 places in 362 ms of which 1 ms to minimize.
[2023-03-22 04:41:18] [INFO ] Deduced a trap composed of 23 places in 228 ms of which 0 ms to minimize.
[2023-03-22 04:41:19] [INFO ] Deduced a trap composed of 5 places in 300 ms of which 0 ms to minimize.
[2023-03-22 04:41:19] [INFO ] Deduced a trap composed of 17 places in 290 ms of which 1 ms to minimize.
[2023-03-22 04:41:19] [INFO ] Deduced a trap composed of 23 places in 249 ms of which 1 ms to minimize.
[2023-03-22 04:41:19] [INFO ] Deduced a trap composed of 17 places in 118 ms of which 1 ms to minimize.
[2023-03-22 04:41:20] [INFO ] Deduced a trap composed of 23 places in 213 ms of which 1 ms to minimize.
[2023-03-22 04:41:20] [INFO ] Deduced a trap composed of 17 places in 151 ms of which 1 ms to minimize.
[2023-03-22 04:41:20] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 7127 ms
[2023-03-22 04:41:21] [INFO ] Deduced a trap composed of 7 places in 130 ms of which 0 ms to minimize.
[2023-03-22 04:41:21] [INFO ] Deduced a trap composed of 17 places in 185 ms of which 0 ms to minimize.
[2023-03-22 04:41:21] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 0 ms to minimize.
[2023-03-22 04:41:21] [INFO ] Deduced a trap composed of 23 places in 83 ms of which 1 ms to minimize.
[2023-03-22 04:41:22] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 0 ms to minimize.
[2023-03-22 04:41:22] [INFO ] Deduced a trap composed of 17 places in 147 ms of which 0 ms to minimize.
[2023-03-22 04:41:22] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1585 ms
[2023-03-22 04:41:22] [INFO ] Deduced a trap composed of 17 places in 113 ms of which 1 ms to minimize.
[2023-03-22 04:41:22] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 0 ms to minimize.
[2023-03-22 04:41:23] [INFO ] Deduced a trap composed of 24 places in 98 ms of which 0 ms to minimize.
[2023-03-22 04:41:23] [INFO ] Deduced a trap composed of 23 places in 119 ms of which 0 ms to minimize.
[2023-03-22 04:41:23] [INFO ] Deduced a trap composed of 23 places in 133 ms of which 1 ms to minimize.
[2023-03-22 04:41:23] [INFO ] Deduced a trap composed of 23 places in 103 ms of which 0 ms to minimize.
[2023-03-22 04:41:24] [INFO ] Deduced a trap composed of 23 places in 252 ms of which 0 ms to minimize.
[2023-03-22 04:41:24] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1818 ms
[2023-03-22 04:41:24] [INFO ] After 13516ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 549 ms.
[2023-03-22 04:41:25] [INFO ] After 15132ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Knowledge obtained : [(AND p0 p1 p2), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (AND p0 p1 (NOT p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (F (AND (NOT p2) p0 (NOT p1))), (F (NOT (AND p0 p1))), (F (AND (NOT p2) p0 p1)), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 12 factoid took 1270 ms. Reduced automaton from 3 states, 11 edges and 3 AP (stutter sensitive) to 3 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 223 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 251 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Support contains 4 out of 3105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3105/3105 places, 2605/2605 transitions.
Applied a total of 0 rules in 190 ms. Remains 3105 /3105 variables (removed 0) and now considering 2605/2605 (removed 0) transitions.
// Phase 1: matrix 2605 rows 3105 cols
[2023-03-22 04:41:27] [INFO ] Computed 1101 place invariants in 11 ms
[2023-03-22 04:41:29] [INFO ] Implicit Places using invariants in 2473 ms returned []
[2023-03-22 04:41:29] [INFO ] Invariant cache hit.
[2023-03-22 04:41:34] [INFO ] Implicit Places using invariants and state equation in 5088 ms returned []
Implicit Place search using SMT with State Equation took 7606 ms to find 0 implicit places.
[2023-03-22 04:41:34] [INFO ] Invariant cache hit.
[2023-03-22 04:41:36] [INFO ] Dead Transitions using invariants and state equation in 1852 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9667 ms. Remains : 3105/3105 places, 2605/2605 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X (AND p0 p1)), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (AND (NOT p2) p0 p1)), (X (NOT (AND (NOT p2) p0 p1))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p2) p0 p1))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (AND (NOT p2) p0 (NOT p1)))), (X (X (NOT (AND (NOT p2) p0 (NOT p1)))))]
Knowledge based reduction with 12 factoid took 672 ms. Reduced automaton from 3 states, 11 edges and 3 AP (stutter sensitive) to 3 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 194 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 456 ms. (steps per millisecond=21 ) properties (out of 8) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 148 ms. (steps per millisecond=67 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 145 ms. (steps per millisecond=68 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-22 04:41:38] [INFO ] Invariant cache hit.
[2023-03-22 04:41:39] [INFO ] After 548ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-22 04:41:40] [INFO ] [Nat]Absence check using 1101 positive place invariants in 325 ms returned sat
[2023-03-22 04:41:42] [INFO ] After 2052ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-22 04:41:42] [INFO ] Deduced a trap composed of 17 places in 246 ms of which 0 ms to minimize.
[2023-03-22 04:41:43] [INFO ] Deduced a trap composed of 17 places in 268 ms of which 1 ms to minimize.
[2023-03-22 04:41:43] [INFO ] Deduced a trap composed of 7 places in 152 ms of which 0 ms to minimize.
[2023-03-22 04:41:43] [INFO ] Deduced a trap composed of 17 places in 217 ms of which 0 ms to minimize.
[2023-03-22 04:41:43] [INFO ] Deduced a trap composed of 19 places in 155 ms of which 2 ms to minimize.
[2023-03-22 04:41:44] [INFO ] Deduced a trap composed of 23 places in 94 ms of which 0 ms to minimize.
[2023-03-22 04:41:44] [INFO ] Deduced a trap composed of 22 places in 165 ms of which 0 ms to minimize.
[2023-03-22 04:41:44] [INFO ] Deduced a trap composed of 17 places in 88 ms of which 0 ms to minimize.
[2023-03-22 04:41:44] [INFO ] Deduced a trap composed of 17 places in 85 ms of which 1 ms to minimize.
[2023-03-22 04:41:45] [INFO ] Deduced a trap composed of 30 places in 82 ms of which 0 ms to minimize.
[2023-03-22 04:41:45] [INFO ] Deduced a trap composed of 17 places in 201 ms of which 23 ms to minimize.
[2023-03-22 04:41:45] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 2945 ms
[2023-03-22 04:41:45] [INFO ] Deduced a trap composed of 14 places in 144 ms of which 0 ms to minimize.
[2023-03-22 04:41:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 421 ms
[2023-03-22 04:41:46] [INFO ] After 5995ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 541 ms.
[2023-03-22 04:41:46] [INFO ] After 7683ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 465 ms.
Support contains 4 out of 3105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3105/3105 places, 2605/2605 transitions.
Partial Free-agglomeration rule applied 600 times.
Drop transitions removed 600 transitions
Iterating global reduction 0 with 600 rules applied. Total rules applied 600 place count 3105 transition count 2605
Applied a total of 600 rules in 333 ms. Remains 3105 /3105 variables (removed 0) and now considering 2605/2605 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 333 ms. Remains : 3105/3105 places, 2605/2605 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 511 ms. (steps per millisecond=19 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 229 ms. (steps per millisecond=43 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 214 ms. (steps per millisecond=46 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 201 ms. (steps per millisecond=49 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 216 ms. (steps per millisecond=46 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 69903 steps, run timeout after 3005 ms. (steps per millisecond=23 ) properties seen :{}
Probabilistic random walk after 69903 steps, saw 68637 distinct states, run finished after 3005 ms. (steps per millisecond=23 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 2605 rows 3105 cols
[2023-03-22 04:41:52] [INFO ] Computed 1101 place invariants in 20 ms
[2023-03-22 04:41:52] [INFO ] After 442ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-22 04:41:53] [INFO ] [Nat]Absence check using 1101 positive place invariants in 370 ms returned sat
[2023-03-22 04:41:56] [INFO ] After 2661ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-22 04:41:56] [INFO ] Deduced a trap composed of 5 places in 197 ms of which 1 ms to minimize.
[2023-03-22 04:41:57] [INFO ] Deduced a trap composed of 5 places in 891 ms of which 0 ms to minimize.
[2023-03-22 04:41:58] [INFO ] Deduced a trap composed of 17 places in 949 ms of which 1 ms to minimize.
[2023-03-22 04:41:59] [INFO ] Deduced a trap composed of 17 places in 180 ms of which 0 ms to minimize.
[2023-03-22 04:41:59] [INFO ] Deduced a trap composed of 17 places in 195 ms of which 0 ms to minimize.
[2023-03-22 04:41:59] [INFO ] Deduced a trap composed of 23 places in 247 ms of which 0 ms to minimize.
[2023-03-22 04:42:00] [INFO ] Deduced a trap composed of 28 places in 232 ms of which 0 ms to minimize.
[2023-03-22 04:42:00] [INFO ] Deduced a trap composed of 17 places in 231 ms of which 0 ms to minimize.
[2023-03-22 04:42:00] [INFO ] Deduced a trap composed of 23 places in 192 ms of which 1 ms to minimize.
[2023-03-22 04:42:01] [INFO ] Deduced a trap composed of 17 places in 162 ms of which 1 ms to minimize.
[2023-03-22 04:42:01] [INFO ] Deduced a trap composed of 56 places in 109 ms of which 0 ms to minimize.
[2023-03-22 04:42:01] [INFO ] Deduced a trap composed of 23 places in 192 ms of which 0 ms to minimize.
[2023-03-22 04:42:01] [INFO ] Deduced a trap composed of 34 places in 172 ms of which 1 ms to minimize.
[2023-03-22 04:42:02] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 19 ms to minimize.
[2023-03-22 04:42:02] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 5864 ms
[2023-03-22 04:42:03] [INFO ] After 9427ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 503 ms.
[2023-03-22 04:42:03] [INFO ] After 11145ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 313 ms.
Support contains 4 out of 3105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3105/3105 places, 2605/2605 transitions.
Applied a total of 0 rules in 151 ms. Remains 3105 /3105 variables (removed 0) and now considering 2605/2605 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 151 ms. Remains : 3105/3105 places, 2605/2605 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3105/3105 places, 2605/2605 transitions.
Applied a total of 0 rules in 150 ms. Remains 3105 /3105 variables (removed 0) and now considering 2605/2605 (removed 0) transitions.
[2023-03-22 04:42:04] [INFO ] Invariant cache hit.
[2023-03-22 04:42:07] [INFO ] Implicit Places using invariants in 2822 ms returned []
[2023-03-22 04:42:07] [INFO ] Invariant cache hit.
[2023-03-22 04:42:13] [INFO ] Implicit Places using invariants and state equation in 6492 ms returned []
Implicit Place search using SMT with State Equation took 9341 ms to find 0 implicit places.
[2023-03-22 04:42:13] [INFO ] Redundant transitions in 67 ms returned []
[2023-03-22 04:42:13] [INFO ] Invariant cache hit.
[2023-03-22 04:42:15] [INFO ] Dead Transitions using invariants and state equation in 1939 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11518 ms. Remains : 3105/3105 places, 2605/2605 transitions.
Applied a total of 0 rules in 152 ms. Remains 3105 /3105 variables (removed 0) and now considering 2605/2605 (removed 0) transitions.
Running SMT prover for 4 properties.
[2023-03-22 04:42:15] [INFO ] Invariant cache hit.
[2023-03-22 04:42:16] [INFO ] After 434ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-22 04:42:17] [INFO ] [Nat]Absence check using 1101 positive place invariants in 299 ms returned sat
[2023-03-22 04:42:21] [INFO ] After 4285ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-22 04:42:22] [INFO ] Deduced a trap composed of 17 places in 307 ms of which 0 ms to minimize.
[2023-03-22 04:42:22] [INFO ] Deduced a trap composed of 6 places in 313 ms of which 1 ms to minimize.
[2023-03-22 04:42:23] [INFO ] Deduced a trap composed of 28 places in 346 ms of which 0 ms to minimize.
[2023-03-22 04:42:23] [INFO ] Deduced a trap composed of 17 places in 339 ms of which 1 ms to minimize.
[2023-03-22 04:42:23] [INFO ] Deduced a trap composed of 17 places in 241 ms of which 1 ms to minimize.
[2023-03-22 04:42:24] [INFO ] Deduced a trap composed of 23 places in 497 ms of which 1 ms to minimize.
[2023-03-22 04:42:24] [INFO ] Deduced a trap composed of 23 places in 245 ms of which 1 ms to minimize.
[2023-03-22 04:42:25] [INFO ] Deduced a trap composed of 6 places in 762 ms of which 0 ms to minimize.
[2023-03-22 04:42:25] [INFO ] Deduced a trap composed of 17 places in 172 ms of which 1 ms to minimize.
[2023-03-22 04:42:26] [INFO ] Deduced a trap composed of 14 places in 418 ms of which 1 ms to minimize.
[2023-03-22 04:42:27] [INFO ] Deduced a trap composed of 17 places in 634 ms of which 26 ms to minimize.
[2023-03-22 04:42:27] [INFO ] Deduced a trap composed of 12 places in 263 ms of which 10 ms to minimize.
[2023-03-22 04:42:28] [INFO ] Deduced a trap composed of 23 places in 613 ms of which 0 ms to minimize.
[2023-03-22 04:42:28] [INFO ] Deduced a trap composed of 5 places in 257 ms of which 1 ms to minimize.
[2023-03-22 04:42:29] [INFO ] Deduced a trap composed of 17 places in 286 ms of which 0 ms to minimize.
[2023-03-22 04:42:29] [INFO ] Deduced a trap composed of 23 places in 290 ms of which 1 ms to minimize.
[2023-03-22 04:42:29] [INFO ] Deduced a trap composed of 17 places in 148 ms of which 1 ms to minimize.
[2023-03-22 04:42:29] [INFO ] Deduced a trap composed of 23 places in 177 ms of which 0 ms to minimize.
[2023-03-22 04:42:30] [INFO ] Deduced a trap composed of 17 places in 247 ms of which 0 ms to minimize.
[2023-03-22 04:42:30] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 8675 ms
[2023-03-22 04:42:30] [INFO ] Deduced a trap composed of 7 places in 195 ms of which 1 ms to minimize.
[2023-03-22 04:42:31] [INFO ] Deduced a trap composed of 17 places in 116 ms of which 1 ms to minimize.
[2023-03-22 04:42:31] [INFO ] Deduced a trap composed of 23 places in 113 ms of which 1 ms to minimize.
[2023-03-22 04:42:31] [INFO ] Deduced a trap composed of 23 places in 141 ms of which 0 ms to minimize.
[2023-03-22 04:42:32] [INFO ] Deduced a trap composed of 23 places in 306 ms of which 0 ms to minimize.
[2023-03-22 04:42:32] [INFO ] Deduced a trap composed of 17 places in 212 ms of which 1 ms to minimize.
[2023-03-22 04:42:32] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1960 ms
[2023-03-22 04:42:32] [INFO ] Deduced a trap composed of 17 places in 199 ms of which 0 ms to minimize.
[2023-03-22 04:42:33] [INFO ] Deduced a trap composed of 23 places in 691 ms of which 0 ms to minimize.
[2023-03-22 04:42:33] [INFO ] Deduced a trap composed of 24 places in 149 ms of which 1 ms to minimize.
[2023-03-22 04:42:34] [INFO ] Deduced a trap composed of 23 places in 155 ms of which 1 ms to minimize.
[2023-03-22 04:42:34] [INFO ] Deduced a trap composed of 23 places in 158 ms of which 0 ms to minimize.
[2023-03-22 04:42:34] [INFO ] Deduced a trap composed of 23 places in 180 ms of which 0 ms to minimize.
[2023-03-22 04:42:35] [INFO ] Deduced a trap composed of 23 places in 156 ms of which 1 ms to minimize.
[2023-03-22 04:42:35] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2559 ms
[2023-03-22 04:42:35] [INFO ] After 18074ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 525 ms.
[2023-03-22 04:42:36] [INFO ] After 19756ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Knowledge obtained : [(AND p0 p1 p2), (X (AND p0 p1)), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (AND (NOT p2) p0 p1)), (X (NOT (AND (NOT p2) p0 p1))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p2) p0 p1))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (AND (NOT p2) p0 (NOT p1)))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (F (AND (NOT p2) p0 (NOT p1))), (F (NOT (AND p0 p1))), (F (AND (NOT p2) p0 p1)), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 12 factoid took 1281 ms. Reduced automaton from 3 states, 11 edges and 3 AP (stutter sensitive) to 3 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 226 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 198 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 124 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 20 reset in 1895 ms.
Product exploration explored 100000 steps with 21 reset in 2365 ms.
Support contains 4 out of 3105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3105/3105 places, 2605/2605 transitions.
Applied a total of 0 rules in 195 ms. Remains 3105 /3105 variables (removed 0) and now considering 2605/2605 (removed 0) transitions.
// Phase 1: matrix 2605 rows 3105 cols
[2023-03-22 04:42:42] [INFO ] Computed 1101 place invariants in 11 ms
[2023-03-22 04:42:45] [INFO ] Implicit Places using invariants in 2704 ms returned []
[2023-03-22 04:42:45] [INFO ] Invariant cache hit.
[2023-03-22 04:42:50] [INFO ] Implicit Places using invariants and state equation in 5632 ms returned []
Implicit Place search using SMT with State Equation took 8347 ms to find 0 implicit places.
[2023-03-22 04:42:50] [INFO ] Invariant cache hit.
[2023-03-22 04:42:53] [INFO ] Dead Transitions using invariants and state equation in 2128 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10671 ms. Remains : 3105/3105 places, 2605/2605 transitions.
Treatment of property ShieldPPPs-PT-100B-LTLFireability-06 finished in 161203 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((p0 U p1)))))'
[2023-03-22 04:42:53] [INFO ] Flatten gal took : 171 ms
[2023-03-22 04:42:53] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-22 04:42:53] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 6104 places, 5604 transitions and 16008 arcs took 29 ms.
Total runtime 1430118 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/5524/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/5524/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/5524/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/5524/ltl_3_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : ShieldPPPs-PT-100B-LTLFireability-03
Could not compute solution for formula : ShieldPPPs-PT-100B-LTLFireability-06
Could not compute solution for formula : ShieldPPPs-PT-100B-LTLFireability-10
Could not compute solution for formula : ShieldPPPs-PT-100B-LTLFireability-15

BK_STOP 1679460192361

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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 LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name ShieldPPPs-PT-100B-LTLFireability-03
ltl formula formula --ltl=/tmp/5524/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 6104 places, 5604 transitions and 16008 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 1.050 real 0.310 user 0.450 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/5524/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/5524/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/5524/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/5524/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name ShieldPPPs-PT-100B-LTLFireability-06
ltl formula formula --ltl=/tmp/5524/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 6104 places, 5604 transitions and 16008 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 1.260 real 0.380 user 0.600 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/5524/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/5524/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/5524/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/5524/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 5 states
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:
ltl formula name ShieldPPPs-PT-100B-LTLFireability-10
ltl formula formula --ltl=/tmp/5524/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 6104 places, 5604 transitions and 16008 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 1.190 real 0.380 user 0.620 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/5524/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/5524/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/5524/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/5524/ltl_2_
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name ShieldPPPs-PT-100B-LTLFireability-15
ltl formula formula --ltl=/tmp/5524/ltl_3_
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: =============================================================================
Warning: program compiled against libxml 210 using older 209
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
pnml2lts-mc( 0/ 4): Petri net has 6104 places, 5604 transitions and 16008 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.980 real 0.290 user 0.470 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/5524/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/5524/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/5524/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/5524/ltl_3_
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
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="ShieldPPPs-PT-100B"
export BK_EXAMINATION="LTLFireability"
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 ShieldPPPs-PT-100B, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r393-oct2-167903717100524"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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