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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 7.3K Feb 25 16:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Feb 25 16:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 25 16:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 25 16:26 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.4K Feb 25 16:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 16:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Feb 25 16:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 97K Feb 25 16:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 25 16:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 25 16:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 675K Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679428021730

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPs-PT-040B
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-21 19:47:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-21 19:47:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 19:47:05] [INFO ] Load time of PNML (sax parser for PT used): 307 ms
[2023-03-21 19:47:05] [INFO ] Transformed 2403 places.
[2023-03-21 19:47:05] [INFO ] Transformed 2363 transitions.
[2023-03-21 19:47:05] [INFO ] Found NUPN structural information;
[2023-03-21 19:47:05] [INFO ] Parsed PT model containing 2403 places and 2363 transitions and 7126 arcs in 620 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA ShieldIIPs-PT-040B-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 36 out of 2403 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2403/2403 places, 2363/2363 transitions.
Discarding 272 places :
Symmetric choice reduction at 0 with 272 rule applications. Total rules 272 place count 2131 transition count 2091
Iterating global reduction 0 with 272 rules applied. Total rules applied 544 place count 2131 transition count 2091
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 545 place count 2130 transition count 2090
Iterating global reduction 0 with 1 rules applied. Total rules applied 546 place count 2130 transition count 2090
Applied a total of 546 rules in 958 ms. Remains 2130 /2403 variables (removed 273) and now considering 2090/2363 (removed 273) transitions.
// Phase 1: matrix 2090 rows 2130 cols
[2023-03-21 19:47:06] [INFO ] Computed 361 place invariants in 27 ms
[2023-03-21 19:47:09] [INFO ] Implicit Places using invariants in 2477 ms returned []
[2023-03-21 19:47:09] [INFO ] Invariant cache hit.
[2023-03-21 19:47:13] [INFO ] Implicit Places using invariants and state equation in 4342 ms returned []
Implicit Place search using SMT with State Equation took 6871 ms to find 0 implicit places.
[2023-03-21 19:47:13] [INFO ] Invariant cache hit.
[2023-03-21 19:47:15] [INFO ] Dead Transitions using invariants and state equation in 1965 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2130/2403 places, 2090/2363 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9797 ms. Remains : 2130/2403 places, 2090/2363 transitions.
Support contains 36 out of 2130 places after structural reductions.
[2023-03-21 19:47:16] [INFO ] Flatten gal took : 188 ms
[2023-03-21 19:47:16] [INFO ] Flatten gal took : 99 ms
[2023-03-21 19:47:16] [INFO ] Input system was already deterministic with 2090 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 475 ms. (steps per millisecond=21 ) properties (out of 28) seen :24
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-21 19:47:17] [INFO ] Invariant cache hit.
[2023-03-21 19:47:17] [INFO ] After 491ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-21 19:47:18] [INFO ] [Nat]Absence check using 361 positive place invariants in 188 ms returned sat
[2023-03-21 19:47:20] [INFO ] After 2027ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-21 19:47:21] [INFO ] Deduced a trap composed of 21 places in 781 ms of which 10 ms to minimize.
[2023-03-21 19:47:22] [INFO ] Deduced a trap composed of 26 places in 786 ms of which 2 ms to minimize.
[2023-03-21 19:47:23] [INFO ] Deduced a trap composed of 21 places in 1044 ms of which 24 ms to minimize.
[2023-03-21 19:47:24] [INFO ] Deduced a trap composed of 17 places in 879 ms of which 2 ms to minimize.
[2023-03-21 19:47:25] [INFO ] Deduced a trap composed of 24 places in 593 ms of which 23 ms to minimize.
[2023-03-21 19:47:26] [INFO ] Deduced a trap composed of 28 places in 1288 ms of which 2 ms to minimize.
[2023-03-21 19:47:27] [INFO ] Deduced a trap composed of 17 places in 1262 ms of which 1 ms to minimize.
[2023-03-21 19:47:28] [INFO ] Deduced a trap composed of 24 places in 754 ms of which 1 ms to minimize.
[2023-03-21 19:47:29] [INFO ] Deduced a trap composed of 24 places in 694 ms of which 3 ms to minimize.
[2023-03-21 19:47:30] [INFO ] Deduced a trap composed of 24 places in 655 ms of which 2 ms to minimize.
[2023-03-21 19:47:30] [INFO ] Deduced a trap composed of 31 places in 553 ms of which 1 ms to minimize.
[2023-03-21 19:47:31] [INFO ] Deduced a trap composed of 26 places in 881 ms of which 2 ms to minimize.
[2023-03-21 19:47:32] [INFO ] Deduced a trap composed of 23 places in 748 ms of which 2 ms to minimize.
[2023-03-21 19:47:33] [INFO ] Deduced a trap composed of 29 places in 914 ms of which 27 ms to minimize.
[2023-03-21 19:47:34] [INFO ] Deduced a trap composed of 32 places in 752 ms of which 1 ms to minimize.
[2023-03-21 19:47:35] [INFO ] Deduced a trap composed of 27 places in 703 ms of which 2 ms to minimize.
[2023-03-21 19:47:36] [INFO ] Deduced a trap composed of 28 places in 830 ms of which 2 ms to minimize.
[2023-03-21 19:47:37] [INFO ] Deduced a trap composed of 28 places in 761 ms of which 2 ms to minimize.
[2023-03-21 19:47:37] [INFO ] Deduced a trap composed of 31 places in 698 ms of which 2 ms to minimize.
[2023-03-21 19:47:38] [INFO ] Deduced a trap composed of 30 places in 893 ms of which 1 ms to minimize.
[2023-03-21 19:47:39] [INFO ] Deduced a trap composed of 26 places in 964 ms of which 2 ms to minimize.
[2023-03-21 19:47:40] [INFO ] Deduced a trap composed of 29 places in 666 ms of which 14 ms to minimize.
[2023-03-21 19:47:41] [INFO ] Deduced a trap composed of 36 places in 916 ms of which 1 ms to minimize.
[2023-03-21 19:47:42] [INFO ] Deduced a trap composed of 27 places in 714 ms of which 1 ms to minimize.
[2023-03-21 19:47:43] [INFO ] Deduced a trap composed of 27 places in 708 ms of which 2 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-21 19:47:43] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-21 19:47:43] [INFO ] After 25631ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
Parikh walk visited 0 properties in 299 ms.
Support contains 8 out of 2130 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2130/2130 places, 2090/2090 transitions.
Drop transitions removed 199 transitions
Trivial Post-agglo rules discarded 199 transitions
Performed 199 trivial Post agglomeration. Transition count delta: 199
Iterating post reduction 0 with 199 rules applied. Total rules applied 199 place count 2130 transition count 1891
Reduce places removed 199 places and 0 transitions.
Iterating post reduction 1 with 199 rules applied. Total rules applied 398 place count 1931 transition count 1891
Performed 201 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 201 Pre rules applied. Total rules applied 398 place count 1931 transition count 1690
Deduced a syphon composed of 201 places in 4 ms
Reduce places removed 201 places and 0 transitions.
Iterating global reduction 2 with 402 rules applied. Total rules applied 800 place count 1730 transition count 1690
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 807 place count 1723 transition count 1683
Iterating global reduction 2 with 7 rules applied. Total rules applied 814 place count 1723 transition count 1683
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 814 place count 1723 transition count 1680
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 820 place count 1720 transition count 1680
Performed 714 Post agglomeration using F-continuation condition.Transition count delta: 714
Deduced a syphon composed of 714 places in 2 ms
Reduce places removed 714 places and 0 transitions.
Iterating global reduction 2 with 1428 rules applied. Total rules applied 2248 place count 1006 transition count 966
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 277 times.
Drop transitions removed 277 transitions
Iterating global reduction 2 with 277 rules applied. Total rules applied 2525 place count 1006 transition count 966
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 2526 place count 1005 transition count 965
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2527 place count 1004 transition count 965
Applied a total of 2527 rules in 524 ms. Remains 1004 /2130 variables (removed 1126) and now considering 965/2090 (removed 1125) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 524 ms. Remains : 1004/2130 places, 965/2090 transitions.
Finished random walk after 2444 steps, including 0 resets, run visited all 4 properties in 46 ms. (steps per millisecond=53 )
Computed a total of 484 stabilizing places and 484 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&(X(p1)||F(p2))))))'
Support contains 2 out of 2130 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2130/2130 places, 2090/2090 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 2123 transition count 2083
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 2123 transition count 2083
Applied a total of 14 rules in 242 ms. Remains 2123 /2130 variables (removed 7) and now considering 2083/2090 (removed 7) transitions.
// Phase 1: matrix 2083 rows 2123 cols
[2023-03-21 19:47:44] [INFO ] Computed 361 place invariants in 10 ms
[2023-03-21 19:47:46] [INFO ] Implicit Places using invariants in 1279 ms returned []
[2023-03-21 19:47:46] [INFO ] Invariant cache hit.
[2023-03-21 19:47:50] [INFO ] Implicit Places using invariants and state equation in 3898 ms returned []
Implicit Place search using SMT with State Equation took 5193 ms to find 0 implicit places.
[2023-03-21 19:47:50] [INFO ] Invariant cache hit.
[2023-03-21 19:47:51] [INFO ] Dead Transitions using invariants and state equation in 1298 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2123/2130 places, 2083/2090 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6735 ms. Remains : 2123/2130 places, 2083/2090 transitions.
Stuttering acceptance computed with spot in 338 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldIIPs-PT-040B-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={0} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s1661 0), p2:(EQ s499 0), p1:(EQ s1661 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1930 ms.
Product exploration explored 100000 steps with 50000 reset in 1696 ms.
Computed a total of 479 stabilizing places and 479 stable transitions
Computed a total of 479 stabilizing places and 479 stable transitions
Detected a total of 479/2123 stabilizing places and 479/2083 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X p0), (X (NOT (AND p0 (NOT p2)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND p0 (NOT p2))))
Knowledge based reduction with 9 factoid took 250 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPs-PT-040B-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPs-PT-040B-LTLFireability-00 finished in 11128 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 2130 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2130/2130 places, 2090/2090 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 2122 transition count 2082
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 2122 transition count 2082
Applied a total of 16 rules in 229 ms. Remains 2122 /2130 variables (removed 8) and now considering 2082/2090 (removed 8) transitions.
// Phase 1: matrix 2082 rows 2122 cols
[2023-03-21 19:47:56] [INFO ] Computed 361 place invariants in 35 ms
[2023-03-21 19:47:57] [INFO ] Implicit Places using invariants in 1693 ms returned []
[2023-03-21 19:47:57] [INFO ] Invariant cache hit.
[2023-03-21 19:48:04] [INFO ] Implicit Places using invariants and state equation in 7010 ms returned []
Implicit Place search using SMT with State Equation took 8720 ms to find 0 implicit places.
[2023-03-21 19:48:04] [INFO ] Invariant cache hit.
[2023-03-21 19:48:07] [INFO ] Dead Transitions using invariants and state equation in 2597 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2122/2130 places, 2082/2090 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11553 ms. Remains : 2122/2130 places, 2082/2090 transitions.
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-040B-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s1614 0) (EQ s1636 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 1560 ms.
Product exploration explored 100000 steps with 50000 reset in 1521 ms.
Computed a total of 479 stabilizing places and 479 stable transitions
Computed a total of 479 stabilizing places and 479 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 158 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPs-PT-040B-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPs-PT-040B-LTLFireability-01 finished in 14989 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 2130 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2130/2130 places, 2090/2090 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 2122 transition count 2082
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 2122 transition count 2082
Applied a total of 16 rules in 202 ms. Remains 2122 /2130 variables (removed 8) and now considering 2082/2090 (removed 8) transitions.
[2023-03-21 19:48:10] [INFO ] Invariant cache hit.
[2023-03-21 19:48:11] [INFO ] Implicit Places using invariants in 893 ms returned []
[2023-03-21 19:48:11] [INFO ] Invariant cache hit.
[2023-03-21 19:48:15] [INFO ] Implicit Places using invariants and state equation in 3703 ms returned []
Implicit Place search using SMT with State Equation took 4611 ms to find 0 implicit places.
[2023-03-21 19:48:15] [INFO ] Invariant cache hit.
[2023-03-21 19:48:17] [INFO ] Dead Transitions using invariants and state equation in 1906 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2122/2130 places, 2082/2090 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6757 ms. Remains : 2122/2130 places, 2082/2090 transitions.
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-040B-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(NEQ s1071 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 1632 ms.
Product exploration explored 100000 steps with 50000 reset in 1563 ms.
Computed a total of 479 stabilizing places and 479 stable transitions
Computed a total of 479 stabilizing places and 479 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 101 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPs-PT-040B-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPs-PT-040B-LTLFireability-02 finished in 10245 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||G(p1)))))'
Support contains 2 out of 2130 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2130/2130 places, 2090/2090 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 201 transitions
Trivial Post-agglo rules discarded 201 transitions
Performed 201 trivial Post agglomeration. Transition count delta: 201
Iterating post reduction 0 with 201 rules applied. Total rules applied 201 place count 2129 transition count 1888
Reduce places removed 201 places and 0 transitions.
Iterating post reduction 1 with 201 rules applied. Total rules applied 402 place count 1928 transition count 1888
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 200 Pre rules applied. Total rules applied 402 place count 1928 transition count 1688
Deduced a syphon composed of 200 places in 3 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 802 place count 1728 transition count 1688
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 808 place count 1722 transition count 1682
Iterating global reduction 2 with 6 rules applied. Total rules applied 814 place count 1722 transition count 1682
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 814 place count 1722 transition count 1679
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 820 place count 1719 transition count 1679
Performed 714 Post agglomeration using F-continuation condition.Transition count delta: 714
Deduced a syphon composed of 714 places in 2 ms
Reduce places removed 714 places and 0 transitions.
Iterating global reduction 2 with 1428 rules applied. Total rules applied 2248 place count 1005 transition count 965
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 2250 place count 1003 transition count 963
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2251 place count 1002 transition count 963
Applied a total of 2251 rules in 378 ms. Remains 1002 /2130 variables (removed 1128) and now considering 963/2090 (removed 1127) transitions.
// Phase 1: matrix 963 rows 1002 cols
[2023-03-21 19:48:21] [INFO ] Computed 360 place invariants in 3 ms
[2023-03-21 19:48:21] [INFO ] Implicit Places using invariants in 532 ms returned []
[2023-03-21 19:48:21] [INFO ] Invariant cache hit.
[2023-03-21 19:48:24] [INFO ] Implicit Places using invariants and state equation in 2253 ms returned []
Implicit Place search using SMT with State Equation took 2830 ms to find 0 implicit places.
[2023-03-21 19:48:24] [INFO ] Redundant transitions in 446 ms returned [962]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 962 rows 1002 cols
[2023-03-21 19:48:24] [INFO ] Computed 360 place invariants in 2 ms
[2023-03-21 19:48:25] [INFO ] Dead Transitions using invariants and state equation in 586 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1002/2130 places, 962/2090 transitions.
Applied a total of 0 rules in 29 ms. Remains 1002 /1002 variables (removed 0) and now considering 962/962 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4291 ms. Remains : 1002/2130 places, 962/2090 transitions.
Stuttering acceptance computed with spot in 164 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPs-PT-040B-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s18 0), p0:(EQ s300 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 48 reset in 782 ms.
Product exploration explored 100000 steps with 48 reset in 904 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/1002 stabilizing places and 2/962 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 276 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 178 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 4 resets, run finished after 147 ms. (steps per millisecond=68 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-21 19:48:27] [INFO ] Invariant cache hit.
[2023-03-21 19:48:27] [INFO ] After 115ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 19:48:28] [INFO ] [Nat]Absence check using 360 positive place invariants in 115 ms returned sat
[2023-03-21 19:48:28] [INFO ] After 567ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 19:48:28] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 1 ms to minimize.
[2023-03-21 19:48:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 171 ms
[2023-03-21 19:48:28] [INFO ] After 812ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 42 ms.
[2023-03-21 19:48:29] [INFO ] After 1120ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 13 ms.
Support contains 2 out of 1002 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1002/1002 places, 962/962 transitions.
Partial Free-agglomeration rule applied 239 times.
Drop transitions removed 239 transitions
Iterating global reduction 0 with 239 rules applied. Total rules applied 239 place count 1002 transition count 962
Applied a total of 239 rules in 59 ms. Remains 1002 /1002 variables (removed 0) and now considering 962/962 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67 ms. Remains : 1002/1002 places, 962/962 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 1) seen :0
Finished probabilistic random walk after 4508 steps, run visited all 1 properties in 54 ms. (steps per millisecond=83 )
Probabilistic random walk after 4508 steps, saw 4364 distinct states, run finished after 55 ms. (steps per millisecond=81 ) properties seen :1
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 6 factoid took 400 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 94 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 1002 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1002/1002 places, 962/962 transitions.
Applied a total of 0 rules in 27 ms. Remains 1002 /1002 variables (removed 0) and now considering 962/962 (removed 0) transitions.
[2023-03-21 19:48:30] [INFO ] Invariant cache hit.
[2023-03-21 19:48:30] [INFO ] Implicit Places using invariants in 674 ms returned []
[2023-03-21 19:48:30] [INFO ] Invariant cache hit.
[2023-03-21 19:48:32] [INFO ] Implicit Places using invariants and state equation in 1527 ms returned []
Implicit Place search using SMT with State Equation took 2205 ms to find 0 implicit places.
[2023-03-21 19:48:32] [INFO ] Redundant transitions in 321 ms returned []
[2023-03-21 19:48:32] [INFO ] Invariant cache hit.
[2023-03-21 19:48:33] [INFO ] Dead Transitions using invariants and state equation in 1247 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3806 ms. Remains : 1002/1002 places, 962/962 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/1002 stabilizing places and 2/962 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 333 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 124 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 4 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-21 19:48:34] [INFO ] Invariant cache hit.
[2023-03-21 19:48:34] [INFO ] After 251ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 19:48:35] [INFO ] [Nat]Absence check using 360 positive place invariants in 90 ms returned sat
[2023-03-21 19:48:35] [INFO ] After 460ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 19:48:35] [INFO ] Deduced a trap composed of 17 places in 397 ms of which 1 ms to minimize.
[2023-03-21 19:48:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 475 ms
[2023-03-21 19:48:36] [INFO ] After 1018ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 46 ms.
[2023-03-21 19:48:36] [INFO ] After 1441ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 14 ms.
Support contains 2 out of 1002 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1002/1002 places, 962/962 transitions.
Partial Free-agglomeration rule applied 239 times.
Drop transitions removed 239 transitions
Iterating global reduction 0 with 239 rules applied. Total rules applied 239 place count 1002 transition count 962
Applied a total of 239 rules in 72 ms. Remains 1002 /1002 variables (removed 0) and now considering 962/962 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 84 ms. Remains : 1002/1002 places, 962/962 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 1) seen :0
Finished probabilistic random walk after 4508 steps, run visited all 1 properties in 74 ms. (steps per millisecond=60 )
Probabilistic random walk after 4508 steps, saw 4364 distinct states, run finished after 75 ms. (steps per millisecond=60 ) properties seen :1
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 6 factoid took 408 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 133 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 131 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 132 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 48 reset in 848 ms.
Product exploration explored 100000 steps with 48 reset in 949 ms.
Support contains 2 out of 1002 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1002/1002 places, 962/962 transitions.
Applied a total of 0 rules in 23 ms. Remains 1002 /1002 variables (removed 0) and now considering 962/962 (removed 0) transitions.
[2023-03-21 19:48:39] [INFO ] Invariant cache hit.
[2023-03-21 19:48:39] [INFO ] Implicit Places using invariants in 631 ms returned []
[2023-03-21 19:48:39] [INFO ] Invariant cache hit.
[2023-03-21 19:48:41] [INFO ] Implicit Places using invariants and state equation in 2204 ms returned []
Implicit Place search using SMT with State Equation took 2839 ms to find 0 implicit places.
[2023-03-21 19:48:42] [INFO ] Redundant transitions in 277 ms returned []
[2023-03-21 19:48:42] [INFO ] Invariant cache hit.
[2023-03-21 19:48:42] [INFO ] Dead Transitions using invariants and state equation in 594 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3743 ms. Remains : 1002/1002 places, 962/962 transitions.
Treatment of property ShieldIIPs-PT-040B-LTLFireability-03 finished in 22065 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 2130 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2130/2130 places, 2090/2090 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 201 transitions
Trivial Post-agglo rules discarded 201 transitions
Performed 201 trivial Post agglomeration. Transition count delta: 201
Iterating post reduction 0 with 201 rules applied. Total rules applied 201 place count 2129 transition count 1888
Reduce places removed 201 places and 0 transitions.
Iterating post reduction 1 with 201 rules applied. Total rules applied 402 place count 1928 transition count 1888
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 200 Pre rules applied. Total rules applied 402 place count 1928 transition count 1688
Deduced a syphon composed of 200 places in 8 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 802 place count 1728 transition count 1688
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 810 place count 1720 transition count 1680
Iterating global reduction 2 with 8 rules applied. Total rules applied 818 place count 1720 transition count 1680
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 818 place count 1720 transition count 1676
Deduced a syphon composed of 4 places in 4 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 826 place count 1716 transition count 1676
Performed 712 Post agglomeration using F-continuation condition.Transition count delta: 712
Deduced a syphon composed of 712 places in 3 ms
Reduce places removed 712 places and 0 transitions.
Iterating global reduction 2 with 1424 rules applied. Total rules applied 2250 place count 1004 transition count 964
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 2252 place count 1002 transition count 962
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2253 place count 1001 transition count 962
Applied a total of 2253 rules in 383 ms. Remains 1001 /2130 variables (removed 1129) and now considering 962/2090 (removed 1128) transitions.
// Phase 1: matrix 962 rows 1001 cols
[2023-03-21 19:48:43] [INFO ] Computed 360 place invariants in 3 ms
[2023-03-21 19:48:43] [INFO ] Implicit Places using invariants in 501 ms returned []
[2023-03-21 19:48:43] [INFO ] Invariant cache hit.
[2023-03-21 19:48:45] [INFO ] Implicit Places using invariants and state equation in 1741 ms returned []
Implicit Place search using SMT with State Equation took 2243 ms to find 0 implicit places.
[2023-03-21 19:48:45] [INFO ] Redundant transitions in 275 ms returned [961]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 961 rows 1001 cols
[2023-03-21 19:48:45] [INFO ] Computed 360 place invariants in 2 ms
[2023-03-21 19:48:46] [INFO ] Dead Transitions using invariants and state equation in 628 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1001/2130 places, 961/2090 transitions.
Applied a total of 0 rules in 26 ms. Remains 1001 /1001 variables (removed 0) and now considering 961/961 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3588 ms. Remains : 1001/2130 places, 961/2090 transitions.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-040B-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s500 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 49 reset in 805 ms.
Product exploration explored 100000 steps with 48 reset in 1011 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 157 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Finished random walk after 909 steps, including 0 resets, run visited all 1 properties in 9 ms. (steps per millisecond=101 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 203 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 64 ms :[(NOT p0)]
Support contains 1 out of 1001 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1001/1001 places, 961/961 transitions.
Applied a total of 0 rules in 33 ms. Remains 1001 /1001 variables (removed 0) and now considering 961/961 (removed 0) transitions.
[2023-03-21 19:48:49] [INFO ] Invariant cache hit.
[2023-03-21 19:48:49] [INFO ] Implicit Places using invariants in 676 ms returned []
[2023-03-21 19:48:49] [INFO ] Invariant cache hit.
[2023-03-21 19:48:51] [INFO ] Implicit Places using invariants and state equation in 1826 ms returned []
Implicit Place search using SMT with State Equation took 2521 ms to find 0 implicit places.
[2023-03-21 19:48:51] [INFO ] Redundant transitions in 230 ms returned []
[2023-03-21 19:48:51] [INFO ] Invariant cache hit.
[2023-03-21 19:48:52] [INFO ] Dead Transitions using invariants and state equation in 503 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3295 ms. Remains : 1001/1001 places, 961/961 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 104 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Finished random walk after 802 steps, including 0 resets, run visited all 1 properties in 18 ms. (steps per millisecond=44 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 239 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 106 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 80 ms :[(NOT p0)]
Product exploration explored 100000 steps with 49 reset in 748 ms.
Product exploration explored 100000 steps with 48 reset in 967 ms.
Support contains 1 out of 1001 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1001/1001 places, 961/961 transitions.
Applied a total of 0 rules in 26 ms. Remains 1001 /1001 variables (removed 0) and now considering 961/961 (removed 0) transitions.
[2023-03-21 19:48:54] [INFO ] Invariant cache hit.
[2023-03-21 19:48:55] [INFO ] Implicit Places using invariants in 547 ms returned []
[2023-03-21 19:48:55] [INFO ] Invariant cache hit.
[2023-03-21 19:48:57] [INFO ] Implicit Places using invariants and state equation in 1711 ms returned []
Implicit Place search using SMT with State Equation took 2266 ms to find 0 implicit places.
[2023-03-21 19:48:57] [INFO ] Redundant transitions in 223 ms returned []
[2023-03-21 19:48:57] [INFO ] Invariant cache hit.
[2023-03-21 19:48:58] [INFO ] Dead Transitions using invariants and state equation in 649 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3210 ms. Remains : 1001/1001 places, 961/961 transitions.
Treatment of property ShieldIIPs-PT-040B-LTLFireability-05 finished in 15161 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 2130 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2130/2130 places, 2090/2090 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 0 with 200 rules applied. Total rules applied 200 place count 2129 transition count 1889
Reduce places removed 200 places and 0 transitions.
Iterating post reduction 1 with 200 rules applied. Total rules applied 400 place count 1929 transition count 1889
Performed 201 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 201 Pre rules applied. Total rules applied 400 place count 1929 transition count 1688
Deduced a syphon composed of 201 places in 4 ms
Reduce places removed 201 places and 0 transitions.
Iterating global reduction 2 with 402 rules applied. Total rules applied 802 place count 1728 transition count 1688
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 809 place count 1721 transition count 1681
Iterating global reduction 2 with 7 rules applied. Total rules applied 816 place count 1721 transition count 1681
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 816 place count 1721 transition count 1678
Deduced a syphon composed of 3 places in 4 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 822 place count 1718 transition count 1678
Performed 714 Post agglomeration using F-continuation condition.Transition count delta: 714
Deduced a syphon composed of 714 places in 3 ms
Reduce places removed 714 places and 0 transitions.
Iterating global reduction 2 with 1428 rules applied. Total rules applied 2250 place count 1004 transition count 964
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 2252 place count 1002 transition count 962
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2253 place count 1001 transition count 962
Applied a total of 2253 rules in 387 ms. Remains 1001 /2130 variables (removed 1129) and now considering 962/2090 (removed 1128) transitions.
// Phase 1: matrix 962 rows 1001 cols
[2023-03-21 19:48:58] [INFO ] Computed 360 place invariants in 2 ms
[2023-03-21 19:48:59] [INFO ] Implicit Places using invariants in 610 ms returned []
[2023-03-21 19:48:59] [INFO ] Invariant cache hit.
[2023-03-21 19:49:00] [INFO ] Implicit Places using invariants and state equation in 1498 ms returned []
Implicit Place search using SMT with State Equation took 2115 ms to find 0 implicit places.
[2023-03-21 19:49:00] [INFO ] Redundant transitions in 143 ms returned [961]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 961 rows 1001 cols
[2023-03-21 19:49:00] [INFO ] Computed 360 place invariants in 3 ms
[2023-03-21 19:49:01] [INFO ] Dead Transitions using invariants and state equation in 650 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1001/2130 places, 961/2090 transitions.
Applied a total of 0 rules in 25 ms. Remains 1001 /1001 variables (removed 0) and now considering 961/961 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3331 ms. Remains : 1001/2130 places, 961/2090 transitions.
Stuttering acceptance computed with spot in 136 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-040B-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s903 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 2040 steps with 1 reset in 37 ms.
FORMULA ShieldIIPs-PT-040B-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-040B-LTLFireability-06 finished in 3532 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p1)||p0))))'
Support contains 6 out of 2130 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2130/2130 places, 2090/2090 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 199 transitions
Trivial Post-agglo rules discarded 199 transitions
Performed 199 trivial Post agglomeration. Transition count delta: 199
Iterating post reduction 0 with 199 rules applied. Total rules applied 199 place count 2129 transition count 1890
Reduce places removed 199 places and 0 transitions.
Iterating post reduction 1 with 199 rules applied. Total rules applied 398 place count 1930 transition count 1890
Performed 201 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 201 Pre rules applied. Total rules applied 398 place count 1930 transition count 1689
Deduced a syphon composed of 201 places in 17 ms
Reduce places removed 201 places and 0 transitions.
Iterating global reduction 2 with 402 rules applied. Total rules applied 800 place count 1729 transition count 1689
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 808 place count 1721 transition count 1681
Iterating global reduction 2 with 8 rules applied. Total rules applied 816 place count 1721 transition count 1681
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 816 place count 1721 transition count 1678
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 822 place count 1718 transition count 1678
Performed 713 Post agglomeration using F-continuation condition.Transition count delta: 713
Deduced a syphon composed of 713 places in 2 ms
Reduce places removed 713 places and 0 transitions.
Iterating global reduction 2 with 1426 rules applied. Total rules applied 2248 place count 1005 transition count 965
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 2250 place count 1003 transition count 963
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2251 place count 1002 transition count 963
Applied a total of 2251 rules in 455 ms. Remains 1002 /2130 variables (removed 1128) and now considering 963/2090 (removed 1127) transitions.
// Phase 1: matrix 963 rows 1002 cols
[2023-03-21 19:49:02] [INFO ] Computed 360 place invariants in 2 ms
[2023-03-21 19:49:03] [INFO ] Implicit Places using invariants in 903 ms returned []
[2023-03-21 19:49:03] [INFO ] Invariant cache hit.
[2023-03-21 19:49:04] [INFO ] Implicit Places using invariants and state equation in 1034 ms returned []
Implicit Place search using SMT with State Equation took 1939 ms to find 0 implicit places.
[2023-03-21 19:49:04] [INFO ] Redundant transitions in 98 ms returned [962]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 962 rows 1002 cols
[2023-03-21 19:49:04] [INFO ] Computed 360 place invariants in 2 ms
[2023-03-21 19:49:04] [INFO ] Dead Transitions using invariants and state equation in 521 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1002/2130 places, 962/2090 transitions.
Applied a total of 0 rules in 24 ms. Remains 1002 /1002 variables (removed 0) and now considering 962/962 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3057 ms. Remains : 1002/2130 places, 962/2090 transitions.
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPs-PT-040B-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (EQ s287 0) (EQ s292 0) (EQ s304 0)), p0:(OR (EQ s87 0) (EQ s98 0) (EQ s103 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 48 reset in 832 ms.
Product exploration explored 100000 steps with 48 reset in 991 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 298 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 4 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-21 19:49:07] [INFO ] Invariant cache hit.
[2023-03-21 19:49:07] [INFO ] After 278ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 19:49:08] [INFO ] [Nat]Absence check using 360 positive place invariants in 251 ms returned sat
[2023-03-21 19:49:08] [INFO ] After 629ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 19:49:08] [INFO ] Deduced a trap composed of 8 places in 145 ms of which 0 ms to minimize.
[2023-03-21 19:49:09] [INFO ] Deduced a trap composed of 12 places in 113 ms of which 0 ms to minimize.
[2023-03-21 19:49:09] [INFO ] Deduced a trap composed of 17 places in 95 ms of which 1 ms to minimize.
[2023-03-21 19:49:09] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 0 ms to minimize.
[2023-03-21 19:49:09] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 6 ms to minimize.
[2023-03-21 19:49:09] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 737 ms
[2023-03-21 19:49:09] [INFO ] After 1402ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 54 ms.
[2023-03-21 19:49:09] [INFO ] After 1985ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 11 ms.
Support contains 6 out of 1002 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1002/1002 places, 962/962 transitions.
Partial Free-agglomeration rule applied 237 times.
Drop transitions removed 237 transitions
Iterating global reduction 0 with 237 rules applied. Total rules applied 237 place count 1002 transition count 962
Applied a total of 237 rules in 73 ms. Remains 1002 /1002 variables (removed 0) and now considering 962/962 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73 ms. Remains : 1002/1002 places, 962/962 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 1) seen :0
Finished probabilistic random walk after 47356 steps, run visited all 1 properties in 432 ms. (steps per millisecond=109 )
Probabilistic random walk after 47356 steps, saw 46476 distinct states, run finished after 433 ms. (steps per millisecond=109 ) properties seen :1
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 5 factoid took 346 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 143 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 6 out of 1002 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1002/1002 places, 962/962 transitions.
Applied a total of 0 rules in 21 ms. Remains 1002 /1002 variables (removed 0) and now considering 962/962 (removed 0) transitions.
[2023-03-21 19:49:10] [INFO ] Invariant cache hit.
[2023-03-21 19:49:11] [INFO ] Implicit Places using invariants in 765 ms returned []
[2023-03-21 19:49:11] [INFO ] Invariant cache hit.
[2023-03-21 19:49:13] [INFO ] Implicit Places using invariants and state equation in 1318 ms returned []
Implicit Place search using SMT with State Equation took 2108 ms to find 0 implicit places.
[2023-03-21 19:49:13] [INFO ] Redundant transitions in 158 ms returned []
[2023-03-21 19:49:13] [INFO ] Invariant cache hit.
[2023-03-21 19:49:13] [INFO ] Dead Transitions using invariants and state equation in 655 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2979 ms. Remains : 1002/1002 places, 962/962 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 287 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 89 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 4 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-21 19:49:14] [INFO ] Invariant cache hit.
[2023-03-21 19:49:14] [INFO ] After 208ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 19:49:14] [INFO ] [Nat]Absence check using 360 positive place invariants in 78 ms returned sat
[2023-03-21 19:49:15] [INFO ] After 540ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 19:49:15] [INFO ] Deduced a trap composed of 8 places in 118 ms of which 1 ms to minimize.
[2023-03-21 19:49:15] [INFO ] Deduced a trap composed of 12 places in 109 ms of which 1 ms to minimize.
[2023-03-21 19:49:15] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 1 ms to minimize.
[2023-03-21 19:49:15] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 1 ms to minimize.
[2023-03-21 19:49:16] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 1 ms to minimize.
[2023-03-21 19:49:16] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 703 ms
[2023-03-21 19:49:16] [INFO ] After 1272ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 57 ms.
[2023-03-21 19:49:16] [INFO ] After 1601ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 11 ms.
Support contains 6 out of 1002 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1002/1002 places, 962/962 transitions.
Partial Free-agglomeration rule applied 237 times.
Drop transitions removed 237 transitions
Iterating global reduction 0 with 237 rules applied. Total rules applied 237 place count 1002 transition count 962
Applied a total of 237 rules in 47 ms. Remains 1002 /1002 variables (removed 0) and now considering 962/962 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 1002/1002 places, 962/962 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 1) seen :0
Finished probabilistic random walk after 47356 steps, run visited all 1 properties in 472 ms. (steps per millisecond=100 )
Probabilistic random walk after 47356 steps, saw 46476 distinct states, run finished after 483 ms. (steps per millisecond=98 ) properties seen :1
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 5 factoid took 417 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 120 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 87 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 122 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 48 reset in 843 ms.
Product exploration explored 100000 steps with 48 reset in 902 ms.
Support contains 6 out of 1002 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1002/1002 places, 962/962 transitions.
Applied a total of 0 rules in 20 ms. Remains 1002 /1002 variables (removed 0) and now considering 962/962 (removed 0) transitions.
[2023-03-21 19:49:19] [INFO ] Invariant cache hit.
[2023-03-21 19:49:20] [INFO ] Implicit Places using invariants in 606 ms returned []
[2023-03-21 19:49:20] [INFO ] Invariant cache hit.
[2023-03-21 19:49:21] [INFO ] Implicit Places using invariants and state equation in 1406 ms returned []
Implicit Place search using SMT with State Equation took 2014 ms to find 0 implicit places.
[2023-03-21 19:49:21] [INFO ] Redundant transitions in 269 ms returned []
[2023-03-21 19:49:21] [INFO ] Invariant cache hit.
[2023-03-21 19:49:22] [INFO ] Dead Transitions using invariants and state equation in 550 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2893 ms. Remains : 1002/1002 places, 962/962 transitions.
Treatment of property ShieldIIPs-PT-040B-LTLFireability-07 finished in 20706 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&&G(p1))))'
Support contains 3 out of 2130 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2130/2130 places, 2090/2090 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 0 with 200 rules applied. Total rules applied 200 place count 2129 transition count 1889
Reduce places removed 200 places and 0 transitions.
Iterating post reduction 1 with 200 rules applied. Total rules applied 400 place count 1929 transition count 1889
Performed 201 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 201 Pre rules applied. Total rules applied 400 place count 1929 transition count 1688
Deduced a syphon composed of 201 places in 4 ms
Reduce places removed 201 places and 0 transitions.
Iterating global reduction 2 with 402 rules applied. Total rules applied 802 place count 1728 transition count 1688
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 810 place count 1720 transition count 1680
Iterating global reduction 2 with 8 rules applied. Total rules applied 818 place count 1720 transition count 1680
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 818 place count 1720 transition count 1676
Deduced a syphon composed of 4 places in 5 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 826 place count 1716 transition count 1676
Performed 712 Post agglomeration using F-continuation condition.Transition count delta: 712
Deduced a syphon composed of 712 places in 5 ms
Reduce places removed 712 places and 0 transitions.
Iterating global reduction 2 with 1424 rules applied. Total rules applied 2250 place count 1004 transition count 964
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 2252 place count 1002 transition count 962
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2253 place count 1001 transition count 962
Applied a total of 2253 rules in 428 ms. Remains 1001 /2130 variables (removed 1129) and now considering 962/2090 (removed 1128) transitions.
// Phase 1: matrix 962 rows 1001 cols
[2023-03-21 19:49:22] [INFO ] Computed 360 place invariants in 2 ms
[2023-03-21 19:49:23] [INFO ] Implicit Places using invariants in 649 ms returned []
[2023-03-21 19:49:23] [INFO ] Invariant cache hit.
[2023-03-21 19:49:25] [INFO ] Implicit Places using invariants and state equation in 1519 ms returned []
Implicit Place search using SMT with State Equation took 2197 ms to find 0 implicit places.
[2023-03-21 19:49:25] [INFO ] Redundant transitions in 111 ms returned [961]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 961 rows 1001 cols
[2023-03-21 19:49:25] [INFO ] Computed 360 place invariants in 4 ms
[2023-03-21 19:49:25] [INFO ] Dead Transitions using invariants and state equation in 643 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1001/2130 places, 961/2090 transitions.
Applied a total of 0 rules in 25 ms. Remains 1001 /1001 variables (removed 0) and now considering 961/961 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3429 ms. Remains : 1001/2130 places, 961/2090 transitions.
Stuttering acceptance computed with spot in 90 ms :[(OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : ShieldIIPs-PT-040B-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s425 1), p1:(AND (EQ s583 1) (EQ s599 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 1993 steps with 0 reset in 25 ms.
FORMULA ShieldIIPs-PT-040B-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-040B-LTLFireability-08 finished in 3566 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(((F(p0) U G(p1))&&(p0||F(G(p2))))))'
Support contains 4 out of 2130 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2130/2130 places, 2090/2090 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 201 transitions
Trivial Post-agglo rules discarded 201 transitions
Performed 201 trivial Post agglomeration. Transition count delta: 201
Iterating post reduction 0 with 201 rules applied. Total rules applied 201 place count 2129 transition count 1888
Reduce places removed 201 places and 0 transitions.
Iterating post reduction 1 with 201 rules applied. Total rules applied 402 place count 1928 transition count 1888
Performed 201 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 201 Pre rules applied. Total rules applied 402 place count 1928 transition count 1687
Deduced a syphon composed of 201 places in 3 ms
Reduce places removed 201 places and 0 transitions.
Iterating global reduction 2 with 402 rules applied. Total rules applied 804 place count 1727 transition count 1687
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 811 place count 1720 transition count 1680
Iterating global reduction 2 with 7 rules applied. Total rules applied 818 place count 1720 transition count 1680
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 818 place count 1720 transition count 1677
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 824 place count 1717 transition count 1677
Performed 710 Post agglomeration using F-continuation condition.Transition count delta: 710
Deduced a syphon composed of 710 places in 3 ms
Reduce places removed 710 places and 0 transitions.
Iterating global reduction 2 with 1420 rules applied. Total rules applied 2244 place count 1007 transition count 967
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 2246 place count 1005 transition count 965
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2247 place count 1004 transition count 965
Applied a total of 2247 rules in 356 ms. Remains 1004 /2130 variables (removed 1126) and now considering 965/2090 (removed 1125) transitions.
// Phase 1: matrix 965 rows 1004 cols
[2023-03-21 19:49:26] [INFO ] Computed 360 place invariants in 3 ms
[2023-03-21 19:49:26] [INFO ] Implicit Places using invariants in 561 ms returned []
[2023-03-21 19:49:26] [INFO ] Invariant cache hit.
[2023-03-21 19:49:28] [INFO ] Implicit Places using invariants and state equation in 1504 ms returned []
Implicit Place search using SMT with State Equation took 2081 ms to find 0 implicit places.
[2023-03-21 19:49:28] [INFO ] Redundant transitions in 271 ms returned [964]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 964 rows 1004 cols
[2023-03-21 19:49:28] [INFO ] Computed 360 place invariants in 4 ms
[2023-03-21 19:49:29] [INFO ] Dead Transitions using invariants and state equation in 788 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1004/2130 places, 964/2090 transitions.
Applied a total of 0 rules in 24 ms. Remains 1004 /1004 variables (removed 0) and now considering 964/964 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3554 ms. Remains : 1004/2130 places, 964/2090 transitions.
Stuttering acceptance computed with spot in 337 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2))), (AND (NOT p0) p1 (NOT p2)), (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldIIPs-PT-040B-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={1} source=2 dest: 2}, { cond=(NOT p1), acceptance={0, 1} source=2 dest: 2}], [{ cond=(AND (NOT p0) p2), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=3 dest: 3}, { cond=p0, acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p0) p2), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 4}, { cond=(AND p1 p2), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p1) p2), acceptance={0} source=5 dest: 5}, { cond=(AND p1 (NOT p2)), acceptance={1} source=5 dest: 5}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1} source=5 dest: 5}]], initial=0, aps=[p0:(AND (EQ s864 1) (EQ s899 1)), p1:(EQ s714 1), p2:(EQ s235 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Product exploration explored 100000 steps with 1434 reset in 805 ms.
Product exploration explored 100000 steps with 1479 reset in 884 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) p2))), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT p0))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 1120 ms. Reduced automaton from 6 states, 16 edges and 3 AP (stutter insensitive) to 6 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 399 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2))), (AND (NOT p0) p1 (NOT p2)), (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 4 resets, run finished after 166 ms. (steps per millisecond=60 ) properties (out of 10) seen :9
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-21 19:49:33] [INFO ] Invariant cache hit.
[2023-03-21 19:49:33] [INFO ] [Real]Absence check using 360 positive place invariants in 84 ms returned sat
[2023-03-21 19:49:34] [INFO ] After 836ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 19:49:34] [INFO ] [Nat]Absence check using 360 positive place invariants in 78 ms returned sat
[2023-03-21 19:49:35] [INFO ] After 493ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 19:49:35] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 1 ms to minimize.
[2023-03-21 19:49:35] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 14 ms to minimize.
[2023-03-21 19:49:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 283 ms
[2023-03-21 19:49:35] [INFO ] After 822ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 75 ms.
[2023-03-21 19:49:35] [INFO ] After 1229ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 19 ms.
Support contains 2 out of 1004 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1004/1004 places, 964/964 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1002 transition count 962
Partial Free-agglomeration rule applied 239 times.
Drop transitions removed 239 transitions
Iterating global reduction 0 with 239 rules applied. Total rules applied 243 place count 1002 transition count 962
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 244 place count 1001 transition count 961
Applied a total of 244 rules in 96 ms. Remains 1001 /1004 variables (removed 3) and now considering 961/964 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 97 ms. Remains : 1001/1004 places, 961/964 transitions.
Finished random walk after 2872 steps, including 0 resets, run visited all 1 properties in 28 ms. (steps per millisecond=102 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) p2))), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT p0))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p2)))), (F (AND (NOT p0) p2)), (F (AND p2 p1)), (F p0), (F (AND (NOT p0) p1)), (F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p2) p1)), (F (AND p2 (NOT p1))), (F (NOT (AND (NOT p2) (NOT p1))))]
Knowledge based reduction with 16 factoid took 1652 ms. Reduced automaton from 6 states, 16 edges and 3 AP (stutter sensitive) to 6 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 429 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2))), (AND (NOT p0) p1 (NOT p2)), (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 455 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2))), (AND (NOT p0) p1 (NOT p2)), (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2))]
[2023-03-21 19:49:38] [INFO ] Invariant cache hit.
[2023-03-21 19:49:39] [INFO ] [Real]Absence check using 360 positive place invariants in 273 ms returned sat
[2023-03-21 19:49:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 19:49:41] [INFO ] [Real]Absence check using state equation in 1988 ms returned sat
[2023-03-21 19:49:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 19:49:42] [INFO ] [Nat]Absence check using 360 positive place invariants in 175 ms returned sat
[2023-03-21 19:49:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 19:49:44] [INFO ] [Nat]Absence check using state equation in 1947 ms returned sat
[2023-03-21 19:49:44] [INFO ] Computed and/alt/rep : 961/2398/961 causal constraints (skipped 1 transitions) in 84 ms.
[2023-03-21 19:49:57] [INFO ] Deduced a trap composed of 2 places in 636 ms of which 2 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:520)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:605)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-21 19:49:57] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p1)
Could not prove EG (NOT p1)
[2023-03-21 19:49:57] [INFO ] Invariant cache hit.
[2023-03-21 19:49:58] [INFO ] [Real]Absence check using 360 positive place invariants in 171 ms returned sat
[2023-03-21 19:49:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 19:50:00] [INFO ] [Real]Absence check using state equation in 2045 ms returned sat
[2023-03-21 19:50:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 19:50:01] [INFO ] [Nat]Absence check using 360 positive place invariants in 178 ms returned sat
[2023-03-21 19:50:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 19:50:03] [INFO ] [Nat]Absence check using state equation in 2311 ms returned sat
[2023-03-21 19:50:04] [INFO ] Computed and/alt/rep : 961/2398/961 causal constraints (skipped 1 transitions) in 115 ms.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:520)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:605)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-21 19:50:15] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (AND (NOT p0) (NOT p2))
Could not prove EG (AND (NOT p0) (NOT p2))
Support contains 4 out of 1004 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1004/1004 places, 964/964 transitions.
Applied a total of 0 rules in 33 ms. Remains 1004 /1004 variables (removed 0) and now considering 964/964 (removed 0) transitions.
[2023-03-21 19:50:15] [INFO ] Invariant cache hit.
[2023-03-21 19:50:16] [INFO ] Implicit Places using invariants in 943 ms returned []
[2023-03-21 19:50:16] [INFO ] Invariant cache hit.
[2023-03-21 19:50:17] [INFO ] Implicit Places using invariants and state equation in 1372 ms returned []
Implicit Place search using SMT with State Equation took 2369 ms to find 0 implicit places.
[2023-03-21 19:50:17] [INFO ] Invariant cache hit.
[2023-03-21 19:50:19] [INFO ] Dead Transitions using invariants and state equation in 1368 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3796 ms. Remains : 1004/1004 places, 964/964 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (AND (NOT p0) (NOT p1))), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) p2))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 690 ms. Reduced automaton from 6 states, 16 edges and 3 AP (stutter sensitive) to 6 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 470 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2))), (AND (NOT p0) p1 (NOT p2)), (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 4 resets, run finished after 155 ms. (steps per millisecond=64 ) properties (out of 10) seen :9
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-21 19:50:20] [INFO ] Invariant cache hit.
[2023-03-21 19:50:20] [INFO ] [Real]Absence check using 360 positive place invariants in 49 ms returned sat
[2023-03-21 19:50:21] [INFO ] After 614ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 19:50:21] [INFO ] [Nat]Absence check using 360 positive place invariants in 163 ms returned sat
[2023-03-21 19:50:22] [INFO ] After 584ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 19:50:22] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 1 ms to minimize.
[2023-03-21 19:50:22] [INFO ] Deduced a trap composed of 17 places in 132 ms of which 1 ms to minimize.
[2023-03-21 19:50:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 298 ms
[2023-03-21 19:50:22] [INFO ] After 957ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 57 ms.
[2023-03-21 19:50:22] [INFO ] After 1422ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 10 ms.
Support contains 2 out of 1004 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1004/1004 places, 964/964 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1002 transition count 962
Partial Free-agglomeration rule applied 239 times.
Drop transitions removed 239 transitions
Iterating global reduction 0 with 239 rules applied. Total rules applied 243 place count 1002 transition count 962
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 244 place count 1001 transition count 961
Applied a total of 244 rules in 124 ms. Remains 1001 /1004 variables (removed 3) and now considering 961/964 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 124 ms. Remains : 1001/1004 places, 961/964 transitions.
Finished random walk after 1933 steps, including 0 resets, run visited all 1 properties in 20 ms. (steps per millisecond=96 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (AND (NOT p0) (NOT p1))), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) p2))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p2)))), (F (AND (NOT p0) p2)), (F (AND p2 p1)), (F p0), (F (AND (NOT p0) p1)), (F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p2) p1)), (F (AND p2 (NOT p1))), (F (NOT (AND (NOT p2) (NOT p1))))]
Knowledge based reduction with 16 factoid took 1691 ms. Reduced automaton from 6 states, 16 edges and 3 AP (stutter sensitive) to 6 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 430 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2))), (AND (NOT p0) p1 (NOT p2)), (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 299 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2))), (AND (NOT p0) p1 (NOT p2)), (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2))]
[2023-03-21 19:50:25] [INFO ] Invariant cache hit.
[2023-03-21 19:50:26] [INFO ] [Real]Absence check using 360 positive place invariants in 188 ms returned sat
[2023-03-21 19:50:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 19:50:28] [INFO ] [Real]Absence check using state equation in 2097 ms returned sat
[2023-03-21 19:50:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 19:50:29] [INFO ] [Nat]Absence check using 360 positive place invariants in 180 ms returned sat
[2023-03-21 19:50:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 19:50:31] [INFO ] [Nat]Absence check using state equation in 2214 ms returned sat
[2023-03-21 19:50:31] [INFO ] Computed and/alt/rep : 961/2398/961 causal constraints (skipped 1 transitions) in 137 ms.
[2023-03-21 19:50:44] [INFO ] Deduced a trap composed of 2 places in 718 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:520)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:605)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-21 19:50:44] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p1)
Could not prove EG (NOT p1)
[2023-03-21 19:50:44] [INFO ] Invariant cache hit.
[2023-03-21 19:50:45] [INFO ] [Real]Absence check using 360 positive place invariants in 199 ms returned sat
[2023-03-21 19:50:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 19:50:47] [INFO ] [Real]Absence check using state equation in 1912 ms returned sat
[2023-03-21 19:50:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 19:50:48] [INFO ] [Nat]Absence check using 360 positive place invariants in 240 ms returned sat
[2023-03-21 19:50:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 19:50:50] [INFO ] [Nat]Absence check using state equation in 2367 ms returned sat
[2023-03-21 19:50:51] [INFO ] Computed and/alt/rep : 961/2398/961 causal constraints (skipped 1 transitions) in 58 ms.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:520)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:605)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-21 19:51:02] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (AND (NOT p0) (NOT p2))
Could not prove EG (AND (NOT p0) (NOT p2))
Stuttering acceptance computed with spot in 433 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2))), (AND (NOT p0) p1 (NOT p2)), (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 1449 reset in 680 ms.
Product exploration explored 100000 steps with 1416 reset in 873 ms.
Applying partial POR strategy [false, true, true, true, true, true]
Stuttering acceptance computed with spot in 434 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2))), (AND (NOT p0) p1 (NOT p2)), (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 4 out of 1004 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1004/1004 places, 964/964 transitions.
Applied a total of 0 rules in 55 ms. Remains 1004 /1004 variables (removed 0) and now considering 964/964 (removed 0) transitions.
[2023-03-21 19:51:05] [INFO ] Redundant transitions in 204 ms returned []
[2023-03-21 19:51:05] [INFO ] Invariant cache hit.
[2023-03-21 19:51:06] [INFO ] Dead Transitions using invariants and state equation in 737 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1031 ms. Remains : 1004/1004 places, 964/964 transitions.
Support contains 4 out of 1004 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1004/1004 places, 964/964 transitions.
Applied a total of 0 rules in 18 ms. Remains 1004 /1004 variables (removed 0) and now considering 964/964 (removed 0) transitions.
[2023-03-21 19:51:06] [INFO ] Invariant cache hit.
[2023-03-21 19:51:06] [INFO ] Implicit Places using invariants in 504 ms returned []
[2023-03-21 19:51:06] [INFO ] Invariant cache hit.
[2023-03-21 19:51:08] [INFO ] Implicit Places using invariants and state equation in 1382 ms returned []
Implicit Place search using SMT with State Equation took 1887 ms to find 0 implicit places.
[2023-03-21 19:51:08] [INFO ] Invariant cache hit.
[2023-03-21 19:51:09] [INFO ] Dead Transitions using invariants and state equation in 832 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2739 ms. Remains : 1004/1004 places, 964/964 transitions.
Treatment of property ShieldIIPs-PT-040B-LTLFireability-09 finished in 103116 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 2130 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2130/2130 places, 2090/2090 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 201 transitions
Trivial Post-agglo rules discarded 201 transitions
Performed 201 trivial Post agglomeration. Transition count delta: 201
Iterating post reduction 0 with 201 rules applied. Total rules applied 201 place count 2129 transition count 1888
Reduce places removed 201 places and 0 transitions.
Iterating post reduction 1 with 201 rules applied. Total rules applied 402 place count 1928 transition count 1888
Performed 201 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 201 Pre rules applied. Total rules applied 402 place count 1928 transition count 1687
Deduced a syphon composed of 201 places in 4 ms
Reduce places removed 201 places and 0 transitions.
Iterating global reduction 2 with 402 rules applied. Total rules applied 804 place count 1727 transition count 1687
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 811 place count 1720 transition count 1680
Iterating global reduction 2 with 7 rules applied. Total rules applied 818 place count 1720 transition count 1680
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 818 place count 1720 transition count 1676
Deduced a syphon composed of 4 places in 4 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 826 place count 1716 transition count 1676
Performed 713 Post agglomeration using F-continuation condition.Transition count delta: 713
Deduced a syphon composed of 713 places in 2 ms
Reduce places removed 713 places and 0 transitions.
Iterating global reduction 2 with 1426 rules applied. Total rules applied 2252 place count 1003 transition count 963
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 2254 place count 1001 transition count 961
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2255 place count 1000 transition count 961
Applied a total of 2255 rules in 408 ms. Remains 1000 /2130 variables (removed 1130) and now considering 961/2090 (removed 1129) transitions.
// Phase 1: matrix 961 rows 1000 cols
[2023-03-21 19:51:09] [INFO ] Computed 360 place invariants in 3 ms
[2023-03-21 19:51:10] [INFO ] Implicit Places using invariants in 524 ms returned []
[2023-03-21 19:51:10] [INFO ] Invariant cache hit.
[2023-03-21 19:51:11] [INFO ] Implicit Places using invariants and state equation in 1267 ms returned []
Implicit Place search using SMT with State Equation took 1820 ms to find 0 implicit places.
[2023-03-21 19:51:11] [INFO ] Redundant transitions in 194 ms returned [960]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 960 rows 1000 cols
[2023-03-21 19:51:11] [INFO ] Computed 360 place invariants in 2 ms
[2023-03-21 19:51:13] [INFO ] Dead Transitions using invariants and state equation in 1529 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1000/2130 places, 960/2090 transitions.
Applied a total of 0 rules in 23 ms. Remains 1000 /1000 variables (removed 0) and now considering 960/960 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3984 ms. Remains : 1000/2130 places, 960/2090 transitions.
Stuttering acceptance computed with spot in 135 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-040B-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s746 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 1948 steps with 0 reset in 18 ms.
FORMULA ShieldIIPs-PT-040B-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-040B-LTLFireability-10 finished in 4168 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(p0)||F(p1)))'
Support contains 2 out of 2130 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2130/2130 places, 2090/2090 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 0 with 200 rules applied. Total rules applied 200 place count 2129 transition count 1889
Reduce places removed 200 places and 0 transitions.
Iterating post reduction 1 with 200 rules applied. Total rules applied 400 place count 1929 transition count 1889
Performed 201 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 201 Pre rules applied. Total rules applied 400 place count 1929 transition count 1688
Deduced a syphon composed of 201 places in 4 ms
Reduce places removed 201 places and 0 transitions.
Iterating global reduction 2 with 402 rules applied. Total rules applied 802 place count 1728 transition count 1688
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 809 place count 1721 transition count 1681
Iterating global reduction 2 with 7 rules applied. Total rules applied 816 place count 1721 transition count 1681
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 816 place count 1721 transition count 1677
Deduced a syphon composed of 4 places in 3 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 824 place count 1717 transition count 1677
Performed 713 Post agglomeration using F-continuation condition.Transition count delta: 713
Deduced a syphon composed of 713 places in 2 ms
Reduce places removed 713 places and 0 transitions.
Iterating global reduction 2 with 1426 rules applied. Total rules applied 2250 place count 1004 transition count 964
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 2252 place count 1002 transition count 962
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2253 place count 1001 transition count 962
Applied a total of 2253 rules in 305 ms. Remains 1001 /2130 variables (removed 1129) and now considering 962/2090 (removed 1128) transitions.
// Phase 1: matrix 962 rows 1001 cols
[2023-03-21 19:51:13] [INFO ] Computed 360 place invariants in 4 ms
[2023-03-21 19:51:14] [INFO ] Implicit Places using invariants in 698 ms returned []
[2023-03-21 19:51:14] [INFO ] Invariant cache hit.
[2023-03-21 19:51:15] [INFO ] Implicit Places using invariants and state equation in 1283 ms returned []
Implicit Place search using SMT with State Equation took 1996 ms to find 0 implicit places.
[2023-03-21 19:51:15] [INFO ] Redundant transitions in 146 ms returned [961]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 961 rows 1001 cols
[2023-03-21 19:51:15] [INFO ] Computed 360 place invariants in 2 ms
[2023-03-21 19:51:16] [INFO ] Dead Transitions using invariants and state equation in 499 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1001/2130 places, 961/2090 transitions.
Applied a total of 0 rules in 37 ms. Remains 1001 /1001 variables (removed 0) and now considering 961/961 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3013 ms. Remains : 1001/2130 places, 961/2090 transitions.
Stuttering acceptance computed with spot in 89 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPs-PT-040B-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}]], initial=1, aps=[p1:(EQ s999 1), p0:(EQ s980 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 2240 steps with 3 reset in 33 ms.
FORMULA ShieldIIPs-PT-040B-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-040B-LTLFireability-11 finished in 3162 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X((F(p0) U !p0))) U (!(p0 U !p2)&&p1)))'
Support contains 6 out of 2130 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2130/2130 places, 2090/2090 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 2122 transition count 2082
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 2122 transition count 2082
Applied a total of 16 rules in 247 ms. Remains 2122 /2130 variables (removed 8) and now considering 2082/2090 (removed 8) transitions.
// Phase 1: matrix 2082 rows 2122 cols
[2023-03-21 19:51:16] [INFO ] Computed 361 place invariants in 15 ms
[2023-03-21 19:51:17] [INFO ] Implicit Places using invariants in 844 ms returned []
[2023-03-21 19:51:17] [INFO ] Invariant cache hit.
[2023-03-21 19:51:19] [INFO ] Implicit Places using invariants and state equation in 2311 ms returned []
Implicit Place search using SMT with State Equation took 3179 ms to find 0 implicit places.
[2023-03-21 19:51:19] [INFO ] Invariant cache hit.
[2023-03-21 19:51:21] [INFO ] Dead Transitions using invariants and state equation in 1832 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2122/2130 places, 2082/2090 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5282 ms. Remains : 2122/2130 places, 2082/2090 transitions.
Stuttering acceptance computed with spot in 263 ms :[(OR (NOT p1) (NOT p2)), p0, (NOT p2), p0]
Running random walk in product with property : ShieldIIPs-PT-040B-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p1) (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(OR (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND p1 p0 p2), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 0}, { cond=(NOT p2), acceptance={} source=2 dest: 1}, { cond=(AND p0 p2), acceptance={} source=2 dest: 2}, { cond=(NOT p2), acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s1571 1) (EQ s1581 1) (EQ s1600 1)), p2:(AND (EQ s1571 1) (EQ s1581 1) (EQ s1600 1)), p0:(AND (EQ s1938 1) (EQ s1954 1) (EQ s1965 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 25027 reset in 926 ms.
Product exploration explored 100000 steps with 25022 reset in 834 ms.
Computed a total of 479 stabilizing places and 479 stable transitions
Computed a total of 479 stabilizing places and 479 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT (AND p1 p0 p2))), (X (NOT (AND p0 p2))), (X (OR (NOT p1) (NOT p2))), (X (NOT p2)), true, (X (X (NOT (AND p1 p0 p2)))), (X (X (NOT (AND p0 p2)))), (X (X (OR (NOT p1) (NOT p2)))), (X (X (NOT p2))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 680 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 269 ms :[(OR (NOT p1) (NOT p2)), p0, (NOT p2), p0]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 241 ms. (steps per millisecond=41 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-21 19:51:25] [INFO ] Invariant cache hit.
[2023-03-21 19:51:25] [INFO ] [Real]Absence check using 361 positive place invariants in 169 ms returned sat
[2023-03-21 19:51:26] [INFO ] After 1726ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-21 19:51:27] [INFO ] [Nat]Absence check using 361 positive place invariants in 127 ms returned sat
[2023-03-21 19:51:29] [INFO ] After 1689ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-21 19:51:29] [INFO ] Deduced a trap composed of 32 places in 668 ms of which 2 ms to minimize.
[2023-03-21 19:51:30] [INFO ] Deduced a trap composed of 24 places in 975 ms of which 27 ms to minimize.
[2023-03-21 19:51:31] [INFO ] Deduced a trap composed of 36 places in 629 ms of which 1 ms to minimize.
[2023-03-21 19:51:33] [INFO ] Deduced a trap composed of 27 places in 1474 ms of which 2 ms to minimize.
[2023-03-21 19:51:34] [INFO ] Deduced a trap composed of 31 places in 875 ms of which 23 ms to minimize.
[2023-03-21 19:51:35] [INFO ] Deduced a trap composed of 21 places in 996 ms of which 1 ms to minimize.
[2023-03-21 19:51:36] [INFO ] Deduced a trap composed of 27 places in 540 ms of which 27 ms to minimize.
[2023-03-21 19:51:36] [INFO ] Deduced a trap composed of 19 places in 564 ms of which 2 ms to minimize.
[2023-03-21 19:51:37] [INFO ] Deduced a trap composed of 19 places in 601 ms of which 1 ms to minimize.
[2023-03-21 19:51:38] [INFO ] Deduced a trap composed of 17 places in 496 ms of which 1 ms to minimize.
[2023-03-21 19:51:38] [INFO ] Deduced a trap composed of 39 places in 681 ms of which 1 ms to minimize.
[2023-03-21 19:51:39] [INFO ] Deduced a trap composed of 37 places in 839 ms of which 2 ms to minimize.
[2023-03-21 19:51:40] [INFO ] Deduced a trap composed of 39 places in 634 ms of which 1 ms to minimize.
[2023-03-21 19:51:41] [INFO ] Deduced a trap composed of 36 places in 578 ms of which 1 ms to minimize.
[2023-03-21 19:51:41] [INFO ] Deduced a trap composed of 27 places in 492 ms of which 1 ms to minimize.
[2023-03-21 19:51:42] [INFO ] Deduced a trap composed of 26 places in 692 ms of which 2 ms to minimize.
[2023-03-21 19:51:43] [INFO ] Deduced a trap composed of 28 places in 719 ms of which 4 ms to minimize.
[2023-03-21 19:51:43] [INFO ] Deduced a trap composed of 24 places in 536 ms of which 2 ms to minimize.
[2023-03-21 19:51:44] [INFO ] Deduced a trap composed of 21 places in 562 ms of which 14 ms to minimize.
[2023-03-21 19:51:45] [INFO ] Deduced a trap composed of 24 places in 632 ms of which 1 ms to minimize.
[2023-03-21 19:51:46] [INFO ] Deduced a trap composed of 22 places in 759 ms of which 5 ms to minimize.
[2023-03-21 19:51:46] [INFO ] Deduced a trap composed of 39 places in 592 ms of which 2 ms to minimize.
[2023-03-21 19:51:47] [INFO ] Deduced a trap composed of 32 places in 517 ms of which 1 ms to minimize.
[2023-03-21 19:51:47] [INFO ] Deduced a trap composed of 28 places in 505 ms of which 1 ms to minimize.
[2023-03-21 19:51:48] [INFO ] Deduced a trap composed of 32 places in 474 ms of which 1 ms to minimize.
[2023-03-21 19:51:49] [INFO ] Deduced a trap composed of 22 places in 471 ms of which 1 ms to minimize.
[2023-03-21 19:51:49] [INFO ] Deduced a trap composed of 25 places in 557 ms of which 1 ms to minimize.
[2023-03-21 19:51:50] [INFO ] Deduced a trap composed of 23 places in 679 ms of which 1 ms to minimize.
[2023-03-21 19:51:51] [INFO ] Deduced a trap composed of 31 places in 708 ms of which 2 ms to minimize.
[2023-03-21 19:51:52] [INFO ] Deduced a trap composed of 33 places in 713 ms of which 2 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.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-21 19:51:52] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-21 19:51:52] [INFO ] After 25321ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Parikh walk visited 0 properties in 137 ms.
Support contains 6 out of 2122 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2122/2122 places, 2082/2082 transitions.
Drop transitions removed 199 transitions
Trivial Post-agglo rules discarded 199 transitions
Performed 199 trivial Post agglomeration. Transition count delta: 199
Iterating post reduction 0 with 199 rules applied. Total rules applied 199 place count 2122 transition count 1883
Reduce places removed 199 places and 0 transitions.
Iterating post reduction 1 with 199 rules applied. Total rules applied 398 place count 1923 transition count 1883
Performed 201 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 201 Pre rules applied. Total rules applied 398 place count 1923 transition count 1682
Deduced a syphon composed of 201 places in 3 ms
Reduce places removed 201 places and 0 transitions.
Iterating global reduction 2 with 402 rules applied. Total rules applied 800 place count 1722 transition count 1682
Performed 719 Post agglomeration using F-continuation condition.Transition count delta: 719
Deduced a syphon composed of 719 places in 3 ms
Reduce places removed 719 places and 0 transitions.
Iterating global reduction 2 with 1438 rules applied. Total rules applied 2238 place count 1003 transition count 963
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 276 times.
Drop transitions removed 276 transitions
Iterating global reduction 2 with 276 rules applied. Total rules applied 2514 place count 1003 transition count 963
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 2515 place count 1002 transition count 962
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2516 place count 1001 transition count 962
Applied a total of 2516 rules in 272 ms. Remains 1001 /2122 variables (removed 1121) and now considering 962/2082 (removed 1120) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 272 ms. Remains : 1001/2122 places, 962/2082 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 203 ms. (steps per millisecond=49 ) properties (out of 2) seen :0
Finished Best-First random walk after 5965 steps, including 1 resets, run visited all 2 properties in 35 ms. (steps per millisecond=170 )
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT (AND p1 p0 p2))), (X (NOT (AND p0 p2))), (X (OR (NOT p1) (NOT p2))), (X (NOT p2)), true, (X (X (NOT (AND p1 p0 p2)))), (X (X (NOT (AND p0 p2)))), (X (X (OR (NOT p1) (NOT p2)))), (X (X (NOT p2))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F (AND p2 p0)), (F (NOT (OR (NOT p1) (NOT p2)))), (F p2), (F (AND p1 p2 p0))]
Knowledge based reduction with 11 factoid took 932 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 243 ms :[(OR (NOT p1) (NOT p2)), p0, (NOT p2), p0]
Stuttering acceptance computed with spot in 268 ms :[(OR (NOT p1) (NOT p2)), p0, (NOT p2), p0]
[2023-03-21 19:51:54] [INFO ] Invariant cache hit.
Proved EG (NOT p1)
[2023-03-21 19:51:55] [INFO ] Invariant cache hit.
Proved EG (NOT p2)
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT (AND p1 p0 p2))), (X (NOT (AND p0 p2))), (X (OR (NOT p1) (NOT p2))), (X (NOT p2)), true, (X (X (NOT (AND p1 p0 p2)))), (X (X (NOT (AND p0 p2)))), (X (X (OR (NOT p1) (NOT p2)))), (X (X (NOT p2))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F (AND p2 p0)), (F (NOT (OR (NOT p1) (NOT p2)))), (F p2), (F (AND p1 p2 p0)), (G (NOT p1)), (G (NOT p2))]
Property proved to be false thanks to negative knowledge :(G (NOT p1))
Knowledge based reduction with 11 factoid took 604 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPs-PT-040B-LTLFireability-12 FALSE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPs-PT-040B-LTLFireability-12 finished in 41185 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p0)||G(p1)))))'
Support contains 2 out of 2130 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2130/2130 places, 2090/2090 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 2122 transition count 2082
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 2122 transition count 2082
Applied a total of 16 rules in 218 ms. Remains 2122 /2130 variables (removed 8) and now considering 2082/2090 (removed 8) transitions.
[2023-03-21 19:51:57] [INFO ] Invariant cache hit.
[2023-03-21 19:51:58] [INFO ] Implicit Places using invariants in 982 ms returned []
[2023-03-21 19:51:58] [INFO ] Invariant cache hit.
[2023-03-21 19:52:01] [INFO ] Implicit Places using invariants and state equation in 2603 ms returned []
Implicit Place search using SMT with State Equation took 3602 ms to find 0 implicit places.
[2023-03-21 19:52:01] [INFO ] Invariant cache hit.
[2023-03-21 19:52:03] [INFO ] Dead Transitions using invariants and state equation in 1647 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2122/2130 places, 2082/2090 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5470 ms. Remains : 2122/2130 places, 2082/2090 transitions.
Stuttering acceptance computed with spot in 312 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPs-PT-040B-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 2}]], initial=4, aps=[p1:(NEQ s1657 1), p0:(EQ s483 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1316 steps with 0 reset in 10 ms.
FORMULA ShieldIIPs-PT-040B-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-040B-LTLFireability-13 finished in 5827 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)))))'
Support contains 1 out of 2130 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2130/2130 places, 2090/2090 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 2123 transition count 2083
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 2123 transition count 2083
Applied a total of 14 rules in 182 ms. Remains 2123 /2130 variables (removed 7) and now considering 2083/2090 (removed 7) transitions.
// Phase 1: matrix 2083 rows 2123 cols
[2023-03-21 19:52:03] [INFO ] Computed 361 place invariants in 15 ms
[2023-03-21 19:52:04] [INFO ] Implicit Places using invariants in 915 ms returned []
[2023-03-21 19:52:04] [INFO ] Invariant cache hit.
[2023-03-21 19:52:07] [INFO ] Implicit Places using invariants and state equation in 2837 ms returned []
Implicit Place search using SMT with State Equation took 3763 ms to find 0 implicit places.
[2023-03-21 19:52:07] [INFO ] Invariant cache hit.
[2023-03-21 19:52:09] [INFO ] Dead Transitions using invariants and state equation in 1814 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2123/2130 places, 2083/2090 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5775 ms. Remains : 2123/2130 places, 2083/2090 transitions.
Stuttering acceptance computed with spot in 294 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-040B-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(EQ s346 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, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA ShieldIIPs-PT-040B-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-040B-LTLFireability-14 finished in 6102 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((p0||G(p1)))&&G(p2))))'
Support contains 2 out of 2130 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2130/2130 places, 2090/2090 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 2122 transition count 2082
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 2122 transition count 2082
Applied a total of 16 rules in 230 ms. Remains 2122 /2130 variables (removed 8) and now considering 2082/2090 (removed 8) transitions.
// Phase 1: matrix 2082 rows 2122 cols
[2023-03-21 19:52:09] [INFO ] Computed 361 place invariants in 13 ms
[2023-03-21 19:52:10] [INFO ] Implicit Places using invariants in 1100 ms returned []
[2023-03-21 19:52:10] [INFO ] Invariant cache hit.
[2023-03-21 19:52:13] [INFO ] Implicit Places using invariants and state equation in 2664 ms returned []
Implicit Place search using SMT with State Equation took 3768 ms to find 0 implicit places.
[2023-03-21 19:52:13] [INFO ] Invariant cache hit.
[2023-03-21 19:52:15] [INFO ] Dead Transitions using invariants and state equation in 1499 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2122/2130 places, 2082/2090 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5511 ms. Remains : 2122/2130 places, 2082/2090 transitions.
Stuttering acceptance computed with spot in 340 ms :[true, (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p2)]
Running random walk in product with property : ShieldIIPs-PT-040B-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=(OR (NOT p2) (AND (NOT p0) (NOT p1))), acceptance={} source=2 dest: 0}, { cond=(AND p2 (NOT p0) p1), acceptance={} source=2 dest: 3}, { cond=(AND p2 p0), acceptance={} source=2 dest: 5}], [{ cond=(OR (NOT p2) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p2 p1), acceptance={} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 0}, { cond=p2, acceptance={} source=4 dest: 2}], [{ cond=(NOT p2), acceptance={} source=5 dest: 0}, { cond=p2, acceptance={} source=5 dest: 5}]], initial=1, aps=[p2:(NEQ s1131 1), p0:(EQ s1664 0), p1:(EQ s1131 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2665 steps with 0 reset in 51 ms.
FORMULA ShieldIIPs-PT-040B-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-040B-LTLFireability-15 finished in 5944 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||G(p1)))))'
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)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p1)||p0))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((F(p0) U G(p1))&&(p0||F(G(p2))))))'
[2023-03-21 19:52:16] [INFO ] Flatten gal took : 124 ms
[2023-03-21 19:52:16] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-21 19:52:16] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 2130 places, 2090 transitions and 6580 arcs took 35 ms.
Total runtime 311334 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2316/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2316/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2316/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2316/ltl_3_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : ShieldIIPs-PT-040B-LTLFireability-03
Could not compute solution for formula : ShieldIIPs-PT-040B-LTLFireability-05
Could not compute solution for formula : ShieldIIPs-PT-040B-LTLFireability-07
Could not compute solution for formula : ShieldIIPs-PT-040B-LTLFireability-09

