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-167903715400507.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 ShieldPPPs-PT-050B, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r391-oct2-167903715400507
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 6.2K Feb 26 01:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Feb 26 01:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 26 01:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 26 01:50 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.6K Feb 25 16:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 01:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 110K Feb 26 01:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 26 01:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 26 01:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:59 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 888K Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679277117055

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=ShieldPPPs-PT-050B
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-20 01:51:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-20 01:51:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 01:51:59] [INFO ] Load time of PNML (sax parser for PT used): 161 ms
[2023-03-20 01:51:59] [INFO ] Transformed 3403 places.
[2023-03-20 01:51:59] [INFO ] Transformed 3153 transitions.
[2023-03-20 01:51:59] [INFO ] Found NUPN structural information;
[2023-03-20 01:51:59] [INFO ] Parsed PT model containing 3403 places and 3153 transitions and 8706 arcs in 372 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 2 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA ShieldPPPs-PT-050B-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-050B-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-050B-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-050B-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-050B-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-050B-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-050B-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-050B-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-050B-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 28 out of 3403 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3403/3403 places, 3153/3153 transitions.
Discarding 343 places :
Symmetric choice reduction at 0 with 343 rule applications. Total rules 343 place count 3060 transition count 2810
Iterating global reduction 0 with 343 rules applied. Total rules applied 686 place count 3060 transition count 2810
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 687 place count 3059 transition count 2809
Iterating global reduction 0 with 1 rules applied. Total rules applied 688 place count 3059 transition count 2809
Applied a total of 688 rules in 1164 ms. Remains 3059 /3403 variables (removed 344) and now considering 2809/3153 (removed 344) transitions.
// Phase 1: matrix 2809 rows 3059 cols
[2023-03-20 01:52:01] [INFO ] Computed 551 place invariants in 52 ms
[2023-03-20 01:52:03] [INFO ] Implicit Places using invariants in 2126 ms returned []
[2023-03-20 01:52:03] [INFO ] Invariant cache hit.
[2023-03-20 01:52:07] [INFO ] Implicit Places using invariants and state equation in 4251 ms returned []
Implicit Place search using SMT with State Equation took 6414 ms to find 0 implicit places.
[2023-03-20 01:52:07] [INFO ] Invariant cache hit.
[2023-03-20 01:52:10] [INFO ] Dead Transitions using invariants and state equation in 2623 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3059/3403 places, 2809/3153 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10208 ms. Remains : 3059/3403 places, 2809/3153 transitions.
Support contains 28 out of 3059 places after structural reductions.
[2023-03-20 01:52:10] [INFO ] Flatten gal took : 281 ms
[2023-03-20 01:52:10] [INFO ] Flatten gal took : 102 ms
[2023-03-20 01:52:10] [INFO ] Input system was already deterministic with 2809 transitions.
Support contains 26 out of 3059 places (down from 28) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 495 ms. (steps per millisecond=20 ) properties (out of 17) seen :9
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 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 31 ms. (steps per millisecond=322 ) properties (out of 8) 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 8) 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 8) 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 8) seen :0
Running SMT prover for 8 properties.
[2023-03-20 01:52:11] [INFO ] Invariant cache hit.
[2023-03-20 01:52:12] [INFO ] After 835ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-20 01:52:13] [INFO ] [Nat]Absence check using 551 positive place invariants in 261 ms returned sat
[2023-03-20 01:52:17] [INFO ] After 2807ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-20 01:52:18] [INFO ] Deduced a trap composed of 19 places in 949 ms of which 10 ms to minimize.
[2023-03-20 01:52:19] [INFO ] Deduced a trap composed of 24 places in 952 ms of which 3 ms to minimize.
[2023-03-20 01:52:20] [INFO ] Deduced a trap composed of 25 places in 831 ms of which 16 ms to minimize.
[2023-03-20 01:52:21] [INFO ] Deduced a trap composed of 24 places in 911 ms of which 2 ms to minimize.
[2023-03-20 01:52:22] [INFO ] Deduced a trap composed of 18 places in 1009 ms of which 2 ms to minimize.
[2023-03-20 01:52:23] [INFO ] Deduced a trap composed of 21 places in 918 ms of which 2 ms to minimize.
[2023-03-20 01:52:24] [INFO ] Deduced a trap composed of 24 places in 752 ms of which 4 ms to minimize.
[2023-03-20 01:52:25] [INFO ] Deduced a trap composed of 25 places in 862 ms of which 4 ms to minimize.
[2023-03-20 01:52:26] [INFO ] Deduced a trap composed of 21 places in 890 ms of which 2 ms to minimize.
[2023-03-20 01:52:27] [INFO ] Deduced a trap composed of 25 places in 715 ms of which 2 ms to minimize.
[2023-03-20 01:52:28] [INFO ] Deduced a trap composed of 32 places in 874 ms of which 1 ms to minimize.
[2023-03-20 01:52:29] [INFO ] Deduced a trap composed of 26 places in 709 ms of which 2 ms to minimize.
[2023-03-20 01:52:30] [INFO ] Deduced a trap composed of 25 places in 922 ms of which 1 ms to minimize.
[2023-03-20 01:52:31] [INFO ] Deduced a trap composed of 18 places in 632 ms of which 2 ms to minimize.
[2023-03-20 01:52:31] [INFO ] Deduced a trap composed of 10 places in 759 ms of which 2 ms to minimize.
[2023-03-20 01:52:32] [INFO ] Deduced a trap composed of 33 places in 624 ms of which 2 ms to minimize.
[2023-03-20 01:52:33] [INFO ] Deduced a trap composed of 34 places in 686 ms of which 2 ms to minimize.
[2023-03-20 01:52:34] [INFO ] Deduced a trap composed of 51 places in 738 ms of which 1 ms to minimize.
[2023-03-20 01:52:35] [INFO ] Deduced a trap composed of 40 places in 923 ms of which 2 ms to minimize.
[2023-03-20 01:52:36] [INFO ] Deduced a trap composed of 58 places in 683 ms of which 1 ms to minimize.
[2023-03-20 01:52:36] [INFO ] Deduced a trap composed of 35 places in 704 ms of which 1 ms to minimize.
[2023-03-20 01:52:37] [INFO ] Deduced a trap composed of 38 places in 654 ms of which 3 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-20 01:52:37] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 01:52:37] [INFO ] After 25151ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:8
Parikh walk visited 0 properties in 1253 ms.
Support contains 16 out of 3059 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3059/3059 places, 2809/2809 transitions.
Drop transitions removed 345 transitions
Trivial Post-agglo rules discarded 345 transitions
Performed 345 trivial Post agglomeration. Transition count delta: 345
Iterating post reduction 0 with 345 rules applied. Total rules applied 345 place count 3059 transition count 2464
Reduce places removed 345 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 348 rules applied. Total rules applied 693 place count 2714 transition count 2461
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 696 place count 2711 transition count 2461
Performed 250 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 250 Pre rules applied. Total rules applied 696 place count 2711 transition count 2211
Deduced a syphon composed of 250 places in 6 ms
Reduce places removed 250 places and 0 transitions.
Iterating global reduction 3 with 500 rules applied. Total rules applied 1196 place count 2461 transition count 2211
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 1200 place count 2457 transition count 2207
Iterating global reduction 3 with 4 rules applied. Total rules applied 1204 place count 2457 transition count 2207
Performed 894 Post agglomeration using F-continuation condition.Transition count delta: 894
Deduced a syphon composed of 894 places in 2 ms
Reduce places removed 894 places and 0 transitions.
Iterating global reduction 3 with 1788 rules applied. Total rules applied 2992 place count 1563 transition count 1313
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 434 times.
Drop transitions removed 434 transitions
Iterating global reduction 3 with 434 rules applied. Total rules applied 3426 place count 1563 transition count 1313
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 3427 place count 1562 transition count 1312
Applied a total of 3427 rules in 912 ms. Remains 1562 /3059 variables (removed 1497) and now considering 1312/2809 (removed 1497) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 912 ms. Remains : 1562/3059 places, 1312/2809 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 303 ms. (steps per millisecond=33 ) properties (out of 8) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1312 rows 1562 cols
[2023-03-20 01:52:40] [INFO ] Computed 551 place invariants in 88 ms
[2023-03-20 01:52:40] [INFO ] After 189ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 01:52:40] [INFO ] [Nat]Absence check using 524 positive place invariants in 114 ms returned sat
[2023-03-20 01:52:41] [INFO ] [Nat]Absence check using 524 positive and 27 generalized place invariants in 53 ms returned sat
[2023-03-20 01:52:42] [INFO ] After 962ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 01:52:42] [INFO ] Deduced a trap composed of 4 places in 179 ms of which 0 ms to minimize.
[2023-03-20 01:52:42] [INFO ] Deduced a trap composed of 5 places in 187 ms of which 1 ms to minimize.
[2023-03-20 01:52:43] [INFO ] Deduced a trap composed of 5 places in 647 ms of which 1 ms to minimize.
[2023-03-20 01:52:43] [INFO ] Deduced a trap composed of 10 places in 162 ms of which 0 ms to minimize.
[2023-03-20 01:52:43] [INFO ] Deduced a trap composed of 4 places in 237 ms of which 1 ms to minimize.
[2023-03-20 01:52:44] [INFO ] Deduced a trap composed of 8 places in 185 ms of which 1 ms to minimize.
[2023-03-20 01:52:44] [INFO ] Deduced a trap composed of 6 places in 142 ms of which 1 ms to minimize.
[2023-03-20 01:52:46] [INFO ] Deduced a trap composed of 5 places in 2169 ms of which 1 ms to minimize.
[2023-03-20 01:52:46] [INFO ] Deduced a trap composed of 6 places in 173 ms of which 1 ms to minimize.
[2023-03-20 01:52:47] [INFO ] Deduced a trap composed of 6 places in 256 ms of which 1 ms to minimize.
[2023-03-20 01:52:47] [INFO ] Deduced a trap composed of 6 places in 229 ms of which 1 ms to minimize.
[2023-03-20 01:52:47] [INFO ] Deduced a trap composed of 6 places in 181 ms of which 0 ms to minimize.
[2023-03-20 01:52:47] [INFO ] Deduced a trap composed of 6 places in 214 ms of which 1 ms to minimize.
[2023-03-20 01:52:48] [INFO ] Deduced a trap composed of 6 places in 149 ms of which 0 ms to minimize.
[2023-03-20 01:52:48] [INFO ] Deduced a trap composed of 11 places in 146 ms of which 1 ms to minimize.
[2023-03-20 01:52:48] [INFO ] Deduced a trap composed of 11 places in 211 ms of which 1 ms to minimize.
[2023-03-20 01:52:48] [INFO ] Deduced a trap composed of 10 places in 143 ms of which 0 ms to minimize.
[2023-03-20 01:52:49] [INFO ] Deduced a trap composed of 14 places in 120 ms of which 14 ms to minimize.
[2023-03-20 01:52:49] [INFO ] Deduced a trap composed of 20 places in 143 ms of which 0 ms to minimize.
[2023-03-20 01:52:49] [INFO ] Deduced a trap composed of 9 places in 156 ms of which 0 ms to minimize.
[2023-03-20 01:52:49] [INFO ] Deduced a trap composed of 4 places in 152 ms of which 1 ms to minimize.
[2023-03-20 01:52:49] [INFO ] Deduced a trap composed of 6 places in 168 ms of which 0 ms to minimize.
[2023-03-20 01:52:50] [INFO ] Deduced a trap composed of 7 places in 136 ms of which 1 ms to minimize.
[2023-03-20 01:52:50] [INFO ] Deduced a trap composed of 14 places in 139 ms of which 1 ms to minimize.
[2023-03-20 01:52:50] [INFO ] Deduced a trap composed of 10 places in 135 ms of which 1 ms to minimize.
[2023-03-20 01:52:50] [INFO ] Deduced a trap composed of 6 places in 122 ms of which 0 ms to minimize.
[2023-03-20 01:52:50] [INFO ] Deduced a trap composed of 6 places in 89 ms of which 0 ms to minimize.
[2023-03-20 01:52:51] [INFO ] Trap strengthening (SAT) tested/added 28/27 trap constraints in 8964 ms
[2023-03-20 01:52:51] [INFO ] After 10144ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 193 ms.
[2023-03-20 01:52:51] [INFO ] After 10797ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 77 ms.
Support contains 6 out of 1562 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1562/1562 places, 1312/1312 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 3 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 1556 transition count 1306
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 13 place count 1555 transition count 1305
Applied a total of 13 rules in 231 ms. Remains 1555 /1562 variables (removed 7) and now considering 1305/1312 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 232 ms. Remains : 1555/1562 places, 1305/1312 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 186 ms. (steps per millisecond=53 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1305 rows 1555 cols
[2023-03-20 01:52:52] [INFO ] Computed 551 place invariants in 33 ms
[2023-03-20 01:52:52] [INFO ] After 333ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 01:52:52] [INFO ] [Nat]Absence check using 525 positive place invariants in 104 ms returned sat
[2023-03-20 01:52:52] [INFO ] [Nat]Absence check using 525 positive and 26 generalized place invariants in 23 ms returned sat
[2023-03-20 01:52:53] [INFO ] After 744ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 01:52:53] [INFO ] Deduced a trap composed of 4 places in 209 ms of which 1 ms to minimize.
[2023-03-20 01:52:54] [INFO ] Deduced a trap composed of 5 places in 174 ms of which 1 ms to minimize.
[2023-03-20 01:52:54] [INFO ] Deduced a trap composed of 4 places in 184 ms of which 0 ms to minimize.
[2023-03-20 01:52:54] [INFO ] Deduced a trap composed of 6 places in 161 ms of which 1 ms to minimize.
[2023-03-20 01:52:54] [INFO ] Deduced a trap composed of 6 places in 164 ms of which 1 ms to minimize.
[2023-03-20 01:52:55] [INFO ] Deduced a trap composed of 6 places in 178 ms of which 1 ms to minimize.
[2023-03-20 01:52:55] [INFO ] Deduced a trap composed of 6 places in 174 ms of which 1 ms to minimize.
[2023-03-20 01:52:55] [INFO ] Deduced a trap composed of 4 places in 179 ms of which 0 ms to minimize.
[2023-03-20 01:52:55] [INFO ] Deduced a trap composed of 11 places in 200 ms of which 1 ms to minimize.
[2023-03-20 01:52:56] [INFO ] Deduced a trap composed of 6 places in 251 ms of which 0 ms to minimize.
[2023-03-20 01:52:56] [INFO ] Deduced a trap composed of 6 places in 196 ms of which 1 ms to minimize.
[2023-03-20 01:52:56] [INFO ] Deduced a trap composed of 9 places in 107 ms of which 0 ms to minimize.
[2023-03-20 01:52:56] [INFO ] Deduced a trap composed of 8 places in 123 ms of which 0 ms to minimize.
[2023-03-20 01:52:56] [INFO ] Deduced a trap composed of 6 places in 138 ms of which 0 ms to minimize.
[2023-03-20 01:52:57] [INFO ] Deduced a trap composed of 6 places in 178 ms of which 0 ms to minimize.
[2023-03-20 01:52:57] [INFO ] Deduced a trap composed of 9 places in 181 ms of which 1 ms to minimize.
[2023-03-20 01:52:57] [INFO ] Deduced a trap composed of 17 places in 131 ms of which 0 ms to minimize.
[2023-03-20 01:52:57] [INFO ] Deduced a trap composed of 6 places in 137 ms of which 1 ms to minimize.
[2023-03-20 01:52:57] [INFO ] Deduced a trap composed of 11 places in 125 ms of which 0 ms to minimize.
[2023-03-20 01:52:58] [INFO ] Deduced a trap composed of 9 places in 120 ms of which 0 ms to minimize.
[2023-03-20 01:52:58] [INFO ] Deduced a trap composed of 9 places in 154 ms of which 0 ms to minimize.
[2023-03-20 01:52:58] [INFO ] Deduced a trap composed of 12 places in 139 ms of which 1 ms to minimize.
[2023-03-20 01:52:58] [INFO ] Deduced a trap composed of 6 places in 149 ms of which 0 ms to minimize.
[2023-03-20 01:52:59] [INFO ] Deduced a trap composed of 8 places in 119 ms of which 0 ms to minimize.
[2023-03-20 01:52:59] [INFO ] Deduced a trap composed of 12 places in 118 ms of which 0 ms to minimize.
[2023-03-20 01:52:59] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 5756 ms
[2023-03-20 01:52:59] [INFO ] After 6579ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 101 ms.
[2023-03-20 01:52:59] [INFO ] After 7061ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 42 ms.
Support contains 4 out of 1555 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1555/1555 places, 1305/1305 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1555 transition count 1304
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1554 transition count 1304
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 1553 transition count 1303
Applied a total of 4 rules in 112 ms. Remains 1553 /1555 variables (removed 2) and now considering 1303/1305 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 113 ms. Remains : 1553/1555 places, 1303/1305 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 1) seen :0
Finished probabilistic random walk after 36674 steps, run visited all 1 properties in 614 ms. (steps per millisecond=59 )
Probabilistic random walk after 36674 steps, saw 34048 distinct states, run finished after 615 ms. (steps per millisecond=59 ) properties seen :1
Computed a total of 602 stabilizing places and 602 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(p0)&&(F(G(p1))||G(p2))))))'
Support contains 4 out of 3059 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3059/3059 places, 2809/2809 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 3053 transition count 2803
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 3053 transition count 2803
Applied a total of 12 rules in 475 ms. Remains 3053 /3059 variables (removed 6) and now considering 2803/2809 (removed 6) transitions.
// Phase 1: matrix 2803 rows 3053 cols
[2023-03-20 01:53:01] [INFO ] Computed 551 place invariants in 32 ms
[2023-03-20 01:53:02] [INFO ] Implicit Places using invariants in 1040 ms returned []
[2023-03-20 01:53:02] [INFO ] Invariant cache hit.
[2023-03-20 01:53:06] [INFO ] Implicit Places using invariants and state equation in 3870 ms returned []
Implicit Place search using SMT with State Equation took 4912 ms to find 0 implicit places.
[2023-03-20 01:53:06] [INFO ] Invariant cache hit.
[2023-03-20 01:53:08] [INFO ] Dead Transitions using invariants and state equation in 2327 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3053/3059 places, 2803/2809 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7727 ms. Remains : 3053/3059 places, 2803/2809 transitions.
Stuttering acceptance computed with spot in 457 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p2)), true]
Running random walk in product with property : ShieldPPPs-PT-050B-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}, { cond=(NOT p2), acceptance={} source=2 dest: 4}, { cond=p2, acceptance={} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={} source=3 dest: 6}], [{ cond=p1, acceptance={} source=4 dest: 4}, { cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 4}, { cond=p2, acceptance={} source=5 dest: 5}], [{ cond=true, acceptance={0} source=6 dest: 6}]], initial=0, aps=[p2:(OR (EQ s1673 0) (EQ s2031 1)), p0:(OR (EQ s1673 0) (EQ s2031 1) (EQ s2003 0) (EQ s882 1)), p1:(AND (EQ s2031 0) (EQ s1673 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]]
Stuttering criterion allowed to conclude after 7658 steps with 0 reset in 143 ms.
FORMULA ShieldPPPs-PT-050B-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-050B-LTLCardinality-02 finished in 8466 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 U X(p1)))&&X(G(p2)))))'
Support contains 4 out of 3059 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3059/3059 places, 2809/2809 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 3054 transition count 2804
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 3054 transition count 2804
Applied a total of 10 rules in 491 ms. Remains 3054 /3059 variables (removed 5) and now considering 2804/2809 (removed 5) transitions.
// Phase 1: matrix 2804 rows 3054 cols
[2023-03-20 01:53:09] [INFO ] Computed 551 place invariants in 22 ms
[2023-03-20 01:53:11] [INFO ] Implicit Places using invariants in 1310 ms returned []
[2023-03-20 01:53:11] [INFO ] Invariant cache hit.
[2023-03-20 01:53:14] [INFO ] Implicit Places using invariants and state equation in 3672 ms returned []
Implicit Place search using SMT with State Equation took 4984 ms to find 0 implicit places.
[2023-03-20 01:53:14] [INFO ] Invariant cache hit.
[2023-03-20 01:53:16] [INFO ] Dead Transitions using invariants and state equation in 1489 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3054/3059 places, 2804/2809 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6968 ms. Remains : 3054/3059 places, 2804/2809 transitions.
Stuttering acceptance computed with spot in 306 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (NOT p2), (NOT p1), true]
Running random walk in product with property : ShieldPPPs-PT-050B-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}, { cond=true, acceptance={} source=1 dest: 4}, { cond=p0, acceptance={} source=1 dest: 5}], [{ cond=(NOT p1), acceptance={} source=2 dest: 6}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}, { cond=p0, acceptance={} source=3 dest: 5}], [{ cond=p2, acceptance={} source=4 dest: 4}, { cond=(NOT p2), acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=5 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=5 dest: 5}], [{ cond=true, acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(OR (EQ s3030 0) (EQ s710 1)), p1:(OR (EQ s1305 0) (EQ s2791 1)), p2:(AND (EQ s710 0) (EQ s3030 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 10 steps with 2 reset in 13 ms.
FORMULA ShieldPPPs-PT-050B-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-050B-LTLCardinality-04 finished in 7358 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(F(p0))))'
Support contains 2 out of 3059 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3059/3059 places, 2809/2809 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 3052 transition count 2802
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 3052 transition count 2802
Applied a total of 14 rules in 482 ms. Remains 3052 /3059 variables (removed 7) and now considering 2802/2809 (removed 7) transitions.
// Phase 1: matrix 2802 rows 3052 cols
[2023-03-20 01:53:17] [INFO ] Computed 551 place invariants in 20 ms
[2023-03-20 01:53:18] [INFO ] Implicit Places using invariants in 1427 ms returned []
[2023-03-20 01:53:18] [INFO ] Invariant cache hit.
[2023-03-20 01:53:22] [INFO ] Implicit Places using invariants and state equation in 3734 ms returned []
Implicit Place search using SMT with State Equation took 5215 ms to find 0 implicit places.
[2023-03-20 01:53:22] [INFO ] Invariant cache hit.
[2023-03-20 01:53:24] [INFO ] Dead Transitions using invariants and state equation in 2234 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3052/3059 places, 2802/2809 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7933 ms. Remains : 3052/3059 places, 2802/2809 transitions.
Stuttering acceptance computed with spot in 193 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-050B-LTLCardinality-05 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}]], initial=2, aps=[p0:(AND (EQ s1721 0) (EQ s1958 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][false, false, false]]
Product exploration explored 100000 steps with 35 reset in 1032 ms.
Product exploration explored 100000 steps with 36 reset in 1227 ms.
Computed a total of 599 stabilizing places and 599 stable transitions
Computed a total of 599 stabilizing places and 599 stable transitions
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 150 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 171 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 2840 steps, including 0 resets, run visited all 1 properties in 41 ms. (steps per millisecond=69 )
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 187 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 170 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 199 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2023-03-20 01:53:28] [INFO ] Invariant cache hit.
[2023-03-20 01:53:31] [INFO ] [Real]Absence check using 551 positive place invariants in 1302 ms returned sat
[2023-03-20 01:53:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
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.verifyPossible(DeadlockTester.java:899)
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: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-20 01:53:43] [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 (NOT p0)
Could not prove EG (NOT p0)
Support contains 2 out of 3052 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3052/3052 places, 2802/2802 transitions.
Applied a total of 0 rules in 306 ms. Remains 3052 /3052 variables (removed 0) and now considering 2802/2802 (removed 0) transitions.
[2023-03-20 01:53:43] [INFO ] Invariant cache hit.
[2023-03-20 01:53:45] [INFO ] Implicit Places using invariants in 1797 ms returned []
[2023-03-20 01:53:45] [INFO ] Invariant cache hit.
[2023-03-20 01:53:48] [INFO ] Implicit Places using invariants and state equation in 3583 ms returned []
Implicit Place search using SMT with State Equation took 5385 ms to find 0 implicit places.
[2023-03-20 01:53:48] [INFO ] Invariant cache hit.
[2023-03-20 01:53:50] [INFO ] Dead Transitions using invariants and state equation in 1634 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7328 ms. Remains : 3052/3052 places, 2802/2802 transitions.
Computed a total of 599 stabilizing places and 599 stable transitions
Computed a total of 599 stabilizing places and 599 stable transitions
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 97 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 165 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 2915 steps, including 0 resets, run visited all 1 properties in 40 ms. (steps per millisecond=72 )
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 169 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 167 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 196 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2023-03-20 01:53:51] [INFO ] Invariant cache hit.
[2023-03-20 01:53:54] [INFO ] [Real]Absence check using 551 positive place invariants in 1162 ms returned sat
[2023-03-20 01:53:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 01:54:06] [INFO ] [Real]Absence check using state equation in 11572 ms returned unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 197 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 35 reset in 1045 ms.
Product exploration explored 100000 steps with 36 reset in 1159 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 161 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 3052 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3052/3052 places, 2802/2802 transitions.
Performed 351 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 351 rules applied. Total rules applied 351 place count 3052 transition count 2802
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 101 Pre rules applied. Total rules applied 351 place count 3052 transition count 2803
Deduced a syphon composed of 452 places in 8 ms
Iterating global reduction 1 with 101 rules applied. Total rules applied 452 place count 3052 transition count 2803
Performed 1048 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1500 places in 4 ms
Iterating global reduction 1 with 1048 rules applied. Total rules applied 1500 place count 3052 transition count 2803
Renaming transitions due to excessive name length > 1024 char.
Discarding 352 places :
Symmetric choice reduction at 1 with 352 rule applications. Total rules 1852 place count 2700 transition count 2451
Deduced a syphon composed of 1148 places in 3 ms
Iterating global reduction 1 with 352 rules applied. Total rules applied 2204 place count 2700 transition count 2451
Deduced a syphon composed of 1148 places in 3 ms
Applied a total of 2204 rules in 1550 ms. Remains 2700 /3052 variables (removed 352) and now considering 2451/2802 (removed 351) transitions.
[2023-03-20 01:54:11] [INFO ] Redundant transitions in 196 ms returned []
// Phase 1: matrix 2451 rows 2700 cols
[2023-03-20 01:54:11] [INFO ] Computed 551 place invariants in 41 ms
[2023-03-20 01:54:12] [INFO ] Dead Transitions using invariants and state equation in 1359 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2700/3052 places, 2451/2802 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3113 ms. Remains : 2700/3052 places, 2451/2802 transitions.
Support contains 2 out of 3052 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3052/3052 places, 2802/2802 transitions.
Applied a total of 0 rules in 228 ms. Remains 3052 /3052 variables (removed 0) and now considering 2802/2802 (removed 0) transitions.
// Phase 1: matrix 2802 rows 3052 cols
[2023-03-20 01:54:12] [INFO ] Computed 551 place invariants in 14 ms
[2023-03-20 01:54:14] [INFO ] Implicit Places using invariants in 1559 ms returned []
[2023-03-20 01:54:14] [INFO ] Invariant cache hit.
[2023-03-20 01:54:17] [INFO ] Implicit Places using invariants and state equation in 3487 ms returned []
Implicit Place search using SMT with State Equation took 5052 ms to find 0 implicit places.
[2023-03-20 01:54:17] [INFO ] Invariant cache hit.
[2023-03-20 01:54:19] [INFO ] Dead Transitions using invariants and state equation in 2157 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7441 ms. Remains : 3052/3052 places, 2802/2802 transitions.
Treatment of property ShieldPPPs-PT-050B-LTLCardinality-05 finished in 63654 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))'
Support contains 2 out of 3059 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3059/3059 places, 2809/2809 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 3053 transition count 2803
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 3053 transition count 2803
Applied a total of 12 rules in 350 ms. Remains 3053 /3059 variables (removed 6) and now considering 2803/2809 (removed 6) transitions.
// Phase 1: matrix 2803 rows 3053 cols
[2023-03-20 01:54:20] [INFO ] Computed 551 place invariants in 8 ms
[2023-03-20 01:54:21] [INFO ] Implicit Places using invariants in 1241 ms returned []
[2023-03-20 01:54:21] [INFO ] Invariant cache hit.
[2023-03-20 01:54:25] [INFO ] Implicit Places using invariants and state equation in 3620 ms returned []
Implicit Place search using SMT with State Equation took 4863 ms to find 0 implicit places.
[2023-03-20 01:54:25] [INFO ] Invariant cache hit.
[2023-03-20 01:54:27] [INFO ] Dead Transitions using invariants and state equation in 2295 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3053/3059 places, 2803/2809 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7509 ms. Remains : 3053/3059 places, 2803/2809 transitions.
Stuttering acceptance computed with spot in 144 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : ShieldPPPs-PT-050B-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s2321 0) (EQ s956 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldPPPs-PT-050B-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-050B-LTLCardinality-09 finished in 7692 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((X(!p0)||F(p1)) U (G((X(!p0)||F(p1)))||(p2&&(X(!p0)||F(p1)))))))'
Support contains 5 out of 3059 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3059/3059 places, 2809/2809 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 3052 transition count 2802
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 3052 transition count 2802
Applied a total of 14 rules in 372 ms. Remains 3052 /3059 variables (removed 7) and now considering 2802/2809 (removed 7) transitions.
// Phase 1: matrix 2802 rows 3052 cols
[2023-03-20 01:54:28] [INFO ] Computed 551 place invariants in 47 ms
[2023-03-20 01:54:29] [INFO ] Implicit Places using invariants in 1519 ms returned []
[2023-03-20 01:54:29] [INFO ] Invariant cache hit.
[2023-03-20 01:54:33] [INFO ] Implicit Places using invariants and state equation in 3996 ms returned []
Implicit Place search using SMT with State Equation took 5556 ms to find 0 implicit places.
[2023-03-20 01:54:33] [INFO ] Invariant cache hit.
[2023-03-20 01:54:36] [INFO ] Dead Transitions using invariants and state equation in 2314 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3052/3059 places, 2802/2809 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8245 ms. Remains : 3052/3059 places, 2802/2809 transitions.
Stuttering acceptance computed with spot in 292 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND (NOT p1) p0), (NOT p1)]
Running random walk in product with property : ShieldPPPs-PT-050B-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(OR (EQ s431 0) (EQ s267 1)), p1:(OR (NOT (OR (EQ s431 0) (EQ s267 1))) (NEQ s1567 1)), p0:(OR (EQ s725 0) (EQ s2307 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][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 2188 ms.
Product exploration explored 100000 steps with 50000 reset in 2172 ms.
Computed a total of 599 stabilizing places and 599 stable transitions
Computed a total of 599 stabilizing places and 599 stable transitions
Knowledge obtained : [(AND p2 p1 p0), (X p2), (X p1), (X (X (NOT (AND (NOT p1) p0)))), (X (X p2)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p1)
Knowledge based reduction with 6 factoid took 226 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPs-PT-050B-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPs-PT-050B-LTLCardinality-10 finished in 13225 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((F(p0)&&(F(p2)||p1)))))'
Support contains 4 out of 3059 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3059/3059 places, 2809/2809 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 3053 transition count 2803
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 3053 transition count 2803
Applied a total of 12 rules in 319 ms. Remains 3053 /3059 variables (removed 6) and now considering 2803/2809 (removed 6) transitions.
// Phase 1: matrix 2803 rows 3053 cols
[2023-03-20 01:54:41] [INFO ] Computed 551 place invariants in 20 ms
[2023-03-20 01:54:42] [INFO ] Implicit Places using invariants in 1355 ms returned []
[2023-03-20 01:54:42] [INFO ] Invariant cache hit.
[2023-03-20 01:54:46] [INFO ] Implicit Places using invariants and state equation in 4037 ms returned []
Implicit Place search using SMT with State Equation took 5412 ms to find 0 implicit places.
[2023-03-20 01:54:46] [INFO ] Invariant cache hit.
[2023-03-20 01:54:48] [INFO ] Dead Transitions using invariants and state equation in 2072 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3053/3059 places, 2803/2809 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7813 ms. Remains : 3053/3059 places, 2803/2809 transitions.
Stuttering acceptance computed with spot in 192 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2)]
Running random walk in product with property : ShieldPPPs-PT-050B-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s1166 0) (EQ s1410 1)), p1:(OR (EQ s1410 0) (EQ s1166 1)), p2:(OR (EQ s2536 0) (EQ s2999 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][false, false, false, false]]
Product exploration explored 100000 steps with 23 reset in 954 ms.
Product exploration explored 100000 steps with 23 reset in 1305 ms.
Computed a total of 600 stabilizing places and 600 stable transitions
Computed a total of 600 stabilizing places and 600 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT p0)), (X (NOT (AND (NOT p1) (NOT p2)))), true, (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 333 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 230 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 194 ms. (steps per millisecond=51 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-20 01:54:52] [INFO ] Invariant cache hit.
[2023-03-20 01:54:52] [INFO ] [Real]Absence check using 551 positive place invariants in 209 ms returned sat
[2023-03-20 01:54:54] [INFO ] After 2451ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 01:54:55] [INFO ] [Nat]Absence check using 551 positive place invariants in 222 ms returned sat
[2023-03-20 01:54:57] [INFO ] After 1996ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 01:54:58] [INFO ] Deduced a trap composed of 22 places in 1000 ms of which 2 ms to minimize.
[2023-03-20 01:54:59] [INFO ] Deduced a trap composed of 15 places in 936 ms of which 2 ms to minimize.
[2023-03-20 01:55:00] [INFO ] Deduced a trap composed of 26 places in 901 ms of which 2 ms to minimize.
[2023-03-20 01:55:01] [INFO ] Deduced a trap composed of 18 places in 918 ms of which 2 ms to minimize.
[2023-03-20 01:55:02] [INFO ] Deduced a trap composed of 16 places in 991 ms of which 2 ms to minimize.
[2023-03-20 01:55:03] [INFO ] Deduced a trap composed of 20 places in 806 ms of which 2 ms to minimize.
[2023-03-20 01:55:04] [INFO ] Deduced a trap composed of 32 places in 838 ms of which 2 ms to minimize.
[2023-03-20 01:55:05] [INFO ] Deduced a trap composed of 10 places in 767 ms of which 2 ms to minimize.
[2023-03-20 01:55:06] [INFO ] Deduced a trap composed of 26 places in 899 ms of which 1 ms to minimize.
[2023-03-20 01:55:07] [INFO ] Deduced a trap composed of 17 places in 868 ms of which 20 ms to minimize.
[2023-03-20 01:55:08] [INFO ] Deduced a trap composed of 29 places in 822 ms of which 2 ms to minimize.
[2023-03-20 01:55:09] [INFO ] Deduced a trap composed of 31 places in 846 ms of which 2 ms to minimize.
[2023-03-20 01:55:10] [INFO ] Deduced a trap composed of 25 places in 717 ms of which 1 ms to minimize.
[2023-03-20 01:55:11] [INFO ] Deduced a trap composed of 35 places in 805 ms of which 1 ms to minimize.
[2023-03-20 01:55:12] [INFO ] Deduced a trap composed of 27 places in 650 ms of which 2 ms to minimize.
[2023-03-20 01:55:13] [INFO ] Deduced a trap composed of 33 places in 773 ms of which 3 ms to minimize.
[2023-03-20 01:55:14] [INFO ] Deduced a trap composed of 34 places in 849 ms of which 2 ms to minimize.
[2023-03-20 01:55:15] [INFO ] Deduced a trap composed of 36 places in 723 ms of which 3 ms to minimize.
[2023-03-20 01:55:15] [INFO ] Deduced a trap composed of 29 places in 737 ms of which 2 ms to minimize.
[2023-03-20 01:55:16] [INFO ] Deduced a trap composed of 36 places in 831 ms of which 2 ms to minimize.
[2023-03-20 01:55:17] [INFO ] Deduced a trap composed of 34 places in 912 ms of which 2 ms to minimize.
[2023-03-20 01:55:18] [INFO ] Deduced a trap composed of 44 places in 758 ms of which 1 ms to minimize.
[2023-03-20 01:55:19] [INFO ] Deduced a trap composed of 23 places in 719 ms of which 1 ms to minimize.
[2023-03-20 01:55:20] [INFO ] Deduced a trap composed of 28 places in 844 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-20 01:55:20] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 01:55:20] [INFO ] After 25779ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Parikh walk visited 0 properties in 157 ms.
Support contains 4 out of 3053 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3053/3053 places, 2803/2803 transitions.
Drop transitions removed 351 transitions
Trivial Post-agglo rules discarded 351 transitions
Performed 351 trivial Post agglomeration. Transition count delta: 351
Iterating post reduction 0 with 351 rules applied. Total rules applied 351 place count 3053 transition count 2452
Reduce places removed 351 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 352 rules applied. Total rules applied 703 place count 2702 transition count 2451
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 704 place count 2701 transition count 2451
Performed 250 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 250 Pre rules applied. Total rules applied 704 place count 2701 transition count 2201
Deduced a syphon composed of 250 places in 9 ms
Reduce places removed 250 places and 0 transitions.
Iterating global reduction 3 with 500 rules applied. Total rules applied 1204 place count 2451 transition count 2201
Performed 897 Post agglomeration using F-continuation condition.Transition count delta: 897
Deduced a syphon composed of 897 places in 2 ms
Reduce places removed 897 places and 0 transitions.
Iterating global reduction 3 with 1794 rules applied. Total rules applied 2998 place count 1554 transition count 1304
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 445 times.
Drop transitions removed 445 transitions
Iterating global reduction 3 with 445 rules applied. Total rules applied 3443 place count 1554 transition count 1304
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 3444 place count 1553 transition count 1303
Applied a total of 3444 rules in 632 ms. Remains 1553 /3053 variables (removed 1500) and now considering 1303/2803 (removed 1500) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 633 ms. Remains : 1553/3053 places, 1303/2803 transitions.
Finished random walk after 4575 steps, including 1 resets, run visited all 2 properties in 103 ms. (steps per millisecond=44 )
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT p0)), (X (NOT (AND (NOT p1) (NOT p2)))), true, (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p2))]
False Knowledge obtained : [(F p0), (F (NOT p2)), (F (AND (NOT p1) (NOT p2)))]
Knowledge based reduction with 7 factoid took 428 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 219 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2)]
Stuttering acceptance computed with spot in 241 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2)]
[2023-03-20 01:55:22] [INFO ] Invariant cache hit.
[2023-03-20 01:55:25] [INFO ] [Real]Absence check using 551 positive place invariants in 1153 ms returned sat
[2023-03-20 01:55:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 01:55:37] [INFO ] [Real]Absence check using state equation in 11481 ms returned unknown
Could not prove EG (NOT p0)
Support contains 4 out of 3053 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3053/3053 places, 2803/2803 transitions.
Applied a total of 0 rules in 244 ms. Remains 3053 /3053 variables (removed 0) and now considering 2803/2803 (removed 0) transitions.
[2023-03-20 01:55:37] [INFO ] Invariant cache hit.
[2023-03-20 01:55:39] [INFO ] Implicit Places using invariants in 1352 ms returned []
[2023-03-20 01:55:39] [INFO ] Invariant cache hit.
[2023-03-20 01:55:42] [INFO ] Implicit Places using invariants and state equation in 3795 ms returned []
Implicit Place search using SMT with State Equation took 5162 ms to find 0 implicit places.
[2023-03-20 01:55:42] [INFO ] Invariant cache hit.
[2023-03-20 01:55:45] [INFO ] Dead Transitions using invariants and state equation in 2662 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8074 ms. Remains : 3053/3053 places, 2803/2803 transitions.
Computed a total of 600 stabilizing places and 600 stable transitions
Computed a total of 600 stabilizing places and 600 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT p0)), (X (NOT (AND (NOT p1) (NOT p2)))), true, (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 436 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 203 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 244 ms. (steps per millisecond=40 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-20 01:55:46] [INFO ] Invariant cache hit.
[2023-03-20 01:55:47] [INFO ] [Real]Absence check using 551 positive place invariants in 305 ms returned sat
[2023-03-20 01:55:49] [INFO ] After 2901ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 01:55:50] [INFO ] [Nat]Absence check using 551 positive place invariants in 208 ms returned sat
[2023-03-20 01:55:52] [INFO ] After 1817ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 01:55:53] [INFO ] Deduced a trap composed of 22 places in 930 ms of which 2 ms to minimize.
[2023-03-20 01:55:54] [INFO ] Deduced a trap composed of 15 places in 807 ms of which 2 ms to minimize.
[2023-03-20 01:55:55] [INFO ] Deduced a trap composed of 26 places in 853 ms of which 2 ms to minimize.
[2023-03-20 01:55:56] [INFO ] Deduced a trap composed of 18 places in 814 ms of which 2 ms to minimize.
[2023-03-20 01:55:57] [INFO ] Deduced a trap composed of 16 places in 840 ms of which 2 ms to minimize.
[2023-03-20 01:55:58] [INFO ] Deduced a trap composed of 20 places in 860 ms of which 1 ms to minimize.
[2023-03-20 01:55:58] [INFO ] Deduced a trap composed of 32 places in 813 ms of which 2 ms to minimize.
[2023-03-20 01:55:59] [INFO ] Deduced a trap composed of 10 places in 798 ms of which 2 ms to minimize.
[2023-03-20 01:56:00] [INFO ] Deduced a trap composed of 26 places in 843 ms of which 2 ms to minimize.
[2023-03-20 01:56:01] [INFO ] Deduced a trap composed of 17 places in 896 ms of which 2 ms to minimize.
[2023-03-20 01:56:02] [INFO ] Deduced a trap composed of 29 places in 834 ms of which 3 ms to minimize.
[2023-03-20 01:56:03] [INFO ] Deduced a trap composed of 31 places in 779 ms of which 2 ms to minimize.
[2023-03-20 01:56:04] [INFO ] Deduced a trap composed of 25 places in 777 ms of which 2 ms to minimize.
[2023-03-20 01:56:05] [INFO ] Deduced a trap composed of 35 places in 778 ms of which 2 ms to minimize.
[2023-03-20 01:56:06] [INFO ] Deduced a trap composed of 27 places in 828 ms of which 2 ms to minimize.
[2023-03-20 01:56:07] [INFO ] Deduced a trap composed of 33 places in 802 ms of which 2 ms to minimize.
[2023-03-20 01:56:08] [INFO ] Deduced a trap composed of 34 places in 758 ms of which 2 ms to minimize.
[2023-03-20 01:56:09] [INFO ] Deduced a trap composed of 36 places in 721 ms of which 2 ms to minimize.
[2023-03-20 01:56:09] [INFO ] Deduced a trap composed of 29 places in 740 ms of which 2 ms to minimize.
[2023-03-20 01:56:10] [INFO ] Deduced a trap composed of 36 places in 860 ms of which 2 ms to minimize.
[2023-03-20 01:56:12] [INFO ] Deduced a trap composed of 34 places in 1688 ms of which 2 ms to minimize.
[2023-03-20 01:56:13] [INFO ] Deduced a trap composed of 44 places in 808 ms of which 2 ms to minimize.
[2023-03-20 01:56:14] [INFO ] Deduced a trap composed of 23 places in 725 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-20 01:56:14] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 01:56:14] [INFO ] After 25081ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Parikh walk visited 0 properties in 151 ms.
Support contains 4 out of 3053 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3053/3053 places, 2803/2803 transitions.
Drop transitions removed 351 transitions
Trivial Post-agglo rules discarded 351 transitions
Performed 351 trivial Post agglomeration. Transition count delta: 351
Iterating post reduction 0 with 351 rules applied. Total rules applied 351 place count 3053 transition count 2452
Reduce places removed 351 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 352 rules applied. Total rules applied 703 place count 2702 transition count 2451
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 704 place count 2701 transition count 2451
Performed 250 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 250 Pre rules applied. Total rules applied 704 place count 2701 transition count 2201
Deduced a syphon composed of 250 places in 5 ms
Reduce places removed 250 places and 0 transitions.
Iterating global reduction 3 with 500 rules applied. Total rules applied 1204 place count 2451 transition count 2201
Performed 897 Post agglomeration using F-continuation condition.Transition count delta: 897
Deduced a syphon composed of 897 places in 2 ms
Reduce places removed 897 places and 0 transitions.
Iterating global reduction 3 with 1794 rules applied. Total rules applied 2998 place count 1554 transition count 1304
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 445 times.
Drop transitions removed 445 transitions
Iterating global reduction 3 with 445 rules applied. Total rules applied 3443 place count 1554 transition count 1304
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 3444 place count 1553 transition count 1303
Applied a total of 3444 rules in 400 ms. Remains 1553 /3053 variables (removed 1500) and now considering 1303/2803 (removed 1500) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 400 ms. Remains : 1553/3053 places, 1303/2803 transitions.
Finished random walk after 4335 steps, including 1 resets, run visited all 2 properties in 67 ms. (steps per millisecond=64 )
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT p0)), (X (NOT (AND (NOT p1) (NOT p2)))), true, (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p2))]
False Knowledge obtained : [(F p0), (F (NOT p2)), (F (AND (NOT p1) (NOT p2)))]
Knowledge based reduction with 7 factoid took 467 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 267 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2)]
Stuttering acceptance computed with spot in 265 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2)]
[2023-03-20 01:56:16] [INFO ] Invariant cache hit.
[2023-03-20 01:56:19] [INFO ] [Real]Absence check using 551 positive place invariants in 1029 ms returned sat
[2023-03-20 01:56:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 01:56:31] [INFO ] [Real]Absence check using state equation in 11596 ms returned unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 282 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2)]
Product exploration explored 100000 steps with 24 reset in 998 ms.
Product exploration explored 100000 steps with 24 reset in 1151 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 258 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2)]
Support contains 4 out of 3053 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3053/3053 places, 2803/2803 transitions.
Performed 351 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 351 rules applied. Total rules applied 351 place count 3053 transition count 2803
Performed 102 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 102 Pre rules applied. Total rules applied 351 place count 3053 transition count 2805
Deduced a syphon composed of 453 places in 9 ms
Iterating global reduction 1 with 102 rules applied. Total rules applied 453 place count 3053 transition count 2805
Performed 1046 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1499 places in 3 ms
Iterating global reduction 1 with 1046 rules applied. Total rules applied 1499 place count 3053 transition count 2805
Renaming transitions due to excessive name length > 1024 char.
Discarding 351 places :
Symmetric choice reduction at 1 with 351 rule applications. Total rules 1850 place count 2702 transition count 2454
Deduced a syphon composed of 1148 places in 3 ms
Iterating global reduction 1 with 351 rules applied. Total rules applied 2201 place count 2702 transition count 2454
Deduced a syphon composed of 1148 places in 3 ms
Applied a total of 2201 rules in 970 ms. Remains 2702 /3053 variables (removed 351) and now considering 2454/2803 (removed 349) transitions.
[2023-03-20 01:56:35] [INFO ] Redundant transitions in 115 ms returned []
// Phase 1: matrix 2454 rows 2702 cols
[2023-03-20 01:56:35] [INFO ] Computed 551 place invariants in 25 ms
[2023-03-20 01:56:37] [INFO ] Dead Transitions using invariants and state equation in 1981 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2702/3053 places, 2454/2803 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3080 ms. Remains : 2702/3053 places, 2454/2803 transitions.
Support contains 4 out of 3053 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3053/3053 places, 2803/2803 transitions.
Applied a total of 0 rules in 204 ms. Remains 3053 /3053 variables (removed 0) and now considering 2803/2803 (removed 0) transitions.
// Phase 1: matrix 2803 rows 3053 cols
[2023-03-20 01:56:37] [INFO ] Computed 551 place invariants in 18 ms
[2023-03-20 01:56:38] [INFO ] Implicit Places using invariants in 1444 ms returned []
[2023-03-20 01:56:38] [INFO ] Invariant cache hit.
[2023-03-20 01:56:40] [INFO ] Implicit Places using invariants and state equation in 1742 ms returned []
Implicit Place search using SMT with State Equation took 3202 ms to find 0 implicit places.
[2023-03-20 01:56:40] [INFO ] Invariant cache hit.
[2023-03-20 01:56:42] [INFO ] Dead Transitions using invariants and state equation in 2153 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5561 ms. Remains : 3053/3053 places, 2803/2803 transitions.
Treatment of property ShieldPPPs-PT-050B-LTLCardinality-11 finished in 121649 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0&&(p1 U G(p2))))))'
Support contains 5 out of 3059 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3059/3059 places, 2809/2809 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 350 transitions
Trivial Post-agglo rules discarded 350 transitions
Performed 350 trivial Post agglomeration. Transition count delta: 350
Iterating post reduction 0 with 350 rules applied. Total rules applied 350 place count 3058 transition count 2458
Reduce places removed 350 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 352 rules applied. Total rules applied 702 place count 2708 transition count 2456
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 704 place count 2706 transition count 2456
Performed 249 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 249 Pre rules applied. Total rules applied 704 place count 2706 transition count 2207
Deduced a syphon composed of 249 places in 5 ms
Reduce places removed 249 places and 0 transitions.
Iterating global reduction 3 with 498 rules applied. Total rules applied 1202 place count 2457 transition count 2207
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 1208 place count 2451 transition count 2201
Iterating global reduction 3 with 6 rules applied. Total rules applied 1214 place count 2451 transition count 2201
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 1214 place count 2451 transition count 2199
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 1218 place count 2449 transition count 2199
Performed 894 Post agglomeration using F-continuation condition.Transition count delta: 894
Deduced a syphon composed of 894 places in 2 ms
Reduce places removed 894 places and 0 transitions.
Iterating global reduction 3 with 1788 rules applied. Total rules applied 3006 place count 1555 transition count 1305
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3008 place count 1553 transition count 1303
Applied a total of 3008 rules in 512 ms. Remains 1553 /3059 variables (removed 1506) and now considering 1303/2809 (removed 1506) transitions.
// Phase 1: matrix 1303 rows 1553 cols
[2023-03-20 01:56:43] [INFO ] Computed 551 place invariants in 6 ms
[2023-03-20 01:56:44] [INFO ] Implicit Places using invariants in 768 ms returned []
[2023-03-20 01:56:44] [INFO ] Invariant cache hit.
[2023-03-20 01:56:46] [INFO ] Implicit Places using invariants and state equation in 2399 ms returned []
Implicit Place search using SMT with State Equation took 3173 ms to find 0 implicit places.
[2023-03-20 01:56:46] [INFO ] Redundant transitions in 43 ms returned []
[2023-03-20 01:56:46] [INFO ] Invariant cache hit.
[2023-03-20 01:56:47] [INFO ] Dead Transitions using invariants and state equation in 676 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1553/3059 places, 1303/2809 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4413 ms. Remains : 1553/3059 places, 1303/2809 transitions.
Stuttering acceptance computed with spot in 132 ms :[(OR (NOT p0) (NOT p2)), (NOT p2), (NOT p2)]
Running random walk in product with property : ShieldPPPs-PT-050B-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(OR (AND p2 p0) (AND p0 p1)), acceptance={0} source=0 dest: 0}, { cond=(OR (AND (NOT p2) (NOT p1)) (NOT p0)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p2 p0 p1), acceptance={1} source=0 dest: 1}, { cond=(AND (NOT p2) p0 p1), acceptance={0, 1} source=0 dest: 1}, { cond=(AND p2 p0 (NOT p1)), acceptance={1} source=0 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0, 1} source=1 dest: 0}, { cond=(AND p2 p1), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={1} source=1 dest: 2}], [{ cond=(AND (NOT p2) p0 p1), acceptance={0} source=2 dest: 0}, { cond=(OR (AND (NOT p2) (NOT p0)) (AND (NOT p2) (NOT p1))), acceptance={0, 1} source=2 dest: 0}, { cond=(AND p2 p0 p1), acceptance={1} source=2 dest: 1}, { cond=(AND (NOT p2) p0 p1), acceptance={0, 1} source=2 dest: 1}, { cond=(AND p2 p0 p1), acceptance={} source=2 dest: 2}, { cond=(OR (AND p2 (NOT p0)) (AND p2 (NOT p1))), acceptance={1} source=2 dest: 2}]], initial=0, aps=[p2:(OR (EQ s512 0) (EQ s672 1)), p0:(EQ s442 1), p1:(OR (EQ s605 0) (EQ s1141 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 29 reset in 1106 ms.
Product exploration explored 100000 steps with 30 reset in 1337 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 (NOT p0) p1), (X (NOT (AND p2 p0 (NOT p1)))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (OR (AND (NOT p2) (NOT p0)) (AND (NOT p2) (NOT p1))))), (X (NOT (OR (AND p2 p0) (AND p0 p1)))), (X (NOT (AND (NOT p2) p0 p1))), (X (OR (AND p2 (NOT p0)) (AND p2 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (AND p2 p1)), (X (OR (AND (NOT p2) (NOT p1)) (NOT p0))), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND p2 p0 p1))), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (OR (AND (NOT p2) (NOT p0)) (AND (NOT p2) (NOT p1)))))), (X (X (NOT (OR (AND p2 p0) (AND p0 p1))))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (OR (AND p2 (NOT p0)) (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND p2 p1))), (X (X (OR (AND (NOT p2) (NOT p1)) (NOT p0)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND p2 p0 p1))))]
False Knowledge obtained : []
Knowledge based reduction with 23 factoid took 1192 ms. Reduced automaton from 3 states, 15 edges and 3 AP (stutter insensitive) to 3 states, 15 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 124 ms :[(OR (NOT p0) (NOT p2)), (NOT p2), (NOT p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 229 ms. (steps per millisecond=43 ) properties (out of 11) seen :10
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-20 01:56:51] [INFO ] Invariant cache hit.
[2023-03-20 01:56:51] [INFO ] After 149ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 01:56:51] [INFO ] [Nat]Absence check using 551 positive place invariants in 93 ms returned sat
[2023-03-20 01:56:52] [INFO ] After 582ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 01:56:52] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
[2023-03-20 01:56:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 164 ms
[2023-03-20 01:56:52] [INFO ] After 794ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 83 ms.
[2023-03-20 01:56:52] [INFO ] After 1161ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 30 ms.
Support contains 5 out of 1553 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1553/1553 places, 1303/1303 transitions.
Partial Free-agglomeration rule applied 296 times.
Drop transitions removed 296 transitions
Iterating global reduction 0 with 296 rules applied. Total rules applied 296 place count 1553 transition count 1303
Applied a total of 296 rules in 95 ms. Remains 1553 /1553 variables (removed 0) and now considering 1303/1303 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 95 ms. Remains : 1553/1553 places, 1303/1303 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 1) seen :0
Finished probabilistic random walk after 34985 steps, run visited all 1 properties in 408 ms. (steps per millisecond=85 )
Probabilistic random walk after 34985 steps, saw 34247 distinct states, run finished after 409 ms. (steps per millisecond=85 ) properties seen :1
Knowledge obtained : [(AND p2 (NOT p0) p1), (X (NOT (AND p2 p0 (NOT p1)))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (OR (AND (NOT p2) (NOT p0)) (AND (NOT p2) (NOT p1))))), (X (NOT (OR (AND p2 p0) (AND p0 p1)))), (X (NOT (AND (NOT p2) p0 p1))), (X (OR (AND p2 (NOT p0)) (AND p2 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (AND p2 p1)), (X (OR (AND (NOT p2) (NOT p1)) (NOT p0))), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND p2 p0 p1))), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (OR (AND (NOT p2) (NOT p0)) (AND (NOT p2) (NOT p1)))))), (X (X (NOT (OR (AND p2 p0) (AND p0 p1))))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (OR (AND p2 (NOT p0)) (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND p2 p1))), (X (X (OR (AND (NOT p2) (NOT p1)) (NOT p0)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND p2 p0 p1))))]
False Knowledge obtained : [(F (AND p0 (NOT p1) p2)), (F (AND p0 p1 (NOT p2))), (F (NOT (AND p1 p2))), (F (AND (NOT p1) (NOT p2))), (F (OR (AND p0 p1) (AND p0 p2))), (F (AND p0 p1 p2)), (F (NOT (OR (NOT p0) (AND (NOT p1) (NOT p2))))), (F (AND (NOT p1) p2)), (F (NOT (OR (AND (NOT p0) p2) (AND (NOT p1) p2)))), (F (AND p1 (NOT p2))), (F (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))))]
Knowledge based reduction with 23 factoid took 1399 ms. Reduced automaton from 3 states, 15 edges and 3 AP (stutter insensitive) to 3 states, 15 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 117 ms :[(OR (NOT p0) (NOT p2)), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 86 ms :[(OR (NOT p0) (NOT p2)), (NOT p2), (NOT p2)]
[2023-03-20 01:56:55] [INFO ] Invariant cache hit.
[2023-03-20 01:56:56] [INFO ] [Real]Absence check using 551 positive place invariants in 438 ms returned sat
[2023-03-20 01:56:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 01:57:02] [INFO ] [Real]Absence check using state equation in 5531 ms returned sat
[2023-03-20 01:57:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 01:57:03] [INFO ] [Nat]Absence check using 551 positive place invariants in 377 ms returned sat
[2023-03-20 01:57:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 01:57:08] [INFO ] [Nat]Absence check using state equation in 4920 ms returned sat
[2023-03-20 01:57:09] [INFO ] Computed and/alt/rep : 1301/2496/1301 causal constraints (skipped 0 transitions) in 77 ms.
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.refineWithCausalOrder(DeadlockTester.java:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:520)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:605)
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: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-20 01:57:17] [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 (NOT p0)
Could not prove EG (NOT p0)
Support contains 5 out of 1553 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1553/1553 places, 1303/1303 transitions.
Applied a total of 0 rules in 93 ms. Remains 1553 /1553 variables (removed 0) and now considering 1303/1303 (removed 0) transitions.
[2023-03-20 01:57:17] [INFO ] Invariant cache hit.
[2023-03-20 01:57:18] [INFO ] Implicit Places using invariants in 776 ms returned []
[2023-03-20 01:57:18] [INFO ] Invariant cache hit.
[2023-03-20 01:57:20] [INFO ] Implicit Places using invariants and state equation in 2140 ms returned []
Implicit Place search using SMT with State Equation took 2918 ms to find 0 implicit places.
[2023-03-20 01:57:20] [INFO ] Redundant transitions in 46 ms returned []
[2023-03-20 01:57:20] [INFO ] Invariant cache hit.
[2023-03-20 01:57:21] [INFO ] Dead Transitions using invariants and state equation in 769 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3837 ms. Remains : 1553/1553 places, 1303/1303 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (OR (NOT p0) (AND (NOT p1) (NOT p2)))), (X (NOT (OR (AND p0 p1) (AND p0 p2)))), (X (AND p1 p2)), (X (NOT (AND (NOT p1) p2))), (X (OR (AND (NOT p0) p2) (AND (NOT p1) p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))))), (X (NOT (AND p0 p1 p2))), (X (NOT (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (OR (NOT p0) (AND (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND p0 p1) (AND p0 p2))))), (X (X (AND p1 p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (OR (AND (NOT p0) p2) (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND p0 (NOT p1) p2))))]
False Knowledge obtained : []
Knowledge based reduction with 23 factoid took 1329 ms. Reduced automaton from 3 states, 15 edges and 3 AP (stutter insensitive) to 3 states, 15 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 107 ms :[(OR (NOT p0) (NOT p2)), (NOT p2), (NOT p2)]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 299 ms. (steps per millisecond=33 ) properties (out of 11) seen :9
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-20 01:57:23] [INFO ] Invariant cache hit.
[2023-03-20 01:57:23] [INFO ] After 199ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 01:57:23] [INFO ] [Nat]Absence check using 551 positive place invariants in 158 ms returned sat
[2023-03-20 01:57:24] [INFO ] After 690ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 01:57:24] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 0 ms to minimize.
[2023-03-20 01:57:24] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 0 ms to minimize.
[2023-03-20 01:57:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 231 ms
[2023-03-20 01:57:24] [INFO ] Deduced a trap composed of 23 places in 117 ms of which 1 ms to minimize.
[2023-03-20 01:57:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 276 ms
[2023-03-20 01:57:25] [INFO ] After 1320ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 196 ms.
[2023-03-20 01:57:25] [INFO ] After 1909ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 86 ms.
Support contains 5 out of 1553 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1553/1553 places, 1303/1303 transitions.
Partial Free-agglomeration rule applied 296 times.
Drop transitions removed 296 transitions
Iterating global reduction 0 with 296 rules applied. Total rules applied 296 place count 1553 transition count 1303
Applied a total of 296 rules in 91 ms. Remains 1553 /1553 variables (removed 0) and now considering 1303/1303 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 91 ms. Remains : 1553/1553 places, 1303/1303 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 152 ms. (steps per millisecond=65 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1303 rows 1553 cols
[2023-03-20 01:57:25] [INFO ] Computed 551 place invariants in 21 ms
[2023-03-20 01:57:25] [INFO ] After 192ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 01:57:26] [INFO ] [Nat]Absence check using 551 positive place invariants in 119 ms returned sat
[2023-03-20 01:57:27] [INFO ] After 908ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 01:57:27] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 0 ms to minimize.
[2023-03-20 01:57:27] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
[2023-03-20 01:57:27] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 1 ms to minimize.
[2023-03-20 01:57:27] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 460 ms
[2023-03-20 01:57:27] [INFO ] After 1400ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 89 ms.
[2023-03-20 01:57:27] [INFO ] After 1834ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 20 ms.
Support contains 5 out of 1553 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1553/1553 places, 1303/1303 transitions.
Applied a total of 0 rules in 53 ms. Remains 1553 /1553 variables (removed 0) and now considering 1303/1303 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 1553/1553 places, 1303/1303 transitions.
Finished random walk after 2751 steps, including 0 resets, run visited all 1 properties in 34 ms. (steps per millisecond=80 )
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (OR (NOT p0) (AND (NOT p1) (NOT p2)))), (X (NOT (OR (AND p0 p1) (AND p0 p2)))), (X (AND p1 p2)), (X (NOT (AND (NOT p1) p2))), (X (OR (AND (NOT p0) p2) (AND (NOT p1) p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))))), (X (NOT (AND p0 p1 p2))), (X (NOT (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (OR (NOT p0) (AND (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND p0 p1) (AND p0 p2))))), (X (X (AND p1 p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (OR (AND (NOT p0) p2) (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND p0 (NOT p1) p2))))]
False Knowledge obtained : [(F (AND p0 (NOT p1) p2)), (F (AND p0 p1 (NOT p2))), (F (NOT (AND p1 p2))), (F (AND (NOT p1) (NOT p2))), (F (OR (AND p0 p1) (AND p0 p2))), (F (AND p0 p1 p2)), (F (NOT (OR (NOT p0) (AND (NOT p1) (NOT p2))))), (F (AND (NOT p1) p2)), (F (NOT (OR (AND (NOT p0) p2) (AND (NOT p1) p2)))), (F (AND p1 (NOT p2))), (F (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))))]
Knowledge based reduction with 23 factoid took 1686 ms. Reduced automaton from 3 states, 15 edges and 3 AP (stutter insensitive) to 3 states, 15 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 209 ms :[(OR (NOT p0) (NOT p2)), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 214 ms :[(OR (NOT p0) (NOT p2)), (NOT p2), (NOT p2)]
// Phase 1: matrix 1303 rows 1553 cols
[2023-03-20 01:57:29] [INFO ] Computed 551 place invariants in 9 ms
[2023-03-20 01:57:31] [INFO ] [Real]Absence check using 551 positive place invariants in 490 ms returned sat
[2023-03-20 01:57:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 01:57:36] [INFO ] [Real]Absence check using state equation in 4574 ms returned sat
[2023-03-20 01:57:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 01:57:37] [INFO ] [Nat]Absence check using 551 positive place invariants in 420 ms returned sat
[2023-03-20 01:57:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 01:57:41] [INFO ] [Nat]Absence check using state equation in 3620 ms returned sat
[2023-03-20 01:57:41] [INFO ] Computed and/alt/rep : 1301/2496/1301 causal constraints (skipped 0 transitions) in 57 ms.
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.refineWithCausalOrder(DeadlockTester.java:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:520)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:605)
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-20 01:57:51] [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 (NOT p0)
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 229 ms :[(OR (NOT p0) (NOT p2)), (NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 29 reset in 1048 ms.
Product exploration explored 100000 steps with 29 reset in 1262 ms.
Support contains 5 out of 1553 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1553/1553 places, 1303/1303 transitions.
Applied a total of 0 rules in 40 ms. Remains 1553 /1553 variables (removed 0) and now considering 1303/1303 (removed 0) transitions.
[2023-03-20 01:57:54] [INFO ] Invariant cache hit.
[2023-03-20 01:57:54] [INFO ] Implicit Places using invariants in 794 ms returned []
[2023-03-20 01:57:54] [INFO ] Invariant cache hit.
[2023-03-20 01:57:57] [INFO ] Implicit Places using invariants and state equation in 2816 ms returned []
Implicit Place search using SMT with State Equation took 3613 ms to find 0 implicit places.
[2023-03-20 01:57:57] [INFO ] Redundant transitions in 17 ms returned []
[2023-03-20 01:57:57] [INFO ] Invariant cache hit.
[2023-03-20 01:57:58] [INFO ] Dead Transitions using invariants and state equation in 686 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4366 ms. Remains : 1553/1553 places, 1303/1303 transitions.
Treatment of property ShieldPPPs-PT-050B-LTLCardinality-15 finished in 75660 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(F(p0))))'
Found a Shortening insensitive property : ShieldPPPs-PT-050B-LTLCardinality-05
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 3059 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 3059/3059 places, 2809/2809 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 352 transitions
Trivial Post-agglo rules discarded 352 transitions
Performed 352 trivial Post agglomeration. Transition count delta: 352
Iterating post reduction 0 with 352 rules applied. Total rules applied 352 place count 3058 transition count 2456
Reduce places removed 352 places and 0 transitions.
Iterating post reduction 1 with 352 rules applied. Total rules applied 704 place count 2706 transition count 2456
Performed 250 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 250 Pre rules applied. Total rules applied 704 place count 2706 transition count 2206
Deduced a syphon composed of 250 places in 7 ms
Reduce places removed 250 places and 0 transitions.
Iterating global reduction 2 with 500 rules applied. Total rules applied 1204 place count 2456 transition count 2206
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 1211 place count 2449 transition count 2199
Iterating global reduction 2 with 7 rules applied. Total rules applied 1218 place count 2449 transition count 2199
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 1218 place count 2449 transition count 2197
Deduced a syphon composed of 2 places in 13 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 1222 place count 2447 transition count 2197
Performed 894 Post agglomeration using F-continuation condition.Transition count delta: 894
Deduced a syphon composed of 894 places in 2 ms
Reduce places removed 894 places and 0 transitions.
Iterating global reduction 2 with 1788 rules applied. Total rules applied 3010 place count 1553 transition count 1303
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 3012 place count 1551 transition count 1301
Applied a total of 3012 rules in 573 ms. Remains 1551 /3059 variables (removed 1508) and now considering 1301/2809 (removed 1508) transitions.
// Phase 1: matrix 1301 rows 1551 cols
[2023-03-20 01:57:59] [INFO ] Computed 551 place invariants in 5 ms
[2023-03-20 01:58:00] [INFO ] Implicit Places using invariants in 858 ms returned []
[2023-03-20 01:58:00] [INFO ] Invariant cache hit.
[2023-03-20 01:58:02] [INFO ] Implicit Places using invariants and state equation in 1956 ms returned []
Implicit Place search using SMT with State Equation took 2817 ms to find 0 implicit places.
[2023-03-20 01:58:02] [INFO ] Invariant cache hit.
[2023-03-20 01:58:02] [INFO ] Dead Transitions using invariants and state equation in 744 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 1551/3059 places, 1301/2809 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 4135 ms. Remains : 1551/3059 places, 1301/2809 transitions.
Running random walk in product with property : ShieldPPPs-PT-050B-LTLCardinality-05 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}]], initial=2, aps=[p0:(AND (EQ s865 0) (EQ s987 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 103 reset in 889 ms.
Product exploration explored 100000 steps with 103 reset in 1105 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 155 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 190 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 1045 steps, including 0 resets, run visited all 1 properties in 12 ms. (steps per millisecond=87 )
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 182 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 171 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 187 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2023-03-20 01:58:05] [INFO ] Invariant cache hit.
[2023-03-20 01:58:07] [INFO ] [Real]Absence check using 551 positive place invariants in 377 ms returned sat
[2023-03-20 01:58:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 01:58:11] [INFO ] [Real]Absence check using state equation in 4618 ms returned sat
[2023-03-20 01:58:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 01:58:13] [INFO ] [Nat]Absence check using 551 positive place invariants in 392 ms returned sat
[2023-03-20 01:58:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 01:58:18] [INFO ] [Nat]Absence check using state equation in 4611 ms returned sat
[2023-03-20 01:58:18] [INFO ] Computed and/alt/rep : 1299/2494/1299 causal constraints (skipped 0 transitions) in 98 ms.
[2023-03-20 01:58:26] [INFO ] Added : 320 causal constraints over 64 iterations in 8849 ms. Result :unknown
Could not prove EG (NOT p0)
Support contains 2 out of 1551 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1551/1551 places, 1301/1301 transitions.
Applied a total of 0 rules in 33 ms. Remains 1551 /1551 variables (removed 0) and now considering 1301/1301 (removed 0) transitions.
[2023-03-20 01:58:26] [INFO ] Invariant cache hit.
[2023-03-20 01:58:27] [INFO ] Implicit Places using invariants in 783 ms returned []
[2023-03-20 01:58:27] [INFO ] Invariant cache hit.
[2023-03-20 01:58:29] [INFO ] Implicit Places using invariants and state equation in 1726 ms returned []
Implicit Place search using SMT with State Equation took 2514 ms to find 0 implicit places.
[2023-03-20 01:58:29] [INFO ] Invariant cache hit.
[2023-03-20 01:58:30] [INFO ] Dead Transitions using invariants and state equation in 810 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3357 ms. Remains : 1551/1551 places, 1301/1301 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 67 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 123 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 790 steps, including 0 resets, run visited all 1 properties in 10 ms. (steps per millisecond=79 )
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 131 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 142 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 131 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2023-03-20 01:58:30] [INFO ] Invariant cache hit.
[2023-03-20 01:58:32] [INFO ] [Real]Absence check using 551 positive place invariants in 406 ms returned sat
[2023-03-20 01:58:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 01:58:37] [INFO ] [Real]Absence check using state equation in 4693 ms returned sat
[2023-03-20 01:58:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 01:58:38] [INFO ] [Nat]Absence check using 551 positive place invariants in 377 ms returned sat
[2023-03-20 01:58:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 01:58:43] [INFO ] [Nat]Absence check using state equation in 4612 ms returned sat
[2023-03-20 01:58:43] [INFO ] Computed and/alt/rep : 1299/2494/1299 causal constraints (skipped 0 transitions) in 68 ms.
[2023-03-20 01:58:53] [INFO ] Deduced a trap composed of 2 places in 692 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.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:520)
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.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:764)
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-20 01:58:53] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p0)
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 171 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 102 reset in 908 ms.
Product exploration explored 100000 steps with 104 reset in 1081 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 1551 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1551/1551 places, 1301/1301 transitions.
Applied a total of 0 rules in 47 ms. Remains 1551 /1551 variables (removed 0) and now considering 1301/1301 (removed 0) transitions.
[2023-03-20 01:58:55] [INFO ] Redundant transitions in 23 ms returned []
[2023-03-20 01:58:55] [INFO ] Invariant cache hit.
[2023-03-20 01:58:56] [INFO ] Dead Transitions using invariants and state equation in 697 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 775 ms. Remains : 1551/1551 places, 1301/1301 transitions.
Support contains 2 out of 1551 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1551/1551 places, 1301/1301 transitions.
Applied a total of 0 rules in 33 ms. Remains 1551 /1551 variables (removed 0) and now considering 1301/1301 (removed 0) transitions.
[2023-03-20 01:58:56] [INFO ] Invariant cache hit.
[2023-03-20 01:58:56] [INFO ] Implicit Places using invariants in 704 ms returned []
[2023-03-20 01:58:56] [INFO ] Invariant cache hit.
[2023-03-20 01:58:58] [INFO ] Implicit Places using invariants and state equation in 1903 ms returned []
Implicit Place search using SMT with State Equation took 2616 ms to find 0 implicit places.
[2023-03-20 01:58:58] [INFO ] Invariant cache hit.
[2023-03-20 01:58:59] [INFO ] Dead Transitions using invariants and state equation in 710 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3361 ms. Remains : 1551/1551 places, 1301/1301 transitions.
Treatment of property ShieldPPPs-PT-050B-LTLCardinality-05 finished in 61125 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((F(p0)&&(F(p2)||p1)))))'
Found a Lengthening insensitive property : ShieldPPPs-PT-050B-LTLCardinality-11
Stuttering acceptance computed with spot in 172 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2)]
Support contains 4 out of 3059 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 3059/3059 places, 2809/2809 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 351 transitions
Trivial Post-agglo rules discarded 351 transitions
Performed 351 trivial Post agglomeration. Transition count delta: 351
Iterating post reduction 0 with 351 rules applied. Total rules applied 351 place count 3058 transition count 2457
Reduce places removed 351 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 352 rules applied. Total rules applied 703 place count 2707 transition count 2456
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 704 place count 2706 transition count 2456
Performed 250 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 250 Pre rules applied. Total rules applied 704 place count 2706 transition count 2206
Deduced a syphon composed of 250 places in 7 ms
Reduce places removed 250 places and 0 transitions.
Iterating global reduction 3 with 500 rules applied. Total rules applied 1204 place count 2456 transition count 2206
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 1210 place count 2450 transition count 2200
Iterating global reduction 3 with 6 rules applied. Total rules applied 1216 place count 2450 transition count 2200
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 1216 place count 2450 transition count 2199
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1218 place count 2449 transition count 2199
Performed 894 Post agglomeration using F-continuation condition.Transition count delta: 894
Deduced a syphon composed of 894 places in 2 ms
Reduce places removed 894 places and 0 transitions.
Iterating global reduction 3 with 1788 rules applied. Total rules applied 3006 place count 1555 transition count 1305
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3008 place count 1553 transition count 1303
Applied a total of 3008 rules in 560 ms. Remains 1553 /3059 variables (removed 1506) and now considering 1303/2809 (removed 1506) transitions.
// Phase 1: matrix 1303 rows 1553 cols
[2023-03-20 01:59:00] [INFO ] Computed 551 place invariants in 6 ms
[2023-03-20 01:59:01] [INFO ] Implicit Places using invariants in 803 ms returned []
[2023-03-20 01:59:01] [INFO ] Invariant cache hit.
[2023-03-20 01:59:03] [INFO ] Implicit Places using invariants and state equation in 1910 ms returned []
Implicit Place search using SMT with State Equation took 2715 ms to find 0 implicit places.
[2023-03-20 01:59:03] [INFO ] Invariant cache hit.
[2023-03-20 01:59:03] [INFO ] Dead Transitions using invariants and state equation in 829 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 1553/3059 places, 1303/2809 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 4104 ms. Remains : 1553/3059 places, 1303/2809 transitions.
Running random walk in product with property : ShieldPPPs-PT-050B-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s577 0) (EQ s704 1)), p1:(OR (EQ s704 0) (EQ s577 1)), p2:(OR (EQ s1283 0) (EQ s1523 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 87249 steps with 49 reset in 860 ms.
Treatment of property ShieldPPPs-PT-050B-LTLCardinality-11 finished in 5240 ms.
FORMULA ShieldPPPs-PT-050B-LTLCardinality-11 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0&&(p1 U G(p2))))))'
[2023-03-20 01:59:05] [INFO ] Flatten gal took : 87 ms
[2023-03-20 01:59:05] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2023-03-20 01:59:05] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 3059 places, 2809 transitions and 8018 arcs took 13 ms.
Total runtime 425849 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT ShieldPPPs-PT-050B
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/369
LTLCardinality

