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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.2M
-rw-r--r-- 1 mcc users 8.9K Feb 25 16:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 99K Feb 25 16:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 25 16:40 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 25 16:40 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 25 16:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 143K Feb 25 16:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Feb 25 16:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 25 16:41 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 1.7M Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679269340390

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=lolaxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPs-PT-100B
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-19 23:42:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-19 23:42:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 23:42:24] [INFO ] Load time of PNML (sax parser for PT used): 294 ms
[2023-03-19 23:42:24] [INFO ] Transformed 6003 places.
[2023-03-19 23:42:24] [INFO ] Transformed 5903 transitions.
[2023-03-19 23:42:24] [INFO ] Found NUPN structural information;
[2023-03-19 23:42:24] [INFO ] Parsed PT model containing 6003 places and 5903 transitions and 17806 arcs in 774 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA ShieldIIPs-PT-100B-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-100B-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-100B-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-100B-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-100B-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-100B-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-100B-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-100B-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-100B-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 27 out of 6003 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6003/6003 places, 5903/5903 transitions.
Discarding 695 places :
Symmetric choice reduction at 0 with 695 rule applications. Total rules 695 place count 5308 transition count 5208
Iterating global reduction 0 with 695 rules applied. Total rules applied 1390 place count 5308 transition count 5208
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1391 place count 5307 transition count 5207
Iterating global reduction 0 with 1 rules applied. Total rules applied 1392 place count 5307 transition count 5207
Applied a total of 1392 rules in 2319 ms. Remains 5307 /6003 variables (removed 696) and now considering 5207/5903 (removed 696) transitions.
// Phase 1: matrix 5207 rows 5307 cols
[2023-03-19 23:42:27] [INFO ] Computed 901 place invariants in 100 ms
[2023-03-19 23:42:31] [INFO ] Implicit Places using invariants in 4341 ms returned []
[2023-03-19 23:42:31] [INFO ] Invariant cache hit.
[2023-03-19 23:42:35] [INFO ] Implicit Places using invariants and state equation in 3446 ms returned []
Implicit Place search using SMT with State Equation took 7857 ms to find 0 implicit places.
[2023-03-19 23:42:35] [INFO ] Invariant cache hit.
[2023-03-19 23:42:41] [INFO ] Dead Transitions using invariants and state equation in 6551 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5307/6003 places, 5207/5903 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16754 ms. Remains : 5307/6003 places, 5207/5903 transitions.
Support contains 27 out of 5307 places after structural reductions.
[2023-03-19 23:42:42] [INFO ] Flatten gal took : 334 ms
[2023-03-19 23:42:42] [INFO ] Flatten gal took : 201 ms
[2023-03-19 23:42:43] [INFO ] Input system was already deterministic with 5207 transitions.
Support contains 25 out of 5307 places (down from 27) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 574 ms. (steps per millisecond=17 ) properties (out of 14) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 9) 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 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
[2023-03-19 23:42:44] [INFO ] Invariant cache hit.
[2023-03-19 23:42:45] [INFO ] After 1575ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-19 23:42:48] [INFO ] [Nat]Absence check using 901 positive place invariants in 804 ms returned sat
[2023-03-19 23:42:57] [INFO ] After 8588ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-19 23:43:02] [INFO ] Deduced a trap composed of 24 places in 3872 ms of which 13 ms to minimize.
[2023-03-19 23:43:06] [INFO ] Deduced a trap composed of 22 places in 4011 ms of which 4 ms to minimize.
[2023-03-19 23:43:10] [INFO ] Deduced a trap composed of 16 places in 4031 ms of which 8 ms to minimize.
[2023-03-19 23:43:13] [INFO ] Deduced a trap composed of 23 places in 2865 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.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-19 23:43:13] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-19 23:43:13] [INFO ] After 27787ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:9
Parikh walk visited 3 properties in 3299 ms.
Support contains 11 out of 5307 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5307/5307 places, 5207/5207 transitions.
Drop transitions removed 500 transitions
Trivial Post-agglo rules discarded 500 transitions
Performed 500 trivial Post agglomeration. Transition count delta: 500
Iterating post reduction 0 with 500 rules applied. Total rules applied 500 place count 5307 transition count 4707
Reduce places removed 500 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 501 rules applied. Total rules applied 1001 place count 4807 transition count 4706
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1002 place count 4806 transition count 4706
Performed 500 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 500 Pre rules applied. Total rules applied 1002 place count 4806 transition count 4206
Deduced a syphon composed of 500 places in 27 ms
Reduce places removed 500 places and 0 transitions.
Iterating global reduction 3 with 1000 rules applied. Total rules applied 2002 place count 4306 transition count 4206
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 2005 place count 4303 transition count 4203
Iterating global reduction 3 with 3 rules applied. Total rules applied 2008 place count 4303 transition count 4203
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 2008 place count 4303 transition count 4201
Deduced a syphon composed of 2 places in 56 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 2012 place count 4301 transition count 4201
Performed 1792 Post agglomeration using F-continuation condition.Transition count delta: 1792
Deduced a syphon composed of 1792 places in 15 ms
Reduce places removed 1792 places and 0 transitions.
Iterating global reduction 3 with 3584 rules applied. Total rules applied 5596 place count 2509 transition count 2409
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 693 times.
Drop transitions removed 693 transitions
Iterating global reduction 3 with 693 rules applied. Total rules applied 6289 place count 2509 transition count 2409
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 6290 place count 2508 transition count 2408
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 6291 place count 2507 transition count 2408
Applied a total of 6291 rules in 2445 ms. Remains 2507 /5307 variables (removed 2800) and now considering 2408/5207 (removed 2799) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2446 ms. Remains : 2507/5307 places, 2408/5207 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 375 ms. (steps per millisecond=26 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 2408 rows 2507 cols
[2023-03-19 23:43:20] [INFO ] Computed 900 place invariants in 109 ms
[2023-03-19 23:43:21] [INFO ] After 861ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-19 23:43:23] [INFO ] [Nat]Absence check using 897 positive place invariants in 1092 ms returned sat
[2023-03-19 23:43:23] [INFO ] [Nat]Absence check using 897 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-19 23:43:27] [INFO ] After 3823ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-19 23:43:27] [INFO ] Deduced a trap composed of 14 places in 255 ms of which 1 ms to minimize.
[2023-03-19 23:43:27] [INFO ] Deduced a trap composed of 5 places in 181 ms of which 0 ms to minimize.
[2023-03-19 23:43:28] [INFO ] Deduced a trap composed of 32 places in 238 ms of which 1 ms to minimize.
[2023-03-19 23:43:28] [INFO ] Deduced a trap composed of 5 places in 249 ms of which 0 ms to minimize.
[2023-03-19 23:43:28] [INFO ] Deduced a trap composed of 11 places in 331 ms of which 1 ms to minimize.
[2023-03-19 23:43:29] [INFO ] Deduced a trap composed of 14 places in 211 ms of which 1 ms to minimize.
[2023-03-19 23:43:29] [INFO ] Deduced a trap composed of 14 places in 150 ms of which 1 ms to minimize.
[2023-03-19 23:43:29] [INFO ] Deduced a trap composed of 20 places in 257 ms of which 1 ms to minimize.
[2023-03-19 23:43:29] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2742 ms
[2023-03-19 23:43:30] [INFO ] Deduced a trap composed of 4 places in 171 ms of which 1 ms to minimize.
[2023-03-19 23:43:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 368 ms
[2023-03-19 23:43:31] [INFO ] After 7677ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 562 ms.
[2023-03-19 23:43:31] [INFO ] After 10248ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 814 ms.
Support contains 9 out of 2507 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2507/2507 places, 2408/2408 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 8 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 2506 transition count 2407
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 2506 transition count 2407
Applied a total of 4 rules in 248 ms. Remains 2506 /2507 variables (removed 1) and now considering 2407/2408 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 248 ms. Remains : 2506/2507 places, 2407/2408 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 496 ms. (steps per millisecond=20 ) properties (out of 5) 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 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 274 ms. (steps per millisecond=36 ) properties (out of 5) 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 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 265 ms. (steps per millisecond=37 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 251 ms. (steps per millisecond=39 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 50341 steps, run timeout after 3001 ms. (steps per millisecond=16 ) properties seen :{}
Probabilistic random walk after 50341 steps, saw 49663 distinct states, run finished after 3004 ms. (steps per millisecond=16 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 2407 rows 2506 cols
[2023-03-19 23:43:37] [INFO ] Computed 900 place invariants in 17 ms
[2023-03-19 23:43:37] [INFO ] After 470ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-19 23:43:39] [INFO ] [Nat]Absence check using 897 positive place invariants in 459 ms returned sat
[2023-03-19 23:43:39] [INFO ] [Nat]Absence check using 897 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-19 23:43:41] [INFO ] After 2443ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-19 23:43:42] [INFO ] Deduced a trap composed of 5 places in 187 ms of which 1 ms to minimize.
[2023-03-19 23:43:42] [INFO ] Deduced a trap composed of 8 places in 165 ms of which 1 ms to minimize.
[2023-03-19 23:43:42] [INFO ] Deduced a trap composed of 4 places in 157 ms of which 1 ms to minimize.
[2023-03-19 23:43:42] [INFO ] Deduced a trap composed of 4 places in 181 ms of which 0 ms to minimize.
[2023-03-19 23:43:43] [INFO ] Deduced a trap composed of 14 places in 282 ms of which 1 ms to minimize.
[2023-03-19 23:43:43] [INFO ] Deduced a trap composed of 17 places in 123 ms of which 0 ms to minimize.
[2023-03-19 23:43:43] [INFO ] Deduced a trap composed of 3 places in 192 ms of which 0 ms to minimize.
[2023-03-19 23:43:44] [INFO ] Deduced a trap composed of 6 places in 177 ms of which 1 ms to minimize.
[2023-03-19 23:43:44] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2531 ms
[2023-03-19 23:43:45] [INFO ] After 6000ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 595 ms.
[2023-03-19 23:43:45] [INFO ] After 7959ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 478 ms.
Support contains 9 out of 2506 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2506/2506 places, 2407/2407 transitions.
Applied a total of 0 rules in 177 ms. Remains 2506 /2506 variables (removed 0) and now considering 2407/2407 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 177 ms. Remains : 2506/2506 places, 2407/2407 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2506/2506 places, 2407/2407 transitions.
Applied a total of 0 rules in 80 ms. Remains 2506 /2506 variables (removed 0) and now considering 2407/2407 (removed 0) transitions.
[2023-03-19 23:43:46] [INFO ] Invariant cache hit.
[2023-03-19 23:43:50] [INFO ] Implicit Places using invariants in 3837 ms returned []
[2023-03-19 23:43:50] [INFO ] Invariant cache hit.
[2023-03-19 23:43:56] [INFO ] Implicit Places using invariants and state equation in 5597 ms returned []
Implicit Place search using SMT with State Equation took 9454 ms to find 0 implicit places.
[2023-03-19 23:43:56] [INFO ] Redundant transitions in 148 ms returned []
[2023-03-19 23:43:56] [INFO ] Invariant cache hit.
[2023-03-19 23:43:58] [INFO ] Dead Transitions using invariants and state equation in 1917 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11621 ms. Remains : 2506/2506 places, 2407/2407 transitions.
Applied a total of 0 rules in 88 ms. Remains 2506 /2506 variables (removed 0) and now considering 2407/2407 (removed 0) transitions.
Running SMT prover for 5 properties.
[2023-03-19 23:43:58] [INFO ] Invariant cache hit.
[2023-03-19 23:43:58] [INFO ] After 469ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-19 23:43:59] [INFO ] [Nat]Absence check using 897 positive place invariants in 539 ms returned sat
[2023-03-19 23:43:59] [INFO ] [Nat]Absence check using 897 positive and 3 generalized place invariants in 5 ms returned sat
[2023-03-19 23:44:02] [INFO ] After 2044ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-19 23:44:02] [INFO ] Deduced a trap composed of 5 places in 329 ms of which 1 ms to minimize.
[2023-03-19 23:44:02] [INFO ] Deduced a trap composed of 4 places in 98 ms of which 0 ms to minimize.
[2023-03-19 23:44:03] [INFO ] Deduced a trap composed of 11 places in 191 ms of which 0 ms to minimize.
[2023-03-19 23:44:03] [INFO ] Deduced a trap composed of 4 places in 249 ms of which 1 ms to minimize.
[2023-03-19 23:44:03] [INFO ] Deduced a trap composed of 5 places in 145 ms of which 1 ms to minimize.
[2023-03-19 23:44:04] [INFO ] Deduced a trap composed of 8 places in 144 ms of which 0 ms to minimize.
[2023-03-19 23:44:04] [INFO ] Deduced a trap composed of 8 places in 251 ms of which 0 ms to minimize.
[2023-03-19 23:44:04] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2319 ms
[2023-03-19 23:44:05] [INFO ] Deduced a trap composed of 18 places in 264 ms of which 1 ms to minimize.
[2023-03-19 23:44:05] [INFO ] Deduced a trap composed of 8 places in 227 ms of which 0 ms to minimize.
[2023-03-19 23:44:05] [INFO ] Deduced a trap composed of 17 places in 167 ms of which 1 ms to minimize.
[2023-03-19 23:44:06] [INFO ] Deduced a trap composed of 5 places in 271 ms of which 5 ms to minimize.
[2023-03-19 23:44:06] [INFO ] Deduced a trap composed of 11 places in 393 ms of which 0 ms to minimize.
[2023-03-19 23:44:07] [INFO ] Deduced a trap composed of 4 places in 237 ms of which 0 ms to minimize.
[2023-03-19 23:44:07] [INFO ] Deduced a trap composed of 8 places in 164 ms of which 1 ms to minimize.
[2023-03-19 23:44:07] [INFO ] Deduced a trap composed of 17 places in 181 ms of which 1 ms to minimize.
[2023-03-19 23:44:07] [INFO ] Deduced a trap composed of 9 places in 163 ms of which 4 ms to minimize.
[2023-03-19 23:44:08] [INFO ] Deduced a trap composed of 4 places in 246 ms of which 2 ms to minimize.
[2023-03-19 23:44:08] [INFO ] Deduced a trap composed of 4 places in 192 ms of which 2 ms to minimize.
[2023-03-19 23:44:08] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 3630 ms
[2023-03-19 23:44:08] [INFO ] After 8722ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 673 ms.
[2023-03-19 23:44:09] [INFO ] After 10779ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Computed a total of 1202 stabilizing places and 1202 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(F(p0)))'
Support contains 2 out of 5307 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5307/5307 places, 5207/5207 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 5303 transition count 5203
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 5303 transition count 5203
Applied a total of 8 rules in 1325 ms. Remains 5303 /5307 variables (removed 4) and now considering 5203/5207 (removed 4) transitions.
// Phase 1: matrix 5203 rows 5303 cols
[2023-03-19 23:44:11] [INFO ] Computed 901 place invariants in 40 ms
[2023-03-19 23:44:14] [INFO ] Implicit Places using invariants in 2946 ms returned []
[2023-03-19 23:44:14] [INFO ] Invariant cache hit.
[2023-03-19 23:44:17] [INFO ] Implicit Places using invariants and state equation in 3086 ms returned []
Implicit Place search using SMT with State Equation took 6051 ms to find 0 implicit places.
[2023-03-19 23:44:17] [INFO ] Invariant cache hit.
[2023-03-19 23:44:22] [INFO ] Dead Transitions using invariants and state equation in 5477 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5303/5307 places, 5203/5207 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12870 ms. Remains : 5303/5307 places, 5203/5207 transitions.
Stuttering acceptance computed with spot in 358 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-100B-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s2221 0) (EQ s183 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 2111 ms.
Product exploration explored 100000 steps with 50000 reset in 2163 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 87 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPs-PT-100B-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPs-PT-100B-LTLCardinality-01 finished in 17861 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(X(X(F(p0)))))))'
Support contains 2 out of 5307 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5307/5307 places, 5207/5207 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 5302 transition count 5202
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 5302 transition count 5202
Applied a total of 10 rules in 1369 ms. Remains 5302 /5307 variables (removed 5) and now considering 5202/5207 (removed 5) transitions.
// Phase 1: matrix 5202 rows 5302 cols
[2023-03-19 23:44:29] [INFO ] Computed 901 place invariants in 26 ms
[2023-03-19 23:44:31] [INFO ] Implicit Places using invariants in 2208 ms returned []
[2023-03-19 23:44:31] [INFO ] Invariant cache hit.
[2023-03-19 23:44:34] [INFO ] Implicit Places using invariants and state equation in 2918 ms returned []
Implicit Place search using SMT with State Equation took 5128 ms to find 0 implicit places.
[2023-03-19 23:44:34] [INFO ] Invariant cache hit.
[2023-03-19 23:44:40] [INFO ] Dead Transitions using invariants and state equation in 5824 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5302/5307 places, 5202/5207 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12348 ms. Remains : 5302/5307 places, 5202/5207 transitions.
Stuttering acceptance computed with spot in 385 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-100B-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 3}]], initial=4, aps=[p0:(AND (NEQ s2658 0) (NEQ s3608 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, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 12343 steps with 0 reset in 224 ms.
FORMULA ShieldIIPs-PT-100B-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-100B-LTLCardinality-03 finished in 13053 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)))'
Support contains 2 out of 5307 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5307/5307 places, 5207/5207 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 5303 transition count 5203
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 5303 transition count 5203
Applied a total of 8 rules in 1318 ms. Remains 5303 /5307 variables (removed 4) and now considering 5203/5207 (removed 4) transitions.
// Phase 1: matrix 5203 rows 5303 cols
[2023-03-19 23:44:42] [INFO ] Computed 901 place invariants in 61 ms
[2023-03-19 23:44:45] [INFO ] Implicit Places using invariants in 3013 ms returned []
[2023-03-19 23:44:45] [INFO ] Invariant cache hit.
[2023-03-19 23:44:47] [INFO ] Implicit Places using invariants and state equation in 2293 ms returned []
Implicit Place search using SMT with State Equation took 5317 ms to find 0 implicit places.
[2023-03-19 23:44:47] [INFO ] Invariant cache hit.
[2023-03-19 23:44:53] [INFO ] Dead Transitions using invariants and state equation in 6147 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5303/5307 places, 5203/5207 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12785 ms. Remains : 5303/5307 places, 5203/5207 transitions.
Stuttering acceptance computed with spot in 130 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-100B-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s3879 0) (EQ s2205 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 873 steps with 0 reset in 7 ms.
FORMULA ShieldIIPs-PT-100B-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-100B-LTLCardinality-05 finished in 12986 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&&F(G(((p1 U X(p2)) U p0))))))'
Support contains 6 out of 5307 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5307/5307 places, 5207/5207 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 5303 transition count 5203
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 5303 transition count 5203
Applied a total of 8 rules in 1237 ms. Remains 5303 /5307 variables (removed 4) and now considering 5203/5207 (removed 4) transitions.
// Phase 1: matrix 5203 rows 5303 cols
[2023-03-19 23:44:55] [INFO ] Computed 901 place invariants in 27 ms
[2023-03-19 23:44:57] [INFO ] Implicit Places using invariants in 2479 ms returned []
[2023-03-19 23:44:57] [INFO ] Invariant cache hit.
[2023-03-19 23:45:00] [INFO ] Implicit Places using invariants and state equation in 3089 ms returned []
Implicit Place search using SMT with State Equation took 5593 ms to find 0 implicit places.
[2023-03-19 23:45:00] [INFO ] Invariant cache hit.
[2023-03-19 23:45:05] [INFO ] Dead Transitions using invariants and state equation in 4444 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5303/5307 places, 5203/5207 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11288 ms. Remains : 5303/5307 places, 5203/5207 transitions.
Stuttering acceptance computed with spot in 407 ms :[(NOT p0), (NOT p0), true, (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ShieldIIPs-PT-100B-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 4}, { cond=(NOT p0), acceptance={0} source=3 dest: 5}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 6}], [{ cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=4 dest: 5}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=4 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=5 dest: 4}, { cond=(NOT p0), acceptance={0} source=5 dest: 5}, { cond=(AND (NOT p0) p1), acceptance={0} source=5 dest: 6}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=6 dest: 4}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(OR (EQ s428 0) (EQ s4955 1)), p1:(OR (EQ s1065 0) (EQ s4769 1)), p2:(OR (EQ s3476 0) (EQ s2102 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 9 reset in 1685 ms.
Product exploration explored 100000 steps with 9 reset in 2235 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 p0), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 474 ms. Reduced automaton from 7 states, 19 edges and 3 AP (stutter sensitive) to 4 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 328 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 478 ms. (steps per millisecond=20 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 9) 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 9) 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 9) seen :0
Interrupted probabilistic random walk after 76230 steps, run timeout after 3001 ms. (steps per millisecond=25 ) properties seen :{}
Probabilistic random walk after 76230 steps, saw 75254 distinct states, run finished after 3001 ms. (steps per millisecond=25 ) properties seen :0
Running SMT prover for 9 properties.
[2023-03-19 23:45:14] [INFO ] Invariant cache hit.
[2023-03-19 23:45:15] [INFO ] After 1356ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-19 23:45:17] [INFO ] [Nat]Absence check using 901 positive place invariants in 705 ms returned sat
[2023-03-19 23:45:25] [INFO ] After 6713ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-19 23:45:28] [INFO ] Deduced a trap composed of 14 places in 2413 ms of which 3 ms to minimize.
[2023-03-19 23:45:31] [INFO ] Deduced a trap composed of 35 places in 3385 ms of which 3 ms to minimize.
[2023-03-19 23:45:36] [INFO ] Deduced a trap composed of 11 places in 4144 ms of which 3 ms to minimize.
[2023-03-19 23:45:39] [INFO ] Deduced a trap composed of 27 places in 3554 ms of which 4 ms to minimize.
[2023-03-19 23:45:42] [INFO ] Deduced a trap composed of 18 places in 2879 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-19 23:45:42] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-19 23:45:42] [INFO ] After 27159ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:9
Fused 9 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 2924 ms.
Support contains 6 out of 5303 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5303/5303 places, 5203/5203 transitions.
Drop transitions removed 500 transitions
Trivial Post-agglo rules discarded 500 transitions
Performed 500 trivial Post agglomeration. Transition count delta: 500
Iterating post reduction 0 with 500 rules applied. Total rules applied 500 place count 5303 transition count 4703
Reduce places removed 500 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 501 rules applied. Total rules applied 1001 place count 4803 transition count 4702
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1002 place count 4802 transition count 4702
Performed 500 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 500 Pre rules applied. Total rules applied 1002 place count 4802 transition count 4202
Deduced a syphon composed of 500 places in 25 ms
Reduce places removed 500 places and 0 transitions.
Iterating global reduction 3 with 1000 rules applied. Total rules applied 2002 place count 4302 transition count 4202
Performed 1797 Post agglomeration using F-continuation condition.Transition count delta: 1797
Deduced a syphon composed of 1797 places in 17 ms
Reduce places removed 1797 places and 0 transitions.
Iterating global reduction 3 with 3594 rules applied. Total rules applied 5596 place count 2505 transition count 2405
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 695 times.
Drop transitions removed 695 transitions
Iterating global reduction 3 with 695 rules applied. Total rules applied 6291 place count 2505 transition count 2405
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 6292 place count 2504 transition count 2404
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 6293 place count 2503 transition count 2404
Applied a total of 6293 rules in 1450 ms. Remains 2503 /5303 variables (removed 2800) and now considering 2404/5203 (removed 2799) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1462 ms. Remains : 2503/5303 places, 2404/5203 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 510 ms. (steps per millisecond=19 ) properties (out of 9) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 137 ms. (steps per millisecond=72 ) properties (out of 7) 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 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 157 ms. (steps per millisecond=63 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 221 ms. (steps per millisecond=45 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 177 ms. (steps per millisecond=56 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 2404 rows 2503 cols
[2023-03-19 23:45:48] [INFO ] Computed 900 place invariants in 32 ms
[2023-03-19 23:45:49] [INFO ] After 723ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-19 23:45:50] [INFO ] [Nat]Absence check using 898 positive place invariants in 223 ms returned sat
[2023-03-19 23:45:50] [INFO ] [Nat]Absence check using 898 positive and 2 generalized place invariants in 3 ms returned sat
[2023-03-19 23:45:53] [INFO ] After 2550ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-19 23:45:53] [INFO ] Deduced a trap composed of 4 places in 188 ms of which 1 ms to minimize.
[2023-03-19 23:45:54] [INFO ] Deduced a trap composed of 11 places in 209 ms of which 0 ms to minimize.
[2023-03-19 23:45:54] [INFO ] Deduced a trap composed of 5 places in 397 ms of which 1 ms to minimize.
[2023-03-19 23:45:55] [INFO ] Deduced a trap composed of 17 places in 420 ms of which 34 ms to minimize.
[2023-03-19 23:45:55] [INFO ] Deduced a trap composed of 9 places in 204 ms of which 1 ms to minimize.
[2023-03-19 23:45:55] [INFO ] Deduced a trap composed of 17 places in 129 ms of which 1 ms to minimize.
[2023-03-19 23:45:56] [INFO ] Deduced a trap composed of 9 places in 159 ms of which 1 ms to minimize.
[2023-03-19 23:45:56] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2598 ms
[2023-03-19 23:45:57] [INFO ] Deduced a trap composed of 11 places in 223 ms of which 1 ms to minimize.
[2023-03-19 23:45:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 431 ms
[2023-03-19 23:45:58] [INFO ] Deduced a trap composed of 18 places in 445 ms of which 3 ms to minimize.
[2023-03-19 23:45:58] [INFO ] Deduced a trap composed of 8 places in 234 ms of which 1 ms to minimize.
[2023-03-19 23:45:59] [INFO ] Deduced a trap composed of 9 places in 198 ms of which 1 ms to minimize.
[2023-03-19 23:45:59] [INFO ] Deduced a trap composed of 11 places in 177 ms of which 0 ms to minimize.
[2023-03-19 23:45:59] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1671 ms
[2023-03-19 23:45:59] [INFO ] After 8464ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 869 ms.
[2023-03-19 23:46:00] [INFO ] After 10735ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Fused 7 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 817 ms.
Support contains 6 out of 2503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2503/2503 places, 2404/2404 transitions.
Applied a total of 0 rules in 106 ms. Remains 2503 /2503 variables (removed 0) and now considering 2404/2404 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 106 ms. Remains : 2503/2503 places, 2404/2404 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 574 ms. (steps per millisecond=17 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 168 ms. (steps per millisecond=59 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 143 ms. (steps per millisecond=69 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 170 ms. (steps per millisecond=58 ) properties (out of 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 157 ms. (steps per millisecond=63 ) properties (out of 7) 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 7) seen :0
Interrupted probabilistic random walk after 58190 steps, run timeout after 3015 ms. (steps per millisecond=19 ) properties seen :{1=1, 2=1, 4=1, 5=1}
Probabilistic random walk after 58190 steps, saw 57470 distinct states, run finished after 3016 ms. (steps per millisecond=19 ) properties seen :4
Running SMT prover for 3 properties.
[2023-03-19 23:46:06] [INFO ] Invariant cache hit.
[2023-03-19 23:46:06] [INFO ] After 678ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-19 23:46:07] [INFO ] [Nat]Absence check using 898 positive place invariants in 382 ms returned sat
[2023-03-19 23:46:07] [INFO ] [Nat]Absence check using 898 positive and 2 generalized place invariants in 26 ms returned sat
[2023-03-19 23:46:09] [INFO ] After 2058ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-19 23:46:10] [INFO ] Deduced a trap composed of 8 places in 267 ms of which 0 ms to minimize.
[2023-03-19 23:46:11] [INFO ] Deduced a trap composed of 8 places in 961 ms of which 0 ms to minimize.
[2023-03-19 23:46:11] [INFO ] Deduced a trap composed of 8 places in 294 ms of which 1 ms to minimize.
[2023-03-19 23:46:12] [INFO ] Deduced a trap composed of 9 places in 272 ms of which 10 ms to minimize.
[2023-03-19 23:46:12] [INFO ] Deduced a trap composed of 17 places in 205 ms of which 0 ms to minimize.
[2023-03-19 23:46:12] [INFO ] Deduced a trap composed of 16 places in 179 ms of which 5 ms to minimize.
[2023-03-19 23:46:13] [INFO ] Deduced a trap composed of 17 places in 282 ms of which 0 ms to minimize.
[2023-03-19 23:46:13] [INFO ] Deduced a trap composed of 18 places in 494 ms of which 14 ms to minimize.
[2023-03-19 23:46:14] [INFO ] Deduced a trap composed of 8 places in 729 ms of which 1 ms to minimize.
[2023-03-19 23:46:15] [INFO ] Deduced a trap composed of 23 places in 419 ms of which 1 ms to minimize.
[2023-03-19 23:46:15] [INFO ] Deduced a trap composed of 17 places in 188 ms of which 1 ms to minimize.
[2023-03-19 23:46:15] [INFO ] Deduced a trap composed of 18 places in 231 ms of which 1 ms to minimize.
[2023-03-19 23:46:16] [INFO ] Deduced a trap composed of 17 places in 175 ms of which 0 ms to minimize.
[2023-03-19 23:46:16] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 6330 ms
[2023-03-19 23:46:16] [INFO ] Deduced a trap composed of 11 places in 488 ms of which 0 ms to minimize.
[2023-03-19 23:46:17] [INFO ] Deduced a trap composed of 8 places in 585 ms of which 1 ms to minimize.
[2023-03-19 23:46:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1410 ms
[2023-03-19 23:46:18] [INFO ] Deduced a trap composed of 8 places in 214 ms of which 1 ms to minimize.
[2023-03-19 23:46:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 456 ms
[2023-03-19 23:46:18] [INFO ] After 10576ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 540 ms.
[2023-03-19 23:46:18] [INFO ] After 12126ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 260 ms.
Support contains 6 out of 2503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2503/2503 places, 2404/2404 transitions.
Applied a total of 0 rules in 116 ms. Remains 2503 /2503 variables (removed 0) and now considering 2404/2404 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 116 ms. Remains : 2503/2503 places, 2404/2404 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 565 ms. (steps per millisecond=17 ) properties (out of 3) 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 3) 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 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 91353 steps, run timeout after 3014 ms. (steps per millisecond=30 ) properties seen :{2=1}
Probabilistic random walk after 91353 steps, saw 90468 distinct states, run finished after 3015 ms. (steps per millisecond=30 ) properties seen :1
Running SMT prover for 2 properties.
[2023-03-19 23:46:23] [INFO ] Invariant cache hit.
[2023-03-19 23:46:23] [INFO ] After 494ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 23:46:24] [INFO ] [Nat]Absence check using 898 positive place invariants in 483 ms returned sat
[2023-03-19 23:46:24] [INFO ] [Nat]Absence check using 898 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-19 23:46:26] [INFO ] After 2054ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 23:46:27] [INFO ] Deduced a trap composed of 9 places in 679 ms of which 1 ms to minimize.
[2023-03-19 23:46:28] [INFO ] Deduced a trap composed of 8 places in 781 ms of which 1 ms to minimize.
[2023-03-19 23:46:28] [INFO ] Deduced a trap composed of 8 places in 301 ms of which 1 ms to minimize.
[2023-03-19 23:46:29] [INFO ] Deduced a trap composed of 18 places in 200 ms of which 1 ms to minimize.
[2023-03-19 23:46:29] [INFO ] Deduced a trap composed of 4 places in 290 ms of which 1 ms to minimize.
[2023-03-19 23:46:30] [INFO ] Deduced a trap composed of 17 places in 353 ms of which 1 ms to minimize.
[2023-03-19 23:46:30] [INFO ] Deduced a trap composed of 4 places in 165 ms of which 1 ms to minimize.
[2023-03-19 23:46:30] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 3745 ms
[2023-03-19 23:46:31] [INFO ] Deduced a trap composed of 4 places in 132 ms of which 1 ms to minimize.
[2023-03-19 23:46:31] [INFO ] Deduced a trap composed of 9 places in 274 ms of which 1 ms to minimize.
[2023-03-19 23:46:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 683 ms
[2023-03-19 23:46:31] [INFO ] After 6748ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 276 ms.
[2023-03-19 23:46:31] [INFO ] After 8168ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 280 ms.
Support contains 6 out of 2503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2503/2503 places, 2404/2404 transitions.
Applied a total of 0 rules in 109 ms. Remains 2503 /2503 variables (removed 0) and now considering 2404/2404 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 109 ms. Remains : 2503/2503 places, 2404/2404 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 314 ms. (steps per millisecond=31 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 90359 steps, run timeout after 3005 ms. (steps per millisecond=30 ) properties seen :{}
Probabilistic random walk after 90359 steps, saw 89479 distinct states, run finished after 3005 ms. (steps per millisecond=30 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-19 23:46:35] [INFO ] Invariant cache hit.
[2023-03-19 23:46:36] [INFO ] After 317ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 23:46:36] [INFO ] [Nat]Absence check using 898 positive place invariants in 465 ms returned sat
[2023-03-19 23:46:36] [INFO ] [Nat]Absence check using 898 positive and 2 generalized place invariants in 26 ms returned sat
[2023-03-19 23:46:39] [INFO ] After 2119ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 23:46:39] [INFO ] Deduced a trap composed of 9 places in 237 ms of which 1 ms to minimize.
[2023-03-19 23:46:40] [INFO ] Deduced a trap composed of 8 places in 321 ms of which 1 ms to minimize.
[2023-03-19 23:46:40] [INFO ] Deduced a trap composed of 8 places in 417 ms of which 1 ms to minimize.
[2023-03-19 23:46:41] [INFO ] Deduced a trap composed of 18 places in 299 ms of which 1 ms to minimize.
[2023-03-19 23:46:41] [INFO ] Deduced a trap composed of 4 places in 157 ms of which 1 ms to minimize.
[2023-03-19 23:46:41] [INFO ] Deduced a trap composed of 17 places in 206 ms of which 0 ms to minimize.
[2023-03-19 23:46:41] [INFO ] Deduced a trap composed of 4 places in 190 ms of which 1 ms to minimize.
[2023-03-19 23:46:42] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2799 ms
[2023-03-19 23:46:42] [INFO ] Deduced a trap composed of 4 places in 249 ms of which 1 ms to minimize.
[2023-03-19 23:46:42] [INFO ] Deduced a trap composed of 9 places in 187 ms of which 0 ms to minimize.
[2023-03-19 23:46:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 738 ms
[2023-03-19 23:46:43] [INFO ] After 5865ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 282 ms.
[2023-03-19 23:46:43] [INFO ] After 7142ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 154 ms.
Support contains 6 out of 2503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2503/2503 places, 2404/2404 transitions.
Applied a total of 0 rules in 110 ms. Remains 2503 /2503 variables (removed 0) and now considering 2404/2404 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 111 ms. Remains : 2503/2503 places, 2404/2404 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2503/2503 places, 2404/2404 transitions.
Applied a total of 0 rules in 109 ms. Remains 2503 /2503 variables (removed 0) and now considering 2404/2404 (removed 0) transitions.
[2023-03-19 23:46:43] [INFO ] Invariant cache hit.
[2023-03-19 23:46:46] [INFO ] Implicit Places using invariants in 2569 ms returned []
[2023-03-19 23:46:46] [INFO ] Invariant cache hit.
[2023-03-19 23:46:52] [INFO ] Implicit Places using invariants and state equation in 6238 ms returned []
Implicit Place search using SMT with State Equation took 8830 ms to find 0 implicit places.
[2023-03-19 23:46:52] [INFO ] Redundant transitions in 138 ms returned []
[2023-03-19 23:46:52] [INFO ] Invariant cache hit.
[2023-03-19 23:46:54] [INFO ] Dead Transitions using invariants and state equation in 2081 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11191 ms. Remains : 2503/2503 places, 2404/2404 transitions.
Knowledge obtained : [(AND p0 p1 p2), (X p0), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(F (NOT p2)), (F (AND (NOT p2) (NOT p0) p1)), (F (AND (NOT p2) (NOT p0))), (F (AND (NOT p0) p1)), (F (NOT p0)), (F (AND (NOT p2) p0 p1)), (F (AND (NOT p2) p0 (NOT p1)))]
Knowledge based reduction with 6 factoid took 539 ms. Reduced automaton from 4 states, 15 edges and 3 AP (stutter sensitive) to 4 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 249 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 283 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2))]
Support contains 6 out of 5303 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5303/5303 places, 5203/5203 transitions.
Applied a total of 0 rules in 707 ms. Remains 5303 /5303 variables (removed 0) and now considering 5203/5203 (removed 0) transitions.
// Phase 1: matrix 5203 rows 5303 cols
[2023-03-19 23:46:56] [INFO ] Computed 901 place invariants in 51 ms
[2023-03-19 23:46:59] [INFO ] Implicit Places using invariants in 2543 ms returned []
[2023-03-19 23:46:59] [INFO ] Invariant cache hit.
[2023-03-19 23:47:01] [INFO ] Implicit Places using invariants and state equation in 2163 ms returned []
Implicit Place search using SMT with State Equation took 4722 ms to find 0 implicit places.
[2023-03-19 23:47:01] [INFO ] Invariant cache hit.
[2023-03-19 23:47:09] [INFO ] Dead Transitions using invariants and state equation in 8309 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13739 ms. Remains : 5303/5303 places, 5203/5203 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 (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X p2), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT (AND (NOT p2) p0 p1))), (X p0), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), true, (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 20 factoid took 1634 ms. Reduced automaton from 4 states, 15 edges and 3 AP (stutter sensitive) to 4 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 288 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 474 ms. (steps per millisecond=21 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 9) 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 9) 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 9) 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 9) 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 9) 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 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 9) seen :0
Interrupted probabilistic random walk after 84036 steps, run timeout after 3003 ms. (steps per millisecond=27 ) properties seen :{}
Probabilistic random walk after 84036 steps, saw 82930 distinct states, run finished after 3004 ms. (steps per millisecond=27 ) properties seen :0
Running SMT prover for 9 properties.
[2023-03-19 23:47:15] [INFO ] Invariant cache hit.
[2023-03-19 23:47:17] [INFO ] After 1418ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-19 23:47:18] [INFO ] [Nat]Absence check using 901 positive place invariants in 579 ms returned sat
[2023-03-19 23:47:28] [INFO ] After 8612ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-19 23:47:31] [INFO ] Deduced a trap composed of 14 places in 2279 ms of which 5 ms to minimize.
[2023-03-19 23:47:33] [INFO ] Deduced a trap composed of 35 places in 1917 ms of which 6 ms to minimize.
[2023-03-19 23:47:37] [INFO ] Deduced a trap composed of 11 places in 3909 ms of which 15 ms to minimize.
[2023-03-19 23:47:39] [INFO ] Deduced a trap composed of 27 places in 2323 ms of which 5 ms to minimize.
[2023-03-19 23:47:41] [INFO ] Deduced a trap composed of 18 places in 1730 ms of which 3 ms to minimize.
[2023-03-19 23:47:44] [INFO ] Deduced a trap composed of 20 places in 2794 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-19 23:47:44] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-19 23:47:44] [INFO ] After 27744ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:9
Fused 9 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 2881 ms.
Support contains 6 out of 5303 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5303/5303 places, 5203/5203 transitions.
Drop transitions removed 500 transitions
Trivial Post-agglo rules discarded 500 transitions
Performed 500 trivial Post agglomeration. Transition count delta: 500
Iterating post reduction 0 with 500 rules applied. Total rules applied 500 place count 5303 transition count 4703
Reduce places removed 500 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 501 rules applied. Total rules applied 1001 place count 4803 transition count 4702
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1002 place count 4802 transition count 4702
Performed 500 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 500 Pre rules applied. Total rules applied 1002 place count 4802 transition count 4202
Deduced a syphon composed of 500 places in 24 ms
Reduce places removed 500 places and 0 transitions.
Iterating global reduction 3 with 1000 rules applied. Total rules applied 2002 place count 4302 transition count 4202
Performed 1797 Post agglomeration using F-continuation condition.Transition count delta: 1797
Deduced a syphon composed of 1797 places in 17 ms
Reduce places removed 1797 places and 0 transitions.
Iterating global reduction 3 with 3594 rules applied. Total rules applied 5596 place count 2505 transition count 2405
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 695 times.
Drop transitions removed 695 transitions
Iterating global reduction 3 with 695 rules applied. Total rules applied 6291 place count 2505 transition count 2405
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 6292 place count 2504 transition count 2404
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 6293 place count 2503 transition count 2404
Applied a total of 6293 rules in 1628 ms. Remains 2503 /5303 variables (removed 2800) and now considering 2404/5203 (removed 2799) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1628 ms. Remains : 2503/5303 places, 2404/5203 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 714 ms. (steps per millisecond=14 ) properties (out of 9) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 218 ms. (steps per millisecond=45 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 153 ms. (steps per millisecond=65 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 146 ms. (steps per millisecond=68 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 2404 rows 2503 cols
[2023-03-19 23:47:51] [INFO ] Computed 900 place invariants in 38 ms
[2023-03-19 23:47:51] [INFO ] After 797ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-19 23:47:52] [INFO ] [Nat]Absence check using 898 positive place invariants in 232 ms returned sat
[2023-03-19 23:47:52] [INFO ] [Nat]Absence check using 898 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-19 23:47:56] [INFO ] After 2828ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-19 23:47:57] [INFO ] Deduced a trap composed of 4 places in 1345 ms of which 1 ms to minimize.
[2023-03-19 23:47:57] [INFO ] Deduced a trap composed of 11 places in 273 ms of which 0 ms to minimize.
[2023-03-19 23:47:58] [INFO ] Deduced a trap composed of 5 places in 165 ms of which 1 ms to minimize.
[2023-03-19 23:47:59] [INFO ] Deduced a trap composed of 17 places in 863 ms of which 0 ms to minimize.
[2023-03-19 23:47:59] [INFO ] Deduced a trap composed of 9 places in 207 ms of which 3 ms to minimize.
[2023-03-19 23:47:59] [INFO ] Deduced a trap composed of 17 places in 376 ms of which 0 ms to minimize.
[2023-03-19 23:48:01] [INFO ] Deduced a trap composed of 9 places in 1352 ms of which 0 ms to minimize.
[2023-03-19 23:48:01] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 5464 ms
[2023-03-19 23:48:02] [INFO ] Deduced a trap composed of 11 places in 170 ms of which 2 ms to minimize.
[2023-03-19 23:48:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 358 ms
[2023-03-19 23:48:03] [INFO ] Deduced a trap composed of 18 places in 221 ms of which 1 ms to minimize.
[2023-03-19 23:48:03] [INFO ] Deduced a trap composed of 8 places in 178 ms of which 0 ms to minimize.
[2023-03-19 23:48:03] [INFO ] Deduced a trap composed of 9 places in 144 ms of which 1 ms to minimize.
[2023-03-19 23:48:04] [INFO ] Deduced a trap composed of 11 places in 279 ms of which 1 ms to minimize.
[2023-03-19 23:48:04] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1328 ms
[2023-03-19 23:48:04] [INFO ] After 11160ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 769 ms.
[2023-03-19 23:48:05] [INFO ] After 13267ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Fused 7 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 705 ms.
Support contains 6 out of 2503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2503/2503 places, 2404/2404 transitions.
Applied a total of 0 rules in 107 ms. Remains 2503 /2503 variables (removed 0) and now considering 2404/2404 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 107 ms. Remains : 2503/2503 places, 2404/2404 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 497 ms. (steps per millisecond=20 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 269 ms. (steps per millisecond=37 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 255 ms. (steps per millisecond=39 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 243 ms. (steps per millisecond=41 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 157 ms. (steps per millisecond=63 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 215 ms. (steps per millisecond=46 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 49608 steps, run timeout after 3001 ms. (steps per millisecond=16 ) properties seen :{}
Probabilistic random walk after 49608 steps, saw 48934 distinct states, run finished after 3003 ms. (steps per millisecond=16 ) properties seen :0
Running SMT prover for 7 properties.
[2023-03-19 23:48:10] [INFO ] Invariant cache hit.
[2023-03-19 23:48:11] [INFO ] After 926ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-19 23:48:12] [INFO ] [Nat]Absence check using 898 positive place invariants in 390 ms returned sat
[2023-03-19 23:48:12] [INFO ] [Nat]Absence check using 898 positive and 2 generalized place invariants in 0 ms returned sat
[2023-03-19 23:48:18] [INFO ] After 5282ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-19 23:48:21] [INFO ] Deduced a trap composed of 4 places in 2489 ms of which 1 ms to minimize.
[2023-03-19 23:48:21] [INFO ] Deduced a trap composed of 5 places in 230 ms of which 0 ms to minimize.
[2023-03-19 23:48:22] [INFO ] Deduced a trap composed of 11 places in 350 ms of which 1 ms to minimize.
[2023-03-19 23:48:22] [INFO ] Deduced a trap composed of 4 places in 386 ms of which 0 ms to minimize.
[2023-03-19 23:48:23] [INFO ] Deduced a trap composed of 9 places in 496 ms of which 1 ms to minimize.
[2023-03-19 23:48:23] [INFO ] Deduced a trap composed of 8 places in 238 ms of which 1 ms to minimize.
[2023-03-19 23:48:24] [INFO ] Deduced a trap composed of 13 places in 645 ms of which 38 ms to minimize.
[2023-03-19 23:48:24] [INFO ] Deduced a trap composed of 8 places in 277 ms of which 1 ms to minimize.
[2023-03-19 23:48:25] [INFO ] Deduced a trap composed of 17 places in 587 ms of which 1 ms to minimize.
[2023-03-19 23:48:26] [INFO ] Deduced a trap composed of 9 places in 1074 ms of which 1 ms to minimize.
[2023-03-19 23:48:27] [INFO ] Deduced a trap composed of 14 places in 229 ms of which 1 ms to minimize.
[2023-03-19 23:48:27] [INFO ] Deduced a trap composed of 23 places in 285 ms of which 1 ms to minimize.
[2023-03-19 23:48:27] [INFO ] Deduced a trap composed of 9 places in 262 ms of which 1 ms to minimize.
[2023-03-19 23:48:28] [INFO ] Deduced a trap composed of 14 places in 891 ms of which 1 ms to minimize.
[2023-03-19 23:48:29] [INFO ] Deduced a trap composed of 9 places in 561 ms of which 1 ms to minimize.
[2023-03-19 23:48:29] [INFO ] Deduced a trap composed of 14 places in 328 ms of which 0 ms to minimize.
[2023-03-19 23:48:30] [INFO ] Deduced a trap composed of 5 places in 382 ms of which 1 ms to minimize.
[2023-03-19 23:48:31] [INFO ] Deduced a trap composed of 23 places in 532 ms of which 0 ms to minimize.
[2023-03-19 23:48:31] [INFO ] Deduced a trap composed of 8 places in 486 ms of which 0 ms to minimize.
[2023-03-19 23:48:32] [INFO ] Deduced a trap composed of 8 places in 357 ms of which 1 ms to minimize.
[2023-03-19 23:48:32] [INFO ] Deduced a trap composed of 8 places in 336 ms of which 1 ms to minimize.
[2023-03-19 23:48:33] [INFO ] Deduced a trap composed of 8 places in 900 ms of which 1 ms to minimize.
[2023-03-19 23:48:33] [INFO ] Deduced a trap composed of 17 places in 330 ms of which 1 ms to minimize.
[2023-03-19 23:48:35] [INFO ] Deduced a trap composed of 11 places in 1428 ms of which 1 ms to minimize.
[2023-03-19 23:48:35] [INFO ] Deduced a trap composed of 8 places in 160 ms of which 0 ms to minimize.
[2023-03-19 23:48:36] [INFO ] Deduced a trap composed of 17 places in 205 ms of which 26 ms to minimize.
[2023-03-19 23:48:36] [INFO ] Trap strengthening (SAT) tested/added 27/26 trap constraints in 17319 ms
[2023-03-19 23:48:36] [INFO ] Deduced a trap composed of 5 places in 596 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-19 23:48:36] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-19 23:48:36] [INFO ] After 25111ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:7
Parikh walk visited 0 properties in 691 ms.
Support contains 6 out of 2503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2503/2503 places, 2404/2404 transitions.
Applied a total of 0 rules in 100 ms. Remains 2503 /2503 variables (removed 0) and now considering 2404/2404 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 100 ms. Remains : 2503/2503 places, 2404/2404 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2503/2503 places, 2404/2404 transitions.
Applied a total of 0 rules in 102 ms. Remains 2503 /2503 variables (removed 0) and now considering 2404/2404 (removed 0) transitions.
[2023-03-19 23:48:37] [INFO ] Invariant cache hit.
[2023-03-19 23:48:41] [INFO ] Implicit Places using invariants in 3805 ms returned []
[2023-03-19 23:48:41] [INFO ] Invariant cache hit.
[2023-03-19 23:48:48] [INFO ] Implicit Places using invariants and state equation in 7138 ms returned []
Implicit Place search using SMT with State Equation took 10962 ms to find 0 implicit places.
[2023-03-19 23:48:48] [INFO ] Redundant transitions in 68 ms returned []
[2023-03-19 23:48:48] [INFO ] Invariant cache hit.
[2023-03-19 23:48:51] [INFO ] Dead Transitions using invariants and state equation in 2401 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13542 ms. Remains : 2503/2503 places, 2404/2404 transitions.
Applied a total of 0 rules in 102 ms. Remains 2503 /2503 variables (removed 0) and now considering 2404/2404 (removed 0) transitions.
Running SMT prover for 7 properties.
[2023-03-19 23:48:51] [INFO ] Invariant cache hit.
[2023-03-19 23:48:51] [INFO ] After 476ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-19 23:48:52] [INFO ] [Nat]Absence check using 898 positive place invariants in 270 ms returned sat
[2023-03-19 23:48:52] [INFO ] [Nat]Absence check using 898 positive and 2 generalized place invariants in 3 ms returned sat
[2023-03-19 23:48:57] [INFO ] After 4728ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-19 23:48:58] [INFO ] Deduced a trap composed of 4 places in 416 ms of which 1 ms to minimize.
[2023-03-19 23:48:58] [INFO ] Deduced a trap composed of 5 places in 318 ms of which 1 ms to minimize.
[2023-03-19 23:49:01] [INFO ] Deduced a trap composed of 11 places in 2292 ms of which 0 ms to minimize.
[2023-03-19 23:49:01] [INFO ] Deduced a trap composed of 4 places in 290 ms of which 1 ms to minimize.
[2023-03-19 23:49:02] [INFO ] Deduced a trap composed of 9 places in 814 ms of which 1 ms to minimize.
[2023-03-19 23:49:03] [INFO ] Deduced a trap composed of 8 places in 604 ms of which 1 ms to minimize.
[2023-03-19 23:49:03] [INFO ] Deduced a trap composed of 13 places in 558 ms of which 1 ms to minimize.
[2023-03-19 23:49:04] [INFO ] Deduced a trap composed of 8 places in 264 ms of which 0 ms to minimize.
[2023-03-19 23:49:05] [INFO ] Deduced a trap composed of 17 places in 1612 ms of which 1 ms to minimize.
[2023-03-19 23:49:08] [INFO ] Deduced a trap composed of 9 places in 2513 ms of which 1 ms to minimize.
[2023-03-19 23:49:09] [INFO ] Deduced a trap composed of 14 places in 372 ms of which 0 ms to minimize.
[2023-03-19 23:49:09] [INFO ] Deduced a trap composed of 23 places in 235 ms of which 1 ms to minimize.
[2023-03-19 23:49:09] [INFO ] Deduced a trap composed of 9 places in 261 ms of which 0 ms to minimize.
[2023-03-19 23:49:10] [INFO ] Deduced a trap composed of 14 places in 193 ms of which 0 ms to minimize.
[2023-03-19 23:49:10] [INFO ] Deduced a trap composed of 9 places in 307 ms of which 0 ms to minimize.
[2023-03-19 23:49:10] [INFO ] Deduced a trap composed of 14 places in 276 ms of which 1 ms to minimize.
[2023-03-19 23:49:11] [INFO ] Deduced a trap composed of 5 places in 309 ms of which 1 ms to minimize.
[2023-03-19 23:49:11] [INFO ] Deduced a trap composed of 23 places in 362 ms of which 0 ms to minimize.
[2023-03-19 23:49:12] [INFO ] Deduced a trap composed of 8 places in 275 ms of which 0 ms to minimize.
[2023-03-19 23:49:12] [INFO ] Deduced a trap composed of 8 places in 549 ms of which 1 ms to minimize.
[2023-03-19 23:49:13] [INFO ] Deduced a trap composed of 8 places in 744 ms of which 1 ms to minimize.
[2023-03-19 23:49:14] [INFO ] Deduced a trap composed of 8 places in 388 ms of which 1 ms to minimize.
[2023-03-19 23:49:14] [INFO ] Deduced a trap composed of 17 places in 175 ms of which 0 ms to minimize.
[2023-03-19 23:49:14] [INFO ] Deduced a trap composed of 11 places in 145 ms of which 0 ms to minimize.
[2023-03-19 23:49:15] [INFO ] Deduced a trap composed of 8 places in 965 ms of which 0 ms to minimize.
[2023-03-19 23:49:16] [INFO ] Deduced a trap composed of 17 places in 183 ms of which 0 ms to minimize.
[2023-03-19 23:49:16] [INFO ] Trap strengthening (SAT) tested/added 27/26 trap constraints in 18357 ms
[2023-03-19 23:49:16] [INFO ] Deduced a trap composed of 5 places in 145 ms of which 1 ms to minimize.
[2023-03-19 23:49:17] [INFO ] Deduced a trap composed of 14 places in 377 ms of which 0 ms to minimize.
[2023-03-19 23:49:17] [INFO ] Deduced a trap composed of 20 places in 141 ms of which 0 ms to minimize.
[2023-03-19 23:49:17] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1150 ms
[2023-03-19 23:49:18] [INFO ] Deduced a trap composed of 8 places in 211 ms of which 0 ms to minimize.
[2023-03-19 23:49:18] [INFO ] Deduced a trap composed of 9 places in 165 ms of which 0 ms to minimize.
[2023-03-19 23:49:18] [INFO ] Deduced a trap composed of 7 places in 146 ms of which 0 ms to minimize.
[2023-03-19 23:49:18] [INFO ] Deduced a trap composed of 19 places in 109 ms of which 0 ms to minimize.
[2023-03-19 23:49:19] [INFO ] Deduced a trap composed of 8 places in 145 ms of which 21 ms to minimize.
[2023-03-19 23:49:19] [INFO ] Deduced a trap composed of 4 places in 159 ms of which 17 ms to minimize.
[2023-03-19 23:49:19] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1707 ms
[2023-03-19 23:49:20] [INFO ] After 27259ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 905 ms.
[2023-03-19 23:49:21] [INFO ] After 29347ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X p2), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT (AND (NOT p2) p0 p1))), (X p0), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), true, (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(F (NOT p2)), (F (AND (NOT p2) p0 p1))]
Knowledge based reduction with 20 factoid took 2098 ms. Reduced automaton from 4 states, 15 edges and 3 AP (stutter sensitive) to 4 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 446 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 384 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 355 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 8 reset in 1707 ms.
Product exploration explored 100000 steps with 8 reset in 2120 ms.
Support contains 6 out of 5303 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5303/5303 places, 5203/5203 transitions.
Applied a total of 0 rules in 681 ms. Remains 5303 /5303 variables (removed 0) and now considering 5203/5203 (removed 0) transitions.
// Phase 1: matrix 5203 rows 5303 cols
[2023-03-19 23:49:29] [INFO ] Computed 901 place invariants in 66 ms
[2023-03-19 23:49:34] [INFO ] Implicit Places using invariants in 5046 ms returned []
[2023-03-19 23:49:34] [INFO ] Invariant cache hit.
[2023-03-19 23:49:38] [INFO ] Implicit Places using invariants and state equation in 4233 ms returned []
Implicit Place search using SMT with State Equation took 9295 ms to find 0 implicit places.
[2023-03-19 23:49:38] [INFO ] Invariant cache hit.
[2023-03-19 23:49:45] [INFO ] Dead Transitions using invariants and state equation in 7309 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17312 ms. Remains : 5303/5303 places, 5203/5203 transitions.
Treatment of property ShieldIIPs-PT-100B-LTLCardinality-07 finished in 292939 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((X(p0)||(G(p1) U G(p2)))))'
Support contains 6 out of 5307 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5307/5307 places, 5207/5207 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 5303 transition count 5203
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 5303 transition count 5203
Applied a total of 8 rules in 1339 ms. Remains 5303 /5307 variables (removed 4) and now considering 5203/5207 (removed 4) transitions.
// Phase 1: matrix 5203 rows 5303 cols
[2023-03-19 23:49:48] [INFO ] Computed 901 place invariants in 34 ms
[2023-03-19 23:49:50] [INFO ] Implicit Places using invariants in 2733 ms returned []
[2023-03-19 23:49:50] [INFO ] Invariant cache hit.
[2023-03-19 23:49:55] [INFO ] Implicit Places using invariants and state equation in 4973 ms returned []
Implicit Place search using SMT with State Equation took 7738 ms to find 0 implicit places.
[2023-03-19 23:49:55] [INFO ] Invariant cache hit.
[2023-03-19 23:50:03] [INFO ] Dead Transitions using invariants and state equation in 7112 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5303/5307 places, 5203/5207 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16244 ms. Remains : 5303/5307 places, 5203/5207 transitions.
Stuttering acceptance computed with spot in 763 ms :[(AND (NOT p0) (NOT p2)), (NOT p0), (AND p2 (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p0)), true, (AND p2 (NOT p1)), (NOT p2), (NOT p2)]
Running random walk in product with property : ShieldIIPs-PT-100B-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={} source=1 dest: 5}], [{ cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=2 dest: 5}, { cond=(AND p2 p1 (NOT p0)), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=3 dest: 6}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=3 dest: 7}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 8}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=4 dest: 5}, { cond=(AND p2 (NOT p0)), acceptance={} source=4 dest: 7}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=6 dest: 5}, { cond=(AND p2 p1), acceptance={} source=6 dest: 6}], [{ cond=(NOT p2), acceptance={} source=7 dest: 5}, { cond=p2, acceptance={} source=7 dest: 7}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=8 dest: 5}, { cond=(AND (NOT p2) p1), acceptance={} source=8 dest: 6}, { cond=(AND p2 (NOT p1)), acceptance={} source=8 dest: 7}, { cond=(AND p2 p1), acceptance={} source=8 dest: 8}, { cond=(AND (NOT p2) p1), acceptance={0} source=8 dest: 8}]], initial=0, aps=[p2:(OR (EQ s236 0) (EQ s589 1)), p1:(OR (EQ s3203 0) (EQ s3347 1)), p0:(OR (EQ s1525 0) (EQ s3139 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33397 reset in 1708 ms.
Product exploration explored 100000 steps with 33202 reset in 1710 ms.
Computed a total of 1200 stabilizing places and 1200 stable transitions
Computed a total of 1200 stabilizing places and 1200 stable transitions
Knowledge obtained : [(AND p2 p1 p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X (NOT (AND p2 p1 (NOT p0)))), (X p0), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), true, (X (X p2)), (X (X (AND p2 p1))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND p2 (NOT p1)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 15 factoid took 1369 ms. Reduced automaton from 9 states, 24 edges and 3 AP (stutter sensitive) to 8 states, 23 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 663 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) p1) (AND (NOT p0) p2)), (AND (NOT p1) p2 (NOT p0)), (AND (NOT p2) (NOT p0) p1), true, (AND (NOT p1) p2), (NOT p2), (NOT p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 478 ms. (steps per millisecond=20 ) properties (out of 15) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2023-03-19 23:50:10] [INFO ] Invariant cache hit.
[2023-03-19 23:50:11] [INFO ] After 1476ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-19 23:50:15] [INFO ] [Nat]Absence check using 901 positive place invariants in 1339 ms returned sat
[2023-03-19 23:50:23] [INFO ] After 7376ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-19 23:50:26] [INFO ] Deduced a trap composed of 24 places in 3135 ms of which 3 ms to minimize.
[2023-03-19 23:50:30] [INFO ] Deduced a trap composed of 20 places in 3506 ms of which 5 ms to minimize.
[2023-03-19 23:50:34] [INFO ] Deduced a trap composed of 16 places in 3618 ms of which 7 ms to minimize.
[2023-03-19 23:50:37] [INFO ] Deduced a trap composed of 28 places in 2598 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-19 23:50:37] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-19 23:50:37] [INFO ] After 25320ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:8
Parikh walk visited 1 properties in 2608 ms.
Support contains 6 out of 5303 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5303/5303 places, 5203/5203 transitions.
Drop transitions removed 501 transitions
Trivial Post-agglo rules discarded 501 transitions
Performed 501 trivial Post agglomeration. Transition count delta: 501
Iterating post reduction 0 with 501 rules applied. Total rules applied 501 place count 5303 transition count 4702
Reduce places removed 501 places and 0 transitions.
Iterating post reduction 1 with 501 rules applied. Total rules applied 1002 place count 4802 transition count 4702
Performed 500 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 500 Pre rules applied. Total rules applied 1002 place count 4802 transition count 4202
Deduced a syphon composed of 500 places in 25 ms
Reduce places removed 500 places and 0 transitions.
Iterating global reduction 2 with 1000 rules applied. Total rules applied 2002 place count 4302 transition count 4202
Performed 1794 Post agglomeration using F-continuation condition.Transition count delta: 1794
Deduced a syphon composed of 1794 places in 16 ms
Reduce places removed 1794 places and 0 transitions.
Iterating global reduction 2 with 3588 rules applied. Total rules applied 5590 place count 2508 transition count 2408
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 697 times.
Drop transitions removed 697 transitions
Iterating global reduction 2 with 697 rules applied. Total rules applied 6287 place count 2508 transition count 2408
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 6288 place count 2507 transition count 2407
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6289 place count 2506 transition count 2407
Applied a total of 6289 rules in 1673 ms. Remains 2506 /5303 variables (removed 2797) and now considering 2407/5203 (removed 2796) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1673 ms. Remains : 2506/5303 places, 2407/5203 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 682 ms. (steps per millisecond=14 ) properties (out of 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 273 ms. (steps per millisecond=36 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 212 ms. (steps per millisecond=47 ) properties (out of 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 193 ms. (steps per millisecond=51 ) properties (out of 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 167 ms. (steps per millisecond=59 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 112682 steps, run timeout after 6001 ms. (steps per millisecond=18 ) properties seen :{}
Probabilistic random walk after 112682 steps, saw 111686 distinct states, run finished after 6001 ms. (steps per millisecond=18 ) properties seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 2407 rows 2506 cols
[2023-03-19 23:50:49] [INFO ] Computed 900 place invariants in 13 ms
[2023-03-19 23:50:50] [INFO ] After 730ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-19 23:50:51] [INFO ] [Nat]Absence check using 898 positive place invariants in 258 ms returned sat
[2023-03-19 23:50:51] [INFO ] [Nat]Absence check using 898 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-19 23:50:54] [INFO ] After 2654ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-19 23:50:54] [INFO ] Deduced a trap composed of 5 places in 199 ms of which 0 ms to minimize.
[2023-03-19 23:50:54] [INFO ] Deduced a trap composed of 8 places in 230 ms of which 0 ms to minimize.
[2023-03-19 23:50:55] [INFO ] Deduced a trap composed of 11 places in 217 ms of which 1 ms to minimize.
[2023-03-19 23:50:55] [INFO ] Deduced a trap composed of 11 places in 140 ms of which 1 ms to minimize.
[2023-03-19 23:50:55] [INFO ] Deduced a trap composed of 4 places in 155 ms of which 1 ms to minimize.
[2023-03-19 23:50:55] [INFO ] Deduced a trap composed of 4 places in 151 ms of which 0 ms to minimize.
[2023-03-19 23:50:56] [INFO ] Deduced a trap composed of 24 places in 217 ms of which 0 ms to minimize.
[2023-03-19 23:50:56] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2169 ms
[2023-03-19 23:50:56] [INFO ] Deduced a trap composed of 11 places in 357 ms of which 1 ms to minimize.
[2023-03-19 23:50:57] [INFO ] Deduced a trap composed of 17 places in 149 ms of which 0 ms to minimize.
[2023-03-19 23:50:57] [INFO ] Deduced a trap composed of 9 places in 163 ms of which 0 ms to minimize.
[2023-03-19 23:50:58] [INFO ] Deduced a trap composed of 5 places in 504 ms of which 1 ms to minimize.
[2023-03-19 23:50:58] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1714 ms
[2023-03-19 23:51:00] [INFO ] Deduced a trap composed of 17 places in 1701 ms of which 27 ms to minimize.
[2023-03-19 23:51:00] [INFO ] Deduced a trap composed of 12 places in 148 ms of which 0 ms to minimize.
[2023-03-19 23:51:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 2187 ms
[2023-03-19 23:51:00] [INFO ] Deduced a trap composed of 15 places in 186 ms of which 1 ms to minimize.
[2023-03-19 23:51:01] [INFO ] Deduced a trap composed of 6 places in 168 ms of which 1 ms to minimize.
[2023-03-19 23:51:01] [INFO ] Deduced a trap composed of 4 places in 266 ms of which 1 ms to minimize.
[2023-03-19 23:51:02] [INFO ] Deduced a trap composed of 6 places in 507 ms of which 1 ms to minimize.
[2023-03-19 23:51:02] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1721 ms
[2023-03-19 23:51:03] [INFO ] Deduced a trap composed of 14 places in 559 ms of which 1 ms to minimize.
[2023-03-19 23:51:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 827 ms
[2023-03-19 23:51:03] [INFO ] Deduced a trap composed of 4 places in 161 ms of which 0 ms to minimize.
[2023-03-19 23:51:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 321 ms
[2023-03-19 23:51:04] [INFO ] After 12526ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 948 ms.
[2023-03-19 23:51:04] [INFO ] After 14551ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 937 ms.
Support contains 6 out of 2506 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2506/2506 places, 2407/2407 transitions.
Applied a total of 0 rules in 113 ms. Remains 2506 /2506 variables (removed 0) and now considering 2407/2407 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 113 ms. Remains : 2506/2506 places, 2407/2407 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2506/2506 places, 2407/2407 transitions.
Applied a total of 0 rules in 154 ms. Remains 2506 /2506 variables (removed 0) and now considering 2407/2407 (removed 0) transitions.
[2023-03-19 23:51:06] [INFO ] Invariant cache hit.
[2023-03-19 23:51:08] [INFO ] Implicit Places using invariants in 1975 ms returned []
[2023-03-19 23:51:08] [INFO ] Invariant cache hit.
[2023-03-19 23:51:10] [INFO ] Implicit Places using invariants and state equation in 2242 ms returned []
Implicit Place search using SMT with State Equation took 4221 ms to find 0 implicit places.
[2023-03-19 23:51:10] [INFO ] Redundant transitions in 104 ms returned []
[2023-03-19 23:51:10] [INFO ] Invariant cache hit.
[2023-03-19 23:51:12] [INFO ] Dead Transitions using invariants and state equation in 1607 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6092 ms. Remains : 2506/2506 places, 2407/2407 transitions.
Applied a total of 0 rules in 103 ms. Remains 2506 /2506 variables (removed 0) and now considering 2407/2407 (removed 0) transitions.
Running SMT prover for 7 properties.
[2023-03-19 23:51:12] [INFO ] Invariant cache hit.
[2023-03-19 23:51:13] [INFO ] After 923ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-19 23:51:14] [INFO ] [Nat]Absence check using 898 positive place invariants in 396 ms returned sat
[2023-03-19 23:51:14] [INFO ] [Nat]Absence check using 898 positive and 2 generalized place invariants in 10 ms returned sat
[2023-03-19 23:51:17] [INFO ] After 2626ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-19 23:51:17] [INFO ] Deduced a trap composed of 17 places in 389 ms of which 1 ms to minimize.
[2023-03-19 23:51:18] [INFO ] Deduced a trap composed of 14 places in 288 ms of which 6 ms to minimize.
[2023-03-19 23:51:18] [INFO ] Deduced a trap composed of 8 places in 124 ms of which 1 ms to minimize.
[2023-03-19 23:51:18] [INFO ] Deduced a trap composed of 5 places in 182 ms of which 0 ms to minimize.
[2023-03-19 23:51:19] [INFO ] Deduced a trap composed of 29 places in 123 ms of which 1 ms to minimize.
[2023-03-19 23:51:19] [INFO ] Deduced a trap composed of 10 places in 116 ms of which 1 ms to minimize.
[2023-03-19 23:51:20] [INFO ] Deduced a trap composed of 18 places in 947 ms of which 1 ms to minimize.
[2023-03-19 23:51:22] [INFO ] Deduced a trap composed of 14 places in 1846 ms of which 0 ms to minimize.
[2023-03-19 23:51:23] [INFO ] Deduced a trap composed of 14 places in 832 ms of which 1 ms to minimize.
[2023-03-19 23:51:23] [INFO ] Deduced a trap composed of 17 places in 236 ms of which 0 ms to minimize.
[2023-03-19 23:51:26] [INFO ] Deduced a trap composed of 4 places in 2487 ms of which 2 ms to minimize.
[2023-03-19 23:51:27] [INFO ] Deduced a trap composed of 14 places in 851 ms of which 1 ms to minimize.
[2023-03-19 23:51:27] [INFO ] Deduced a trap composed of 4 places in 651 ms of which 1 ms to minimize.
[2023-03-19 23:51:28] [INFO ] Deduced a trap composed of 11 places in 440 ms of which 1 ms to minimize.
[2023-03-19 23:51:28] [INFO ] Deduced a trap composed of 14 places in 168 ms of which 1 ms to minimize.
[2023-03-19 23:51:29] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 11478 ms
[2023-03-19 23:51:29] [INFO ] Deduced a trap composed of 17 places in 142 ms of which 0 ms to minimize.
[2023-03-19 23:51:29] [INFO ] Deduced a trap composed of 25 places in 197 ms of which 0 ms to minimize.
[2023-03-19 23:51:30] [INFO ] Deduced a trap composed of 17 places in 131 ms of which 0 ms to minimize.
[2023-03-19 23:51:30] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 834 ms
[2023-03-19 23:51:30] [INFO ] Deduced a trap composed of 4 places in 366 ms of which 0 ms to minimize.
[2023-03-19 23:51:30] [INFO ] Deduced a trap composed of 6 places in 184 ms of which 0 ms to minimize.
[2023-03-19 23:51:31] [INFO ] Deduced a trap composed of 5 places in 265 ms of which 1 ms to minimize.
[2023-03-19 23:51:32] [INFO ] Deduced a trap composed of 9 places in 828 ms of which 1 ms to minimize.
[2023-03-19 23:51:32] [INFO ] Deduced a trap composed of 7 places in 169 ms of which 0 ms to minimize.
[2023-03-19 23:51:32] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2389 ms
[2023-03-19 23:51:33] [INFO ] Deduced a trap composed of 5 places in 318 ms of which 0 ms to minimize.
[2023-03-19 23:51:33] [INFO ] Deduced a trap composed of 8 places in 200 ms of which 1 ms to minimize.
[2023-03-19 23:51:33] [INFO ] Deduced a trap composed of 7 places in 248 ms of which 0 ms to minimize.
[2023-03-19 23:51:34] [INFO ] Deduced a trap composed of 7 places in 205 ms of which 1 ms to minimize.
[2023-03-19 23:51:34] [INFO ] Deduced a trap composed of 4 places in 316 ms of which 1 ms to minimize.
[2023-03-19 23:51:34] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1823 ms
[2023-03-19 23:51:34] [INFO ] Deduced a trap composed of 6 places in 174 ms of which 24 ms to minimize.
[2023-03-19 23:51:35] [INFO ] Deduced a trap composed of 4 places in 104 ms of which 1 ms to minimize.
[2023-03-19 23:51:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 568 ms
[2023-03-19 23:51:35] [INFO ] Deduced a trap composed of 4 places in 115 ms of which 1 ms to minimize.
[2023-03-19 23:51:35] [INFO ] Deduced a trap composed of 4 places in 187 ms of which 1 ms to minimize.
[2023-03-19 23:51:35] [INFO ] Deduced a trap composed of 5 places in 131 ms of which 12 ms to minimize.
[2023-03-19 23:51:36] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 906 ms
[2023-03-19 23:51:36] [INFO ] After 21374ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 794 ms.
[2023-03-19 23:51:37] [INFO ] After 23865ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Knowledge obtained : [(AND p2 p1 p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X (NOT (AND p2 p1 (NOT p0)))), (X p0), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), true, (X (X p2)), (X (X (AND p2 p1))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND p2 (NOT p1)))))]
False Knowledge obtained : [(F (AND p0 (NOT p1) p2)), (F (AND (NOT p0) (NOT p1) p2)), (F (NOT p0)), (F (NOT (AND p1 p2))), (F (OR (AND (NOT p0) p1) (AND (NOT p0) p2))), (F (AND (NOT p1) p2)), (F (AND (NOT p0) p1)), (F (AND (NOT p0) p1 p2))]
Knowledge based reduction with 15 factoid took 1384 ms. Reduced automaton from 8 states, 23 edges and 3 AP (stutter insensitive) to 8 states, 23 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 340 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) p1) (AND (NOT p0) p2)), (AND (NOT p1) p2 (NOT p0)), (AND (NOT p2) (NOT p0) p1), true, (AND (NOT p1) p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 478 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) p1) (AND (NOT p0) p2)), (AND (NOT p1) p2 (NOT p0)), (AND (NOT p2) (NOT p0) p1), true, (AND (NOT p1) p2), (NOT p2), (NOT p2)]
Support contains 6 out of 5303 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5303/5303 places, 5203/5203 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 501 transitions
Trivial Post-agglo rules discarded 501 transitions
Performed 501 trivial Post agglomeration. Transition count delta: 501
Iterating post reduction 0 with 501 rules applied. Total rules applied 501 place count 5302 transition count 4701
Reduce places removed 501 places and 0 transitions.
Iterating post reduction 1 with 501 rules applied. Total rules applied 1002 place count 4801 transition count 4701
Performed 500 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 500 Pre rules applied. Total rules applied 1002 place count 4801 transition count 4201
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 2002 place count 4301 transition count 4201
Performed 1792 Post agglomeration using F-continuation condition.Transition count delta: 1792
Deduced a syphon composed of 1792 places in 15 ms
Reduce places removed 1792 places and 0 transitions.
Iterating global reduction 2 with 3584 rules applied. Total rules applied 5586 place count 2509 transition count 2409
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 5588 place count 2507 transition count 2407
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5589 place count 2506 transition count 2407
Applied a total of 5589 rules in 1495 ms. Remains 2506 /5303 variables (removed 2797) and now considering 2407/5203 (removed 2796) transitions.
// Phase 1: matrix 2407 rows 2506 cols
[2023-03-19 23:51:40] [INFO ] Computed 900 place invariants in 6 ms
[2023-03-19 23:51:42] [INFO ] Implicit Places using invariants in 2081 ms returned []
[2023-03-19 23:51:42] [INFO ] Invariant cache hit.
[2023-03-19 23:51:48] [INFO ] Implicit Places using invariants and state equation in 5554 ms returned []
Implicit Place search using SMT with State Equation took 7654 ms to find 0 implicit places.
[2023-03-19 23:51:48] [INFO ] Redundant transitions in 460 ms returned [2406]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 2406 rows 2506 cols
[2023-03-19 23:51:48] [INFO ] Computed 900 place invariants in 7 ms
[2023-03-19 23:51:51] [INFO ] Dead Transitions using invariants and state equation in 2113 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2506/5303 places, 2406/5203 transitions.
Applied a total of 0 rules in 140 ms. Remains 2506 /2506 variables (removed 0) and now considering 2406/2406 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 11892 ms. Remains : 2506/5303 places, 2406/5203 transitions.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), true, (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2)))))]
False Knowledge obtained : [(X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) p2))), (X (AND p0 (NOT p1) p2)), (X (NOT (AND p0 (NOT p1) p2))), (X (AND (NOT p0) p1 p2)), (X (NOT (AND (NOT p0) p1 p2))), (X (OR (AND (NOT p0) p1) (AND (NOT p0) p2))), (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p2)))), (X (AND p1 p2)), (X (NOT (AND p1 p2))), (X p0), (X (NOT p0)), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (AND (NOT p0) p1 p2))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (OR (AND (NOT p0) p1) (AND (NOT p0) p2)))), (X (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p2))))), (X (X (AND p1 p2))), (X (X (NOT (AND p1 p2)))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
Knowledge based reduction with 17 factoid took 1927 ms. Reduced automaton from 8 states, 23 edges and 3 AP (stutter insensitive) to 8 states, 23 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 699 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) p1) (AND (NOT p0) p2)), (AND (NOT p1) p2 (NOT p0)), (AND (NOT p2) (NOT p0) p1), true, (AND (NOT p1) p2), (NOT p2), (NOT p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 562 ms. (steps per millisecond=17 ) properties (out of 15) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 163 ms. (steps per millisecond=61 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2023-03-19 23:51:55] [INFO ] Invariant cache hit.
[2023-03-19 23:51:56] [INFO ] After 514ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-19 23:51:56] [INFO ] [Nat]Absence check using 900 positive place invariants in 262 ms returned sat
[2023-03-19 23:51:59] [INFO ] After 2471ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-19 23:52:00] [INFO ] Deduced a trap composed of 3 places in 128 ms of which 1 ms to minimize.
[2023-03-19 23:52:00] [INFO ] Deduced a trap composed of 8 places in 199 ms of which 1 ms to minimize.
[2023-03-19 23:52:00] [INFO ] Deduced a trap composed of 8 places in 86 ms of which 1 ms to minimize.
[2023-03-19 23:52:00] [INFO ] Deduced a trap composed of 8 places in 69 ms of which 0 ms to minimize.
[2023-03-19 23:52:00] [INFO ] Deduced a trap composed of 7 places in 68 ms of which 0 ms to minimize.
[2023-03-19 23:52:01] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1326 ms
[2023-03-19 23:52:02] [INFO ] Deduced a trap composed of 13 places in 95 ms of which 0 ms to minimize.
[2023-03-19 23:52:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 329 ms
[2023-03-19 23:52:02] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 1 ms to minimize.
[2023-03-19 23:52:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 316 ms
[2023-03-19 23:52:02] [INFO ] After 5561ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 854 ms.
[2023-03-19 23:52:03] [INFO ] After 7755ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 1464 ms.
Support contains 6 out of 2506 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2506/2506 places, 2406/2406 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 2506 transition count 2406
Applied a total of 600 rules in 275 ms. Remains 2506 /2506 variables (removed 0) and now considering 2406/2406 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 284 ms. Remains : 2506/2506 places, 2406/2406 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 479 ms. (steps per millisecond=20 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 171 ms. (steps per millisecond=58 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 171 ms. (steps per millisecond=58 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 207 ms. (steps per millisecond=48 ) properties (out of 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 195 ms. (steps per millisecond=51 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 53163 steps, run timeout after 3007 ms. (steps per millisecond=17 ) properties seen :{}
Probabilistic random walk after 53163 steps, saw 52484 distinct states, run finished after 3007 ms. (steps per millisecond=17 ) properties seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 2406 rows 2506 cols
[2023-03-19 23:52:10] [INFO ] Computed 900 place invariants in 38 ms
[2023-03-19 23:52:11] [INFO ] After 823ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-19 23:52:12] [INFO ] [Nat]Absence check using 900 positive place invariants in 453 ms returned sat
[2023-03-19 23:52:16] [INFO ] After 3537ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-19 23:52:16] [INFO ] Deduced a trap composed of 3 places in 359 ms of which 1 ms to minimize.
[2023-03-19 23:52:16] [INFO ] Deduced a trap composed of 8 places in 180 ms of which 0 ms to minimize.
[2023-03-19 23:52:17] [INFO ] Deduced a trap composed of 7 places in 186 ms of which 0 ms to minimize.
[2023-03-19 23:52:17] [INFO ] Deduced a trap composed of 17 places in 147 ms of which 1 ms to minimize.
[2023-03-19 23:52:17] [INFO ] Deduced a trap composed of 17 places in 212 ms of which 1 ms to minimize.
[2023-03-19 23:52:18] [INFO ] Deduced a trap composed of 18 places in 190 ms of which 1 ms to minimize.
[2023-03-19 23:52:18] [INFO ] Deduced a trap composed of 17 places in 201 ms of which 1 ms to minimize.
[2023-03-19 23:52:19] [INFO ] Deduced a trap composed of 17 places in 396 ms of which 1 ms to minimize.
[2023-03-19 23:52:19] [INFO ] Deduced a trap composed of 17 places in 115 ms of which 0 ms to minimize.
[2023-03-19 23:52:19] [INFO ] Deduced a trap composed of 18 places in 294 ms of which 1 ms to minimize.
[2023-03-19 23:52:19] [INFO ] Deduced a trap composed of 8 places in 107 ms of which 5 ms to minimize.
[2023-03-19 23:52:20] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 3943 ms
[2023-03-19 23:52:20] [INFO ] Deduced a trap composed of 4 places in 237 ms of which 0 ms to minimize.
[2023-03-19 23:52:20] [INFO ] Deduced a trap composed of 6 places in 191 ms of which 0 ms to minimize.
[2023-03-19 23:52:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 816 ms
[2023-03-19 23:52:21] [INFO ] Deduced a trap composed of 8 places in 98 ms of which 0 ms to minimize.
[2023-03-19 23:52:21] [INFO ] Deduced a trap composed of 9 places in 216 ms of which 0 ms to minimize.
[2023-03-19 23:52:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 717 ms
[2023-03-19 23:52:22] [INFO ] After 10221ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 1016 ms.
[2023-03-19 23:52:23] [INFO ] After 12825ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 1049 ms.
Support contains 6 out of 2506 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2506/2506 places, 2406/2406 transitions.
Applied a total of 0 rules in 161 ms. Remains 2506 /2506 variables (removed 0) and now considering 2406/2406 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 161 ms. Remains : 2506/2506 places, 2406/2406 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2506/2506 places, 2406/2406 transitions.
Applied a total of 0 rules in 132 ms. Remains 2506 /2506 variables (removed 0) and now considering 2406/2406 (removed 0) transitions.
[2023-03-19 23:52:25] [INFO ] Invariant cache hit.
[2023-03-19 23:52:27] [INFO ] Implicit Places using invariants in 2753 ms returned []
[2023-03-19 23:52:27] [INFO ] Invariant cache hit.
[2023-03-19 23:52:34] [INFO ] Implicit Places using invariants and state equation in 6196 ms returned []
Implicit Place search using SMT with State Equation took 8970 ms to find 0 implicit places.
[2023-03-19 23:52:34] [INFO ] Redundant transitions in 179 ms returned []
[2023-03-19 23:52:34] [INFO ] Invariant cache hit.
[2023-03-19 23:52:36] [INFO ] Dead Transitions using invariants and state equation in 2427 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11770 ms. Remains : 2506/2506 places, 2406/2406 transitions.
Applied a total of 0 rules in 126 ms. Remains 2506 /2506 variables (removed 0) and now considering 2406/2406 (removed 0) transitions.
Running SMT prover for 7 properties.
[2023-03-19 23:52:36] [INFO ] Invariant cache hit.
[2023-03-19 23:52:37] [INFO ] After 664ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-19 23:52:38] [INFO ] [Nat]Absence check using 900 positive place invariants in 227 ms returned sat
[2023-03-19 23:52:41] [INFO ] After 2487ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-19 23:52:41] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 1 ms to minimize.
[2023-03-19 23:52:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 297 ms
[2023-03-19 23:52:42] [INFO ] Deduced a trap composed of 12 places in 127 ms of which 1 ms to minimize.
[2023-03-19 23:52:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 380 ms
[2023-03-19 23:52:42] [INFO ] Deduced a trap composed of 5 places in 89 ms of which 1 ms to minimize.
[2023-03-19 23:52:42] [INFO ] Deduced a trap composed of 3 places in 92 ms of which 1 ms to minimize.
[2023-03-19 23:52:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 590 ms
[2023-03-19 23:52:44] [INFO ] Deduced a trap composed of 9 places in 397 ms of which 1 ms to minimize.
[2023-03-19 23:52:44] [INFO ] Deduced a trap composed of 3 places in 79 ms of which 0 ms to minimize.
[2023-03-19 23:52:44] [INFO ] Deduced a trap composed of 8 places in 197 ms of which 0 ms to minimize.
[2023-03-19 23:52:44] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1173 ms
[2023-03-19 23:52:45] [INFO ] Deduced a trap composed of 5 places in 199 ms of which 0 ms to minimize.
[2023-03-19 23:52:45] [INFO ] Deduced a trap composed of 9 places in 155 ms of which 0 ms to minimize.
[2023-03-19 23:52:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 701 ms
[2023-03-19 23:52:45] [INFO ] After 6579ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 829 ms.
[2023-03-19 23:52:46] [INFO ] After 8857ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), true, (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2)))))]
False Knowledge obtained : [(X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) p2))), (X (AND p0 (NOT p1) p2)), (X (NOT (AND p0 (NOT p1) p2))), (X (AND (NOT p0) p1 p2)), (X (NOT (AND (NOT p0) p1 p2))), (X (OR (AND (NOT p0) p1) (AND (NOT p0) p2))), (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p2)))), (X (AND p1 p2)), (X (NOT (AND p1 p2))), (X p0), (X (NOT p0)), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (AND (NOT p0) p1 p2))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (OR (AND (NOT p0) p1) (AND (NOT p0) p2)))), (X (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p2))))), (X (X (AND p1 p2))), (X (X (NOT (AND p1 p2)))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F (AND p0 (NOT p1) p2)), (F (AND (NOT p0) (NOT p1) p2)), (F (NOT p0)), (F (NOT (AND p1 p2))), (F (OR (AND (NOT p0) p1) (AND (NOT p0) p2))), (F (AND (NOT p1) p2)), (F (AND (NOT p0) p1)), (F (AND (NOT p0) p1 p2))]
Knowledge based reduction with 17 factoid took 2686 ms. Reduced automaton from 8 states, 23 edges and 3 AP (stutter insensitive) to 8 states, 23 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 403 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) p1) (AND (NOT p0) p2)), (AND (NOT p1) p2 (NOT p0)), (AND (NOT p2) (NOT p0) p1), true, (AND (NOT p1) p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 478 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) p1) (AND (NOT p0) p2)), (AND (NOT p1) p2 (NOT p0)), (AND (NOT p2) (NOT p0) p1), true, (AND (NOT p1) p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 599 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) p1) (AND (NOT p0) p2)), (AND (NOT p1) p2 (NOT p0)), (AND (NOT p2) (NOT p0) p1), true, (AND (NOT p1) p2), (NOT p2), (NOT p2)]
Entered a terminal (fully accepting) state of product in 4906 steps with 0 reset in 99 ms.
FORMULA ShieldIIPs-PT-100B-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-100B-LTLCardinality-08 finished in 184024 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))||(X(F(p1))&&F(p2))))'
Support contains 3 out of 5307 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5307/5307 places, 5207/5207 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 5302 transition count 5202
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 5302 transition count 5202
Applied a total of 10 rules in 1660 ms. Remains 5302 /5307 variables (removed 5) and now considering 5202/5207 (removed 5) transitions.
// Phase 1: matrix 5202 rows 5302 cols
[2023-03-19 23:52:52] [INFO ] Computed 901 place invariants in 45 ms
[2023-03-19 23:52:55] [INFO ] Implicit Places using invariants in 2508 ms returned []
[2023-03-19 23:52:55] [INFO ] Invariant cache hit.
[2023-03-19 23:52:57] [INFO ] Implicit Places using invariants and state equation in 2793 ms returned []
Implicit Place search using SMT with State Equation took 5316 ms to find 0 implicit places.
[2023-03-19 23:52:57] [INFO ] Invariant cache hit.
[2023-03-19 23:53:04] [INFO ] Dead Transitions using invariants and state equation in 6601 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5302/5307 places, 5202/5207 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13578 ms. Remains : 5302/5307 places, 5202/5207 transitions.
Stuttering acceptance computed with spot in 346 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ShieldIIPs-PT-100B-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}, { cond=(NOT p2), acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(NOT p1), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(NOT p2), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s1610 0) (EQ s626 1)), p2:(OR (EQ s626 0) (EQ s1610 1)), p1:(EQ s954 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]]
Product exploration explored 100000 steps with 25 reset in 1811 ms.
Product exploration explored 100000 steps with 26 reset in 1815 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 (NOT p0) p2 (NOT p1)), (X p2), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT p1)), (X (X p2)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 491 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 150 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 365 ms. (steps per millisecond=27 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-19 23:53:09] [INFO ] Invariant cache hit.
[2023-03-19 23:53:11] [INFO ] [Real]Absence check using 901 positive place invariants in 856 ms returned sat
[2023-03-19 23:53:21] [INFO ] After 12181ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 23:53:24] [INFO ] [Nat]Absence check using 901 positive place invariants in 1296 ms returned sat
[2023-03-19 23:53:30] [INFO ] After 5752ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 23:53:35] [INFO ] Deduced a trap composed of 16 places in 4997 ms of which 5 ms to minimize.
[2023-03-19 23:53:39] [INFO ] Deduced a trap composed of 25 places in 3396 ms of which 5 ms to minimize.
[2023-03-19 23:53:42] [INFO ] Deduced a trap composed of 16 places in 3314 ms of which 3 ms to minimize.
[2023-03-19 23:53:45] [INFO ] Deduced a trap composed of 20 places in 3011 ms of which 4 ms to minimize.
[2023-03-19 23:53:48] [INFO ] Deduced a trap composed of 23 places in 2832 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-19 23:53:49] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-19 23:53:49] [INFO ] After 27094ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 105 ms.
Support contains 1 out of 5302 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5302/5302 places, 5202/5202 transitions.
Drop transitions removed 501 transitions
Trivial Post-agglo rules discarded 501 transitions
Performed 501 trivial Post agglomeration. Transition count delta: 501
Iterating post reduction 0 with 501 rules applied. Total rules applied 501 place count 5302 transition count 4701
Reduce places removed 501 places and 0 transitions.
Iterating post reduction 1 with 501 rules applied. Total rules applied 1002 place count 4801 transition count 4701
Performed 501 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 501 Pre rules applied. Total rules applied 1002 place count 4801 transition count 4200
Deduced a syphon composed of 501 places in 23 ms
Reduce places removed 501 places and 0 transitions.
Iterating global reduction 2 with 1002 rules applied. Total rules applied 2004 place count 4300 transition count 4200
Performed 1798 Post agglomeration using F-continuation condition.Transition count delta: 1798
Deduced a syphon composed of 1798 places in 15 ms
Reduce places removed 1798 places and 0 transitions.
Iterating global reduction 2 with 3596 rules applied. Total rules applied 5600 place count 2502 transition count 2402
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 698 times.
Drop transitions removed 698 transitions
Iterating global reduction 2 with 698 rules applied. Total rules applied 6298 place count 2502 transition count 2402
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 6299 place count 2501 transition count 2401
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6300 place count 2500 transition count 2401
Applied a total of 6300 rules in 1461 ms. Remains 2500 /5302 variables (removed 2802) and now considering 2401/5202 (removed 2801) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1462 ms. Remains : 2500/5302 places, 2401/5202 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 196 ms. (steps per millisecond=51 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 143 ms. (steps per millisecond=69 ) properties (out of 1) seen :0
Finished probabilistic random walk after 71291 steps, run visited all 1 properties in 1684 ms. (steps per millisecond=42 )
Probabilistic random walk after 71291 steps, saw 70509 distinct states, run finished after 1686 ms. (steps per millisecond=42 ) properties seen :1
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X p2), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT p1)), (X (X p2)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F p1)]
Knowledge based reduction with 9 factoid took 669 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 202 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 243 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2023-03-19 23:53:53] [INFO ] Invariant cache hit.
[2023-03-19 23:54:04] [INFO ] [Real]Absence check using 901 positive place invariants in 4554 ms returned sat
[2023-03-19 23:54:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 23:54:08] [INFO ] [Real]Absence check using state equation in 4844 ms returned unknown
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 3 out of 5302 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5302/5302 places, 5202/5202 transitions.
Applied a total of 0 rules in 844 ms. Remains 5302 /5302 variables (removed 0) and now considering 5202/5202 (removed 0) transitions.
[2023-03-19 23:54:09] [INFO ] Invariant cache hit.
[2023-03-19 23:54:12] [INFO ] Implicit Places using invariants in 2704 ms returned []
[2023-03-19 23:54:12] [INFO ] Invariant cache hit.
[2023-03-19 23:54:14] [INFO ] Implicit Places using invariants and state equation in 2316 ms returned []
Implicit Place search using SMT with State Equation took 5028 ms to find 0 implicit places.
[2023-03-19 23:54:14] [INFO ] Invariant cache hit.
[2023-03-19 23:54:19] [INFO ] Dead Transitions using invariants and state equation in 5085 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10960 ms. Remains : 5302/5302 places, 5202/5202 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 (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 393 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 184 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 285 ms. (steps per millisecond=35 ) 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 32 ms. (steps per millisecond=312 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 201929 steps, run timeout after 3010 ms. (steps per millisecond=67 ) properties seen :{0=1}
Probabilistic random walk after 201929 steps, saw 198246 distinct states, run finished after 3010 ms. (steps per millisecond=67 ) properties seen :1
Running SMT prover for 1 properties.
[2023-03-19 23:54:24] [INFO ] Invariant cache hit.
[2023-03-19 23:54:25] [INFO ] [Real]Absence check using 901 positive place invariants in 690 ms returned sat
[2023-03-19 23:54:31] [INFO ] After 7926ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 23:54:33] [INFO ] [Nat]Absence check using 901 positive place invariants in 937 ms returned sat
[2023-03-19 23:54:38] [INFO ] After 4333ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 23:54:41] [INFO ] Deduced a trap composed of 16 places in 2672 ms of which 4 ms to minimize.
[2023-03-19 23:54:43] [INFO ] Deduced a trap composed of 25 places in 2475 ms of which 3 ms to minimize.
[2023-03-19 23:54:46] [INFO ] Deduced a trap composed of 16 places in 2713 ms of which 3 ms to minimize.
[2023-03-19 23:54:50] [INFO ] Deduced a trap composed of 20 places in 4035 ms of which 4 ms to minimize.
[2023-03-19 23:54:53] [INFO ] Deduced a trap composed of 23 places in 2283 ms of which 3 ms to minimize.
[2023-03-19 23:54:56] [INFO ] Deduced a trap composed of 16 places in 3260 ms of which 3 ms to minimize.
[2023-03-19 23:55:04] [INFO ] Deduced a trap composed of 16 places in 7435 ms of which 13 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-19 23:55:04] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-19 23:55:04] [INFO ] After 32506ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 112 ms.
Support contains 1 out of 5302 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5302/5302 places, 5202/5202 transitions.
Drop transitions removed 501 transitions
Trivial Post-agglo rules discarded 501 transitions
Performed 501 trivial Post agglomeration. Transition count delta: 501
Iterating post reduction 0 with 501 rules applied. Total rules applied 501 place count 5302 transition count 4701
Reduce places removed 501 places and 0 transitions.
Iterating post reduction 1 with 501 rules applied. Total rules applied 1002 place count 4801 transition count 4701
Performed 501 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 501 Pre rules applied. Total rules applied 1002 place count 4801 transition count 4200
Deduced a syphon composed of 501 places in 21 ms
Reduce places removed 501 places and 0 transitions.
Iterating global reduction 2 with 1002 rules applied. Total rules applied 2004 place count 4300 transition count 4200
Performed 1798 Post agglomeration using F-continuation condition.Transition count delta: 1798
Deduced a syphon composed of 1798 places in 15 ms
Reduce places removed 1798 places and 0 transitions.
Iterating global reduction 2 with 3596 rules applied. Total rules applied 5600 place count 2502 transition count 2402
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 698 times.
Drop transitions removed 698 transitions
Iterating global reduction 2 with 698 rules applied. Total rules applied 6298 place count 2502 transition count 2402
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 6299 place count 2501 transition count 2401
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6300 place count 2500 transition count 2401
Applied a total of 6300 rules in 1587 ms. Remains 2500 /5302 variables (removed 2802) and now considering 2401/5202 (removed 2801) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1589 ms. Remains : 2500/5302 places, 2401/5202 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 292 ms. (steps per millisecond=34 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 1) seen :0
Finished probabilistic random walk after 71291 steps, run visited all 1 properties in 1889 ms. (steps per millisecond=37 )
Probabilistic random walk after 71291 steps, saw 70509 distinct states, run finished after 1903 ms. (steps per millisecond=37 ) properties seen :1
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F p1)]
Knowledge based reduction with 5 factoid took 499 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 181 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 249 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2023-03-19 23:55:09] [INFO ] Invariant cache hit.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.assertInvariants(DeadlockTester.java:2340)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:886)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:517)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:614)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
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-19 23:55:24] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression EG (AND (NOT p0) (NOT p1))
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 174 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 25 reset in 1752 ms.
Product exploration explored 100000 steps with 25 reset in 1810 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 189 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 5302 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5302/5302 places, 5202/5202 transitions.
Performed 499 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 499 rules applied. Total rules applied 499 place count 5302 transition count 5202
Performed 201 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 201 Pre rules applied. Total rules applied 499 place count 5302 transition count 5204
Deduced a syphon composed of 700 places in 27 ms
Iterating global reduction 1 with 201 rules applied. Total rules applied 700 place count 5302 transition count 5204
Performed 2096 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2796 places in 22 ms
Iterating global reduction 1 with 2096 rules applied. Total rules applied 2796 place count 5302 transition count 5204
Renaming transitions due to excessive name length > 1024 char.
Discarding 699 places :
Symmetric choice reduction at 1 with 699 rule applications. Total rules 3495 place count 4603 transition count 4505
Deduced a syphon composed of 2097 places in 13 ms
Iterating global reduction 1 with 699 rules applied. Total rules applied 4194 place count 4603 transition count 4505
Deduced a syphon composed of 2097 places in 10 ms
Applied a total of 4194 rules in 8055 ms. Remains 4603 /5302 variables (removed 699) and now considering 4505/5202 (removed 697) transitions.
[2023-03-19 23:55:38] [INFO ] Redundant transitions in 1970 ms returned [4504]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 4504 rows 4603 cols
[2023-03-19 23:55:38] [INFO ] Computed 901 place invariants in 225 ms
[2023-03-19 23:55:45] [INFO ] Dead Transitions using invariants and state equation in 6574 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4603/5302 places, 4504/5202 transitions.
Deduced a syphon composed of 2097 places in 12 ms
Applied a total of 0 rules in 447 ms. Remains 4603 /4603 variables (removed 0) and now considering 4504/4504 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 17086 ms. Remains : 4603/5302 places, 4504/5202 transitions.
Support contains 3 out of 5302 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5302/5302 places, 5202/5202 transitions.
Applied a total of 0 rules in 837 ms. Remains 5302 /5302 variables (removed 0) and now considering 5202/5202 (removed 0) transitions.
// Phase 1: matrix 5202 rows 5302 cols
[2023-03-19 23:55:46] [INFO ] Computed 901 place invariants in 22 ms
[2023-03-19 23:55:49] [INFO ] Implicit Places using invariants in 3155 ms returned []
[2023-03-19 23:55:49] [INFO ] Invariant cache hit.
[2023-03-19 23:55:58] [INFO ] Implicit Places using invariants and state equation in 9213 ms returned []
Implicit Place search using SMT with State Equation took 12412 ms to find 0 implicit places.
[2023-03-19 23:55:58] [INFO ] Invariant cache hit.
[2023-03-19 23:56:08] [INFO ] Dead Transitions using invariants and state equation in 9805 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23057 ms. Remains : 5302/5302 places, 5202/5202 transitions.
Treatment of property ShieldIIPs-PT-100B-LTLCardinality-11 finished in 198237 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(p0)) U (p1&&X(!p1)))))'
Support contains 4 out of 5307 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5307/5307 places, 5207/5207 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 5303 transition count 5203
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 5303 transition count 5203
Applied a total of 8 rules in 1305 ms. Remains 5303 /5307 variables (removed 4) and now considering 5203/5207 (removed 4) transitions.
// Phase 1: matrix 5203 rows 5303 cols
[2023-03-19 23:56:10] [INFO ] Computed 901 place invariants in 35 ms
[2023-03-19 23:56:13] [INFO ] Implicit Places using invariants in 3405 ms returned []
[2023-03-19 23:56:13] [INFO ] Invariant cache hit.
[2023-03-19 23:56:20] [INFO ] Implicit Places using invariants and state equation in 6383 ms returned []
Implicit Place search using SMT with State Equation took 9793 ms to find 0 implicit places.
[2023-03-19 23:56:20] [INFO ] Invariant cache hit.
[2023-03-19 23:56:26] [INFO ] Dead Transitions using invariants and state equation in 5829 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5303/5307 places, 5203/5207 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16928 ms. Remains : 5303/5307 places, 5203/5207 transitions.
Stuttering acceptance computed with spot in 316 ms :[true, true, (NOT p0), p1, true]
Running random walk in product with property : ShieldIIPs-PT-100B-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 2}, { cond=p1, acceptance={0} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=(AND p1 p0), acceptance={0} source=3 dest: 2}, { cond=(AND p1 p0), acceptance={0} source=3 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={0} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(OR (EQ s4444 0) (EQ s1455 1)), p0:(OR (EQ s5115 0) (EQ s4829 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 943 steps with 0 reset in 13 ms.
FORMULA ShieldIIPs-PT-100B-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-100B-LTLCardinality-14 finished in 17361 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&&F(G(((p1 U X(p2)) U p0))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0))||(X(F(p1))&&F(p2))))'
Found a Shortening insensitive property : ShieldIIPs-PT-100B-LTLCardinality-11
Stuttering acceptance computed with spot in 307 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Support contains 3 out of 5307 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 5307/5307 places, 5207/5207 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 500 transitions
Trivial Post-agglo rules discarded 500 transitions
Performed 500 trivial Post agglomeration. Transition count delta: 500
Iterating post reduction 0 with 500 rules applied. Total rules applied 500 place count 5306 transition count 4706
Reduce places removed 500 places and 0 transitions.
Iterating post reduction 1 with 500 rules applied. Total rules applied 1000 place count 4806 transition count 4706
Performed 500 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 500 Pre rules applied. Total rules applied 1000 place count 4806 transition count 4206
Deduced a syphon composed of 500 places in 24 ms
Reduce places removed 500 places and 0 transitions.
Iterating global reduction 2 with 1000 rules applied. Total rules applied 2000 place count 4306 transition count 4206
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 2005 place count 4301 transition count 4201
Iterating global reduction 2 with 5 rules applied. Total rules applied 2010 place count 4301 transition count 4201
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2010 place count 4301 transition count 4199
Deduced a syphon composed of 2 places in 22 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 2014 place count 4299 transition count 4199
Performed 1792 Post agglomeration using F-continuation condition.Transition count delta: 1792
Deduced a syphon composed of 1792 places in 18 ms
Reduce places removed 1792 places and 0 transitions.
Iterating global reduction 2 with 3584 rules applied. Total rules applied 5598 place count 2507 transition count 2407
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 5600 place count 2505 transition count 2405
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5601 place count 2504 transition count 2405
Applied a total of 5601 rules in 2053 ms. Remains 2504 /5307 variables (removed 2803) and now considering 2405/5207 (removed 2802) transitions.
// Phase 1: matrix 2405 rows 2504 cols
[2023-03-19 23:56:29] [INFO ] Computed 900 place invariants in 6 ms
[2023-03-19 23:56:31] [INFO ] Implicit Places using invariants in 2570 ms returned []
[2023-03-19 23:56:31] [INFO ] Invariant cache hit.
[2023-03-19 23:56:38] [INFO ] Implicit Places using invariants and state equation in 7220 ms returned []
Implicit Place search using SMT with State Equation took 9825 ms to find 0 implicit places.
[2023-03-19 23:56:38] [INFO ] Invariant cache hit.
[2023-03-19 23:56:41] [INFO ] Dead Transitions using invariants and state equation in 2688 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 2504/5307 places, 2405/5207 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 14573 ms. Remains : 2504/5307 places, 2405/5207 transitions.
Running random walk in product with property : ShieldIIPs-PT-100B-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}, { cond=(NOT p2), acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(NOT p1), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(NOT p2), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s731 0) (EQ s253 1)), p2:(OR (EQ s253 0) (EQ s731 1)), p1:(EQ s412 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 26333 steps with 28 reset in 452 ms.
Treatment of property ShieldIIPs-PT-100B-LTLCardinality-11 finished in 15472 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
[2023-03-19 23:56:42] [INFO ] Flatten gal took : 169 ms
[2023-03-19 23:56:42] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2023-03-19 23:56:42] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 5307 places, 5207 transitions and 16414 arcs took 43 ms.
Total runtime 858754 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT ShieldIIPs-PT-100B
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/371
LTLCardinality

