Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r144-tall-165271830800127.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2021
Input is JoinFreeModules-PT-0500, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r144-tall-165271830800127
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.8M
-rw-r--r-- 1 mcc users 9.0K Apr 30 02:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 100K Apr 30 02:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Apr 30 02:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Apr 30 02:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.9K May 9 08:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 08:08 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 9 08:08 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 9 08:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 08:08 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 08:08 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 1.6M May 10 09:34 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 QuasiLiveness

=== Now, execution of the tool begins

BK_START 1652741206143

Running Version 0
[2022-05-16 22:46:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2022-05-16 22:46:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 22:46:47] [INFO ] Load time of PNML (sax parser for PT used): 198 ms
[2022-05-16 22:46:47] [INFO ] Transformed 2501 places.
[2022-05-16 22:46:47] [INFO ] Transformed 4001 transitions.
[2022-05-16 22:46:47] [INFO ] Parsed PT model containing 2501 places and 4001 transitions in 260 ms.
Starting structural reductions, iteration 0 : 2501/2501 places, 4001/4001 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 2500 transition count 4001
Applied a total of 1 rules in 206 ms. Remains 2500 /2501 variables (removed 1) and now considering 4001/4001 (removed 0) transitions.
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-16 22:46:48] [INFO ] Computed 500 place invariants in 44 ms
[2022-05-16 22:46:50] [INFO ] Dead Transitions using invariants and state equation in 2227 ms returned []
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-16 22:46:50] [INFO ] Computed 500 place invariants in 22 ms
[2022-05-16 22:46:50] [INFO ] Implicit Places using invariants in 447 ms returned []
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-16 22:46:50] [INFO ] Computed 500 place invariants in 17 ms
[2022-05-16 22:46:52] [INFO ] Implicit Places using invariants and state equation in 1682 ms returned []
Implicit Place search using SMT with State Equation took 2132 ms to find 0 implicit places.
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-16 22:46:52] [INFO ] Computed 500 place invariants in 15 ms
[2022-05-16 22:46:54] [INFO ] Dead Transitions using invariants and state equation in 1751 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2500/2501 places, 4001/4001 transitions.
Discarding 2000 transitions out of 4001. Remains 2001
[2022-05-16 22:46:54] [INFO ] Initial state test concluded for 1 properties.
Incomplete random walk after 10278 steps, including 2 resets, run finished after 242 ms. (steps per millisecond=42 ) properties (out of 2000) seen :37
Probabilistic random walk after 30001 steps, saw 29953 distinct states, run finished after 3851 ms. (steps per millisecond=7 ) properties seen :{1=1, 5=1, 9=1, 13=1, 17=1, 21=1, 25=1, 29=1, 33=1, 37=1, 41=1, 45=1, 49=1, 53=1, 57=1, 61=1, 65=1, 69=1, 73=1, 77=1, 81=1, 85=1, 89=1, 93=1, 97=1, 101=1, 105=1, 109=1, 113=1, 117=1, 121=1, 125=1, 129=1, 133=1, 137=1, 141=1, 145=1, 149=1, 153=1, 157=1, 161=1, 165=1, 169=1, 173=1, 177=1, 181=1, 185=1, 189=1, 193=1, 197=1, 201=1, 205=1, 209=1, 213=1, 217=1, 221=1, 225=1, 229=1, 233=1, 237=1, 241=1, 245=1, 249=1, 253=1, 257=1, 261=1, 265=1, 267=1, 271=1, 275=1, 279=1, 283=1, 287=1, 291=1, 295=1, 299=1, 303=1, 305=1, 309=1, 313=1, 317=1, 321=1, 325=1, 329=1, 333=1, 337=1, 341=1, 345=1, 349=1, 353=1, 357=1, 361=1, 365=1, 369=1, 373=1, 377=1, 381=1, 383=1, 387=1, 391=1, 398=1, 402=1, 406=1, 410=1, 414=1, 418=1, 422=1, 426=1, 430=1, 434=1, 438=1, 442=1, 446=1, 450=1, 454=1, 458=1, 462=1, 466=1, 473=1, 477=1, 481=1, 485=1, 489=1, 493=1, 497=1, 501=1, 505=1, 509=1, 513=1, 517=1, 521=1, 528=1, 532=1, 536=1, 540=1, 544=1, 548=1, 552=1, 556=1, 560=1, 564=1, 568=1, 572=1, 576=1, 580=1, 584=1, 591=1, 595=1, 599=1, 603=1, 607=1, 611=1, 615=1, 619=1, 623=1, 627=1, 631=1, 635=1, 639=1, 643=1, 647=1, 651=1, 655=1, 659=1, 663=1, 667=1, 671=1, 678=1, 682=1, 686=1, 690=1, 694=1, 698=1, 705=1, 709=1, 713=1, 717=1, 721=1, 725=1, 729=1, 733=1, 737=1, 741=1, 745=1, 749=1, 753=1, 757=1, 761=1, 765=1, 769=1, 773=1, 775=1, 779=1, 783=1, 787=1, 791=1, 795=1, 799=1, 803=1, 807=1, 811=1, 815=1, 819=1, 823=1, 827=1, 831=1, 835=1, 839=1, 843=1, 847=1, 851=1, 855=1, 862=1, 866=1, 870=1, 874=1, 878=1, 882=1, 886=1, 890=1, 894=1, 898=1, 902=1, 906=1, 910=1, 914=1, 918=1, 922=1, 926=1, 930=1, 934=1, 938=1, 942=1, 946=1, 950=1, 954=1, 958=1, 962=1, 966=1, 970=1, 974=1, 978=1, 982=1, 986=1, 990=1, 994=1, 998=1, 1002=1, 1006=1, 1010=1, 1017=1, 1021=1, 1025=1, 1027=1, 1031=1, 1035=1, 1039=1, 1043=1, 1047=1, 1051=1, 1055=1, 1059=1, 1063=1, 1067=1, 1071=1, 1075=1, 1079=1, 1083=1, 1087=1, 1091=1, 1095=1, 1099=1, 1103=1, 1107=1, 1111=1, 1115=1, 1119=1, 1123=1, 1127=1, 1131=1, 1135=1, 1139=1, 1143=1, 1147=1, 1151=1, 1155=1, 1159=1, 1166=1, 1168=1, 1172=1, 1176=1, 1183=1, 1187=1, 1191=1, 1195=1, 1199=1, 1203=1, 1207=1, 1211=1, 1215=1, 1217=1, 1221=1, 1225=1, 1229=1, 1233=1, 1237=1, 1244=1, 1248=1, 1252=1, 1256=1, 1260=1, 1264=1, 1268=1, 1272=1, 1276=1, 1280=1, 1284=1, 1288=1, 1292=1, 1296=1, 1300=1, 1304=1, 1308=1, 1312=1, 1316=1, 1320=1, 1324=1, 1328=1, 1332=1, 1336=1, 1340=1, 1344=1, 1351=1, 1355=1, 1359=1, 1363=1, 1367=1, 1371=1, 1375=1, 1379=1, 1383=1, 1387=1, 1391=1, 1395=1, 1399=1, 1403=1, 1407=1, 1411=1, 1415=1, 1419=1, 1423=1, 1425=1, 1429=1, 1433=1, 1437=1, 1441=1, 1445=1, 1449=1, 1453=1, 1457=1, 1461=1, 1465=1, 1469=1, 1473=1, 1477=1, 1481=1, 1488=1, 1492=1, 1496=1, 1500=1, 1504=1, 1508=1, 1512=1, 1516=1, 1520=1, 1524=1, 1528=1, 1530=1, 1534=1, 1538=1, 1542=1, 1546=1, 1550=1, 1557=1, 1561=1, 1565=1, 1569=1, 1571=1, 1575=1, 1579=1, 1583=1, 1587=1, 1591=1, 1595=1, 1599=1, 1603=1, 1607=1, 1611=1, 1615=1, 1619=1, 1626=1, 1630=1, 1634=1, 1638=1, 1642=1, 1646=1, 1650=1, 1654=1, 1658=1, 1662=1, 1666=1, 1670=1, 1674=1, 1678=1, 1682=1, 1686=1, 1690=1, 1694=1, 1698=1, 1702=1, 1706=1, 1710=1, 1714=1, 1716=1, 1720=1, 1724=1, 1728=1, 1732=1, 1736=1, 1740=1, 1744=1, 1748=1, 1752=1, 1756=1, 1760=1, 1764=1, 1768=1, 1772=1, 1776=1, 1780=1, 1784=1, 1788=1, 1792=1, 1796=1, 1800=1, 1804=1, 1808=1, 1812=1, 1816=1, 1820=1, 1824=1, 1828=1, 1832=1, 1836=1, 1840=1, 1844=1, 1848=1, 1852=1, 1856=1, 1860=1, 1864=1, 1868=1, 1872=1, 1876=1, 1880=1, 1884=1, 1888=1, 1892=1, 1896=1, 1900=1, 1904=1, 1908=1, 1912=1, 1916=1, 1920=1, 1924=1, 1928=1, 1932=1, 1936=1, 1940=1, 1944=1, 1948=1, 1952=1, 1956=1, 1959=1, 1960=1, 1961=1, 1962=1}
Running SMT prover for 1475 properties.
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-16 22:46:58] [INFO ] Computed 500 place invariants in 15 ms
[2022-05-16 22:47:23] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
Fused 1475 Parikh solutions to 1 different solutions.
Support contains 1475 out of 2500 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Graph (complete) has 6000 edges and 2500 vertex of which 2495 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.12 ms
Discarding 5 places :
Also discarding 8 output transitions
Drop transitions removed 8 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 2495 transition count 3992
Applied a total of 2 rules in 152 ms. Remains 2495 /2500 variables (removed 5) and now considering 3992/4001 (removed 9) transitions.
// Phase 1: matrix 3992 rows 2495 cols
[2022-05-16 22:47:23] [INFO ] Computed 499 place invariants in 20 ms
[2022-05-16 22:47:25] [INFO ] Dead Transitions using invariants and state equation in 1776 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2495/2500 places, 3992/4001 transitions.
[2022-05-16 22:47:25] [INFO ] Flatten gal took : 221 ms
[2022-05-16 22:47:26] [INFO ] Flatten gal took : 136 ms
[2022-05-16 22:47:26] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2341825680003291563.gal : 43 ms
[2022-05-16 22:47:26] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3205654892870032730.prop : 4 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality2341825680003291563.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality3205654892870032730.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality2341825680003291563.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality3205654892870032730.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality3205654892870032730.prop.
SDD proceeding with computation,1475 properties remain. new max is 4
SDD size :1 after 8
Reachability property qltransition_1 is true.
SDD proceeding with computation,1474 properties remain. new max is 4
SDD size :8 after 25
SDD proceeding with computation,1474 properties remain. new max is 8
SDD size :25 after 50
SDD proceeding with computation,1474 properties remain. new max is 16
SDD size :50 after 116
SDD proceeding with computation,1474 properties remain. new max is 32
SDD size :116 after 314
Detected timeout of ITS tools.
[2022-05-16 22:47:41] [INFO ] Flatten gal took : 101 ms
[2022-05-16 22:47:41] [INFO ] Applying decomposition
[2022-05-16 22:47:41] [INFO ] Flatten gal took : 94 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph6960575134253582788.txt, -o, /tmp/graph6960575134253582788.bin, -w, /tmp/graph6960575134253582788.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph6960575134253582788.bin, -l, -1, -v, -w, /tmp/graph6960575134253582788.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-05-16 22:47:41] [INFO ] Decomposing Gal with order
[2022-05-16 22:47:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 22:47:42] [INFO ] Flatten gal took : 93 ms
[2022-05-16 22:47:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2022-05-16 22:47:42] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9866291890933482576.gal : 13 ms
[2022-05-16 22:47:42] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8037310848840622666.prop : 4 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality9866291890933482576.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality8037310848840622666.prop, --nowitness], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality9866291890933482576.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality8037310848840622666.prop --nowitness
Loading property file /tmp/ReachabilityCardinality8037310848840622666.prop.
SDD proceeding with computation,1474 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,1474 properties remain. new max is 8
SDD size :8 after 25
SDD proceeding with computation,1474 properties remain. new max is 16
SDD size :25 after 76
SDD proceeding with computation,1474 properties remain. new max is 32
SDD size :76 after 246
SDD proceeding with computation,1474 properties remain. new max is 64
SDD size :246 after 851
SDD proceeding with computation,1474 properties remain. new max is 128
SDD size :851 after 3104
SDD proceeding with computation,1474 properties remain. new max is 256
SDD size :3104 after 11747
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5768417550451695145
[2022-05-16 22:47:57] [INFO ] Built C files in 76ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5768417550451695145
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin5768417550451695145]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin5768417550451695145] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin5768417550451695145] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Incomplete random walk after 1000017 steps, including 2 resets, run finished after 22499 ms. (steps per millisecond=44 ) properties (out of 1474) seen :1414
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 2186 ms. (steps per millisecond=45 ) properties (out of 60) seen :2
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 2171 ms. (steps per millisecond=46 ) properties (out of 58) seen :1
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 2245 ms. (steps per millisecond=44 ) properties (out of 57) seen :1
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 2156 ms. (steps per millisecond=46 ) properties (out of 56) seen :2
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 2141 ms. (steps per millisecond=46 ) properties (out of 54) seen :1
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 2132 ms. (steps per millisecond=46 ) properties (out of 53) seen :2
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 2148 ms. (steps per millisecond=46 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 2136 ms. (steps per millisecond=46 ) properties (out of 51) seen :2
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 2167 ms. (steps per millisecond=46 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 2161 ms. (steps per millisecond=46 ) properties (out of 49) seen :1
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 2166 ms. (steps per millisecond=46 ) properties (out of 48) seen :1
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 2206 ms. (steps per millisecond=45 ) properties (out of 47) seen :1
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 2209 ms. (steps per millisecond=45 ) properties (out of 46) seen :2
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 2143 ms. (steps per millisecond=46 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 2159 ms. (steps per millisecond=46 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 2144 ms. (steps per millisecond=46 ) properties (out of 44) seen :1
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 2137 ms. (steps per millisecond=46 ) properties (out of 43) seen :2
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 2156 ms. (steps per millisecond=46 ) properties (out of 41) seen :2
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 2155 ms. (steps per millisecond=46 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 2159 ms. (steps per millisecond=46 ) properties (out of 39) seen :2
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 2140 ms. (steps per millisecond=46 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 2130 ms. (steps per millisecond=46 ) properties (out of 37) seen :2
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 2156 ms. (steps per millisecond=46 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 2141 ms. (steps per millisecond=46 ) properties (out of 35) seen :2
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 2132 ms. (steps per millisecond=46 ) properties (out of 33) seen :2
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 2140 ms. (steps per millisecond=46 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 2144 ms. (steps per millisecond=46 ) properties (out of 31) seen :2
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 2131 ms. (steps per millisecond=46 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 2152 ms. (steps per millisecond=46 ) properties (out of 29) seen :2
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 2138 ms. (steps per millisecond=46 ) properties (out of 27) seen :2
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 2142 ms. (steps per millisecond=46 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 2135 ms. (steps per millisecond=46 ) properties (out of 25) seen :2
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 2142 ms. (steps per millisecond=46 ) properties (out of 23) seen :1
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 2142 ms. (steps per millisecond=46 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 2146 ms. (steps per millisecond=46 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 2128 ms. (steps per millisecond=46 ) properties (out of 22) seen :2
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 2128 ms. (steps per millisecond=46 ) properties (out of 20) seen :2
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 2123 ms. (steps per millisecond=47 ) properties (out of 18) seen :2
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 2119 ms. (steps per millisecond=47 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 2134 ms. (steps per millisecond=46 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 2108 ms. (steps per millisecond=47 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 2119 ms. (steps per millisecond=47 ) properties (out of 14) seen :0
Running SMT prover for 14 properties.
// Phase 1: matrix 3992 rows 2495 cols
[2022-05-16 22:49:51] [INFO ] Computed 499 place invariants in 19 ms
[2022-05-16 22:49:51] [INFO ] [Real]Absence check using 499 positive place invariants in 124 ms returned sat
[2022-05-16 22:49:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:49:52] [INFO ] [Real]Absence check using state equation in 1125 ms returned sat
[2022-05-16 22:49:52] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:49:53] [INFO ] [Nat]Absence check using 499 positive place invariants in 101 ms returned sat
[2022-05-16 22:49:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:50:04] [INFO ] [Nat]Absence check using state equation in 10788 ms returned sat
[2022-05-16 22:50:04] [INFO ] Deduced a trap composed of 3 places in 104 ms of which 10 ms to minimize.
[2022-05-16 22:50:04] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 0 ms to minimize.
[2022-05-16 22:50:04] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 0 ms to minimize.
[2022-05-16 22:50:04] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
[2022-05-16 22:50:05] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 0 ms to minimize.
[2022-05-16 22:50:05] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2022-05-16 22:50:05] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
[2022-05-16 22:50:05] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2022-05-16 22:50:05] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2022-05-16 22:50:05] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2022-05-16 22:50:06] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2022-05-16 22:50:06] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2022-05-16 22:50:06] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2022-05-16 22:50:06] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2022-05-16 22:50:06] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2022-05-16 22:50:06] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2022-05-16 22:50:07] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-16 22:50:07] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-16 22:50:07] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-16 22:50:07] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-16 22:50:07] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2022-05-16 22:50:07] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2022-05-16 22:50:08] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-16 22:50:08] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-16 22:50:08] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2022-05-16 22:50:08] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2022-05-16 22:50:09] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2022-05-16 22:50:09] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2022-05-16 22:50:09] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-16 22:50:09] [INFO ] Trap strengthening (SAT) tested/added 30/29 trap constraints in 5537 ms
[2022-05-16 22:50:09] [INFO ] Computed and/alt/rep : 2994/7485/2994 causal constraints (skipped 0 transitions) in 193 ms.
[2022-05-16 22:50:26] [INFO ] Added : 240 causal constraints over 48 iterations in 16769 ms. Result :unknown
[2022-05-16 22:50:26] [INFO ] [Real]Absence check using 499 positive place invariants in 113 ms returned sat
[2022-05-16 22:50:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:50:27] [INFO ] [Real]Absence check using state equation in 1198 ms returned sat
[2022-05-16 22:50:28] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:50:28] [INFO ] [Nat]Absence check using 499 positive place invariants in 107 ms returned sat
[2022-05-16 22:50:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:50:44] [INFO ] [Nat]Absence check using state equation in 15782 ms returned sat
[2022-05-16 22:50:44] [INFO ] Deduced a trap composed of 3 places in 89 ms of which 0 ms to minimize.
[2022-05-16 22:50:44] [INFO ] Deduced a trap composed of 3 places in 88 ms of which 0 ms to minimize.
[2022-05-16 22:50:44] [INFO ] Deduced a trap composed of 3 places in 79 ms of which 0 ms to minimize.
[2022-05-16 22:50:44] [INFO ] Deduced a trap composed of 3 places in 79 ms of which 1 ms to minimize.
[2022-05-16 22:50:45] [INFO ] Deduced a trap composed of 3 places in 84 ms of which 4 ms to minimize.
[2022-05-16 22:50:45] [INFO ] Deduced a trap composed of 3 places in 84 ms of which 0 ms to minimize.
[2022-05-16 22:50:45] [INFO ] Deduced a trap composed of 3 places in 79 ms of which 0 ms to minimize.
[2022-05-16 22:50:45] [INFO ] Deduced a trap composed of 3 places in 77 ms of which 0 ms to minimize.
[2022-05-16 22:50:45] [INFO ] Deduced a trap composed of 3 places in 77 ms of which 1 ms to minimize.
[2022-05-16 22:50:46] [INFO ] Deduced a trap composed of 3 places in 69 ms of which 0 ms to minimize.
[2022-05-16 22:50:46] [INFO ] Deduced a trap composed of 3 places in 69 ms of which 1 ms to minimize.
[2022-05-16 22:50:46] [INFO ] Deduced a trap composed of 3 places in 74 ms of which 1 ms to minimize.
[2022-05-16 22:50:46] [INFO ] Deduced a trap composed of 3 places in 72 ms of which 1 ms to minimize.
[2022-05-16 22:50:46] [INFO ] Deduced a trap composed of 3 places in 66 ms of which 1 ms to minimize.
[2022-05-16 22:50:46] [INFO ] Deduced a trap composed of 3 places in 80 ms of which 0 ms to minimize.
[2022-05-16 22:50:47] [INFO ] Deduced a trap composed of 3 places in 74 ms of which 0 ms to minimize.
[2022-05-16 22:50:47] [INFO ] Deduced a trap composed of 3 places in 69 ms of which 0 ms to minimize.
[2022-05-16 22:50:47] [INFO ] Deduced a trap composed of 3 places in 68 ms of which 0 ms to minimize.
[2022-05-16 22:50:47] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 0 ms to minimize.
[2022-05-16 22:50:47] [INFO ] Deduced a trap composed of 3 places in 64 ms of which 0 ms to minimize.
[2022-05-16 22:50:48] [INFO ] Deduced a trap composed of 3 places in 68 ms of which 0 ms to minimize.
[2022-05-16 22:50:48] [INFO ] Deduced a trap composed of 3 places in 79 ms of which 1 ms to minimize.
[2022-05-16 22:50:48] [INFO ] Deduced a trap composed of 3 places in 62 ms of which 0 ms to minimize.
[2022-05-16 22:50:48] [INFO ] Deduced a trap composed of 3 places in 64 ms of which 0 ms to minimize.
[2022-05-16 22:50:48] [INFO ] Deduced a trap composed of 3 places in 84 ms of which 0 ms to minimize.
[2022-05-16 22:50:49] [INFO ] Deduced a trap composed of 3 places in 65 ms of which 1 ms to minimize.
[2022-05-16 22:50:49] [INFO ] Deduced a trap composed of 3 places in 76 ms of which 13 ms to minimize.
[2022-05-16 22:50:49] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 1 ms to minimize.
[2022-05-16 22:50:49] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 0 ms to minimize.
[2022-05-16 22:50:49] [INFO ] Deduced a trap composed of 3 places in 65 ms of which 0 ms to minimize.
[2022-05-16 22:50:50] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 0 ms to minimize.
[2022-05-16 22:50:50] [INFO ] Deduced a trap composed of 3 places in 61 ms of which 0 ms to minimize.
[2022-05-16 22:50:50] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 1 ms to minimize.
[2022-05-16 22:50:50] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 0 ms to minimize.
[2022-05-16 22:50:50] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 0 ms to minimize.
[2022-05-16 22:50:51] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 0 ms to minimize.
[2022-05-16 22:50:51] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 0 ms to minimize.
[2022-05-16 22:50:51] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 0 ms to minimize.
[2022-05-16 22:50:51] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 2 ms to minimize.
[2022-05-16 22:50:51] [INFO ] Deduced a trap composed of 3 places in 65 ms of which 10 ms to minimize.
[2022-05-16 22:50:51] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 1 ms to minimize.
[2022-05-16 22:50:52] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 0 ms to minimize.
[2022-05-16 22:50:52] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 0 ms to minimize.
[2022-05-16 22:50:52] [INFO ] Deduced a trap composed of 3 places in 68 ms of which 1 ms to minimize.
[2022-05-16 22:50:52] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 1 ms to minimize.
[2022-05-16 22:50:52] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 0 ms to minimize.
[2022-05-16 22:50:52] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 0 ms to minimize.
[2022-05-16 22:50:53] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 0 ms to minimize.
[2022-05-16 22:50:53] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 0 ms to minimize.
[2022-05-16 22:50:53] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 0 ms to minimize.
[2022-05-16 22:50:53] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 0 ms to minimize.
[2022-05-16 22:50:53] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
[2022-05-16 22:50:53] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 0 ms to minimize.
[2022-05-16 22:50:54] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
[2022-05-16 22:50:54] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 0 ms to minimize.
[2022-05-16 22:50:54] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 0 ms to minimize.
[2022-05-16 22:50:54] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 0 ms to minimize.
[2022-05-16 22:50:54] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
[2022-05-16 22:50:54] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 0 ms to minimize.
[2022-05-16 22:50:55] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
[2022-05-16 22:50:55] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 0 ms to minimize.
[2022-05-16 22:50:55] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2022-05-16 22:50:55] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 0 ms to minimize.
[2022-05-16 22:50:55] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2022-05-16 22:50:55] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2022-05-16 22:50:56] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 0 ms to minimize.
[2022-05-16 22:50:56] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 0 ms to minimize.
[2022-05-16 22:50:56] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
[2022-05-16 22:50:56] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2022-05-16 22:50:56] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2022-05-16 22:50:56] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 0 ms to minimize.
[2022-05-16 22:50:57] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2022-05-16 22:50:57] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2022-05-16 22:50:57] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2022-05-16 22:50:57] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2022-05-16 22:50:57] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-16 22:50:57] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-16 22:50:57] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2022-05-16 22:50:58] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-16 22:50:58] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-16 22:50:58] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-16 22:50:58] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-16 22:50:58] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-16 22:50:58] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 11 ms to minimize.
[2022-05-16 22:50:59] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-16 22:50:59] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-16 22:50:59] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2022-05-16 22:50:59] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2022-05-16 22:50:59] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2022-05-16 22:50:59] [INFO ] Trap strengthening (SAT) tested/added 90/89 trap constraints in 15646 ms
[2022-05-16 22:50:59] [INFO ] Computed and/alt/rep : 2994/7485/2994 causal constraints (skipped 0 transitions) in 163 ms.
[2022-05-16 22:51:13] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
[2022-05-16 22:51:13] [INFO ] [Real]Absence check using 499 positive place invariants in 102 ms returned sat
[2022-05-16 22:51:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:51:14] [INFO ] [Real]Absence check using state equation in 1196 ms returned sat
[2022-05-16 22:51:14] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:51:14] [INFO ] [Nat]Absence check using 499 positive place invariants in 101 ms returned sat
[2022-05-16 22:51:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:51:28] [INFO ] [Nat]Absence check using state equation in 13488 ms returned sat
[2022-05-16 22:51:28] [INFO ] Deduced a trap composed of 3 places in 85 ms of which 1 ms to minimize.
[2022-05-16 22:51:29] [INFO ] Deduced a trap composed of 3 places in 84 ms of which 1 ms to minimize.
[2022-05-16 22:51:29] [INFO ] Deduced a trap composed of 3 places in 73 ms of which 0 ms to minimize.
[2022-05-16 22:51:29] [INFO ] Deduced a trap composed of 3 places in 76 ms of which 0 ms to minimize.
[2022-05-16 22:51:29] [INFO ] Deduced a trap composed of 3 places in 77 ms of which 0 ms to minimize.
[2022-05-16 22:51:29] [INFO ] Deduced a trap composed of 3 places in 78 ms of which 0 ms to minimize.
[2022-05-16 22:51:30] [INFO ] Deduced a trap composed of 3 places in 83 ms of which 1 ms to minimize.
[2022-05-16 22:51:30] [INFO ] Deduced a trap composed of 3 places in 71 ms of which 1 ms to minimize.
[2022-05-16 22:51:30] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 1 ms to minimize.
[2022-05-16 22:51:30] [INFO ] Deduced a trap composed of 3 places in 74 ms of which 0 ms to minimize.
[2022-05-16 22:51:30] [INFO ] Deduced a trap composed of 3 places in 74 ms of which 0 ms to minimize.
[2022-05-16 22:51:31] [INFO ] Deduced a trap composed of 3 places in 74 ms of which 0 ms to minimize.
[2022-05-16 22:51:31] [INFO ] Deduced a trap composed of 3 places in 73 ms of which 0 ms to minimize.
[2022-05-16 22:51:31] [INFO ] Deduced a trap composed of 3 places in 70 ms of which 1 ms to minimize.
[2022-05-16 22:51:31] [INFO ] Deduced a trap composed of 3 places in 68 ms of which 0 ms to minimize.
[2022-05-16 22:51:32] [INFO ] Deduced a trap composed of 3 places in 68 ms of which 0 ms to minimize.
[2022-05-16 22:51:32] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 1 ms to minimize.
[2022-05-16 22:51:32] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 0 ms to minimize.
[2022-05-16 22:51:32] [INFO ] Deduced a trap composed of 3 places in 71 ms of which 0 ms to minimize.
[2022-05-16 22:51:32] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 1 ms to minimize.
[2022-05-16 22:51:32] [INFO ] Deduced a trap composed of 3 places in 68 ms of which 0 ms to minimize.
[2022-05-16 22:51:33] [INFO ] Deduced a trap composed of 3 places in 68 ms of which 0 ms to minimize.
[2022-05-16 22:51:33] [INFO ] Deduced a trap composed of 3 places in 65 ms of which 0 ms to minimize.
[2022-05-16 22:51:33] [INFO ] Deduced a trap composed of 3 places in 61 ms of which 0 ms to minimize.
[2022-05-16 22:51:33] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 0 ms to minimize.
[2022-05-16 22:51:33] [INFO ] Deduced a trap composed of 3 places in 61 ms of which 1 ms to minimize.
[2022-05-16 22:51:34] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 0 ms to minimize.
[2022-05-16 22:51:34] [INFO ] Deduced a trap composed of 3 places in 65 ms of which 1 ms to minimize.
[2022-05-16 22:51:34] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 0 ms to minimize.
[2022-05-16 22:51:34] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 0 ms to minimize.
[2022-05-16 22:51:34] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 0 ms to minimize.
[2022-05-16 22:51:34] [INFO ] Deduced a trap composed of 3 places in 61 ms of which 0 ms to minimize.
[2022-05-16 22:51:35] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 0 ms to minimize.
[2022-05-16 22:51:35] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 1 ms to minimize.
[2022-05-16 22:51:35] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 1 ms to minimize.
[2022-05-16 22:51:35] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 0 ms to minimize.
[2022-05-16 22:51:35] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 0 ms to minimize.
[2022-05-16 22:51:36] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 1 ms to minimize.
[2022-05-16 22:51:36] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 1 ms to minimize.
[2022-05-16 22:51:36] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 0 ms to minimize.
[2022-05-16 22:51:36] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 0 ms to minimize.
[2022-05-16 22:51:36] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 0 ms to minimize.
[2022-05-16 22:51:36] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 0 ms to minimize.
[2022-05-16 22:51:37] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 0 ms to minimize.
[2022-05-16 22:51:37] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
[2022-05-16 22:51:37] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 0 ms to minimize.
[2022-05-16 22:51:37] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 0 ms to minimize.
[2022-05-16 22:51:37] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
[2022-05-16 22:51:38] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
[2022-05-16 22:51:38] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 0 ms to minimize.
[2022-05-16 22:51:38] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
[2022-05-16 22:51:38] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
[2022-05-16 22:51:38] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 0 ms to minimize.
[2022-05-16 22:51:38] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 0 ms to minimize.
[2022-05-16 22:51:39] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 0 ms to minimize.
[2022-05-16 22:51:39] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 0 ms to minimize.
[2022-05-16 22:51:39] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 0 ms to minimize.
[2022-05-16 22:51:39] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 0 ms to minimize.
[2022-05-16 22:51:39] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2022-05-16 22:51:39] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2022-05-16 22:51:40] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2022-05-16 22:51:40] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 0 ms to minimize.
[2022-05-16 22:51:40] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2022-05-16 22:51:40] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
[2022-05-16 22:51:40] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2022-05-16 22:51:40] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
[2022-05-16 22:51:41] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
[2022-05-16 22:51:41] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2022-05-16 22:51:41] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2022-05-16 22:51:41] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 0 ms to minimize.
[2022-05-16 22:51:41] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2022-05-16 22:51:41] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
[2022-05-16 22:51:41] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2022-05-16 22:51:42] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2022-05-16 22:51:42] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2022-05-16 22:51:42] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2022-05-16 22:51:42] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2022-05-16 22:51:42] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-16 22:51:42] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-16 22:51:43] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2022-05-16 22:51:43] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2022-05-16 22:51:43] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-16 22:51:43] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-16 22:51:43] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2022-05-16 22:51:43] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2022-05-16 22:51:43] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2022-05-16 22:51:44] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2022-05-16 22:51:44] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-16 22:51:44] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2022-05-16 22:51:44] [INFO ] Trap strengthening (SAT) tested/added 90/89 trap constraints in 16115 ms
[2022-05-16 22:51:44] [INFO ] Computed and/alt/rep : 2994/7485/2994 causal constraints (skipped 0 transitions) in 161 ms.
[2022-05-16 22:51:55] [INFO ] Added : 115 causal constraints over 23 iterations in 10953 ms. Result :unknown
[2022-05-16 22:51:55] [INFO ] [Real]Absence check using 499 positive place invariants in 99 ms returned sat
[2022-05-16 22:51:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:51:57] [INFO ] [Real]Absence check using state equation in 1204 ms returned sat
[2022-05-16 22:51:57] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:51:57] [INFO ] [Nat]Absence check using 499 positive place invariants in 101 ms returned sat
[2022-05-16 22:51:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:52:10] [INFO ] [Nat]Absence check using state equation in 12711 ms returned sat
[2022-05-16 22:52:10] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 0 ms to minimize.
[2022-05-16 22:52:10] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2022-05-16 22:52:10] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
[2022-05-16 22:52:10] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 0 ms to minimize.
[2022-05-16 22:52:10] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2022-05-16 22:52:11] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 0 ms to minimize.
[2022-05-16 22:52:11] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 0 ms to minimize.
[2022-05-16 22:52:11] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 0 ms to minimize.
[2022-05-16 22:52:11] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2022-05-16 22:52:11] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2022-05-16 22:52:12] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
[2022-05-16 22:52:12] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2022-05-16 22:52:12] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2022-05-16 22:52:12] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2022-05-16 22:52:12] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2022-05-16 22:52:12] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2022-05-16 22:52:13] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2022-05-16 22:52:13] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2022-05-16 22:52:13] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2022-05-16 22:52:13] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-16 22:52:13] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-16 22:52:14] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2022-05-16 22:52:14] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2022-05-16 22:52:14] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2022-05-16 22:52:14] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-16 22:52:14] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2022-05-16 22:52:14] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-16 22:52:15] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-16 22:52:15] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-16 22:52:15] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2022-05-16 22:52:15] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2022-05-16 22:52:15] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-16 22:52:15] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-16 22:52:16] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2022-05-16 22:52:16] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2022-05-16 22:52:16] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-16 22:52:16] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-16 22:52:16] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2022-05-16 22:52:17] [INFO ] Trap strengthening (SAT) tested/added 39/38 trap constraints in 6836 ms
[2022-05-16 22:52:17] [INFO ] Computed and/alt/rep : 2994/7485/2994 causal constraints (skipped 0 transitions) in 159 ms.
[2022-05-16 22:52:24] [INFO ] Added : 25 causal constraints over 5 iterations in 7276 ms. Result :unknown
[2022-05-16 22:52:24] [INFO ] [Real]Absence check using 499 positive place invariants in 101 ms returned sat
[2022-05-16 22:52:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:52:25] [INFO ] [Real]Absence check using state equation in 1190 ms returned sat
[2022-05-16 22:52:25] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:52:26] [INFO ] [Nat]Absence check using 499 positive place invariants in 105 ms returned sat
[2022-05-16 22:52:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:52:35] [INFO ] [Nat]Absence check using state equation in 9071 ms returned sat
[2022-05-16 22:52:35] [INFO ] Deduced a trap composed of 3 places in 167 ms of which 1 ms to minimize.
[2022-05-16 22:52:35] [INFO ] Deduced a trap composed of 3 places in 163 ms of which 1 ms to minimize.
[2022-05-16 22:52:36] [INFO ] Deduced a trap composed of 3 places in 168 ms of which 1 ms to minimize.
[2022-05-16 22:52:36] [INFO ] Deduced a trap composed of 3 places in 173 ms of which 0 ms to minimize.
[2022-05-16 22:52:36] [INFO ] Deduced a trap composed of 3 places in 164 ms of which 1 ms to minimize.
[2022-05-16 22:52:36] [INFO ] Deduced a trap composed of 3 places in 162 ms of which 0 ms to minimize.
[2022-05-16 22:52:37] [INFO ] Deduced a trap composed of 3 places in 159 ms of which 1 ms to minimize.
[2022-05-16 22:52:37] [INFO ] Deduced a trap composed of 3 places in 158 ms of which 1 ms to minimize.
[2022-05-16 22:52:37] [INFO ] Deduced a trap composed of 3 places in 161 ms of which 0 ms to minimize.
[2022-05-16 22:52:37] [INFO ] Deduced a trap composed of 3 places in 163 ms of which 1 ms to minimize.
[2022-05-16 22:52:38] [INFO ] Deduced a trap composed of 3 places in 160 ms of which 3 ms to minimize.
[2022-05-16 22:52:38] [INFO ] Deduced a trap composed of 3 places in 150 ms of which 1 ms to minimize.
[2022-05-16 22:52:38] [INFO ] Deduced a trap composed of 3 places in 157 ms of which 1 ms to minimize.
[2022-05-16 22:52:38] [INFO ] Deduced a trap composed of 3 places in 155 ms of which 0 ms to minimize.
[2022-05-16 22:52:39] [INFO ] Deduced a trap composed of 3 places in 154 ms of which 0 ms to minimize.
[2022-05-16 22:52:39] [INFO ] Deduced a trap composed of 3 places in 151 ms of which 1 ms to minimize.
[2022-05-16 22:52:39] [INFO ] Deduced a trap composed of 3 places in 149 ms of which 0 ms to minimize.
[2022-05-16 22:52:39] [INFO ] Deduced a trap composed of 3 places in 149 ms of which 1 ms to minimize.
[2022-05-16 22:52:40] [INFO ] Deduced a trap composed of 3 places in 148 ms of which 0 ms to minimize.
[2022-05-16 22:52:40] [INFO ] Deduced a trap composed of 3 places in 148 ms of which 1 ms to minimize.
[2022-05-16 22:52:40] [INFO ] Deduced a trap composed of 3 places in 149 ms of which 0 ms to minimize.
[2022-05-16 22:52:40] [INFO ] Deduced a trap composed of 4 places in 148 ms of which 0 ms to minimize.
[2022-05-16 22:52:41] [INFO ] Deduced a trap composed of 3 places in 147 ms of which 1 ms to minimize.
[2022-05-16 22:52:41] [INFO ] Deduced a trap composed of 3 places in 147 ms of which 1 ms to minimize.
[2022-05-16 22:52:41] [INFO ] Deduced a trap composed of 3 places in 138 ms of which 1 ms to minimize.
[2022-05-16 22:52:41] [INFO ] Deduced a trap composed of 3 places in 143 ms of which 1 ms to minimize.
[2022-05-16 22:52:42] [INFO ] Deduced a trap composed of 3 places in 136 ms of which 0 ms to minimize.
[2022-05-16 22:52:42] [INFO ] Deduced a trap composed of 3 places in 143 ms of which 1 ms to minimize.
[2022-05-16 22:52:42] [INFO ] Deduced a trap composed of 3 places in 143 ms of which 1 ms to minimize.
[2022-05-16 22:52:42] [INFO ] Deduced a trap composed of 3 places in 134 ms of which 1 ms to minimize.
[2022-05-16 22:52:43] [INFO ] Deduced a trap composed of 3 places in 138 ms of which 0 ms to minimize.
[2022-05-16 22:52:43] [INFO ] Deduced a trap composed of 3 places in 135 ms of which 0 ms to minimize.
[2022-05-16 22:52:43] [INFO ] Deduced a trap composed of 3 places in 137 ms of which 0 ms to minimize.
[2022-05-16 22:52:43] [INFO ] Deduced a trap composed of 3 places in 136 ms of which 1 ms to minimize.
[2022-05-16 22:52:44] [INFO ] Deduced a trap composed of 3 places in 139 ms of which 0 ms to minimize.
[2022-05-16 22:52:44] [INFO ] Deduced a trap composed of 3 places in 134 ms of which 0 ms to minimize.
[2022-05-16 22:52:44] [INFO ] Deduced a trap composed of 3 places in 130 ms of which 0 ms to minimize.
[2022-05-16 22:52:44] [INFO ] Deduced a trap composed of 3 places in 135 ms of which 1 ms to minimize.
[2022-05-16 22:52:45] [INFO ] Deduced a trap composed of 3 places in 149 ms of which 0 ms to minimize.
[2022-05-16 22:52:45] [INFO ] Deduced a trap composed of 3 places in 134 ms of which 1 ms to minimize.
[2022-05-16 22:52:45] [INFO ] Deduced a trap composed of 3 places in 131 ms of which 0 ms to minimize.
[2022-05-16 22:52:45] [INFO ] Deduced a trap composed of 3 places in 132 ms of which 0 ms to minimize.
[2022-05-16 22:52:46] [INFO ] Deduced a trap composed of 3 places in 129 ms of which 0 ms to minimize.
[2022-05-16 22:52:46] [INFO ] Deduced a trap composed of 3 places in 129 ms of which 1 ms to minimize.
[2022-05-16 22:52:46] [INFO ] Deduced a trap composed of 3 places in 126 ms of which 0 ms to minimize.
[2022-05-16 22:52:46] [INFO ] Deduced a trap composed of 3 places in 128 ms of which 1 ms to minimize.
[2022-05-16 22:52:46] [INFO ] Deduced a trap composed of 3 places in 128 ms of which 0 ms to minimize.
[2022-05-16 22:52:47] [INFO ] Deduced a trap composed of 3 places in 125 ms of which 1 ms to minimize.
[2022-05-16 22:52:47] [INFO ] Deduced a trap composed of 3 places in 125 ms of which 0 ms to minimize.
[2022-05-16 22:52:47] [INFO ] Deduced a trap composed of 3 places in 124 ms of which 1 ms to minimize.
[2022-05-16 22:52:47] [INFO ] Deduced a trap composed of 3 places in 123 ms of which 1 ms to minimize.
[2022-05-16 22:52:48] [INFO ] Deduced a trap composed of 3 places in 124 ms of which 0 ms to minimize.
[2022-05-16 22:52:48] [INFO ] Deduced a trap composed of 3 places in 128 ms of which 1 ms to minimize.
[2022-05-16 22:52:48] [INFO ] Deduced a trap composed of 3 places in 130 ms of which 0 ms to minimize.
[2022-05-16 22:52:48] [INFO ] Deduced a trap composed of 3 places in 115 ms of which 1 ms to minimize.
[2022-05-16 22:52:48] [INFO ] Deduced a trap composed of 3 places in 115 ms of which 1 ms to minimize.
[2022-05-16 22:52:49] [INFO ] Deduced a trap composed of 3 places in 115 ms of which 1 ms to minimize.
[2022-05-16 22:52:49] [INFO ] Deduced a trap composed of 3 places in 110 ms of which 0 ms to minimize.
[2022-05-16 22:52:49] [INFO ] Deduced a trap composed of 3 places in 110 ms of which 0 ms to minimize.
[2022-05-16 22:52:49] [INFO ] Deduced a trap composed of 3 places in 114 ms of which 0 ms to minimize.
[2022-05-16 22:52:50] [INFO ] Deduced a trap composed of 3 places in 112 ms of which 0 ms to minimize.
[2022-05-16 22:52:50] [INFO ] Deduced a trap composed of 3 places in 112 ms of which 0 ms to minimize.
[2022-05-16 22:52:50] [INFO ] Deduced a trap composed of 3 places in 113 ms of which 1 ms to minimize.
[2022-05-16 22:52:50] [INFO ] Deduced a trap composed of 3 places in 111 ms of which 1 ms to minimize.
[2022-05-16 22:52:50] [INFO ] Deduced a trap composed of 3 places in 109 ms of which 1 ms to minimize.
[2022-05-16 22:52:51] [INFO ] Deduced a trap composed of 3 places in 107 ms of which 1 ms to minimize.
[2022-05-16 22:52:51] [INFO ] Deduced a trap composed of 3 places in 109 ms of which 0 ms to minimize.
[2022-05-16 22:52:51] [INFO ] Deduced a trap composed of 3 places in 107 ms of which 1 ms to minimize.
[2022-05-16 22:52:51] [INFO ] Deduced a trap composed of 3 places in 107 ms of which 1 ms to minimize.
[2022-05-16 22:52:51] [INFO ] Deduced a trap composed of 3 places in 105 ms of which 0 ms to minimize.
[2022-05-16 22:52:52] [INFO ] Deduced a trap composed of 3 places in 104 ms of which 0 ms to minimize.
[2022-05-16 22:52:52] [INFO ] Deduced a trap composed of 3 places in 105 ms of which 1 ms to minimize.
[2022-05-16 22:52:52] [INFO ] Deduced a trap composed of 3 places in 101 ms of which 0 ms to minimize.
[2022-05-16 22:52:52] [INFO ] Deduced a trap composed of 3 places in 116 ms of which 0 ms to minimize.
[2022-05-16 22:52:52] [INFO ] Deduced a trap composed of 3 places in 102 ms of which 0 ms to minimize.
[2022-05-16 22:52:53] [INFO ] Deduced a trap composed of 3 places in 102 ms of which 0 ms to minimize.
[2022-05-16 22:52:53] [INFO ] Deduced a trap composed of 3 places in 95 ms of which 1 ms to minimize.
[2022-05-16 22:52:53] [INFO ] Deduced a trap composed of 3 places in 99 ms of which 1 ms to minimize.
[2022-05-16 22:52:53] [INFO ] Deduced a trap composed of 3 places in 99 ms of which 0 ms to minimize.
[2022-05-16 22:52:53] [INFO ] Deduced a trap composed of 3 places in 99 ms of which 0 ms to minimize.
[2022-05-16 22:52:54] [INFO ] Deduced a trap composed of 3 places in 89 ms of which 0 ms to minimize.
[2022-05-16 22:52:54] [INFO ] Deduced a trap composed of 3 places in 95 ms of which 0 ms to minimize.
[2022-05-16 22:52:54] [INFO ] Deduced a trap composed of 3 places in 92 ms of which 1 ms to minimize.
[2022-05-16 22:52:54] [INFO ] Deduced a trap composed of 3 places in 90 ms of which 0 ms to minimize.
[2022-05-16 22:52:54] [INFO ] Deduced a trap composed of 3 places in 95 ms of which 0 ms to minimize.
[2022-05-16 22:52:55] [INFO ] Deduced a trap composed of 3 places in 102 ms of which 0 ms to minimize.
[2022-05-16 22:52:55] [INFO ] Deduced a trap composed of 3 places in 93 ms of which 1 ms to minimize.
[2022-05-16 22:52:55] [INFO ] Deduced a trap composed of 3 places in 93 ms of which 0 ms to minimize.
[2022-05-16 22:52:55] [INFO ] Deduced a trap composed of 3 places in 88 ms of which 0 ms to minimize.
[2022-05-16 22:52:55] [INFO ] Deduced a trap composed of 3 places in 90 ms of which 1 ms to minimize.
[2022-05-16 22:52:56] [INFO ] Deduced a trap composed of 3 places in 91 ms of which 0 ms to minimize.
[2022-05-16 22:52:56] [INFO ] Deduced a trap composed of 3 places in 93 ms of which 0 ms to minimize.
[2022-05-16 22:52:56] [INFO ] Deduced a trap composed of 3 places in 88 ms of which 0 ms to minimize.
[2022-05-16 22:52:56] [INFO ] Deduced a trap composed of 3 places in 89 ms of which 0 ms to minimize.
[2022-05-16 22:52:56] [INFO ] Deduced a trap composed of 3 places in 85 ms of which 0 ms to minimize.
[2022-05-16 22:52:57] [INFO ] Deduced a trap composed of 3 places in 88 ms of which 1 ms to minimize.
[2022-05-16 22:52:57] [INFO ] Deduced a trap composed of 3 places in 89 ms of which 1 ms to minimize.
[2022-05-16 22:52:57] [INFO ] Deduced a trap composed of 3 places in 84 ms of which 0 ms to minimize.
[2022-05-16 22:52:57] [INFO ] Deduced a trap composed of 3 places in 79 ms of which 1 ms to minimize.
[2022-05-16 22:52:57] [INFO ] Deduced a trap composed of 3 places in 83 ms of which 1 ms to minimize.
[2022-05-16 22:52:58] [INFO ] Deduced a trap composed of 3 places in 83 ms of which 0 ms to minimize.
[2022-05-16 22:52:58] [INFO ] Deduced a trap composed of 3 places in 83 ms of which 1 ms to minimize.
[2022-05-16 22:52:58] [INFO ] Deduced a trap composed of 3 places in 77 ms of which 0 ms to minimize.
[2022-05-16 22:52:58] [INFO ] Deduced a trap composed of 3 places in 80 ms of which 1 ms to minimize.
[2022-05-16 22:52:58] [INFO ] Deduced a trap composed of 3 places in 81 ms of which 1 ms to minimize.
[2022-05-16 22:52:58] [INFO ] Deduced a trap composed of 3 places in 93 ms of which 0 ms to minimize.
[2022-05-16 22:52:59] [INFO ] Deduced a trap composed of 3 places in 77 ms of which 0 ms to minimize.
[2022-05-16 22:52:59] [INFO ] Deduced a trap composed of 3 places in 78 ms of which 0 ms to minimize.
[2022-05-16 22:52:59] [INFO ] Deduced a trap composed of 3 places in 77 ms of which 1 ms to minimize.
[2022-05-16 22:52:59] [INFO ] Deduced a trap composed of 3 places in 75 ms of which 1 ms to minimize.
[2022-05-16 22:52:59] [INFO ] Deduced a trap composed of 3 places in 73 ms of which 0 ms to minimize.
[2022-05-16 22:53:00] [INFO ] Deduced a trap composed of 3 places in 75 ms of which 0 ms to minimize.
[2022-05-16 22:53:00] [INFO ] Deduced a trap composed of 3 places in 72 ms of which 1 ms to minimize.
[2022-05-16 22:53:00] [INFO ] Deduced a trap composed of 3 places in 73 ms of which 0 ms to minimize.
[2022-05-16 22:53:00] [INFO ] Deduced a trap composed of 3 places in 73 ms of which 1 ms to minimize.
[2022-05-16 22:53:00] [INFO ] Deduced a trap composed of 3 places in 73 ms of which 0 ms to minimize.
[2022-05-16 22:53:00] [INFO ] Deduced a trap composed of 3 places in 66 ms of which 0 ms to minimize.
[2022-05-16 22:53:01] [INFO ] Deduced a trap composed of 3 places in 67 ms of which 1 ms to minimize.
[2022-05-16 22:53:01] [INFO ] Deduced a trap composed of 3 places in 73 ms of which 0 ms to minimize.
[2022-05-16 22:53:01] [INFO ] Deduced a trap composed of 3 places in 68 ms of which 0 ms to minimize.
[2022-05-16 22:53:01] [INFO ] Deduced a trap composed of 3 places in 68 ms of which 0 ms to minimize.
[2022-05-16 22:53:01] [INFO ] Deduced a trap composed of 3 places in 67 ms of which 1 ms to minimize.
[2022-05-16 22:53:01] [INFO ] Deduced a trap composed of 3 places in 62 ms of which 1 ms to minimize.
[2022-05-16 22:53:02] [INFO ] Deduced a trap composed of 3 places in 67 ms of which 1 ms to minimize.
[2022-05-16 22:53:02] [INFO ] Deduced a trap composed of 3 places in 67 ms of which 0 ms to minimize.
[2022-05-16 22:53:02] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 0 ms to minimize.
[2022-05-16 22:53:02] [INFO ] Deduced a trap composed of 3 places in 66 ms of which 1 ms to minimize.
[2022-05-16 22:53:02] [INFO ] Deduced a trap composed of 3 places in 64 ms of which 0 ms to minimize.
[2022-05-16 22:53:02] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 1 ms to minimize.
[2022-05-16 22:53:03] [INFO ] Deduced a trap composed of 3 places in 64 ms of which 0 ms to minimize.
[2022-05-16 22:53:03] [INFO ] Deduced a trap composed of 3 places in 70 ms of which 1 ms to minimize.
[2022-05-16 22:53:03] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 0 ms to minimize.
[2022-05-16 22:53:03] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 0 ms to minimize.
[2022-05-16 22:53:03] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 0 ms to minimize.
[2022-05-16 22:53:03] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 0 ms to minimize.
[2022-05-16 22:53:04] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 0 ms to minimize.
[2022-05-16 22:53:04] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 0 ms to minimize.
[2022-05-16 22:53:04] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 0 ms to minimize.
[2022-05-16 22:53:04] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 0 ms to minimize.
[2022-05-16 22:53:04] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 0 ms to minimize.
[2022-05-16 22:53:04] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 0 ms to minimize.
[2022-05-16 22:53:04] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 0 ms to minimize.
[2022-05-16 22:53:05] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 0 ms to minimize.
[2022-05-16 22:53:05] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 1 ms to minimize.
[2022-05-16 22:53:05] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 0 ms to minimize.
[2022-05-16 22:53:05] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
[2022-05-16 22:53:05] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 0 ms to minimize.
[2022-05-16 22:53:05] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 0 ms to minimize.
[2022-05-16 22:53:06] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 0 ms to minimize.
[2022-05-16 22:53:06] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
[2022-05-16 22:53:06] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
[2022-05-16 22:53:06] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 0 ms to minimize.
[2022-05-16 22:53:06] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 0 ms to minimize.
[2022-05-16 22:53:06] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
[2022-05-16 22:53:06] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 0 ms to minimize.
[2022-05-16 22:53:07] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 0 ms to minimize.
[2022-05-16 22:53:07] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 0 ms to minimize.
[2022-05-16 22:53:07] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
[2022-05-16 22:53:07] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 0 ms to minimize.
[2022-05-16 22:53:07] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2022-05-16 22:53:07] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
[2022-05-16 22:53:07] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2022-05-16 22:53:08] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2022-05-16 22:53:08] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2022-05-16 22:53:08] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2022-05-16 22:53:08] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2022-05-16 22:53:08] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2022-05-16 22:53:08] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2022-05-16 22:53:08] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 0 ms to minimize.
[2022-05-16 22:53:09] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2022-05-16 22:53:09] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2022-05-16 22:53:09] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2022-05-16 22:53:09] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2022-05-16 22:53:09] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2022-05-16 22:53:09] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2022-05-16 22:53:09] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2022-05-16 22:53:10] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-16 22:53:10] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-16 22:53:10] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-16 22:53:10] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-16 22:53:10] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-16 22:53:10] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2022-05-16 22:53:10] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2022-05-16 22:53:12] [INFO ] Deduced a trap composed of 3 places in 1916 ms of which 2 ms to minimize.
[2022-05-16 22:53:12] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 4
[2022-05-16 22:53:13] [INFO ] [Real]Absence check using 499 positive place invariants in 109 ms returned sat
[2022-05-16 22:53:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:53:14] [INFO ] [Real]Absence check using state equation in 1299 ms returned sat
[2022-05-16 22:53:14] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:53:14] [INFO ] [Nat]Absence check using 499 positive place invariants in 111 ms returned sat
[2022-05-16 22:53:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:53:27] [INFO ] [Nat]Absence check using state equation in 12465 ms returned sat
[2022-05-16 22:53:27] [INFO ] Deduced a trap composed of 3 places in 89 ms of which 1 ms to minimize.
[2022-05-16 22:53:27] [INFO ] Deduced a trap composed of 3 places in 95 ms of which 0 ms to minimize.
[2022-05-16 22:53:28] [INFO ] Deduced a trap composed of 3 places in 90 ms of which 1 ms to minimize.
[2022-05-16 22:53:28] [INFO ] Deduced a trap composed of 3 places in 88 ms of which 0 ms to minimize.
[2022-05-16 22:53:28] [INFO ] Deduced a trap composed of 3 places in 90 ms of which 0 ms to minimize.
[2022-05-16 22:53:28] [INFO ] Deduced a trap composed of 3 places in 92 ms of which 0 ms to minimize.
[2022-05-16 22:53:29] [INFO ] Deduced a trap composed of 3 places in 88 ms of which 0 ms to minimize.
[2022-05-16 22:53:29] [INFO ] Deduced a trap composed of 3 places in 89 ms of which 0 ms to minimize.
[2022-05-16 22:53:29] [INFO ] Deduced a trap composed of 3 places in 89 ms of which 0 ms to minimize.
[2022-05-16 22:53:29] [INFO ] Deduced a trap composed of 3 places in 88 ms of which 0 ms to minimize.
[2022-05-16 22:53:29] [INFO ] Deduced a trap composed of 3 places in 85 ms of which 0 ms to minimize.
[2022-05-16 22:53:30] [INFO ] Deduced a trap composed of 3 places in 84 ms of which 1 ms to minimize.
[2022-05-16 22:53:30] [INFO ] Deduced a trap composed of 3 places in 82 ms of which 1 ms to minimize.
[2022-05-16 22:53:30] [INFO ] Deduced a trap composed of 3 places in 81 ms of which 0 ms to minimize.
[2022-05-16 22:53:30] [INFO ] Deduced a trap composed of 3 places in 83 ms of which 0 ms to minimize.
[2022-05-16 22:53:30] [INFO ] Deduced a trap composed of 3 places in 78 ms of which 0 ms to minimize.
[2022-05-16 22:53:31] [INFO ] Deduced a trap composed of 3 places in 79 ms of which 0 ms to minimize.
[2022-05-16 22:53:31] [INFO ] Deduced a trap composed of 3 places in 77 ms of which 1 ms to minimize.
[2022-05-16 22:53:31] [INFO ] Deduced a trap composed of 3 places in 76 ms of which 0 ms to minimize.
[2022-05-16 22:53:31] [INFO ] Deduced a trap composed of 3 places in 74 ms of which 0 ms to minimize.
[2022-05-16 22:53:31] [INFO ] Deduced a trap composed of 3 places in 78 ms of which 0 ms to minimize.
[2022-05-16 22:53:32] [INFO ] Deduced a trap composed of 3 places in 72 ms of which 1 ms to minimize.
[2022-05-16 22:53:32] [INFO ] Deduced a trap composed of 3 places in 71 ms of which 1 ms to minimize.
[2022-05-16 22:53:32] [INFO ] Deduced a trap composed of 3 places in 72 ms of which 1 ms to minimize.
[2022-05-16 22:53:32] [INFO ] Deduced a trap composed of 3 places in 75 ms of which 0 ms to minimize.
[2022-05-16 22:53:32] [INFO ] Deduced a trap composed of 3 places in 76 ms of which 0 ms to minimize.
[2022-05-16 22:53:33] [INFO ] Deduced a trap composed of 3 places in 70 ms of which 0 ms to minimize.
[2022-05-16 22:53:33] [INFO ] Deduced a trap composed of 3 places in 69 ms of which 0 ms to minimize.
[2022-05-16 22:53:33] [INFO ] Deduced a trap composed of 3 places in 64 ms of which 0 ms to minimize.
[2022-05-16 22:53:33] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 1 ms to minimize.
[2022-05-16 22:53:33] [INFO ] Deduced a trap composed of 3 places in 62 ms of which 0 ms to minimize.
[2022-05-16 22:53:33] [INFO ] Deduced a trap composed of 3 places in 65 ms of which 1 ms to minimize.
[2022-05-16 22:53:34] [INFO ] Deduced a trap composed of 3 places in 64 ms of which 0 ms to minimize.
[2022-05-16 22:53:34] [INFO ] Deduced a trap composed of 3 places in 64 ms of which 0 ms to minimize.
[2022-05-16 22:53:34] [INFO ] Deduced a trap composed of 3 places in 61 ms of which 0 ms to minimize.
[2022-05-16 22:53:34] [INFO ] Deduced a trap composed of 3 places in 61 ms of which 0 ms to minimize.
[2022-05-16 22:53:34] [INFO ] Deduced a trap composed of 3 places in 61 ms of which 1 ms to minimize.
[2022-05-16 22:53:35] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 1 ms to minimize.
[2022-05-16 22:53:35] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 0 ms to minimize.
[2022-05-16 22:53:35] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 0 ms to minimize.
[2022-05-16 22:53:35] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 0 ms to minimize.
[2022-05-16 22:53:35] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 1 ms to minimize.
[2022-05-16 22:53:35] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 1 ms to minimize.
[2022-05-16 22:53:36] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 0 ms to minimize.
[2022-05-16 22:53:36] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 0 ms to minimize.
[2022-05-16 22:53:36] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 1 ms to minimize.
[2022-05-16 22:53:36] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 0 ms to minimize.
[2022-05-16 22:53:36] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 0 ms to minimize.
[2022-05-16 22:53:37] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 0 ms to minimize.
[2022-05-16 22:53:37] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 0 ms to minimize.
[2022-05-16 22:53:37] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
[2022-05-16 22:53:37] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 1 ms to minimize.
[2022-05-16 22:53:37] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 1 ms to minimize.
[2022-05-16 22:53:37] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 0 ms to minimize.
[2022-05-16 22:53:38] [INFO ] Deduced a trap composed of 3 places in 65 ms of which 1 ms to minimize.
[2022-05-16 22:53:38] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 0 ms to minimize.
[2022-05-16 22:53:38] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 0 ms to minimize.
[2022-05-16 22:53:38] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 0 ms to minimize.
[2022-05-16 22:53:38] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 0 ms to minimize.
[2022-05-16 22:53:39] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 0 ms to minimize.
[2022-05-16 22:53:39] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 0 ms to minimize.
[2022-05-16 22:53:39] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 0 ms to minimize.
[2022-05-16 22:53:39] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
[2022-05-16 22:53:39] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 0 ms to minimize.
[2022-05-16 22:53:39] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
[2022-05-16 22:53:40] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 0 ms to minimize.
[2022-05-16 22:53:40] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
[2022-05-16 22:53:40] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 0 ms to minimize.
[2022-05-16 22:53:40] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
[2022-05-16 22:53:40] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 0 ms to minimize.
[2022-05-16 22:53:40] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
[2022-05-16 22:53:41] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2022-05-16 22:53:41] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
[2022-05-16 22:53:41] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 0 ms to minimize.
[2022-05-16 22:53:41] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 0 ms to minimize.
[2022-05-16 22:53:41] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2022-05-16 22:53:41] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2022-05-16 22:53:42] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2022-05-16 22:53:42] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2022-05-16 22:53:42] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2022-05-16 22:53:42] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2022-05-16 22:53:42] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2022-05-16 22:53:42] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-16 22:53:43] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-16 22:53:43] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2022-05-16 22:53:43] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2022-05-16 22:53:43] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-16 22:53:43] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-16 22:53:43] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-16 22:53:43] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-16 22:53:44] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-16 22:53:44] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-16 22:53:44] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-16 22:53:44] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-16 22:53:44] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-16 22:53:44] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-16 22:53:45] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2022-05-16 22:53:45] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-16 22:53:45] [INFO ] Trap strengthening (SAT) tested/added 99/98 trap constraints in 18045 ms
[2022-05-16 22:53:45] [INFO ] Computed and/alt/rep : 2994/7485/2994 causal constraints (skipped 0 transitions) in 180 ms.
[2022-05-16 22:53:59] [INFO ] Added : 195 causal constraints over 39 iterations in 14170 ms. Result :unknown
[2022-05-16 22:53:59] [INFO ] [Real]Absence check using 499 positive place invariants in 108 ms returned sat
[2022-05-16 22:53:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:54:01] [INFO ] [Real]Absence check using state equation in 1265 ms returned sat
[2022-05-16 22:54:01] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:54:01] [INFO ] [Nat]Absence check using 499 positive place invariants in 104 ms returned sat
[2022-05-16 22:54:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:54:19] [INFO ] [Nat]Absence check using state equation in 18235 ms returned sat
[2022-05-16 22:54:20] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2022-05-16 22:54:20] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2022-05-16 22:54:20] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-16 22:54:20] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2022-05-16 22:54:20] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-16 22:54:20] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-16 22:54:21] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-16 22:54:21] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-16 22:54:21] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-16 22:54:21] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2022-05-16 22:54:21] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2022-05-16 22:54:21] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2022-05-16 22:54:22] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-16 22:54:22] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-16 22:54:22] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-16 22:54:22] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2022-05-16 22:54:22] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-16 22:54:22] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-16 22:54:23] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2022-05-16 22:54:23] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-16 22:54:23] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2022-05-16 22:54:23] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-16 22:54:23] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 4063 ms
[2022-05-16 22:54:24] [INFO ] Computed and/alt/rep : 2994/7485/2994 causal constraints (skipped 0 transitions) in 189 ms.
[2022-05-16 22:54:44] [INFO ] Added : 380 causal constraints over 76 iterations in 20413 ms.(timeout) Result :sat
[2022-05-16 22:54:44] [INFO ] [Real]Absence check using 499 positive place invariants in 100 ms returned sat
[2022-05-16 22:54:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:54:45] [INFO ] [Real]Absence check using state equation in 1200 ms returned sat
[2022-05-16 22:54:46] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:54:46] [INFO ] [Nat]Absence check using 499 positive place invariants in 101 ms returned sat
[2022-05-16 22:54:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:55:00] [INFO ] [Nat]Absence check using state equation in 13912 ms returned sat
[2022-05-16 22:55:00] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2022-05-16 22:55:00] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
[2022-05-16 22:55:00] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2022-05-16 22:55:00] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2022-05-16 22:55:01] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2022-05-16 22:55:01] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
[2022-05-16 22:55:01] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 0 ms to minimize.
[2022-05-16 22:55:01] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 0 ms to minimize.
[2022-05-16 22:55:01] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2022-05-16 22:55:02] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-16 22:55:02] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2022-05-16 22:55:02] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-16 22:55:02] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-16 22:55:02] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2022-05-16 22:55:03] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-16 22:55:03] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-16 22:55:03] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-16 22:55:03] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-16 22:55:03] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-16 22:55:03] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-16 22:55:04] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2022-05-16 22:55:04] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-16 22:55:04] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2022-05-16 22:55:04] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2022-05-16 22:55:04] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2022-05-16 22:55:04] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2022-05-16 22:55:05] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2022-05-16 22:55:05] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-16 22:55:05] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2022-05-16 22:55:05] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2022-05-16 22:55:05] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-16 22:55:05] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-16 22:55:06] [INFO ] Trap strengthening (SAT) tested/added 33/32 trap constraints in 5674 ms
[2022-05-16 22:55:06] [INFO ] Computed and/alt/rep : 2994/7485/2994 causal constraints (skipped 0 transitions) in 156 ms.
[2022-05-16 22:55:26] [INFO ] Added : 365 causal constraints over 73 iterations in 20230 ms.(timeout) Result :sat
[2022-05-16 22:55:26] [INFO ] [Real]Absence check using 499 positive place invariants in 102 ms returned sat
[2022-05-16 22:55:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:55:27] [INFO ] [Real]Absence check using state equation in 1192 ms returned sat
[2022-05-16 22:55:28] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:55:28] [INFO ] [Nat]Absence check using 499 positive place invariants in 112 ms returned sat
[2022-05-16 22:55:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:55:40] [INFO ] [Nat]Absence check using state equation in 12666 ms returned sat
[2022-05-16 22:55:41] [INFO ] Deduced a trap composed of 3 places in 73 ms of which 0 ms to minimize.
[2022-05-16 22:55:41] [INFO ] Deduced a trap composed of 3 places in 71 ms of which 0 ms to minimize.
[2022-05-16 22:55:41] [INFO ] Deduced a trap composed of 3 places in 67 ms of which 1 ms to minimize.
[2022-05-16 22:55:41] [INFO ] Deduced a trap composed of 3 places in 70 ms of which 0 ms to minimize.
[2022-05-16 22:55:41] [INFO ] Deduced a trap composed of 3 places in 64 ms of which 0 ms to minimize.
[2022-05-16 22:55:42] [INFO ] Deduced a trap composed of 3 places in 68 ms of which 0 ms to minimize.
[2022-05-16 22:55:42] [INFO ] Deduced a trap composed of 3 places in 65 ms of which 0 ms to minimize.
[2022-05-16 22:55:42] [INFO ] Deduced a trap composed of 3 places in 65 ms of which 0 ms to minimize.
[2022-05-16 22:55:42] [INFO ] Deduced a trap composed of 3 places in 65 ms of which 0 ms to minimize.
[2022-05-16 22:55:42] [INFO ] Deduced a trap composed of 3 places in 64 ms of which 0 ms to minimize.
[2022-05-16 22:55:42] [INFO ] Deduced a trap composed of 3 places in 69 ms of which 0 ms to minimize.
[2022-05-16 22:55:43] [INFO ] Deduced a trap composed of 3 places in 65 ms of which 0 ms to minimize.
[2022-05-16 22:55:43] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 1 ms to minimize.
[2022-05-16 22:55:43] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 0 ms to minimize.
[2022-05-16 22:55:43] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 1 ms to minimize.
[2022-05-16 22:55:43] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 1 ms to minimize.
[2022-05-16 22:55:44] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 0 ms to minimize.
[2022-05-16 22:55:44] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 1 ms to minimize.
[2022-05-16 22:55:44] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 1 ms to minimize.
[2022-05-16 22:55:44] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 0 ms to minimize.
[2022-05-16 22:55:44] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 0 ms to minimize.
[2022-05-16 22:55:44] [INFO ] Deduced a trap composed of 3 places in 68 ms of which 0 ms to minimize.
[2022-05-16 22:55:45] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 0 ms to minimize.
[2022-05-16 22:55:45] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 0 ms to minimize.
[2022-05-16 22:55:45] [INFO ] Deduced a trap composed of 3 places in 65 ms of which 0 ms to minimize.
[2022-05-16 22:55:45] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 1 ms to minimize.
[2022-05-16 22:55:45] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 0 ms to minimize.
[2022-05-16 22:55:45] [INFO ] Deduced a trap composed of 3 places in 73 ms of which 0 ms to minimize.
[2022-05-16 22:55:46] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 0 ms to minimize.
[2022-05-16 22:55:46] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 0 ms to minimize.
[2022-05-16 22:55:46] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
[2022-05-16 22:55:46] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 0 ms to minimize.
[2022-05-16 22:55:46] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 1 ms to minimize.
[2022-05-16 22:55:46] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 0 ms to minimize.
[2022-05-16 22:55:47] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 0 ms to minimize.
[2022-05-16 22:55:47] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 0 ms to minimize.
[2022-05-16 22:55:47] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 1 ms to minimize.
[2022-05-16 22:55:47] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 0 ms to minimize.
[2022-05-16 22:55:47] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 0 ms to minimize.
[2022-05-16 22:55:47] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 0 ms to minimize.
[2022-05-16 22:55:48] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 0 ms to minimize.
[2022-05-16 22:55:48] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2022-05-16 22:55:48] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 0 ms to minimize.
[2022-05-16 22:55:48] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 0 ms to minimize.
[2022-05-16 22:55:48] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
[2022-05-16 22:55:48] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 0 ms to minimize.
[2022-05-16 22:55:49] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 0 ms to minimize.
[2022-05-16 22:55:49] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
[2022-05-16 22:55:49] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2022-05-16 22:55:49] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
[2022-05-16 22:55:49] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
[2022-05-16 22:55:49] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
[2022-05-16 22:55:49] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2022-05-16 22:55:50] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
[2022-05-16 22:55:50] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 0 ms to minimize.
[2022-05-16 22:55:50] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-16 22:55:50] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
[2022-05-16 22:55:50] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2022-05-16 22:55:50] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2022-05-16 22:55:51] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2022-05-16 22:55:51] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2022-05-16 22:55:51] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2022-05-16 22:55:51] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-16 22:55:51] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2022-05-16 22:55:51] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2022-05-16 22:55:51] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-16 22:55:52] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-16 22:55:52] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-16 22:55:52] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-16 22:55:52] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-16 22:55:52] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-16 22:55:52] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-16 22:55:53] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-16 22:55:53] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-16 22:55:53] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2022-05-16 22:55:53] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-16 22:55:53] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2022-05-16 22:55:53] [INFO ] Trap strengthening (SAT) tested/added 78/77 trap constraints in 12783 ms
[2022-05-16 22:55:53] [INFO ] Computed and/alt/rep : 2994/7485/2994 causal constraints (skipped 0 transitions) in 152 ms.
[2022-05-16 22:56:04] [INFO ] Added : 115 causal constraints over 23 iterations in 10745 ms. Result :unknown
[2022-05-16 22:56:04] [INFO ] [Real]Absence check using 499 positive place invariants in 98 ms returned sat
[2022-05-16 22:56:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:56:05] [INFO ] [Real]Absence check using state equation in 1185 ms returned sat
[2022-05-16 22:56:06] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:56:06] [INFO ] [Nat]Absence check using 499 positive place invariants in 101 ms returned sat
[2022-05-16 22:56:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:56:19] [INFO ] [Nat]Absence check using state equation in 13266 ms returned sat
[2022-05-16 22:56:19] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 0 ms to minimize.
[2022-05-16 22:56:19] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 0 ms to minimize.
[2022-05-16 22:56:20] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
[2022-05-16 22:56:20] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 0 ms to minimize.
[2022-05-16 22:56:20] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
[2022-05-16 22:56:20] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 0 ms to minimize.
[2022-05-16 22:56:20] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 0 ms to minimize.
[2022-05-16 22:56:20] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
[2022-05-16 22:56:21] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2022-05-16 22:56:21] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 0 ms to minimize.
[2022-05-16 22:56:21] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 0 ms to minimize.
[2022-05-16 22:56:21] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2022-05-16 22:56:21] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 0 ms to minimize.
[2022-05-16 22:56:21] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2022-05-16 22:56:22] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
[2022-05-16 22:56:22] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2022-05-16 22:56:22] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2022-05-16 22:56:22] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2022-05-16 22:56:22] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
[2022-05-16 22:56:22] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2022-05-16 22:56:23] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2022-05-16 22:56:23] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2022-05-16 22:56:23] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2022-05-16 22:56:23] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2022-05-16 22:56:23] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-16 22:56:23] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2022-05-16 22:56:23] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2022-05-16 22:56:24] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-16 22:56:24] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2022-05-16 22:56:24] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-16 22:56:24] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-16 22:56:24] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-16 22:56:24] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 0 ms to minimize.
[2022-05-16 22:56:25] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-16 22:56:25] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2022-05-16 22:56:25] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2022-05-16 22:56:25] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-16 22:56:25] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-16 22:56:25] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-16 22:56:26] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-16 22:56:26] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2022-05-16 22:56:26] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-16 22:56:26] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-16 22:56:26] [INFO ] Trap strengthening (SAT) tested/added 44/43 trap constraints in 7035 ms
[2022-05-16 22:56:26] [INFO ] Computed and/alt/rep : 2994/7485/2994 causal constraints (skipped 0 transitions) in 154 ms.
[2022-05-16 22:56:42] [INFO ] Added : 305 causal constraints over 61 iterations in 16078 ms. Result :sat
[2022-05-16 22:56:43] [INFO ] [Real]Absence check using 499 positive place invariants in 97 ms returned sat
[2022-05-16 22:56:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:56:44] [INFO ] [Real]Absence check using state equation in 1180 ms returned sat
[2022-05-16 22:56:44] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:56:44] [INFO ] [Nat]Absence check using 499 positive place invariants in 103 ms returned sat
[2022-05-16 22:56:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:57:00] [INFO ] [Nat]Absence check using state equation in 15546 ms returned unknown
[2022-05-16 22:57:00] [INFO ] [Real]Absence check using 499 positive place invariants in 99 ms returned sat
[2022-05-16 22:57:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:57:01] [INFO ] [Real]Absence check using state equation in 1202 ms returned sat
[2022-05-16 22:57:02] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:57:02] [INFO ] [Nat]Absence check using 499 positive place invariants in 120 ms returned sat
[2022-05-16 22:57:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:57:12] [INFO ] [Nat]Absence check using state equation in 10073 ms returned sat
[2022-05-16 22:57:12] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
[2022-05-16 22:57:12] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2022-05-16 22:57:12] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 0 ms to minimize.
[2022-05-16 22:57:13] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2022-05-16 22:57:13] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2022-05-16 22:57:13] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2022-05-16 22:57:13] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2022-05-16 22:57:14] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-16 22:57:14] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2022-05-16 22:57:14] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2022-05-16 22:57:14] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2022-05-16 22:57:14] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2022-05-16 22:57:14] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2022-05-16 22:57:15] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2022-05-16 22:57:15] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2022-05-16 22:57:15] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2022-05-16 22:57:15] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-16 22:57:15] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2022-05-16 22:57:15] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2022-05-16 22:57:16] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-16 22:57:16] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-16 22:57:16] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-16 22:57:16] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2022-05-16 22:57:16] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2022-05-16 22:57:16] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-16 22:57:17] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2022-05-16 22:57:17] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-16 22:57:17] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2022-05-16 22:57:17] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2022-05-16 22:57:48] [INFO ] Deduced a trap composed of 3 places in 1913 ms of which 2 ms to minimize.
[2022-05-16 22:57:48] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 11
[2022-05-16 22:57:49] [INFO ] [Real]Absence check using 499 positive place invariants in 101 ms returned sat
[2022-05-16 22:57:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:57:50] [INFO ] [Real]Absence check using state equation in 1182 ms returned sat
[2022-05-16 22:57:50] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:57:50] [INFO ] [Nat]Absence check using 499 positive place invariants in 101 ms returned sat
[2022-05-16 22:57:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:58:00] [INFO ] [Nat]Absence check using state equation in 9878 ms returned sat
[2022-05-16 22:58:00] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2022-05-16 22:58:01] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2022-05-16 22:58:01] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2022-05-16 22:58:01] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-16 22:58:01] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2022-05-16 22:58:01] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-16 22:58:01] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2022-05-16 22:58:02] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2022-05-16 22:58:02] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-16 22:58:02] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2022-05-16 22:58:02] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-16 22:58:02] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-16 22:58:02] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2022-05-16 22:58:03] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-16 22:58:37] [INFO ] Deduced a trap composed of 3 places in 1919 ms of which 2 ms to minimize.
[2022-05-16 22:58:37] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 12
[2022-05-16 22:58:37] [INFO ] [Real]Absence check using 499 positive place invariants in 103 ms returned sat
[2022-05-16 22:58:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:58:38] [INFO ] [Real]Absence check using state equation in 1218 ms returned sat
[2022-05-16 22:58:39] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:58:39] [INFO ] [Nat]Absence check using 499 positive place invariants in 101 ms returned sat
[2022-05-16 22:58:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:58:50] [INFO ] [Nat]Absence check using state equation in 10812 ms returned sat
[2022-05-16 22:58:50] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2022-05-16 22:58:50] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
[2022-05-16 22:58:50] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2022-05-16 22:58:50] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2022-05-16 22:58:51] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2022-05-16 22:58:51] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-16 22:58:51] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-16 22:58:51] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2022-05-16 22:58:51] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-16 22:58:51] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2022-05-16 22:58:52] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2022-05-16 22:58:52] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2022-05-16 22:58:52] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-16 22:58:52] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-16 22:58:52] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2022-05-16 22:58:52] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-16 22:58:53] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2022-05-16 22:58:53] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2022-05-16 22:58:53] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-16 22:58:53] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2022-05-16 22:58:53] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2022-05-16 22:58:53] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-16 22:58:54] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2022-05-16 22:58:54] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-16 22:58:54] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2022-05-16 22:58:54] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2022-05-16 22:58:54] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2022-05-16 22:58:54] [INFO ] Trap strengthening (SAT) tested/added 28/27 trap constraints in 4625 ms
[2022-05-16 22:58:55] [INFO ] Computed and/alt/rep : 2994/7485/2994 causal constraints (skipped 0 transitions) in 156 ms.
[2022-05-16 22:59:03] [INFO ] Added : 50 causal constraints over 10 iterations in 8191 ms. Result :unknown
Fused 14 Parikh solutions to 10 different solutions.
Interrupted Parikh walk after 506947 steps, including 4 resets, run timeout after 30001 ms. (steps per millisecond=16 ) properties (out of 14) seen :7
Interrupted Parikh walk after 639523 steps, including 6 resets, run timeout after 30001 ms. (steps per millisecond=21 ) properties (out of 7) seen :0
Interrupted Parikh walk after 497229 steps, including 3 resets, run timeout after 30001 ms. (steps per millisecond=16 ) properties (out of 7) seen :2
Interrupted Parikh walk after 629771 steps, including 7 resets, run timeout after 30001 ms. (steps per millisecond=20 ) properties (out of 5) seen :2
Support contains 3 out of 2495 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2495/2495 places, 3992/3992 transitions.
Graph (complete) has 5988 edges and 2495 vertex of which 15 are kept as prefixes of interest. Removing 2480 places using SCC suffix rule.2 ms
Discarding 2480 places :
Also discarding 3968 output transitions
Drop transitions removed 3968 transitions
Applied a total of 1 rules in 8 ms. Remains 15 /2495 variables (removed 2480) and now considering 24/3992 (removed 3968) transitions.
Finished structural reductions, in 1 iterations. Remains : 15/2495 places, 24/3992 transitions.
[2022-05-16 23:01:03] [INFO ] Flatten gal took : 1 ms
[2022-05-16 23:01:03] [INFO ] Flatten gal took : 1 ms
[2022-05-16 23:01:03] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8716195581296484995.gal : 0 ms
[2022-05-16 23:01:03] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7396976941796823277.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality8716195581296484995.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality7396976941796823277.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality8716195581296484995.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality7396976941796823277.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality7396976941796823277.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 8
Reachability property qltransition_2729 is true.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :8 after 25
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :25 after 50
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :50 after 116
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :116 after 314
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :314 after 974
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :974 after 3336
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :3336 after 12194
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :12194 after 46219
Detected timeout of ITS tools.
[2022-05-16 23:01:18] [INFO ] Flatten gal took : 3 ms
[2022-05-16 23:01:18] [INFO ] Applying decomposition
[2022-05-16 23:01:18] [INFO ] Flatten gal took : 1 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph4346670939442747330.txt, -o, /tmp/graph4346670939442747330.bin, -w, /tmp/graph4346670939442747330.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph4346670939442747330.bin, -l, -1, -v, -w, /tmp/graph4346670939442747330.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-05-16 23:01:18] [INFO ] Decomposing Gal with order
[2022-05-16 23:01:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 23:01:18] [INFO ] Flatten gal took : 26 ms
[2022-05-16 23:01:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2022-05-16 23:01:18] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3013729295637683776.gal : 0 ms
[2022-05-16 23:01:18] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6909386509533078999.prop : 7 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality3013729295637683776.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality6909386509533078999.prop, --nowitness], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality3013729295637683776.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality6909386509533078999.prop --nowitness
Loading property file /tmp/ReachabilityCardinality6909386509533078999.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :36 after 69
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :69 after 134
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :134 after 263
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :263 after 9469
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :9469 after 9469
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :9469 after 18383
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :18383 after 38107
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :38107 after 84784
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :84784 after 162622
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :162622 after 286995
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10224655506628398149
[2022-05-16 23:01:33] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10224655506628398149
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin10224655506628398149]
Compilation finished in 151 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin10224655506628398149]
Link finished in 52 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, -i, qltransition_3041==true], workingDir=/tmp/ltsmin10224655506628398149]
LTSmin run took 197 ms.
Found Violation
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, -i, qltransition_3305==true], workingDir=/tmp/ltsmin10224655506628398149]
LTSmin run took 185 ms.
Found Violation
Able to resolve query QuasiLiveness after proving 2001 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK PROBABILISTIC_WALK PARIKH_WALK LTSMIN DECISION_DIAGRAMS COLLATERAL_PROCESSING BESTFIRST_WALK TOPOLOGICAL INITIAL_STATE SAT_SMT EXPLICIT

BK_STOP 1652742094778

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ QuasiLiveness = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution QuasiLiveness -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination QuasiLiveness -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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="JoinFreeModules-PT-0500"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="gold2021"
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-4028"
echo " Executing tool gold2021"
echo " Input is JoinFreeModules-PT-0500, examination is QuasiLiveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r144-tall-165271830800127"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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