Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 7.0K Feb 25 17:06 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Feb 25 17:06 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 25 17:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 25 17:06 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.1K Feb 25 16:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 16:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Feb 25 17:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K Feb 25 17:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Feb 25 17:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Feb 25 17:07 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:57 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:57 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 686K 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 ShieldIIPt-PT-040B-LTLCardinality-00
FORMULA_NAME ShieldIIPt-PT-040B-LTLCardinality-01
FORMULA_NAME ShieldIIPt-PT-040B-LTLCardinality-02
FORMULA_NAME ShieldIIPt-PT-040B-LTLCardinality-03
FORMULA_NAME ShieldIIPt-PT-040B-LTLCardinality-04
FORMULA_NAME ShieldIIPt-PT-040B-LTLCardinality-05
FORMULA_NAME ShieldIIPt-PT-040B-LTLCardinality-06
FORMULA_NAME ShieldIIPt-PT-040B-LTLCardinality-07
FORMULA_NAME ShieldIIPt-PT-040B-LTLCardinality-08
FORMULA_NAME ShieldIIPt-PT-040B-LTLCardinality-09
FORMULA_NAME ShieldIIPt-PT-040B-LTLCardinality-10
FORMULA_NAME ShieldIIPt-PT-040B-LTLCardinality-11
FORMULA_NAME ShieldIIPt-PT-040B-LTLCardinality-12
FORMULA_NAME ShieldIIPt-PT-040B-LTLCardinality-13
FORMULA_NAME ShieldIIPt-PT-040B-LTLCardinality-14
FORMULA_NAME ShieldIIPt-PT-040B-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679272769968

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPt-PT-040B
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-20 00:39:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-20 00:39:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 00:39:32] [INFO ] Load time of PNML (sax parser for PT used): 117 ms
[2023-03-20 00:39:32] [INFO ] Transformed 2803 places.
[2023-03-20 00:39:32] [INFO ] Transformed 2603 transitions.
[2023-03-20 00:39:32] [INFO ] Found NUPN structural information;
[2023-03-20 00:39:32] [INFO ] Parsed PT model containing 2803 places and 2603 transitions and 6486 arcs in 317 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ShieldIIPt-PT-040B-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-040B-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-040B-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-040B-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-040B-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-040B-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-040B-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 2803 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2803/2803 places, 2603/2603 transitions.
Discarding 427 places :
Symmetric choice reduction at 0 with 427 rule applications. Total rules 427 place count 2376 transition count 2176
Iterating global reduction 0 with 427 rules applied. Total rules applied 854 place count 2376 transition count 2176
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 855 place count 2375 transition count 2175
Iterating global reduction 0 with 1 rules applied. Total rules applied 856 place count 2375 transition count 2175
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 857 place count 2374 transition count 2174
Iterating global reduction 0 with 1 rules applied. Total rules applied 858 place count 2374 transition count 2174
Applied a total of 858 rules in 1369 ms. Remains 2374 /2803 variables (removed 429) and now considering 2174/2603 (removed 429) transitions.
// Phase 1: matrix 2174 rows 2374 cols
[2023-03-20 00:39:34] [INFO ] Computed 361 place invariants in 23 ms
[2023-03-20 00:39:35] [INFO ] Implicit Places using invariants in 1230 ms returned []
[2023-03-20 00:39:35] [INFO ] Invariant cache hit.
[2023-03-20 00:39:38] [INFO ] Implicit Places using invariants and state equation in 2906 ms returned []
Implicit Place search using SMT with State Equation took 4181 ms to find 0 implicit places.
[2023-03-20 00:39:38] [INFO ] Invariant cache hit.
[2023-03-20 00:39:40] [INFO ] Dead Transitions using invariants and state equation in 1558 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2374/2803 places, 2174/2603 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7110 ms. Remains : 2374/2803 places, 2174/2603 transitions.
Support contains 33 out of 2374 places after structural reductions.
[2023-03-20 00:39:40] [INFO ] Flatten gal took : 195 ms
[2023-03-20 00:39:40] [INFO ] Flatten gal took : 120 ms
[2023-03-20 00:39:41] [INFO ] Input system was already deterministic with 2174 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 478 ms. (steps per millisecond=20 ) properties (out of 21) seen :6
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Running SMT prover for 15 properties.
[2023-03-20 00:39:41] [INFO ] Invariant cache hit.
[2023-03-20 00:39:42] [INFO ] [Real]Absence check using 361 positive place invariants in 397 ms returned sat
[2023-03-20 00:39:42] [INFO ] After 1201ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2023-03-20 00:39:44] [INFO ] [Nat]Absence check using 361 positive place invariants in 315 ms returned sat
[2023-03-20 00:39:48] [INFO ] After 3349ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :15
[2023-03-20 00:39:49] [INFO ] Deduced a trap composed of 16 places in 1037 ms of which 24 ms to minimize.
[2023-03-20 00:39:50] [INFO ] Deduced a trap composed of 26 places in 1115 ms of which 8 ms to minimize.
[2023-03-20 00:39:51] [INFO ] Deduced a trap composed of 31 places in 852 ms of which 5 ms to minimize.
[2023-03-20 00:39:52] [INFO ] Deduced a trap composed of 36 places in 825 ms of which 16 ms to minimize.
[2023-03-20 00:39:53] [INFO ] Deduced a trap composed of 37 places in 878 ms of which 14 ms to minimize.
[2023-03-20 00:39:54] [INFO ] Deduced a trap composed of 19 places in 876 ms of which 2 ms to minimize.
[2023-03-20 00:39:55] [INFO ] Deduced a trap composed of 35 places in 870 ms of which 8 ms to minimize.
[2023-03-20 00:39:56] [INFO ] Deduced a trap composed of 22 places in 782 ms of which 1 ms to minimize.
[2023-03-20 00:39:57] [INFO ] Deduced a trap composed of 36 places in 1101 ms of which 13 ms to minimize.
[2023-03-20 00:39:58] [INFO ] Deduced a trap composed of 37 places in 896 ms of which 2 ms to minimize.
[2023-03-20 00:39:59] [INFO ] Deduced a trap composed of 37 places in 726 ms of which 2 ms to minimize.
[2023-03-20 00:40:00] [INFO ] Deduced a trap composed of 18 places in 1033 ms of which 32 ms to minimize.
[2023-03-20 00:40:01] [INFO ] Deduced a trap composed of 19 places in 992 ms of which 5 ms to minimize.
[2023-03-20 00:40:02] [INFO ] Deduced a trap composed of 24 places in 870 ms of which 2 ms to minimize.
[2023-03-20 00:40:03] [INFO ] Deduced a trap composed of 25 places in 939 ms of which 1 ms to minimize.
[2023-03-20 00:40:04] [INFO ] Deduced a trap composed of 29 places in 967 ms of which 5 ms to minimize.
[2023-03-20 00:40:05] [INFO ] Deduced a trap composed of 22 places in 665 ms of which 3 ms to minimize.
[2023-03-20 00:40:06] [INFO ] Deduced a trap composed of 35 places in 781 ms of which 2 ms to minimize.
[2023-03-20 00:40:07] [INFO ] Deduced a trap composed of 22 places in 649 ms of which 2 ms to minimize.
[2023-03-20 00:40:08] [INFO ] Deduced a trap composed of 38 places in 817 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-20 00:40:08] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 00:40:08] [INFO ] After 25198ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:15
Fused 15 Parikh solutions to 14 different solutions.
Parikh walk visited 0 properties in 719 ms.
Support contains 23 out of 2374 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2374/2374 places, 2174/2174 transitions.
Drop transitions removed 465 transitions
Trivial Post-agglo rules discarded 465 transitions
Performed 465 trivial Post agglomeration. Transition count delta: 465
Iterating post reduction 0 with 465 rules applied. Total rules applied 465 place count 2374 transition count 1709
Reduce places removed 465 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 467 rules applied. Total rules applied 932 place count 1909 transition count 1707
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 934 place count 1907 transition count 1707
Performed 311 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 311 Pre rules applied. Total rules applied 934 place count 1907 transition count 1396
Deduced a syphon composed of 311 places in 2 ms
Reduce places removed 311 places and 0 transitions.
Iterating global reduction 3 with 622 rules applied. Total rules applied 1556 place count 1596 transition count 1396
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 1559 place count 1593 transition count 1393
Iterating global reduction 3 with 3 rules applied. Total rules applied 1562 place count 1593 transition count 1393
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 1562 place count 1593 transition count 1390
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 1568 place count 1590 transition count 1390
Performed 680 Post agglomeration using F-continuation condition.Transition count delta: 680
Deduced a syphon composed of 680 places in 1 ms
Reduce places removed 680 places and 0 transitions.
Iterating global reduction 3 with 1360 rules applied. Total rules applied 2928 place count 910 transition count 710
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2929 place count 910 transition count 709
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2931 place count 909 transition count 708
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -61
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 3133 place count 808 transition count 769
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 13 places in 4 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 3159 place count 795 transition count 778
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3160 place count 795 transition count 777
Free-agglomeration rule applied 3 times.
Iterating global reduction 5 with 3 rules applied. Total rules applied 3163 place count 795 transition count 774
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 3166 place count 792 transition count 774
Partial Free-agglomeration rule applied 40 times.
Drop transitions removed 40 transitions
Iterating global reduction 6 with 40 rules applied. Total rules applied 3206 place count 792 transition count 774
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 3207 place count 791 transition count 773
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 3209 place count 789 transition count 773
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 3209 place count 789 transition count 772
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 3211 place count 788 transition count 772
Applied a total of 3211 rules in 596 ms. Remains 788 /2374 variables (removed 1586) and now considering 772/2174 (removed 1402) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 597 ms. Remains : 788/2374 places, 772/2174 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 252 ms. (steps per millisecond=39 ) properties (out of 15) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 772 rows 788 cols
[2023-03-20 00:40:10] [INFO ] Computed 359 place invariants in 15 ms
[2023-03-20 00:40:10] [INFO ] [Real]Absence check using 359 positive place invariants in 227 ms returned sat
[2023-03-20 00:40:10] [INFO ] After 529ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-20 00:40:11] [INFO ] [Nat]Absence check using 359 positive place invariants in 175 ms returned sat
[2023-03-20 00:40:12] [INFO ] After 779ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-20 00:40:12] [INFO ] State equation strengthened by 134 read => feed constraints.
[2023-03-20 00:40:13] [INFO ] After 733ms SMT Verify possible using 134 Read/Feed constraints in natural domain returned unsat :0 sat :10
[2023-03-20 00:40:13] [INFO ] Deduced a trap composed of 5 places in 53 ms of which 1 ms to minimize.
[2023-03-20 00:40:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 100 ms
[2023-03-20 00:40:14] [INFO ] After 1731ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 632 ms.
[2023-03-20 00:40:14] [INFO ] After 3805ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Parikh walk visited 0 properties in 306 ms.
Support contains 17 out of 788 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 788/788 places, 772/772 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 788 transition count 771
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 787 transition count 771
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 2 place count 787 transition count 768
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 8 place count 784 transition count 768
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
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 14 place count 781 transition count 765
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 18 place count 779 transition count 768
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 19 place count 778 transition count 767
Applied a total of 19 rules in 105 ms. Remains 778 /788 variables (removed 10) and now considering 767/772 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 105 ms. Remains : 778/788 places, 767/772 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 218 ms. (steps per millisecond=45 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 10) 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 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 10) seen :0
Interrupted probabilistic random walk after 121141 steps, run timeout after 3001 ms. (steps per millisecond=40 ) properties seen :{}
Probabilistic random walk after 121141 steps, saw 78038 distinct states, run finished after 3002 ms. (steps per millisecond=40 ) properties seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 767 rows 778 cols
[2023-03-20 00:40:19] [INFO ] Computed 359 place invariants in 2 ms
[2023-03-20 00:40:19] [INFO ] [Real]Absence check using 359 positive place invariants in 49 ms returned sat
[2023-03-20 00:40:19] [INFO ] After 240ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-20 00:40:19] [INFO ] [Nat]Absence check using 359 positive place invariants in 50 ms returned sat
[2023-03-20 00:40:20] [INFO ] After 565ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-20 00:40:20] [INFO ] State equation strengthened by 134 read => feed constraints.
[2023-03-20 00:40:21] [INFO ] After 834ms SMT Verify possible using 134 Read/Feed constraints in natural domain returned unsat :0 sat :10
[2023-03-20 00:40:22] [INFO ] After 1726ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 706 ms.
[2023-03-20 00:40:22] [INFO ] After 3484ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Parikh walk visited 0 properties in 374 ms.
Support contains 17 out of 778 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 778/778 places, 767/767 transitions.
Applied a total of 0 rules in 17 ms. Remains 778 /778 variables (removed 0) and now considering 767/767 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 778/778 places, 767/767 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 778/778 places, 767/767 transitions.
Applied a total of 0 rules in 15 ms. Remains 778 /778 variables (removed 0) and now considering 767/767 (removed 0) transitions.
[2023-03-20 00:40:23] [INFO ] Invariant cache hit.
[2023-03-20 00:40:23] [INFO ] Implicit Places using invariants in 629 ms returned [767]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 646 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 777/778 places, 767/767 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 776 transition count 766
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 776 transition count 766
Applied a total of 2 rules in 22 ms. Remains 776 /777 variables (removed 1) and now considering 766/767 (removed 1) transitions.
// Phase 1: matrix 766 rows 776 cols
[2023-03-20 00:40:23] [INFO ] Computed 358 place invariants in 2 ms
[2023-03-20 00:40:24] [INFO ] Implicit Places using invariants in 561 ms returned []
[2023-03-20 00:40:24] [INFO ] Invariant cache hit.
[2023-03-20 00:40:24] [INFO ] State equation strengthened by 133 read => feed constraints.
[2023-03-20 00:40:27] [INFO ] Implicit Places using invariants and state equation in 2685 ms returned []
Implicit Place search using SMT with State Equation took 3249 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 776/778 places, 766/767 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 3932 ms. Remains : 776/778 places, 766/767 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 249 ms. (steps per millisecond=40 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 10) seen :0
Interrupted probabilistic random walk after 125769 steps, run timeout after 3001 ms. (steps per millisecond=41 ) properties seen :{}
Probabilistic random walk after 125769 steps, saw 81120 distinct states, run finished after 3001 ms. (steps per millisecond=41 ) properties seen :0
Running SMT prover for 10 properties.
[2023-03-20 00:40:31] [INFO ] Invariant cache hit.
[2023-03-20 00:40:31] [INFO ] [Real]Absence check using 358 positive place invariants in 43 ms returned sat
[2023-03-20 00:40:31] [INFO ] After 222ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-20 00:40:31] [INFO ] [Nat]Absence check using 358 positive place invariants in 65 ms returned sat
[2023-03-20 00:40:32] [INFO ] After 515ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-20 00:40:32] [INFO ] State equation strengthened by 133 read => feed constraints.
[2023-03-20 00:40:33] [INFO ] After 770ms SMT Verify possible using 133 Read/Feed constraints in natural domain returned unsat :0 sat :10
[2023-03-20 00:40:34] [INFO ] Deduced a trap composed of 5 places in 93 ms of which 1 ms to minimize.
[2023-03-20 00:40:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 169 ms
[2023-03-20 00:40:34] [INFO ] After 2058ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 938 ms.
[2023-03-20 00:40:35] [INFO ] After 3927ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Parikh walk visited 0 properties in 345 ms.
Support contains 17 out of 776 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 776/776 places, 766/766 transitions.
Applied a total of 0 rules in 14 ms. Remains 776 /776 variables (removed 0) and now considering 766/766 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 776/776 places, 766/766 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 776/776 places, 766/766 transitions.
Applied a total of 0 rules in 14 ms. Remains 776 /776 variables (removed 0) and now considering 766/766 (removed 0) transitions.
[2023-03-20 00:40:35] [INFO ] Invariant cache hit.
[2023-03-20 00:40:35] [INFO ] Implicit Places using invariants in 361 ms returned []
[2023-03-20 00:40:35] [INFO ] Invariant cache hit.
[2023-03-20 00:40:36] [INFO ] State equation strengthened by 133 read => feed constraints.
[2023-03-20 00:40:37] [INFO ] Implicit Places using invariants and state equation in 1936 ms returned []
Implicit Place search using SMT with State Equation took 2298 ms to find 0 implicit places.
[2023-03-20 00:40:37] [INFO ] Redundant transitions in 30 ms returned []
[2023-03-20 00:40:37] [INFO ] Invariant cache hit.
[2023-03-20 00:40:38] [INFO ] Dead Transitions using invariants and state equation in 386 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2752 ms. Remains : 776/776 places, 766/766 transitions.
Partial Free-agglomeration rule applied 122 times.
Drop transitions removed 122 transitions
Iterating global reduction 0 with 122 rules applied. Total rules applied 122 place count 776 transition count 766
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 124 place count 776 transition count 764
Applied a total of 124 rules in 44 ms. Remains 776 /776 variables (removed 0) and now considering 764/766 (removed 2) transitions.
Running SMT prover for 10 properties.
// Phase 1: matrix 764 rows 776 cols
[2023-03-20 00:40:38] [INFO ] Computed 358 place invariants in 2 ms
[2023-03-20 00:40:38] [INFO ] [Real]Absence check using 358 positive place invariants in 51 ms returned sat
[2023-03-20 00:40:38] [INFO ] After 288ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-20 00:40:39] [INFO ] [Nat]Absence check using 358 positive place invariants in 75 ms returned sat
[2023-03-20 00:40:39] [INFO ] After 682ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-20 00:40:39] [INFO ] State equation strengthened by 115 read => feed constraints.
[2023-03-20 00:40:40] [INFO ] After 632ms SMT Verify possible using 115 Read/Feed constraints in natural domain returned unsat :0 sat :10
[2023-03-20 00:40:40] [INFO ] Deduced a trap composed of 5 places in 96 ms of which 0 ms to minimize.
[2023-03-20 00:40:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 182 ms
[2023-03-20 00:40:41] [INFO ] After 1823ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 647 ms.
[2023-03-20 00:40:42] [INFO ] After 3723ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Computed a total of 640 stabilizing places and 640 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' '!((p0 U G(p1)))'
Support contains 3 out of 2374 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2374/2374 places, 2174/2174 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 479 transitions
Trivial Post-agglo rules discarded 479 transitions
Performed 479 trivial Post agglomeration. Transition count delta: 479
Iterating post reduction 0 with 479 rules applied. Total rules applied 479 place count 2373 transition count 1694
Reduce places removed 479 places and 0 transitions.
Iterating post reduction 1 with 479 rules applied. Total rules applied 958 place count 1894 transition count 1694
Performed 313 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 313 Pre rules applied. Total rules applied 958 place count 1894 transition count 1381
Deduced a syphon composed of 313 places in 1 ms
Reduce places removed 313 places and 0 transitions.
Iterating global reduction 2 with 626 rules applied. Total rules applied 1584 place count 1581 transition count 1381
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 1592 place count 1573 transition count 1373
Iterating global reduction 2 with 8 rules applied. Total rules applied 1600 place count 1573 transition count 1373
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 1600 place count 1573 transition count 1366
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 1614 place count 1566 transition count 1366
Performed 680 Post agglomeration using F-continuation condition.Transition count delta: 680
Deduced a syphon composed of 680 places in 0 ms
Reduce places removed 680 places and 0 transitions.
Iterating global reduction 2 with 1360 rules applied. Total rules applied 2974 place count 886 transition count 686
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2975 place count 886 transition count 685
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2977 place count 885 transition count 684
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -67
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 3179 place count 784 transition count 751
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 3213 place count 767 transition count 762
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 3214 place count 767 transition count 762
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3216 place count 765 transition count 760
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 3218 place count 763 transition count 760
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 3218 place count 763 transition count 759
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3220 place count 762 transition count 759
Applied a total of 3220 rules in 488 ms. Remains 762 /2374 variables (removed 1612) and now considering 759/2174 (removed 1415) transitions.
// Phase 1: matrix 759 rows 762 cols
[2023-03-20 00:40:43] [INFO ] Computed 359 place invariants in 2 ms
[2023-03-20 00:40:43] [INFO ] Implicit Places using invariants in 427 ms returned [751]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 430 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 761/2374 places, 759/2174 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 760 transition count 758
Applied a total of 2 rules in 39 ms. Remains 760 /761 variables (removed 1) and now considering 758/759 (removed 1) transitions.
// Phase 1: matrix 758 rows 760 cols
[2023-03-20 00:40:43] [INFO ] Computed 358 place invariants in 2 ms
[2023-03-20 00:40:44] [INFO ] Implicit Places using invariants in 404 ms returned []
[2023-03-20 00:40:44] [INFO ] Invariant cache hit.
[2023-03-20 00:40:45] [INFO ] Implicit Places using invariants and state equation in 1054 ms returned []
Implicit Place search using SMT with State Equation took 1460 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 760/2374 places, 758/2174 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2417 ms. Remains : 760/2374 places, 758/2174 transitions.
Stuttering acceptance computed with spot in 282 ms :[(NOT p1), true, (NOT p1)]
Running random walk in product with property : ShieldIIPt-PT-040B-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(AND p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(OR (EQ s397 1) (EQ s303 0) (EQ s454 1)), p0:(EQ s397 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 746 ms.
Entered a terminal (fully accepting) state of product in 92881 steps with 0 reset in 812 ms.
FORMULA ShieldIIPt-PT-040B-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-040B-LTLCardinality-00 finished in 4347 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 2 out of 2374 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2374/2374 places, 2174/2174 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 479 transitions
Trivial Post-agglo rules discarded 479 transitions
Performed 479 trivial Post agglomeration. Transition count delta: 479
Iterating post reduction 0 with 479 rules applied. Total rules applied 479 place count 2373 transition count 1694
Reduce places removed 479 places and 0 transitions.
Iterating post reduction 1 with 479 rules applied. Total rules applied 958 place count 1894 transition count 1694
Performed 313 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 313 Pre rules applied. Total rules applied 958 place count 1894 transition count 1381
Deduced a syphon composed of 313 places in 2 ms
Reduce places removed 313 places and 0 transitions.
Iterating global reduction 2 with 626 rules applied. Total rules applied 1584 place count 1581 transition count 1381
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 1593 place count 1572 transition count 1372
Iterating global reduction 2 with 9 rules applied. Total rules applied 1602 place count 1572 transition count 1372
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 1602 place count 1572 transition count 1364
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 1618 place count 1564 transition count 1364
Performed 679 Post agglomeration using F-continuation condition.Transition count delta: 679
Deduced a syphon composed of 679 places in 1 ms
Reduce places removed 679 places and 0 transitions.
Iterating global reduction 2 with 1358 rules applied. Total rules applied 2976 place count 885 transition count 685
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2977 place count 885 transition count 684
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2979 place count 884 transition count 683
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -66
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 3181 place count 783 transition count 749
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 3217 place count 765 transition count 762
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 3218 place count 765 transition count 762
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3220 place count 763 transition count 760
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 3222 place count 761 transition count 760
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 3222 place count 761 transition count 759
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3224 place count 760 transition count 759
Applied a total of 3224 rules in 382 ms. Remains 760 /2374 variables (removed 1614) and now considering 759/2174 (removed 1415) transitions.
// Phase 1: matrix 759 rows 760 cols
[2023-03-20 00:40:47] [INFO ] Computed 359 place invariants in 5 ms
[2023-03-20 00:40:47] [INFO ] Implicit Places using invariants in 463 ms returned [749]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 474 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 759/2374 places, 759/2174 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 758 transition count 758
Applied a total of 2 rules in 22 ms. Remains 758 /759 variables (removed 1) and now considering 758/759 (removed 1) transitions.
// Phase 1: matrix 758 rows 758 cols
[2023-03-20 00:40:47] [INFO ] Computed 358 place invariants in 1 ms
[2023-03-20 00:40:48] [INFO ] Implicit Places using invariants in 495 ms returned []
[2023-03-20 00:40:48] [INFO ] Invariant cache hit.
[2023-03-20 00:40:49] [INFO ] Implicit Places using invariants and state equation in 1159 ms returned []
Implicit Place search using SMT with State Equation took 1668 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 758/2374 places, 758/2174 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2546 ms. Remains : 758/2374 places, 758/2174 transitions.
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-040B-LTLCardinality-02 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:(OR (EQ s56 0) (EQ s531 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]]
Product exploration explored 100000 steps with 0 reset in 630 ms.
Product exploration explored 100000 steps with 0 reset in 928 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 192 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 274889 steps, run timeout after 3008 ms. (steps per millisecond=91 ) properties seen :{}
Probabilistic random walk after 274889 steps, saw 173350 distinct states, run finished after 3010 ms. (steps per millisecond=91 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-20 00:40:54] [INFO ] Invariant cache hit.
[2023-03-20 00:40:54] [INFO ] After 170ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 00:40:55] [INFO ] [Nat]Absence check using 358 positive place invariants in 77 ms returned sat
[2023-03-20 00:40:55] [INFO ] After 413ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 00:40:55] [INFO ] After 521ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 34 ms.
[2023-03-20 00:40:55] [INFO ] After 803ms 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 758 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 758/758 places, 758/758 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 758 transition count 757
Applied a total of 1 rules in 15 ms. Remains 758 /758 variables (removed 0) and now considering 757/758 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 758/758 places, 757/758 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 54 ms. (steps per millisecond=185 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 269866 steps, run timeout after 3001 ms. (steps per millisecond=89 ) properties seen :{}
Probabilistic random walk after 269866 steps, saw 169600 distinct states, run finished after 3001 ms. (steps per millisecond=89 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 757 rows 758 cols
[2023-03-20 00:40:58] [INFO ] Computed 358 place invariants in 4 ms
[2023-03-20 00:40:59] [INFO ] After 120ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 00:40:59] [INFO ] [Nat]Absence check using 358 positive place invariants in 74 ms returned sat
[2023-03-20 00:40:59] [INFO ] After 371ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 00:40:59] [INFO ] After 460ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 53 ms.
[2023-03-20 00:40:59] [INFO ] After 738ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 28 ms.
Support contains 2 out of 758 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 758/758 places, 757/757 transitions.
Applied a total of 0 rules in 23 ms. Remains 758 /758 variables (removed 0) and now considering 757/757 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 758/758 places, 757/757 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 758/758 places, 757/757 transitions.
Applied a total of 0 rules in 17 ms. Remains 758 /758 variables (removed 0) and now considering 757/757 (removed 0) transitions.
[2023-03-20 00:40:59] [INFO ] Invariant cache hit.
[2023-03-20 00:41:00] [INFO ] Implicit Places using invariants in 524 ms returned []
[2023-03-20 00:41:00] [INFO ] Invariant cache hit.
[2023-03-20 00:41:01] [INFO ] Implicit Places using invariants and state equation in 784 ms returned []
Implicit Place search using SMT with State Equation took 1311 ms to find 0 implicit places.
[2023-03-20 00:41:01] [INFO ] Redundant transitions in 16 ms returned []
[2023-03-20 00:41:01] [INFO ] Invariant cache hit.
[2023-03-20 00:41:01] [INFO ] Dead Transitions using invariants and state equation in 473 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1834 ms. Remains : 758/758 places, 757/757 transitions.
Partial Free-agglomeration rule applied 80 times.
Drop transitions removed 80 transitions
Iterating global reduction 0 with 80 rules applied. Total rules applied 80 place count 758 transition count 757
Applied a total of 80 rules in 30 ms. Remains 758 /758 variables (removed 0) and now considering 757/757 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 757 rows 758 cols
[2023-03-20 00:41:01] [INFO ] Computed 358 place invariants in 2 ms
[2023-03-20 00:41:01] [INFO ] After 90ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 00:41:01] [INFO ] [Nat]Absence check using 358 positive place invariants in 41 ms returned sat
[2023-03-20 00:41:02] [INFO ] After 262ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 00:41:02] [INFO ] After 323ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 25 ms.
[2023-03-20 00:41:02] [INFO ] After 498ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 153 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 758 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 758/758 places, 758/758 transitions.
Applied a total of 0 rules in 26 ms. Remains 758 /758 variables (removed 0) and now considering 758/758 (removed 0) transitions.
// Phase 1: matrix 758 rows 758 cols
[2023-03-20 00:41:02] [INFO ] Computed 358 place invariants in 3 ms
[2023-03-20 00:41:03] [INFO ] Implicit Places using invariants in 420 ms returned []
[2023-03-20 00:41:03] [INFO ] Invariant cache hit.
[2023-03-20 00:41:03] [INFO ] Implicit Places using invariants and state equation in 810 ms returned []
Implicit Place search using SMT with State Equation took 1249 ms to find 0 implicit places.
[2023-03-20 00:41:03] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-20 00:41:03] [INFO ] Invariant cache hit.
[2023-03-20 00:41:04] [INFO ] Dead Transitions using invariants and state equation in 369 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1665 ms. Remains : 758/758 places, 758/758 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 108 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 269572 steps, run timeout after 3001 ms. (steps per millisecond=89 ) properties seen :{}
Probabilistic random walk after 269572 steps, saw 170073 distinct states, run finished after 3001 ms. (steps per millisecond=89 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-20 00:41:07] [INFO ] Invariant cache hit.
[2023-03-20 00:41:07] [INFO ] After 137ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 00:41:07] [INFO ] [Nat]Absence check using 358 positive place invariants in 79 ms returned sat
[2023-03-20 00:41:08] [INFO ] After 335ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 00:41:08] [INFO ] After 406ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 36 ms.
[2023-03-20 00:41:08] [INFO ] After 671ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 11 ms.
Support contains 2 out of 758 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 758/758 places, 758/758 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 758 transition count 757
Applied a total of 1 rules in 21 ms. Remains 758 /758 variables (removed 0) and now considering 757/758 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 758/758 places, 757/758 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) 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
Interrupted probabilistic random walk after 283175 steps, run timeout after 3001 ms. (steps per millisecond=94 ) properties seen :{}
Probabilistic random walk after 283175 steps, saw 178240 distinct states, run finished after 3001 ms. (steps per millisecond=94 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 757 rows 758 cols
[2023-03-20 00:41:11] [INFO ] Computed 358 place invariants in 2 ms
[2023-03-20 00:41:11] [INFO ] After 149ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 00:41:11] [INFO ] [Nat]Absence check using 358 positive place invariants in 72 ms returned sat
[2023-03-20 00:41:12] [INFO ] After 341ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 00:41:12] [INFO ] After 413ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 47 ms.
[2023-03-20 00:41:12] [INFO ] After 672ms 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 758 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 758/758 places, 757/757 transitions.
Applied a total of 0 rules in 23 ms. Remains 758 /758 variables (removed 0) and now considering 757/757 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 758/758 places, 757/757 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 758/758 places, 757/757 transitions.
Applied a total of 0 rules in 16 ms. Remains 758 /758 variables (removed 0) and now considering 757/757 (removed 0) transitions.
[2023-03-20 00:41:12] [INFO ] Invariant cache hit.
[2023-03-20 00:41:12] [INFO ] Implicit Places using invariants in 446 ms returned []
[2023-03-20 00:41:12] [INFO ] Invariant cache hit.
[2023-03-20 00:41:13] [INFO ] Implicit Places using invariants and state equation in 809 ms returned []
Implicit Place search using SMT with State Equation took 1271 ms to find 0 implicit places.
[2023-03-20 00:41:13] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-20 00:41:13] [INFO ] Invariant cache hit.
[2023-03-20 00:41:14] [INFO ] Dead Transitions using invariants and state equation in 398 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1697 ms. Remains : 758/758 places, 757/757 transitions.
Partial Free-agglomeration rule applied 80 times.
Drop transitions removed 80 transitions
Iterating global reduction 0 with 80 rules applied. Total rules applied 80 place count 758 transition count 757
Applied a total of 80 rules in 27 ms. Remains 758 /758 variables (removed 0) and now considering 757/757 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 757 rows 758 cols
[2023-03-20 00:41:14] [INFO ] Computed 358 place invariants in 3 ms
[2023-03-20 00:41:14] [INFO ] After 87ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 00:41:14] [INFO ] [Nat]Absence check using 358 positive place invariants in 96 ms returned sat
[2023-03-20 00:41:14] [INFO ] After 275ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 00:41:14] [INFO ] After 331ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 38 ms.
[2023-03-20 00:41:14] [INFO ] After 557ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 182 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 138 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 159 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 625 ms.
Product exploration explored 100000 steps with 0 reset in 767 ms.
Support contains 2 out of 758 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 758/758 places, 758/758 transitions.
Applied a total of 0 rules in 14 ms. Remains 758 /758 variables (removed 0) and now considering 758/758 (removed 0) transitions.
// Phase 1: matrix 758 rows 758 cols
[2023-03-20 00:41:16] [INFO ] Computed 358 place invariants in 4 ms
[2023-03-20 00:41:17] [INFO ] Implicit Places using invariants in 444 ms returned []
[2023-03-20 00:41:17] [INFO ] Invariant cache hit.
[2023-03-20 00:41:18] [INFO ] Implicit Places using invariants and state equation in 887 ms returned []
Implicit Place search using SMT with State Equation took 1347 ms to find 0 implicit places.
[2023-03-20 00:41:18] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-20 00:41:18] [INFO ] Invariant cache hit.
[2023-03-20 00:41:18] [INFO ] Dead Transitions using invariants and state equation in 497 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1881 ms. Remains : 758/758 places, 758/758 transitions.
Treatment of property ShieldIIPt-PT-040B-LTLCardinality-02 finished in 31833 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)&&F(p1)&&(G(p3)||p2))))'
Support contains 5 out of 2374 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2374/2374 places, 2174/2174 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 2362 transition count 2162
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 2362 transition count 2162
Applied a total of 24 rules in 337 ms. Remains 2362 /2374 variables (removed 12) and now considering 2162/2174 (removed 12) transitions.
// Phase 1: matrix 2162 rows 2362 cols
[2023-03-20 00:41:19] [INFO ] Computed 361 place invariants in 18 ms
[2023-03-20 00:41:19] [INFO ] Implicit Places using invariants in 661 ms returned []
[2023-03-20 00:41:19] [INFO ] Invariant cache hit.
[2023-03-20 00:41:22] [INFO ] Implicit Places using invariants and state equation in 2847 ms returned []
Implicit Place search using SMT with State Equation took 3526 ms to find 0 implicit places.
[2023-03-20 00:41:22] [INFO ] Invariant cache hit.
[2023-03-20 00:41:23] [INFO ] Dead Transitions using invariants and state equation in 1251 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2362/2374 places, 2162/2174 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5118 ms. Remains : 2362/2374 places, 2162/2174 transitions.
Stuttering acceptance computed with spot in 256 ms :[(OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), true, (NOT p0), (NOT p1), (NOT p3)]
Running random walk in product with property : ShieldIIPt-PT-040B-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (AND (NOT p2) (NOT p3))), acceptance={} source=1 dest: 2}, { cond=(OR (AND p0 p2) (AND p0 p3)), acceptance={} source=1 dest: 3}, { cond=(OR (AND p0 (NOT p1) p2) (AND p0 (NOT p1) p3)), acceptance={} source=1 dest: 4}, { cond=(AND p0 (NOT p2) p3), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p3), acceptance={} source=5 dest: 2}, { cond=p3, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(EQ s1216 1), p2:(OR (EQ s1715 0) (EQ s945 1)), p3:(AND (OR (EQ s1271 0) (EQ s1674 1)) (EQ s1216 1)), p1:(OR (EQ s1715 0) (EQ s945 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-040B-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-040B-LTLCardinality-03 finished in 5412 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) U !p2)))&&F(G(p3)))))'
Support contains 5 out of 2374 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2374/2374 places, 2174/2174 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 476 transitions
Trivial Post-agglo rules discarded 476 transitions
Performed 476 trivial Post agglomeration. Transition count delta: 476
Iterating post reduction 0 with 476 rules applied. Total rules applied 476 place count 2373 transition count 1697
Reduce places removed 476 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 478 rules applied. Total rules applied 954 place count 1897 transition count 1695
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 956 place count 1895 transition count 1695
Performed 313 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 313 Pre rules applied. Total rules applied 956 place count 1895 transition count 1382
Deduced a syphon composed of 313 places in 2 ms
Reduce places removed 313 places and 0 transitions.
Iterating global reduction 3 with 626 rules applied. Total rules applied 1582 place count 1582 transition count 1382
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 1590 place count 1574 transition count 1374
Iterating global reduction 3 with 8 rules applied. Total rules applied 1598 place count 1574 transition count 1374
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 1598 place count 1574 transition count 1367
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 1612 place count 1567 transition count 1367
Performed 679 Post agglomeration using F-continuation condition.Transition count delta: 679
Deduced a syphon composed of 679 places in 1 ms
Reduce places removed 679 places and 0 transitions.
Iterating global reduction 3 with 1358 rules applied. Total rules applied 2970 place count 888 transition count 688
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2971 place count 888 transition count 687
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2973 place count 887 transition count 686
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -66
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 3175 place count 786 transition count 752
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 4 with 34 rules applied. Total rules applied 3209 place count 769 transition count 763
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3211 place count 767 transition count 761
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 3213 place count 765 transition count 761
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 3213 place count 765 transition count 760
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 3215 place count 764 transition count 760
Applied a total of 3215 rules in 373 ms. Remains 764 /2374 variables (removed 1610) and now considering 760/2174 (removed 1414) transitions.
// Phase 1: matrix 760 rows 764 cols
[2023-03-20 00:41:24] [INFO ] Computed 359 place invariants in 1 ms
[2023-03-20 00:41:25] [INFO ] Implicit Places using invariants in 452 ms returned [753]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 455 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 763/2374 places, 760/2174 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 762 transition count 759
Applied a total of 2 rules in 23 ms. Remains 762 /763 variables (removed 1) and now considering 759/760 (removed 1) transitions.
// Phase 1: matrix 759 rows 762 cols
[2023-03-20 00:41:25] [INFO ] Computed 358 place invariants in 2 ms
[2023-03-20 00:41:25] [INFO ] Implicit Places using invariants in 470 ms returned []
[2023-03-20 00:41:25] [INFO ] Invariant cache hit.
[2023-03-20 00:41:25] [INFO ] State equation strengthened by 144 read => feed constraints.
[2023-03-20 00:41:28] [INFO ] Implicit Places using invariants and state equation in 2606 ms returned []
Implicit Place search using SMT with State Equation took 3084 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 762/2374 places, 759/2174 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3935 ms. Remains : 762/2374 places, 759/2174 transitions.
Stuttering acceptance computed with spot in 256 ms :[(OR (NOT p0) (NOT p3) p2), (OR (NOT p0) p2), (NOT p3), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2)), p2]
Running random walk in product with property : ShieldIIPt-PT-040B-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (NOT p0) (AND p2 (NOT p1))), acceptance={} source=0 dest: 1}, { cond=(NOT p3), acceptance={} source=0 dest: 2}, { cond=(AND p0 p2 p1), acceptance={} source=0 dest: 4}], [{ cond=(OR (NOT p0) (AND p2 (NOT p1))), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p2 p1), acceptance={} source=1 dest: 3}, { cond=(AND p0 p2 p1), acceptance={0} source=1 dest: 4}], [{ cond=p3, acceptance={} source=2 dest: 2}, { cond=(NOT p3), acceptance={0} source=2 dest: 2}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND p2 (NOT p1))), acceptance={0} source=3 dest: 1}, { cond=(OR (AND (NOT p0) p1) (AND p2 p1)), acceptance={} source=3 dest: 3}], [{ cond=(AND p2 (NOT p1)), acceptance={0} source=4 dest: 1}, { cond=(AND p2 p1), acceptance={} source=4 dest: 3}, { cond=(AND p2 p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s342 1), p2:(OR (EQ s597 0) (EQ s536 1)), p1:(OR (EQ s169 0) (EQ s289 1)), p3:(AND (EQ s536 0) (EQ s597 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA ShieldIIPt-PT-040B-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-040B-LTLCardinality-04 finished in 4212 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)||X(F(p1))))'
Support contains 4 out of 2374 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2374/2374 places, 2174/2174 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 2362 transition count 2162
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 2362 transition count 2162
Applied a total of 24 rules in 263 ms. Remains 2362 /2374 variables (removed 12) and now considering 2162/2174 (removed 12) transitions.
// Phase 1: matrix 2162 rows 2362 cols
[2023-03-20 00:41:28] [INFO ] Computed 361 place invariants in 13 ms
[2023-03-20 00:41:29] [INFO ] Implicit Places using invariants in 726 ms returned []
[2023-03-20 00:41:29] [INFO ] Invariant cache hit.
[2023-03-20 00:41:31] [INFO ] Implicit Places using invariants and state equation in 2406 ms returned []
Implicit Place search using SMT with State Equation took 3153 ms to find 0 implicit places.
[2023-03-20 00:41:31] [INFO ] Invariant cache hit.
[2023-03-20 00:41:33] [INFO ] Dead Transitions using invariants and state equation in 1263 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2362/2374 places, 2162/2174 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4684 ms. Remains : 2362/2374 places, 2162/2174 transitions.
Stuttering acceptance computed with spot in 91 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPt-PT-040B-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(OR (EQ s1721 0) (EQ s1560 1)), p0:(OR (EQ s1890 0) (EQ s1309 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1242 ms.
Product exploration explored 100000 steps with 50000 reset in 1193 ms.
Computed a total of 638 stabilizing places and 638 stable transitions
Computed a total of 638 stabilizing places and 638 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p1)
Knowledge based reduction with 7 factoid took 147 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPt-PT-040B-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPt-PT-040B-LTLCardinality-05 finished in 7418 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&X(F(p1)))))'
Support contains 4 out of 2374 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2374/2374 places, 2174/2174 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 2362 transition count 2162
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 2362 transition count 2162
Applied a total of 24 rules in 307 ms. Remains 2362 /2374 variables (removed 12) and now considering 2162/2174 (removed 12) transitions.
// Phase 1: matrix 2162 rows 2362 cols
[2023-03-20 00:41:36] [INFO ] Computed 361 place invariants in 14 ms
[2023-03-20 00:41:36] [INFO ] Implicit Places using invariants in 733 ms returned []
[2023-03-20 00:41:36] [INFO ] Invariant cache hit.
[2023-03-20 00:41:39] [INFO ] Implicit Places using invariants and state equation in 2181 ms returned []
Implicit Place search using SMT with State Equation took 2936 ms to find 0 implicit places.
[2023-03-20 00:41:39] [INFO ] Invariant cache hit.
[2023-03-20 00:41:40] [INFO ] Dead Transitions using invariants and state equation in 1158 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2362/2374 places, 2162/2174 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4416 ms. Remains : 2362/2374 places, 2162/2174 transitions.
Stuttering acceptance computed with spot in 90 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : ShieldIIPt-PT-040B-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(AND (EQ s252 0) (EQ s4 1)), p0:(OR (EQ s317 0) (EQ s448 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 6648 reset in 296 ms.
Product exploration explored 100000 steps with 6668 reset in 348 ms.
Computed a total of 638 stabilizing places and 638 stable transitions
Computed a total of 638 stabilizing places and 638 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X p0), true, (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 180 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 106 ms :[(NOT p1), (NOT p1), (NOT p1)]
Finished random walk after 13 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=13 )
Knowledge obtained : [(AND (NOT p1) p0), (X p0), true, (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 4 factoid took 218 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 133 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 170 ms :[(NOT p1), (NOT p1), (NOT p1)]
[2023-03-20 00:41:41] [INFO ] Invariant cache hit.
[2023-03-20 00:41:43] [INFO ] [Real]Absence check using 361 positive place invariants in 319 ms returned sat
[2023-03-20 00:41:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 00:41:53] [INFO ] [Real]Absence check using state equation in 10470 ms returned sat
[2023-03-20 00:41:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 00:41:54] [INFO ] [Nat]Absence check using 361 positive place invariants in 149 ms returned sat
[2023-03-20 00:41:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 00:41:56] [INFO ] [Nat]Absence check using state equation in 1318 ms returned sat
[2023-03-20 00:41:56] [INFO ] Computed and/alt/rep : 2161/3242/2161 causal constraints (skipped 0 transitions) in 142 ms.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:520)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:614)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-20 00:42:08] [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)
Support contains 2 out of 2362 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 2362/2362 places, 2162/2162 transitions.
Applied a total of 0 rules in 163 ms. Remains 2362 /2362 variables (removed 0) and now considering 2162/2162 (removed 0) transitions.
[2023-03-20 00:42:09] [INFO ] Invariant cache hit.
[2023-03-20 00:42:09] [INFO ] Implicit Places using invariants in 819 ms returned []
[2023-03-20 00:42:09] [INFO ] Invariant cache hit.
[2023-03-20 00:42:12] [INFO ] Implicit Places using invariants and state equation in 2384 ms returned []
Implicit Place search using SMT with State Equation took 3205 ms to find 0 implicit places.
[2023-03-20 00:42:12] [INFO ] Invariant cache hit.
[2023-03-20 00:42:13] [INFO ] Dead Transitions using invariants and state equation in 1331 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4712 ms. Remains : 2362/2362 places, 2162/2162 transitions.
Computed a total of 638 stabilizing places and 638 stable transitions
Computed a total of 638 stabilizing places and 638 stable transitions
Knowledge obtained : [(NOT p1), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 89 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 114 ms :[(NOT p1), (NOT p1), (NOT p1)]
Finished random walk after 5 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=5 )
Knowledge obtained : [(NOT p1), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 2 factoid took 186 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 223 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 152 ms :[(NOT p1), (NOT p1), (NOT p1)]
[2023-03-20 00:42:14] [INFO ] Invariant cache hit.
[2023-03-20 00:42:16] [INFO ] [Real]Absence check using 361 positive place invariants in 268 ms returned sat
[2023-03-20 00:42:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 00:42:25] [INFO ] [Real]Absence check using state equation in 9718 ms returned sat
[2023-03-20 00:42:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 00:42:27] [INFO ] [Nat]Absence check using 361 positive place invariants in 155 ms returned sat
[2023-03-20 00:42:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 00:42:28] [INFO ] [Nat]Absence check using state equation in 1410 ms returned sat
[2023-03-20 00:42:29] [INFO ] Computed and/alt/rep : 2161/3242/2161 causal constraints (skipped 0 transitions) in 173 ms.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:520)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:614)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-20 00:42:41] [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)
Stuttering acceptance computed with spot in 165 ms :[(NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 6698 reset in 381 ms.
Product exploration explored 100000 steps with 6641 reset in 390 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 168 ms :[(NOT p1), (NOT p1), (NOT p1)]
Support contains 2 out of 2362 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2362/2362 places, 2162/2162 transitions.
Performed 477 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 477 rules applied. Total rules applied 477 place count 2362 transition count 2162
Performed 162 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 162 Pre rules applied. Total rules applied 477 place count 2362 transition count 2284
Deduced a syphon composed of 639 places in 3 ms
Iterating global reduction 1 with 162 rules applied. Total rules applied 639 place count 2362 transition count 2284
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 640 place count 2361 transition count 2283
Deduced a syphon composed of 639 places in 3 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 641 place count 2361 transition count 2283
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 641 place count 2361 transition count 2284
Deduced a syphon composed of 640 places in 2 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 642 place count 2361 transition count 2284
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 643 place count 2360 transition count 2282
Deduced a syphon composed of 639 places in 3 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 644 place count 2360 transition count 2282
Performed 797 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1436 places in 3 ms
Iterating global reduction 1 with 797 rules applied. Total rules applied 1441 place count 2360 transition count 2282
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 1442 place count 2360 transition count 2281
Renaming transitions due to excessive name length > 1024 char.
Discarding 319 places :
Symmetric choice reduction at 2 with 319 rule applications. Total rules 1761 place count 2041 transition count 1962
Deduced a syphon composed of 1117 places in 1 ms
Iterating global reduction 2 with 319 rules applied. Total rules applied 2080 place count 2041 transition count 1962
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1118 places in 2 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 2081 place count 2041 transition count 1962
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 2083 place count 2039 transition count 1960
Deduced a syphon composed of 1116 places in 1 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 2085 place count 2039 transition count 1960
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -529
Deduced a syphon composed of 1217 places in 2 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 2186 place count 2039 transition count 2489
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 2287 place count 1938 transition count 2287
Deduced a syphon composed of 1116 places in 2 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 2388 place count 1938 transition count 2287
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: -309
Deduced a syphon composed of 1174 places in 2 ms
Iterating global reduction 2 with 58 rules applied. Total rules applied 2446 place count 1938 transition count 2596
Discarding 58 places :
Symmetric choice reduction at 2 with 58 rule applications. Total rules 2504 place count 1880 transition count 2480
Deduced a syphon composed of 1116 places in 3 ms
Iterating global reduction 2 with 58 rules applied. Total rules applied 2562 place count 1880 transition count 2480
Deduced a syphon composed of 1116 places in 3 ms
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 2 with 9 rules applied. Total rules applied 2571 place count 1880 transition count 2471
Deduced a syphon composed of 1116 places in 3 ms
Applied a total of 2571 rules in 1755 ms. Remains 1880 /2362 variables (removed 482) and now considering 2471/2162 (removed -309) transitions.
[2023-03-20 00:42:44] [INFO ] Redundant transitions in 36 ms returned []
// Phase 1: matrix 2471 rows 1880 cols
[2023-03-20 00:42:44] [INFO ] Computed 361 place invariants in 38 ms
[2023-03-20 00:42:45] [INFO ] Dead Transitions using invariants and state equation in 1159 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1880/2362 places, 2471/2162 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2966 ms. Remains : 1880/2362 places, 2471/2162 transitions.
Support contains 2 out of 2362 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2362/2362 places, 2162/2162 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 2361 transition count 2161
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 2361 transition count 2161
Applied a total of 2 rules in 274 ms. Remains 2361 /2362 variables (removed 1) and now considering 2161/2162 (removed 1) transitions.
// Phase 1: matrix 2161 rows 2361 cols
[2023-03-20 00:42:45] [INFO ] Computed 361 place invariants in 16 ms
[2023-03-20 00:42:46] [INFO ] Implicit Places using invariants in 855 ms returned []
[2023-03-20 00:42:46] [INFO ] Invariant cache hit.
[2023-03-20 00:42:49] [INFO ] Implicit Places using invariants and state equation in 2574 ms returned []
Implicit Place search using SMT with State Equation took 3429 ms to find 0 implicit places.
[2023-03-20 00:42:49] [INFO ] Invariant cache hit.
[2023-03-20 00:42:50] [INFO ] Dead Transitions using invariants and state equation in 1482 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2361/2362 places, 2161/2162 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5188 ms. Remains : 2361/2362 places, 2161/2162 transitions.
Treatment of property ShieldIIPt-PT-040B-LTLCardinality-09 finished in 74954 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 2374 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2374/2374 places, 2174/2174 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 2361 transition count 2161
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 2361 transition count 2161
Applied a total of 26 rules in 254 ms. Remains 2361 /2374 variables (removed 13) and now considering 2161/2174 (removed 13) transitions.
[2023-03-20 00:42:51] [INFO ] Invariant cache hit.
[2023-03-20 00:42:52] [INFO ] Implicit Places using invariants in 950 ms returned []
[2023-03-20 00:42:52] [INFO ] Invariant cache hit.
[2023-03-20 00:42:54] [INFO ] Implicit Places using invariants and state equation in 2511 ms returned []
Implicit Place search using SMT with State Equation took 3501 ms to find 0 implicit places.
[2023-03-20 00:42:54] [INFO ] Invariant cache hit.
[2023-03-20 00:42:56] [INFO ] Dead Transitions using invariants and state equation in 1435 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2361/2374 places, 2161/2174 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5194 ms. Remains : 2361/2374 places, 2161/2174 transitions.
Stuttering acceptance computed with spot in 85 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-040B-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s970 0) (EQ s982 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 490 steps with 0 reset in 2 ms.
FORMULA ShieldIIPt-PT-040B-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-040B-LTLCardinality-10 finished in 5314 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)&&X((X(X(p1)) U G(!p0)))))'
Support contains 4 out of 2374 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2374/2374 places, 2174/2174 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 2364 transition count 2164
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 2364 transition count 2164
Applied a total of 20 rules in 246 ms. Remains 2364 /2374 variables (removed 10) and now considering 2164/2174 (removed 10) transitions.
// Phase 1: matrix 2164 rows 2364 cols
[2023-03-20 00:42:56] [INFO ] Computed 361 place invariants in 14 ms
[2023-03-20 00:42:57] [INFO ] Implicit Places using invariants in 1012 ms returned []
[2023-03-20 00:42:57] [INFO ] Invariant cache hit.
[2023-03-20 00:42:59] [INFO ] Implicit Places using invariants and state equation in 2500 ms returned []
Implicit Place search using SMT with State Equation took 3517 ms to find 0 implicit places.
[2023-03-20 00:42:59] [INFO ] Invariant cache hit.
[2023-03-20 00:43:01] [INFO ] Dead Transitions using invariants and state equation in 1456 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2364/2374 places, 2164/2174 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5221 ms. Remains : 2364/2374 places, 2164/2174 transitions.
Stuttering acceptance computed with spot in 516 ms :[true, (NOT p0), p0, (NOT p1), (AND (NOT p1) p0), (NOT p1), true, (AND p0 (NOT p1)), (AND p0 p1)]
Running random walk in product with property : ShieldIIPt-PT-040B-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}, { cond=p0, acceptance={0} source=2 dest: 2}, { cond=p0, acceptance={} source=2 dest: 3}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 5}], [{ cond=p0, acceptance={} source=4 dest: 5}, { cond=(NOT p0), acceptance={} source=4 dest: 7}], [{ cond=(NOT p1), acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=7 dest: 6}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=7 dest: 8}], [{ cond=(AND p0 p1), acceptance={} source=8 dest: 6}, { cond=(AND (NOT p0) p1), acceptance={} source=8 dest: 8}]], initial=0, aps=[p0:(OR (EQ s2293 0) (EQ s774 1)), p1:(OR (EQ s78 0) (EQ s1105 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 19969 reset in 581 ms.
Product exploration explored 100000 steps with 19974 reset in 546 ms.
Computed a total of 638 stabilizing places and 638 stable transitions
Computed a total of 638 stabilizing places and 638 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 384 ms. Reduced automaton from 9 states, 16 edges and 2 AP (stutter sensitive) to 8 states, 14 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 397 ms :[p0, p0, (NOT p1), (AND (NOT p1) p0), (NOT p1), true, (AND p0 (NOT p1)), (AND p0 p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 209 ms. (steps per millisecond=47 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-20 00:43:04] [INFO ] Invariant cache hit.
[2023-03-20 00:43:04] [INFO ] After 377ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-20 00:43:04] [INFO ] [Nat]Absence check using 361 positive place invariants in 122 ms returned sat
[2023-03-20 00:43:06] [INFO ] After 1821ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-20 00:43:08] [INFO ] Deduced a trap composed of 19 places in 980 ms of which 16 ms to minimize.
[2023-03-20 00:43:08] [INFO ] Deduced a trap composed of 19 places in 570 ms of which 1 ms to minimize.
[2023-03-20 00:43:09] [INFO ] Deduced a trap composed of 35 places in 504 ms of which 1 ms to minimize.
[2023-03-20 00:43:10] [INFO ] Deduced a trap composed of 20 places in 729 ms of which 1 ms to minimize.
[2023-03-20 00:43:10] [INFO ] Deduced a trap composed of 18 places in 466 ms of which 1 ms to minimize.
[2023-03-20 00:43:11] [INFO ] Deduced a trap composed of 21 places in 469 ms of which 1 ms to minimize.
[2023-03-20 00:43:11] [INFO ] Deduced a trap composed of 23 places in 465 ms of which 1 ms to minimize.
[2023-03-20 00:43:12] [INFO ] Deduced a trap composed of 22 places in 523 ms of which 1 ms to minimize.
[2023-03-20 00:43:12] [INFO ] Deduced a trap composed of 24 places in 497 ms of which 1 ms to minimize.
[2023-03-20 00:43:13] [INFO ] Deduced a trap composed of 18 places in 451 ms of which 13 ms to minimize.
[2023-03-20 00:43:14] [INFO ] Deduced a trap composed of 31 places in 459 ms of which 2 ms to minimize.
[2023-03-20 00:43:14] [INFO ] Deduced a trap composed of 23 places in 459 ms of which 1 ms to minimize.
[2023-03-20 00:43:15] [INFO ] Deduced a trap composed of 28 places in 436 ms of which 1 ms to minimize.
[2023-03-20 00:43:15] [INFO ] Deduced a trap composed of 26 places in 419 ms of which 1 ms to minimize.
[2023-03-20 00:43:16] [INFO ] Deduced a trap composed of 27 places in 455 ms of which 1 ms to minimize.
[2023-03-20 00:43:16] [INFO ] Deduced a trap composed of 28 places in 445 ms of which 1 ms to minimize.
[2023-03-20 00:43:17] [INFO ] Deduced a trap composed of 30 places in 712 ms of which 1 ms to minimize.
[2023-03-20 00:43:17] [INFO ] Deduced a trap composed of 30 places in 411 ms of which 1 ms to minimize.
[2023-03-20 00:43:18] [INFO ] Deduced a trap composed of 29 places in 487 ms of which 1 ms to minimize.
[2023-03-20 00:43:18] [INFO ] Deduced a trap composed of 24 places in 394 ms of which 1 ms to minimize.
[2023-03-20 00:43:19] [INFO ] Deduced a trap composed of 31 places in 391 ms of which 0 ms to minimize.
[2023-03-20 00:43:19] [INFO ] Deduced a trap composed of 41 places in 394 ms of which 1 ms to minimize.
[2023-03-20 00:43:20] [INFO ] Deduced a trap composed of 30 places in 388 ms of which 1 ms to minimize.
[2023-03-20 00:43:20] [INFO ] Deduced a trap composed of 31 places in 373 ms of which 1 ms to minimize.
[2023-03-20 00:43:21] [INFO ] Deduced a trap composed of 29 places in 435 ms of which 1 ms to minimize.
[2023-03-20 00:43:21] [INFO ] Deduced a trap composed of 25 places in 413 ms of which 2 ms to minimize.
[2023-03-20 00:43:22] [INFO ] Deduced a trap composed of 34 places in 389 ms of which 1 ms to minimize.
[2023-03-20 00:43:22] [INFO ] Deduced a trap composed of 38 places in 374 ms of which 1 ms to minimize.
[2023-03-20 00:43:23] [INFO ] Deduced a trap composed of 41 places in 346 ms of which 1 ms to minimize.
[2023-03-20 00:43:23] [INFO ] Deduced a trap composed of 44 places in 400 ms of which 1 ms to minimize.
[2023-03-20 00:43:24] [INFO ] Deduced a trap composed of 29 places in 383 ms of which 1 ms to minimize.
[2023-03-20 00:43:24] [INFO ] Deduced a trap composed of 42 places in 390 ms of which 2 ms to minimize.
[2023-03-20 00:43:25] [INFO ] Deduced a trap composed of 34 places in 410 ms of which 4 ms to minimize.
[2023-03-20 00:43:25] [INFO ] Deduced a trap composed of 40 places in 400 ms of which 1 ms to minimize.
[2023-03-20 00:43:26] [INFO ] Deduced a trap composed of 41 places in 301 ms of which 1 ms to minimize.
[2023-03-20 00:43:26] [INFO ] Deduced a trap composed of 38 places in 413 ms of which 2 ms to minimize.
[2023-03-20 00:43:27] [INFO ] Deduced a trap composed of 41 places in 390 ms of which 1 ms to minimize.
[2023-03-20 00:43:27] [INFO ] Deduced a trap composed of 45 places in 346 ms of which 1 ms to minimize.
[2023-03-20 00:43:27] [INFO ] Deduced a trap composed of 38 places in 323 ms of which 0 ms to minimize.
[2023-03-20 00:43:28] [INFO ] Deduced a trap composed of 36 places in 291 ms of which 1 ms to minimize.
[2023-03-20 00:43:28] [INFO ] Deduced a trap composed of 42 places in 306 ms of which 0 ms to minimize.
[2023-03-20 00:43:28] [INFO ] Deduced a trap composed of 41 places in 300 ms of which 1 ms to minimize.
[2023-03-20 00:43:29] [INFO ] Deduced a trap composed of 39 places in 322 ms of which 1 ms to minimize.
[2023-03-20 00:43:29] [INFO ] Deduced a trap composed of 48 places in 357 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-20 00:43:29] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 00:43:29] [INFO ] After 25274ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Parikh walk visited 0 properties in 121 ms.
Support contains 4 out of 2364 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2364/2364 places, 2164/2164 transitions.
Drop transitions removed 479 transitions
Trivial Post-agglo rules discarded 479 transitions
Performed 479 trivial Post agglomeration. Transition count delta: 479
Iterating post reduction 0 with 479 rules applied. Total rules applied 479 place count 2364 transition count 1685
Reduce places removed 479 places and 0 transitions.
Iterating post reduction 1 with 479 rules applied. Total rules applied 958 place count 1885 transition count 1685
Performed 318 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 318 Pre rules applied. Total rules applied 958 place count 1885 transition count 1367
Deduced a syphon composed of 318 places in 4 ms
Reduce places removed 318 places and 0 transitions.
Iterating global reduction 2 with 636 rules applied. Total rules applied 1594 place count 1567 transition count 1367
Performed 681 Post agglomeration using F-continuation condition.Transition count delta: 681
Deduced a syphon composed of 681 places in 0 ms
Reduce places removed 681 places and 0 transitions.
Iterating global reduction 2 with 1362 rules applied. Total rules applied 2956 place count 886 transition count 686
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2957 place count 886 transition count 685
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2959 place count 885 transition count 684
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -66
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 3161 place count 784 transition count 750
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 3197 place count 766 transition count 763
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3198 place count 766 transition count 762
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 3199 place count 766 transition count 761
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3200 place count 765 transition count 761
Partial Free-agglomeration rule applied 40 times.
Drop transitions removed 40 transitions
Iterating global reduction 5 with 40 rules applied. Total rules applied 3240 place count 765 transition count 761
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 3241 place count 764 transition count 760
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 3243 place count 762 transition count 760
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 3243 place count 762 transition count 759
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 3245 place count 761 transition count 759
Applied a total of 3245 rules in 337 ms. Remains 761 /2364 variables (removed 1603) and now considering 759/2164 (removed 1405) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 337 ms. Remains : 761/2364 places, 759/2164 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 225 ms. (steps per millisecond=44 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 199320 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :{}
Probabilistic random walk after 199320 steps, saw 111776 distinct states, run finished after 3001 ms. (steps per millisecond=66 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 759 rows 761 cols
[2023-03-20 00:43:33] [INFO ] Computed 359 place invariants in 4 ms
[2023-03-20 00:43:33] [INFO ] After 154ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-20 00:43:33] [INFO ] [Nat]Absence check using 359 positive place invariants in 47 ms returned sat
[2023-03-20 00:43:34] [INFO ] After 376ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-20 00:43:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-20 00:43:34] [INFO ] After 111ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-20 00:43:34] [INFO ] After 335ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 172 ms.
[2023-03-20 00:43:34] [INFO ] After 1098ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 94 ms.
Support contains 4 out of 761 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 761/761 places, 759/759 transitions.
Applied a total of 0 rules in 25 ms. Remains 761 /761 variables (removed 0) and now considering 759/759 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 761/761 places, 759/759 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 761/761 places, 759/759 transitions.
Applied a total of 0 rules in 12 ms. Remains 761 /761 variables (removed 0) and now considering 759/759 (removed 0) transitions.
[2023-03-20 00:43:35] [INFO ] Invariant cache hit.
[2023-03-20 00:43:35] [INFO ] Implicit Places using invariants in 476 ms returned [750]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 477 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 760/761 places, 759/759 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 759 transition count 758
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 759 transition count 758
Applied a total of 2 rules in 19 ms. Remains 759 /760 variables (removed 1) and now considering 758/759 (removed 1) transitions.
// Phase 1: matrix 758 rows 759 cols
[2023-03-20 00:43:35] [INFO ] Computed 358 place invariants in 2 ms
[2023-03-20 00:43:35] [INFO ] Implicit Places using invariants in 387 ms returned []
[2023-03-20 00:43:35] [INFO ] Invariant cache hit.
[2023-03-20 00:43:37] [INFO ] Implicit Places using invariants and state equation in 1230 ms returned []
Implicit Place search using SMT with State Equation took 1618 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 759/761 places, 758/759 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2126 ms. Remains : 759/761 places, 758/759 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 210 ms. (steps per millisecond=47 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 173314 steps, run timeout after 3001 ms. (steps per millisecond=57 ) properties seen :{}
Probabilistic random walk after 173314 steps, saw 94866 distinct states, run finished after 3001 ms. (steps per millisecond=57 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-20 00:43:40] [INFO ] Invariant cache hit.
[2023-03-20 00:43:40] [INFO ] After 130ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-20 00:43:40] [INFO ] [Nat]Absence check using 358 positive place invariants in 49 ms returned sat
[2023-03-20 00:43:41] [INFO ] After 396ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-20 00:43:41] [INFO ] After 618ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 169 ms.
[2023-03-20 00:43:41] [INFO ] After 1001ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 168 ms.
Support contains 4 out of 759 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 759/759 places, 758/758 transitions.
Applied a total of 0 rules in 11 ms. Remains 759 /759 variables (removed 0) and now considering 758/758 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 759/759 places, 758/758 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 759/759 places, 758/758 transitions.
Applied a total of 0 rules in 11 ms. Remains 759 /759 variables (removed 0) and now considering 758/758 (removed 0) transitions.
[2023-03-20 00:43:41] [INFO ] Invariant cache hit.
[2023-03-20 00:43:42] [INFO ] Implicit Places using invariants in 432 ms returned []
[2023-03-20 00:43:42] [INFO ] Invariant cache hit.
[2023-03-20 00:43:43] [INFO ] Implicit Places using invariants and state equation in 1199 ms returned []
Implicit Place search using SMT with State Equation took 1636 ms to find 0 implicit places.
[2023-03-20 00:43:43] [INFO ] Redundant transitions in 11 ms returned []
[2023-03-20 00:43:43] [INFO ] Invariant cache hit.
[2023-03-20 00:43:43] [INFO ] Dead Transitions using invariants and state equation in 455 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2120 ms. Remains : 759/759 places, 758/758 transitions.
Partial Free-agglomeration rule applied 79 times.
Drop transitions removed 79 transitions
Iterating global reduction 0 with 79 rules applied. Total rules applied 79 place count 759 transition count 758
Applied a total of 79 rules in 34 ms. Remains 759 /759 variables (removed 0) and now considering 758/758 (removed 0) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 758 rows 759 cols
[2023-03-20 00:43:44] [INFO ] Computed 358 place invariants in 2 ms
[2023-03-20 00:43:44] [INFO ] After 114ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-20 00:43:44] [INFO ] [Nat]Absence check using 358 positive place invariants in 58 ms returned sat
[2023-03-20 00:43:44] [INFO ] After 414ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-20 00:43:44] [INFO ] State equation strengthened by 76 read => feed constraints.
[2023-03-20 00:43:45] [INFO ] After 199ms SMT Verify possible using 76 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-20 00:43:45] [INFO ] After 504ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 212 ms.
[2023-03-20 00:43:45] [INFO ] After 1403ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND p0 p1), (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT (AND p1 p0))), (F (AND p1 (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 4 factoid took 396 ms. Reduced automaton from 8 states, 14 edges and 2 AP (stutter sensitive) to 8 states, 14 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 431 ms :[p0, p0, (NOT p1), (AND (NOT p1) p0), (NOT p1), true, (AND p0 (NOT p1)), (AND p0 p1)]
Stuttering acceptance computed with spot in 457 ms :[p0, p0, (NOT p1), (AND (NOT p1) p0), (NOT p1), true, (AND p0 (NOT p1)), (AND p0 p1)]
// Phase 1: matrix 2164 rows 2364 cols
[2023-03-20 00:43:46] [INFO ] Computed 361 place invariants in 6 ms
[2023-03-20 00:43:48] [INFO ] [Real]Absence check using 361 positive place invariants in 513 ms returned sat
[2023-03-20 00:43:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 00:43:59] [INFO ] [Real]Absence check using state equation in 10792 ms returned sat
[2023-03-20 00:43:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 00:44:01] [INFO ] [Nat]Absence check using 361 positive place invariants in 488 ms returned sat
[2023-03-20 00:44:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 00:44:13] [INFO ] [Nat]Absence check using state equation in 12407 ms returned sat
[2023-03-20 00:44:13] [INFO ] Computed and/alt/rep : 2163/3245/2163 causal constraints (skipped 0 transitions) in 110 ms.
[2023-03-20 00:44:15] [INFO ] Deduced a trap composed of 17 places in 1451 ms of which 5 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:520)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:614)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-20 00:44: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 p0
Could not prove EG p0
Support contains 4 out of 2364 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2364/2364 places, 2164/2164 transitions.
Applied a total of 0 rules in 123 ms. Remains 2364 /2364 variables (removed 0) and now considering 2164/2164 (removed 0) transitions.
[2023-03-20 00:44:16] [INFO ] Invariant cache hit.
[2023-03-20 00:44:17] [INFO ] Implicit Places using invariants in 954 ms returned []
[2023-03-20 00:44:17] [INFO ] Invariant cache hit.
[2023-03-20 00:44:19] [INFO ] Implicit Places using invariants and state equation in 2580 ms returned []
Implicit Place search using SMT with State Equation took 3551 ms to find 0 implicit places.
[2023-03-20 00:44:19] [INFO ] Invariant cache hit.
[2023-03-20 00:44:21] [INFO ] Dead Transitions using invariants and state equation in 1402 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5090 ms. Remains : 2364/2364 places, 2164/2164 transitions.
Computed a total of 638 stabilizing places and 638 stable transitions
Computed a total of 638 stabilizing places and 638 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 146 ms. Reduced automaton from 8 states, 14 edges and 2 AP (stutter sensitive) to 8 states, 14 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 307 ms :[p0, p0, (NOT p1), (AND (NOT p1) p0), (NOT p1), true, (AND p0 (NOT p1)), (AND p0 p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 3) 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 3) seen :0
Running SMT prover for 3 properties.
[2023-03-20 00:44:21] [INFO ] Invariant cache hit.
[2023-03-20 00:44:22] [INFO ] After 466ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-20 00:44:22] [INFO ] [Nat]Absence check using 361 positive place invariants in 137 ms returned sat
[2023-03-20 00:44:24] [INFO ] After 1398ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-20 00:44:24] [INFO ] Deduced a trap composed of 19 places in 635 ms of which 1 ms to minimize.
[2023-03-20 00:44:25] [INFO ] Deduced a trap composed of 19 places in 581 ms of which 1 ms to minimize.
[2023-03-20 00:44:26] [INFO ] Deduced a trap composed of 35 places in 558 ms of which 2 ms to minimize.
[2023-03-20 00:44:26] [INFO ] Deduced a trap composed of 20 places in 519 ms of which 1 ms to minimize.
[2023-03-20 00:44:27] [INFO ] Deduced a trap composed of 18 places in 452 ms of which 1 ms to minimize.
[2023-03-20 00:44:27] [INFO ] Deduced a trap composed of 21 places in 448 ms of which 1 ms to minimize.
[2023-03-20 00:44:28] [INFO ] Deduced a trap composed of 23 places in 505 ms of which 1 ms to minimize.
[2023-03-20 00:44:29] [INFO ] Deduced a trap composed of 22 places in 503 ms of which 1 ms to minimize.
[2023-03-20 00:44:29] [INFO ] Deduced a trap composed of 24 places in 477 ms of which 1 ms to minimize.
[2023-03-20 00:44:30] [INFO ] Deduced a trap composed of 18 places in 433 ms of which 1 ms to minimize.
[2023-03-20 00:44:30] [INFO ] Deduced a trap composed of 31 places in 482 ms of which 1 ms to minimize.
[2023-03-20 00:44:31] [INFO ] Deduced a trap composed of 23 places in 423 ms of which 2 ms to minimize.
[2023-03-20 00:44:31] [INFO ] Deduced a trap composed of 28 places in 455 ms of which 2 ms to minimize.
[2023-03-20 00:44:32] [INFO ] Deduced a trap composed of 26 places in 531 ms of which 1 ms to minimize.
[2023-03-20 00:44:32] [INFO ] Deduced a trap composed of 27 places in 464 ms of which 1 ms to minimize.
[2023-03-20 00:44:33] [INFO ] Deduced a trap composed of 28 places in 610 ms of which 1 ms to minimize.
[2023-03-20 00:44:34] [INFO ] Deduced a trap composed of 30 places in 402 ms of which 1 ms to minimize.
[2023-03-20 00:44:34] [INFO ] Deduced a trap composed of 30 places in 406 ms of which 1 ms to minimize.
[2023-03-20 00:44:34] [INFO ] Deduced a trap composed of 29 places in 405 ms of which 1 ms to minimize.
[2023-03-20 00:44:35] [INFO ] Deduced a trap composed of 24 places in 438 ms of which 1 ms to minimize.
[2023-03-20 00:44:35] [INFO ] Deduced a trap composed of 31 places in 397 ms of which 2 ms to minimize.
[2023-03-20 00:44:36] [INFO ] Deduced a trap composed of 41 places in 414 ms of which 1 ms to minimize.
[2023-03-20 00:44:36] [INFO ] Deduced a trap composed of 30 places in 380 ms of which 1 ms to minimize.
[2023-03-20 00:44:37] [INFO ] Deduced a trap composed of 31 places in 398 ms of which 1 ms to minimize.
[2023-03-20 00:44:37] [INFO ] Deduced a trap composed of 29 places in 371 ms of which 1 ms to minimize.
[2023-03-20 00:44:38] [INFO ] Deduced a trap composed of 25 places in 402 ms of which 1 ms to minimize.
[2023-03-20 00:44:38] [INFO ] Deduced a trap composed of 34 places in 348 ms of which 1 ms to minimize.
[2023-03-20 00:44:39] [INFO ] Deduced a trap composed of 38 places in 342 ms of which 1 ms to minimize.
[2023-03-20 00:44:39] [INFO ] Deduced a trap composed of 41 places in 341 ms of which 1 ms to minimize.
[2023-03-20 00:44:39] [INFO ] Deduced a trap composed of 44 places in 354 ms of which 1 ms to minimize.
[2023-03-20 00:44:40] [INFO ] Deduced a trap composed of 29 places in 353 ms of which 1 ms to minimize.
[2023-03-20 00:44:40] [INFO ] Deduced a trap composed of 42 places in 325 ms of which 1 ms to minimize.
[2023-03-20 00:44:41] [INFO ] Deduced a trap composed of 34 places in 282 ms of which 1 ms to minimize.
[2023-03-20 00:44:41] [INFO ] Deduced a trap composed of 40 places in 302 ms of which 1 ms to minimize.
[2023-03-20 00:44:41] [INFO ] Deduced a trap composed of 41 places in 329 ms of which 1 ms to minimize.
[2023-03-20 00:44:42] [INFO ] Deduced a trap composed of 38 places in 285 ms of which 1 ms to minimize.
[2023-03-20 00:44:42] [INFO ] Deduced a trap composed of 41 places in 359 ms of which 1 ms to minimize.
[2023-03-20 00:44:43] [INFO ] Deduced a trap composed of 45 places in 306 ms of which 1 ms to minimize.
[2023-03-20 00:44:43] [INFO ] Deduced a trap composed of 38 places in 349 ms of which 1 ms to minimize.
[2023-03-20 00:44:43] [INFO ] Deduced a trap composed of 36 places in 289 ms of which 1 ms to minimize.
[2023-03-20 00:44:44] [INFO ] Deduced a trap composed of 42 places in 305 ms of which 1 ms to minimize.
[2023-03-20 00:44:44] [INFO ] Deduced a trap composed of 41 places in 342 ms of which 1 ms to minimize.
[2023-03-20 00:44:45] [INFO ] Deduced a trap composed of 39 places in 294 ms of which 1 ms to minimize.
[2023-03-20 00:44:45] [INFO ] Deduced a trap composed of 48 places in 316 ms of which 2 ms to minimize.
[2023-03-20 00:44:45] [INFO ] Deduced a trap composed of 47 places in 325 ms of which 0 ms to minimize.
[2023-03-20 00:44:46] [INFO ] Deduced a trap composed of 39 places in 390 ms of which 1 ms to minimize.
[2023-03-20 00:44:46] [INFO ] Deduced a trap composed of 47 places in 329 ms of which 1 ms to minimize.
[2023-03-20 00:44:47] [INFO ] Deduced a trap composed of 45 places in 318 ms of which 0 ms to minimize.
[2023-03-20 00:44:47] [INFO ] Trap strengthening (SAT) tested/added 48/48 trap constraints in 22971 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:769)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-20 00:44:47] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 00:44:47] [INFO ] After 25007ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Parikh walk visited 0 properties in 124 ms.
Support contains 4 out of 2364 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2364/2364 places, 2164/2164 transitions.
Drop transitions removed 479 transitions
Trivial Post-agglo rules discarded 479 transitions
Performed 479 trivial Post agglomeration. Transition count delta: 479
Iterating post reduction 0 with 479 rules applied. Total rules applied 479 place count 2364 transition count 1685
Reduce places removed 479 places and 0 transitions.
Iterating post reduction 1 with 479 rules applied. Total rules applied 958 place count 1885 transition count 1685
Performed 318 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 318 Pre rules applied. Total rules applied 958 place count 1885 transition count 1367
Deduced a syphon composed of 318 places in 2 ms
Reduce places removed 318 places and 0 transitions.
Iterating global reduction 2 with 636 rules applied. Total rules applied 1594 place count 1567 transition count 1367
Performed 681 Post agglomeration using F-continuation condition.Transition count delta: 681
Deduced a syphon composed of 681 places in 1 ms
Reduce places removed 681 places and 0 transitions.
Iterating global reduction 2 with 1362 rules applied. Total rules applied 2956 place count 886 transition count 686
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2957 place count 886 transition count 685
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2959 place count 885 transition count 684
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -66
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 3161 place count 784 transition count 750
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 3197 place count 766 transition count 763
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3198 place count 766 transition count 762
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 3199 place count 766 transition count 761
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3200 place count 765 transition count 761
Partial Free-agglomeration rule applied 40 times.
Drop transitions removed 40 transitions
Iterating global reduction 5 with 40 rules applied. Total rules applied 3240 place count 765 transition count 761
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 3241 place count 764 transition count 760
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 3243 place count 762 transition count 760
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 3243 place count 762 transition count 759
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 3245 place count 761 transition count 759
Applied a total of 3245 rules in 226 ms. Remains 761 /2364 variables (removed 1603) and now considering 759/2164 (removed 1405) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 226 ms. Remains : 761/2364 places, 759/2164 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 193318 steps, run timeout after 3001 ms. (steps per millisecond=64 ) properties seen :{}
Probabilistic random walk after 193318 steps, saw 108342 distinct states, run finished after 3002 ms. (steps per millisecond=64 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 759 rows 761 cols
[2023-03-20 00:44:50] [INFO ] Computed 359 place invariants in 3 ms
[2023-03-20 00:44:50] [INFO ] After 119ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-20 00:44:51] [INFO ] [Nat]Absence check using 359 positive place invariants in 46 ms returned sat
[2023-03-20 00:44:51] [INFO ] After 407ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-20 00:44:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-20 00:44:51] [INFO ] After 119ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-20 00:44:51] [INFO ] After 375ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 164 ms.
[2023-03-20 00:44:52] [INFO ] After 1173ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 85 ms.
Support contains 4 out of 761 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 761/761 places, 759/759 transitions.
Applied a total of 0 rules in 17 ms. Remains 761 /761 variables (removed 0) and now considering 759/759 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 761/761 places, 759/759 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 761/761 places, 759/759 transitions.
Applied a total of 0 rules in 15 ms. Remains 761 /761 variables (removed 0) and now considering 759/759 (removed 0) transitions.
[2023-03-20 00:44:52] [INFO ] Invariant cache hit.
[2023-03-20 00:44:52] [INFO ] Implicit Places using invariants in 424 ms returned [750]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 425 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 760/761 places, 759/759 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 759 transition count 758
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 759 transition count 758
Applied a total of 2 rules in 22 ms. Remains 759 /760 variables (removed 1) and now considering 758/759 (removed 1) transitions.
// Phase 1: matrix 758 rows 759 cols
[2023-03-20 00:44:52] [INFO ] Computed 358 place invariants in 1 ms
[2023-03-20 00:44:53] [INFO ] Implicit Places using invariants in 408 ms returned []
[2023-03-20 00:44:53] [INFO ] Invariant cache hit.
[2023-03-20 00:44:54] [INFO ] Implicit Places using invariants and state equation in 1025 ms returned []
Implicit Place search using SMT with State Equation took 1448 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 759/761 places, 758/759 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1910 ms. Remains : 759/761 places, 758/759 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 161439 steps, run timeout after 3001 ms. (steps per millisecond=53 ) properties seen :{}
Probabilistic random walk after 161439 steps, saw 88036 distinct states, run finished after 3001 ms. (steps per millisecond=53 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-20 00:44:57] [INFO ] Invariant cache hit.
[2023-03-20 00:44:57] [INFO ] After 166ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-20 00:44:57] [INFO ] [Nat]Absence check using 358 positive place invariants in 89 ms returned sat
[2023-03-20 00:44:58] [INFO ] After 448ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-20 00:44:58] [INFO ] After 718ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 159 ms.
[2023-03-20 00:44:58] [INFO ] After 1217ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 133 ms.
Support contains 4 out of 759 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 759/759 places, 758/758 transitions.
Applied a total of 0 rules in 10 ms. Remains 759 /759 variables (removed 0) and now considering 758/758 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 759/759 places, 758/758 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 759/759 places, 758/758 transitions.
Applied a total of 0 rules in 10 ms. Remains 759 /759 variables (removed 0) and now considering 758/758 (removed 0) transitions.
[2023-03-20 00:44:58] [INFO ] Invariant cache hit.
[2023-03-20 00:44:59] [INFO ] Implicit Places using invariants in 378 ms returned []
[2023-03-20 00:44:59] [INFO ] Invariant cache hit.
[2023-03-20 00:45:00] [INFO ] Implicit Places using invariants and state equation in 961 ms returned []
Implicit Place search using SMT with State Equation took 1340 ms to find 0 implicit places.
[2023-03-20 00:45:00] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-20 00:45:00] [INFO ] Invariant cache hit.
[2023-03-20 00:45:00] [INFO ] Dead Transitions using invariants and state equation in 337 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1712 ms. Remains : 759/759 places, 758/758 transitions.
Partial Free-agglomeration rule applied 79 times.
Drop transitions removed 79 transitions
Iterating global reduction 0 with 79 rules applied. Total rules applied 79 place count 759 transition count 758
Applied a total of 79 rules in 21 ms. Remains 759 /759 variables (removed 0) and now considering 758/758 (removed 0) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 758 rows 759 cols
[2023-03-20 00:45:00] [INFO ] Computed 358 place invariants in 3 ms
[2023-03-20 00:45:00] [INFO ] After 111ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-20 00:45:00] [INFO ] [Nat]Absence check using 358 positive place invariants in 39 ms returned sat
[2023-03-20 00:45:01] [INFO ] After 328ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-20 00:45:01] [INFO ] State equation strengthened by 76 read => feed constraints.
[2023-03-20 00:45:01] [INFO ] After 194ms SMT Verify possible using 76 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-20 00:45:01] [INFO ] After 501ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 214 ms.
[2023-03-20 00:45:02] [INFO ] After 1277ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND p0 p1), (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT (AND p1 p0))), (F (AND p1 (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 4 factoid took 288 ms. Reduced automaton from 8 states, 14 edges and 2 AP (stutter sensitive) to 8 states, 14 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 389 ms :[p0, p0, (NOT p1), (AND (NOT p1) p0), (NOT p1), true, (AND p0 (NOT p1)), (AND p0 p1)]
Stuttering acceptance computed with spot in 354 ms :[p0, p0, (NOT p1), (AND (NOT p1) p0), (NOT p1), true, (AND p0 (NOT p1)), (AND p0 p1)]
// Phase 1: matrix 2164 rows 2364 cols
[2023-03-20 00:45:03] [INFO ] Computed 361 place invariants in 13 ms
[2023-03-20 00:45:04] [INFO ] [Real]Absence check using 361 positive place invariants in 437 ms returned sat
[2023-03-20 00:45:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 00:45:15] [INFO ] [Real]Absence check using state equation in 10751 ms returned sat
[2023-03-20 00:45:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 00:45:17] [INFO ] [Nat]Absence check using 361 positive place invariants in 487 ms returned sat
[2023-03-20 00:45:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 00:45:29] [INFO ] [Nat]Absence check using state equation in 12057 ms returned sat
[2023-03-20 00:45:29] [INFO ] Computed and/alt/rep : 2163/3245/2163 causal constraints (skipped 0 transitions) in 102 ms.
[2023-03-20 00:45:31] [INFO ] Deduced a trap composed of 17 places in 1112 ms of which 5 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:520)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:614)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-20 00:45:31] [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 p0
Could not prove EG p0
Stuttering acceptance computed with spot in 439 ms :[p0, p0, (NOT p1), (AND (NOT p1) p0), (NOT p1), true, (AND p0 (NOT p1)), (AND p0 p1)]
Product exploration explored 100000 steps with 20039 reset in 594 ms.
Product exploration explored 100000 steps with 19956 reset in 548 ms.
Applying partial POR strategy [false, false, false, false, true, true, true, true]
Stuttering acceptance computed with spot in 279 ms :[p0, p0, (NOT p1), (AND (NOT p1) p0), (NOT p1), true, (AND p0 (NOT p1)), (AND p0 p1)]
Support contains 4 out of 2364 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2364/2364 places, 2164/2164 transitions.
Performed 479 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 479 rules applied. Total rules applied 479 place count 2364 transition count 2164
Performed 159 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 159 Pre rules applied. Total rules applied 479 place count 2364 transition count 2286
Deduced a syphon composed of 638 places in 3 ms
Iterating global reduction 1 with 159 rules applied. Total rules applied 638 place count 2364 transition count 2286
Performed 802 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1440 places in 2 ms
Iterating global reduction 1 with 802 rules applied. Total rules applied 1440 place count 2364 transition count 2287
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 1441 place count 2364 transition count 2286
Renaming transitions due to excessive name length > 1024 char.
Discarding 323 places :
Symmetric choice reduction at 2 with 323 rule applications. Total rules 1764 place count 2041 transition count 1962
Deduced a syphon composed of 1117 places in 2 ms
Iterating global reduction 2 with 323 rules applied. Total rules applied 2087 place count 2041 transition count 1962
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1118 places in 1 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 2088 place count 2041 transition count 1962
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 2090 place count 2039 transition count 1960
Deduced a syphon composed of 1116 places in 2 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 2092 place count 2039 transition count 1960
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -533
Deduced a syphon composed of 1217 places in 2 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 2193 place count 2039 transition count 2493
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 2294 place count 1938 transition count 2291
Deduced a syphon composed of 1116 places in 2 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 2395 place count 1938 transition count 2291
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: -307
Deduced a syphon composed of 1172 places in 2 ms
Iterating global reduction 2 with 56 rules applied. Total rules applied 2451 place count 1938 transition count 2598
Discarding 56 places :
Symmetric choice reduction at 2 with 56 rule applications. Total rules 2507 place count 1882 transition count 2486
Deduced a syphon composed of 1116 places in 2 ms
Iterating global reduction 2 with 56 rules applied. Total rules applied 2563 place count 1882 transition count 2486
Deduced a syphon composed of 1116 places in 2 ms
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 2 with 9 rules applied. Total rules applied 2572 place count 1882 transition count 2477
Deduced a syphon composed of 1116 places in 2 ms
Applied a total of 2572 rules in 994 ms. Remains 1882 /2364 variables (removed 482) and now considering 2477/2164 (removed -313) transitions.
[2023-03-20 00:45:34] [INFO ] Redundant transitions in 36 ms returned []
// Phase 1: matrix 2477 rows 1882 cols
[2023-03-20 00:45:34] [INFO ] Computed 361 place invariants in 35 ms
[2023-03-20 00:45:35] [INFO ] Dead Transitions using invariants and state equation in 1229 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1882/2364 places, 2477/2164 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2270 ms. Remains : 1882/2364 places, 2477/2164 transitions.
Support contains 4 out of 2364 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2364/2364 places, 2164/2164 transitions.
Applied a total of 0 rules in 107 ms. Remains 2364 /2364 variables (removed 0) and now considering 2164/2164 (removed 0) transitions.
// Phase 1: matrix 2164 rows 2364 cols
[2023-03-20 00:45:35] [INFO ] Computed 361 place invariants in 11 ms
[2023-03-20 00:45:36] [INFO ] Implicit Places using invariants in 957 ms returned []
[2023-03-20 00:45:36] [INFO ] Invariant cache hit.
[2023-03-20 00:45:39] [INFO ] Implicit Places using invariants and state equation in 2544 ms returned []
Implicit Place search using SMT with State Equation took 3509 ms to find 0 implicit places.
[2023-03-20 00:45:39] [INFO ] Invariant cache hit.
[2023-03-20 00:45:40] [INFO ] Dead Transitions using invariants and state equation in 1389 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5005 ms. Remains : 2364/2364 places, 2164/2164 transitions.
Treatment of property ShieldIIPt-PT-040B-LTLCardinality-14 finished in 164791 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(p1))&&G(p2)&&p0)))'
Support contains 4 out of 2374 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2374/2374 places, 2174/2174 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 2364 transition count 2164
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 2364 transition count 2164
Applied a total of 20 rules in 247 ms. Remains 2364 /2374 variables (removed 10) and now considering 2164/2174 (removed 10) transitions.
// Phase 1: matrix 2164 rows 2364 cols
[2023-03-20 00:45:41] [INFO ] Computed 361 place invariants in 13 ms
[2023-03-20 00:45:42] [INFO ] Implicit Places using invariants in 772 ms returned []
[2023-03-20 00:45:42] [INFO ] Invariant cache hit.
[2023-03-20 00:45:44] [INFO ] Implicit Places using invariants and state equation in 1985 ms returned []
Implicit Place search using SMT with State Equation took 2772 ms to find 0 implicit places.
[2023-03-20 00:45:44] [INFO ] Invariant cache hit.
[2023-03-20 00:45:45] [INFO ] Dead Transitions using invariants and state equation in 1509 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2364/2374 places, 2164/2174 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4528 ms. Remains : 2364/2374 places, 2164/2174 transitions.
Stuttering acceptance computed with spot in 178 ms :[true, (OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : ShieldIIPt-PT-040B-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR (NOT p0) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p2), acceptance={} source=2 dest: 4}], [{ cond=(OR (NOT p2) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p2 p1), acceptance={} source=3 dest: 5}], [{ cond=(NOT p2), acceptance={} source=4 dest: 0}, { cond=p2, acceptance={} source=4 dest: 3}], [{ cond=(NOT p2), acceptance={} source=5 dest: 0}, { cond=p2, acceptance={} source=5 dest: 5}]], initial=1, aps=[p0:(AND (OR (EQ s2049 0) (EQ s624 1)) (OR (EQ s1293 0) (EQ s385 1))), p2:(OR (EQ s1293 0) (EQ s385 1)), p1:(OR (EQ s2049 0) (EQ s624 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, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 660 ms.
Product exploration explored 100000 steps with 0 reset in 851 ms.
Computed a total of 639 stabilizing places and 639 stable transitions
Computed a total of 639 stabilizing places and 639 stable transitions
Detected a total of 639/2364 stabilizing places and 639/2164 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 p2 p1), (X (NOT (OR (NOT p0) (NOT p2)))), (X (AND p0 p2)), true, (X (X p2)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 278 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 319 ms :[true, (NOT p2), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-20 00:45:47] [INFO ] Invariant cache hit.
[2023-03-20 00:45:48] [INFO ] After 286ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 00:45:48] [INFO ] [Nat]Absence check using 361 positive place invariants in 206 ms returned sat
[2023-03-20 00:45:50] [INFO ] After 1239ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 00:45:50] [INFO ] Deduced a trap composed of 24 places in 507 ms of which 1 ms to minimize.
[2023-03-20 00:45:51] [INFO ] Deduced a trap composed of 20 places in 512 ms of which 1 ms to minimize.
[2023-03-20 00:45:52] [INFO ] Deduced a trap composed of 21 places in 509 ms of which 1 ms to minimize.
[2023-03-20 00:45:52] [INFO ] Deduced a trap composed of 21 places in 609 ms of which 1 ms to minimize.
[2023-03-20 00:45:53] [INFO ] Deduced a trap composed of 29 places in 538 ms of which 2 ms to minimize.
[2023-03-20 00:45:54] [INFO ] Deduced a trap composed of 27 places in 567 ms of which 2 ms to minimize.
[2023-03-20 00:45:54] [INFO ] Deduced a trap composed of 29 places in 477 ms of which 1 ms to minimize.
[2023-03-20 00:45:55] [INFO ] Deduced a trap composed of 22 places in 490 ms of which 1 ms to minimize.
[2023-03-20 00:45:55] [INFO ] Deduced a trap composed of 25 places in 503 ms of which 1 ms to minimize.
[2023-03-20 00:45:56] [INFO ] Deduced a trap composed of 23 places in 422 ms of which 1 ms to minimize.
[2023-03-20 00:45:56] [INFO ] Deduced a trap composed of 19 places in 488 ms of which 1 ms to minimize.
[2023-03-20 00:45:57] [INFO ] Deduced a trap composed of 17 places in 386 ms of which 1 ms to minimize.
[2023-03-20 00:45:57] [INFO ] Deduced a trap composed of 23 places in 403 ms of which 2 ms to minimize.
[2023-03-20 00:45:58] [INFO ] Deduced a trap composed of 20 places in 464 ms of which 1 ms to minimize.
[2023-03-20 00:45:58] [INFO ] Deduced a trap composed of 33 places in 450 ms of which 1 ms to minimize.
[2023-03-20 00:45:59] [INFO ] Deduced a trap composed of 32 places in 483 ms of which 1 ms to minimize.
[2023-03-20 00:45:59] [INFO ] Deduced a trap composed of 28 places in 416 ms of which 1 ms to minimize.
[2023-03-20 00:46:00] [INFO ] Deduced a trap composed of 37 places in 616 ms of which 1 ms to minimize.
[2023-03-20 00:46:01] [INFO ] Deduced a trap composed of 37 places in 438 ms of which 1 ms to minimize.
[2023-03-20 00:46:01] [INFO ] Deduced a trap composed of 34 places in 421 ms of which 1 ms to minimize.
[2023-03-20 00:46:02] [INFO ] Deduced a trap composed of 27 places in 378 ms of which 1 ms to minimize.
[2023-03-20 00:46:02] [INFO ] Deduced a trap composed of 33 places in 470 ms of which 1 ms to minimize.
[2023-03-20 00:46:03] [INFO ] Deduced a trap composed of 28 places in 407 ms of which 1 ms to minimize.
[2023-03-20 00:46:03] [INFO ] Deduced a trap composed of 44 places in 370 ms of which 1 ms to minimize.
[2023-03-20 00:46:03] [INFO ] Deduced a trap composed of 37 places in 323 ms of which 0 ms to minimize.
[2023-03-20 00:46:04] [INFO ] Deduced a trap composed of 20 places in 454 ms of which 1 ms to minimize.
[2023-03-20 00:46:04] [INFO ] Deduced a trap composed of 40 places in 359 ms of which 1 ms to minimize.
[2023-03-20 00:46:05] [INFO ] Deduced a trap composed of 39 places in 325 ms of which 1 ms to minimize.
[2023-03-20 00:46:05] [INFO ] Deduced a trap composed of 36 places in 386 ms of which 1 ms to minimize.
[2023-03-20 00:46:06] [INFO ] Deduced a trap composed of 31 places in 318 ms of which 1 ms to minimize.
[2023-03-20 00:46:06] [INFO ] Deduced a trap composed of 44 places in 370 ms of which 1 ms to minimize.
[2023-03-20 00:46:07] [INFO ] Deduced a trap composed of 34 places in 342 ms of which 1 ms to minimize.
[2023-03-20 00:46:07] [INFO ] Deduced a trap composed of 41 places in 303 ms of which 1 ms to minimize.
[2023-03-20 00:46:07] [INFO ] Deduced a trap composed of 37 places in 318 ms of which 1 ms to minimize.
[2023-03-20 00:46:08] [INFO ] Deduced a trap composed of 35 places in 345 ms of which 1 ms to minimize.
[2023-03-20 00:46:08] [INFO ] Deduced a trap composed of 31 places in 270 ms of which 1 ms to minimize.
[2023-03-20 00:46:08] [INFO ] Deduced a trap composed of 40 places in 259 ms of which 1 ms to minimize.
[2023-03-20 00:46:09] [INFO ] Deduced a trap composed of 38 places in 334 ms of which 1 ms to minimize.
[2023-03-20 00:46:09] [INFO ] Deduced a trap composed of 38 places in 340 ms of which 1 ms to minimize.
[2023-03-20 00:46:10] [INFO ] Deduced a trap composed of 34 places in 287 ms of which 1 ms to minimize.
[2023-03-20 00:46:10] [INFO ] Deduced a trap composed of 35 places in 356 ms of which 1 ms to minimize.
[2023-03-20 00:46:11] [INFO ] Deduced a trap composed of 49 places in 326 ms of which 0 ms to minimize.
[2023-03-20 00:46:11] [INFO ] Deduced a trap composed of 37 places in 400 ms of which 1 ms to minimize.
[2023-03-20 00:46:11] [INFO ] Deduced a trap composed of 51 places in 303 ms of which 1 ms to minimize.
[2023-03-20 00:46:12] [INFO ] Deduced a trap composed of 37 places in 283 ms of which 1 ms to minimize.
[2023-03-20 00:46:12] [INFO ] Deduced a trap composed of 46 places in 281 ms of which 0 ms to minimize.
[2023-03-20 00:46:12] [INFO ] Deduced a trap composed of 44 places in 259 ms of which 1 ms to minimize.
[2023-03-20 00:46:13] [INFO ] Deduced a trap composed of 47 places in 276 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-20 00:46:13] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 00:46:13] [INFO ] After 25013ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 19 ms.
Support contains 2 out of 2364 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2364/2364 places, 2164/2164 transitions.
Drop transitions removed 479 transitions
Trivial Post-agglo rules discarded 479 transitions
Performed 479 trivial Post agglomeration. Transition count delta: 479
Iterating post reduction 0 with 479 rules applied. Total rules applied 479 place count 2364 transition count 1685
Reduce places removed 479 places and 0 transitions.
Iterating post reduction 1 with 479 rules applied. Total rules applied 958 place count 1885 transition count 1685
Performed 319 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 319 Pre rules applied. Total rules applied 958 place count 1885 transition count 1366
Deduced a syphon composed of 319 places in 4 ms
Reduce places removed 319 places and 0 transitions.
Iterating global reduction 2 with 638 rules applied. Total rules applied 1596 place count 1566 transition count 1366
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 1597 place count 1565 transition count 1365
Iterating global reduction 2 with 1 rules applied. Total rules applied 1598 place count 1565 transition count 1365
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 1598 place count 1565 transition count 1364
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1600 place count 1564 transition count 1364
Performed 681 Post agglomeration using F-continuation condition.Transition count delta: 681
Deduced a syphon composed of 681 places in 1 ms
Reduce places removed 681 places and 0 transitions.
Iterating global reduction 2 with 1362 rules applied. Total rules applied 2962 place count 883 transition count 683
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2963 place count 883 transition count 682
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2965 place count 882 transition count 681
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -65
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 3167 place count 781 transition count 746
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 3201 place count 764 transition count 757
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3202 place count 764 transition count 756
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 3203 place count 764 transition count 755
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3204 place count 763 transition count 755
Partial Free-agglomeration rule applied 40 times.
Drop transitions removed 40 transitions
Iterating global reduction 5 with 40 rules applied. Total rules applied 3244 place count 763 transition count 755
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 3245 place count 762 transition count 754
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 3247 place count 760 transition count 754
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 3247 place count 760 transition count 753
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 3249 place count 759 transition count 753
Applied a total of 3249 rules in 376 ms. Remains 759 /2364 variables (removed 1605) and now considering 753/2164 (removed 1411) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 376 ms. Remains : 759/2364 places, 753/2164 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 254092 steps, run timeout after 3001 ms. (steps per millisecond=84 ) properties seen :{}
Probabilistic random walk after 254092 steps, saw 162135 distinct states, run finished after 3001 ms. (steps per millisecond=84 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 753 rows 759 cols
[2023-03-20 00:46:16] [INFO ] Computed 359 place invariants in 1 ms
[2023-03-20 00:46:16] [INFO ] After 90ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 00:46:17] [INFO ] [Nat]Absence check using 359 positive place invariants in 74 ms returned sat
[2023-03-20 00:46:17] [INFO ] After 266ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 00:46:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-20 00:46:17] [INFO ] After 22ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 00:46:17] [INFO ] After 64ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 29 ms.
[2023-03-20 00:46:17] [INFO ] After 633ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 569 steps, including 185 resets, run visited all 1 properties in 7 ms. (steps per millisecond=81 )
Parikh walk visited 1 properties in 6 ms.
Knowledge obtained : [(AND p0 p2 p1), (X (NOT (OR (NOT p0) (NOT p2)))), (X (AND p0 p2)), true, (X (X p2)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p2)), (F (NOT (AND p2 p1))), (F (OR (NOT p2) (NOT p1)))]
Knowledge based reduction with 6 factoid took 337 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 259 ms :[true, (NOT p2), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 203 ms :[true, (NOT p2), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2))]
Support contains 4 out of 2364 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2364/2364 places, 2164/2164 transitions.
Applied a total of 0 rules in 124 ms. Remains 2364 /2364 variables (removed 0) and now considering 2164/2164 (removed 0) transitions.
// Phase 1: matrix 2164 rows 2364 cols
[2023-03-20 00:46:18] [INFO ] Computed 361 place invariants in 12 ms
[2023-03-20 00:46:19] [INFO ] Implicit Places using invariants in 718 ms returned []
[2023-03-20 00:46:19] [INFO ] Invariant cache hit.
[2023-03-20 00:46:21] [INFO ] Implicit Places using invariants and state equation in 2445 ms returned []
Implicit Place search using SMT with State Equation took 3167 ms to find 0 implicit places.
[2023-03-20 00:46:21] [INFO ] Invariant cache hit.
[2023-03-20 00:46:22] [INFO ] Dead Transitions using invariants and state equation in 1334 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4626 ms. Remains : 2364/2364 places, 2164/2164 transitions.
Computed a total of 639 stabilizing places and 639 stable transitions
Computed a total of 639 stabilizing places and 639 stable transitions
Detected a total of 639/2364 stabilizing places and 639/2164 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p2 p1), true, (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 153 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 211 ms :[true, (NOT p2), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-20 00:46:23] [INFO ] Invariant cache hit.
[2023-03-20 00:46:23] [INFO ] After 259ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 00:46:24] [INFO ] [Nat]Absence check using 361 positive place invariants in 119 ms returned sat
[2023-03-20 00:46:25] [INFO ] After 1195ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 00:46:26] [INFO ] Deduced a trap composed of 24 places in 472 ms of which 2 ms to minimize.
[2023-03-20 00:46:26] [INFO ] Deduced a trap composed of 20 places in 454 ms of which 2 ms to minimize.
[2023-03-20 00:46:27] [INFO ] Deduced a trap composed of 21 places in 540 ms of which 1 ms to minimize.
[2023-03-20 00:46:27] [INFO ] Deduced a trap composed of 21 places in 451 ms of which 1 ms to minimize.
[2023-03-20 00:46:28] [INFO ] Deduced a trap composed of 29 places in 405 ms of which 1 ms to minimize.
[2023-03-20 00:46:28] [INFO ] Deduced a trap composed of 27 places in 508 ms of which 1 ms to minimize.
[2023-03-20 00:46:29] [INFO ] Deduced a trap composed of 29 places in 460 ms of which 1 ms to minimize.
[2023-03-20 00:46:29] [INFO ] Deduced a trap composed of 22 places in 480 ms of which 1 ms to minimize.
[2023-03-20 00:46:30] [INFO ] Deduced a trap composed of 25 places in 432 ms of which 2 ms to minimize.
[2023-03-20 00:46:30] [INFO ] Deduced a trap composed of 23 places in 492 ms of which 1 ms to minimize.
[2023-03-20 00:46:31] [INFO ] Deduced a trap composed of 19 places in 440 ms of which 1 ms to minimize.
[2023-03-20 00:46:31] [INFO ] Deduced a trap composed of 17 places in 370 ms of which 1 ms to minimize.
[2023-03-20 00:46:32] [INFO ] Deduced a trap composed of 23 places in 530 ms of which 1 ms to minimize.
[2023-03-20 00:46:33] [INFO ] Deduced a trap composed of 20 places in 396 ms of which 1 ms to minimize.
[2023-03-20 00:46:33] [INFO ] Deduced a trap composed of 33 places in 350 ms of which 1 ms to minimize.
[2023-03-20 00:46:34] [INFO ] Deduced a trap composed of 32 places in 725 ms of which 2 ms to minimize.
[2023-03-20 00:46:34] [INFO ] Deduced a trap composed of 28 places in 431 ms of which 1 ms to minimize.
[2023-03-20 00:46:35] [INFO ] Deduced a trap composed of 37 places in 451 ms of which 3 ms to minimize.
[2023-03-20 00:46:35] [INFO ] Deduced a trap composed of 37 places in 389 ms of which 1 ms to minimize.
[2023-03-20 00:46:36] [INFO ] Deduced a trap composed of 34 places in 370 ms of which 0 ms to minimize.
[2023-03-20 00:46:36] [INFO ] Deduced a trap composed of 27 places in 431 ms of which 2 ms to minimize.
[2023-03-20 00:46:37] [INFO ] Deduced a trap composed of 33 places in 432 ms of which 1 ms to minimize.
[2023-03-20 00:46:37] [INFO ] Deduced a trap composed of 28 places in 344 ms of which 1 ms to minimize.
[2023-03-20 00:46:38] [INFO ] Deduced a trap composed of 44 places in 345 ms of which 1 ms to minimize.
[2023-03-20 00:46:38] [INFO ] Deduced a trap composed of 37 places in 327 ms of which 1 ms to minimize.
[2023-03-20 00:46:38] [INFO ] Deduced a trap composed of 20 places in 377 ms of which 1 ms to minimize.
[2023-03-20 00:46:39] [INFO ] Deduced a trap composed of 40 places in 352 ms of which 0 ms to minimize.
[2023-03-20 00:46:39] [INFO ] Deduced a trap composed of 39 places in 370 ms of which 1 ms to minimize.
[2023-03-20 00:46:40] [INFO ] Deduced a trap composed of 36 places in 321 ms of which 1 ms to minimize.
[2023-03-20 00:46:40] [INFO ] Deduced a trap composed of 31 places in 362 ms of which 1 ms to minimize.
[2023-03-20 00:46:41] [INFO ] Deduced a trap composed of 44 places in 420 ms of which 0 ms to minimize.
[2023-03-20 00:46:41] [INFO ] Deduced a trap composed of 34 places in 427 ms of which 1 ms to minimize.
[2023-03-20 00:46:41] [INFO ] Deduced a trap composed of 41 places in 374 ms of which 0 ms to minimize.
[2023-03-20 00:46:42] [INFO ] Deduced a trap composed of 37 places in 328 ms of which 0 ms to minimize.
[2023-03-20 00:46:42] [INFO ] Deduced a trap composed of 35 places in 322 ms of which 1 ms to minimize.
[2023-03-20 00:46:43] [INFO ] Deduced a trap composed of 31 places in 276 ms of which 0 ms to minimize.
[2023-03-20 00:46:43] [INFO ] Deduced a trap composed of 40 places in 316 ms of which 0 ms to minimize.
[2023-03-20 00:46:43] [INFO ] Deduced a trap composed of 38 places in 293 ms of which 1 ms to minimize.
[2023-03-20 00:46:44] [INFO ] Deduced a trap composed of 38 places in 267 ms of which 1 ms to minimize.
[2023-03-20 00:46:44] [INFO ] Deduced a trap composed of 34 places in 263 ms of which 1 ms to minimize.
[2023-03-20 00:46:44] [INFO ] Deduced a trap composed of 35 places in 297 ms of which 1 ms to minimize.
[2023-03-20 00:46:45] [INFO ] Deduced a trap composed of 49 places in 271 ms of which 1 ms to minimize.
[2023-03-20 00:46:45] [INFO ] Deduced a trap composed of 37 places in 402 ms of which 2 ms to minimize.
[2023-03-20 00:46:46] [INFO ] Deduced a trap composed of 51 places in 239 ms of which 1 ms to minimize.
[2023-03-20 00:46:46] [INFO ] Deduced a trap composed of 37 places in 278 ms of which 1 ms to minimize.
[2023-03-20 00:46:46] [INFO ] Deduced a trap composed of 46 places in 258 ms of which 1 ms to minimize.
[2023-03-20 00:46:47] [INFO ] Deduced a trap composed of 44 places in 258 ms of which 1 ms to minimize.
[2023-03-20 00:46:47] [INFO ] Deduced a trap composed of 47 places in 284 ms of which 0 ms to minimize.
[2023-03-20 00:46:47] [INFO ] Deduced a trap composed of 45 places in 284 ms of which 0 ms to minimize.
[2023-03-20 00:46:48] [INFO ] Deduced a trap composed of 47 places in 275 ms of which 1 ms to minimize.
[2023-03-20 00:46:48] [INFO ] Deduced a trap composed of 46 places in 299 ms of which 0 ms to minimize.
[2023-03-20 00:46:49] [INFO ] Deduced a trap composed of 39 places in 335 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-20 00:46:49] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 00:46:49] [INFO ] After 25215ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 24 ms.
Support contains 2 out of 2364 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2364/2364 places, 2164/2164 transitions.
Drop transitions removed 479 transitions
Trivial Post-agglo rules discarded 479 transitions
Performed 479 trivial Post agglomeration. Transition count delta: 479
Iterating post reduction 0 with 479 rules applied. Total rules applied 479 place count 2364 transition count 1685
Reduce places removed 479 places and 0 transitions.
Iterating post reduction 1 with 479 rules applied. Total rules applied 958 place count 1885 transition count 1685
Performed 319 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 319 Pre rules applied. Total rules applied 958 place count 1885 transition count 1366
Deduced a syphon composed of 319 places in 2 ms
Reduce places removed 319 places and 0 transitions.
Iterating global reduction 2 with 638 rules applied. Total rules applied 1596 place count 1566 transition count 1366
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 1597 place count 1565 transition count 1365
Iterating global reduction 2 with 1 rules applied. Total rules applied 1598 place count 1565 transition count 1365
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 1598 place count 1565 transition count 1364
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1600 place count 1564 transition count 1364
Performed 681 Post agglomeration using F-continuation condition.Transition count delta: 681
Deduced a syphon composed of 681 places in 1 ms
Reduce places removed 681 places and 0 transitions.
Iterating global reduction 2 with 1362 rules applied. Total rules applied 2962 place count 883 transition count 683
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2963 place count 883 transition count 682
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2965 place count 882 transition count 681
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -65
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 3167 place count 781 transition count 746
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 3201 place count 764 transition count 757
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3202 place count 764 transition count 756
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 3203 place count 764 transition count 755
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3204 place count 763 transition count 755
Partial Free-agglomeration rule applied 40 times.
Drop transitions removed 40 transitions
Iterating global reduction 5 with 40 rules applied. Total rules applied 3244 place count 763 transition count 755
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 3245 place count 762 transition count 754
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 3247 place count 760 transition count 754
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 3247 place count 760 transition count 753
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 3249 place count 759 transition count 753
Applied a total of 3249 rules in 352 ms. Remains 759 /2364 variables (removed 1605) and now considering 753/2164 (removed 1411) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 352 ms. Remains : 759/2364 places, 753/2164 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 267992 steps, run timeout after 3001 ms. (steps per millisecond=89 ) properties seen :{}
Probabilistic random walk after 267992 steps, saw 171220 distinct states, run finished after 3001 ms. (steps per millisecond=89 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 753 rows 759 cols
[2023-03-20 00:46:52] [INFO ] Computed 359 place invariants in 13 ms
[2023-03-20 00:46:52] [INFO ] After 222ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 00:46:53] [INFO ] [Nat]Absence check using 359 positive place invariants in 162 ms returned sat
[2023-03-20 00:46:53] [INFO ] After 341ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 00:46:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-20 00:46:53] [INFO ] After 53ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 00:46:53] [INFO ] After 131ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 52 ms.
[2023-03-20 00:46:53] [INFO ] After 1023ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 1302 steps, including 359 resets, run visited all 1 properties in 19 ms. (steps per millisecond=68 )
Parikh walk visited 1 properties in 19 ms.
Knowledge obtained : [(AND p2 p1), true, (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p2)), (F (NOT (AND p2 p1))), (F (OR (NOT p2) (NOT p1)))]
Knowledge based reduction with 3 factoid took 269 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 275 ms :[true, (NOT p2), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 257 ms :[true, (NOT p2), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 388 ms :[true, (NOT p2), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 0 reset in 725 ms.
Product exploration explored 100000 steps with 0 reset in 817 ms.
Applying partial POR strategy [true, true, true, false, false, false]
Stuttering acceptance computed with spot in 352 ms :[true, (NOT p2), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2))]
Support contains 4 out of 2364 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2364/2364 places, 2164/2164 transitions.
Performed 477 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 477 rules applied. Total rules applied 477 place count 2364 transition count 2164
Performed 163 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 163 Pre rules applied. Total rules applied 477 place count 2364 transition count 2287
Deduced a syphon composed of 640 places in 3 ms
Iterating global reduction 1 with 163 rules applied. Total rules applied 640 place count 2364 transition count 2287
Performed 797 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1437 places in 2 ms
Iterating global reduction 1 with 797 rules applied. Total rules applied 1437 place count 2364 transition count 2287
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 1438 place count 2364 transition count 2286
Renaming transitions due to excessive name length > 1024 char.
Discarding 316 places :
Symmetric choice reduction at 2 with 316 rule applications. Total rules 1754 place count 2048 transition count 1970
Deduced a syphon composed of 1121 places in 2 ms
Iterating global reduction 2 with 316 rules applied. Total rules applied 2070 place count 2048 transition count 1970
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1122 places in 2 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 2071 place count 2048 transition count 1970
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 2073 place count 2046 transition count 1968
Deduced a syphon composed of 1120 places in 2 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 2075 place count 2046 transition count 1968
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -520
Deduced a syphon composed of 1221 places in 2 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 2176 place count 2046 transition count 2488
Discarding 102 places :
Symmetric choice reduction at 2 with 102 rule applications. Total rules 2278 place count 1944 transition count 2284
Deduced a syphon composed of 1119 places in 2 ms
Iterating global reduction 2 with 102 rules applied. Total rules applied 2380 place count 1944 transition count 2284
Performed 57 Post agglomeration using F-continuation condition.Transition count delta: -312
Deduced a syphon composed of 1176 places in 3 ms
Iterating global reduction 2 with 57 rules applied. Total rules applied 2437 place count 1944 transition count 2596
Discarding 57 places :
Symmetric choice reduction at 2 with 57 rule applications. Total rules 2494 place count 1887 transition count 2482
Deduced a syphon composed of 1119 places in 2 ms
Iterating global reduction 2 with 57 rules applied. Total rules applied 2551 place count 1887 transition count 2482
Deduced a syphon composed of 1119 places in 2 ms
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 2 with 9 rules applied. Total rules applied 2560 place count 1887 transition count 2473
Deduced a syphon composed of 1119 places in 2 ms
Applied a total of 2560 rules in 998 ms. Remains 1887 /2364 variables (removed 477) and now considering 2473/2164 (removed -309) transitions.
[2023-03-20 00:46:58] [INFO ] Redundant transitions in 48 ms returned []
// Phase 1: matrix 2473 rows 1887 cols
[2023-03-20 00:46:58] [INFO ] Computed 361 place invariants in 15 ms
[2023-03-20 00:46:59] [INFO ] Dead Transitions using invariants and state equation in 1253 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1887/2364 places, 2473/2164 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2329 ms. Remains : 1887/2364 places, 2473/2164 transitions.
Support contains 4 out of 2364 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2364/2364 places, 2164/2164 transitions.
Applied a total of 0 rules in 136 ms. Remains 2364 /2364 variables (removed 0) and now considering 2164/2164 (removed 0) transitions.
// Phase 1: matrix 2164 rows 2364 cols
[2023-03-20 00:46:59] [INFO ] Computed 361 place invariants in 5 ms
[2023-03-20 00:47:00] [INFO ] Implicit Places using invariants in 791 ms returned []
[2023-03-20 00:47:00] [INFO ] Invariant cache hit.
[2023-03-20 00:47:03] [INFO ] Implicit Places using invariants and state equation in 2685 ms returned []
Implicit Place search using SMT with State Equation took 3490 ms to find 0 implicit places.
[2023-03-20 00:47:03] [INFO ] Invariant cache hit.
[2023-03-20 00:47:04] [INFO ] Dead Transitions using invariants and state equation in 1299 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4946 ms. Remains : 2364/2364 places, 2164/2164 transitions.
Treatment of property ShieldIIPt-PT-040B-LTLCardinality-15 finished in 83429 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)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&X(F(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(p0)&&X((X(X(p1)) U 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' '!(X((X(X(p1))&&G(p2)&&p0)))'
[2023-03-20 00:47:04] [INFO ] Flatten gal took : 75 ms
[2023-03-20 00:47:04] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-20 00:47:04] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 2374 places, 2174 transitions and 5628 arcs took 22 ms.
Total runtime 452340 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT ShieldIIPt-PT-040B
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/380
LTLCardinality

FORMULA ShieldIIPt-PT-040B-LTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPt-PT-040B-LTLCardinality-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1679273296792

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

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPt-PT-040B-LTLCardinality-02: LTL 0 0 1 0 1 0 0 0
ShieldIIPt-PT-040B-LTLCardinality-09: CONJ 0 2 0 0 2 0 0 0
ShieldIIPt-PT-040B-LTLCardinality-14: CONJ 0 1 0 0 3 0 0 0
ShieldIIPt-PT-040B-LTLCardinality-15: CONJ 0 3 0 0 3 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 4/513 8/32 ShieldIIPt-PT-040B-LTLCardinality-02 628314 m, 125662 m/sec, 969959 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPt-PT-040B-LTLCardinality-02: LTL 0 0 1 0 1 0 0 0
ShieldIIPt-PT-040B-LTLCardinality-09: CONJ 0 2 0 0 2 0 0 0
ShieldIIPt-PT-040B-LTLCardinality-14: CONJ 0 1 0 0 3 0 0 0
ShieldIIPt-PT-040B-LTLCardinality-15: CONJ 0 3 0 0 3 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 9/513 18/32 ShieldIIPt-PT-040B-LTLCardinality-02 1416406 m, 157618 m/sec, 2211313 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPt-PT-040B-LTLCardinality-02: LTL 0 0 1 0 1 0 0 0
ShieldIIPt-PT-040B-LTLCardinality-09: CONJ 0 2 0 0 2 0 0 0
ShieldIIPt-PT-040B-LTLCardinality-14: CONJ 0 1 0 0 3 0 0 0
ShieldIIPt-PT-040B-LTLCardinality-15: CONJ 0 3 0 0 3 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 14/513 28/32 ShieldIIPt-PT-040B-LTLCardinality-02 2207517 m, 158222 m/sec, 3444970 t fired, .

Time elapsed: 17 secs. Pages in use: 28
# running tasks: 1 of 4 Visible: 4
lola: CANCELED task # 1 (type EXCL) for ShieldIIPt-PT-040B-LTLCardinality-02 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPt-PT-040B-LTLCardinality-02: LTL 0 0 0 0 1 0 1 0
ShieldIIPt-PT-040B-LTLCardinality-09: CONJ 0 2 0 0 2 0 0 0
ShieldIIPt-PT-040B-LTLCardinality-14: CONJ 0 1 0 0 3 0 0 0
ShieldIIPt-PT-040B-LTLCardinality-15: CONJ 0 3 0 0 3 0 0 0

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

Time elapsed: 22 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
lola: LAUNCH task # 26 (type EXCL) for 17 ShieldIIPt-PT-040B-LTLCardinality-15
lola: time limit : 596 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPt-PT-040B-LTLCardinality-02: LTL 0 0 0 0 1 0 1 0
ShieldIIPt-PT-040B-LTLCardinality-09: CONJ 0 2 0 0 2 0 0 0
ShieldIIPt-PT-040B-LTLCardinality-14: CONJ 0 1 0 0 3 0 0 0
ShieldIIPt-PT-040B-LTLCardinality-15: CONJ 0 2 1 0 3 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
26 LTL EXCL 5/596 5/32 ShieldIIPt-PT-040B-LTLCardinality-15 117465 m, 23493 m/sec, 394338 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPt-PT-040B-LTLCardinality-02: LTL 0 0 0 0 1 0 1 0
ShieldIIPt-PT-040B-LTLCardinality-09: CONJ 0 2 0 0 2 0 0 0
ShieldIIPt-PT-040B-LTLCardinality-14: CONJ 0 1 0 0 3 0 0 0
ShieldIIPt-PT-040B-LTLCardinality-15: CONJ 0 2 1 0 3 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
26 LTL EXCL 10/596 8/32 ShieldIIPt-PT-040B-LTLCardinality-15 209637 m, 18434 m/sec, 802835 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPt-PT-040B-LTLCardinality-02: LTL 0 0 0 0 1 0 1 0
ShieldIIPt-PT-040B-LTLCardinality-09: CONJ 0 2 0 0 2 0 0 0
ShieldIIPt-PT-040B-LTLCardinality-14: CONJ 0 1 0 0 3 0 0 0
ShieldIIPt-PT-040B-LTLCardinality-15: CONJ 0 2 1 0 3 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
26 LTL EXCL 15/596 11/32 ShieldIIPt-PT-040B-LTLCardinality-15 308134 m, 19699 m/sec, 1209741 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPt-PT-040B-LTLCardinality-02: LTL 0 0 0 0 1 0 1 0
ShieldIIPt-PT-040B-LTLCardinality-09: CONJ 0 2 0 0 2 0 0 0
ShieldIIPt-PT-040B-LTLCardinality-14: CONJ 0 1 0 0 3 0 0 0
ShieldIIPt-PT-040B-LTLCardinality-15: CONJ 0 2 1 0 3 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
26 LTL EXCL 20/596 14/32 ShieldIIPt-PT-040B-LTLCardinality-15 386383 m, 15649 m/sec, 1620924 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPt-PT-040B-LTLCardinality-02: LTL 0 0 0 0 1 0 1 0
ShieldIIPt-PT-040B-LTLCardinality-09: CONJ 0 2 0 0 2 0 0 0
ShieldIIPt-PT-040B-LTLCardinality-14: CONJ 0 1 0 0 3 0 0 0
ShieldIIPt-PT-040B-LTLCardinality-15: CONJ 0 2 1 0 3 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
26 LTL EXCL 25/596 17/32 ShieldIIPt-PT-040B-LTLCardinality-15 469979 m, 16719 m/sec, 2033154 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPt-PT-040B-LTLCardinality-02: LTL 0 0 0 0 1 0 1 0
ShieldIIPt-PT-040B-LTLCardinality-09: CONJ 0 2 0 0 2 0 0 0
ShieldIIPt-PT-040B-LTLCardinality-14: CONJ 0 1 0 0 3 0 0 0
ShieldIIPt-PT-040B-LTLCardinality-15: CONJ 0 2 1 0 3 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
26 LTL EXCL 30/596 21/32 ShieldIIPt-PT-040B-LTLCardinality-15 573616 m, 20727 m/sec, 2439806 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPt-PT-040B-LTLCardinality-02: LTL 0 0 0 0 1 0 1 0
ShieldIIPt-PT-040B-LTLCardinality-09: CONJ 0 2 0 0 2 0 0 0
ShieldIIPt-PT-040B-LTLCardinality-14: CONJ 0 1 0 0 3 0 0 0
ShieldIIPt-PT-040B-LTLCardinality-15: CONJ 0 2 1 0 3 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
26 LTL EXCL 35/596 24/32 ShieldIIPt-PT-040B-LTLCardinality-15 663664 m, 18009 m/sec, 2845452 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPt-PT-040B-LTLCardinality-02: LTL 0 0 0 0 1 0 1 0
ShieldIIPt-PT-040B-LTLCardinality-09: CONJ 0 2 0 0 2 0 0 0
ShieldIIPt-PT-040B-LTLCardinality-14: CONJ 0 1 0 0 3 0 0 0
ShieldIIPt-PT-040B-LTLCardinality-15: CONJ 0 2 1 0 3 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
26 LTL EXCL 40/596 27/32 ShieldIIPt-PT-040B-LTLCardinality-15 756962 m, 18659 m/sec, 3252643 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPt-PT-040B-LTLCardinality-02: LTL 0 0 0 0 1 0 1 0
ShieldIIPt-PT-040B-LTLCardinality-09: CONJ 0 2 0 0 2 0 0 0
ShieldIIPt-PT-040B-LTLCardinality-14: CONJ 0 1 0 0 3 0 0 0
ShieldIIPt-PT-040B-LTLCardinality-15: CONJ 0 2 1 0 3 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
26 LTL EXCL 45/596 30/32 ShieldIIPt-PT-040B-LTLCardinality-15 834523 m, 15512 m/sec, 3662756 t fired, .

Time elapsed: 67 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
lola: CANCELED task # 26 (type EXCL) for ShieldIIPt-PT-040B-LTLCardinality-15 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPt-PT-040B-LTLCardinality-02: LTL 0 0 0 0 1 0 1 0
ShieldIIPt-PT-040B-LTLCardinality-09: CONJ 0 2 0 0 2 0 0 0
ShieldIIPt-PT-040B-LTLCardinality-14: CONJ 0 1 0 0 3 0 0 0
ShieldIIPt-PT-040B-LTLCardinality-15: CONJ 0 2 0 0 3 0 1 0

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

Time elapsed: 72 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
lola: LAUNCH task # 24 (type EXCL) for 17 ShieldIIPt-PT-040B-LTLCardinality-15
lola: time limit : 705 sec
lola: memory limit: 32 pages
lola: FINISHED task # 24 (type EXCL) for ShieldIIPt-PT-040B-LTLCardinality-15
lola: result : true
lola: markings : 8
lola: fired transitions : 8
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 20 (type EXCL) for 17 ShieldIIPt-PT-040B-LTLCardinality-15
lola: time limit : 882 sec
lola: memory limit: 32 pages
lola: FINISHED task # 20 (type EXCL) for ShieldIIPt-PT-040B-LTLCardinality-15
lola: result : true
lola: markings : 2
lola: fired transitions : 1
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 15 (type EXCL) for 10 ShieldIIPt-PT-040B-LTLCardinality-14
lola: time limit : 1176 sec
lola: memory limit: 32 pages
lola: FINISHED task # 15 (type EXCL) for ShieldIIPt-PT-040B-LTLCardinality-14
lola: result : false
lola: markings : 9628
lola: fired transitions : 9636
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 8 (type EXCL) for 3 ShieldIIPt-PT-040B-LTLCardinality-09
lola: time limit : 1764 sec
lola: memory limit: 32 pages
lola: FINISHED task # 8 (type EXCL) for ShieldIIPt-PT-040B-LTLCardinality-09
lola: result : false
lola: markings : 139
lola: fired transitions : 139
lola: time used : 0.000000
lola: memory pages used : 1
lola: Portfolio finished: no open tasks 4

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldIIPt-PT-040B-LTLCardinality-02: LTL unknown AGGR
ShieldIIPt-PT-040B-LTLCardinality-09: CONJ false LTL model checker
ShieldIIPt-PT-040B-LTLCardinality-14: CONJ false LTL model checker
ShieldIIPt-PT-040B-LTLCardinality-15: CONJ unknown CONJ


Time elapsed: 72 secs. Pages in use: 32

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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