BK_STOP 1679270327473

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/371/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/371/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/371/LTLCardinality.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:436
lola: rewrite Frontend/Parser/formula_rewrite.k:521
lola: rewrite Frontend/Parser/formula_rewrite.k:550
lola: rewrite Frontend/Parser/formula_rewrite.k:379
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: LAUNCH task # 8 (type EXCL) for 7 ShieldIIPs-PT-100B-LTLCardinality-11
lola: time limit : 1197 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100B-LTLCardinality-07: CONJ 0 2 0 0 2 0 0 0
ShieldIIPs-PT-100B-LTLCardinality-11: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 1/1197 2/32 ShieldIIPs-PT-100B-LTLCardinality-11 25145 m, 5029 m/sec, 35461 t fired, .

Time elapsed: 10 secs. Pages in use: 2
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100B-LTLCardinality-07: CONJ 0 2 0 0 2 0 0 0
ShieldIIPs-PT-100B-LTLCardinality-11: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 6/1197 5/32 ShieldIIPs-PT-100B-LTLCardinality-11 99641 m, 14899 m/sec, 253319 t fired, .

Time elapsed: 15 secs. Pages in use: 5
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100B-LTLCardinality-07: CONJ 0 2 0 0 2 0 0 0
ShieldIIPs-PT-100B-LTLCardinality-11: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 11/1197 8/32 ShieldIIPs-PT-100B-LTLCardinality-11 165688 m, 13209 m/sec, 472830 t fired, .