FORMULA ShieldPPPs-PT-050B-LTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPs-PT-050B-LTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1679277622010

--------------------
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/369/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/369/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/369/LTLCardinality.xml
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 7 (type EXCL) for 6 ShieldPPPs-PT-050B-LTLCardinality-15
lola: time limit : 1199 sec
lola: memory limit: 32 pages
lola: FINISHED task # 7 (type EXCL) for ShieldPPPs-PT-050B-LTLCardinality-15
lola: result : false
lola: markings : 4282
lola: fired transitions : 4283
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 1 (type EXCL) for 0 ShieldPPPs-PT-050B-LTLCardinality-05
lola: time limit : 1799 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPs-PT-050B-LTLCardinality-15: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-050B-LTLCardinality-05: LTL 0 0 1 0 1 0 0 0
ShieldPPPs-PT-050B-LTLCardinality-11: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 4/1799 3/32 ShieldPPPs-PT-050B-LTLCardinality-05 84758 m, 16951 m/sec, 288595 t fired, .

Time elapsed: 6 secs. Pages in use: 3
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPs-PT-050B-LTLCardinality-15: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-050B-LTLCardinality-05: LTL 0 0 1 0 1 0 0 0
ShieldPPPs-PT-050B-LTLCardinality-11: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 9/1799 6/32 ShieldPPPs-PT-050B-LTLCardinality-05 188981 m, 20844 m/sec, 663110 t fired, .

