Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r154-tall-171631152600353.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is DoubleExponent-PT-020, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r154-tall-171631152600353
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 780K
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 70K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 15:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 114K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 19 15:25 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 340K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME StableMarking

=== Now, execution of the tool begins

BK_START 1716408320919

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=gold2023
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=DoubleExponent-PT-020
Not applying reductions.
Model is PT
StableMarking PT
Running Version 202304061127
[2024-05-22 20:05:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2024-05-22 20:05:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 20:05:22] [INFO ] Load time of PNML (sax parser for PT used): 80 ms
[2024-05-22 20:05:22] [INFO ] Transformed 1064 places.
[2024-05-22 20:05:22] [INFO ] Transformed 998 transitions.
[2024-05-22 20:05:22] [INFO ] Parsed PT model containing 1064 places and 998 transitions and 2814 arcs in 150 ms.
Structural test allowed to assert that 11 places are NOT stable. Took 11 ms.
[2024-05-22 20:05:23] [INFO ] Flatten gal took : 203 ms
[2024-05-22 20:05:23] [INFO ] Flatten gal took : 117 ms
[2024-05-22 20:05:23] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1417997960541085411.gal : 41 ms
[2024-05-22 20:05:23] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16465878938867687079.prop : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality1417997960541085411.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16465878938867687079.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality16465878938867687079.prop.
Incomplete random walk after 10000 steps, including 340 resets, run finished after 1259 ms. (steps per millisecond=7 ) properties (out of 1053) seen :44
SDD proceeding with computation,1053 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,1053 properties remain. new max is 8
SDD size :4 after 7
Invariant property smplace_953 does not hold.
Invariant property smplace_143 does not hold.
Invariant property smplace_132 does not hold.
Invariant property smplace_121 does not hold.
SDD proceeding with computation,1049 properties remain. new max is 8
SDD size :7 after 11
Probabilistic random walk after 30000 steps, saw 15006 distinct states, run finished after 1299 ms. (steps per millisecond=23 ) properties seen :91
Running SMT prover for 918 properties.
// Phase 1: matrix 998 rows 1064 cols
Invariant property smplace_154 does not hold.
[2024-05-22 20:05:25] [INFO ] Invariants computation overflowed in 126 ms
Invariant property smplace_77 does not hold.
SDD proceeding with computation,1047 properties remain. new max is 8
SDD size :11 after 12
Invariant property smplace_587 does not hold.
Invariant property smplace_576 does not hold.
Invariant property smplace_565 does not hold.
Invariant property smplace_299 does not hold.
Invariant property smplace_276 does not hold.
Invariant property smplace_265 does not hold.
Invariant property smplace_254 does not hold.
Invariant property smplace_243 does not hold.
Invariant property smplace_199 does not hold.
Invariant property smplace_188 does not hold.
Invariant property smplace_177 does not hold.
Invariant property smplace_165 does not hold.
SDD proceeding with computation,1035 properties remain. new max is 8
SDD size :12 after 20
Invariant property smplace_332 does not hold.
Invariant property smplace_321 does not hold.
Invariant property smplace_310 does not hold.
Invariant property smplace_288 does not hold.
Invariant property smplace_88 does not hold.
SDD proceeding with computation,1030 properties remain. new max is 8
SDD size :20 after 24
Invariant property smplace_343 does not hold.
SDD proceeding with computation,1029 properties remain. new max is 8
SDD size :24 after 26
Invariant property smplace_532 does not hold.
Invariant property smplace_521 does not hold.
Invariant property smplace_510 does not hold.
Invariant property smplace_354 does not hold.
SDD proceeding with computation,1025 properties remain. new max is 8
SDD size :26 after 29
SDD proceeding with computation,1025 properties remain. new max is 16
SDD size :29 after 31
SDD proceeding with computation,1025 properties remain. new max is 32
SDD size :31 after 32
SDD proceeding with computation,1025 properties remain. new max is 64
SDD size :32 after 44
Invariant property smplace_554 does not hold.
Invariant property smplace_543 does not hold.
SDD proceeding with computation,1023 properties remain. new max is 64
SDD size :44 after 57
Invariant property smplace_487 does not hold.
Invariant property smplace_476 does not hold.
Invariant property smplace_465 does not hold.
Invariant property smplace_454 does not hold.
Invariant property smplace_443 does not hold.
Invariant property smplace_432 does not hold.
Invariant property smplace_421 does not hold.
Invariant property smplace_410 does not hold.
Invariant property smplace_399 does not hold.
Invariant property smplace_387 does not hold.
Invariant property smplace_376 does not hold.
Invariant property smplace_365 does not hold.
Invariant property smplace_221 does not hold.
Invariant property smplace_210 does not hold.
SDD proceeding with computation,1009 properties remain. new max is 64
SDD size :57 after 77
SDD proceeding with computation,1009 properties remain. new max is 128
SDD size :77 after 95
SDD proceeding with computation,1009 properties remain. new max is 256
SDD size :95 after 133
Invariant property smplace_1053 does not hold.
Invariant property smplace_1042 does not hold.
Invariant property smplace_1031 does not hold.
Invariant property smplace_876 does not hold.
Invariant property smplace_865 does not hold.
Invariant property smplace_854 does not hold.
Invariant property smplace_843 does not hold.
Invariant property smplace_831 does not hold.
Invariant property smplace_820 does not hold.
Invariant property smplace_809 does not hold.
Invariant property smplace_798 does not hold.
Invariant property smplace_787 does not hold.
Invariant property smplace_776 does not hold.
Invariant property smplace_765 does not hold.
Invariant property smplace_720 does not hold.
Invariant property smplace_709 does not hold.
Invariant property smplace_698 does not hold.
Invariant property smplace_687 does not hold.
Invariant property smplace_676 does not hold.
Invariant property smplace_665 does not hold.
Invariant property smplace_654 does not hold.
Invariant property smplace_643 does not hold.
Invariant property smplace_632 does not hold.
Invariant property smplace_621 does not hold.
Invariant property smplace_609 does not hold.
Invariant property smplace_598 does not hold.
Invariant property smplace_498 does not hold.
Invariant property smplace_232 does not hold.
Invariant property smplace_78 does not hold.
Invariant property smplace_76 does not hold.
Invariant property smplace_75 does not hold.
Invariant property smplace_46 does not hold.
Invariant property smplace_35 does not hold.
Invariant property smplace_24 does not hold.
Invariant property smplace_13 does not hold.
Invariant property smplace_2 does not hold.
SDD proceeding with computation,973 properties remain. new max is 256
SDD size :133 after 192
Invariant property smplace_68 does not hold.
Invariant property smplace_57 does not hold.
SDD proceeding with computation,971 properties remain. new max is 256
SDD size :192 after 426
Invariant property smplace_74 does not hold.
SDD proceeding with computation,970 properties remain. new max is 256
SDD size :426 after 864
Invariant property smplace_1009 does not hold.
Invariant property smplace_998 does not hold.
Invariant property smplace_987 does not hold.
Invariant property smplace_976 does not hold.
Invariant property smplace_965 does not hold.
Invariant property smplace_954 does not hold.
Invariant property smplace_942 does not hold.
Invariant property smplace_931 does not hold.
Invariant property smplace_920 does not hold.
Invariant property smplace_909 does not hold.
Invariant property smplace_898 does not hold.
Invariant property smplace_887 does not hold.
Invariant property smplace_743 does not hold.
Invariant property smplace_732 does not hold.
SDD proceeding with computation,956 properties remain. new max is 256
SDD size :864 after 1267
SDD proceeding with computation,956 properties remain. new max is 512
SDD size :1267 after 1885
SDD proceeding with computation,956 properties remain. new max is 1024
SDD size :1885 after 3567
Invariant property smplace_1020 does not hold.
Invariant property smplace_754 does not hold.
Invariant property smplace_136 does not hold.
Invariant property smplace_135 does not hold.
Invariant property smplace_134 does not hold.
Invariant property smplace_131 does not hold.
Invariant property smplace_130 does not hold.
Invariant property smplace_129 does not hold.
Invariant property smplace_128 does not hold.
Invariant property smplace_127 does not hold.
Invariant property smplace_126 does not hold.
Invariant property smplace_125 does not hold.
Invariant property smplace_124 does not hold.
Invariant property smplace_123 does not hold.
Invariant property smplace_122 does not hold.
Invariant property smplace_106 does not hold.
Invariant property smplace_105 does not hold.
Invariant property smplace_104 does not hold.
Invariant property smplace_103 does not hold.
Invariant property smplace_102 does not hold.
Invariant property smplace_101 does not hold.
Invariant property smplace_100 does not hold.
Invariant property smplace_98 does not hold.
Invariant property smplace_97 does not hold.
Invariant property smplace_96 does not hold.
Invariant property smplace_95 does not hold.
Invariant property smplace_91 does not hold.
Invariant property smplace_90 does not hold.
Invariant property smplace_89 does not hold.
Invariant property smplace_87 does not hold.
Invariant property smplace_86 does not hold.
Invariant property smplace_85 does not hold.
Invariant property smplace_84 does not hold.
Invariant property smplace_83 does not hold.
Invariant property smplace_82 does not hold.
Invariant property smplace_81 does not hold.
Invariant property smplace_80 does not hold.
Invariant property smplace_79 does not hold.
SDD proceeding with computation,918 properties remain. new max is 1024
SDD size :3567 after 8329
SDD proceeding with computation,918 properties remain. new max is 2048
SDD size :8329 after 29097
SDD proceeding with computation,918 properties remain. new max is 4096
SDD size :29097 after 118876
Invariant property smplace_133 does not hold.
Invariant property smplace_119 does not hold.
Invariant property smplace_118 does not hold.
Invariant property smplace_117 does not hold.
Invariant property smplace_116 does not hold.
Invariant property smplace_115 does not hold.
Invariant property smplace_114 does not hold.
Invariant property smplace_113 does not hold.
Invariant property smplace_112 does not hold.
Invariant property smplace_111 does not hold.
Invariant property smplace_109 does not hold.
Invariant property smplace_108 does not hold.
Invariant property smplace_107 does not hold.
Invariant property smplace_93 does not hold.
Invariant property smplace_92 does not hold.
SDD proceeding with computation,903 properties remain. new max is 4096
SDD size :118876 after 358780
SDD proceeding with computation,903 properties remain. new max is 8192
SDD size :358780 after 624853
SDD proceeding with computation,903 properties remain. new max is 16384
SDD size :624853 after 1.17566e+06
Invariant property smplace_195 does not hold.
Invariant property smplace_194 does not hold.
Invariant property smplace_193 does not hold.
Invariant property smplace_189 does not hold.
Invariant property smplace_187 does not hold.
Invariant property smplace_186 does not hold.
Invariant property smplace_185 does not hold.
Invariant property smplace_184 does not hold.
Invariant property smplace_183 does not hold.
Invariant property smplace_182 does not hold.
Invariant property smplace_181 does not hold.
Invariant property smplace_164 does not hold.
Invariant property smplace_163 does not hold.
Invariant property smplace_162 does not hold.
Invariant property smplace_161 does not hold.
Invariant property smplace_160 does not hold.
Invariant property smplace_159 does not hold.
Invariant property smplace_158 does not hold.
Invariant property smplace_157 does not hold.
Invariant property smplace_156 does not hold.
Invariant property smplace_155 does not hold.
Invariant property smplace_153 does not hold.
Invariant property smplace_149 does not hold.
Invariant property smplace_148 does not hold.
Invariant property smplace_147 does not hold.
Invariant property smplace_146 does not hold.
Invariant property smplace_145 does not hold.
Invariant property smplace_144 does not hold.
Invariant property smplace_142 does not hold.
Invariant property smplace_141 does not hold.
Invariant property smplace_140 does not hold.
Invariant property smplace_139 does not hold.
Invariant property smplace_138 does not hold.
Invariant property smplace_137 does not hold.
Invariant property smplace_120 does not hold.
Invariant property smplace_94 does not hold.
SDD proceeding with computation,867 properties remain. new max is 16384
SDD size :1.17566e+06 after 2.38516e+06
Invariant property smplace_191 does not hold.
Invariant property smplace_190 does not hold.
SDD proceeding with computation,865 properties remain. new max is 16384
SDD size :2.38516e+06 after 5.78554e+07
SDD proceeding with computation,865 properties remain. new max is 32768
SDD size :5.78554e+07 after 1.94657e+08
SDD proceeding with computation,865 properties remain. new max is 65536
SDD size :1.94657e+08 after 6.40706e+08
SDD proceeding with computation,865 properties remain. new max is 131072
SDD size :6.40706e+08 after 2.01777e+09
[2024-05-22 20:05:49] [INFO ] After 23587ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:918
SDD proceeding with computation,865 properties remain. new max is 262144
SDD size :2.01777e+09 after 6.15747e+09
SDD proceeding with computation,865 properties remain. new max is 524288
SDD size :6.15747e+09 after 1.84724e+10
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:632)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.applyReachabilitySolver(GlobalPropertySolver.java:724)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:558)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preSolveLiveness(GlobalPropertySolver.java:412)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preStableMarking(GlobalPropertySolver.java:321)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:294)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:426)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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)
[2024-05-22 20:06:14] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-22 20:06:14] [INFO ] After 25019ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:918
Fused 918 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 865 out of 1064 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1064/1064 places, 998/998 transitions.
Drop transitions removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 1064 transition count 956
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 84 place count 1022 transition count 956
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 84 place count 1022 transition count 949
Deduced a syphon composed of 7 places in 12 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 98 place count 1015 transition count 949
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 15 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 2 with 78 rules applied. Total rules applied 176 place count 976 transition count 910
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 7 places in 39 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 190 place count 969 transition count 910
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 2 with 10 rules applied. Total rules applied 200 place count 969 transition count 900
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 210 place count 959 transition count 900
Partial Free-agglomeration rule applied 15 times.
Drop transitions removed 15 transitions
Iterating global reduction 3 with 15 rules applied. Total rules applied 225 place count 959 transition count 900
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 226 place count 958 transition count 899
Applied a total of 226 rules in 362 ms. Remains 958 /1064 variables (removed 106) and now considering 899/998 (removed 99) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 363 ms. Remains : 958/1064 places, 899/998 transitions.
Interrupted random walk after 374775 steps, including 48065 resets, run timeout after 30001 ms. (steps per millisecond=12 ) properties seen 0
Incomplete Best-First random walk after 1000 steps, including 79 resets, run finished after 51 ms. (steps per millisecond=19 ) properties (out of 865) seen :0
Incomplete Best-First random walk after 1001 steps, including 79 resets, run finished after 50 ms. (steps per millisecond=20 ) properties (out of 865) seen :0
Incomplete Best-First random walk after 1001 steps, including 86 resets, run finished after 61 ms. (steps per millisecond=16 ) properties (out of 865) seen :0
Incomplete Best-First random walk after 1000 steps, including 77 resets, run finished after 53 ms. (steps per millisecond=18 ) properties (out of 865) seen :0
Incomplete Best-First random walk after 1000 steps, including 81 resets, run finished after 59 ms. (steps per millisecond=16 ) properties (out of 865) seen :0
Incomplete Best-First random walk after 1000 steps, including 78 resets, run finished after 48 ms. (steps per millisecond=20 ) properties (out of 865) seen :0
Incomplete Best-First random walk after 1001 steps, including 83 resets, run finished after 67 ms. (steps per millisecond=14 ) properties (out of 865) seen :0
Incomplete Best-First random walk after 1000 steps, including 85 resets, run finished after 46 ms. (steps per millisecond=21 ) properties (out of 865) seen :0
Incomplete Best-First random walk after 1001 steps, including 79 resets, run finished after 45 ms. (steps per millisecond=22 ) properties (out of 865) seen :0
Incomplete Best-First random walk after 1000 steps, including 74 resets, run finished after 44 ms. (steps per millisecond=22 ) properties (out of 865) seen :0
Incomplete Best-First random walk after 1001 steps, including 76 resets, run finished after 45 ms. (steps per millisecond=22 ) properties (out of 865) seen :0
Incomplete Best-First random walk after 1000 steps, including 91 resets, run finished after 45 ms. (steps per millisecond=22 ) properties (out of 865) seen :0
Incomplete Best-First random walk after 1001 steps, including 91 resets, run finished after 45 ms. (steps per millisecond=22 ) properties (out of 865) seen :0
Incomplete Best-First random walk after 1001 steps, including 93 resets, run finished after 46 ms. (steps per millisecond=21 ) properties (out of 865) seen :0
Incomplete Best-First random walk after 1000 steps, including 91 resets, run finished after 45 ms. (steps per millisecond=22 ) properties (out of 865) seen :0
Incomplete Best-First random walk after 1000 steps, including 81 resets, run finished after 45 ms. (steps per millisecond=22 ) properties (out of 865) seen :0
Incomplete Best-First random walk after 1001 steps, including 91 resets, run finished after 47 ms. (steps per millisecond=21 ) properties (out of 865) seen :0
Incomplete Best-First random walk after 1001 steps, including 85 resets, run finished after 46 ms. (steps per millisecond=21 ) properties (out of 865) seen :0
Incomplete Best-First random walk after 1000 steps, including 93 resets, run finished after 50 ms. (steps per millisecond=20 ) properties (out of 865) seen :0
Incomplete Best-First random walk after 1001 steps, including 81 resets, run finished after 45 ms. (steps per millisecond=22 ) properties (out of 865) seen :0
Incomplete Best-First random walk after 1000 steps, including 87 resets, run finished after 47 ms. (steps per millisecond=21 ) properties (out of 865) seen :0
Incomplete Best-First random walk after 1000 steps, including 80 resets, run finished after 46 ms. (steps per millisecond=21 ) properties (out of 865) seen :0
Incomplete Best-First random walk after 1000 steps, including 93 resets, run finished after 46 ms. (steps per millisecond=21 ) properties (out of 865) seen :0
Incomplete Best-First random walk after 1001 steps, including 84 resets, run finished after 65 ms. (steps per millisecond=15 ) properties (out of 865) seen :0
Incomplete Best-First random walk after 1000 steps, including 85 resets, run finished after 46 ms. (steps per millisecond=21 ) properties (out of 865) seen :0
Incomplete Best-First random walk after 1000 steps, including 77 resets, run finished after 45 ms. (steps per millisecond=22 ) properties (out of 865) seen :0
Incomplete Best-First random walk after 1000 steps, including 89 resets, run finished after 45 ms. (steps per millisecond=22 ) properties (out of 865) seen :0
Incomplete Best-First random walk after 1001 steps, including 82 resets, run finished after 55 ms. (steps per millisecond=18 ) properties (out of 865) seen :0
Incomplete Best-First random walk after 1000 steps, including 87 resets, run finished after 47 ms. (steps per millisecond=21 ) properties (out of 865) seen :0
Incomplete Best-First random walk after 1000 steps, including 89 resets, run finished after 46 ms. (steps per millisecond=21 ) properties (out of 865) seen :0
Incomplete Best-First random walk after 1000 steps, including 86 resets, run finished after 46 ms. (steps per millisecond=21 ) properties (out of 865) seen :0
Incomplete Best-First random walk after 1000 steps, including 93 resets, run finished after 46 ms. (steps per millisecond=21 ) properties (out of 865) seen :0
Incomplete Best-First random walk after 1001 steps, including 93 resets, run finished after 64 ms. (steps per millisecond=15 ) properties (out of 865) seen :0
Incomplete Best-First random walk after 1001 steps, including 82 resets, run finished after 46 ms. (steps per millisecond=21 ) properties (out of 865) seen :0
Incomplete Best-First random walk after 1000 steps, including 81 resets, run finished after 45 ms. (steps per millisecond=22 ) properties (out of 865) seen :0
Incomplete Best-First random walk after 1001 steps, including 87 resets, run finished after 75 ms. (steps per millisecond=13 ) properties (out of 865) seen :0
Incomplete Best-First random walk after 1001 steps, including 86 resets, run finished after 53 ms. (steps per millisecond=18 ) properties (out of 865) seen :0
Incomplete Best-First random walk after 1000 steps, including 76 resets, run finished after 46 ms. (steps per millisecond=21 ) properties (out of 865) seen :0
Incomplete Best-First random walk after 1000 steps, including 87 resets, run finished after 46 ms. (steps per millisecond=21 ) properties (out of 865) seen :0
Incomplete Best-First random walk after 1001 steps, including 89 resets, run finished after 47 ms. (steps per millisecond=21 ) properties (out of 865) seen :0
Incomplete Best-First random walk after 1000 steps, including 71 resets, run finished after 44 ms. (steps per millisecond=22 ) properties (out of 865) seen :0
Incomplete Best-First random walk after 1000 steps, including 83 resets, run finished after 67 ms. (steps per millisecond=14 ) properties (out of 865) seen :0
Incomplete Best-First random walk after 1000 steps, including 80 resets, run finished after 44 ms. (steps per millisecond=22 ) properties (out of 865) seen :0
Incomplete Best-First random walk after 1001 steps, including 83 resets, run finished after 46 ms. (steps per millisecond=21 ) properties (out of 865) seen :0
Incomplete Best-First random walk after 1000 steps, including 93 resets, run finished after 47 ms. (steps per millisecond=21 ) properties (out of 865) seen :0
Incomplete Best-First random walk after 1001 steps, including 84 resets, run finished after 86 ms. (steps per millisecond=11 ) properties (out of 865) seen :0
Incomplete Best-First random walk after 1001 steps, including 85 resets, run finished after 65 ms. (steps per millisecond=15 ) properties (out of 865) seen :0
Incomplete Best-First random walk after 1000 steps, including 89 resets, run finished after 87 ms. (steps per millisecond=11 ) properties (out of 865) seen :0
Incomplete Best-First random walk after 1001 steps, including 80 resets, run finished after 60 ms. (steps per millisecond=16 ) properties (out of 865) seen :0
Incomplete Best-First random walk after 1000 steps, including 81 resets, run finished after 61 ms. (steps per millisecond=16 ) properties (out of 865) seen :0
Invariant property smplace_192 does not hold.
Invariant property smplace_179 does not hold.
Invariant property smplace_178 does not hold.
Invariant property smplace_175 does not hold.
Invariant property smplace_174 does not hold.
Invariant property smplace_173 does not hold.
Invariant property smplace_172 does not hold.
Invariant property smplace_171 does not hold.
Invariant property smplace_170 does not hold.
Invariant property smplace_169 does not hold.
Invariant property smplace_168 does not hold.
Invariant property smplace_167 does not hold.
Invariant property smplace_166 does not hold.
Invariant property smplace_151 does not hold.
Invariant property smplace_150 does not hold.
SDD proceeding with computation,850 properties remain. new max is 524288
SDD size :1.84724e+10 after 5.33859e+10
SDD proceeding with computation,850 properties remain. new max is 1048576
SDD size :5.33859e+10 after 9.64618e+10
Probabilistic random walk after 1000001 steps, saw 500315 distinct states, run finished after 49298 ms. (steps per millisecond=20 ) properties seen :0
Running SMT prover for 865 properties.
// Phase 1: matrix 899 rows 958 cols
[2024-05-22 20:07:37] [INFO ] Invariants computation overflowed in 232 ms
[2024-05-22 20:07:57] [INFO ] After 19729ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:865
SDD proceeding with computation,850 properties remain. new max is 2097152
SDD size :9.64618e+10 after 1.49276e+11
[2024-05-22 20:09:11] [INFO ] After 50663ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :865
[2024-05-22 20:09:11] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-22 20:10:04] [INFO ] After 53752ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :865
[2024-05-22 20:10:05] [INFO ] Deduced a trap composed of 74 places in 265 ms of which 5 ms to minimize.
[2024-05-22 20:10:05] [INFO ] Deduced a trap composed of 124 places in 170 ms of which 1 ms to minimize.
[2024-05-22 20:10:05] [INFO ] Deduced a trap composed of 134 places in 167 ms of which 1 ms to minimize.
[2024-05-22 20:10:05] [INFO ] Deduced a trap composed of 157 places in 163 ms of which 0 ms to minimize.
[2024-05-22 20:10:06] [INFO ] Deduced a trap composed of 132 places in 180 ms of which 1 ms to minimize.
[2024-05-22 20:10:06] [INFO ] Deduced a trap composed of 218 places in 161 ms of which 0 ms to minimize.
[2024-05-22 20:10:06] [INFO ] Deduced a trap composed of 171 places in 168 ms of which 2 ms to minimize.
[2024-05-22 20:10:06] [INFO ] Deduced a trap composed of 122 places in 154 ms of which 0 ms to minimize.
[2024-05-22 20:10:07] [INFO ] Deduced a trap composed of 110 places in 153 ms of which 1 ms to minimize.
[2024-05-22 20:10:07] [INFO ] Deduced a trap composed of 159 places in 128 ms of which 0 ms to minimize.
[2024-05-22 20:10:07] [INFO ] Deduced a trap composed of 160 places in 153 ms of which 0 ms to minimize.
[2024-05-22 20:10:07] [INFO ] Deduced a trap composed of 146 places in 137 ms of which 1 ms to minimize.
[2024-05-22 20:10:07] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 2651 ms
[2024-05-22 20:10:09] [INFO ] Deduced a trap composed of 368 places in 268 ms of which 1 ms to minimize.
[2024-05-22 20:10:09] [INFO ] Deduced a trap composed of 382 places in 275 ms of which 1 ms to minimize.
[2024-05-22 20:10:09] [INFO ] Deduced a trap composed of 28 places in 263 ms of which 1 ms to minimize.
[2024-05-22 20:10:10] [INFO ] Deduced a trap composed of 326 places in 315 ms of which 1 ms to minimize.
[2024-05-22 20:10:10] [INFO ] Deduced a trap composed of 370 places in 260 ms of which 0 ms to minimize.
[2024-05-22 20:10:10] [INFO ] Deduced a trap composed of 396 places in 268 ms of which 1 ms to minimize.
[2024-05-22 20:10:11] [INFO ] Deduced a trap composed of 401 places in 272 ms of which 0 ms to minimize.
[2024-05-22 20:10:11] [INFO ] Deduced a trap composed of 396 places in 254 ms of which 0 ms to minimize.
[2024-05-22 20:10:11] [INFO ] Deduced a trap composed of 370 places in 274 ms of which 0 ms to minimize.
[2024-05-22 20:10:12] [INFO ] Deduced a trap composed of 52 places in 255 ms of which 1 ms to minimize.
[2024-05-22 20:10:12] [INFO ] Deduced a trap composed of 161 places in 149 ms of which 1 ms to minimize.
[2024-05-22 20:10:12] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 3571 ms
[2024-05-22 20:10:13] [INFO ] Deduced a trap composed of 208 places in 115 ms of which 0 ms to minimize.
[2024-05-22 20:10:13] [INFO ] Deduced a trap composed of 205 places in 124 ms of which 0 ms to minimize.
[2024-05-22 20:10:13] [INFO ] Deduced a trap composed of 194 places in 115 ms of which 0 ms to minimize.
[2024-05-22 20:10:13] [INFO ] Deduced a trap composed of 196 places in 129 ms of which 0 ms to minimize.
[2024-05-22 20:10:13] [INFO ] Deduced a trap composed of 182 places in 124 ms of which 0 ms to minimize.
[2024-05-22 20:10:14] [INFO ] Deduced a trap composed of 172 places in 138 ms of which 1 ms to minimize.
[2024-05-22 20:10:14] [INFO ] Deduced a trap composed of 184 places in 123 ms of which 0 ms to minimize.
[2024-05-22 20:10:15] [INFO ] Deduced a trap composed of 86 places in 175 ms of which 0 ms to minimize.
[2024-05-22 20:10:15] [INFO ] Deduced a trap composed of 88 places in 176 ms of which 1 ms to minimize.
[2024-05-22 20:10:15] [INFO ] Deduced a trap composed of 100 places in 166 ms of which 0 ms to minimize.
[2024-05-22 20:10:15] [INFO ] Deduced a trap composed of 145 places in 168 ms of which 5 ms to minimize.
[2024-05-22 20:10:16] [INFO ] Deduced a trap composed of 170 places in 167 ms of which 0 ms to minimize.
[2024-05-22 20:10:16] [INFO ] Deduced a trap composed of 112 places in 165 ms of which 0 ms to minimize.
[2024-05-22 20:10:16] [INFO ] Deduced a trap composed of 76 places in 184 ms of which 1 ms to minimize.
[2024-05-22 20:10:17] [INFO ] Deduced a trap composed of 217 places in 191 ms of which 4 ms to minimize.
[2024-05-22 20:10:17] [INFO ] Deduced a trap composed of 62 places in 184 ms of which 1 ms to minimize.
[2024-05-22 20:10:17] [INFO ] Deduced a trap composed of 64 places in 186 ms of which 1 ms to minimize.
[2024-05-22 20:10:17] [INFO ] Deduced a trap composed of 50 places in 195 ms of which 0 ms to minimize.
[2024-05-22 20:10:18] [INFO ] Deduced a trap composed of 186 places in 197 ms of which 1 ms to minimize.
[2024-05-22 20:10:18] [INFO ] Deduced a trap composed of 40 places in 201 ms of which 0 ms to minimize.
[2024-05-22 20:10:18] [INFO ] Deduced a trap composed of 146 places in 190 ms of which 1 ms to minimize.
[2024-05-22 20:10:18] [INFO ] Deduced a trap composed of 232 places in 197 ms of which 1 ms to minimize.
[2024-05-22 20:10:19] [INFO ] Deduced a trap composed of 189 places in 194 ms of which 1 ms to minimize.
[2024-05-22 20:10:19] [INFO ] Deduced a trap composed of 126 places in 194 ms of which 1 ms to minimize.
[2024-05-22 20:10:19] [INFO ] Deduced a trap composed of 192 places in 196 ms of which 1 ms to minimize.
[2024-05-22 20:10:19] [INFO ] Deduced a trap composed of 196 places in 201 ms of which 0 ms to minimize.
[2024-05-22 20:10:20] [INFO ] Deduced a trap composed of 198 places in 196 ms of which 1 ms to minimize.
[2024-05-22 20:10:20] [INFO ] Deduced a trap composed of 182 places in 194 ms of which 1 ms to minimize.
[2024-05-22 20:10:20] [INFO ] Deduced a trap composed of 38 places in 190 ms of which 0 ms to minimize.
[2024-05-22 20:10:21] [INFO ] Deduced a trap composed of 27 places in 205 ms of which 0 ms to minimize.
[2024-05-22 20:10:21] [INFO ] Deduced a trap composed of 35 places in 204 ms of which 0 ms to minimize.
[2024-05-22 20:10:21] [INFO ] Deduced a trap composed of 18 places in 208 ms of which 0 ms to minimize.
[2024-05-22 20:10:22] [INFO ] Deduced a trap composed of 25 places in 218 ms of which 10 ms to minimize.
[2024-05-22 20:10:22] [INFO ] Deduced a trap composed of 44 places in 202 ms of which 2 ms to minimize.
[2024-05-22 20:10:22] [INFO ] Deduced a trap composed of 69 places in 190 ms of which 1 ms to minimize.
[2024-05-22 20:10:23] [INFO ] Deduced a trap composed of 81 places in 200 ms of which 1 ms to minimize.
[2024-05-22 20:10:23] [INFO ] Deduced a trap composed of 56 places in 189 ms of which 1 ms to minimize.
[2024-05-22 20:10:32] [INFO ] Trap strengthening (SAT) tested/added 37/37 trap constraints in 19386 ms
[2024-05-22 20:10:41] [INFO ] Deduced a trap composed of 4 places in 252 ms of which 1 ms to minimize.
[2024-05-22 20:10:42] [INFO ] Deduced a trap composed of 4 places in 223 ms of which 0 ms to minimize.
[2024-05-22 20:10:42] [INFO ] Deduced a trap composed of 165 places in 164 ms of which 1 ms to minimize.
[2024-05-22 20:10:42] [INFO ] Deduced a trap composed of 253 places in 174 ms of which 1 ms to minimize.
[2024-05-22 20:10:42] [INFO ] Deduced a trap composed of 105 places in 167 ms of which 1 ms to minimize.
[2024-05-22 20:10:45] [INFO ] Deduced a trap composed of 128 places in 155 ms of which 1 ms to minimize.
[2024-05-22 20:10:45] [INFO ] Deduced a trap composed of 98 places in 165 ms of which 0 ms to minimize.
[2024-05-22 20:10:45] [INFO ] Deduced a trap composed of 148 places in 163 ms of which 2 ms to minimize.
[2024-05-22 20:10:46] [INFO ] Deduced a trap composed of 184 places in 126 ms of which 0 ms to minimize.
[2024-05-22 20:10:46] [INFO ] Deduced a trap composed of 188 places in 126 ms of which 1 ms to minimize.
[2024-05-22 20:10:46] [INFO ] Deduced a trap composed of 374 places in 276 ms of which 0 ms to minimize.
[2024-05-22 20:10:47] [INFO ] Deduced a trap composed of 212 places in 122 ms of which 0 ms to minimize.
[2024-05-22 20:10:49] [INFO ] Deduced a trap composed of 164 places in 136 ms of which 1 ms to minimize.
[2024-05-22 20:10:50] [INFO ] Deduced a trap composed of 165 places in 149 ms of which 0 ms to minimize.
[2024-05-22 20:10:51] [INFO ] Deduced a trap composed of 153 places in 160 ms of which 0 ms to minimize.
[2024-05-22 20:10:52] [INFO ] Deduced a trap composed of 140 places in 148 ms of which 1 ms to minimize.
[2024-05-22 20:10:52] [INFO ] Deduced a trap composed of 124 places in 160 ms of which 0 ms to minimize.
[2024-05-22 20:10:53] [INFO ] Deduced a trap composed of 160 places in 164 ms of which 1 ms to minimize.
[2024-05-22 20:10:53] [INFO ] Deduced a trap composed of 116 places in 161 ms of which 1 ms to minimize.
[2024-05-22 20:10:58] [INFO ] Deduced a trap composed of 331 places in 259 ms of which 1 ms to minimize.
[2024-05-22 20:11:06] [INFO ] Deduced a trap composed of 12 places in 227 ms of which 1 ms to minimize.
[2024-05-22 20:11:07] [INFO ] Deduced a trap composed of 136 places in 148 ms of which 1 ms to minimize.
[2024-05-22 20:11:10] [INFO ] Deduced a trap composed of 190 places in 168 ms of which 0 ms to minimize.
[2024-05-22 20:11:10] [INFO ] Deduced a trap composed of 92 places in 168 ms of which 1 ms to minimize.
[2024-05-22 20:11:14] [INFO ] Deduced a trap composed of 9 places in 244 ms of which 1 ms to minimize.
[2024-05-22 20:11:14] [INFO ] Deduced a trap composed of 45 places in 239 ms of which 1 ms to minimize.
[2024-05-22 20:11:14] [INFO ] Deduced a trap composed of 57 places in 240 ms of which 0 ms to minimize.
[2024-05-22 20:11:14] [INFO ] Deduced a trap composed of 414 places in 241 ms of which 1 ms to minimize.
[2024-05-22 20:11:15] [INFO ] Deduced a trap composed of 11 places in 205 ms of which 0 ms to minimize.
[2024-05-22 20:11:15] [INFO ] Deduced a trap composed of 93 places in 185 ms of which 1 ms to minimize.
[2024-05-22 20:11:16] [INFO ] Deduced a trap composed of 150 places in 150 ms of which 1 ms to minimize.
[2024-05-22 20:11:16] [INFO ] Deduced a trap composed of 129 places in 155 ms of which 0 ms to minimize.
[2024-05-22 20:11:16] [INFO ] Deduced a trap composed of 141 places in 147 ms of which 0 ms to minimize.
[2024-05-22 20:11:16] [INFO ] Deduced a trap composed of 189 places in 121 ms of which 1 ms to minimize.
[2024-05-22 20:11:16] [INFO ] Trap strengthening (SAT) tested/added 35/34 trap constraints in 35159 ms
[2024-05-22 20:11:21] [INFO ] Deduced a trap composed of 214 places in 121 ms of which 0 ms to minimize.
[2024-05-22 20:11:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 252 ms
[2024-05-22 20:11:22] [INFO ] Deduced a trap composed of 239 places in 247 ms of which 1 ms to minimize.
[2024-05-22 20:11:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 378 ms
[2024-05-22 20:11:24] [INFO ] Deduced a trap composed of 318 places in 266 ms of which 1 ms to minimize.
[2024-05-22 20:11:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 355 ms
[2024-05-22 20:11:33] [INFO ] Deduced a trap composed of 324 places in 257 ms of which 1 ms to minimize.
[2024-05-22 20:11:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 347 ms
[2024-05-22 20:11:42] [INFO ] After 150800ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :864
Attempting to minimize the solution found.
Minimization took 1 ms.
[2024-05-22 20:11:42] [INFO ] After 225026ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :864
Fused 865 Parikh solutions to 826 different solutions.
SDD proceeding with computation,850 properties remain. new max is 4194304
SDD size :1.49276e+11 after 3.13374e+11
Parikh walk visited 0 properties in 30007 ms.
Support contains 850 out of 958 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 958/958 places, 899/899 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 958 transition count 896
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 955 transition count 896
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 6 place count 955 transition count 895
Deduced a syphon composed of 1 places in 13 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 954 transition count 895
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 12 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 12 place count 952 transition count 893
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 13 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 14 place count 951 transition count 893
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 17 place count 951 transition count 890
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 20 place count 948 transition count 890
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 21 place count 948 transition count 890
Applied a total of 21 rules in 156 ms. Remains 948 /958 variables (removed 10) and now considering 890/899 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 157 ms. Remains : 948/958 places, 890/899 transitions.
Interrupted random walk after 312802 steps, including 40011 resets, run timeout after 30001 ms. (steps per millisecond=10 ) properties seen 0
Incomplete Best-First random walk after 1000 steps, including 82 resets, run finished after 73 ms. (steps per millisecond=13 ) properties (out of 850) seen :0
Incomplete Best-First random walk after 1000 steps, including 77 resets, run finished after 71 ms. (steps per millisecond=14 ) properties (out of 850) seen :0
Incomplete Best-First random walk after 1001 steps, including 87 resets, run finished after 75 ms. (steps per millisecond=13 ) properties (out of 850) seen :0
Incomplete Best-First random walk after 1000 steps, including 76 resets, run finished after 64 ms. (steps per millisecond=15 ) properties (out of 850) seen :0
Incomplete Best-First random walk after 1000 steps, including 86 resets, run finished after 74 ms. (steps per millisecond=13 ) properties (out of 850) seen :0
Incomplete Best-First random walk after 1001 steps, including 79 resets, run finished after 68 ms. (steps per millisecond=14 ) properties (out of 850) seen :0
Incomplete Best-First random walk after 1000 steps, including 85 resets, run finished after 82 ms. (steps per millisecond=12 ) properties (out of 850) seen :0
Incomplete Best-First random walk after 1000 steps, including 77 resets, run finished after 83 ms. (steps per millisecond=12 ) properties (out of 850) seen :0
Incomplete Best-First random walk after 1000 steps, including 87 resets, run finished after 66 ms. (steps per millisecond=15 ) properties (out of 850) seen :0
Incomplete Best-First random walk after 1000 steps, including 83 resets, run finished after 67 ms. (steps per millisecond=14 ) properties (out of 850) seen :0
Incomplete Best-First random walk after 1000 steps, including 81 resets, run finished after 67 ms. (steps per millisecond=14 ) properties (out of 850) seen :0
Incomplete Best-First random walk after 1000 steps, including 84 resets, run finished after 65 ms. (steps per millisecond=15 ) properties (out of 850) seen :0
Incomplete Best-First random walk after 1000 steps, including 75 resets, run finished after 64 ms. (steps per millisecond=15 ) properties (out of 850) seen :0
Incomplete Best-First random walk after 1000 steps, including 76 resets, run finished after 61 ms. (steps per millisecond=16 ) properties (out of 850) seen :0
Incomplete Best-First random walk after 1000 steps, including 80 resets, run finished after 85 ms. (steps per millisecond=11 ) properties (out of 850) seen :0
Incomplete Best-First random walk after 1000 steps, including 82 resets, run finished after 62 ms. (steps per millisecond=16 ) properties (out of 850) seen :0
Incomplete Best-First random walk after 1000 steps, including 87 resets, run finished after 77 ms. (steps per millisecond=12 ) properties (out of 850) seen :0
Incomplete Best-First random walk after 1000 steps, including 87 resets, run finished after 62 ms. (steps per millisecond=16 ) properties (out of 850) seen :0
Incomplete Best-First random walk after 1001 steps, including 91 resets, run finished after 63 ms. (steps per millisecond=15 ) properties (out of 850) seen :0
Incomplete Best-First random walk after 1000 steps, including 73 resets, run finished after 86 ms. (steps per millisecond=11 ) properties (out of 850) seen :0
Incomplete Best-First random walk after 1001 steps, including 87 resets, run finished after 62 ms. (steps per millisecond=16 ) properties (out of 850) seen :0
Incomplete Best-First random walk after 1000 steps, including 88 resets, run finished after 89 ms. (steps per millisecond=11 ) properties (out of 850) seen :0
Incomplete Best-First random walk after 1001 steps, including 75 resets, run finished after 61 ms. (steps per millisecond=16 ) properties (out of 850) seen :0
Incomplete Best-First random walk after 1001 steps, including 86 resets, run finished after 62 ms. (steps per millisecond=16 ) properties (out of 850) seen :0
Incomplete Best-First random walk after 1001 steps, including 91 resets, run finished after 78 ms. (steps per millisecond=12 ) properties (out of 850) seen :0
Incomplete Best-First random walk after 1000 steps, including 86 resets, run finished after 89 ms. (steps per millisecond=11 ) properties (out of 850) seen :0
Incomplete Best-First random walk after 1001 steps, including 81 resets, run finished after 64 ms. (steps per millisecond=15 ) properties (out of 850) seen :0
Incomplete Best-First random walk after 1000 steps, including 81 resets, run finished after 66 ms. (steps per millisecond=15 ) properties (out of 850) seen :0
Incomplete Best-First random walk after 1000 steps, including 75 resets, run finished after 66 ms. (steps per millisecond=15 ) properties (out of 850) seen :0
Incomplete Best-First random walk after 1000 steps, including 87 resets, run finished after 67 ms. (steps per millisecond=14 ) properties (out of 850) seen :0
Incomplete Best-First random walk after 1000 steps, including 83 resets, run finished after 67 ms. (steps per millisecond=14 ) properties (out of 850) seen :0
Incomplete Best-First random walk after 1000 steps, including 77 resets, run finished after 67 ms. (steps per millisecond=14 ) properties (out of 850) seen :0
Incomplete Best-First random walk after 1000 steps, including 74 resets, run finished after 66 ms. (steps per millisecond=15 ) properties (out of 850) seen :0
Incomplete Best-First random walk after 1000 steps, including 85 resets, run finished after 67 ms. (steps per millisecond=14 ) properties (out of 850) seen :0
Incomplete Best-First random walk after 1000 steps, including 79 resets, run finished after 66 ms. (steps per millisecond=15 ) properties (out of 850) seen :0
Incomplete Best-First random walk after 1000 steps, including 85 resets, run finished after 66 ms. (steps per millisecond=15 ) properties (out of 850) seen :0
Incomplete Best-First random walk after 1001 steps, including 81 resets, run finished after 67 ms. (steps per millisecond=14 ) properties (out of 850) seen :0
Incomplete Best-First random walk after 1001 steps, including 91 resets, run finished after 67 ms. (steps per millisecond=14 ) properties (out of 850) seen :0
Incomplete Best-First random walk after 1000 steps, including 83 resets, run finished after 67 ms. (steps per millisecond=14 ) properties (out of 850) seen :0
Incomplete Best-First random walk after 1001 steps, including 85 resets, run finished after 64 ms. (steps per millisecond=15 ) properties (out of 850) seen :0
Incomplete Best-First random walk after 1001 steps, including 84 resets, run finished after 66 ms. (steps per millisecond=15 ) properties (out of 850) seen :0
Incomplete Best-First random walk after 1000 steps, including 82 resets, run finished after 64 ms. (steps per millisecond=15 ) properties (out of 850) seen :0
Incomplete Best-First random walk after 1000 steps, including 86 resets, run finished after 65 ms. (steps per millisecond=15 ) properties (out of 850) seen :0
Incomplete Best-First random walk after 1000 steps, including 90 resets, run finished after 63 ms. (steps per millisecond=15 ) properties (out of 850) seen :0
Incomplete Best-First random walk after 1001 steps, including 92 resets, run finished after 66 ms. (steps per millisecond=15 ) properties (out of 850) seen :0
Incomplete Best-First random walk after 1000 steps, including 84 resets, run finished after 65 ms. (steps per millisecond=15 ) properties (out of 850) seen :0
Incomplete Best-First random walk after 1000 steps, including 90 resets, run finished after 67 ms. (steps per millisecond=14 ) properties (out of 850) seen :0
Incomplete Best-First random walk after 1001 steps, including 83 resets, run finished after 63 ms. (steps per millisecond=15 ) properties (out of 850) seen :0
Incomplete Best-First random walk after 1000 steps, including 81 resets, run finished after 65 ms. (steps per millisecond=15 ) properties (out of 850) seen :0
Incomplete Best-First random walk after 1001 steps, including 87 resets, run finished after 68 ms. (steps per millisecond=14 ) properties (out of 850) seen :0
Probabilistic random walk after 1000001 steps, saw 500315 distinct states, run finished after 53712 ms. (steps per millisecond=18 ) properties seen :0
Running SMT prover for 850 properties.
// Phase 1: matrix 890 rows 948 cols
[2024-05-22 20:13:39] [INFO ] Invariants computation overflowed in 91 ms
[2024-05-22 20:13:59] [INFO ] After 19648ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:850
[2024-05-22 20:15:12] [INFO ] After 50397ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :850
[2024-05-22 20:15:12] [INFO ] State equation strengthened by 14 read => feed constraints.
Detected timeout of ITS tools.
[2024-05-22 20:15:23] [INFO ] Flatten gal took : 60 ms
[2024-05-22 20:15:23] [INFO ] Applying decomposition
[2024-05-22 20:15:24] [INFO ] Flatten gal took : 78 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph9959779026753461465.txt' '-o' '/tmp/graph9959779026753461465.bin' '-w' '/tmp/graph9959779026753461465.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph9959779026753461465.bin' '-l' '-1' '-v' '-w' '/tmp/graph9959779026753461465.weights' '-q' '0' '-e' '0.001'
[2024-05-22 20:15:24] [INFO ] Decomposing Gal with order
[2024-05-22 20:15:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 20:15:24] [INFO ] Removed a total of 277 redundant transitions.
[2024-05-22 20:15:25] [INFO ] Flatten gal took : 302 ms
[2024-05-22 20:15:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 54 ms.
[2024-05-22 20:15:25] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7251249713684261537.gal : 23 ms
[2024-05-22 20:15:25] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2942702055496272073.prop : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality7251249713684261537.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2942702055496272073.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality2942702055496272073.prop.
SDD proceeding with computation,850 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,850 properties remain. new max is 8
SDD size :1 after 21
SDD proceeding with computation,850 properties remain. new max is 16
SDD size :21 after 81
SDD proceeding with computation,850 properties remain. new max is 32
SDD size :81 after 310
SDD proceeding with computation,850 properties remain. new max is 64
SDD size :310 after 518
[2024-05-22 20:16:08] [INFO ] After 56184ms SMT Verify possible using 14 Read/Feed constraints in natural domain returned unsat :0 sat :850
[2024-05-22 20:16:10] [INFO ] Deduced a trap composed of 344 places in 268 ms of which 1 ms to minimize.
[2024-05-22 20:16:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 409 ms
[2024-05-22 20:16:10] [INFO ] Deduced a trap composed of 316 places in 267 ms of which 1 ms to minimize.
[2024-05-22 20:16:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 396 ms
[2024-05-22 20:16:11] [INFO ] Deduced a trap composed of 206 places in 117 ms of which 0 ms to minimize.
[2024-05-22 20:16:11] [INFO ] Deduced a trap composed of 203 places in 112 ms of which 0 ms to minimize.
[2024-05-22 20:16:11] [INFO ] Deduced a trap composed of 192 places in 110 ms of which 0 ms to minimize.
[2024-05-22 20:16:11] [INFO ] Deduced a trap composed of 194 places in 117 ms of which 1 ms to minimize.
[2024-05-22 20:16:12] [INFO ] Deduced a trap composed of 182 places in 130 ms of which 0 ms to minimize.
[2024-05-22 20:16:12] [INFO ] Deduced a trap composed of 180 places in 123 ms of which 1 ms to minimize.
[2024-05-22 20:16:12] [INFO ] Deduced a trap composed of 170 places in 135 ms of which 1 ms to minimize.
[2024-05-22 20:16:12] [INFO ] Deduced a trap composed of 186 places in 117 ms of which 1 ms to minimize.
[2024-05-22 20:16:12] [INFO ] Deduced a trap composed of 156 places in 119 ms of which 0 ms to minimize.
[2024-05-22 20:16:12] [INFO ] Deduced a trap composed of 158 places in 127 ms of which 0 ms to minimize.
[2024-05-22 20:16:13] [INFO ] Deduced a trap composed of 191 places in 130 ms of which 0 ms to minimize.
[2024-05-22 20:16:13] [INFO ] Deduced a trap composed of 146 places in 132 ms of which 1 ms to minimize.
[2024-05-22 20:16:13] [INFO ] Deduced a trap composed of 134 places in 138 ms of which 1 ms to minimize.
[2024-05-22 20:16:13] [INFO ] Deduced a trap composed of 132 places in 143 ms of which 1 ms to minimize.
[2024-05-22 20:16:13] [INFO ] Deduced a trap composed of 120 places in 153 ms of which 0 ms to minimize.
[2024-05-22 20:16:14] [INFO ] Deduced a trap composed of 155 places in 145 ms of which 0 ms to minimize.
[2024-05-22 20:16:14] [INFO ] Deduced a trap composed of 96 places in 154 ms of which 0 ms to minimize.
[2024-05-22 20:16:14] [INFO ] Deduced a trap composed of 110 places in 151 ms of which 0 ms to minimize.
[2024-05-22 20:16:14] [INFO ] Deduced a trap composed of 108 places in 146 ms of which 0 ms to minimize.
[2024-05-22 20:16:15] [INFO ] Deduced a trap composed of 84 places in 173 ms of which 1 ms to minimize.
[2024-05-22 20:16:15] [INFO ] Deduced a trap composed of 86 places in 176 ms of which 1 ms to minimize.
[2024-05-22 20:16:15] [INFO ] Deduced a trap composed of 72 places in 168 ms of which 1 ms to minimize.
[2024-05-22 20:16:15] [INFO ] Deduced a trap composed of 60 places in 185 ms of which 0 ms to minimize.
[2024-05-22 20:16:15] [INFO ] Deduced a trap composed of 74 places in 181 ms of which 0 ms to minimize.
[2024-05-22 20:16:16] [INFO ] Deduced a trap composed of 98 places in 168 ms of which 1 ms to minimize.
[2024-05-22 20:16:17] [INFO ] Deduced a trap composed of 48 places in 195 ms of which 1 ms to minimize.
[2024-05-22 20:16:17] [INFO ] Deduced a trap composed of 50 places in 198 ms of which 1 ms to minimize.
[2024-05-22 20:16:17] [INFO ] Deduced a trap composed of 62 places in 193 ms of which 1 ms to minimize.
[2024-05-22 20:16:19] [INFO ] Deduced a trap composed of 36 places in 187 ms of which 0 ms to minimize.
[2024-05-22 20:16:19] [INFO ] Deduced a trap composed of 38 places in 195 ms of which 0 ms to minimize.
[2024-05-22 20:16:19] [INFO ] Deduced a trap composed of 27 places in 195 ms of which 1 ms to minimize.
[2024-05-22 20:16:20] [INFO ] Deduced a trap composed of 28 places in 195 ms of which 1 ms to minimize.
SDD proceeding with computation,850 properties remain. new max is 128
SDD size :518 after 143990
[2024-05-22 20:16:29] [INFO ] Trap strengthening (SAT) tested/added 32/32 trap constraints in 18403 ms
[2024-05-22 20:16:31] [INFO ] Deduced a trap composed of 4 places in 225 ms of which 0 ms to minimize.
[2024-05-22 20:16:32] [INFO ] Deduced a trap composed of 10 places in 219 ms of which 1 ms to minimize.
[2024-05-22 20:16:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 606 ms
[2024-05-22 20:16:32] [INFO ] Deduced a trap composed of 200 places in 104 ms of which 0 ms to minimize.
[2024-05-22 20:16:35] [INFO ] Deduced a trap composed of 35 places in 193 ms of which 1 ms to minimize.
[2024-05-22 20:16:43] [INFO ] Deduced a trap composed of 183 places in 152 ms of which 0 ms to minimize.
SDD proceeding with computation,850 properties remain. new max is 256
SDD size :143990 after 1.28212e+06
[2024-05-22 20:16:52] [INFO ] Trap strengthening (SAT) tested/added 3/3 trap constraints in 20441 ms
[2024-05-22 20:16:53] [INFO ] Deduced a trap composed of 316 places in 264 ms of which 1 ms to minimize.
[2024-05-22 20:16:54] [INFO ] Deduced a trap composed of 103 places in 254 ms of which 0 ms to minimize.
[2024-05-22 20:16:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 812 ms
[2024-05-22 20:17:03] [INFO ] Deduced a trap composed of 122 places in 165 ms of which 1 ms to minimize.
[2024-05-22 20:17:04] [INFO ] Deduced a trap composed of 127 places in 155 ms of which 1 ms to minimize.
[2024-05-22 20:17:04] [INFO ] Deduced a trap composed of 139 places in 150 ms of which 2 ms to minimize.
[2024-05-22 20:17:05] [INFO ] Deduced a trap composed of 151 places in 146 ms of which 0 ms to minimize.
[2024-05-22 20:17:05] [INFO ] Deduced a trap composed of 174 places in 135 ms of which 1 ms to minimize.
[2024-05-22 20:17:05] [INFO ] Deduced a trap composed of 163 places in 147 ms of which 0 ms to minimize.
[2024-05-22 20:17:14] [INFO ] Trap strengthening (SAT) tested/added 6/6 trap constraints in 11500 ms
[2024-05-22 20:17:18] [INFO ] Deduced a trap composed of 223 places in 162 ms of which 0 ms to minimize.
[2024-05-22 20:17:18] [INFO ] Deduced a trap composed of 225 places in 152 ms of which 0 ms to minimize.
[2024-05-22 20:17:18] [INFO ] Deduced a trap composed of 194 places in 145 ms of which 0 ms to minimize.
[2024-05-22 20:17:18] [INFO ] Deduced a trap composed of 115 places in 140 ms of which 1 ms to minimize.
[2024-05-22 20:17:18] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 834 ms
[2024-05-22 20:17:21] [INFO ] Deduced a trap composed of 187 places in 132 ms of which 1 ms to minimize.
[2024-05-22 20:17:24] [INFO ] Deduced a trap composed of 168 places in 137 ms of which 0 ms to minimize.
SDD proceeding with computation,850 properties remain. new max is 512
SDD size :1.28212e+06 after 4.76112e+06
[2024-05-22 20:17:33] [INFO ] Trap strengthening (SAT) tested/added 2/2 trap constraints in 11739 ms
[2024-05-22 20:17:37] [INFO ] Deduced a trap composed of 43 places in 209 ms of which 0 ms to minimize.
[2024-05-22 20:17:42] [INFO ] Deduced a trap composed of 55 places in 202 ms of which 0 ms to minimize.
[2024-05-22 20:17:42] [INFO ] Deduced a trap composed of 66 places in 204 ms of which 1 ms to minimize.
[2024-05-22 20:17:44] [INFO ] Deduced a trap composed of 78 places in 193 ms of which 1 ms to minimize.
[2024-05-22 20:17:44] [INFO ] Trap strengthening (SAT) tested/added 4/4 trap constraints in 7500 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.refineResultsWithTraps(DeadlockTester.java:772)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.applyReachabilitySolver(GlobalPropertySolver.java:724)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:558)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preSolveLiveness(GlobalPropertySolver.java:412)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preStableMarking(GlobalPropertySolver.java:321)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:294)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:426)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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)
[2024-05-22 20:17:44] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-22 20:17:44] [INFO ] After 225027ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:850
Fused 850 Parikh solutions to 806 different solutions.
Parikh walk visited 0 properties in 30005 ms.
Support contains 850 out of 948 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 948/948 places, 890/890 transitions.
Applied a total of 0 rules in 40 ms. Remains 948 /948 variables (removed 0) and now considering 890/890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 948/948 places, 890/890 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 948/948 places, 890/890 transitions.
Applied a total of 0 rules in 25 ms. Remains 948 /948 variables (removed 0) and now considering 890/890 (removed 0) transitions.
// Phase 1: matrix 890 rows 948 cols
[2024-05-22 20:18:14] [INFO ] Invariants computation overflowed in 56 ms
[2024-05-22 20:18:14] [INFO ] Implicit Places using invariants in 211 ms returned []
// Phase 1: matrix 890 rows 948 cols
[2024-05-22 20:18:14] [INFO ] Invariants computation overflowed in 60 ms
[2024-05-22 20:18:15] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-22 20:18:16] [INFO ] Implicit Places using invariants and state equation in 1471 ms returned []
Implicit Place search using SMT with State Equation took 1684 ms to find 0 implicit places.
[2024-05-22 20:18:16] [INFO ] Redundant transitions in 56 ms returned []
// Phase 1: matrix 890 rows 948 cols
[2024-05-22 20:18:16] [INFO ] Invariants computation overflowed in 60 ms
[2024-05-22 20:18:16] [INFO ] Dead Transitions using invariants and state equation in 403 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2179 ms. Remains : 948/948 places, 890/890 transitions.
Incomplete random walk after 100000 steps, including 12871 resets, run finished after 9633 ms. (steps per millisecond=10 ) properties (out of 850) seen :0
Running SMT prover for 850 properties.
// Phase 1: matrix 890 rows 948 cols
[2024-05-22 20:18:26] [INFO ] Invariants computation overflowed in 62 ms
[2024-05-22 20:18:40] [INFO ] After 13787ms SMT Verify possible using state equation in real domain returned unsat :0 sat :850
[2024-05-22 20:18:40] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-22 20:18:55] [INFO ] After 14392ms SMT Verify possible using 14 Read/Feed constraints in real domain returned unsat :0 sat :850
[2024-05-22 20:18:55] [INFO ] Deduced a trap composed of 14 places in 189 ms of which 1 ms to minimize.
[2024-05-22 20:18:55] [INFO ] Deduced a trap composed of 233 places in 199 ms of which 0 ms to minimize.
[2024-05-22 20:18:55] [INFO ] Deduced a trap composed of 182 places in 142 ms of which 0 ms to minimize.
[2024-05-22 20:18:55] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 716 ms
[2024-05-22 20:18:57] [INFO ] Deduced a trap composed of 394 places in 300 ms of which 0 ms to minimize.
[2024-05-22 20:18:57] [INFO ] Deduced a trap composed of 230 places in 255 ms of which 1 ms to minimize.
[2024-05-22 20:18:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 733 ms
[2024-05-22 20:18:58] [INFO ] Deduced a trap composed of 383 places in 262 ms of which 0 ms to minimize.
[2024-05-22 20:18:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 396 ms
[2024-05-22 20:18:58] [INFO ] Deduced a trap composed of 200 places in 131 ms of which 0 ms to minimize.
[2024-05-22 20:18:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 251 ms
[2024-05-22 20:18:59] [INFO ] Deduced a trap composed of 206 places in 118 ms of which 0 ms to minimize.
[2024-05-22 20:18:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 234 ms
[2024-05-22 20:19:02] [INFO ] Deduced a trap composed of 205 places in 119 ms of which 0 ms to minimize.
[2024-05-22 20:19:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 244 ms
[2024-05-22 20:19:03] [INFO ] Deduced a trap composed of 194 places in 119 ms of which 0 ms to minimize.
[2024-05-22 20:19:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 240 ms
[2024-05-22 20:19:03] [INFO ] Deduced a trap composed of 201 places in 102 ms of which 0 ms to minimize.
[2024-05-22 20:19:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 219 ms
[2024-05-22 20:19:05] [INFO ] Deduced a trap composed of 408 places in 260 ms of which 1 ms to minimize.
[2024-05-22 20:19:05] [INFO ] Deduced a trap composed of 339 places in 255 ms of which 1 ms to minimize.
[2024-05-22 20:19:05] [INFO ] Deduced a trap composed of 398 places in 263 ms of which 1 ms to minimize.
[2024-05-22 20:19:05] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 936 ms
[2024-05-22 20:19:07] [INFO ] Deduced a trap composed of 359 places in 271 ms of which 1 ms to minimize.
[2024-05-22 20:19:07] [INFO ] Deduced a trap composed of 334 places in 345 ms of which 1 ms to minimize.
[2024-05-22 20:19:07] [INFO ] Deduced a trap composed of 52 places in 281 ms of which 1 ms to minimize.
[2024-05-22 20:19:08] [INFO ] Deduced a trap composed of 36 places in 294 ms of which 1 ms to minimize.
[2024-05-22 20:19:08] [INFO ] Deduced a trap composed of 361 places in 266 ms of which 1 ms to minimize.
[2024-05-22 20:19:08] [INFO ] Deduced a trap composed of 356 places in 300 ms of which 1 ms to minimize.
[2024-05-22 20:19:09] [INFO ] Deduced a trap composed of 368 places in 284 ms of which 1 ms to minimize.
[2024-05-22 20:19:09] [INFO ] Deduced a trap composed of 371 places in 289 ms of which 0 ms to minimize.
[2024-05-22 20:19:09] [INFO ] Deduced a trap composed of 359 places in 286 ms of which 1 ms to minimize.
[2024-05-22 20:19:10] [INFO ] Deduced a trap composed of 360 places in 287 ms of which 1 ms to minimize.
[2024-05-22 20:19:10] [INFO ] Deduced a trap composed of 361 places in 281 ms of which 1 ms to minimize.
[2024-05-22 20:19:10] [INFO ] Deduced a trap composed of 353 places in 281 ms of which 2 ms to minimize.
[2024-05-22 20:19:11] [INFO ] Deduced a trap composed of 333 places in 260 ms of which 1 ms to minimize.
[2024-05-22 20:19:11] [INFO ] Deduced a trap composed of 381 places in 283 ms of which 1 ms to minimize.
[2024-05-22 20:19:11] [INFO ] Deduced a trap composed of 395 places in 283 ms of which 1 ms to minimize.
[2024-05-22 20:19:12] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 5158 ms
[2024-05-22 20:19:12] [INFO ] Deduced a trap composed of 8 places in 270 ms of which 0 ms to minimize.
[2024-05-22 20:19:12] [INFO ] Deduced a trap composed of 21 places in 235 ms of which 1 ms to minimize.
[2024-05-22 20:19:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 628 ms
[2024-05-22 20:19:14] [INFO ] Deduced a trap composed of 38 places in 252 ms of which 0 ms to minimize.
[2024-05-22 20:19:14] [INFO ] Deduced a trap composed of 350 places in 279 ms of which 1 ms to minimize.
[2024-05-22 20:19:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 666 ms
[2024-05-22 20:19:15] [INFO ] Deduced a trap composed of 318 places in 252 ms of which 1 ms to minimize.
[2024-05-22 20:19:16] [INFO ] Deduced a trap composed of 361 places in 248 ms of which 0 ms to minimize.
[2024-05-22 20:19:16] [INFO ] Deduced a trap composed of 304 places in 247 ms of which 1 ms to minimize.
[2024-05-22 20:19:16] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 937 ms
[2024-05-22 20:19:17] [INFO ] Deduced a trap composed of 301 places in 244 ms of which 1 ms to minimize.
[2024-05-22 20:19:17] [INFO ] Deduced a trap composed of 324 places in 241 ms of which 1 ms to minimize.
[2024-05-22 20:19:17] [INFO ] Deduced a trap composed of 349 places in 223 ms of which 1 ms to minimize.
[2024-05-22 20:19:17] [INFO ] Deduced a trap composed of 325 places in 246 ms of which 0 ms to minimize.
[2024-05-22 20:19:18] [INFO ] Deduced a trap composed of 344 places in 244 ms of which 1 ms to minimize.
[2024-05-22 20:19:18] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1557 ms
[2024-05-22 20:19:19] [INFO ] Deduced a trap composed of 28 places in 259 ms of which 1 ms to minimize.
[2024-05-22 20:19:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 351 ms
[2024-05-22 20:19:21] [INFO ] Deduced a trap composed of 50 places in 220 ms of which 1 ms to minimize.
[2024-05-22 20:19:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 310 ms
[2024-05-22 20:19:21] [INFO ] Deduced a trap composed of 301 places in 275 ms of which 1 ms to minimize.
[2024-05-22 20:19:21] [INFO ] Deduced a trap composed of 338 places in 271 ms of which 0 ms to minimize.
[2024-05-22 20:19:22] [INFO ] Deduced a trap composed of 342 places in 265 ms of which 1 ms to minimize.
[2024-05-22 20:19:22] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1005 ms
[2024-05-22 20:19:22] [INFO ] Deduced a trap composed of 324 places in 279 ms of which 1 ms to minimize.
[2024-05-22 20:19:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 374 ms
[2024-05-22 20:19:25] [INFO ] Deduced a trap composed of 56 places in 236 ms of which 0 ms to minimize.
[2024-05-22 20:19:25] [INFO ] Deduced a trap composed of 67 places in 234 ms of which 1 ms to minimize.
[2024-05-22 20:19:25] [INFO ] Deduced a trap composed of 60 places in 232 ms of which 1 ms to minimize.
[2024-05-22 20:19:25] [INFO ] Deduced a trap composed of 62 places in 235 ms of which 0 ms to minimize.
[2024-05-22 20:19:26] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1148 ms
[2024-05-22 20:19:28] [INFO ] Deduced a trap composed of 336 places in 242 ms of which 0 ms to minimize.
[2024-05-22 20:19:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 356 ms
[2024-05-22 20:19:39] [INFO ] Deduced a trap composed of 68 places in 282 ms of which 1 ms to minimize.
[2024-05-22 20:19:39] [INFO ] Deduced a trap composed of 367 places in 284 ms of which 1 ms to minimize.
[2024-05-22 20:19:39] [INFO ] Deduced a trap composed of 74 places in 277 ms of which 1 ms to minimize.
[2024-05-22 20:19:39] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1054 ms
[2024-05-22 20:19:40] [INFO ] Deduced a trap composed of 322 places in 281 ms of which 0 ms to minimize.
[2024-05-22 20:19:40] [INFO ] Deduced a trap composed of 365 places in 277 ms of which 1 ms to minimize.
[2024-05-22 20:19:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 682 ms
[2024-05-22 20:19:43] [INFO ] Deduced a trap composed of 307 places in 222 ms of which 0 ms to minimize.
[2024-05-22 20:19:43] [INFO ] Deduced a trap composed of 310 places in 216 ms of which 1 ms to minimize.
[2024-05-22 20:19:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 609 ms
[2024-05-22 20:19:46] [INFO ] Deduced a trap composed of 326 places in 286 ms of which 0 ms to minimize.
[2024-05-22 20:19:46] [INFO ] Deduced a trap composed of 329 places in 280 ms of which 1 ms to minimize.
[2024-05-22 20:19:46] [INFO ] Deduced a trap composed of 303 places in 284 ms of which 1 ms to minimize.
[2024-05-22 20:19:47] [INFO ] Deduced a trap composed of 55 places in 231 ms of which 1 ms to minimize.
[2024-05-22 20:19:47] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1342 ms
[2024-05-22 20:19:47] [INFO ] Deduced a trap composed of 72 places in 281 ms of which 1 ms to minimize.
[2024-05-22 20:19:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 388 ms
[2024-05-22 20:19:50] [INFO ] Deduced a trap composed of 364 places in 275 ms of which 1 ms to minimize.
[2024-05-22 20:19:50] [INFO ] Deduced a trap composed of 369 places in 275 ms of which 1 ms to minimize.
[2024-05-22 20:19:50] [INFO ] Deduced a trap composed of 384 places in 269 ms of which 1 ms to minimize.
[2024-05-22 20:19:51] [INFO ] Deduced a trap composed of 78 places in 272 ms of which 0 ms to minimize.
[2024-05-22 20:19:51] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1380 ms
[2024-05-22 20:19:52] [INFO ] Deduced a trap composed of 309 places in 210 ms of which 1 ms to minimize.
[2024-05-22 20:19:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 403 ms
[2024-05-22 20:19:56] [INFO ] Deduced a trap composed of 104 places in 201 ms of which 1 ms to minimize.
[2024-05-22 20:19:56] [INFO ] Deduced a trap composed of 110 places in 192 ms of which 1 ms to minimize.
[2024-05-22 20:19:56] [INFO ] Deduced a trap composed of 122 places in 196 ms of which 0 ms to minimize.
[2024-05-22 20:19:56] [INFO ] Deduced a trap composed of 108 places in 196 ms of which 1 ms to minimize.
[2024-05-22 20:19:57] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1032 ms
[2024-05-22 20:19:58] [INFO ] Deduced a trap composed of 86 places in 202 ms of which 1 ms to minimize.
[2024-05-22 20:19:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 314 ms
[2024-05-22 20:20:02] [INFO ] Deduced a trap composed of 269 places in 207 ms of which 1 ms to minimize.
[2024-05-22 20:20:02] [INFO ] Deduced a trap composed of 299 places in 205 ms of which 1 ms to minimize.
[2024-05-22 20:20:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 622 ms
[2024-05-22 20:20:04] [INFO ] Deduced a trap composed of 319 places in 284 ms of which 1 ms to minimize.
[2024-05-22 20:20:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 407 ms
[2024-05-22 20:20:04] [INFO ] Deduced a trap composed of 367 places in 276 ms of which 1 ms to minimize.
[2024-05-22 20:20:05] [INFO ] Deduced a trap composed of 378 places in 275 ms of which 1 ms to minimize.
[2024-05-22 20:20:05] [INFO ] Deduced a trap composed of 306 places in 270 ms of which 1 ms to minimize.
[2024-05-22 20:20:05] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1093 ms
[2024-05-22 20:20:05] [INFO ] Deduced a trap composed of 345 places in 275 ms of which 1 ms to minimize.
[2024-05-22 20:20:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 356 ms
[2024-05-22 20:20:06] [INFO ] Deduced a trap composed of 116 places in 179 ms of which 1 ms to minimize.
[2024-05-22 20:20:06] [INFO ] Deduced a trap composed of 122 places in 170 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:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:342)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:218)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositions(AtomicReducerSR.java:267)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:46)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:228)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.applyReachabilitySolver(GlobalPropertySolver.java:724)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:558)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preSolveLiveness(GlobalPropertySolver.java:412)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preStableMarking(GlobalPropertySolver.java:321)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:294)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:426)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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)
[2024-05-22 20:20:06] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-22 20:20:06] [INFO ] After 100195ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Interrupted random walk after 318368 steps, including 40809 resets, run timeout after 30001 ms. (steps per millisecond=10 ) properties seen 0
Incomplete Best-First random walk after 1001 steps, including 78 resets, run finished after 71 ms. (steps per millisecond=14 ) properties (out of 850) seen :0
Incomplete Best-First random walk after 1000 steps, including 92 resets, run finished after 67 ms. (steps per millisecond=14 ) properties (out of 850) seen :0
Incomplete Best-First random walk after 1000 steps, including 81 resets, run finished after 65 ms. (steps per millisecond=15 ) properties (out of 850) seen :0
Incomplete Best-First random walk after 1000 steps, including 83 resets, run finished after 67 ms. (steps per millisecond=14 ) properties (out of 850) seen :0
Incomplete Best-First random walk after 1000 steps, including 92 resets, run finished after 67 ms. (steps per millisecond=14 ) properties (out of 850) seen :0
Incomplete Best-First random walk after 1000 steps, including 82 resets, run finished after 66 ms. (steps per millisecond=15 ) properties (out of 850) seen :0
Incomplete Best-First random walk after 1000 steps, including 80 resets, run finished after 65 ms. (steps per millisecond=15 ) properties (out of 850) seen :0
Incomplete Best-First random walk after 1000 steps, including 89 resets, run finished after 67 ms. (steps per millisecond=14 ) properties (out of 850) seen :0
Incomplete Best-First random walk after 1000 steps, including 87 resets, run finished after 65 ms. (steps per millisecond=15 ) properties (out of 850) seen :0
Incomplete Best-First random walk after 1001 steps, including 91 resets, run finished after 63 ms. (steps per millisecond=15 ) properties (out of 850) seen :0
Incomplete Best-First random walk after 1000 steps, including 78 resets, run finished after 62 ms. (steps per millisecond=16 ) properties (out of 850) seen :0
Incomplete Best-First random walk after 1000 steps, including 85 resets, run finished after 78 ms. (steps per millisecond=12 ) properties (out of 850) seen :0
Incomplete Best-First random walk after 1000 steps, including 88 resets, run finished after 84 ms. (steps per millisecond=11 ) properties (out of 850) seen :0
Incomplete Best-First random walk after 1000 steps, including 79 resets, run finished after 75 ms. (steps per millisecond=13 ) properties (out of 850) seen :0
Incomplete Best-First random walk after 1000 steps, including 84 resets, run finished after 67 ms. (steps per millisecond=14 ) properties (out of 850) seen :0
Incomplete Best-First random walk after 1000 steps, including 86 resets, run finished after 67 ms. (steps per millisecond=14 ) properties (out of 850) seen :0
Incomplete Best-First random walk after 1000 steps, including 86 resets, run finished after 66 ms. (steps per millisecond=15 ) properties (out of 850) seen :0
Incomplete Best-First random walk after 1000 steps, including 88 resets, run finished after 67 ms. (steps per millisecond=14 ) properties (out of 850) seen :0
Incomplete Best-First random walk after 1001 steps, including 90 resets, run finished after 66 ms. (steps per millisecond=15 ) properties (out of 850) seen :0
Incomplete Best-First random walk after 1001 steps, including 84 resets, run finished after 67 ms. (steps per millisecond=14 ) properties (out of 850) seen :0
Incomplete Best-First random walk after 1000 steps, including 81 resets, run finished after 66 ms. (steps per millisecond=15 ) properties (out of 850) seen :0
Incomplete Best-First random walk after 1000 steps, including 70 resets, run finished after 65 ms. (steps per millisecond=15 ) properties (out of 850) seen :0
Incomplete Best-First random walk after 1001 steps, including 82 resets, run finished after 66 ms. (steps per millisecond=15 ) properties (out of 850) seen :0
Incomplete Best-First random walk after 1000 steps, including 85 resets, run finished after 79 ms. (steps per millisecond=12 ) properties (out of 850) seen :0
Incomplete Best-First random walk after 1000 steps, including 88 resets, run finished after 91 ms. (steps per millisecond=10 ) properties (out of 850) seen :0
Incomplete Best-First random walk after 1001 steps, including 87 resets, run finished after 67 ms. (steps per millisecond=14 ) properties (out of 850) seen :0
Incomplete Best-First random walk after 1000 steps, including 81 resets, run finished after 66 ms. (steps per millisecond=15 ) properties (out of 850) seen :0
Incomplete Best-First random walk after 1001 steps, including 85 resets, run finished after 65 ms. (steps per millisecond=15 ) properties (out of 850) seen :0
Incomplete Best-First random walk after 1001 steps, including 84 resets, run finished after 66 ms. (steps per millisecond=15 ) properties (out of 850) seen :0
Incomplete Best-First random walk after 1001 steps, including 86 resets, run finished after 67 ms. (steps per millisecond=14 ) properties (out of 850) seen :0
Incomplete Best-First random walk after 1001 steps, including 84 resets, run finished after 67 ms. (steps per millisecond=14 ) properties (out of 850) seen :0
Incomplete Best-First random walk after 1001 steps, including 91 resets, run finished after 66 ms. (steps per millisecond=15 ) properties (out of 850) seen :0
Incomplete Best-First random walk after 1000 steps, including 84 resets, run finished after 67 ms. (steps per millisecond=14 ) properties (out of 850) seen :0
Incomplete Best-First random walk after 1001 steps, including 87 resets, run finished after 67 ms. (steps per millisecond=14 ) properties (out of 850) seen :0
Incomplete Best-First random walk after 1001 steps, including 82 resets, run finished after 68 ms. (steps per millisecond=14 ) properties (out of 850) seen :0
Incomplete Best-First random walk after 1000 steps, including 82 resets, run finished after 65 ms. (steps per millisecond=15 ) properties (out of 850) seen :0
Incomplete Best-First random walk after 1001 steps, including 78 resets, run finished after 66 ms. (steps per millisecond=15 ) properties (out of 850) seen :0
Incomplete Best-First random walk after 1000 steps, including 85 resets, run finished after 67 ms. (steps per millisecond=14 ) properties (out of 850) seen :0
Incomplete Best-First random walk after 1000 steps, including 90 resets, run finished after 67 ms. (steps per millisecond=14 ) properties (out of 850) seen :0
Incomplete Best-First random walk after 1001 steps, including 85 resets, run finished after 65 ms. (steps per millisecond=15 ) properties (out of 850) seen :0
Incomplete Best-First random walk after 1000 steps, including 90 resets, run finished after 72 ms. (steps per millisecond=13 ) properties (out of 850) seen :0
Incomplete Best-First random walk after 1000 steps, including 86 resets, run finished after 66 ms. (steps per millisecond=15 ) properties (out of 850) seen :0
Incomplete Best-First random walk after 1001 steps, including 80 resets, run finished after 65 ms. (steps per millisecond=15 ) properties (out of 850) seen :0
Incomplete Best-First random walk after 1000 steps, including 84 resets, run finished after 66 ms. (steps per millisecond=15 ) properties (out of 850) seen :0
Incomplete Best-First random walk after 1000 steps, including 89 resets, run finished after 66 ms. (steps per millisecond=15 ) properties (out of 850) seen :0
Incomplete Best-First random walk after 1000 steps, including 83 resets, run finished after 71 ms. (steps per millisecond=14 ) properties (out of 850) seen :0
Incomplete Best-First random walk after 1001 steps, including 81 resets, run finished after 65 ms. (steps per millisecond=15 ) properties (out of 850) seen :0
Incomplete Best-First random walk after 1001 steps, including 86 resets, run finished after 67 ms. (steps per millisecond=14 ) properties (out of 850) seen :0
Incomplete Best-First random walk after 1001 steps, including 78 resets, run finished after 66 ms. (steps per millisecond=15 ) properties (out of 850) seen :0
Incomplete Best-First random walk after 1000 steps, including 93 resets, run finished after 69 ms. (steps per millisecond=14 ) properties (out of 850) seen :0
Probabilistic random walk after 1000001 steps, saw 500315 distinct states, run finished after 47505 ms. (steps per millisecond=21 ) properties seen :0
Running SMT prover for 850 properties.
// Phase 1: matrix 890 rows 948 cols
[2024-05-22 20:21:27] [INFO ] Invariants computation overflowed in 55 ms
[2024-05-22 20:21:46] [INFO ] After 19144ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:850
[2024-05-22 20:23:00] [INFO ] After 50834ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :850
[2024-05-22 20:23:00] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-22 20:23:55] [INFO ] After 54125ms SMT Verify possible using 14 Read/Feed constraints in natural domain returned unsat :0 sat :850
[2024-05-22 20:23:56] [INFO ] Deduced a trap composed of 344 places in 244 ms of which 1 ms to minimize.
[2024-05-22 20:23:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 381 ms
[2024-05-22 20:23:56] [INFO ] Deduced a trap composed of 316 places in 242 ms of which 1 ms to minimize.
[2024-05-22 20:23:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 359 ms
[2024-05-22 20:23:57] [INFO ] Deduced a trap composed of 206 places in 105 ms of which 1 ms to minimize.
[2024-05-22 20:23:57] [INFO ] Deduced a trap composed of 203 places in 115 ms of which 0 ms to minimize.
[2024-05-22 20:23:57] [INFO ] Deduced a trap composed of 192 places in 122 ms of which 1 ms to minimize.
[2024-05-22 20:23:58] [INFO ] Deduced a trap composed of 194 places in 120 ms of which 0 ms to minimize.
[2024-05-22 20:23:58] [INFO ] Deduced a trap composed of 182 places in 118 ms of which 1 ms to minimize.
[2024-05-22 20:23:58] [INFO ] Deduced a trap composed of 180 places in 119 ms of which 0 ms to minimize.
[2024-05-22 20:23:58] [INFO ] Deduced a trap composed of 170 places in 130 ms of which 2 ms to minimize.
[2024-05-22 20:23:58] [INFO ] Deduced a trap composed of 186 places in 125 ms of which 1 ms to minimize.
[2024-05-22 20:23:58] [INFO ] Deduced a trap composed of 156 places in 130 ms of which 1 ms to minimize.
[2024-05-22 20:23:59] [INFO ] Deduced a trap composed of 158 places in 132 ms of which 1 ms to minimize.
[2024-05-22 20:23:59] [INFO ] Deduced a trap composed of 191 places in 133 ms of which 0 ms to minimize.
[2024-05-22 20:23:59] [INFO ] Deduced a trap composed of 146 places in 138 ms of which 0 ms to minimize.
[2024-05-22 20:23:59] [INFO ] Deduced a trap composed of 134 places in 140 ms of which 0 ms to minimize.
[2024-05-22 20:23:59] [INFO ] Deduced a trap composed of 132 places in 136 ms of which 0 ms to minimize.
[2024-05-22 20:24:00] [INFO ] Deduced a trap composed of 120 places in 145 ms of which 2 ms to minimize.
[2024-05-22 20:24:00] [INFO ] Deduced a trap composed of 155 places in 145 ms of which 1 ms to minimize.
[2024-05-22 20:24:00] [INFO ] Deduced a trap composed of 96 places in 153 ms of which 0 ms to minimize.
[2024-05-22 20:24:00] [INFO ] Deduced a trap composed of 110 places in 154 ms of which 0 ms to minimize.
[2024-05-22 20:24:00] [INFO ] Deduced a trap composed of 108 places in 149 ms of which 1 ms to minimize.
[2024-05-22 20:24:01] [INFO ] Deduced a trap composed of 84 places in 152 ms of which 1 ms to minimize.
[2024-05-22 20:24:01] [INFO ] Deduced a trap composed of 86 places in 165 ms of which 0 ms to minimize.
[2024-05-22 20:24:01] [INFO ] Deduced a trap composed of 72 places in 167 ms of which 0 ms to minimize.
[2024-05-22 20:24:01] [INFO ] Deduced a trap composed of 60 places in 169 ms of which 1 ms to minimize.
[2024-05-22 20:24:02] [INFO ] Deduced a trap composed of 74 places in 169 ms of which 1 ms to minimize.
[2024-05-22 20:24:02] [INFO ] Deduced a trap composed of 98 places in 158 ms of which 1 ms to minimize.
[2024-05-22 20:24:03] [INFO ] Deduced a trap composed of 48 places in 180 ms of which 1 ms to minimize.
[2024-05-22 20:24:03] [INFO ] Deduced a trap composed of 50 places in 182 ms of which 1 ms to minimize.
[2024-05-22 20:24:03] [INFO ] Deduced a trap composed of 62 places in 175 ms of which 0 ms to minimize.
[2024-05-22 20:24:05] [INFO ] Deduced a trap composed of 36 places in 186 ms of which 1 ms to minimize.
[2024-05-22 20:24:05] [INFO ] Deduced a trap composed of 38 places in 193 ms of which 1 ms to minimize.
[2024-05-22 20:24:05] [INFO ] Deduced a trap composed of 27 places in 191 ms of which 1 ms to minimize.
[2024-05-22 20:24:05] [INFO ] Deduced a trap composed of 28 places in 199 ms of which 0 ms to minimize.
[2024-05-22 20:24:15] [INFO ] Trap strengthening (SAT) tested/added 32/32 trap constraints in 17589 ms
[2024-05-22 20:24:17] [INFO ] Deduced a trap composed of 4 places in 217 ms of which 1 ms to minimize.
[2024-05-22 20:24:17] [INFO ] Deduced a trap composed of 10 places in 220 ms of which 0 ms to minimize.
[2024-05-22 20:24:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 610 ms
[2024-05-22 20:24:17] [INFO ] Deduced a trap composed of 200 places in 104 ms of which 0 ms to minimize.
[2024-05-22 20:24:20] [INFO ] Deduced a trap composed of 35 places in 191 ms of which 1 ms to minimize.
[2024-05-22 20:24:27] [INFO ] Deduced a trap composed of 183 places in 146 ms of which 1 ms to minimize.
[2024-05-22 20:24:36] [INFO ] Trap strengthening (SAT) tested/added 3/3 trap constraints in 19236 ms
[2024-05-22 20:24:37] [INFO ] Deduced a trap composed of 103 places in 154 ms of which 0 ms to minimize.
[2024-05-22 20:24:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 292 ms
[2024-05-22 20:24:42] [INFO ] Deduced a trap composed of 11 places in 206 ms of which 0 ms to minimize.
[2024-05-22 20:24:42] [INFO ] Deduced a trap composed of 193 places in 184 ms of which 1 ms to minimize.
[2024-05-22 20:24:43] [INFO ] Deduced a trap composed of 210 places in 185 ms of which 0 ms to minimize.
[2024-05-22 20:24:43] [INFO ] Deduced a trap composed of 214 places in 182 ms of which 1 ms to minimize.
[2024-05-22 20:24:43] [INFO ] Deduced a trap composed of 43 places in 184 ms of which 1 ms to minimize.
[2024-05-22 20:24:44] [INFO ] Deduced a trap composed of 55 places in 177 ms of which 0 ms to minimize.
[2024-05-22 20:24:47] [INFO ] Deduced a trap composed of 67 places in 177 ms of which 0 ms to minimize.
[2024-05-22 20:24:56] [INFO ] Trap strengthening (SAT) tested/added 7/7 trap constraints in 13663 ms
[2024-05-22 20:24:59] [INFO ] Deduced a trap composed of 363 places in 243 ms of which 1 ms to minimize.
[2024-05-22 20:24:59] [INFO ] Deduced a trap composed of 78 places in 236 ms of which 1 ms to minimize.
[2024-05-22 20:25:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 7608 ms
[2024-05-22 20:25:06] [INFO ] Deduced a trap composed of 151 places in 127 ms of which 0 ms to minimize.
[2024-05-22 20:25:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 599 ms
[2024-05-22 20:25:09] [INFO ] Deduced a trap composed of 173 places in 128 ms of which 0 ms to minimize.
[2024-05-22 20:25:18] [INFO ] Trap strengthening (SAT) tested/added 1/1 trap constraints in 9178 ms
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5887119952025225497
[2024-05-22 20:25:25] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5887119952025225497
Running compilation step : cd /tmp/ltsmin5887119952025225497;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '120' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2115 ms.
Running link step : cd /tmp/ltsmin5887119952025225497;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin5887119952025225497;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'smplace_3==true'
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.refineResultsWithTraps(DeadlockTester.java:725)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.applyReachabilitySolver(GlobalPropertySolver.java:724)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:558)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preSolveLiveness(GlobalPropertySolver.java:412)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preStableMarking(GlobalPropertySolver.java:321)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:294)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:426)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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)
[2024-05-22 20:25:31] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-22 20:25:31] [INFO ] After 225034ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:850
Fused 850 Parikh solutions to 806 different solutions.
Parikh walk visited 0 properties in 30070 ms.
Support contains 850 out of 948 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 948/948 places, 890/890 transitions.
Applied a total of 0 rules in 64 ms. Remains 948 /948 variables (removed 0) and now considering 890/890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65 ms. Remains : 948/948 places, 890/890 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 948/948 places, 890/890 transitions.
Applied a total of 0 rules in 63 ms. Remains 948 /948 variables (removed 0) and now considering 890/890 (removed 0) transitions.
// Phase 1: matrix 890 rows 948 cols
[2024-05-22 20:26:02] [INFO ] Invariants computation overflowed in 160 ms
[2024-05-22 20:26:02] [INFO ] Implicit Places using invariants in 374 ms returned []
// Phase 1: matrix 890 rows 948 cols
[2024-05-22 20:26:02] [INFO ] Invariants computation overflowed in 61 ms
[2024-05-22 20:26:03] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-22 20:26:06] [INFO ] Implicit Places using invariants and state equation in 3825 ms returned []
Implicit Place search using SMT with State Equation took 4200 ms to find 0 implicit places.
[2024-05-22 20:26:06] [INFO ] Redundant transitions in 20 ms returned []
// Phase 1: matrix 890 rows 948 cols
[2024-05-22 20:26:06] [INFO ] Invariants computation overflowed in 112 ms
[2024-05-22 20:26:06] [INFO ] Dead Transitions using invariants and state equation in 676 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5011 ms. Remains : 948/948 places, 890/890 transitions.
Incomplete random walk after 100000 steps, including 12769 resets, run finished after 18450 ms. (steps per millisecond=5 ) properties (out of 850) seen :0
Running SMT prover for 850 properties.
// Phase 1: matrix 890 rows 948 cols
[2024-05-22 20:26:25] [INFO ] Invariants computation overflowed in 105 ms
[2024-05-22 20:26:56] [INFO ] After 29594ms SMT Verify possible using state equation in real domain returned unsat :0 sat :850
[2024-05-22 20:26:56] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-22 20:27:31] [INFO ] After 35606ms SMT Verify possible using 14 Read/Feed constraints in real domain returned unsat :0 sat :850
[2024-05-22 20:27:32] [INFO ] Deduced a trap composed of 14 places in 319 ms of which 1 ms to minimize.
[2024-05-22 20:27:32] [INFO ] Deduced a trap composed of 233 places in 307 ms of which 0 ms to minimize.
[2024-05-22 20:27:32] [INFO ] Deduced a trap composed of 182 places in 218 ms of which 1 ms to minimize.
[2024-05-22 20:27:32] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1120 ms
[2024-05-22 20:27:35] [INFO ] Deduced a trap composed of 394 places in 397 ms of which 1 ms to minimize.
[2024-05-22 20:27:35] [INFO ] Deduced a trap composed of 230 places in 464 ms of which 1 ms to minimize.
[2024-05-22 20:27:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1182 ms
[2024-05-22 20:27:36] [INFO ] Deduced a trap composed of 383 places in 485 ms of which 0 ms to minimize.
[2024-05-22 20:27:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 740 ms
[2024-05-22 20:27:37] [INFO ] Deduced a trap composed of 200 places in 261 ms of which 0 ms to minimize.
[2024-05-22 20:27:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 491 ms
[2024-05-22 20:27:38] [INFO ] Deduced a trap composed of 206 places in 266 ms of which 0 ms to minimize.
[2024-05-22 20:27:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 548 ms
[2024-05-22 20:27:44] [INFO ] Deduced a trap composed of 205 places in 267 ms of which 1 ms to minimize.
[2024-05-22 20:27:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 505 ms
[2024-05-22 20:27:46] [INFO ] Deduced a trap composed of 194 places in 257 ms of which 0 ms to minimize.
[2024-05-22 20:27:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 490 ms
[2024-05-22 20:27:47] [INFO ] Deduced a trap composed of 201 places in 272 ms of which 0 ms to minimize.
[2024-05-22 20:27:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 505 ms
[2024-05-22 20:27:50] [INFO ] Deduced a trap composed of 408 places in 376 ms of which 1 ms to minimize.
[2024-05-22 20:27:50] [INFO ] Deduced a trap composed of 339 places in 399 ms of which 1 ms to minimize.
[2024-05-22 20:27:50] [INFO ] Deduced a trap composed of 398 places in 454 ms of which 1 ms to minimize.
[2024-05-22 20:27:51] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1453 ms
[2024-05-22 20:27:53] [INFO ] Deduced a trap composed of 359 places in 462 ms of which 1 ms to minimize.
[2024-05-22 20:27:54] [INFO ] Deduced a trap composed of 334 places in 454 ms of which 0 ms to minimize.
[2024-05-22 20:27:54] [INFO ] Deduced a trap composed of 52 places in 442 ms of which 1 ms to minimize.
[2024-05-22 20:27:55] [INFO ] Deduced a trap composed of 36 places in 472 ms of which 9 ms to minimize.
[2024-05-22 20:27:55] [INFO ] Deduced a trap composed of 361 places in 428 ms of which 1 ms to minimize.
[2024-05-22 20:27:56] [INFO ] Deduced a trap composed of 356 places in 514 ms of which 0 ms to minimize.
[2024-05-22 20:27:57] [INFO ] Deduced a trap composed of 368 places in 414 ms of which 1 ms to minimize.
[2024-05-22 20:27:57] [INFO ] Deduced a trap composed of 371 places in 526 ms of which 1 ms to minimize.
[2024-05-22 20:27:58] [INFO ] Deduced a trap composed of 359 places in 531 ms of which 1 ms to minimize.
[2024-05-22 20:27:59] [INFO ] Deduced a trap composed of 360 places in 532 ms of which 1 ms to minimize.
[2024-05-22 20:27:59] [INFO ] Deduced a trap composed of 361 places in 465 ms of which 1 ms to minimize.
[2024-05-22 20:28:00] [INFO ] Deduced a trap composed of 353 places in 550 ms of which 1 ms to minimize.
[2024-05-22 20:28:00] [INFO ] Deduced a trap composed of 333 places in 541 ms of which 1 ms to minimize.
[2024-05-22 20:28:01] [INFO ] Deduced a trap composed of 381 places in 528 ms of which 1 ms to minimize.
[2024-05-22 20:28:02] [INFO ] Deduced a trap composed of 395 places in 495 ms of which 1 ms to minimize.
[2024-05-22 20:28:02] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 8843 ms
[2024-05-22 20:28:03] [INFO ] Deduced a trap composed of 8 places in 427 ms of which 1 ms to minimize.
[2024-05-22 20:28:03] [INFO ] Deduced a trap composed of 21 places in 431 ms of which 1 ms to minimize.
[2024-05-22 20:28:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1005 ms
[2024-05-22 20:28:05] [INFO ] Deduced a trap composed of 38 places in 477 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:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:342)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:218)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositions(AtomicReducerSR.java:267)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:256)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.applyReachabilitySolver(GlobalPropertySolver.java:724)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:558)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preSolveLiveness(GlobalPropertySolver.java:412)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preStableMarking(GlobalPropertySolver.java:321)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:294)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:426)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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)
[2024-05-22 20:28:05] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-22 20:28:05] [INFO ] After 100134ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Incomplete random walk after 10000 steps, including 1270 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 851 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 132925 steps, run timeout after 3001 ms. (steps per millisecond=44 ) properties seen :{}
Probabilistic random walk after 132925 steps, saw 66485 distinct states, run finished after 3013 ms. (steps per millisecond=44 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 890 rows 948 cols
[2024-05-22 20:28:09] [INFO ] Invariants computation overflowed in 107 ms
[2024-05-22 20:28:09] [INFO ] After 144ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 20:28:15] [INFO ] After 6259ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 20:28:15] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-22 20:28:16] [INFO ] After 1036ms SMT Verify possible using 14 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-22 20:28:17] [INFO ] Deduced a trap composed of 189 places in 282 ms of which 0 ms to minimize.
[2024-05-22 20:28:17] [INFO ] Deduced a trap composed of 180 places in 243 ms of which 1 ms to minimize.
[2024-05-22 20:28:18] [INFO ] Deduced a trap composed of 182 places in 282 ms of which 1 ms to minimize.
[2024-05-22 20:28:18] [INFO ] Deduced a trap composed of 170 places in 267 ms of which 0 ms to minimize.
[2024-05-22 20:28:19] [INFO ] Deduced a trap composed of 168 places in 258 ms of which 0 ms to minimize.
[2024-05-22 20:28:19] [INFO ] Deduced a trap composed of 169 places in 278 ms of which 1 ms to minimize.
[2024-05-22 20:28:19] [INFO ] Deduced a trap composed of 208 places in 323 ms of which 0 ms to minimize.
[2024-05-22 20:28:20] [INFO ] Deduced a trap composed of 144 places in 309 ms of which 8 ms to minimize.
[2024-05-22 20:28:20] [INFO ] Deduced a trap composed of 146 places in 302 ms of which 0 ms to minimize.
[2024-05-22 20:28:20] [INFO ] Deduced a trap composed of 158 places in 270 ms of which 0 ms to minimize.
[2024-05-22 20:28:21] [INFO ] Deduced a trap composed of 132 places in 255 ms of which 0 ms to minimize.
[2024-05-22 20:28:21] [INFO ] Deduced a trap composed of 134 places in 305 ms of which 0 ms to minimize.
[2024-05-22 20:28:22] [INFO ] Deduced a trap composed of 159 places in 251 ms of which 0 ms to minimize.
[2024-05-22 20:28:23] [INFO ] Deduced a trap composed of 120 places in 295 ms of which 1 ms to minimize.
[2024-05-22 20:28:23] [INFO ] Deduced a trap composed of 232 places in 312 ms of which 1 ms to minimize.
[2024-05-22 20:28:25] [INFO ] Deduced a trap composed of 122 places in 258 ms of which 1 ms to minimize.
[2024-05-22 20:28:26] [INFO ] Deduced a trap composed of 108 places in 262 ms of which 1 ms to minimize.
[2024-05-22 20:28:26] [INFO ] Deduced a trap composed of 110 places in 315 ms of which 0 ms to minimize.
[2024-05-22 20:28:31] [INFO ] Deduced a trap composed of 115 places in 240 ms of which 0 ms to minimize.
[2024-05-22 20:28:34] [INFO ] Deduced a trap composed of 98 places in 329 ms of which 1 ms to minimize.
[2024-05-22 20:28:34] [INFO ] Trap strengthening (SAT) tested/added 20/20 trap constraints in 17417 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:772)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositions(AtomicReducerSR.java:365)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:256)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.applyReachabilitySolver(GlobalPropertySolver.java:724)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:558)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preSolveLiveness(GlobalPropertySolver.java:412)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preStableMarking(GlobalPropertySolver.java:321)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:294)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:426)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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)
[2024-05-22 20:28:34] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-22 20:28:34] [INFO ] After 25044ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 2000 ms.
Support contains 1 out of 948 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 948/948 places, 890/890 transitions.
Graph (complete) has 1878 edges and 948 vertex of which 942 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.20 ms
Discarding 6 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 193 transitions
Trivial Post-agglo rules discarded 193 transitions
Performed 193 trivial Post agglomeration. Transition count delta: 193
Iterating post reduction 0 with 196 rules applied. Total rules applied 197 place count 941 transition count 695
Reduce places removed 193 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 194 rules applied. Total rules applied 391 place count 748 transition count 694
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 392 place count 747 transition count 694
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 32 Pre rules applied. Total rules applied 392 place count 747 transition count 662
Deduced a syphon composed of 32 places in 5 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 64 rules applied. Total rules applied 456 place count 715 transition count 662
Performed 145 Post agglomeration using F-continuation condition.Transition count delta: 145
Deduced a syphon composed of 145 places in 3 ms
Reduce places removed 145 places and 0 transitions.
Iterating global reduction 3 with 290 rules applied. Total rules applied 746 place count 570 transition count 517
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 30 places in 2 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 806 place count 540 transition count 517
Free-agglomeration rule (complex) applied 65 times.
Iterating global reduction 3 with 65 rules applied. Total rules applied 871 place count 540 transition count 452
Reduce places removed 65 places and 0 transitions.
Iterating post reduction 3 with 65 rules applied. Total rules applied 936 place count 475 transition count 452
Partial Free-agglomeration rule applied 64 times.
Drop transitions removed 64 transitions
Iterating global reduction 4 with 64 rules applied. Total rules applied 1000 place count 475 transition count 452
Applied a total of 1000 rules in 425 ms. Remains 475 /948 variables (removed 473) and now considering 452/890 (removed 438) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 425 ms. Remains : 475/948 places, 452/890 transitions.
Incomplete random walk after 10000 steps, including 1277 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 871 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 207994 steps, run timeout after 3001 ms. (steps per millisecond=69 ) properties seen :{}
Probabilistic random walk after 207994 steps, saw 104051 distinct states, run finished after 3013 ms. (steps per millisecond=69 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 452 rows 475 cols
[2024-05-22 20:28:40] [INFO ] Computed 100 invariants in 167 ms
[2024-05-22 20:28:40] [INFO ] After 111ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 20:28:40] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-22 20:28:40] [INFO ] [Nat]Absence check using 2 positive and 98 generalized place invariants in 50 ms returned sat
[2024-05-22 20:28:40] [INFO ] After 343ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 20:28:40] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 20:28:42] [INFO ] After 1719ms SMT Verify possible using 78 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-22 20:28:42] [INFO ] After 1810ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 81 ms.
[2024-05-22 20:28:42] [INFO ] After 2397ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2017 ms.
Support contains 1 out of 475 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 475/475 places, 452/452 transitions.
Applied a total of 0 rules in 23 ms. Remains 475 /475 variables (removed 0) and now considering 452/452 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 475/475 places, 452/452 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 475/475 places, 452/452 transitions.
Applied a total of 0 rules in 12 ms. Remains 475 /475 variables (removed 0) and now considering 452/452 (removed 0) transitions.
[2024-05-22 20:28:44] [INFO ] Invariant cache hit.
[2024-05-22 20:28:46] [INFO ] Implicit Places using invariants in 2355 ms returned [14, 19, 44, 50, 70, 75, 96, 101, 121, 127, 148, 153, 154, 174, 179, 200, 206, 213, 227, 232, 255, 261, 283, 288, 308, 313, 334, 339, 360, 366, 387, 389, 393, 413, 419, 441, 446, 450, 467, 473]
Discarding 40 places :
Implicit Place search using SMT only with invariants took 2358 ms to find 40 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 435/475 places, 452/452 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 434 transition count 451
Free-agglomeration rule (complex) applied 20 times.
Iterating global reduction 0 with 20 rules applied. Total rules applied 22 place count 434 transition count 431
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 42 place count 414 transition count 431
Applied a total of 42 rules in 56 ms. Remains 414 /435 variables (removed 21) and now considering 431/452 (removed 21) transitions.
// Phase 1: matrix 431 rows 414 cols
[2024-05-22 20:28:47] [INFO ] Computed 61 invariants in 161 ms
[2024-05-22 20:28:47] [INFO ] Implicit Places using invariants in 864 ms returned []
[2024-05-22 20:28:47] [INFO ] Invariant cache hit.
[2024-05-22 20:28:48] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 20:29:18] [INFO ] Performed 243/414 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-22 20:29:32] [INFO ] Implicit Places using invariants and state equation in 45075 ms returned []
Implicit Place search using SMT with State Equation took 45944 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 414/475 places, 431/452 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 48381 ms. Remains : 414/475 places, 431/452 transitions.
Incomplete random walk after 10000 steps, including 1472 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 908 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 212533 steps, run timeout after 3001 ms. (steps per millisecond=70 ) properties seen :{}
Probabilistic random walk after 212533 steps, saw 106285 distinct states, run finished after 3021 ms. (steps per millisecond=70 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-22 20:29:36] [INFO ] Invariant cache hit.
[2024-05-22 20:29:36] [INFO ] After 111ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 20:29:36] [INFO ] [Nat]Absence check using 19 positive place invariants in 36 ms returned sat
[2024-05-22 20:29:36] [INFO ] [Nat]Absence check using 19 positive and 42 generalized place invariants in 7 ms returned sat
[2024-05-22 20:29:36] [INFO ] After 367ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 20:29:36] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 20:29:39] [INFO ] After 2886ms SMT Verify possible using 78 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-22 20:29:39] [INFO ] Deduced a trap composed of 51 places in 73 ms of which 1 ms to minimize.
[2024-05-22 20:29:39] [INFO ] Deduced a trap composed of 52 places in 114 ms of which 0 ms to minimize.
[2024-05-22 20:29:40] [INFO ] Deduced a trap composed of 56 places in 117 ms of which 0 ms to minimize.
[2024-05-22 20:29:40] [INFO ] Deduced a trap composed of 46 places in 118 ms of which 0 ms to minimize.
[2024-05-22 20:29:40] [INFO ] Deduced a trap composed of 43 places in 57 ms of which 0 ms to minimize.
[2024-05-22 20:29:40] [INFO ] Deduced a trap composed of 40 places in 103 ms of which 0 ms to minimize.
[2024-05-22 20:29:40] [INFO ] Deduced a trap composed of 51 places in 101 ms of which 0 ms to minimize.
[2024-05-22 20:29:40] [INFO ] Deduced a trap composed of 37 places in 102 ms of which 1 ms to minimize.
[2024-05-22 20:29:40] [INFO ] Deduced a trap composed of 30 places in 105 ms of which 0 ms to minimize.
[2024-05-22 20:29:40] [INFO ] Deduced a trap composed of 31 places in 120 ms of which 1 ms to minimize.
[2024-05-22 20:29:41] [INFO ] Deduced a trap composed of 31 places in 131 ms of which 1 ms to minimize.
[2024-05-22 20:29:41] [INFO ] Deduced a trap composed of 28 places in 110 ms of which 0 ms to minimize.
[2024-05-22 20:29:41] [INFO ] Deduced a trap composed of 25 places in 111 ms of which 1 ms to minimize.
[2024-05-22 20:29:41] [INFO ] Deduced a trap composed of 22 places in 122 ms of which 0 ms to minimize.
[2024-05-22 20:29:41] [INFO ] Deduced a trap composed of 18 places in 127 ms of which 0 ms to minimize.
[2024-05-22 20:29:41] [INFO ] Deduced a trap composed of 19 places in 150 ms of which 0 ms to minimize.
[2024-05-22 20:29:42] [INFO ] Deduced a trap composed of 12 places in 145 ms of which 1 ms to minimize.
[2024-05-22 20:29:42] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 2406 ms
[2024-05-22 20:29:42] [INFO ] After 5391ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 375 ms.
[2024-05-22 20:29:42] [INFO ] After 6307ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2000 ms.
Support contains 1 out of 414 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 414/414 places, 431/431 transitions.
Applied a total of 0 rules in 80 ms. Remains 414 /414 variables (removed 0) and now considering 431/431 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80 ms. Remains : 414/414 places, 431/431 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 414/414 places, 431/431 transitions.
Applied a total of 0 rules in 26 ms. Remains 414 /414 variables (removed 0) and now considering 431/431 (removed 0) transitions.
[2024-05-22 20:29:44] [INFO ] Invariant cache hit.
[2024-05-22 20:29:45] [INFO ] Implicit Places using invariants in 587 ms returned []
[2024-05-22 20:29:45] [INFO ] Invariant cache hit.
[2024-05-22 20:29:45] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 20:30:15] [INFO ] Performed 298/414 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-22 20:30:26] [INFO ] Implicit Places using invariants and state equation in 41527 ms returned []
Implicit Place search using SMT with State Equation took 42116 ms to find 0 implicit places.
[2024-05-22 20:30:26] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-22 20:30:26] [INFO ] Invariant cache hit.
[2024-05-22 20:30:27] [INFO ] Dead Transitions using invariants and state equation in 422 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42599 ms. Remains : 414/414 places, 431/431 transitions.
Incomplete random walk after 10000 steps, including 1265 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 854 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 142389 steps, run timeout after 3001 ms. (steps per millisecond=47 ) properties seen :{}
Probabilistic random walk after 142389 steps, saw 71218 distinct states, run finished after 3001 ms. (steps per millisecond=47 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 890 rows 948 cols
[2024-05-22 20:30:30] [INFO ] Invariants computation overflowed in 101 ms
[2024-05-22 20:30:30] [INFO ] After 144ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 20:30:55] [INFO ] After 25045ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 948 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 948/948 places, 890/890 transitions.
Graph (complete) has 1878 edges and 948 vertex of which 942 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 194 transitions
Trivial Post-agglo rules discarded 194 transitions
Performed 194 trivial Post agglomeration. Transition count delta: 194
Iterating post reduction 0 with 197 rules applied. Total rules applied 198 place count 941 transition count 694
Reduce places removed 194 places and 0 transitions.
Iterating post reduction 1 with 194 rules applied. Total rules applied 392 place count 747 transition count 694
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 392 place count 747 transition count 662
Deduced a syphon composed of 32 places in 5 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 456 place count 715 transition count 662
Performed 145 Post agglomeration using F-continuation condition.Transition count delta: 145
Deduced a syphon composed of 145 places in 2 ms
Reduce places removed 145 places and 0 transitions.
Iterating global reduction 2 with 290 rules applied. Total rules applied 746 place count 570 transition count 517
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 30 places in 2 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 806 place count 540 transition count 517
Free-agglomeration rule (complex) applied 64 times.
Iterating global reduction 2 with 64 rules applied. Total rules applied 870 place count 540 transition count 453
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 2 with 64 rules applied. Total rules applied 934 place count 476 transition count 453
Partial Free-agglomeration rule applied 65 times.
Drop transitions removed 65 transitions
Iterating global reduction 3 with 65 rules applied. Total rules applied 999 place count 476 transition count 453
Applied a total of 999 rules in 331 ms. Remains 476 /948 variables (removed 472) and now considering 453/890 (removed 437) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 343 ms. Remains : 476/948 places, 453/890 transitions.
Incomplete random walk after 10000 steps, including 1295 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 851 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 203011 steps, run timeout after 3001 ms. (steps per millisecond=67 ) properties seen :{}
Probabilistic random walk after 203011 steps, saw 101559 distinct states, run finished after 3001 ms. (steps per millisecond=67 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 453 rows 476 cols
[2024-05-22 20:30:59] [INFO ] Computed 100 invariants in 72 ms
[2024-05-22 20:30:59] [INFO ] After 109ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 20:30:59] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-22 20:30:59] [INFO ] [Nat]Absence check using 2 positive and 98 generalized place invariants in 61 ms returned sat
[2024-05-22 20:30:59] [INFO ] After 350ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 20:30:59] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 20:31:00] [INFO ] After 1298ms SMT Verify possible using 78 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-22 20:31:01] [INFO ] Deduced a trap composed of 56 places in 86 ms of which 1 ms to minimize.
[2024-05-22 20:31:01] [INFO ] Deduced a trap composed of 55 places in 48 ms of which 0 ms to minimize.
[2024-05-22 20:31:01] [INFO ] Deduced a trap composed of 64 places in 65 ms of which 0 ms to minimize.
[2024-05-22 20:31:01] [INFO ] Deduced a trap composed of 45 places in 52 ms of which 0 ms to minimize.
[2024-05-22 20:31:01] [INFO ] Deduced a trap composed of 46 places in 110 ms of which 0 ms to minimize.
[2024-05-22 20:31:01] [INFO ] Deduced a trap composed of 39 places in 123 ms of which 0 ms to minimize.
[2024-05-22 20:31:01] [INFO ] Deduced a trap composed of 40 places in 117 ms of which 0 ms to minimize.
[2024-05-22 20:31:01] [INFO ] Deduced a trap composed of 38 places in 106 ms of which 0 ms to minimize.
[2024-05-22 20:31:02] [INFO ] Deduced a trap composed of 40 places in 108 ms of which 1 ms to minimize.
[2024-05-22 20:31:02] [INFO ] Deduced a trap composed of 35 places in 127 ms of which 1 ms to minimize.
[2024-05-22 20:31:02] [INFO ] Deduced a trap composed of 30 places in 130 ms of which 0 ms to minimize.
[2024-05-22 20:31:02] [INFO ] Deduced a trap composed of 27 places in 143 ms of which 1 ms to minimize.
[2024-05-22 20:31:02] [INFO ] Deduced a trap composed of 29 places in 128 ms of which 0 ms to minimize.
[2024-05-22 20:31:03] [INFO ] Deduced a trap composed of 28 places in 171 ms of which 0 ms to minimize.
[2024-05-22 20:31:03] [INFO ] Deduced a trap composed of 25 places in 168 ms of which 0 ms to minimize.
[2024-05-22 20:31:03] [INFO ] Deduced a trap composed of 22 places in 189 ms of which 9 ms to minimize.
[2024-05-22 20:31:03] [INFO ] Deduced a trap composed of 15 places in 151 ms of which 0 ms to minimize.
[2024-05-22 20:31:03] [INFO ] Deduced a trap composed of 16 places in 157 ms of which 1 ms to minimize.
[2024-05-22 20:31:04] [INFO ] Deduced a trap composed of 13 places in 163 ms of which 1 ms to minimize.
[2024-05-22 20:31:04] [INFO ] Deduced a trap composed of 11 places in 157 ms of which 0 ms to minimize.
[2024-05-22 20:31:04] [INFO ] Deduced a trap composed of 14 places in 152 ms of which 0 ms to minimize.
[2024-05-22 20:31:05] [INFO ] Deduced a trap composed of 9 places in 146 ms of which 1 ms to minimize.
[2024-05-22 20:31:05] [INFO ] Deduced a trap composed of 92 places in 181 ms of which 0 ms to minimize.
[2024-05-22 20:31:05] [INFO ] Deduced a trap composed of 12 places in 154 ms of which 0 ms to minimize.
[2024-05-22 20:31:06] [INFO ] Deduced a trap composed of 19 places in 153 ms of which 0 ms to minimize.
[2024-05-22 20:31:06] [INFO ] Deduced a trap composed of 17 places in 125 ms of which 1 ms to minimize.
[2024-05-22 20:31:06] [INFO ] Deduced a trap composed of 20 places in 176 ms of which 0 ms to minimize.
[2024-05-22 20:31:07] [INFO ] Deduced a trap composed of 23 places in 127 ms of which 1 ms to minimize.
[2024-05-22 20:31:07] [INFO ] Deduced a trap composed of 18 places in 128 ms of which 0 ms to minimize.
[2024-05-22 20:31:07] [INFO ] Deduced a trap composed of 26 places in 120 ms of which 0 ms to minimize.
[2024-05-22 20:31:07] [INFO ] Deduced a trap composed of 21 places in 124 ms of which 0 ms to minimize.
[2024-05-22 20:31:08] [INFO ] Deduced a trap composed of 31 places in 125 ms of which 1 ms to minimize.
[2024-05-22 20:31:08] [INFO ] Deduced a trap composed of 32 places in 153 ms of which 0 ms to minimize.
[2024-05-22 20:31:09] [INFO ] Deduced a trap composed of 34 places in 138 ms of which 1 ms to minimize.
[2024-05-22 20:31:09] [INFO ] Deduced a trap composed of 33 places in 138 ms of which 0 ms to minimize.
[2024-05-22 20:31:09] [INFO ] Deduced a trap composed of 36 places in 132 ms of which 0 ms to minimize.
[2024-05-22 20:31:10] [INFO ] Deduced a trap composed of 51 places in 155 ms of which 0 ms to minimize.
[2024-05-22 20:31:10] [INFO ] Deduced a trap composed of 43 places in 111 ms of which 0 ms to minimize.
[2024-05-22 20:31:10] [INFO ] Deduced a trap composed of 47 places in 124 ms of which 0 ms to minimize.
[2024-05-22 20:31:11] [INFO ] Deduced a trap composed of 51 places in 117 ms of which 1 ms to minimize.
[2024-05-22 20:31:11] [INFO ] Deduced a trap composed of 50 places in 98 ms of which 0 ms to minimize.
[2024-05-22 20:31:11] [INFO ] Deduced a trap composed of 56 places in 81 ms of which 0 ms to minimize.
[2024-05-22 20:31:11] [INFO ] Deduced a trap composed of 55 places in 103 ms of which 0 ms to minimize.
[2024-05-22 20:31:12] [INFO ] Deduced a trap composed of 55 places in 105 ms of which 0 ms to minimize.
[2024-05-22 20:31:14] [INFO ] Deduced a trap composed of 51 places in 87 ms of which 1 ms to minimize.
[2024-05-22 20:31:14] [INFO ] Trap strengthening (SAT) tested/added 46/45 trap constraints in 13610 ms
[2024-05-22 20:31:14] [INFO ] After 14984ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 46 ms.
[2024-05-22 20:31:14] [INFO ] After 15559ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2000 ms.
Support contains 1 out of 476 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 476/476 places, 453/453 transitions.
Applied a total of 0 rules in 29 ms. Remains 476 /476 variables (removed 0) and now considering 453/453 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 476/476 places, 453/453 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 476/476 places, 453/453 transitions.
Applied a total of 0 rules in 42 ms. Remains 476 /476 variables (removed 0) and now considering 453/453 (removed 0) transitions.
[2024-05-22 20:31:16] [INFO ] Invariant cache hit.
[2024-05-22 20:31:19] [INFO ] Implicit Places using invariants in 2407 ms returned [15, 20, 45, 51, 71, 76, 97, 102, 122, 128, 149, 154, 155, 175, 180, 201, 207, 214, 228, 233, 256, 262, 284, 289, 309, 314, 335, 340, 361, 367, 388, 390, 394, 414, 420, 442, 447, 451, 468, 474]
Discarding 40 places :
Implicit Place search using SMT only with invariants took 2408 ms to find 40 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 436/476 places, 453/453 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 435 transition count 452
Free-agglomeration rule (complex) applied 20 times.
Iterating global reduction 0 with 20 rules applied. Total rules applied 22 place count 435 transition count 432
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 42 place count 415 transition count 432
Applied a total of 42 rules in 52 ms. Remains 415 /436 variables (removed 21) and now considering 432/453 (removed 21) transitions.
// Phase 1: matrix 432 rows 415 cols
[2024-05-22 20:31:19] [INFO ] Invariants computation overflowed in 57 ms
[2024-05-22 20:31:19] [INFO ] Implicit Places using invariants in 561 ms returned []
// Phase 1: matrix 432 rows 415 cols
[2024-05-22 20:31:19] [INFO ] Invariants computation overflowed in 50 ms
[2024-05-22 20:31:20] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 20:31:50] [INFO ] Performed 351/415 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-22 20:31:56] [INFO ] Implicit Places using invariants and state equation in 36356 ms returned []
Implicit Place search using SMT with State Equation took 36918 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 415/476 places, 432/453 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 39427 ms. Remains : 415/476 places, 432/453 transitions.
Incomplete random walk after 10000 steps, including 1455 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 902 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 221895 steps, run timeout after 3001 ms. (steps per millisecond=73 ) properties seen :{}
Probabilistic random walk after 221895 steps, saw 110966 distinct states, run finished after 3002 ms. (steps per millisecond=73 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 432 rows 415 cols
[2024-05-22 20:31:59] [INFO ] Invariants computation overflowed in 40 ms
[2024-05-22 20:31:59] [INFO ] After 115ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 20:32:00] [INFO ] After 853ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 20:32:00] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 20:32:01] [INFO ] After 1055ms SMT Verify possible using 78 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-22 20:32:01] [INFO ] Deduced a trap composed of 51 places in 112 ms of which 0 ms to minimize.
[2024-05-22 20:32:01] [INFO ] Deduced a trap composed of 59 places in 92 ms of which 0 ms to minimize.
[2024-05-22 20:32:01] [INFO ] Deduced a trap composed of 48 places in 108 ms of which 0 ms to minimize.
[2024-05-22 20:32:01] [INFO ] Deduced a trap composed of 49 places in 108 ms of which 0 ms to minimize.
[2024-05-22 20:32:02] [INFO ] Deduced a trap composed of 49 places in 122 ms of which 5 ms to minimize.
[2024-05-22 20:32:02] [INFO ] Deduced a trap composed of 46 places in 112 ms of which 1 ms to minimize.
[2024-05-22 20:32:02] [INFO ] Deduced a trap composed of 39 places in 122 ms of which 0 ms to minimize.
[2024-05-22 20:32:02] [INFO ] Deduced a trap composed of 36 places in 127 ms of which 1 ms to minimize.
[2024-05-22 20:32:02] [INFO ] Deduced a trap composed of 33 places in 116 ms of which 0 ms to minimize.
[2024-05-22 20:32:02] [INFO ] Deduced a trap composed of 34 places in 123 ms of which 0 ms to minimize.
[2024-05-22 20:32:02] [INFO ] Deduced a trap composed of 30 places in 113 ms of which 1 ms to minimize.
[2024-05-22 20:32:03] [INFO ] Deduced a trap composed of 31 places in 129 ms of which 0 ms to minimize.
[2024-05-22 20:32:03] [INFO ] Deduced a trap composed of 28 places in 120 ms of which 0 ms to minimize.
[2024-05-22 20:32:03] [INFO ] Deduced a trap composed of 25 places in 125 ms of which 0 ms to minimize.
[2024-05-22 20:32:03] [INFO ] Deduced a trap composed of 25 places in 106 ms of which 1 ms to minimize.
[2024-05-22 20:32:03] [INFO ] Deduced a trap composed of 18 places in 115 ms of which 0 ms to minimize.
[2024-05-22 20:32:03] [INFO ] Deduced a trap composed of 19 places in 149 ms of which 0 ms to minimize.
[2024-05-22 20:32:03] [INFO ] Deduced a trap composed of 19 places in 133 ms of which 0 ms to minimize.
[2024-05-22 20:32:04] [INFO ] Deduced a trap composed of 16 places in 139 ms of which 0 ms to minimize.
[2024-05-22 20:32:04] [INFO ] Deduced a trap composed of 12 places in 128 ms of which 0 ms to minimize.
[2024-05-22 20:32:04] [INFO ] Deduced a trap composed of 58 places in 174 ms of which 0 ms to minimize.
[2024-05-22 20:32:05] [INFO ] Deduced a trap composed of 68 places in 148 ms of which 0 ms to minimize.
[2024-05-22 20:32:05] [INFO ] Deduced a trap composed of 74 places in 142 ms of which 9 ms to minimize.
[2024-05-22 20:32:05] [INFO ] Deduced a trap composed of 9 places in 167 ms of which 1 ms to minimize.
[2024-05-22 20:32:05] [INFO ] Deduced a trap composed of 100 places in 176 ms of which 0 ms to minimize.
[2024-05-22 20:32:05] [INFO ] Deduced a trap composed of 85 places in 157 ms of which 0 ms to minimize.
[2024-05-22 20:32:05] [INFO ] Deduced a trap composed of 95 places in 152 ms of which 0 ms to minimize.
[2024-05-22 20:32:06] [INFO ] Deduced a trap composed of 10 places in 142 ms of which 1 ms to minimize.
[2024-05-22 20:32:06] [INFO ] Trap strengthening (SAT) tested/added 29/28 trap constraints in 4729 ms
[2024-05-22 20:32:06] [INFO ] After 5823ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 52 ms.
[2024-05-22 20:32:06] [INFO ] After 6807ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2011 ms.
Support contains 1 out of 415 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 415/415 places, 432/432 transitions.
Applied a total of 0 rules in 32 ms. Remains 415 /415 variables (removed 0) and now considering 432/432 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 415/415 places, 432/432 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 415/415 places, 432/432 transitions.
Applied a total of 0 rules in 7 ms. Remains 415 /415 variables (removed 0) and now considering 432/432 (removed 0) transitions.
// Phase 1: matrix 432 rows 415 cols
[2024-05-22 20:32:08] [INFO ] Invariants computation overflowed in 52 ms
[2024-05-22 20:32:08] [INFO ] Implicit Places using invariants in 541 ms returned []
// Phase 1: matrix 432 rows 415 cols
[2024-05-22 20:32:08] [INFO ] Invariants computation overflowed in 58 ms
[2024-05-22 20:32:09] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 20:32:38] [INFO ] Implicit Places using invariants and state equation in 29996 ms returned []
Implicit Place search using SMT with State Equation took 30538 ms to find 0 implicit places.
[2024-05-22 20:32:38] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 432 rows 415 cols
[2024-05-22 20:32:38] [INFO ] Invariants computation overflowed in 57 ms
[2024-05-22 20:32:39] [INFO ] Dead Transitions using invariants and state equation in 399 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30977 ms. Remains : 415/415 places, 432/432 transitions.
Incomplete random walk after 10000 steps, including 1285 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 848 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 135677 steps, run timeout after 3009 ms. (steps per millisecond=45 ) properties seen :{}
Probabilistic random walk after 135677 steps, saw 67859 distinct states, run finished after 3010 ms. (steps per millisecond=45 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 890 rows 948 cols
[2024-05-22 20:32:42] [INFO ] Invariants computation overflowed in 120 ms
[2024-05-22 20:32:42] [INFO ] After 150ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 20:32:50] [INFO ] After 8016ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 20:32:50] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-22 20:32:58] [INFO ] After 7506ms SMT Verify possible using 14 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-22 20:32:58] [INFO ] Deduced a trap composed of 38 places in 304 ms of which 0 ms to minimize.
[2024-05-22 20:32:59] [INFO ] Deduced a trap composed of 36 places in 374 ms of which 1 ms to minimize.
[2024-05-22 20:32:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 901 ms
[2024-05-22 20:32:59] [INFO ] After 8466ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 47 ms.
[2024-05-22 20:32:59] [INFO ] After 16693ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2000 ms.
Support contains 1 out of 948 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 948/948 places, 890/890 transitions.
Graph (complete) has 1878 edges and 948 vertex of which 942 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 193 transitions
Trivial Post-agglo rules discarded 193 transitions
Performed 193 trivial Post agglomeration. Transition count delta: 193
Iterating post reduction 0 with 196 rules applied. Total rules applied 197 place count 941 transition count 695
Reduce places removed 193 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 194 rules applied. Total rules applied 391 place count 748 transition count 694
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 392 place count 747 transition count 694
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 32 Pre rules applied. Total rules applied 392 place count 747 transition count 662
Deduced a syphon composed of 32 places in 4 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 64 rules applied. Total rules applied 456 place count 715 transition count 662
Performed 145 Post agglomeration using F-continuation condition.Transition count delta: 145
Deduced a syphon composed of 145 places in 2 ms
Reduce places removed 145 places and 0 transitions.
Iterating global reduction 3 with 290 rules applied. Total rules applied 746 place count 570 transition count 517
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 30 places in 2 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 806 place count 540 transition count 517
Free-agglomeration rule (complex) applied 65 times.
Iterating global reduction 3 with 65 rules applied. Total rules applied 871 place count 540 transition count 452
Reduce places removed 65 places and 0 transitions.
Iterating post reduction 3 with 65 rules applied. Total rules applied 936 place count 475 transition count 452
Partial Free-agglomeration rule applied 65 times.
Drop transitions removed 65 transitions
Iterating global reduction 4 with 65 rules applied. Total rules applied 1001 place count 475 transition count 452
Applied a total of 1001 rules in 153 ms. Remains 475 /948 variables (removed 473) and now considering 452/890 (removed 438) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 154 ms. Remains : 475/948 places, 452/890 transitions.
Incomplete random walk after 10000 steps, including 1257 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 859 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 206484 steps, run timeout after 3005 ms. (steps per millisecond=68 ) properties seen :{}
Probabilistic random walk after 206484 steps, saw 103295 distinct states, run finished after 3005 ms. (steps per millisecond=68 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 452 rows 475 cols
[2024-05-22 20:33:04] [INFO ] Computed 100 invariants in 122 ms
[2024-05-22 20:33:04] [INFO ] After 89ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 20:33:04] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-22 20:33:04] [INFO ] [Nat]Absence check using 2 positive and 98 generalized place invariants in 41 ms returned sat
[2024-05-22 20:33:05] [INFO ] After 342ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 20:33:05] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 20:33:06] [INFO ] After 953ms SMT Verify possible using 78 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-22 20:33:06] [INFO ] After 1020ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 36 ms.
[2024-05-22 20:33:06] [INFO ] After 1576ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2018 ms.
Support contains 1 out of 475 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 475/475 places, 452/452 transitions.
Applied a total of 0 rules in 21 ms. Remains 475 /475 variables (removed 0) and now considering 452/452 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 475/475 places, 452/452 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 475/475 places, 452/452 transitions.
Applied a total of 0 rules in 22 ms. Remains 475 /475 variables (removed 0) and now considering 452/452 (removed 0) transitions.
[2024-05-22 20:33:08] [INFO ] Invariant cache hit.
[2024-05-22 20:33:10] [INFO ] Implicit Places using invariants in 2473 ms returned [14, 19, 44, 50, 70, 75, 96, 101, 121, 127, 148, 153, 154, 174, 179, 200, 206, 213, 227, 232, 255, 261, 283, 288, 308, 313, 334, 339, 360, 366, 387, 389, 393, 413, 419, 441, 446, 450, 467, 473]
Discarding 40 places :
Implicit Place search using SMT only with invariants took 2474 ms to find 40 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 435/475 places, 452/452 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 434 transition count 451
Free-agglomeration rule (complex) applied 20 times.
Iterating global reduction 0 with 20 rules applied. Total rules applied 22 place count 434 transition count 431
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 42 place count 414 transition count 431
Applied a total of 42 rules in 66 ms. Remains 414 /435 variables (removed 21) and now considering 431/452 (removed 21) transitions.
// Phase 1: matrix 431 rows 414 cols
[2024-05-22 20:33:11] [INFO ] Computed 61 invariants in 174 ms
[2024-05-22 20:33:11] [INFO ] Implicit Places using invariants in 799 ms returned []
[2024-05-22 20:33:11] [INFO ] Invariant cache hit.
[2024-05-22 20:33:12] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 20:33:42] [INFO ] Performed 258/414 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-22 20:33:59] [INFO ] Implicit Places using invariants and state equation in 47955 ms returned []
Implicit Place search using SMT with State Equation took 48754 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 414/475 places, 431/452 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 51323 ms. Remains : 414/475 places, 431/452 transitions.
Incomplete random walk after 10000 steps, including 1450 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 951 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 205199 steps, run timeout after 3009 ms. (steps per millisecond=68 ) properties seen :{}
Probabilistic random walk after 205199 steps, saw 102619 distinct states, run finished after 3012 ms. (steps per millisecond=68 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-22 20:34:02] [INFO ] Invariant cache hit.
[2024-05-22 20:34:02] [INFO ] After 109ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 20:34:03] [INFO ] [Nat]Absence check using 19 positive place invariants in 16 ms returned sat
[2024-05-22 20:34:03] [INFO ] [Nat]Absence check using 19 positive and 42 generalized place invariants in 6 ms returned sat
[2024-05-22 20:34:03] [INFO ] After 377ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 20:34:03] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 20:34:05] [INFO ] After 1814ms SMT Verify possible using 78 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-22 20:34:05] [INFO ] After 1854ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 24 ms.
[2024-05-22 20:34:05] [INFO ] After 2359ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2000 ms.
Support contains 1 out of 414 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 414/414 places, 431/431 transitions.
Applied a total of 0 rules in 8 ms. Remains 414 /414 variables (removed 0) and now considering 431/431 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 414/414 places, 431/431 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 414/414 places, 431/431 transitions.
Applied a total of 0 rules in 24 ms. Remains 414 /414 variables (removed 0) and now considering 431/431 (removed 0) transitions.
[2024-05-22 20:34:07] [INFO ] Invariant cache hit.
[2024-05-22 20:34:07] [INFO ] Implicit Places using invariants in 609 ms returned []
[2024-05-22 20:34:07] [INFO ] Invariant cache hit.
[2024-05-22 20:34:08] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 20:34:38] [INFO ] Performed 387/414 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-22 20:34:40] [INFO ] Implicit Places using invariants and state equation in 32353 ms returned []
Implicit Place search using SMT with State Equation took 32966 ms to find 0 implicit places.
[2024-05-22 20:34:40] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-22 20:34:40] [INFO ] Invariant cache hit.
[2024-05-22 20:34:40] [INFO ] Dead Transitions using invariants and state equation in 366 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33376 ms. Remains : 414/414 places, 431/431 transitions.
Incomplete random walk after 10000 steps, including 1288 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 851 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 134362 steps, run timeout after 3006 ms. (steps per millisecond=44 ) properties seen :{}
Probabilistic random walk after 134362 steps, saw 67204 distinct states, run finished after 3007 ms. (steps per millisecond=44 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 890 rows 948 cols
[2024-05-22 20:34:44] [INFO ] Invariants computation overflowed in 161 ms
[2024-05-22 20:34:44] [INFO ] After 171ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 20:34:49] [INFO ] After 5240ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 20:34:49] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-22 20:34:53] [INFO ] After 3547ms SMT Verify possible using 14 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-22 20:34:53] [INFO ] Deduced a trap composed of 222 places in 209 ms of which 1 ms to minimize.
[2024-05-22 20:34:53] [INFO ] Deduced a trap composed of 202 places in 244 ms of which 1 ms to minimize.
[2024-05-22 20:34:54] [INFO ] Deduced a trap composed of 182 places in 287 ms of which 0 ms to minimize.
[2024-05-22 20:34:54] [INFO ] Deduced a trap composed of 208 places in 245 ms of which 0 ms to minimize.
[2024-05-22 20:34:54] [INFO ] Deduced a trap composed of 170 places in 274 ms of which 1 ms to minimize.
[2024-05-22 20:34:55] [INFO ] Deduced a trap composed of 168 places in 276 ms of which 1 ms to minimize.
[2024-05-22 20:34:55] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2196 ms
[2024-05-22 20:34:55] [INFO ] After 5784ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 66 ms.
[2024-05-22 20:34:55] [INFO ] After 11288ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2000 ms.
Support contains 1 out of 948 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 948/948 places, 890/890 transitions.
Graph (complete) has 1878 edges and 948 vertex of which 942 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.3 ms
Discarding 6 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 194 transitions
Trivial Post-agglo rules discarded 194 transitions
Performed 194 trivial Post agglomeration. Transition count delta: 194
Iterating post reduction 0 with 197 rules applied. Total rules applied 198 place count 941 transition count 694
Reduce places removed 194 places and 0 transitions.
Iterating post reduction 1 with 194 rules applied. Total rules applied 392 place count 747 transition count 694
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 392 place count 747 transition count 662
Deduced a syphon composed of 32 places in 5 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 456 place count 715 transition count 662
Performed 145 Post agglomeration using F-continuation condition.Transition count delta: 145
Deduced a syphon composed of 145 places in 2 ms
Reduce places removed 145 places and 0 transitions.
Iterating global reduction 2 with 290 rules applied. Total rules applied 746 place count 570 transition count 517
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 806 place count 540 transition count 517
Free-agglomeration rule (complex) applied 64 times.
Iterating global reduction 2 with 64 rules applied. Total rules applied 870 place count 540 transition count 453
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 2 with 64 rules applied. Total rules applied 934 place count 476 transition count 453
Partial Free-agglomeration rule applied 65 times.
Drop transitions removed 65 transitions
Iterating global reduction 3 with 65 rules applied. Total rules applied 999 place count 476 transition count 453
Applied a total of 999 rules in 199 ms. Remains 476 /948 variables (removed 472) and now considering 453/890 (removed 437) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 206 ms. Remains : 476/948 places, 453/890 transitions.
Incomplete random walk after 10000 steps, including 1268 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 865 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 182888 steps, run timeout after 3006 ms. (steps per millisecond=60 ) properties seen :{}
Probabilistic random walk after 182888 steps, saw 91473 distinct states, run finished after 3007 ms. (steps per millisecond=60 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 453 rows 476 cols
[2024-05-22 20:35:00] [INFO ] Computed 100 invariants in 71 ms
[2024-05-22 20:35:00] [INFO ] After 89ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 20:35:01] [INFO ] [Nat]Absence check using 2 positive place invariants in 10 ms returned sat
[2024-05-22 20:35:01] [INFO ] [Nat]Absence check using 2 positive and 98 generalized place invariants in 59 ms returned sat
[2024-05-22 20:35:01] [INFO ] After 456ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 20:35:01] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 20:35:04] [INFO ] After 3219ms SMT Verify possible using 78 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-22 20:35:04] [INFO ] After 3300ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 32 ms.
[2024-05-22 20:35:04] [INFO ] After 3966ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2011 ms.
Support contains 1 out of 476 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 476/476 places, 453/453 transitions.
Applied a total of 0 rules in 26 ms. Remains 476 /476 variables (removed 0) and now considering 453/453 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 476/476 places, 453/453 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 476/476 places, 453/453 transitions.
Applied a total of 0 rules in 30 ms. Remains 476 /476 variables (removed 0) and now considering 453/453 (removed 0) transitions.
[2024-05-22 20:35:06] [INFO ] Invariant cache hit.
[2024-05-22 20:35:09] [INFO ] Implicit Places using invariants in 2382 ms returned [15, 20, 45, 51, 71, 76, 97, 102, 122, 128, 149, 154, 155, 175, 180, 201, 207, 214, 228, 233, 256, 262, 284, 289, 309, 314, 335, 340, 361, 367, 388, 390, 394, 414, 420, 442, 447, 451, 468, 474]
Discarding 40 places :
Implicit Place search using SMT only with invariants took 2384 ms to find 40 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 436/476 places, 453/453 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 435 transition count 452
Free-agglomeration rule (complex) applied 20 times.
Iterating global reduction 0 with 20 rules applied. Total rules applied 22 place count 435 transition count 432
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 42 place count 415 transition count 432
Applied a total of 42 rules in 54 ms. Remains 415 /436 variables (removed 21) and now considering 432/453 (removed 21) transitions.
// Phase 1: matrix 432 rows 415 cols
[2024-05-22 20:35:09] [INFO ] Invariants computation overflowed in 65 ms
[2024-05-22 20:35:09] [INFO ] Implicit Places using invariants in 494 ms returned []
// Phase 1: matrix 432 rows 415 cols
[2024-05-22 20:35:09] [INFO ] Invariants computation overflowed in 45 ms
[2024-05-22 20:35:10] [INFO ] State equation strengthened by 78 read => feed constraints.
TIME LIMIT: Killed by timeout after 1800 seconds
MemTotal: 16393216 kB
MemFree: 13862304 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16097748 kB

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ StableMarking = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution StableMarking -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination StableMarking -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800

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="DoubleExponent-PT-020"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="gold2023"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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-5568"
echo " Executing tool gold2023"
echo " Input is DoubleExponent-PT-020, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r154-tall-171631152600353"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DoubleExponent-PT-020.tgz
mv DoubleExponent-PT-020 execution
cd execution
if [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "UpperBounds" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] || [ "StableMarking" = "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 [ "StableMarking" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "StableMarking" != "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 "StableMarking.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property StableMarking.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "StableMarking.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 '' StableMarking.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] ; then
echo "FORMULA_NAME StableMarking"
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 ;