Time elapsed: 20 secs. Pages in use: 8
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100B-LTLCardinality-07: CONJ 0 2 0 0 2 0 0 0
ShieldIIPs-PT-100B-LTLCardinality-11: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 16/1197 12/32 ShieldIIPs-PT-100B-LTLCardinality-11 225989 m, 12060 m/sec, 692393 t fired, .

Time elapsed: 25 secs. Pages in use: 12
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100B-LTLCardinality-07: CONJ 0 2 0 0 2 0 0 0
ShieldIIPs-PT-100B-LTLCardinality-11: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 21/1197 14/32 ShieldIIPs-PT-100B-LTLCardinality-11 285749 m, 11952 m/sec, 912450 t fired, .

Time elapsed: 30 secs. Pages in use: 14
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100B-LTLCardinality-07: CONJ 0 2 0 0 2 0 0 0
ShieldIIPs-PT-100B-LTLCardinality-11: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 26/1197 17/32 ShieldIIPs-PT-100B-LTLCardinality-11 345054 m, 11861 m/sec, 1132520 t fired, .

Time elapsed: 35 secs. Pages in use: 17
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100B-LTLCardinality-07: CONJ 0 2 0 0 2 0 0 0
ShieldIIPs-PT-100B-LTLCardinality-11: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 31/1197 20/32 ShieldIIPs-PT-100B-LTLCardinality-11 399886 m, 10966 m/sec, 1352637 t fired, .