Time elapsed: 11 secs. Pages in use: 6
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPs-PT-050B-LTLCardinality-15: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-050B-LTLCardinality-05: LTL 0 0 1 0 1 0 0 0
ShieldPPPs-PT-050B-LTLCardinality-11: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 14/1799 8/32 ShieldPPPs-PT-050B-LTLCardinality-05 278358 m, 17875 m/sec, 1037246 t fired, .

Time elapsed: 16 secs. Pages in use: 8
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPs-PT-050B-LTLCardinality-15: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-050B-LTLCardinality-05: LTL 0 0 1 0 1 0 0 0
ShieldPPPs-PT-050B-LTLCardinality-11: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 19/1799 10/32 ShieldPPPs-PT-050B-LTLCardinality-05 374147 m, 19157 m/sec, 1408056 t fired, .

Time elapsed: 21 secs. Pages in use: 10
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPs-PT-050B-LTLCardinality-15: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-050B-LTLCardinality-05: LTL 0 0 1 0 1 0 0 0
ShieldPPPs-PT-050B-LTLCardinality-11: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 24/1799 13/32 ShieldPPPs-PT-050B-LTLCardinality-05 462560 m, 17682 m/sec, 1778362 t fired, .

Time elapsed: 26 secs. Pages in use: 13
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPs-PT-050B-LTLCardinality-15: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-050B-LTLCardinality-05: LTL 0 0 1 0 1 0 0 0
ShieldPPPs-PT-050B-LTLCardinality-11: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 29/1799 15/32 ShieldPPPs-PT-050B-LTLCardinality-05 555524 m, 18592 m/sec, 2146359 t fired, .

