Execution Chart

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

Trace from the execution

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

--------------------
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 1679456340611

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPs-PT-050B
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-22 03:39:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-22 03:39:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 03:39:03] [INFO ] Load time of PNML (sax parser for PT used): 167 ms
[2023-03-22 03:39:03] [INFO ] Transformed 3403 places.
[2023-03-22 03:39:03] [INFO ] Transformed 3153 transitions.
[2023-03-22 03:39:03] [INFO ] Found NUPN structural information;
[2023-03-22 03:39:03] [INFO ] Parsed PT model containing 3403 places and 3153 transitions and 8706 arcs in 476 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 1036 ms. Remains 3059 /3403 variables (removed 344) and now considering 2809/3153 (removed 344) transitions.
// Phase 1: matrix 2809 rows 3059 cols
[2023-03-22 03:39:05] [INFO ] Computed 551 place invariants in 35 ms
[2023-03-22 03:39:06] [INFO ] Implicit Places using invariants in 1604 ms returned []
[2023-03-22 03:39:06] [INFO ] Invariant cache hit.
[2023-03-22 03:39:11] [INFO ] Implicit Places using invariants and state equation in 5372 ms returned []
Implicit Place search using SMT with State Equation took 7038 ms to find 0 implicit places.
[2023-03-22 03:39:12] [INFO ] Invariant cache hit.
[2023-03-22 03:39:14] [INFO ] Dead Transitions using invariants and state equation in 2477 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 10553 ms. Remains : 3059/3403 places, 2809/3153 transitions.
Support contains 28 out of 3059 places after structural reductions.
[2023-03-22 03:39:14] [INFO ] Flatten gal took : 188 ms
[2023-03-22 03:39:14] [INFO ] Flatten gal took : 114 ms
[2023-03-22 03:39:15] [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 505 ms. (steps per millisecond=19 ) properties (out of 17) seen :9
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 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 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 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 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 19 ms. (steps per millisecond=526 ) 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 24 ms. (steps per millisecond=416 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2023-03-22 03:39:15] [INFO ] Invariant cache hit.
[2023-03-22 03:39:16] [INFO ] After 838ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-22 03:39:18] [INFO ] [Nat]Absence check using 551 positive place invariants in 735 ms returned sat
[2023-03-22 03:39:21] [INFO ] After 3316ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-22 03:39:27] [INFO ] Deduced a trap composed of 19 places in 5208 ms of which 38 ms to minimize.
[2023-03-22 03:39:28] [INFO ] Deduced a trap composed of 24 places in 1127 ms of which 2 ms to minimize.
[2023-03-22 03:39:29] [INFO ] Deduced a trap composed of 25 places in 1172 ms of which 2 ms to minimize.
[2023-03-22 03:39:31] [INFO ] Deduced a trap composed of 24 places in 1238 ms of which 2 ms to minimize.
[2023-03-22 03:39:32] [INFO ] Deduced a trap composed of 18 places in 1002 ms of which 2 ms to minimize.
[2023-03-22 03:39:33] [INFO ] Deduced a trap composed of 21 places in 815 ms of which 1 ms to minimize.
[2023-03-22 03:39:33] [INFO ] Deduced a trap composed of 24 places in 699 ms of which 2 ms to minimize.
[2023-03-22 03:39:34] [INFO ] Deduced a trap composed of 25 places in 829 ms of which 2 ms to minimize.
[2023-03-22 03:39:35] [INFO ] Deduced a trap composed of 21 places in 765 ms of which 1 ms to minimize.
[2023-03-22 03:39:36] [INFO ] Deduced a trap composed of 25 places in 1017 ms of which 15 ms to minimize.
[2023-03-22 03:39:37] [INFO ] Deduced a trap composed of 32 places in 803 ms of which 1 ms to minimize.
[2023-03-22 03:39:38] [INFO ] Deduced a trap composed of 26 places in 696 ms of which 1 ms to minimize.
[2023-03-22 03:39:39] [INFO ] Deduced a trap composed of 25 places in 696 ms of which 2 ms to minimize.
[2023-03-22 03:39:40] [INFO ] Deduced a trap composed of 18 places in 801 ms of which 2 ms to minimize.
[2023-03-22 03:39:41] [INFO ] Deduced a trap composed of 10 places in 735 ms of which 3 ms to minimize.
[2023-03-22 03:39:41] [INFO ] Deduced a trap composed of 33 places in 870 ms of which 2 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-22 03:39:41] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 03:39:41] [INFO ] After 25188ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:8
Parikh walk visited 0 properties in 1060 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 827 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 827 ms. Remains : 1562/3059 places, 1312/2809 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 243 ms. (steps per millisecond=41 ) properties (out of 8) seen :7
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
Running SMT prover for 1 properties.
// Phase 1: matrix 1312 rows 1562 cols
[2023-03-22 03:39:44] [INFO ] Computed 551 place invariants in 58 ms
[2023-03-22 03:39:44] [INFO ] After 178ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 03:39:44] [INFO ] [Nat]Absence check using 524 positive place invariants in 99 ms returned sat
[2023-03-22 03:39:44] [INFO ] [Nat]Absence check using 524 positive and 27 generalized place invariants in 6 ms returned sat
[2023-03-22 03:39:45] [INFO ] After 749ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 03:39:45] [INFO ] Deduced a trap composed of 4 places in 238 ms of which 2 ms to minimize.
[2023-03-22 03:39:45] [INFO ] Deduced a trap composed of 7 places in 113 ms of which 1 ms to minimize.
[2023-03-22 03:39:46] [INFO ] Deduced a trap composed of 8 places in 194 ms of which 0 ms to minimize.
[2023-03-22 03:39:46] [INFO ] Deduced a trap composed of 5 places in 159 ms of which 1 ms to minimize.
[2023-03-22 03:39:46] [INFO ] Deduced a trap composed of 5 places in 97 ms of which 0 ms to minimize.
[2023-03-22 03:39:46] [INFO ] Deduced a trap composed of 7 places in 140 ms of which 3 ms to minimize.
[2023-03-22 03:39:46] [INFO ] Deduced a trap composed of 10 places in 102 ms of which 1 ms to minimize.
[2023-03-22 03:39:47] [INFO ] Deduced a trap composed of 7 places in 93 ms of which 1 ms to minimize.
[2023-03-22 03:39:47] [INFO ] Deduced a trap composed of 12 places in 146 ms of which 0 ms to minimize.
[2023-03-22 03:39:47] [INFO ] Deduced a trap composed of 7 places in 216 ms of which 0 ms to minimize.
[2023-03-22 03:39:47] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2107 ms
[2023-03-22 03:39:47] [INFO ] After 2924ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 68 ms.
[2023-03-22 03:39:47] [INFO ] After 3329ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 1212 steps, including 5 resets, run visited all 1 properties in 13 ms. (steps per millisecond=93 )
Parikh walk visited 1 properties in 12 ms.
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 422 ms. Remains 3053 /3059 variables (removed 6) and now considering 2803/2809 (removed 6) transitions.
// Phase 1: matrix 2803 rows 3053 cols
[2023-03-22 03:39:48] [INFO ] Computed 551 place invariants in 19 ms
[2023-03-22 03:39:50] [INFO ] Implicit Places using invariants in 1870 ms returned []
[2023-03-22 03:39:50] [INFO ] Invariant cache hit.
[2023-03-22 03:39:55] [INFO ] Implicit Places using invariants and state equation in 5185 ms returned []
Implicit Place search using SMT with State Equation took 7058 ms to find 0 implicit places.
[2023-03-22 03:39:55] [INFO ] Invariant cache hit.
[2023-03-22 03:39:58] [INFO ] Dead Transitions using invariants and state equation in 3122 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 10623 ms. Remains : 3053/3059 places, 2803/2809 transitions.
Stuttering acceptance computed with spot in 569 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 8180 steps with 1 reset in 163 ms.
FORMULA ShieldPPPs-PT-050B-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-050B-LTLCardinality-02 finished in 11440 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 461 ms. Remains 3054 /3059 variables (removed 5) and now considering 2804/2809 (removed 5) transitions.
// Phase 1: matrix 2804 rows 3054 cols
[2023-03-22 03:40:00] [INFO ] Computed 551 place invariants in 27 ms
[2023-03-22 03:40:01] [INFO ] Implicit Places using invariants in 1554 ms returned []
[2023-03-22 03:40:01] [INFO ] Invariant cache hit.
[2023-03-22 03:40:05] [INFO ] Implicit Places using invariants and state equation in 3822 ms returned []
Implicit Place search using SMT with State Equation took 5384 ms to find 0 implicit places.
[2023-03-22 03:40:05] [INFO ] Invariant cache hit.
[2023-03-22 03:40:07] [INFO ] Dead Transitions using invariants and state equation in 2499 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 8373 ms. Remains : 3054/3059 places, 2804/2809 transitions.
Stuttering acceptance computed with spot in 340 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 2 steps with 0 reset in 0 ms.
FORMULA ShieldPPPs-PT-050B-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-050B-LTLCardinality-04 finished in 8756 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 533 ms. Remains 3052 /3059 variables (removed 7) and now considering 2802/2809 (removed 7) transitions.
// Phase 1: matrix 2802 rows 3052 cols
[2023-03-22 03:40:08] [INFO ] Computed 551 place invariants in 8 ms
[2023-03-22 03:40:10] [INFO ] Implicit Places using invariants in 1563 ms returned []
[2023-03-22 03:40:10] [INFO ] Invariant cache hit.
[2023-03-22 03:40:14] [INFO ] Implicit Places using invariants and state equation in 3782 ms returned []
Implicit Place search using SMT with State Equation took 5358 ms to find 0 implicit places.
[2023-03-22 03:40:14] [INFO ] Invariant cache hit.
[2023-03-22 03:40:16] [INFO ] Dead Transitions using invariants and state equation in 2550 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 8456 ms. Remains : 3052/3059 places, 2802/2809 transitions.
Stuttering acceptance computed with spot in 161 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 1101 ms.
Product exploration explored 100000 steps with 36 reset in 1176 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 145 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 326 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 3058 steps, including 0 resets, run visited all 1 properties in 48 ms. (steps per millisecond=63 )
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 147 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 198 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 154 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2023-03-22 03:40:20] [INFO ] Invariant cache hit.
[2023-03-22 03:40:24] [INFO ] [Real]Absence check using 551 positive place invariants in 1298 ms returned sat
[2023-03-22 03:40:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 03:40:35] [INFO ] [Real]Absence check using state equation in 11044 ms returned unknown
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 310 ms. Remains 3052 /3052 variables (removed 0) and now considering 2802/2802 (removed 0) transitions.
[2023-03-22 03:40:35] [INFO ] Invariant cache hit.
[2023-03-22 03:40:37] [INFO ] Implicit Places using invariants in 1650 ms returned []
[2023-03-22 03:40:37] [INFO ] Invariant cache hit.
[2023-03-22 03:40:42] [INFO ] Implicit Places using invariants and state equation in 5018 ms returned []
Implicit Place search using SMT with State Equation took 6688 ms to find 0 implicit places.
[2023-03-22 03:40:42] [INFO ] Invariant cache hit.
[2023-03-22 03:40:44] [INFO ] Dead Transitions using invariants and state equation in 2508 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9507 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 115 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 106 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 2293 steps, including 0 resets, run visited all 1 properties in 34 ms. (steps per millisecond=67 )
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 110 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 166 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 148 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2023-03-22 03:40:45] [INFO ] Invariant cache hit.
[2023-03-22 03:40:50] [INFO ] [Real]Absence check using 551 positive place invariants in 1422 ms returned sat
[2023-03-22 03:40:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 03:41:00] [INFO ] [Real]Absence check using state equation in 10803 ms returned unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 199 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 35 reset in 938 ms.
Product exploration explored 100000 steps with 36 reset in 1107 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 164 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 3 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 1432 ms. Remains 2700 /3052 variables (removed 352) and now considering 2451/2802 (removed 351) transitions.
[2023-03-22 03:41:05] [INFO ] Redundant transitions in 195 ms returned []
// Phase 1: matrix 2451 rows 2700 cols
[2023-03-22 03:41:05] [INFO ] Computed 551 place invariants in 26 ms
[2023-03-22 03:41:06] [INFO ] Dead Transitions using invariants and state equation in 1822 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 3473 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 229 ms. Remains 3052 /3052 variables (removed 0) and now considering 2802/2802 (removed 0) transitions.
// Phase 1: matrix 2802 rows 3052 cols
[2023-03-22 03:41:07] [INFO ] Computed 551 place invariants in 8 ms
[2023-03-22 03:41:08] [INFO ] Implicit Places using invariants in 1449 ms returned []
[2023-03-22 03:41:08] [INFO ] Invariant cache hit.
[2023-03-22 03:41:13] [INFO ] Implicit Places using invariants and state equation in 4465 ms returned []
Implicit Place search using SMT with State Equation took 5930 ms to find 0 implicit places.
[2023-03-22 03:41:13] [INFO ] Invariant cache hit.
[2023-03-22 03:41:15] [INFO ] Dead Transitions using invariants and state equation in 2247 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8406 ms. Remains : 3052/3052 places, 2802/2802 transitions.
Treatment of property ShieldPPPs-PT-050B-LTLCardinality-05 finished in 67240 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 432 ms. Remains 3053 /3059 variables (removed 6) and now considering 2803/2809 (removed 6) transitions.
// Phase 1: matrix 2803 rows 3053 cols
[2023-03-22 03:41:16] [INFO ] Computed 551 place invariants in 20 ms
[2023-03-22 03:41:17] [INFO ] Implicit Places using invariants in 1470 ms returned []
[2023-03-22 03:41:17] [INFO ] Invariant cache hit.
[2023-03-22 03:41:22] [INFO ] Implicit Places using invariants and state equation in 5043 ms returned []
Implicit Place search using SMT with State Equation took 6542 ms to find 0 implicit places.
[2023-03-22 03:41:22] [INFO ] Invariant cache hit.
[2023-03-22 03:41:24] [INFO ] Dead Transitions using invariants and state equation in 2346 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 9321 ms. Remains : 3053/3059 places, 2803/2809 transitions.
Stuttering acceptance computed with spot in 99 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 9455 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 485 ms. Remains 3052 /3059 variables (removed 7) and now considering 2802/2809 (removed 7) transitions.
// Phase 1: matrix 2802 rows 3052 cols
[2023-03-22 03:41:25] [INFO ] Computed 551 place invariants in 16 ms
[2023-03-22 03:41:26] [INFO ] Implicit Places using invariants in 1302 ms returned []
[2023-03-22 03:41:26] [INFO ] Invariant cache hit.
[2023-03-22 03:41:31] [INFO ] Implicit Places using invariants and state equation in 4567 ms returned []
Implicit Place search using SMT with State Equation took 5880 ms to find 0 implicit places.
[2023-03-22 03:41:31] [INFO ] Invariant cache hit.
[2023-03-22 03:41:34] [INFO ] Dead Transitions using invariants and state equation in 2613 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 9007 ms. Remains : 3052/3059 places, 2802/2809 transitions.
Stuttering acceptance computed with spot in 189 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 2290 ms.
Product exploration explored 100000 steps with 50000 reset in 2219 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 180 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 13987 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 415 ms. Remains 3053 /3059 variables (removed 6) and now considering 2803/2809 (removed 6) transitions.
// Phase 1: matrix 2803 rows 3053 cols
[2023-03-22 03:41:39] [INFO ] Computed 551 place invariants in 35 ms
[2023-03-22 03:41:40] [INFO ] Implicit Places using invariants in 1545 ms returned []
[2023-03-22 03:41:41] [INFO ] Invariant cache hit.
[2023-03-22 03:41:44] [INFO ] Implicit Places using invariants and state equation in 3363 ms returned []
Implicit Place search using SMT with State Equation took 4910 ms to find 0 implicit places.
[2023-03-22 03:41:44] [INFO ] Invariant cache hit.
[2023-03-22 03:41:46] [INFO ] Dead Transitions using invariants and state equation in 2346 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 7693 ms. Remains : 3053/3059 places, 2803/2809 transitions.
Stuttering acceptance computed with spot in 202 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 967 ms.
Product exploration explored 100000 steps with 23 reset in 1118 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 421 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 231 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 204 ms. (steps per millisecond=49 ) 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 16 ms. (steps per millisecond=625 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-22 03:41:50] [INFO ] Invariant cache hit.
[2023-03-22 03:41:50] [INFO ] [Real]Absence check using 551 positive place invariants in 242 ms returned sat
[2023-03-22 03:41:52] [INFO ] After 2905ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 03:41:53] [INFO ] [Nat]Absence check using 551 positive place invariants in 231 ms returned sat
[2023-03-22 03:41:55] [INFO ] After 1972ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-22 03:41:56] [INFO ] Deduced a trap composed of 22 places in 952 ms of which 3 ms to minimize.
[2023-03-22 03:41:57] [INFO ] Deduced a trap composed of 15 places in 754 ms of which 1 ms to minimize.
[2023-03-22 03:41:58] [INFO ] Deduced a trap composed of 26 places in 785 ms of which 2 ms to minimize.
[2023-03-22 03:41:59] [INFO ] Deduced a trap composed of 18 places in 1204 ms of which 1 ms to minimize.
[2023-03-22 03:42:00] [INFO ] Deduced a trap composed of 16 places in 910 ms of which 2 ms to minimize.
[2023-03-22 03:42:01] [INFO ] Deduced a trap composed of 20 places in 702 ms of which 1 ms to minimize.
[2023-03-22 03:42:02] [INFO ] Deduced a trap composed of 32 places in 800 ms of which 22 ms to minimize.
[2023-03-22 03:42:03] [INFO ] Deduced a trap composed of 10 places in 883 ms of which 2 ms to minimize.
[2023-03-22 03:42:04] [INFO ] Deduced a trap composed of 26 places in 1021 ms of which 3 ms to minimize.
[2023-03-22 03:42:06] [INFO ] Deduced a trap composed of 17 places in 1153 ms of which 1 ms to minimize.
[2023-03-22 03:42:07] [INFO ] Deduced a trap composed of 29 places in 816 ms of which 3 ms to minimize.
[2023-03-22 03:42:08] [INFO ] Deduced a trap composed of 31 places in 1147 ms of which 2 ms to minimize.
[2023-03-22 03:42:09] [INFO ] Deduced a trap composed of 25 places in 1003 ms of which 23 ms to minimize.
[2023-03-22 03:42:10] [INFO ] Deduced a trap composed of 35 places in 1007 ms of which 2 ms to minimize.
[2023-03-22 03:42:11] [INFO ] Deduced a trap composed of 27 places in 841 ms of which 1 ms to minimize.
[2023-03-22 03:42:12] [INFO ] Deduced a trap composed of 33 places in 720 ms of which 2 ms to minimize.
[2023-03-22 03:42:13] [INFO ] Deduced a trap composed of 34 places in 738 ms of which 2 ms to minimize.
[2023-03-22 03:42:14] [INFO ] Deduced a trap composed of 36 places in 1257 ms of which 2 ms to minimize.
[2023-03-22 03:42:15] [INFO ] Deduced a trap composed of 29 places in 803 ms of which 1 ms to minimize.
[2023-03-22 03:42:16] [INFO ] Deduced a trap composed of 36 places in 733 ms of which 3 ms to minimize.
[2023-03-22 03:42:17] [INFO ] Deduced a trap composed of 34 places in 662 ms of which 2 ms to minimize.
[2023-03-22 03:42:18] [INFO ] Deduced a trap composed of 44 places in 850 ms of which 4 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-22 03:42:18] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 03:42:18] [INFO ] After 25226ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Parikh walk visited 0 properties in 182 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 8 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 3 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 619 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 620 ms. Remains : 1553/3053 places, 1303/2803 transitions.
Finished random walk after 1144 steps, including 0 resets, run visited all 2 properties in 20 ms. (steps per millisecond=57 )
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 516 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 291 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 320 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2)]
[2023-03-22 03:42:20] [INFO ] Invariant cache hit.
[2023-03-22 03:42:23] [INFO ] [Real]Absence check using 551 positive place invariants in 1165 ms returned sat
[2023-03-22 03:42:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 03:42:35] [INFO ] [Real]Absence check using state equation in 11489 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 200 ms. Remains 3053 /3053 variables (removed 0) and now considering 2803/2803 (removed 0) transitions.
[2023-03-22 03:42:35] [INFO ] Invariant cache hit.
[2023-03-22 03:42:36] [INFO ] Implicit Places using invariants in 1432 ms returned []
[2023-03-22 03:42:36] [INFO ] Invariant cache hit.
[2023-03-22 03:42:40] [INFO ] Implicit Places using invariants and state equation in 3596 ms returned []
Implicit Place search using SMT with State Equation took 5030 ms to find 0 implicit places.
[2023-03-22 03:42:40] [INFO ] Invariant cache hit.
[2023-03-22 03:42:42] [INFO ] Dead Transitions using invariants and state equation in 2000 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7245 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 391 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 168 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 281 ms. (steps per millisecond=35 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-22 03:42:43] [INFO ] Invariant cache hit.
[2023-03-22 03:42:44] [INFO ] [Real]Absence check using 551 positive place invariants in 503 ms returned sat
[2023-03-22 03:42:46] [INFO ] After 2987ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 03:42:47] [INFO ] [Nat]Absence check using 551 positive place invariants in 232 ms returned sat
[2023-03-22 03:42:49] [INFO ] After 2004ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-22 03:42:50] [INFO ] Deduced a trap composed of 22 places in 1074 ms of which 2 ms to minimize.
[2023-03-22 03:42:51] [INFO ] Deduced a trap composed of 15 places in 1076 ms of which 16 ms to minimize.
[2023-03-22 03:42:52] [INFO ] Deduced a trap composed of 26 places in 905 ms of which 1 ms to minimize.
[2023-03-22 03:42:53] [INFO ] Deduced a trap composed of 18 places in 707 ms of which 1 ms to minimize.
[2023-03-22 03:42:54] [INFO ] Deduced a trap composed of 16 places in 946 ms of which 2 ms to minimize.
[2023-03-22 03:42:55] [INFO ] Deduced a trap composed of 20 places in 824 ms of which 1 ms to minimize.
[2023-03-22 03:42:56] [INFO ] Deduced a trap composed of 32 places in 1028 ms of which 3 ms to minimize.
[2023-03-22 03:42:57] [INFO ] Deduced a trap composed of 10 places in 848 ms of which 1 ms to minimize.
[2023-03-22 03:42:58] [INFO ] Deduced a trap composed of 26 places in 764 ms of which 1 ms to minimize.
[2023-03-22 03:42:59] [INFO ] Deduced a trap composed of 17 places in 723 ms of which 2 ms to minimize.
[2023-03-22 03:43:00] [INFO ] Deduced a trap composed of 29 places in 876 ms of which 2 ms to minimize.
[2023-03-22 03:43:01] [INFO ] Deduced a trap composed of 31 places in 1117 ms of which 2 ms to minimize.
[2023-03-22 03:43:02] [INFO ] Deduced a trap composed of 25 places in 849 ms of which 2 ms to minimize.
[2023-03-22 03:43:03] [INFO ] Deduced a trap composed of 35 places in 1238 ms of which 2 ms to minimize.
[2023-03-22 03:43:04] [INFO ] Deduced a trap composed of 27 places in 670 ms of which 1 ms to minimize.
[2023-03-22 03:43:05] [INFO ] Deduced a trap composed of 33 places in 719 ms of which 1 ms to minimize.
[2023-03-22 03:43:06] [INFO ] Deduced a trap composed of 34 places in 762 ms of which 2 ms to minimize.
[2023-03-22 03:43:06] [INFO ] Deduced a trap composed of 36 places in 777 ms of which 2 ms to minimize.
[2023-03-22 03:43:07] [INFO ] Deduced a trap composed of 29 places in 809 ms of which 19 ms to minimize.
[2023-03-22 03:43:08] [INFO ] Deduced a trap composed of 36 places in 758 ms of which 2 ms to minimize.
[2023-03-22 03:43:10] [INFO ] Deduced a trap composed of 34 places in 1271 ms of which 14 ms to minimize.
[2023-03-22 03:43:10] [INFO ] Deduced a trap composed of 44 places in 713 ms of which 1 ms to minimize.
[2023-03-22 03:43:11] [INFO ] Deduced a trap composed of 23 places in 682 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-22 03:43:11] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 03:43:11] [INFO ] After 25286ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Parikh walk visited 0 properties in 113 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 544 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 552 ms. Remains : 1553/3053 places, 1303/2803 transitions.
Finished random walk after 6071 steps, including 1 resets, run visited all 2 properties in 77 ms. (steps per millisecond=78 )
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 392 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 170 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 257 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2)]
[2023-03-22 03:43:13] [INFO ] Invariant cache hit.
[2023-03-22 03:43:16] [INFO ] [Real]Absence check using 551 positive place invariants in 1100 ms returned sat
[2023-03-22 03:43:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 03:43:28] [INFO ] [Real]Absence check using state equation in 11672 ms returned unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 233 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 23 reset in 1044 ms.
Product exploration explored 100000 steps with 23 reset in 1268 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 196 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 7 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 2 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 2 ms
Applied a total of 2201 rules in 1022 ms. Remains 2702 /3053 variables (removed 351) and now considering 2454/2803 (removed 349) transitions.
[2023-03-22 03:43:32] [INFO ] Redundant transitions in 56 ms returned []
// Phase 1: matrix 2454 rows 2702 cols
[2023-03-22 03:43:32] [INFO ] Computed 551 place invariants in 40 ms
[2023-03-22 03:43:34] [INFO ] Dead Transitions using invariants and state equation in 2131 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 3217 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 222 ms. Remains 3053 /3053 variables (removed 0) and now considering 2803/2803 (removed 0) transitions.
// Phase 1: matrix 2803 rows 3053 cols
[2023-03-22 03:43:34] [INFO ] Computed 551 place invariants in 27 ms
[2023-03-22 03:43:36] [INFO ] Implicit Places using invariants in 1898 ms returned []
[2023-03-22 03:43:36] [INFO ] Invariant cache hit.
[2023-03-22 03:43:41] [INFO ] Implicit Places using invariants and state equation in 4585 ms returned []
Implicit Place search using SMT with State Equation took 6510 ms to find 0 implicit places.
[2023-03-22 03:43:41] [INFO ] Invariant cache hit.
[2023-03-22 03:43:44] [INFO ] Dead Transitions using invariants and state equation in 2822 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9557 ms. Remains : 3053/3053 places, 2803/2803 transitions.
Treatment of property ShieldPPPs-PT-050B-LTLCardinality-11 finished in 125141 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 640 ms. Remains 1553 /3059 variables (removed 1506) and now considering 1303/2809 (removed 1506) transitions.
// Phase 1: matrix 1303 rows 1553 cols
[2023-03-22 03:43:44] [INFO ] Computed 551 place invariants in 2 ms
[2023-03-22 03:43:45] [INFO ] Implicit Places using invariants in 729 ms returned []
[2023-03-22 03:43:45] [INFO ] Invariant cache hit.
[2023-03-22 03:43:47] [INFO ] Implicit Places using invariants and state equation in 2105 ms returned []
Implicit Place search using SMT with State Equation took 2844 ms to find 0 implicit places.
[2023-03-22 03:43:47] [INFO ] Redundant transitions in 20 ms returned []
[2023-03-22 03:43:47] [INFO ] Invariant cache hit.
[2023-03-22 03:43:48] [INFO ] Dead Transitions using invariants and state equation in 813 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 4333 ms. Remains : 1553/3059 places, 1303/2809 transitions.
Stuttering acceptance computed with spot in 163 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 1246 ms.
Stuttering criterion allowed to conclude after 36740 steps with 10 reset in 526 ms.
FORMULA ShieldPPPs-PT-050B-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-050B-LTLCardinality-15 finished in 6293 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 166 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 6 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 699 ms. Remains 1551 /3059 variables (removed 1508) and now considering 1301/2809 (removed 1508) transitions.
// Phase 1: matrix 1301 rows 1551 cols
[2023-03-22 03:43:51] [INFO ] Computed 551 place invariants in 12 ms
[2023-03-22 03:43:52] [INFO ] Implicit Places using invariants in 1115 ms returned []
[2023-03-22 03:43:52] [INFO ] Invariant cache hit.
[2023-03-22 03:43:55] [INFO ] Implicit Places using invariants and state equation in 2960 ms returned []
Implicit Place search using SMT with State Equation took 4077 ms to find 0 implicit places.
[2023-03-22 03:43:55] [INFO ] Invariant cache hit.
[2023-03-22 03:43:56] [INFO ] Dead Transitions using invariants and state equation in 757 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 5562 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 969 ms.
Product exploration explored 100000 steps with 103 reset in 1248 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 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 208 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 918 steps, including 0 resets, run visited all 1 properties in 10 ms. (steps per millisecond=91 )
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 176 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 112 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 138 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2023-03-22 03:43:59] [INFO ] Invariant cache hit.
[2023-03-22 03:44:00] [INFO ] [Real]Absence check using 551 positive place invariants in 411 ms returned sat
[2023-03-22 03:44:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 03:44:06] [INFO ] [Real]Absence check using state equation in 5623 ms returned sat
[2023-03-22 03:44:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 03:44:08] [INFO ] [Nat]Absence check using 551 positive place invariants in 380 ms returned sat
[2023-03-22 03:44:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 03:44:13] [INFO ] [Nat]Absence check using state equation in 5235 ms returned sat
[2023-03-22 03:44:13] [INFO ] Computed and/alt/rep : 1299/2494/1299 causal constraints (skipped 0 transitions) in 64 ms.
[2023-03-22 03:44:21] [INFO ] Added : 280 causal constraints over 56 iterations in 7855 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 66 ms. Remains 1551 /1551 variables (removed 0) and now considering 1301/1301 (removed 0) transitions.
[2023-03-22 03:44:21] [INFO ] Invariant cache hit.
[2023-03-22 03:44:24] [INFO ] Implicit Places using invariants in 2270 ms returned []
[2023-03-22 03:44:24] [INFO ] Invariant cache hit.
[2023-03-22 03:44:27] [INFO ] Implicit Places using invariants and state equation in 3665 ms returned []
Implicit Place search using SMT with State Equation took 5957 ms to find 0 implicit places.
[2023-03-22 03:44:27] [INFO ] Invariant cache hit.
[2023-03-22 03:44:28] [INFO ] Dead Transitions using invariants and state equation in 991 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7016 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 111 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 205 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 977 steps, including 0 resets, run visited all 1 properties in 19 ms. (steps per millisecond=51 )
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 237 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 149 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 200 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2023-03-22 03:44:29] [INFO ] Invariant cache hit.
[2023-03-22 03:44:31] [INFO ] [Real]Absence check using 551 positive place invariants in 395 ms returned sat
[2023-03-22 03:44:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 03:44:36] [INFO ] [Real]Absence check using state equation in 5220 ms returned sat
[2023-03-22 03:44:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 03:44:38] [INFO ] [Nat]Absence check using 551 positive place invariants in 406 ms returned sat
[2023-03-22 03:44:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 03:44:43] [INFO ] [Nat]Absence check using state equation in 5060 ms returned sat
[2023-03-22 03:44:43] [INFO ] Computed and/alt/rep : 1299/2494/1299 causal constraints (skipped 0 transitions) in 117 ms.
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.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: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-22 03:44: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: Stream close... while checking expression EG (NOT p0)
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 162 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 102 reset in 1061 ms.
Product exploration explored 100000 steps with 102 reset in 1179 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 117 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 99 ms. Remains 1551 /1551 variables (removed 0) and now considering 1301/1301 (removed 0) transitions.
[2023-03-22 03:44:54] [INFO ] Redundant transitions in 31 ms returned []
[2023-03-22 03:44:54] [INFO ] Invariant cache hit.
[2023-03-22 03:44:55] [INFO ] Dead Transitions using invariants and state equation in 829 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 972 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 75 ms. Remains 1551 /1551 variables (removed 0) and now considering 1301/1301 (removed 0) transitions.
[2023-03-22 03:44:55] [INFO ] Invariant cache hit.
[2023-03-22 03:44:56] [INFO ] Implicit Places using invariants in 896 ms returned []
[2023-03-22 03:44:56] [INFO ] Invariant cache hit.
[2023-03-22 03:44:58] [INFO ] Implicit Places using invariants and state equation in 2244 ms returned []
Implicit Place search using SMT with State Equation took 3155 ms to find 0 implicit places.
[2023-03-22 03:44:58] [INFO ] Invariant cache hit.
[2023-03-22 03:44:59] [INFO ] Dead Transitions using invariants and state equation in 1280 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4525 ms. Remains : 1551/1551 places, 1301/1301 transitions.
Treatment of property ShieldPPPs-PT-050B-LTLCardinality-05 finished in 69543 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 248 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 5 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 669 ms. Remains 1553 /3059 variables (removed 1506) and now considering 1303/2809 (removed 1506) transitions.
// Phase 1: matrix 1303 rows 1553 cols
[2023-03-22 03:45:01] [INFO ] Computed 551 place invariants in 6 ms
[2023-03-22 03:45:02] [INFO ] Implicit Places using invariants in 1075 ms returned []
[2023-03-22 03:45:02] [INFO ] Invariant cache hit.
[2023-03-22 03:45:04] [INFO ] Implicit Places using invariants and state equation in 2014 ms returned []
Implicit Place search using SMT with State Equation took 3109 ms to find 0 implicit places.
[2023-03-22 03:45:04] [INFO ] Invariant cache hit.
[2023-03-22 03:45:05] [INFO ] Dead Transitions using invariants and state equation in 962 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 4742 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]]
Product exploration explored 100000 steps with 60 reset in 1021 ms.
Stuttering criterion allowed to conclude after 29810 steps with 16 reset in 355 ms.
Treatment of property ShieldPPPs-PT-050B-LTLCardinality-11 finished in 6460 ms.
FORMULA ShieldPPPs-PT-050B-LTLCardinality-11 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
[2023-03-22 03:45:06] [INFO ] Flatten gal took : 109 ms
[2023-03-22 03:45:06] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2023-03-22 03:45:06] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 3059 places, 2809 transitions and 8018 arcs took 14 ms.
Total runtime 363415 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1657/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1657/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : ShieldPPPs-PT-050B-LTLCardinality-05
Could not compute solution for formula : ShieldPPPs-PT-050B-LTLCardinality-11

BK_STOP 1679456709717

--------------------
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:
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2023
ltl formula name ShieldPPPs-PT-050B-LTLCardinality-05
ltl formula formula --ltl=/tmp/1657/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 3059 places, 2809 transitions and 8018 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.410 real 0.130 user 0.150 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1657/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1657/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1657/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1657/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name ShieldPPPs-PT-050B-LTLCardinality-11
ltl formula formula --ltl=/tmp/1657/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 3059 places, 2809 transitions and 8018 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.410 real 0.120 user 0.150 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1657/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1657/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1657/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1657/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldPPPs-PT-050B"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is 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 r393-oct2-167903717100507"
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 ;