Time elapsed: 40 secs. Pages in use: 20
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100B-LTLCardinality-07: CONJ 0 2 0 0 2 0 0 0
ShieldIIPs-PT-100B-LTLCardinality-11: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 36/1197 23/32 ShieldIIPs-PT-100B-LTLCardinality-11 451479 m, 10318 m/sec, 1570931 t fired, .

Time elapsed: 45 secs. Pages in use: 23
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100B-LTLCardinality-07: CONJ 0 2 0 0 2 0 0 0
ShieldIIPs-PT-100B-LTLCardinality-11: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 41/1197 26/32 ShieldIIPs-PT-100B-LTLCardinality-11 509447 m, 11593 m/sec, 1790477 t fired, .

Time elapsed: 50 secs. Pages in use: 26
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100B-LTLCardinality-07: CONJ 0 2 0 0 2 0 0 0
ShieldIIPs-PT-100B-LTLCardinality-11: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 46/1197 28/32 ShieldIIPs-PT-100B-LTLCardinality-11 566581 m, 11426 m/sec, 2010197 t fired, .

Time elapsed: 55 secs. Pages in use: 28
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100B-LTLCardinality-07: CONJ 0 2 0 0 2 0 0 0
ShieldIIPs-PT-100B-LTLCardinality-11: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 51/1197 31/32 ShieldIIPs-PT-100B-LTLCardinality-11 620851 m, 10854 m/sec, 2230662 t fired, .