Time elapsed: 31 secs. Pages in use: 15
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPs-PT-050B-LTLCardinality-15: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-050B-LTLCardinality-05: LTL 0 0 1 0 1 0 0 0
ShieldPPPs-PT-050B-LTLCardinality-11: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 34/1799 17/32 ShieldPPPs-PT-050B-LTLCardinality-05 644548 m, 17804 m/sec, 2512256 t fired, .

Time elapsed: 36 secs. Pages in use: 17
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPs-PT-050B-LTLCardinality-15: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-050B-LTLCardinality-05: LTL 0 0 1 0 1 0 0 0
ShieldPPPs-PT-050B-LTLCardinality-11: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 39/1799 19/32 ShieldPPPs-PT-050B-LTLCardinality-05 736768 m, 18444 m/sec, 2881191 t fired, .

Time elapsed: 41 secs. Pages in use: 19
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPs-PT-050B-LTLCardinality-15: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-050B-LTLCardinality-05: LTL 0 0 1 0 1 0 0 0
ShieldPPPs-PT-050B-LTLCardinality-11: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 44/1799 21/32 ShieldPPPs-PT-050B-LTLCardinality-05 828442 m, 18334 m/sec, 3252480 t fired, .

Time elapsed: 46 secs. Pages in use: 21
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPs-PT-050B-LTLCardinality-15: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-050B-LTLCardinality-05: LTL 0 0 1 0 1 0 0 0
ShieldPPPs-PT-050B-LTLCardinality-11: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 49/1799 23/32 ShieldPPPs-PT-050B-LTLCardinality-05 908274 m, 15966 m/sec, 3621318 t fired, .

