About the Execution of ITS-Tools for ShieldRVs-PT-040B
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
16219.231 | 3600000.00 | 10248307.00 | 283259.00 | FTFFTFFTT?FT?TFT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2023-input.r421-tajo-167905974800143.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
......................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is ShieldRVs-PT-040B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r421-tajo-167905974800143
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1012K
-rw-r--r-- 1 mcc users 8.5K Feb 26 18:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 97K Feb 26 18:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 26 18:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 26 18:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 17:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 18:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 144K Feb 26 18:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Feb 26 18:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Feb 26 18:23 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:02 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:02 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 498K Mar 5 18:23 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldRVs-PT-040B-ReachabilityFireability-00
FORMULA_NAME ShieldRVs-PT-040B-ReachabilityFireability-01
FORMULA_NAME ShieldRVs-PT-040B-ReachabilityFireability-02
FORMULA_NAME ShieldRVs-PT-040B-ReachabilityFireability-03
FORMULA_NAME ShieldRVs-PT-040B-ReachabilityFireability-04
FORMULA_NAME ShieldRVs-PT-040B-ReachabilityFireability-05
FORMULA_NAME ShieldRVs-PT-040B-ReachabilityFireability-06
FORMULA_NAME ShieldRVs-PT-040B-ReachabilityFireability-07
FORMULA_NAME ShieldRVs-PT-040B-ReachabilityFireability-08
FORMULA_NAME ShieldRVs-PT-040B-ReachabilityFireability-09
FORMULA_NAME ShieldRVs-PT-040B-ReachabilityFireability-10
FORMULA_NAME ShieldRVs-PT-040B-ReachabilityFireability-11
FORMULA_NAME ShieldRVs-PT-040B-ReachabilityFireability-12
FORMULA_NAME ShieldRVs-PT-040B-ReachabilityFireability-13
FORMULA_NAME ShieldRVs-PT-040B-ReachabilityFireability-14
FORMULA_NAME ShieldRVs-PT-040B-ReachabilityFireability-15
=== Now, execution of the tool begins
BK_START 1679167072723
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=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVs-PT-040B
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202303021504
[2023-03-18 19:17:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-18 19:17:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 19:17:55] [INFO ] Load time of PNML (sax parser for PT used): 151 ms
[2023-03-18 19:17:55] [INFO ] Transformed 1603 places.
[2023-03-18 19:17:55] [INFO ] Transformed 1803 transitions.
[2023-03-18 19:17:55] [INFO ] Found NUPN structural information;
[2023-03-18 19:17:55] [INFO ] Parsed PT model containing 1603 places and 1803 transitions and 5760 arcs in 300 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 5 resets, run finished after 622 ms. (steps per millisecond=16 ) properties (out of 16) seen :8
FORMULA ShieldRVs-PT-040B-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040B-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040B-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040B-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040B-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040B-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040B-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040B-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 8) seen :0
[2023-03-18 19:17:56] [INFO ] Flatten gal took : 433 ms
Running SMT prover for 8 properties.
// Phase 1: matrix 1803 rows 1603 cols
[2023-03-18 19:17:56] [INFO ] Flatten gal took : 120 ms
[2023-03-18 19:17:56] [INFO ] Computed 161 place invariants in 50 ms
[2023-03-18 19:17:56] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13217768252127765845.gal : 109 ms
[2023-03-18 19:17:56] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5677685401309573314.prop : 9 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.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality13217768252127765845.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5677685401309573314.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.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality5677685401309573314.prop.
[2023-03-18 19:17:57] [INFO ] After 957ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :36 after 190
SDD proceeding with computation,8 properties remain. new max is 128
SDD size :190 after 996682
SDD proceeding with computation,8 properties remain. new max is 256
SDD size :996682 after 3.66946e+14
[2023-03-18 19:17:58] [INFO ] [Nat]Absence check using 161 positive place invariants in 105 ms returned sat
SDD proceeding with computation,8 properties remain. new max is 512
SDD size :3.66946e+14 after 9.40443e+31
[2023-03-18 19:18:02] [INFO ] After 3954ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-18 19:18:04] [INFO ] Deduced a trap composed of 24 places in 1929 ms of which 7 ms to minimize.
[2023-03-18 19:18:05] [INFO ] Deduced a trap composed of 39 places in 449 ms of which 2 ms to minimize.
[2023-03-18 19:18:06] [INFO ] Deduced a trap composed of 26 places in 1121 ms of which 3 ms to minimize.
[2023-03-18 19:18:07] [INFO ] Deduced a trap composed of 23 places in 895 ms of which 6 ms to minimize.
[2023-03-18 19:18:08] [INFO ] Deduced a trap composed of 37 places in 623 ms of which 2 ms to minimize.
[2023-03-18 19:18:08] [INFO ] Deduced a trap composed of 32 places in 384 ms of which 1 ms to minimize.
[2023-03-18 19:18:09] [INFO ] Deduced a trap composed of 32 places in 367 ms of which 2 ms to minimize.
[2023-03-18 19:18:09] [INFO ] Deduced a trap composed of 34 places in 406 ms of which 1 ms to minimize.
[2023-03-18 19:18:10] [INFO ] Deduced a trap composed of 39 places in 379 ms of which 1 ms to minimize.
[2023-03-18 19:18:10] [INFO ] Deduced a trap composed of 24 places in 362 ms of which 1 ms to minimize.
[2023-03-18 19:18:10] [INFO ] Deduced a trap composed of 25 places in 359 ms of which 2 ms to minimize.
[2023-03-18 19:18:11] [INFO ] Deduced a trap composed of 37 places in 363 ms of which 1 ms to minimize.
[2023-03-18 19:18:11] [INFO ] Deduced a trap composed of 51 places in 433 ms of which 1 ms to minimize.
[2023-03-18 19:18:12] [INFO ] Deduced a trap composed of 45 places in 488 ms of which 1 ms to minimize.
[2023-03-18 19:18:13] [INFO ] Deduced a trap composed of 36 places in 488 ms of which 1 ms to minimize.
[2023-03-18 19:18:13] [INFO ] Deduced a trap composed of 22 places in 482 ms of which 2 ms to minimize.
[2023-03-18 19:18:14] [INFO ] Deduced a trap composed of 26 places in 517 ms of which 1 ms to minimize.
[2023-03-18 19:18:14] [INFO ] Deduced a trap composed of 38 places in 465 ms of which 1 ms to minimize.
[2023-03-18 19:18:15] [INFO ] Deduced a trap composed of 37 places in 462 ms of which 1 ms to minimize.
[2023-03-18 19:18:15] [INFO ] Deduced a trap composed of 32 places in 536 ms of which 0 ms to minimize.
[2023-03-18 19:18:16] [INFO ] Deduced a trap composed of 34 places in 308 ms of which 0 ms to minimize.
[2023-03-18 19:18:16] [INFO ] Deduced a trap composed of 37 places in 312 ms of which 1 ms to minimize.
[2023-03-18 19:18:17] [INFO ] Deduced a trap composed of 61 places in 305 ms of which 0 ms to minimize.
[2023-03-18 19:18:17] [INFO ] Deduced a trap composed of 47 places in 406 ms of which 1 ms to minimize.
[2023-03-18 19:18:17] [INFO ] Deduced a trap composed of 36 places in 401 ms of which 1 ms to minimize.
[2023-03-18 19:18:18] [INFO ] Deduced a trap composed of 49 places in 603 ms of which 1 ms to minimize.
[2023-03-18 19:18:18] [INFO ] Deduced a trap composed of 40 places in 277 ms of which 5 ms to minimize.
[2023-03-18 19:18:19] [INFO ] Deduced a trap composed of 59 places in 316 ms of which 1 ms to minimize.
[2023-03-18 19:18:19] [INFO ] Deduced a trap composed of 32 places in 283 ms of which 1 ms to minimize.
[2023-03-18 19:18:20] [INFO ] Deduced a trap composed of 29 places in 305 ms of which 1 ms to minimize.
[2023-03-18 19:18:20] [INFO ] Deduced a trap composed of 39 places in 280 ms of which 1 ms to minimize.
[2023-03-18 19:18:20] [INFO ] Deduced a trap composed of 45 places in 304 ms of which 1 ms to minimize.
[2023-03-18 19:18:21] [INFO ] Deduced a trap composed of 31 places in 294 ms of which 1 ms to minimize.
[2023-03-18 19:18:21] [INFO ] Deduced a trap composed of 40 places in 454 ms of which 5 ms to minimize.
[2023-03-18 19:18:22] [INFO ] Deduced a trap composed of 37 places in 418 ms of which 1 ms to minimize.
[2023-03-18 19:18:22] [INFO ] Deduced a trap composed of 28 places in 374 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-18 19:18:22] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 19:18:22] [INFO ] After 25077ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:8
FORMULA ShieldRVs-PT-040B-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 427 ms.
Support contains 157 out of 1603 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1603/1603 places, 1803/1803 transitions.
Drop transitions removed 130 transitions
Trivial Post-agglo rules discarded 130 transitions
Performed 130 trivial Post agglomeration. Transition count delta: 130
Iterating post reduction 0 with 130 rules applied. Total rules applied 130 place count 1603 transition count 1673
Reduce places removed 130 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 134 rules applied. Total rules applied 264 place count 1473 transition count 1669
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 268 place count 1469 transition count 1669
Performed 191 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 191 Pre rules applied. Total rules applied 268 place count 1469 transition count 1478
Deduced a syphon composed of 191 places in 8 ms
Reduce places removed 191 places and 0 transitions.
Iterating global reduction 3 with 382 rules applied. Total rules applied 650 place count 1278 transition count 1478
Discarding 243 places :
Symmetric choice reduction at 3 with 243 rule applications. Total rules 893 place count 1035 transition count 1235
Iterating global reduction 3 with 243 rules applied. Total rules applied 1136 place count 1035 transition count 1235
Performed 73 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 73 Pre rules applied. Total rules applied 1136 place count 1035 transition count 1162
Deduced a syphon composed of 73 places in 2 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 3 with 146 rules applied. Total rules applied 1282 place count 962 transition count 1162
Performed 252 Post agglomeration using F-continuation condition.Transition count delta: 252
Deduced a syphon composed of 252 places in 3 ms
Reduce places removed 252 places and 0 transitions.
Iterating global reduction 3 with 504 rules applied. Total rules applied 1786 place count 710 transition count 910
Partial Free-agglomeration rule applied 70 times.
Drop transitions removed 70 transitions
Iterating global reduction 3 with 70 rules applied. Total rules applied 1856 place count 710 transition count 910
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1857 place count 709 transition count 909
Applied a total of 1857 rules in 732 ms. Remains 709 /1603 variables (removed 894) and now considering 909/1803 (removed 894) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 732 ms. Remains : 709/1603 places, 909/1803 transitions.
Incomplete random walk after 10000 steps, including 14 resets, run finished after 303 ms. (steps per millisecond=33 ) properties (out of 7) seen :3
FORMULA ShieldRVs-PT-040B-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040B-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040B-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 909 rows 709 cols
[2023-03-18 19:18:24] [INFO ] Computed 161 place invariants in 3 ms
[2023-03-18 19:18:24] [INFO ] After 214ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-18 19:18:24] [INFO ] [Nat]Absence check using 161 positive place invariants in 29 ms returned sat
[2023-03-18 19:18:25] [INFO ] After 745ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-18 19:18:25] [INFO ] Deduced a trap composed of 12 places in 186 ms of which 1 ms to minimize.
[2023-03-18 19:18:26] [INFO ] Deduced a trap composed of 12 places in 155 ms of which 1 ms to minimize.
[2023-03-18 19:18:26] [INFO ] Deduced a trap composed of 9 places in 147 ms of which 0 ms to minimize.
[2023-03-18 19:18:26] [INFO ] Deduced a trap composed of 8 places in 151 ms of which 2 ms to minimize.
[2023-03-18 19:18:26] [INFO ] Deduced a trap composed of 9 places in 149 ms of which 1 ms to minimize.
[2023-03-18 19:18:26] [INFO ] Deduced a trap composed of 12 places in 145 ms of which 1 ms to minimize.
[2023-03-18 19:18:27] [INFO ] Deduced a trap composed of 10 places in 149 ms of which 0 ms to minimize.
[2023-03-18 19:18:27] [INFO ] Deduced a trap composed of 6 places in 144 ms of which 0 ms to minimize.
[2023-03-18 19:18:27] [INFO ] Deduced a trap composed of 6 places in 150 ms of which 0 ms to minimize.
[2023-03-18 19:18:27] [INFO ] Deduced a trap composed of 9 places in 169 ms of which 1 ms to minimize.
[2023-03-18 19:18:27] [INFO ] Deduced a trap composed of 11 places in 157 ms of which 0 ms to minimize.
[2023-03-18 19:18:28] [INFO ] Deduced a trap composed of 9 places in 146 ms of which 1 ms to minimize.
[2023-03-18 19:18:28] [INFO ] Deduced a trap composed of 8 places in 142 ms of which 1 ms to minimize.
[2023-03-18 19:18:28] [INFO ] Deduced a trap composed of 16 places in 152 ms of which 4 ms to minimize.
[2023-03-18 19:18:28] [INFO ] Deduced a trap composed of 9 places in 174 ms of which 0 ms to minimize.
[2023-03-18 19:18:28] [INFO ] Deduced a trap composed of 11 places in 138 ms of which 1 ms to minimize.
[2023-03-18 19:18:29] [INFO ] Deduced a trap composed of 10 places in 119 ms of which 1 ms to minimize.
[2023-03-18 19:18:29] [INFO ] Deduced a trap composed of 12 places in 125 ms of which 1 ms to minimize.
[2023-03-18 19:18:29] [INFO ] Deduced a trap composed of 16 places in 101 ms of which 1 ms to minimize.
[2023-03-18 19:18:29] [INFO ] Deduced a trap composed of 17 places in 112 ms of which 10 ms to minimize.
[2023-03-18 19:18:29] [INFO ] Deduced a trap composed of 18 places in 95 ms of which 3 ms to minimize.
[2023-03-18 19:18:29] [INFO ] Deduced a trap composed of 16 places in 94 ms of which 1 ms to minimize.
[2023-03-18 19:18:29] [INFO ] Deduced a trap composed of 12 places in 107 ms of which 0 ms to minimize.
[2023-03-18 19:18:30] [INFO ] Deduced a trap composed of 11 places in 90 ms of which 1 ms to minimize.
[2023-03-18 19:18:30] [INFO ] Deduced a trap composed of 11 places in 90 ms of which 1 ms to minimize.
[2023-03-18 19:18:30] [INFO ] Deduced a trap composed of 13 places in 90 ms of which 0 ms to minimize.
[2023-03-18 19:18:30] [INFO ] Deduced a trap composed of 13 places in 84 ms of which 0 ms to minimize.
[2023-03-18 19:18:30] [INFO ] Deduced a trap composed of 13 places in 88 ms of which 1 ms to minimize.
[2023-03-18 19:18:30] [INFO ] Deduced a trap composed of 14 places in 84 ms of which 0 ms to minimize.
[2023-03-18 19:18:30] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 2 ms to minimize.
[2023-03-18 19:18:31] [INFO ] Deduced a trap composed of 10 places in 138 ms of which 1 ms to minimize.
[2023-03-18 19:18:31] [INFO ] Deduced a trap composed of 9 places in 144 ms of which 9 ms to minimize.
[2023-03-18 19:18:31] [INFO ] Deduced a trap composed of 12 places in 108 ms of which 2 ms to minimize.
[2023-03-18 19:18:31] [INFO ] Deduced a trap composed of 14 places in 102 ms of which 1 ms to minimize.
[2023-03-18 19:18:31] [INFO ] Deduced a trap composed of 14 places in 113 ms of which 0 ms to minimize.
[2023-03-18 19:18:31] [INFO ] Trap strengthening (SAT) tested/added 36/35 trap constraints in 5925 ms
[2023-03-18 19:18:31] [INFO ] Deduced a trap composed of 15 places in 163 ms of which 0 ms to minimize.
[2023-03-18 19:18:32] [INFO ] Deduced a trap composed of 11 places in 195 ms of which 1 ms to minimize.
[2023-03-18 19:18:32] [INFO ] Deduced a trap composed of 11 places in 99 ms of which 0 ms to minimize.
[2023-03-18 19:18:32] [INFO ] Deduced a trap composed of 12 places in 109 ms of which 1 ms to minimize.
[2023-03-18 19:18:32] [INFO ] Deduced a trap composed of 12 places in 93 ms of which 0 ms to minimize.
[2023-03-18 19:18:32] [INFO ] Deduced a trap composed of 20 places in 93 ms of which 1 ms to minimize.
[2023-03-18 19:18:32] [INFO ] Deduced a trap composed of 16 places in 100 ms of which 0 ms to minimize.
[2023-03-18 19:18:33] [INFO ] Deduced a trap composed of 12 places in 98 ms of which 1 ms to minimize.
[2023-03-18 19:18:33] [INFO ] Deduced a trap composed of 16 places in 92 ms of which 0 ms to minimize.
[2023-03-18 19:18:33] [INFO ] Deduced a trap composed of 13 places in 93 ms of which 0 ms to minimize.
[2023-03-18 19:18:33] [INFO ] Deduced a trap composed of 18 places in 85 ms of which 2 ms to minimize.
[2023-03-18 19:18:33] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 1 ms to minimize.
[2023-03-18 19:18:33] [INFO ] Deduced a trap composed of 16 places in 87 ms of which 1 ms to minimize.
[2023-03-18 19:18:33] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 2054 ms
[2023-03-18 19:18:34] [INFO ] Deduced a trap composed of 6 places in 84 ms of which 1 ms to minimize.
[2023-03-18 19:18:34] [INFO ] Deduced a trap composed of 8 places in 113 ms of which 1 ms to minimize.
[2023-03-18 19:18:34] [INFO ] Deduced a trap composed of 14 places in 104 ms of which 0 ms to minimize.
[2023-03-18 19:18:34] [INFO ] Deduced a trap composed of 10 places in 83 ms of which 0 ms to minimize.
[2023-03-18 19:18:34] [INFO ] Deduced a trap composed of 8 places in 150 ms of which 0 ms to minimize.
[2023-03-18 19:18:34] [INFO ] Deduced a trap composed of 10 places in 104 ms of which 0 ms to minimize.
[2023-03-18 19:18:34] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 1 ms to minimize.
[2023-03-18 19:18:35] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 1 ms to minimize.
[2023-03-18 19:18:35] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 0 ms to minimize.
[2023-03-18 19:18:35] [INFO ] Deduced a trap composed of 10 places in 61 ms of which 1 ms to minimize.
[2023-03-18 19:18:35] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 1 ms to minimize.
[2023-03-18 19:18:35] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 1 ms to minimize.
[2023-03-18 19:18:35] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 0 ms to minimize.
[2023-03-18 19:18:35] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 1 ms to minimize.
[2023-03-18 19:18:35] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 0 ms to minimize.
[2023-03-18 19:18:35] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 1948 ms
[2023-03-18 19:18:36] [INFO ] Deduced a trap composed of 15 places in 124 ms of which 1 ms to minimize.
[2023-03-18 19:18:36] [INFO ] Deduced a trap composed of 12 places in 136 ms of which 0 ms to minimize.
[2023-03-18 19:18:36] [INFO ] Deduced a trap composed of 9 places in 144 ms of which 1 ms to minimize.
[2023-03-18 19:18:36] [INFO ] Deduced a trap composed of 10 places in 140 ms of which 1 ms to minimize.
[2023-03-18 19:18:36] [INFO ] Deduced a trap composed of 8 places in 145 ms of which 1 ms to minimize.
[2023-03-18 19:18:37] [INFO ] Deduced a trap composed of 13 places in 131 ms of which 1 ms to minimize.
[2023-03-18 19:18:37] [INFO ] Deduced a trap composed of 14 places in 121 ms of which 0 ms to minimize.
[2023-03-18 19:18:37] [INFO ] Deduced a trap composed of 16 places in 133 ms of which 0 ms to minimize.
[2023-03-18 19:18:37] [INFO ] Deduced a trap composed of 17 places in 111 ms of which 0 ms to minimize.
[2023-03-18 19:18:37] [INFO ] Deduced a trap composed of 16 places in 109 ms of which 1 ms to minimize.
[2023-03-18 19:18:37] [INFO ] Deduced a trap composed of 15 places in 136 ms of which 1 ms to minimize.
[2023-03-18 19:18:38] [INFO ] Deduced a trap composed of 10 places in 108 ms of which 1 ms to minimize.
[2023-03-18 19:18:38] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 2001 ms
[2023-03-18 19:18:38] [INFO ] After 13363ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 613 ms.
[2023-03-18 19:18:38] [INFO ] After 14162ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 132 ms.
Support contains 151 out of 709 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 709/709 places, 909/909 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 709 transition count 907
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 707 transition count 907
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 707 transition count 906
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 706 transition count 906
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 16 place count 701 transition count 901
Applied a total of 16 rules in 106 ms. Remains 701 /709 variables (removed 8) and now considering 901/909 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 107 ms. Remains : 701/709 places, 901/909 transitions.
Incomplete random walk after 10000 steps, including 14 resets, run finished after 345 ms. (steps per millisecond=28 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 140633 steps, run timeout after 3001 ms. (steps per millisecond=46 ) properties seen :{}
Probabilistic random walk after 140633 steps, saw 38479 distinct states, run finished after 3007 ms. (steps per millisecond=46 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 901 rows 701 cols
[2023-03-18 19:18:42] [INFO ] Computed 161 place invariants in 5 ms
[2023-03-18 19:18:42] [INFO ] After 201ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-18 19:18:43] [INFO ] [Nat]Absence check using 161 positive place invariants in 39 ms returned sat
[2023-03-18 19:18:44] [INFO ] After 1036ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-18 19:18:44] [INFO ] Deduced a trap composed of 5 places in 136 ms of which 1 ms to minimize.
[2023-03-18 19:18:44] [INFO ] Deduced a trap composed of 11 places in 122 ms of which 1 ms to minimize.
[2023-03-18 19:18:44] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 1 ms to minimize.
[2023-03-18 19:18:45] [INFO ] Deduced a trap composed of 12 places in 174 ms of which 1 ms to minimize.
[2023-03-18 19:18:45] [INFO ] Deduced a trap composed of 7 places in 180 ms of which 1 ms to minimize.
[2023-03-18 19:18:45] [INFO ] Deduced a trap composed of 10 places in 172 ms of which 1 ms to minimize.
[2023-03-18 19:18:45] [INFO ] Deduced a trap composed of 8 places in 117 ms of which 1 ms to minimize.
[2023-03-18 19:18:48] [INFO ] Deduced a trap composed of 11 places in 3119 ms of which 1 ms to minimize.
[2023-03-18 19:18:48] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 1 ms to minimize.
[2023-03-18 19:18:49] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 1 ms to minimize.
[2023-03-18 19:18:49] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 1 ms to minimize.
[2023-03-18 19:18:49] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 0 ms to minimize.
[2023-03-18 19:18:49] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 1 ms to minimize.
[2023-03-18 19:18:49] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 0 ms to minimize.
[2023-03-18 19:18:49] [INFO ] Deduced a trap composed of 16 places in 86 ms of which 0 ms to minimize.
[2023-03-18 19:18:49] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 0 ms to minimize.
[2023-03-18 19:18:50] [INFO ] Deduced a trap composed of 11 places in 89 ms of which 0 ms to minimize.
[2023-03-18 19:18:50] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 1 ms to minimize.
[2023-03-18 19:18:50] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 1 ms to minimize.
[2023-03-18 19:18:50] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 6093 ms
[2023-03-18 19:18:50] [INFO ] Deduced a trap composed of 13 places in 115 ms of which 0 ms to minimize.
[2023-03-18 19:18:50] [INFO ] Deduced a trap composed of 12 places in 114 ms of which 0 ms to minimize.
[2023-03-18 19:18:51] [INFO ] Deduced a trap composed of 11 places in 98 ms of which 1 ms to minimize.
[2023-03-18 19:18:51] [INFO ] Deduced a trap composed of 12 places in 95 ms of which 0 ms to minimize.
[2023-03-18 19:18:51] [INFO ] Deduced a trap composed of 7 places in 97 ms of which 1 ms to minimize.
[2023-03-18 19:18:51] [INFO ] Deduced a trap composed of 18 places in 120 ms of which 0 ms to minimize.
[2023-03-18 19:18:51] [INFO ] Deduced a trap composed of 21 places in 79 ms of which 1 ms to minimize.
[2023-03-18 19:18:51] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 0 ms to minimize.
[2023-03-18 19:18:51] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 0 ms to minimize.
[2023-03-18 19:18:51] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1449 ms
[2023-03-18 19:18:52] [INFO ] Deduced a trap composed of 8 places in 130 ms of which 1 ms to minimize.
[2023-03-18 19:18:52] [INFO ] Deduced a trap composed of 15 places in 109 ms of which 3 ms to minimize.
[2023-03-18 19:18:52] [INFO ] Deduced a trap composed of 15 places in 113 ms of which 0 ms to minimize.
[2023-03-18 19:18:52] [INFO ] Deduced a trap composed of 9 places in 109 ms of which 1 ms to minimize.
[2023-03-18 19:18:53] [INFO ] Deduced a trap composed of 11 places in 97 ms of which 1 ms to minimize.
[2023-03-18 19:18:53] [INFO ] Deduced a trap composed of 14 places in 96 ms of which 1 ms to minimize.
[2023-03-18 19:18:53] [INFO ] Deduced a trap composed of 15 places in 121 ms of which 1 ms to minimize.
[2023-03-18 19:18:53] [INFO ] Deduced a trap composed of 16 places in 87 ms of which 1 ms to minimize.
[2023-03-18 19:18:53] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 1 ms to minimize.
[2023-03-18 19:18:53] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 0 ms to minimize.
[2023-03-18 19:18:53] [INFO ] Deduced a trap composed of 15 places in 93 ms of which 1 ms to minimize.
[2023-03-18 19:18:54] [INFO ] Deduced a trap composed of 18 places in 103 ms of which 0 ms to minimize.
[2023-03-18 19:18:54] [INFO ] Deduced a trap composed of 10 places in 77 ms of which 1 ms to minimize.
[2023-03-18 19:18:54] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 1 ms to minimize.
[2023-03-18 19:18:54] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 2137 ms
[2023-03-18 19:18:54] [INFO ] Deduced a trap composed of 6 places in 183 ms of which 1 ms to minimize.
[2023-03-18 19:18:55] [INFO ] Deduced a trap composed of 12 places in 171 ms of which 1 ms to minimize.
[2023-03-18 19:18:55] [INFO ] Deduced a trap composed of 11 places in 174 ms of which 1 ms to minimize.
[2023-03-18 19:18:55] [INFO ] Deduced a trap composed of 11 places in 126 ms of which 0 ms to minimize.
[2023-03-18 19:18:55] [INFO ] Deduced a trap composed of 10 places in 203 ms of which 1 ms to minimize.
[2023-03-18 19:18:55] [INFO ] Deduced a trap composed of 18 places in 144 ms of which 0 ms to minimize.
[2023-03-18 19:18:56] [INFO ] Deduced a trap composed of 18 places in 169 ms of which 1 ms to minimize.
[2023-03-18 19:18:56] [INFO ] Deduced a trap composed of 11 places in 168 ms of which 0 ms to minimize.
[2023-03-18 19:18:56] [INFO ] Deduced a trap composed of 15 places in 173 ms of which 1 ms to minimize.
[2023-03-18 19:18:56] [INFO ] Deduced a trap composed of 8 places in 139 ms of which 1 ms to minimize.
[2023-03-18 19:18:56] [INFO ] Deduced a trap composed of 13 places in 157 ms of which 1 ms to minimize.
[2023-03-18 19:18:56] [INFO ] Deduced a trap composed of 15 places in 98 ms of which 0 ms to minimize.
[2023-03-18 19:18:57] [INFO ] Deduced a trap composed of 8 places in 128 ms of which 0 ms to minimize.
[2023-03-18 19:18:57] [INFO ] Deduced a trap composed of 10 places in 149 ms of which 1 ms to minimize.
[2023-03-18 19:18:57] [INFO ] Deduced a trap composed of 16 places in 128 ms of which 1 ms to minimize.
[2023-03-18 19:18:57] [INFO ] Deduced a trap composed of 9 places in 128 ms of which 1 ms to minimize.
[2023-03-18 19:18:57] [INFO ] Deduced a trap composed of 17 places in 138 ms of which 1 ms to minimize.
[2023-03-18 19:18:58] [INFO ] Deduced a trap composed of 12 places in 123 ms of which 1 ms to minimize.
[2023-03-18 19:18:58] [INFO ] Deduced a trap composed of 19 places in 132 ms of which 1 ms to minimize.
[2023-03-18 19:18:58] [INFO ] Deduced a trap composed of 11 places in 115 ms of which 0 ms to minimize.
[2023-03-18 19:18:58] [INFO ] Deduced a trap composed of 21 places in 142 ms of which 0 ms to minimize.
[2023-03-18 19:18:58] [INFO ] Deduced a trap composed of 10 places in 142 ms of which 1 ms to minimize.
[2023-03-18 19:18:58] [INFO ] Deduced a trap composed of 11 places in 116 ms of which 0 ms to minimize.
[2023-03-18 19:18:59] [INFO ] Deduced a trap composed of 16 places in 144 ms of which 1 ms to minimize.
[2023-03-18 19:18:59] [INFO ] Deduced a trap composed of 16 places in 115 ms of which 1 ms to minimize.
[2023-03-18 19:18:59] [INFO ] Deduced a trap composed of 15 places in 113 ms of which 1 ms to minimize.
[2023-03-18 19:18:59] [INFO ] Deduced a trap composed of 21 places in 112 ms of which 1 ms to minimize.
[2023-03-18 19:18:59] [INFO ] Trap strengthening (SAT) tested/added 28/27 trap constraints in 4968 ms
[2023-03-18 19:18:59] [INFO ] After 16464ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 737 ms.
[2023-03-18 19:19:00] [INFO ] After 17460ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 100 ms.
Support contains 151 out of 701 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 701/701 places, 901/901 transitions.
Applied a total of 0 rules in 20 ms. Remains 701 /701 variables (removed 0) and now considering 901/901 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 701/701 places, 901/901 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 701/701 places, 901/901 transitions.
Applied a total of 0 rules in 46 ms. Remains 701 /701 variables (removed 0) and now considering 901/901 (removed 0) transitions.
[2023-03-18 19:19:00] [INFO ] Invariant cache hit.
[2023-03-18 19:19:01] [INFO ] Implicit Places using invariants in 481 ms returned []
[2023-03-18 19:19:01] [INFO ] Invariant cache hit.
[2023-03-18 19:19:01] [INFO ] Implicit Places using invariants and state equation in 568 ms returned []
Implicit Place search using SMT with State Equation took 1064 ms to find 0 implicit places.
[2023-03-18 19:19:01] [INFO ] Redundant transitions in 167 ms returned []
[2023-03-18 19:19:01] [INFO ] Invariant cache hit.
[2023-03-18 19:19:02] [INFO ] Dead Transitions using invariants and state equation in 576 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1874 ms. Remains : 701/701 places, 901/901 transitions.
Applied a total of 0 rules in 18 ms. Remains 701 /701 variables (removed 0) and now considering 901/901 (removed 0) transitions.
Running SMT prover for 4 properties.
[2023-03-18 19:19:02] [INFO ] Invariant cache hit.
[2023-03-18 19:19:02] [INFO ] After 249ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-18 19:19:02] [INFO ] [Nat]Absence check using 161 positive place invariants in 20 ms returned sat
[2023-03-18 19:19:03] [INFO ] After 759ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-18 19:19:03] [INFO ] Deduced a trap composed of 10 places in 205 ms of which 1 ms to minimize.
[2023-03-18 19:19:04] [INFO ] Deduced a trap composed of 7 places in 188 ms of which 1 ms to minimize.
[2023-03-18 19:19:04] [INFO ] Deduced a trap composed of 11 places in 175 ms of which 0 ms to minimize.
[2023-03-18 19:19:04] [INFO ] Deduced a trap composed of 7 places in 216 ms of which 1 ms to minimize.
[2023-03-18 19:19:04] [INFO ] Deduced a trap composed of 8 places in 173 ms of which 0 ms to minimize.
[2023-03-18 19:19:05] [INFO ] Deduced a trap composed of 9 places in 173 ms of which 0 ms to minimize.
[2023-03-18 19:19:05] [INFO ] Deduced a trap composed of 7 places in 184 ms of which 0 ms to minimize.
[2023-03-18 19:19:05] [INFO ] Deduced a trap composed of 12 places in 172 ms of which 0 ms to minimize.
[2023-03-18 19:19:05] [INFO ] Deduced a trap composed of 8 places in 153 ms of which 0 ms to minimize.
[2023-03-18 19:19:05] [INFO ] Deduced a trap composed of 10 places in 135 ms of which 1 ms to minimize.
[2023-03-18 19:19:06] [INFO ] Deduced a trap composed of 8 places in 146 ms of which 0 ms to minimize.
[2023-03-18 19:19:06] [INFO ] Deduced a trap composed of 13 places in 152 ms of which 0 ms to minimize.
[2023-03-18 19:19:06] [INFO ] Deduced a trap composed of 11 places in 148 ms of which 1 ms to minimize.
[2023-03-18 19:19:06] [INFO ] Deduced a trap composed of 12 places in 139 ms of which 0 ms to minimize.
[2023-03-18 19:19:06] [INFO ] Deduced a trap composed of 15 places in 114 ms of which 0 ms to minimize.
[2023-03-18 19:19:06] [INFO ] Deduced a trap composed of 13 places in 144 ms of which 0 ms to minimize.
[2023-03-18 19:19:07] [INFO ] Deduced a trap composed of 10 places in 117 ms of which 0 ms to minimize.
[2023-03-18 19:19:07] [INFO ] Deduced a trap composed of 16 places in 116 ms of which 0 ms to minimize.
[2023-03-18 19:19:07] [INFO ] Deduced a trap composed of 12 places in 113 ms of which 1 ms to minimize.
[2023-03-18 19:19:07] [INFO ] Deduced a trap composed of 14 places in 104 ms of which 0 ms to minimize.
[2023-03-18 19:19:07] [INFO ] Deduced a trap composed of 8 places in 103 ms of which 0 ms to minimize.
[2023-03-18 19:19:07] [INFO ] Deduced a trap composed of 16 places in 94 ms of which 1 ms to minimize.
[2023-03-18 19:19:07] [INFO ] Deduced a trap composed of 13 places in 84 ms of which 1 ms to minimize.
[2023-03-18 19:19:08] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 1 ms to minimize.
[2023-03-18 19:19:08] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 0 ms to minimize.
[2023-03-18 19:19:08] [INFO ] Deduced a trap composed of 12 places in 73 ms of which 1 ms to minimize.
[2023-03-18 19:19:08] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 0 ms to minimize.
[2023-03-18 19:19:08] [INFO ] Deduced a trap composed of 8 places in 69 ms of which 1 ms to minimize.
[2023-03-18 19:19:08] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 1 ms to minimize.
[2023-03-18 19:19:08] [INFO ] Trap strengthening (SAT) tested/added 30/29 trap constraints in 4954 ms
[2023-03-18 19:19:08] [INFO ] Deduced a trap composed of 13 places in 116 ms of which 0 ms to minimize.
[2023-03-18 19:19:08] [INFO ] Deduced a trap composed of 10 places in 94 ms of which 0 ms to minimize.
[2023-03-18 19:19:09] [INFO ] Deduced a trap composed of 14 places in 87 ms of which 0 ms to minimize.
[2023-03-18 19:19:09] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 0 ms to minimize.
[2023-03-18 19:19:09] [INFO ] Deduced a trap composed of 8 places in 102 ms of which 1 ms to minimize.
[2023-03-18 19:19:09] [INFO ] Deduced a trap composed of 15 places in 113 ms of which 0 ms to minimize.
[2023-03-18 19:19:09] [INFO ] Deduced a trap composed of 13 places in 100 ms of which 1 ms to minimize.
[2023-03-18 19:19:09] [INFO ] Deduced a trap composed of 11 places in 110 ms of which 1 ms to minimize.
[2023-03-18 19:19:09] [INFO ] Deduced a trap composed of 11 places in 100 ms of which 1 ms to minimize.
[2023-03-18 19:19:10] [INFO ] Deduced a trap composed of 12 places in 114 ms of which 1 ms to minimize.
[2023-03-18 19:19:10] [INFO ] Deduced a trap composed of 13 places in 85 ms of which 1 ms to minimize.
[2023-03-18 19:19:10] [INFO ] Deduced a trap composed of 18 places in 84 ms of which 0 ms to minimize.
[2023-03-18 19:19:10] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1679 ms
[2023-03-18 19:19:10] [INFO ] Deduced a trap composed of 9 places in 146 ms of which 0 ms to minimize.
[2023-03-18 19:19:10] [INFO ] Deduced a trap composed of 21 places in 111 ms of which 0 ms to minimize.
[2023-03-18 19:19:11] [INFO ] Deduced a trap composed of 14 places in 147 ms of which 1 ms to minimize.
[2023-03-18 19:19:11] [INFO ] Deduced a trap composed of 14 places in 147 ms of which 1 ms to minimize.
[2023-03-18 19:19:11] [INFO ] Deduced a trap composed of 11 places in 120 ms of which 1 ms to minimize.
[2023-03-18 19:19:11] [INFO ] Deduced a trap composed of 11 places in 107 ms of which 1 ms to minimize.
[2023-03-18 19:19:11] [INFO ] Deduced a trap composed of 10 places in 127 ms of which 1 ms to minimize.
[2023-03-18 19:19:12] [INFO ] Deduced a trap composed of 9 places in 964 ms of which 0 ms to minimize.
[2023-03-18 19:19:12] [INFO ] Deduced a trap composed of 13 places in 116 ms of which 5 ms to minimize.
[2023-03-18 19:19:13] [INFO ] Deduced a trap composed of 9 places in 108 ms of which 1 ms to minimize.
[2023-03-18 19:19:13] [INFO ] Deduced a trap composed of 15 places in 91 ms of which 0 ms to minimize.
[2023-03-18 19:19:13] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 2727 ms
[2023-03-18 19:19:13] [INFO ] Deduced a trap composed of 6 places in 286 ms of which 1 ms to minimize.
[2023-03-18 19:19:14] [INFO ] Deduced a trap composed of 5 places in 217 ms of which 1 ms to minimize.
[2023-03-18 19:19:14] [INFO ] Deduced a trap composed of 6 places in 165 ms of which 1 ms to minimize.
[2023-03-18 19:19:14] [INFO ] Deduced a trap composed of 11 places in 237 ms of which 0 ms to minimize.
[2023-03-18 19:19:14] [INFO ] Deduced a trap composed of 14 places in 173 ms of which 1 ms to minimize.
[2023-03-18 19:19:15] [INFO ] Deduced a trap composed of 10 places in 215 ms of which 1 ms to minimize.
[2023-03-18 19:19:15] [INFO ] Deduced a trap composed of 11 places in 160 ms of which 0 ms to minimize.
[2023-03-18 19:19:15] [INFO ] Deduced a trap composed of 12 places in 116 ms of which 0 ms to minimize.
[2023-03-18 19:19:15] [INFO ] Deduced a trap composed of 10 places in 148 ms of which 1 ms to minimize.
[2023-03-18 19:19:15] [INFO ] Deduced a trap composed of 11 places in 151 ms of which 1 ms to minimize.
[2023-03-18 19:19:15] [INFO ] Deduced a trap composed of 8 places in 90 ms of which 1 ms to minimize.
[2023-03-18 19:19:15] [INFO ] Deduced a trap composed of 10 places in 123 ms of which 1 ms to minimize.
[2023-03-18 19:19:16] [INFO ] Deduced a trap composed of 11 places in 168 ms of which 1 ms to minimize.
[2023-03-18 19:19:16] [INFO ] Deduced a trap composed of 12 places in 143 ms of which 0 ms to minimize.
[2023-03-18 19:19:16] [INFO ] Deduced a trap composed of 13 places in 157 ms of which 1 ms to minimize.
[2023-03-18 19:19:16] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 0 ms to minimize.
[2023-03-18 19:19:16] [INFO ] Deduced a trap composed of 9 places in 134 ms of which 1 ms to minimize.
[2023-03-18 19:19:17] [INFO ] Deduced a trap composed of 14 places in 116 ms of which 1 ms to minimize.
[2023-03-18 19:19:17] [INFO ] Deduced a trap composed of 8 places in 125 ms of which 0 ms to minimize.
[2023-03-18 19:19:17] [INFO ] Deduced a trap composed of 10 places in 121 ms of which 1 ms to minimize.
[2023-03-18 19:19:17] [INFO ] Deduced a trap composed of 15 places in 126 ms of which 8 ms to minimize.
[2023-03-18 19:19:17] [INFO ] Deduced a trap composed of 17 places in 114 ms of which 3 ms to minimize.
[2023-03-18 19:19:17] [INFO ] Deduced a trap composed of 17 places in 93 ms of which 0 ms to minimize.
[2023-03-18 19:19:18] [INFO ] Deduced a trap composed of 24 places in 94 ms of which 0 ms to minimize.
[2023-03-18 19:19:18] [INFO ] Deduced a trap composed of 12 places in 78 ms of which 0 ms to minimize.
[2023-03-18 19:19:18] [INFO ] Deduced a trap composed of 18 places in 84 ms of which 0 ms to minimize.
[2023-03-18 19:19:18] [INFO ] Deduced a trap composed of 14 places in 89 ms of which 0 ms to minimize.
[2023-03-18 19:19:18] [INFO ] Deduced a trap composed of 19 places in 85 ms of which 0 ms to minimize.
[2023-03-18 19:19:18] [INFO ] Deduced a trap composed of 14 places in 85 ms of which 0 ms to minimize.
[2023-03-18 19:19:18] [INFO ] Deduced a trap composed of 11 places in 66 ms of which 0 ms to minimize.
[2023-03-18 19:19:18] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 0 ms to minimize.
[2023-03-18 19:19:19] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 0 ms to minimize.
[2023-03-18 19:19:19] [INFO ] Deduced a trap composed of 22 places in 110 ms of which 1 ms to minimize.
[2023-03-18 19:19:19] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2023-03-18 19:19:19] [INFO ] Trap strengthening (SAT) tested/added 35/34 trap constraints in 5987 ms
[2023-03-18 19:19:19] [INFO ] After 16684ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 551 ms.
[2023-03-18 19:19:20] [INFO ] After 17373ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
[2023-03-18 19:19:20] [INFO ] Flatten gal took : 139 ms
[2023-03-18 19:19:20] [INFO ] Flatten gal took : 103 ms
[2023-03-18 19:19:20] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality960058749739702696.gal : 20 ms
[2023-03-18 19:19:20] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9161403306801740336.prop : 1 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.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality960058749739702696.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9161403306801740336.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.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...327
Loading property file /tmp/ReachabilityCardinality9161403306801740336.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :5 after 7
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :7 after 11
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :11 after 67
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :67 after 4099
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :4099 after 1.37626e+06
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :1.37626e+06 after 3.25869e+12
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :1.68579e+21 after 2.81613e+21
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :2.81613e+21 after 2.81613e+21
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :2.81613e+21 after 2.81613e+21
Detected timeout of ITS tools.
[2023-03-18 19:19:35] [INFO ] Flatten gal took : 86 ms
[2023-03-18 19:19:35] [INFO ] Applying decomposition
[2023-03-18 19:19:35] [INFO ] Flatten gal took : 79 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph14927942825528148778.txt' '-o' '/tmp/graph14927942825528148778.bin' '-w' '/tmp/graph14927942825528148778.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph14927942825528148778.bin' '-l' '-1' '-v' '-w' '/tmp/graph14927942825528148778.weights' '-q' '0' '-e' '0.001'
[2023-03-18 19:19:36] [INFO ] Decomposing Gal with order
[2023-03-18 19:19:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 19:19:36] [INFO ] Removed a total of 1086 redundant transitions.
[2023-03-18 19:19:36] [INFO ] Flatten gal took : 231 ms
[2023-03-18 19:19:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 672 labels/synchronizations in 128 ms.
[2023-03-18 19:19:36] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16420344734319093811.gal : 32 ms
[2023-03-18 19:19:36] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10933286281284311267.prop : 12 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.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality16420344734319093811.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10933286281284311267.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...309
Loading property file /tmp/ReachabilityCardinality10933286281284311267.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :1 after 19
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :19 after 2719
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :2719 after 1.11477e+08
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :1.11477e+08 after 1.47814e+16
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :3.28937e+22 after 1.5758e+25
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7229411225211399903
[2023-03-18 19:19:52] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7229411225211399903
Running compilation step : cd /tmp/ltsmin7229411225211399903;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1468 ms.
Running link step : cd /tmp/ltsmin7229411225211399903;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin7229411225211399903;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'ShieldRVsPT040BReachabilityFireability03==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
ITS runner failed with exception null
java.lang.InterruptedException
at java.base/java.lang.Object.wait(Native Method)
at java.base/java.lang.Thread.join(Thread.java:1304)
at java.base/java.lang.Thread.join(Thread.java:1372)
at fr.lip6.move.gal.application.runner.AbstractRunner.join(AbstractRunner.java:27)
at fr.lip6.move.gal.application.runner.its.ITSRunner.join(ITSRunner.java:177)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.verifyWithSDD(GlobalPropertySolver.java:675)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.lambda$2(ReachabilitySolver.java:63)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-18 19:20:07] [INFO ] Flatten gal took : 51 ms
[2023-03-18 19:20:07] [INFO ] Applying decomposition
[2023-03-18 19:20:07] [INFO ] Flatten gal took : 48 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph13877349890969564319.txt' '-o' '/tmp/graph13877349890969564319.bin' '-w' '/tmp/graph13877349890969564319.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph13877349890969564319.bin' '-l' '-1' '-v' '-w' '/tmp/graph13877349890969564319.weights' '-q' '0' '-e' '0.001'
[2023-03-18 19:20:07] [INFO ] Decomposing Gal with order
[2023-03-18 19:20:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 19:20:07] [INFO ] Removed a total of 1431 redundant transitions.
[2023-03-18 19:20:07] [INFO ] Flatten gal took : 103 ms
[2023-03-18 19:20:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 7 ms.
[2023-03-18 19:20:07] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3905243285897918851.gal : 13 ms
[2023-03-18 19:20:07] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5889995989221586473.prop : 1 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.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality3905243285897918851.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5889995989221586473.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality5889995989221586473.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :1 after 1
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :1 after 289
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :50779 after 62911
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :62911 after 78643
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :4.16527e+07 after 2.13954e+88
Detected timeout of ITS tools.
Detected timeout of ITS tools.
[2023-03-18 19:50:12] [INFO ] Flatten gal took : 887 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin2635197858418621064
[2023-03-18 19:50:12] [INFO ] Computing symmetric may disable matrix : 901 transitions.
[2023-03-18 19:50:12] [INFO ] Computation of Complete disable matrix. took 63 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 19:50:12] [INFO ] Computing symmetric may enable matrix : 901 transitions.
[2023-03-18 19:50:12] [INFO ] Computation of Complete enable matrix. took 21 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 19:50:13] [INFO ] Applying decomposition
[2023-03-18 19:50:13] [INFO ] Flatten gal took : 649 ms
[2023-03-18 19:50:14] [INFO ] Computing Do-Not-Accords matrix : 901 transitions.
[2023-03-18 19:50:14] [INFO ] Computation of Completed DNA matrix. took 48 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 19:50:14] [INFO ] Built C files in 2457ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2635197858418621064
Running compilation step : cd /tmp/ltsmin2635197858418621064;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '180' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph5418239173677164503.txt' '-o' '/tmp/graph5418239173677164503.bin' '-w' '/tmp/graph5418239173677164503.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph5418239173677164503.bin' '-l' '-1' '-v' '-w' '/tmp/graph5418239173677164503.weights' '-q' '0' '-e' '0.001'
[2023-03-18 19:50:15] [INFO ] Decomposing Gal with order
[2023-03-18 19:50:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 19:50:15] [INFO ] Removed a total of 1088 redundant transitions.
[2023-03-18 19:50:15] [INFO ] Flatten gal took : 144 ms
[2023-03-18 19:50:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 639 labels/synchronizations in 67 ms.
[2023-03-18 19:50:15] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability16092048899242384196.gal : 52 ms
[2023-03-18 19:50:15] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability1508426075009105925.prop : 1 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.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability16092048899242384196.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability1508426075009105925.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityFireability1508426075009105925.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :1 after 4
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :4 after 2.65423e+06
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :2.65423e+06 after 6.9829e+11
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :3.28937e+22 after 3.04932e+25
Invariant property ShieldRVs-PT-040B-ReachabilityFireability-05 does not hold.
FORMULA ShieldRVs-PT-040B-ReachabilityFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Invariant property ShieldRVs-PT-040B-ReachabilityFireability-03 does not hold.
FORMULA ShieldRVs-PT-040B-ReachabilityFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :3.04932e+25 after 1.00121e+47
Compilation finished in 3141 ms.
Running link step : cd /tmp/ltsmin2635197858418621064;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 106 ms.
Running LTSmin : cd /tmp/ltsmin2635197858418621064;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldRVsPT040BReachabilityFireability09==true'
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin2635197858418621064;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldRVsPT040BReachabilityFireability09==true'
Running LTSmin : cd /tmp/ltsmin2635197858418621064;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldRVsPT040BReachabilityFireability12==true'
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 4744456 kB
After kill :
MemTotal: 16393340 kB
MemFree: 15734860 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
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
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="ShieldRVs-PT-040B"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is ShieldRVs-PT-040B, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r421-tajo-167905974800143"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVs-PT-040B.tgz
mv ShieldRVs-PT-040B execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;