Time elapsed: 60 secs. Pages in use: 31
# running tasks: 1 of 4 Visible: 2
lola: CANCELED task # 8 (type EXCL) for ShieldIIPs-PT-100B-LTLCardinality-11 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100B-LTLCardinality-07: CONJ 0 2 0 0 2 0 0 0
ShieldIIPs-PT-100B-LTLCardinality-11: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 65 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: LAUNCH task # 5 (type EXCL) for 0 ShieldIIPs-PT-100B-LTLCardinality-07
lola: time limit : 1767 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100B-LTLCardinality-07: CONJ 0 1 1 0 2 0 0 0
ShieldIIPs-PT-100B-LTLCardinality-11: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
5 LTL EXCL 5/1767 5/32 ShieldIIPs-PT-100B-LTLCardinality-07 54786 m, 10957 m/sec, 221676 t fired, .

Time elapsed: 70 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100B-LTLCardinality-07: CONJ 0 1 1 0 2 0 0 0
ShieldIIPs-PT-100B-LTLCardinality-11: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
5 LTL EXCL 10/1767 8/32 ShieldIIPs-PT-100B-LTLCardinality-07 94753 m, 7993 m/sec, 447258 t fired, .

Time elapsed: 75 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100B-LTLCardinality-07: CONJ 0 1 1 0 2 0 0 0
ShieldIIPs-PT-100B-LTLCardinality-11: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
5 LTL EXCL 15/1767 11/32 ShieldIIPs-PT-100B-LTLCardinality-07 128686 m, 6786 m/sec, 672013 t fired, .