Time elapsed: 51 secs. Pages in use: 23
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPs-PT-050B-LTLCardinality-15: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-050B-LTLCardinality-05: LTL 0 0 1 0 1 0 0 0
ShieldPPPs-PT-050B-LTLCardinality-11: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 54/1799 25/32 ShieldPPPs-PT-050B-LTLCardinality-05 990990 m, 16543 m/sec, 3990588 t fired, .

Time elapsed: 56 secs. Pages in use: 25
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPs-PT-050B-LTLCardinality-15: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-050B-LTLCardinality-05: LTL 0 0 1 0 1 0 0 0
ShieldPPPs-PT-050B-LTLCardinality-11: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 59/1799 27/32 ShieldPPPs-PT-050B-LTLCardinality-05 1070309 m, 15863 m/sec, 4356364 t fired, .

Time elapsed: 61 secs. Pages in use: 27
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPs-PT-050B-LTLCardinality-15: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-050B-LTLCardinality-05: LTL 0 0 1 0 1 0 0 0
ShieldPPPs-PT-050B-LTLCardinality-11: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 64/1799 29/32 ShieldPPPs-PT-050B-LTLCardinality-05 1151789 m, 16296 m/sec, 4721740 t fired, .

Time elapsed: 66 secs. Pages in use: 29
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPs-PT-050B-LTLCardinality-15: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-050B-LTLCardinality-05: LTL 0 0 1 0 1 0 0 0
ShieldPPPs-PT-050B-LTLCardinality-11: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 69/1799 31/32 ShieldPPPs-PT-050B-LTLCardinality-05 1231382 m, 15918 m/sec, 5086086 t fired, .

