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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.2M
-rw-r--r-- 1 mcc users 7.3K Feb 26 02:08 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Feb 26 02:08 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Feb 26 02:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Feb 26 02:07 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.8K Feb 26 02:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 62K Feb 26 02:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Feb 26 02:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K Feb 26 02:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:59 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 1.8M Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679458593101

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-100B
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-22 04:16:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-22 04:16:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 04:16:37] [INFO ] Load time of PNML (sax parser for PT used): 356 ms
[2023-03-22 04:16:37] [INFO ] Transformed 6803 places.
[2023-03-22 04:16:37] [INFO ] Transformed 6303 transitions.
[2023-03-22 04:16:37] [INFO ] Found NUPN structural information;
[2023-03-22 04:16:37] [INFO ] Parsed PT model containing 6803 places and 6303 transitions and 17406 arcs in 954 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA ShieldPPPs-PT-100B-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-100B-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-100B-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-100B-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-100B-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-100B-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-100B-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-100B-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-100B-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 32 out of 6803 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6803/6803 places, 6303/6303 transitions.
Discarding 695 places :
Symmetric choice reduction at 0 with 695 rule applications. Total rules 695 place count 6108 transition count 5608
Iterating global reduction 0 with 695 rules applied. Total rules applied 1390 place count 6108 transition count 5608
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1391 place count 6107 transition count 5607
Iterating global reduction 0 with 1 rules applied. Total rules applied 1392 place count 6107 transition count 5607
Applied a total of 1392 rules in 3342 ms. Remains 6107 /6803 variables (removed 696) and now considering 5607/6303 (removed 696) transitions.
// Phase 1: matrix 5607 rows 6107 cols
[2023-03-22 04:16:41] [INFO ] Computed 1101 place invariants in 112 ms
[2023-03-22 04:16:52] [INFO ] Implicit Places using invariants in 11177 ms returned []
[2023-03-22 04:16:52] [INFO ] Invariant cache hit.
[2023-03-22 04:16:53] [INFO ] Implicit Places using invariants and state equation in 797 ms returned []
Implicit Place search using SMT with State Equation took 12016 ms to find 0 implicit places.
[2023-03-22 04:16:53] [INFO ] Invariant cache hit.
[2023-03-22 04:17:05] [INFO ] Dead Transitions using invariants and state equation in 12195 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6107/6803 places, 5607/6303 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27587 ms. Remains : 6107/6803 places, 5607/6303 transitions.
Support contains 32 out of 6107 places after structural reductions.
[2023-03-22 04:17:06] [INFO ] Flatten gal took : 362 ms
[2023-03-22 04:17:06] [INFO ] Flatten gal took : 199 ms
[2023-03-22 04:17:07] [INFO ] Input system was already deterministic with 5607 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 552 ms. (steps per millisecond=18 ) properties (out of 14) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2023-03-22 04:17:08] [INFO ] Invariant cache hit.
[2023-03-22 04:17:09] [INFO ] After 1664ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-22 04:17:12] [INFO ] [Nat]Absence check using 1101 positive place invariants in 982 ms returned sat
[2023-03-22 04:17:21] [INFO ] After 7725ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-22 04:17:24] [INFO ] Deduced a trap composed of 19 places in 3356 ms of which 39 ms to minimize.
[2023-03-22 04:17:28] [INFO ] Deduced a trap composed of 30 places in 3789 ms of which 24 ms to minimize.
[2023-03-22 04:17:33] [INFO ] Deduced a trap composed of 23 places in 4121 ms of which 11 ms to minimize.
[2023-03-22 04:17:37] [INFO ] Deduced a trap composed of 21 places in 4620 ms of which 5 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-22 04:17:38] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 04:17:38] [INFO ] After 28209ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:7
Parikh walk visited 0 properties in 2836 ms.
Support contains 22 out of 6107 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6107/6107 places, 5607/5607 transitions.
Drop transitions removed 692 transitions
Trivial Post-agglo rules discarded 692 transitions
Performed 692 trivial Post agglomeration. Transition count delta: 692
Iterating post reduction 0 with 692 rules applied. Total rules applied 692 place count 6107 transition count 4915
Reduce places removed 692 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 695 rules applied. Total rules applied 1387 place count 5415 transition count 4912
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 1390 place count 5412 transition count 4912
Performed 497 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 497 Pre rules applied. Total rules applied 1390 place count 5412 transition count 4415
Deduced a syphon composed of 497 places in 24 ms
Reduce places removed 497 places and 0 transitions.
Iterating global reduction 3 with 994 rules applied. Total rules applied 2384 place count 4915 transition count 4415
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 2386 place count 4913 transition count 4413
Iterating global reduction 3 with 2 rules applied. Total rules applied 2388 place count 4913 transition count 4413
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 2388 place count 4913 transition count 4412
Deduced a syphon composed of 1 places in 22 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2390 place count 4912 transition count 4412
Performed 1789 Post agglomeration using F-continuation condition.Transition count delta: 1789
Deduced a syphon composed of 1789 places in 32 ms
Reduce places removed 1789 places and 0 transitions.
Iterating global reduction 3 with 3578 rules applied. Total rules applied 5968 place count 3123 transition count 2623
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 888 times.
Drop transitions removed 888 transitions
Iterating global reduction 3 with 888 rules applied. Total rules applied 6856 place count 3123 transition count 2623
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 6857 place count 3122 transition count 2622
Applied a total of 6857 rules in 2967 ms. Remains 3122 /6107 variables (removed 2985) and now considering 2622/5607 (removed 2985) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2967 ms. Remains : 3122/6107 places, 2622/5607 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 476 ms. (steps per millisecond=21 ) properties (out of 7) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 2622 rows 3122 cols
[2023-03-22 04:17:45] [INFO ] Computed 1101 place invariants in 233 ms
[2023-03-22 04:17:47] [INFO ] [Real]Absence check using 1057 positive place invariants in 1735 ms returned sat
[2023-03-22 04:17:47] [INFO ] [Real]Absence check using 1057 positive and 44 generalized place invariants in 14 ms returned sat
[2023-03-22 04:17:47] [INFO ] After 2576ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-22 04:17:48] [INFO ] [Nat]Absence check using 1057 positive place invariants in 279 ms returned sat
[2023-03-22 04:17:48] [INFO ] [Nat]Absence check using 1057 positive and 44 generalized place invariants in 15 ms returned sat
[2023-03-22 04:17:51] [INFO ] After 2964ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-22 04:17:53] [INFO ] Deduced a trap composed of 7 places in 1079 ms of which 16 ms to minimize.
[2023-03-22 04:17:53] [INFO ] Deduced a trap composed of 4 places in 529 ms of which 1 ms to minimize.
[2023-03-22 04:17:54] [INFO ] Deduced a trap composed of 4 places in 719 ms of which 1 ms to minimize.
[2023-03-22 04:17:55] [INFO ] Deduced a trap composed of 8 places in 591 ms of which 1 ms to minimize.
[2023-03-22 04:17:57] [INFO ] Deduced a trap composed of 4 places in 1983 ms of which 14 ms to minimize.
[2023-03-22 04:17:58] [INFO ] Deduced a trap composed of 6 places in 393 ms of which 1 ms to minimize.
[2023-03-22 04:17:58] [INFO ] Deduced a trap composed of 8 places in 338 ms of which 1 ms to minimize.
[2023-03-22 04:17:59] [INFO ] Deduced a trap composed of 5 places in 566 ms of which 1 ms to minimize.
[2023-03-22 04:18:00] [INFO ] Deduced a trap composed of 4 places in 871 ms of which 1 ms to minimize.
[2023-03-22 04:18:00] [INFO ] Deduced a trap composed of 6 places in 302 ms of which 0 ms to minimize.
[2023-03-22 04:18:01] [INFO ] Deduced a trap composed of 6 places in 434 ms of which 2 ms to minimize.
[2023-03-22 04:18:01] [INFO ] Deduced a trap composed of 9 places in 516 ms of which 1 ms to minimize.
[2023-03-22 04:18:02] [INFO ] Deduced a trap composed of 5 places in 337 ms of which 1 ms to minimize.
[2023-03-22 04:18:02] [INFO ] Deduced a trap composed of 6 places in 404 ms of which 1 ms to minimize.
[2023-03-22 04:18:03] [INFO ] Deduced a trap composed of 6 places in 313 ms of which 1 ms to minimize.
[2023-03-22 04:18:03] [INFO ] Deduced a trap composed of 6 places in 373 ms of which 1 ms to minimize.
[2023-03-22 04:18:04] [INFO ] Deduced a trap composed of 4 places in 540 ms of which 16 ms to minimize.
[2023-03-22 04:18:04] [INFO ] Deduced a trap composed of 4 places in 474 ms of which 1 ms to minimize.
[2023-03-22 04:18:05] [INFO ] Deduced a trap composed of 6 places in 395 ms of which 1 ms to minimize.
[2023-03-22 04:18:05] [INFO ] Deduced a trap composed of 6 places in 669 ms of which 1 ms to minimize.
[2023-03-22 04:18:06] [INFO ] Deduced a trap composed of 6 places in 420 ms of which 2 ms to minimize.
[2023-03-22 04:18:07] [INFO ] Deduced a trap composed of 5 places in 1010 ms of which 1 ms to minimize.
[2023-03-22 04:18:08] [INFO ] Deduced a trap composed of 5 places in 510 ms of which 1 ms to minimize.
[2023-03-22 04:18:08] [INFO ] Deduced a trap composed of 5 places in 357 ms of which 0 ms to minimize.
[2023-03-22 04:18:09] [INFO ] Deduced a trap composed of 7 places in 952 ms of which 1 ms to minimize.
[2023-03-22 04:18:10] [INFO ] Deduced a trap composed of 5 places in 375 ms of which 1 ms to minimize.
[2023-03-22 04:18:10] [INFO ] Deduced a trap composed of 6 places in 401 ms of which 1 ms to minimize.
[2023-03-22 04:18:11] [INFO ] Deduced a trap composed of 9 places in 711 ms of which 6 ms to minimize.
[2023-03-22 04:18:12] [INFO ] Deduced a trap composed of 7 places in 603 ms of which 1 ms to minimize.
[2023-03-22 04:18:13] [INFO ] Deduced a trap composed of 9 places in 592 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-22 04:18:13] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 04:18:13] [INFO ] After 25397ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
Parikh walk visited 0 properties in 866 ms.
Support contains 12 out of 3122 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3122/3122 places, 2622/2622 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 3122 transition count 2620
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 3120 transition count 2620
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 4 place count 3120 transition count 2617
Deduced a syphon composed of 3 places in 7 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 10 place count 3117 transition count 2617
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 7 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 22 place count 3111 transition count 2611
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 24 place count 3111 transition count 2611
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 25 place count 3110 transition count 2610
Applied a total of 25 rules in 697 ms. Remains 3110 /3122 variables (removed 12) and now considering 2610/2622 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 698 ms. Remains : 3110/3122 places, 2610/2622 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 421 ms. (steps per millisecond=23 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 258 ms. (steps per millisecond=38 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 245 ms. (steps per millisecond=40 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 238 ms. (steps per millisecond=42 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 188 ms. (steps per millisecond=53 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 51278 steps, run timeout after 3022 ms. (steps per millisecond=16 ) properties seen :{}
Probabilistic random walk after 51278 steps, saw 47627 distinct states, run finished after 3025 ms. (steps per millisecond=16 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 2610 rows 3110 cols
[2023-03-22 04:18:18] [INFO ] Computed 1101 place invariants in 24 ms
[2023-03-22 04:18:19] [INFO ] [Real]Absence check using 1050 positive place invariants in 254 ms returned sat
[2023-03-22 04:18:19] [INFO ] [Real]Absence check using 1050 positive and 51 generalized place invariants in 68 ms returned sat
[2023-03-22 04:18:20] [INFO ] After 1055ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-22 04:18:21] [INFO ] [Nat]Absence check using 1050 positive place invariants in 577 ms returned sat
[2023-03-22 04:18:21] [INFO ] [Nat]Absence check using 1050 positive and 51 generalized place invariants in 47 ms returned sat
[2023-03-22 04:18:25] [INFO ] After 3388ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-22 04:18:25] [INFO ] Deduced a trap composed of 3 places in 409 ms of which 1 ms to minimize.
[2023-03-22 04:18:26] [INFO ] Deduced a trap composed of 6 places in 418 ms of which 0 ms to minimize.
[2023-03-22 04:18:26] [INFO ] Deduced a trap composed of 4 places in 423 ms of which 1 ms to minimize.
[2023-03-22 04:18:27] [INFO ] Deduced a trap composed of 6 places in 515 ms of which 0 ms to minimize.
[2023-03-22 04:18:28] [INFO ] Deduced a trap composed of 5 places in 666 ms of which 2 ms to minimize.
[2023-03-22 04:18:28] [INFO ] Deduced a trap composed of 6 places in 429 ms of which 1 ms to minimize.
[2023-03-22 04:18:29] [INFO ] Deduced a trap composed of 6 places in 423 ms of which 2 ms to minimize.
[2023-03-22 04:18:29] [INFO ] Deduced a trap composed of 6 places in 405 ms of which 6 ms to minimize.
[2023-03-22 04:18:30] [INFO ] Deduced a trap composed of 4 places in 419 ms of which 1 ms to minimize.
[2023-03-22 04:18:30] [INFO ] Deduced a trap composed of 6 places in 521 ms of which 1 ms to minimize.
[2023-03-22 04:18:31] [INFO ] Deduced a trap composed of 6 places in 531 ms of which 2 ms to minimize.
[2023-03-22 04:18:31] [INFO ] Deduced a trap composed of 6 places in 504 ms of which 1 ms to minimize.
[2023-03-22 04:18:32] [INFO ] Deduced a trap composed of 5 places in 414 ms of which 1 ms to minimize.
[2023-03-22 04:18:33] [INFO ] Deduced a trap composed of 16 places in 463 ms of which 1 ms to minimize.
[2023-03-22 04:18:33] [INFO ] Deduced a trap composed of 8 places in 267 ms of which 0 ms to minimize.
[2023-03-22 04:18:34] [INFO ] Deduced a trap composed of 6 places in 425 ms of which 14 ms to minimize.
[2023-03-22 04:18:34] [INFO ] Deduced a trap composed of 5 places in 365 ms of which 0 ms to minimize.
[2023-03-22 04:18:34] [INFO ] Deduced a trap composed of 4 places in 375 ms of which 1 ms to minimize.
[2023-03-22 04:18:36] [INFO ] Deduced a trap composed of 6 places in 1256 ms of which 1 ms to minimize.
[2023-03-22 04:18:36] [INFO ] Deduced a trap composed of 8 places in 278 ms of which 1 ms to minimize.
[2023-03-22 04:18:37] [INFO ] Deduced a trap composed of 6 places in 387 ms of which 24 ms to minimize.
[2023-03-22 04:18:37] [INFO ] Deduced a trap composed of 6 places in 266 ms of which 0 ms to minimize.
[2023-03-22 04:18:37] [INFO ] Deduced a trap composed of 6 places in 240 ms of which 1 ms to minimize.
[2023-03-22 04:18:38] [INFO ] Deduced a trap composed of 5 places in 285 ms of which 1 ms to minimize.
[2023-03-22 04:18:38] [INFO ] Deduced a trap composed of 6 places in 236 ms of which 1 ms to minimize.
[2023-03-22 04:18:39] [INFO ] Deduced a trap composed of 6 places in 305 ms of which 1 ms to minimize.
[2023-03-22 04:18:39] [INFO ] Deduced a trap composed of 9 places in 195 ms of which 1 ms to minimize.
[2023-03-22 04:18:39] [INFO ] Deduced a trap composed of 9 places in 203 ms of which 1 ms to minimize.
[2023-03-22 04:18:40] [INFO ] Deduced a trap composed of 6 places in 274 ms of which 14 ms to minimize.
[2023-03-22 04:18:40] [INFO ] Deduced a trap composed of 6 places in 234 ms of which 1 ms to minimize.
[2023-03-22 04:18:40] [INFO ] Deduced a trap composed of 5 places in 310 ms of which 15 ms to minimize.
[2023-03-22 04:18:41] [INFO ] Deduced a trap composed of 4 places in 358 ms of which 15 ms to minimize.
[2023-03-22 04:18:41] [INFO ] Deduced a trap composed of 6 places in 349 ms of which 14 ms to minimize.
[2023-03-22 04:18:42] [INFO ] Deduced a trap composed of 15 places in 536 ms of which 1 ms to minimize.
[2023-03-22 04:18:42] [INFO ] Deduced a trap composed of 16 places in 374 ms of which 1 ms to minimize.
[2023-03-22 04:18:43] [INFO ] Deduced a trap composed of 17 places in 304 ms of which 1 ms to minimize.
[2023-03-22 04:18:43] [INFO ] Deduced a trap composed of 29 places in 402 ms of which 1 ms to minimize.
[2023-03-22 04:18:44] [INFO ] Trap strengthening (SAT) tested/added 38/37 trap constraints in 18993 ms
[2023-03-22 04:18:44] [INFO ] Deduced a trap composed of 7 places in 507 ms of which 1 ms to minimize.
[2023-03-22 04:18:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 835 ms
[2023-03-22 04:18:45] [INFO ] After 23462ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-22 04:18:45] [INFO ] After 25045ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 631 ms.
Support contains 12 out of 3110 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3110/3110 places, 2610/2610 transitions.
Applied a total of 0 rules in 152 ms. Remains 3110 /3110 variables (removed 0) and now considering 2610/2610 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 152 ms. Remains : 3110/3110 places, 2610/2610 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3110/3110 places, 2610/2610 transitions.
Applied a total of 0 rules in 148 ms. Remains 3110 /3110 variables (removed 0) and now considering 2610/2610 (removed 0) transitions.
[2023-03-22 04:18:46] [INFO ] Invariant cache hit.
[2023-03-22 04:18:52] [INFO ] Implicit Places using invariants in 6571 ms returned []
[2023-03-22 04:18:52] [INFO ] Invariant cache hit.
[2023-03-22 04:18:59] [INFO ] Implicit Places using invariants and state equation in 7302 ms returned []
Implicit Place search using SMT with State Equation took 13880 ms to find 0 implicit places.
[2023-03-22 04:19:00] [INFO ] Redundant transitions in 230 ms returned []
[2023-03-22 04:19:00] [INFO ] Invariant cache hit.
[2023-03-22 04:19:02] [INFO ] Dead Transitions using invariants and state equation in 2056 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16345 ms. Remains : 3110/3110 places, 2610/2610 transitions.
FORMULA ShieldPPPs-PT-100B-LTLCardinality-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 1204 stabilizing places and 1204 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' '!((F(G(F(!(X(p0) U X(p1)))))&&X(F(X(X(p0))))))'
Support contains 4 out of 6107 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6107/6107 places, 5607/5607 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 6103 transition count 5603
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 6103 transition count 5603
Applied a total of 8 rules in 1476 ms. Remains 6103 /6107 variables (removed 4) and now considering 5603/5607 (removed 4) transitions.
// Phase 1: matrix 5603 rows 6103 cols
[2023-03-22 04:19:04] [INFO ] Computed 1101 place invariants in 47 ms
[2023-03-22 04:19:09] [INFO ] Implicit Places using invariants in 5101 ms returned []
[2023-03-22 04:19:09] [INFO ] Invariant cache hit.
[2023-03-22 04:19:13] [INFO ] Implicit Places using invariants and state equation in 3843 ms returned []
Implicit Place search using SMT with State Equation took 8984 ms to find 0 implicit places.
[2023-03-22 04:19:13] [INFO ] Invariant cache hit.
[2023-03-22 04:19:19] [INFO ] Dead Transitions using invariants and state equation in 5833 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6103/6107 places, 5603/5607 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16320 ms. Remains : 6103/6107 places, 5603/5607 transitions.
Stuttering acceptance computed with spot in 744 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), p1, p1, (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-100B-LTLCardinality-01 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=p1, acceptance={} source=3 dest: 4}, { cond=true, acceptance={} source=3 dest: 5}, { cond=(NOT p0), acceptance={} source=3 dest: 6}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}, { cond=p1, acceptance={0} source=4 dest: 4}], [{ cond=p1, acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p1:(OR (EQ s4572 0) (EQ s4033 1)), p0:(OR (EQ s4805 0) (EQ s323 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 17 reset in 1716 ms.
Product exploration explored 100000 steps with 20 reset in 2019 ms.
Computed a total of 1200 stabilizing places and 1200 stable transitions
Computed a total of 1200 stabilizing places and 1200 stable transitions
Knowledge obtained : [(AND p1 p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 189 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 490 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), p1, p1, (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 357 ms. (steps per millisecond=28 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 115168 steps, run timeout after 3001 ms. (steps per millisecond=38 ) properties seen :{}
Probabilistic random walk after 115168 steps, saw 113327 distinct states, run finished after 3002 ms. (steps per millisecond=38 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-22 04:19:28] [INFO ] Invariant cache hit.
[2023-03-22 04:19:28] [INFO ] After 845ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-22 04:19:30] [INFO ] [Nat]Absence check using 1101 positive place invariants in 1067 ms returned sat
[2023-03-22 04:19:38] [INFO ] After 7079ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-22 04:19:41] [INFO ] Deduced a trap composed of 54 places in 3115 ms of which 4 ms to minimize.
[2023-03-22 04:19:45] [INFO ] Deduced a trap composed of 21 places in 3459 ms of which 4 ms to minimize.
[2023-03-22 04:19:48] [INFO ] Deduced a trap composed of 23 places in 3128 ms of which 6 ms to minimize.
[2023-03-22 04:19:51] [INFO ] Deduced a trap composed of 26 places in 2823 ms of which 7 ms to minimize.
[2023-03-22 04:19:55] [INFO ] Deduced a trap composed of 37 places in 3822 ms of which 4 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-22 04:19:55] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 04:19:55] [INFO ] After 27090ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Parikh walk visited 0 properties in 614 ms.
Support contains 4 out of 6103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6103/6103 places, 5603/5603 transitions.
Drop transitions removed 701 transitions
Trivial Post-agglo rules discarded 701 transitions
Performed 701 trivial Post agglomeration. Transition count delta: 701
Iterating post reduction 0 with 701 rules applied. Total rules applied 701 place count 6103 transition count 4902
Reduce places removed 701 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 702 rules applied. Total rules applied 1403 place count 5402 transition count 4901
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1404 place count 5401 transition count 4901
Performed 499 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 499 Pre rules applied. Total rules applied 1404 place count 5401 transition count 4402
Deduced a syphon composed of 499 places in 27 ms
Reduce places removed 499 places and 0 transitions.
Iterating global reduction 3 with 998 rules applied. Total rules applied 2402 place count 4902 transition count 4402
Performed 1797 Post agglomeration using F-continuation condition.Transition count delta: 1797
Deduced a syphon composed of 1797 places in 6 ms
Reduce places removed 1797 places and 0 transitions.
Iterating global reduction 3 with 3594 rules applied. Total rules applied 5996 place count 3105 transition count 2605
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 896 times.
Drop transitions removed 896 transitions
Iterating global reduction 3 with 896 rules applied. Total rules applied 6892 place count 3105 transition count 2605
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 6893 place count 3104 transition count 2604
Applied a total of 6893 rules in 1588 ms. Remains 3104 /6103 variables (removed 2999) and now considering 2604/5603 (removed 2999) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1589 ms. Remains : 3104/6103 places, 2604/5603 transitions.
Finished random walk after 1258 steps, including 0 resets, run visited all 3 properties in 47 ms. (steps per millisecond=26 )
Knowledge obtained : [(AND p1 p0), true]
False Knowledge obtained : [(F (NOT p1)), (F (AND (NOT p1) p0)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 330 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 549 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), p1, p1, (NOT p0)]
Stuttering acceptance computed with spot in 526 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), p1, p1, (NOT p0)]
[2023-03-22 04:19:59] [INFO ] Invariant cache hit.
[2023-03-22 04:20:14] [INFO ] [Real]Absence check using 1101 positive place invariants in 2565 ms returned unknown
Could not prove EG p1
Support contains 4 out of 6103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6103/6103 places, 5603/5603 transitions.
Applied a total of 0 rules in 736 ms. Remains 6103 /6103 variables (removed 0) and now considering 5603/5603 (removed 0) transitions.
[2023-03-22 04:20:15] [INFO ] Invariant cache hit.
[2023-03-22 04:20:18] [INFO ] Implicit Places using invariants in 2707 ms returned []
[2023-03-22 04:20:18] [INFO ] Invariant cache hit.
[2023-03-22 04:20:21] [INFO ] Implicit Places using invariants and state equation in 3633 ms returned []
Implicit Place search using SMT with State Equation took 6377 ms to find 0 implicit places.
[2023-03-22 04:20:21] [INFO ] Invariant cache hit.
[2023-03-22 04:20:27] [INFO ] Dead Transitions using invariants and state equation in 6062 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13198 ms. Remains : 6103/6103 places, 5603/5603 transitions.
Computed a total of 1200 stabilizing places and 1200 stable transitions
Computed a total of 1200 stabilizing places and 1200 stable transitions
Knowledge obtained : [(AND p1 p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 259 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 566 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), p1, p1, (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 310 ms. (steps per millisecond=32 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 107903 steps, run timeout after 3001 ms. (steps per millisecond=35 ) properties seen :{}
Probabilistic random walk after 107903 steps, saw 106212 distinct states, run finished after 3001 ms. (steps per millisecond=35 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-22 04:20:32] [INFO ] Invariant cache hit.
[2023-03-22 04:20:33] [INFO ] After 1246ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-22 04:20:36] [INFO ] [Nat]Absence check using 1101 positive place invariants in 1650 ms returned sat
[2023-03-22 04:20:47] [INFO ] After 10392ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-22 04:20:53] [INFO ] Deduced a trap composed of 54 places in 5886 ms of which 15 ms to minimize.
[2023-03-22 04:20:57] [INFO ] Deduced a trap composed of 21 places in 4149 ms of which 5 ms to minimize.
[2023-03-22 04:21:01] [INFO ] Deduced a trap composed of 23 places in 3227 ms of which 3 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-22 04:21:01] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 04:21:01] [INFO ] After 27384ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Parikh walk visited 0 properties in 739 ms.
Support contains 4 out of 6103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6103/6103 places, 5603/5603 transitions.
Drop transitions removed 701 transitions
Trivial Post-agglo rules discarded 701 transitions
Performed 701 trivial Post agglomeration. Transition count delta: 701
Iterating post reduction 0 with 701 rules applied. Total rules applied 701 place count 6103 transition count 4902
Reduce places removed 701 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 702 rules applied. Total rules applied 1403 place count 5402 transition count 4901
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1404 place count 5401 transition count 4901
Performed 499 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 499 Pre rules applied. Total rules applied 1404 place count 5401 transition count 4402
Deduced a syphon composed of 499 places in 21 ms
Reduce places removed 499 places and 0 transitions.
Iterating global reduction 3 with 998 rules applied. Total rules applied 2402 place count 4902 transition count 4402
Performed 1797 Post agglomeration using F-continuation condition.Transition count delta: 1797
Deduced a syphon composed of 1797 places in 8 ms
Reduce places removed 1797 places and 0 transitions.
Iterating global reduction 3 with 3594 rules applied. Total rules applied 5996 place count 3105 transition count 2605
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 896 times.
Drop transitions removed 896 transitions
Iterating global reduction 3 with 896 rules applied. Total rules applied 6892 place count 3105 transition count 2605
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 6893 place count 3104 transition count 2604
Applied a total of 6893 rules in 1584 ms. Remains 3104 /6103 variables (removed 2999) and now considering 2604/5603 (removed 2999) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1585 ms. Remains : 3104/6103 places, 2604/5603 transitions.
Finished random walk after 1067 steps, including 0 resets, run visited all 3 properties in 27 ms. (steps per millisecond=39 )
Knowledge obtained : [(AND p1 p0), true]
False Knowledge obtained : [(F (NOT p1)), (F (AND (NOT p1) p0)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 306 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 577 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), p1, p1, (NOT p0)]
Stuttering acceptance computed with spot in 511 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), p1, p1, (NOT p0)]
[2023-03-22 04:21:05] [INFO ] Invariant cache hit.
[2023-03-22 04:21:20] [INFO ] [Real]Absence check using 1101 positive place invariants in 6196 ms returned unknown
Could not prove EG p1
Stuttering acceptance computed with spot in 681 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), p1, p1, (NOT p0)]
Product exploration explored 100000 steps with 20 reset in 1574 ms.
Product exploration explored 100000 steps with 20 reset in 1716 ms.
Applying partial POR strategy [false, false, false, true, true, true, true]
Stuttering acceptance computed with spot in 485 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), p1, p1, (NOT p0)]
Support contains 4 out of 6103 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6103/6103 places, 5603/5603 transitions.
Performed 701 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 701 rules applied. Total rules applied 701 place count 6103 transition count 5603
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 200 Pre rules applied. Total rules applied 701 place count 6103 transition count 5604
Deduced a syphon composed of 901 places in 27 ms
Iterating global reduction 1 with 200 rules applied. Total rules applied 901 place count 6103 transition count 5604
Performed 2097 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2998 places in 12 ms
Iterating global reduction 1 with 2097 rules applied. Total rules applied 2998 place count 6103 transition count 5604
Renaming transitions due to excessive name length > 1024 char.
Discarding 702 places :
Symmetric choice reduction at 1 with 702 rule applications. Total rules 3700 place count 5401 transition count 4902
Deduced a syphon composed of 2296 places in 13 ms
Iterating global reduction 1 with 702 rules applied. Total rules applied 4402 place count 5401 transition count 4902
Deduced a syphon composed of 2296 places in 14 ms
Applied a total of 4402 rules in 7514 ms. Remains 5401 /6103 variables (removed 702) and now considering 4902/5603 (removed 701) transitions.
[2023-03-22 04:21:32] [INFO ] Redundant transitions in 306 ms returned []
// Phase 1: matrix 4902 rows 5401 cols
[2023-03-22 04:21:33] [INFO ] Computed 1101 place invariants in 183 ms
[2023-03-22 04:21:38] [INFO ] Dead Transitions using invariants and state equation in 5662 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5401/6103 places, 4902/5603 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 13587 ms. Remains : 5401/6103 places, 4902/5603 transitions.
Support contains 4 out of 6103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6103/6103 places, 5603/5603 transitions.
Applied a total of 0 rules in 1019 ms. Remains 6103 /6103 variables (removed 0) and now considering 5603/5603 (removed 0) transitions.
// Phase 1: matrix 5603 rows 6103 cols
[2023-03-22 04:21:39] [INFO ] Computed 1101 place invariants in 44 ms
[2023-03-22 04:21:44] [INFO ] Implicit Places using invariants in 5030 ms returned []
[2023-03-22 04:21:44] [INFO ] Invariant cache hit.
[2023-03-22 04:21:49] [INFO ] Implicit Places using invariants and state equation in 4362 ms returned []
Implicit Place search using SMT with State Equation took 9407 ms to find 0 implicit places.
[2023-03-22 04:21:49] [INFO ] Invariant cache hit.
[2023-03-22 04:21:58] [INFO ] Dead Transitions using invariants and state equation in 9201 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19631 ms. Remains : 6103/6103 places, 5603/5603 transitions.
Treatment of property ShieldPPPs-PT-100B-LTLCardinality-01 finished in 176060 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((!(X((X(G(p0))||p1)) U (!p0 U p2))||p3)))'
Support contains 6 out of 6107 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6107/6107 places, 5607/5607 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 6104 transition count 5604
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 6104 transition count 5604
Applied a total of 6 rules in 1922 ms. Remains 6104 /6107 variables (removed 3) and now considering 5604/5607 (removed 3) transitions.
// Phase 1: matrix 5604 rows 6104 cols
[2023-03-22 04:22:00] [INFO ] Computed 1101 place invariants in 42 ms
[2023-03-22 04:22:04] [INFO ] Implicit Places using invariants in 3552 ms returned []
[2023-03-22 04:22:04] [INFO ] Invariant cache hit.
[2023-03-22 04:22:07] [INFO ] Implicit Places using invariants and state equation in 3484 ms returned []
Implicit Place search using SMT with State Equation took 7071 ms to find 0 implicit places.
[2023-03-22 04:22:07] [INFO ] Invariant cache hit.
[2023-03-22 04:22:15] [INFO ] Dead Transitions using invariants and state equation in 7243 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6104/6107 places, 5604/5607 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16265 ms. Remains : 6104/6107 places, 5604/5607 transitions.
Stuttering acceptance computed with spot in 443 ms :[(AND p2 (NOT p3)), (AND p2 (NOT p3)), true, p2, (OR (AND p1 p2) (AND p0 p2)), p0, (AND p0 p2)]
Running random walk in product with property : ShieldPPPs-PT-100B-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p3) p2), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p3) (NOT p0) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p2, acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 3}], [{ cond=(AND p2 p1), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={} source=4 dest: 4}, { cond=(AND p2 (NOT p1)), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 6}], [{ cond=p0, acceptance={0} source=5 dest: 5}], [{ cond=(AND p0 p2), acceptance={} source=6 dest: 5}, { cond=(AND p0 (NOT p2)), acceptance={} source=6 dest: 6}]], initial=0, aps=[p3:(AND (EQ s5153 0) (EQ s3596 1)), p2:(OR (EQ s1483 0) (EQ s979 1)), p0:(EQ s1884 1), p1:(EQ s5854 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 1 steps with 0 reset in 0 ms.
FORMULA ShieldPPPs-PT-100B-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-100B-LTLCardinality-05 finished in 16812 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((!p0 U (p1||G(!p0))))))'
Support contains 6 out of 6107 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6107/6107 places, 5607/5607 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 699 transitions
Trivial Post-agglo rules discarded 699 transitions
Performed 699 trivial Post agglomeration. Transition count delta: 699
Iterating post reduction 0 with 699 rules applied. Total rules applied 699 place count 6106 transition count 4907
Reduce places removed 699 places and 0 transitions.
Iterating post reduction 1 with 699 rules applied. Total rules applied 1398 place count 5407 transition count 4907
Performed 497 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 497 Pre rules applied. Total rules applied 1398 place count 5407 transition count 4410
Deduced a syphon composed of 497 places in 26 ms
Reduce places removed 497 places and 0 transitions.
Iterating global reduction 2 with 994 rules applied. Total rules applied 2392 place count 4910 transition count 4410
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 2397 place count 4905 transition count 4405
Iterating global reduction 2 with 5 rules applied. Total rules applied 2402 place count 4905 transition count 4405
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 2402 place count 4905 transition count 4402
Deduced a syphon composed of 3 places in 24 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 2408 place count 4902 transition count 4402
Performed 1792 Post agglomeration using F-continuation condition.Transition count delta: 1792
Deduced a syphon composed of 1792 places in 8 ms
Reduce places removed 1792 places and 0 transitions.
Iterating global reduction 2 with 3584 rules applied. Total rules applied 5992 place count 3110 transition count 2610
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5994 place count 3108 transition count 2608
Applied a total of 5994 rules in 2695 ms. Remains 3108 /6107 variables (removed 2999) and now considering 2608/5607 (removed 2999) transitions.
// Phase 1: matrix 2608 rows 3108 cols
[2023-03-22 04:22:18] [INFO ] Computed 1101 place invariants in 13 ms
[2023-03-22 04:22:23] [INFO ] Implicit Places using invariants in 5190 ms returned []
[2023-03-22 04:22:23] [INFO ] Invariant cache hit.
[2023-03-22 04:22:32] [INFO ] Implicit Places using invariants and state equation in 8942 ms returned []
Implicit Place search using SMT with State Equation took 14164 ms to find 0 implicit places.
[2023-03-22 04:22:32] [INFO ] Redundant transitions in 65 ms returned []
[2023-03-22 04:22:32] [INFO ] Invariant cache hit.
[2023-03-22 04:22:36] [INFO ] Dead Transitions using invariants and state equation in 3804 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3108/6107 places, 2608/5607 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 20780 ms. Remains : 3108/6107 places, 2608/5607 transitions.
Stuttering acceptance computed with spot in 147 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : ShieldPPPs-PT-100B-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (NOT (OR (EQ s2180 0) (EQ s1178 1))) (NOT (OR (EQ s2703 0) (EQ s2205 1))) (OR (EQ s2047 0) (EQ s1038 1))), p0:(OR (EQ s2703 0) (EQ s2205 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 45843 steps with 19 reset in 850 ms.
FORMULA ShieldPPPs-PT-100B-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-100B-LTLCardinality-08 finished in 21825 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 3 out of 6107 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6107/6107 places, 5607/5607 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 699 transitions
Trivial Post-agglo rules discarded 699 transitions
Performed 699 trivial Post agglomeration. Transition count delta: 699
Iterating post reduction 0 with 699 rules applied. Total rules applied 699 place count 6106 transition count 4907
Reduce places removed 699 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 700 rules applied. Total rules applied 1399 place count 5407 transition count 4906
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1400 place count 5406 transition count 4906
Performed 501 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 501 Pre rules applied. Total rules applied 1400 place count 5406 transition count 4405
Deduced a syphon composed of 501 places in 27 ms
Reduce places removed 501 places and 0 transitions.
Iterating global reduction 3 with 1002 rules applied. Total rules applied 2402 place count 4905 transition count 4405
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 2406 place count 4901 transition count 4401
Iterating global reduction 3 with 4 rules applied. Total rules applied 2410 place count 4901 transition count 4401
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 2410 place count 4901 transition count 4399
Deduced a syphon composed of 2 places in 27 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 2414 place count 4899 transition count 4399
Performed 1794 Post agglomeration using F-continuation condition.Transition count delta: 1794
Deduced a syphon composed of 1794 places in 6 ms
Reduce places removed 1794 places and 0 transitions.
Iterating global reduction 3 with 3588 rules applied. Total rules applied 6002 place count 3105 transition count 2605
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 6004 place count 3103 transition count 2603
Applied a total of 6004 rules in 2601 ms. Remains 3103 /6107 variables (removed 3004) and now considering 2603/5607 (removed 3004) transitions.
// Phase 1: matrix 2603 rows 3103 cols
[2023-03-22 04:22:40] [INFO ] Computed 1101 place invariants in 11 ms
[2023-03-22 04:22:44] [INFO ] Implicit Places using invariants in 4351 ms returned []
[2023-03-22 04:22:44] [INFO ] Invariant cache hit.
[2023-03-22 04:22:52] [INFO ] Implicit Places using invariants and state equation in 7573 ms returned []
Implicit Place search using SMT with State Equation took 11968 ms to find 0 implicit places.
[2023-03-22 04:22:52] [INFO ] Redundant transitions in 65 ms returned []
[2023-03-22 04:22:52] [INFO ] Invariant cache hit.
[2023-03-22 04:22:55] [INFO ] Dead Transitions using invariants and state equation in 2905 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3103/6107 places, 2603/5607 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 17604 ms. Remains : 3103/6107 places, 2603/5607 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-100B-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s693 1) (OR (EQ s2235 0) (EQ s2714 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 6744 steps with 0 reset in 167 ms.
FORMULA ShieldPPPs-PT-100B-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-100B-LTLCardinality-11 finished in 17913 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(p1))&&p0)))'
Support contains 8 out of 6107 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6107/6107 places, 5607/5607 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 6102 transition count 5602
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 6102 transition count 5602
Applied a total of 10 rules in 1973 ms. Remains 6102 /6107 variables (removed 5) and now considering 5602/5607 (removed 5) transitions.
// Phase 1: matrix 5602 rows 6102 cols
[2023-03-22 04:22:57] [INFO ] Computed 1101 place invariants in 27 ms
[2023-03-22 04:23:03] [INFO ] Implicit Places using invariants in 5795 ms returned []
[2023-03-22 04:23:03] [INFO ] Invariant cache hit.
[2023-03-22 04:23:07] [INFO ] Implicit Places using invariants and state equation in 4246 ms returned []
Implicit Place search using SMT with State Equation took 10078 ms to find 0 implicit places.
[2023-03-22 04:23:07] [INFO ] Invariant cache hit.
[2023-03-22 04:23:17] [INFO ] Dead Transitions using invariants and state equation in 9965 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6102/6107 places, 5602/5607 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22047 ms. Remains : 6102/6107 places, 5602/5607 transitions.
Stuttering acceptance computed with spot in 232 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : ShieldPPPs-PT-100B-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(AND (EQ s2844 0) (EQ s2599 1) (OR (AND (EQ s3342 0) (EQ s5626 1)) (AND (EQ s2334 0) (EQ s677 1)))), p1:(AND (EQ s1752 0) (EQ s2775 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ShieldPPPs-PT-100B-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-100B-LTLCardinality-14 finished in 22347 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&F(p1)))'
Support contains 3 out of 6107 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6107/6107 places, 5607/5607 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 701 transitions
Trivial Post-agglo rules discarded 701 transitions
Performed 701 trivial Post agglomeration. Transition count delta: 701
Iterating post reduction 0 with 701 rules applied. Total rules applied 701 place count 6106 transition count 4905
Reduce places removed 701 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 702 rules applied. Total rules applied 1403 place count 5405 transition count 4904
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1404 place count 5404 transition count 4904
Performed 500 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 500 Pre rules applied. Total rules applied 1404 place count 5404 transition count 4404
Deduced a syphon composed of 500 places in 30 ms
Reduce places removed 500 places and 0 transitions.
Iterating global reduction 3 with 1000 rules applied. Total rules applied 2404 place count 4904 transition count 4404
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 2408 place count 4900 transition count 4400
Iterating global reduction 3 with 4 rules applied. Total rules applied 2412 place count 4900 transition count 4400
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 2412 place count 4900 transition count 4398
Deduced a syphon composed of 2 places in 24 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 2416 place count 4898 transition count 4398
Performed 1795 Post agglomeration using F-continuation condition.Transition count delta: 1795
Deduced a syphon composed of 1795 places in 6 ms
Reduce places removed 1795 places and 0 transitions.
Iterating global reduction 3 with 3590 rules applied. Total rules applied 6006 place count 3103 transition count 2603
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 6008 place count 3101 transition count 2601
Applied a total of 6008 rules in 2563 ms. Remains 3101 /6107 variables (removed 3006) and now considering 2601/5607 (removed 3006) transitions.
// Phase 1: matrix 2601 rows 3101 cols
[2023-03-22 04:23:20] [INFO ] Computed 1101 place invariants in 5 ms
[2023-03-22 04:23:24] [INFO ] Implicit Places using invariants in 4694 ms returned []
[2023-03-22 04:23:24] [INFO ] Invariant cache hit.
[2023-03-22 04:23:30] [INFO ] Implicit Places using invariants and state equation in 5430 ms returned []
Implicit Place search using SMT with State Equation took 10144 ms to find 0 implicit places.
[2023-03-22 04:23:30] [INFO ] Redundant transitions in 97 ms returned []
[2023-03-22 04:23:30] [INFO ] Invariant cache hit.
[2023-03-22 04:23:33] [INFO ] Dead Transitions using invariants and state equation in 2707 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3101/6107 places, 2601/5607 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 15548 ms. Remains : 3101/6107 places, 2601/5607 transitions.
Stuttering acceptance computed with spot in 227 ms :[(NOT p1), (NOT p0), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPs-PT-100B-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=2, aps=[p1:(EQ s1674 1), p0:(OR (EQ s1532 0) (EQ s2354 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 71900 steps with 21 reset in 1249 ms.
FORMULA ShieldPPPs-PT-100B-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-100B-LTLCardinality-15 finished in 17081 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(F(!(X(p0) U X(p1)))))&&X(F(X(X(p0))))))'
Found a Shortening insensitive property : ShieldPPPs-PT-100B-LTLCardinality-01
Stuttering acceptance computed with spot in 539 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), p1, p1, (NOT p0)]
Support contains 4 out of 6107 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 6107/6107 places, 5607/5607 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 701 transitions
Trivial Post-agglo rules discarded 701 transitions
Performed 701 trivial Post agglomeration. Transition count delta: 701
Iterating post reduction 0 with 701 rules applied. Total rules applied 701 place count 6106 transition count 4905
Reduce places removed 701 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 702 rules applied. Total rules applied 1403 place count 5405 transition count 4904
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1404 place count 5404 transition count 4904
Performed 499 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 499 Pre rules applied. Total rules applied 1404 place count 5404 transition count 4405
Deduced a syphon composed of 499 places in 26 ms
Reduce places removed 499 places and 0 transitions.
Iterating global reduction 3 with 998 rules applied. Total rules applied 2402 place count 4905 transition count 4405
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 2406 place count 4901 transition count 4401
Iterating global reduction 3 with 4 rules applied. Total rules applied 2410 place count 4901 transition count 4401
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 2410 place count 4901 transition count 4398
Deduced a syphon composed of 3 places in 39 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 2416 place count 4898 transition count 4398
Performed 1792 Post agglomeration using F-continuation condition.Transition count delta: 1792
Deduced a syphon composed of 1792 places in 9 ms
Reduce places removed 1792 places and 0 transitions.
Iterating global reduction 3 with 3584 rules applied. Total rules applied 6000 place count 3106 transition count 2606
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 6002 place count 3104 transition count 2604
Applied a total of 6002 rules in 2661 ms. Remains 3104 /6107 variables (removed 3003) and now considering 2604/5607 (removed 3003) transitions.
// Phase 1: matrix 2604 rows 3104 cols
[2023-03-22 04:23:38] [INFO ] Computed 1101 place invariants in 6 ms
[2023-03-22 04:23:42] [INFO ] Implicit Places using invariants in 4538 ms returned []
[2023-03-22 04:23:42] [INFO ] Invariant cache hit.
[2023-03-22 04:23:49] [INFO ] Implicit Places using invariants and state equation in 6809 ms returned []
Implicit Place search using SMT with State Equation took 11387 ms to find 0 implicit places.
[2023-03-22 04:23:49] [INFO ] Invariant cache hit.
[2023-03-22 04:23:53] [INFO ] Dead Transitions using invariants and state equation in 3523 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 3104/6107 places, 2604/5607 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 17574 ms. Remains : 3104/6107 places, 2604/5607 transitions.
Running random walk in product with property : ShieldPPPs-PT-100B-LTLCardinality-01 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=p1, acceptance={} source=3 dest: 4}, { cond=true, acceptance={} source=3 dest: 5}, { cond=(NOT p0), acceptance={} source=3 dest: 6}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}, { cond=p1, acceptance={0} source=4 dest: 4}], [{ cond=p1, acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p1:(OR (EQ s2312 0) (EQ s2033 1)), p0:(OR (EQ s2432 0) (EQ s117 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 65 reset in 1638 ms.
Product exploration explored 100000 steps with 64 reset in 2084 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p1 p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 222 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 503 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), p1, p1, (NOT p0)]
Finished random walk after 1424 steps, including 0 resets, run visited all 3 properties in 54 ms. (steps per millisecond=26 )
Knowledge obtained : [(AND p1 p0), true]
False Knowledge obtained : [(F (NOT p1)), (F (AND (NOT p1) p0)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 341 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 564 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), p1, p1, (NOT p0)]
Stuttering acceptance computed with spot in 395 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), p1, p1, (NOT p0)]
[2023-03-22 04:23:58] [INFO ] Invariant cache hit.
[2023-03-22 04:24:04] [INFO ] [Real]Absence check using 1101 positive place invariants in 1612 ms returned sat
[2023-03-22 04:24:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 04:24:14] [INFO ] [Real]Absence check using state equation in 9511 ms returned unknown
Could not prove EG p1
Support contains 4 out of 3104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3104/3104 places, 2604/2604 transitions.
Applied a total of 0 rules in 179 ms. Remains 3104 /3104 variables (removed 0) and now considering 2604/2604 (removed 0) transitions.
[2023-03-22 04:24:14] [INFO ] Invariant cache hit.
[2023-03-22 04:24:16] [INFO ] Implicit Places using invariants in 2463 ms returned []
[2023-03-22 04:24:16] [INFO ] Invariant cache hit.
[2023-03-22 04:24:23] [INFO ] Implicit Places using invariants and state equation in 6364 ms returned []
Implicit Place search using SMT with State Equation took 8845 ms to find 0 implicit places.
[2023-03-22 04:24:23] [INFO ] Invariant cache hit.
[2023-03-22 04:24:25] [INFO ] Dead Transitions using invariants and state equation in 2875 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11902 ms. Remains : 3104/3104 places, 2604/2604 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p1 p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 181 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 433 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), p1, p1, (NOT p0)]
Finished random walk after 1333 steps, including 0 resets, run visited all 3 properties in 87 ms. (steps per millisecond=15 )
Knowledge obtained : [(AND p1 p0), true]
False Knowledge obtained : [(F (NOT p1)), (F (AND (NOT p1) p0)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 228 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 594 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), p1, p1, (NOT p0)]
Stuttering acceptance computed with spot in 588 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), p1, p1, (NOT p0)]
[2023-03-22 04:24:28] [INFO ] Invariant cache hit.
[2023-03-22 04:24:34] [INFO ] [Real]Absence check using 1101 positive place invariants in 1920 ms returned sat
[2023-03-22 04:24:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 04:24:43] [INFO ] [Real]Absence check using state equation in 8470 ms returned unknown
Could not prove EG p1
Stuttering acceptance computed with spot in 435 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), p1, p1, (NOT p0)]
Stuttering criterion allowed to conclude after 26244 steps with 12 reset in 448 ms.
Treatment of property ShieldPPPs-PT-100B-LTLCardinality-01 finished in 69404 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
[2023-03-22 04:24:44] [INFO ] Flatten gal took : 168 ms
[2023-03-22 04:24:44] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-22 04:24:44] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 6107 places, 5607 transitions and 16014 arcs took 46 ms.
Total runtime 487500 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
Could not compute solution for formula : ShieldPPPs-PT-100B-LTLCardinality-01

BK_STOP 1679459089382

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2023
ltl formula name ShieldPPPs-PT-100B-LTLCardinality-01
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 6107 places, 5607 transitions and 16014 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.070 real 0.270 user 0.550 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1657/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1657/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1657/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1657/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 8 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted

Sequence of Actions to be Executed by the VM

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

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

tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPs-PT-100B.tgz
mv ShieldPPPs-PT-100B execution
cd execution
if [ "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 ;