Time elapsed: 80 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100B-LTLCardinality-07: CONJ 0 1 1 0 2 0 0 0
ShieldIIPs-PT-100B-LTLCardinality-11: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
5 LTL EXCL 20/1767 14/32 ShieldIIPs-PT-100B-LTLCardinality-07 164926 m, 7248 m/sec, 897464 t fired, .

Time elapsed: 85 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100B-LTLCardinality-07: CONJ 0 1 1 0 2 0 0 0
ShieldIIPs-PT-100B-LTLCardinality-11: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
5 LTL EXCL 25/1767 16/32 ShieldIIPs-PT-100B-LTLCardinality-07 198259 m, 6666 m/sec, 1123374 t fired, .

Time elapsed: 90 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100B-LTLCardinality-07: CONJ 0 1 1 0 2 0 0 0
ShieldIIPs-PT-100B-LTLCardinality-11: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
5 LTL EXCL 30/1767 19/32 ShieldIIPs-PT-100B-LTLCardinality-07 228419 m, 6032 m/sec, 1349418 t fired, .

Time elapsed: 95 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100B-LTLCardinality-07: CONJ 0 1 1 0 2 0 0 0
ShieldIIPs-PT-100B-LTLCardinality-11: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
5 LTL EXCL 35/1767 21/32 ShieldIIPs-PT-100B-LTLCardinality-07 261535 m, 6623 m/sec, 1568874 t fired, .