BK_STOP 1679428340225

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name ShieldIIPs-PT-040B-LTLFireability-03
ltl formula formula --ltl=/tmp/2316/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 2130 places, 2090 transitions and 6580 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.390 real 0.130 user 0.170 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2316/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2316/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2316/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2316/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
0: pnml2lts-mc(+0xa23f4) [0x55e0ab2703f4]
1: pnml2lts-mc(+0xa2496) [0x55e0ab270496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7f596d696140]
3: pnml2lts-mc(+0x405be5) [0x55e0ab5d3be5]
4: pnml2lts-mc(+0x16b3f9) [0x55e0ab3393f9]
5: pnml2lts-mc(+0x164ac4) [0x55e0ab332ac4]
6: pnml2lts-mc(+0x272e0a) [0x55e0ab440e0a]
7: pnml2lts-mc(+0xb61f0) [0x55e0ab2841f0]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7f596d4e94d7]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7f596d4e967a]
10: pnml2lts-mc(+0xa1581) [0x55e0ab26f581]
11: pnml2lts-mc(+0xa1910) [0x55e0ab26f910]
12: pnml2lts-mc(+0xa32a2) [0x55e0ab2712a2]
13: pnml2lts-mc(+0xa50f4) [0x55e0ab2730f4]
14: pnml2lts-mc(+0xa516b) [0x55e0ab27316b]
15: pnml2lts-mc(+0x3f34b3) [0x55e0ab5c14b3]
16: pnml2lts-mc(+0x7c63d) [0x55e0ab24a63d]
17: pnml2lts-mc(+0x67d86) [0x55e0ab235d86]
18: pnml2lts-mc(+0x60a8a) [0x55e0ab22ea8a]
19: pnml2lts-mc(+0x5eb15) [0x55e0ab22cb15]
20: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7f596d4d1d0a]
21: pnml2lts-mc(+0x6075e) [0x55e0ab22e75e]
ltl formula name ShieldIIPs-PT-040B-LTLFireability-05
ltl formula formula --ltl=/tmp/2316/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 2130 places, 2090 transitions and 6580 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.370 real 0.110 user 0.150 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2316/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2316/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2316/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2316/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
0: pnml2lts-mc(+0xa23f4) [0x564ab7c573f4]
1: pnml2lts-mc(+0xa2496) [0x564ab7c57496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7f1d6b3c0140]
3: pnml2lts-mc(+0x405be5) [0x564ab7fbabe5]
4: pnml2lts-mc(+0x16b3f9) [0x564ab7d203f9]
5: pnml2lts-mc(+0x164ac4) [0x564ab7d19ac4]
6: pnml2lts-mc(+0x272e0a) [0x564ab7e27e0a]
7: pnml2lts-mc(+0xb61f0) [0x564ab7c6b1f0]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7f1d6b2134d7]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7f1d6b21367a]
10: pnml2lts-mc(+0xa1581) [0x564ab7c56581]
11: pnml2lts-mc(+0xa1910) [0x564ab7c56910]
12: pnml2lts-mc(+0xa32a2) [0x564ab7c582a2]
13: pnml2lts-mc(+0xa50f4) [0x564ab7c5a0f4]
14: pnml2lts-mc(+0xa516b) [0x564ab7c5a16b]
15: pnml2lts-mc(+0x3f34b3) [0x564ab7fa84b3]
16: pnml2lts-mc(+0x7c63d) [0x564ab7c3163d]
17: pnml2lts-mc(+0x67d86) [0x564ab7c1cd86]
18: pnml2lts-mc(+0x60a8a) [0x564ab7c15a8a]
19: pnml2lts-mc(+0x5eb15) [0x564ab7c13b15]
20: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7f1d6b1fbd0a]
21: pnml2lts-mc(+0x6075e) [0x564ab7c1575e]
ltl formula name ShieldIIPs-PT-040B-LTLFireability-07
ltl formula formula --ltl=/tmp/2316/ltl_2_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 2130 places, 2090 transitions and 6580 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.390 real 0.120 user 0.130 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2316/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2316/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2316/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2316/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): invalid chunk size
ltl formula name ShieldIIPs-PT-040B-LTLFireability-09
ltl formula formula --ltl=/tmp/2316/ltl_3_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
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 2130 places, 2090 transitions and 6580 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.380 real 0.140 user 0.120 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2316/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2316/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2316/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2316/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 11 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is ShieldIIPs-PT-040B, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r393-oct2-167903716700140"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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