Time elapsed: 71 secs. Pages in use: 31
# running tasks: 1 of 4 Visible: 3
lola: CANCELED task # 1 (type EXCL) for ShieldPPPs-PT-050B-LTLCardinality-05 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPs-PT-050B-LTLCardinality-15: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-050B-LTLCardinality-05: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-050B-LTLCardinality-11: LTL 0 1 0 0 1 0 0 0

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

Time elapsed: 76 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: LAUNCH task # 4 (type EXCL) for 3 ShieldPPPs-PT-050B-LTLCardinality-11
lola: time limit : 3524 sec
lola: memory limit: 32 pages
lola: FINISHED task # 4 (type EXCL) for ShieldPPPs-PT-050B-LTLCardinality-11
lola: result : false
lola: markings : 6704
lola: fired transitions : 6704
lola: time used : 0.000000
lola: memory pages used : 1
lola: Portfolio finished: no open tasks 3

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPs-PT-050B-LTLCardinality-05: LTL unknown AGGR
ShieldPPPs-PT-050B-LTLCardinality-11: LTL false LTL model checker
ShieldPPPs-PT-050B-LTLCardinality-15: LTL false LTL model checker


Time elapsed: 76 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="ShieldPPPs-PT-050B"
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 ShieldPPPs-PT-050B, 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-167903715400507"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPs-PT-050B.tgz
mv ShieldPPPs-PT-050B 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 ;