Time elapsed: 100 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100B-LTLCardinality-07: CONJ 0 1 1 0 2 0 0 0
ShieldIIPs-PT-100B-LTLCardinality-11: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
5 LTL EXCL 40/1767 24/32 ShieldIIPs-PT-100B-LTLCardinality-07 295482 m, 6789 m/sec, 1792308 t fired, .

Time elapsed: 105 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100B-LTLCardinality-07: CONJ 0 1 1 0 2 0 0 0
ShieldIIPs-PT-100B-LTLCardinality-11: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
5 LTL EXCL 45/1767 27/32 ShieldIIPs-PT-100B-LTLCardinality-07 325623 m, 6028 m/sec, 2013849 t fired, .

Time elapsed: 110 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100B-LTLCardinality-07: CONJ 0 1 1 0 2 0 0 0
ShieldIIPs-PT-100B-LTLCardinality-11: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
5 LTL EXCL 50/1767 29/32 ShieldIIPs-PT-100B-LTLCardinality-07 358092 m, 6493 m/sec, 2235924 t fired, .

Time elapsed: 115 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100B-LTLCardinality-07: CONJ 0 1 1 0 2 0 0 0
ShieldIIPs-PT-100B-LTLCardinality-11: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
5 LTL EXCL 55/1767 32/32 ShieldIIPs-PT-100B-LTLCardinality-07 394614 m, 7304 m/sec, 2459860 t fired, .

Time elapsed: 120 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: CANCELED task # 5 (type EXCL) for ShieldIIPs-PT-100B-LTLCardinality-07 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-100B-LTLCardinality-07: CONJ 0 1 0 0 2 0 1 0
ShieldIIPs-PT-100B-LTLCardinality-11: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 125 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: LAUNCH task # 3 (type EXCL) for 0 ShieldIIPs-PT-100B-LTLCardinality-07
lola: time limit : 3475 sec
lola: memory limit: 32 pages
lola: FINISHED task # 3 (type EXCL) for ShieldIIPs-PT-100B-LTLCardinality-07
lola: result : true
lola: markings : 2
lola: fired transitions : 1
lola: time used : 0.000000
lola: memory pages used : 1
lola: Portfolio finished: no open tasks 2

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldIIPs-PT-100B-LTLCardinality-07: CONJ unknown CONJ
ShieldIIPs-PT-100B-LTLCardinality-11: LTL unknown AGGR


Time elapsed: 125 secs. Pages in use: 32

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldIIPs-PT-100B"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="lolaxred"
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 lolaxred"
echo " Input is ShieldIIPs-PT-100B, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r391-oct2-167903715000171"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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