fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r325-tall-167889197000270
Last Updated
May 14, 2023

About the Execution of ITS-Tools for RERS2020-PT-pb107

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16207.396 661033.00 1352275.00 11142.80 ???FT???F?F??FF? normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r325-tall-167889197000270.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is RERS2020-PT-pb107, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r325-tall-167889197000270
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 59M
-rw-r--r-- 1 mcc users 6.9K Feb 26 08:35 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Feb 26 08:35 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 26 08:30 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 26 08:30 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Feb 25 16:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Feb 25 16:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.4K Feb 26 08:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 93K Feb 26 08:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K Feb 26 08:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K Feb 26 08:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 59M Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678998561908

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=RERS2020-PT-pb107
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202303021504
[2023-03-16 20:29:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-16 20:29:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-16 20:29:25] [INFO ] Load time of PNML (sax parser for PT used): 1913 ms
[2023-03-16 20:29:25] [INFO ] Transformed 1382 places.
[2023-03-16 20:29:26] [INFO ] Transformed 104643 transitions.
[2023-03-16 20:29:26] [INFO ] Found NUPN structural information;
[2023-03-16 20:29:26] [INFO ] Parsed PT model containing 1382 places and 104643 transitions and 417030 arcs in 2325 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 11427 transitions
Reduce redundant transitions removed 11427 transitions.
FORMULA RERS2020-PT-pb107-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 3 resets, run finished after 2124 ms. (steps per millisecond=4 ) properties (out of 15) seen :2
FORMULA RERS2020-PT-pb107-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA RERS2020-PT-pb107-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 192 ms. (steps per millisecond=52 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 169 ms. (steps per millisecond=59 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 232 ms. (steps per millisecond=43 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 150 ms. (steps per millisecond=66 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 225 ms. (steps per millisecond=44 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 13) seen :0
Running SMT prover for 13 properties.
[2023-03-16 20:29:31] [INFO ] Flow matrix only has 62870 transitions (discarded 30346 similar events)
// Phase 1: matrix 62870 rows 1382 cols
[2023-03-16 20:29:31] [INFO ] Flatten gal took : 3210 ms
[2023-03-16 20:29:31] [INFO ] Computed 25 place invariants in 393 ms
[2023-03-16 20:29:32] [INFO ] After 675ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2023-03-16 20:29:32] [INFO ] [Nat]Absence check using 13 positive place invariants in 13 ms returned sat
[2023-03-16 20:29:32] [INFO ] [Nat]Absence check using 13 positive and 12 generalized place invariants in 3 ms returned sat
[2023-03-16 20:29:33] [INFO ] Flatten gal took : 2303 ms
[2023-03-16 20:29:34] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3858218005451627351.gal : 348 ms
[2023-03-16 20:29:34] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6572188267527785948.prop : 12 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality3858218005451627351.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6572188267527785948.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality6572188267527785948.prop.
[2023-03-16 20:29:57] [INFO ] After 24268ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :13
[2023-03-16 20:29:58] [INFO ] State equation strengthened by 3692 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-16 20:29:58] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-16 20:29:58] [INFO ] After 26036ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:13
Fused 13 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 39 ms.
Support contains 164 out of 1382 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1382/1382 places, 93216/93216 transitions.
Graph (complete) has 84016 edges and 1382 vertex of which 1381 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.92 ms
Discarding 1 places :
Also discarding 0 output transitions
Ensure Unique test removed 12 places
Drop transitions removed 2810 transitions
Reduce isomorphic transitions removed 2810 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 2823 rules applied. Total rules applied 2824 place count 1369 transition count 90405
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2825 place count 1368 transition count 90405
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2825 place count 1368 transition count 90403
Deduced a syphon composed of 2 places in 61 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 2829 place count 1366 transition count 90403
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 2831 place count 1366 transition count 90401
Performed 13 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 13 places in 57 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 2857 place count 1353 transition count 90385
Drop transitions removed 4 transitions
Ensure Unique test removed 427 transitions
Reduce isomorphic transitions removed 431 transitions.
Iterating post reduction 3 with 431 rules applied. Total rules applied 3288 place count 1353 transition count 89954
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 107 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 3296 place count 1349 transition count 89950
Drop transitions removed 4 transitions
Ensure Unique test removed 92 transitions
Reduce isomorphic transitions removed 96 transitions.
Iterating post reduction 4 with 96 rules applied. Total rules applied 3392 place count 1349 transition count 89854
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 50 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 3394 place count 1348 transition count 89855
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 3397 place count 1348 transition count 89852
Free-agglomeration rule applied 23 times.
Iterating global reduction 6 with 23 rules applied. Total rules applied 3420 place count 1348 transition count 89829
Reduce places removed 23 places and 0 transitions.
Drop transitions removed 28 transitions
Ensure Unique test removed 441 transitions
Reduce isomorphic transitions removed 469 transitions.
Iterating post reduction 6 with 492 rules applied. Total rules applied 3912 place count 1325 transition count 89360
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 7 with 10 rules applied. Total rules applied 3922 place count 1325 transition count 89856
Reduce places removed 10 places and 0 transitions.
Drop transitions removed 4 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 7 with 21 rules applied. Total rules applied 3943 place count 1315 transition count 89845
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 3946 place count 1315 transition count 89845
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 3948 place count 1315 transition count 89843
Applied a total of 3948 rules in 4904 ms. Remains 1315 /1382 variables (removed 67) and now considering 89843/93216 (removed 3373) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4919 ms. Remains : 1315/1382 places, 89843/93216 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 1008 ms. (steps per millisecond=9 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 13) seen :1
FORMULA RERS2020-PT-pb107-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 12) seen :0
Interrupted probabilistic random walk after 15067 steps, run timeout after 6002 ms. (steps per millisecond=2 ) properties seen :{}
Probabilistic random walk after 15067 steps, saw 12061 distinct states, run finished after 6004 ms. (steps per millisecond=2 ) properties seen :0
Running SMT prover for 12 properties.
[2023-03-16 20:30:11] [INFO ] Flow matrix only has 62369 transitions (discarded 27474 similar events)
// Phase 1: matrix 62369 rows 1315 cols
[2023-03-16 20:30:12] [INFO ] Computed 12 place invariants in 313 ms
[2023-03-16 20:30:12] [INFO ] After 473ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-16 20:30:12] [INFO ] [Nat]Absence check using 12 positive place invariants in 12 ms returned sat
[2023-03-16 20:30:37] [INFO ] After 24323ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2023-03-16 20:30:38] [INFO ] State equation strengthened by 3686 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-16 20:30:38] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-16 20:30:38] [INFO ] After 25780ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:12
Fused 12 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 18 ms.
Support contains 163 out of 1315 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1315/1315 places, 89843/89843 transitions.
Applied a total of 0 rules in 400 ms. Remains 1315 /1315 variables (removed 0) and now considering 89843/89843 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 400 ms. Remains : 1315/1315 places, 89843/89843 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1046 ms. (steps per millisecond=9 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 12) seen :1
FORMULA RERS2020-PT-pb107-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 11) seen :0
Interrupted probabilistic random walk after 18638 steps, run timeout after 6001 ms. (steps per millisecond=3 ) properties seen :{}
Probabilistic random walk after 18638 steps, saw 15006 distinct states, run finished after 6001 ms. (steps per millisecond=3 ) properties seen :0
Running SMT prover for 11 properties.
[2023-03-16 20:30:47] [INFO ] Flow matrix only has 62369 transitions (discarded 27474 similar events)
[2023-03-16 20:30:47] [INFO ] Invariant cache hit.
[2023-03-16 20:30:47] [INFO ] After 446ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-16 20:30:48] [INFO ] [Nat]Absence check using 12 positive place invariants in 9 ms returned sat
[2023-03-16 20:31:13] [INFO ] After 24755ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-16 20:31:13] [INFO ] State equation strengthened by 3686 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-16 20:31:13] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-16 20:31:13] [INFO ] After 25974ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:11
Fused 11 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 11 ms.
Support contains 161 out of 1315 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1315/1315 places, 89843/89843 transitions.
Applied a total of 0 rules in 525 ms. Remains 1315 /1315 variables (removed 0) and now considering 89843/89843 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 525 ms. Remains : 1315/1315 places, 89843/89843 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 974 ms. (steps per millisecond=10 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 155 ms. (steps per millisecond=64 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 11) seen :0
Interrupted probabilistic random walk after 13782 steps, run timeout after 6002 ms. (steps per millisecond=2 ) properties seen :{}
Probabilistic random walk after 13782 steps, saw 10886 distinct states, run finished after 6002 ms. (steps per millisecond=2 ) properties seen :0
Running SMT prover for 11 properties.
[2023-03-16 20:31:22] [INFO ] Flow matrix only has 62369 transitions (discarded 27474 similar events)
[2023-03-16 20:31:22] [INFO ] Invariant cache hit.
[2023-03-16 20:31:23] [INFO ] After 418ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-16 20:31:23] [INFO ] [Nat]Absence check using 12 positive place invariants in 10 ms returned sat
[2023-03-16 20:31:48] [INFO ] After 24410ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-16 20:31:48] [INFO ] State equation strengthened by 3686 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-16 20:31:48] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-16 20:31:48] [INFO ] After 25453ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:11
Fused 11 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 10 ms.
Support contains 161 out of 1315 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1315/1315 places, 89843/89843 transitions.
Applied a total of 0 rules in 395 ms. Remains 1315 /1315 variables (removed 0) and now considering 89843/89843 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 395 ms. Remains : 1315/1315 places, 89843/89843 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1315/1315 places, 89843/89843 transitions.
Applied a total of 0 rules in 404 ms. Remains 1315 /1315 variables (removed 0) and now considering 89843/89843 (removed 0) transitions.
[2023-03-16 20:31:49] [INFO ] Flow matrix only has 62369 transitions (discarded 27474 similar events)
[2023-03-16 20:31:49] [INFO ] Invariant cache hit.
[2023-03-16 20:31:52] [INFO ] Implicit Places using invariants in 3284 ms returned []
Implicit Place search using SMT only with invariants took 3288 ms to find 0 implicit places.
[2023-03-16 20:31:52] [INFO ] Flow matrix only has 62369 transitions (discarded 27474 similar events)
[2023-03-16 20:31:52] [INFO ] Invariant cache hit.
[2023-03-16 20:32:22] [INFO ] Dead Transitions using invariants and state equation in 30212 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33916 ms. Remains : 1315/1315 places, 89843/89843 transitions.
Graph (trivial) has 23958 edges and 1315 vertex of which 847 / 1315 are part of one of the 133 SCC in 7 ms
Free SCC test removed 714 places
Drop transitions removed 23112 transitions
Ensure Unique test removed 48969 transitions
Reduce isomorphic transitions removed 72081 transitions.
Graph (complete) has 15268 edges and 601 vertex of which 588 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.7 ms
Discarding 13 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 17 place count 588 transition count 17745
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 17 place count 588 transition count 17744
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 19 place count 587 transition count 17744
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 22 place count 584 transition count 17729
Iterating global reduction 1 with 3 rules applied. Total rules applied 25 place count 584 transition count 17729
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 4 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 31 place count 581 transition count 17726
Ensure Unique test removed 61 transitions
Reduce isomorphic transitions removed 61 transitions.
Iterating post reduction 1 with 61 rules applied. Total rules applied 92 place count 581 transition count 17665
Drop transitions removed 7994 transitions
Redundant transition composition rules discarded 7994 transitions
Iterating global reduction 2 with 7994 rules applied. Total rules applied 8086 place count 581 transition count 9671
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 11201 edges and 577 vertex of which 566 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.4 ms
Discarding 11 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Iterating post reduction 2 with 12 rules applied. Total rules applied 8098 place count 566 transition count 9660
Drop transitions removed 46 transitions
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 3 with 63 rules applied. Total rules applied 8161 place count 566 transition count 9597
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 8161 place count 566 transition count 9596
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 8163 place count 565 transition count 9596
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 8165 place count 563 transition count 9588
Iterating global reduction 4 with 2 rules applied. Total rules applied 8167 place count 563 transition count 9588
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 8168 place count 562 transition count 9583
Iterating global reduction 4 with 1 rules applied. Total rules applied 8169 place count 562 transition count 9583
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 8171 place count 561 transition count 9582
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 8180 place count 561 transition count 9573
Free-agglomeration rule applied 12 times.
Iterating global reduction 4 with 12 rules applied. Total rules applied 8192 place count 561 transition count 9561
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 84 transitions
Reduce isomorphic transitions removed 84 transitions.
Iterating post reduction 4 with 96 rules applied. Total rules applied 8288 place count 549 transition count 9477
Drop transitions removed 130 transitions
Redundant transition composition rules discarded 130 transitions
Iterating global reduction 5 with 130 rules applied. Total rules applied 8418 place count 549 transition count 9347
Free-agglomeration rule applied 3 times.
Iterating global reduction 5 with 3 rules applied. Total rules applied 8421 place count 549 transition count 9344
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 8424 place count 546 transition count 9344
Drop transitions removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 6 with 26 rules applied. Total rules applied 8450 place count 546 transition count 9318
Free-agglomeration rule applied 2 times.
Iterating global reduction 6 with 2 rules applied. Total rules applied 8452 place count 546 transition count 9316
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 8454 place count 544 transition count 9316
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 7 with 4 rules applied. Total rules applied 8458 place count 544 transition count 9312
Free-agglomeration rule (complex) applied 8 times with reduction of 25 identical transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 8466 place count 544 transition count 9484
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 90 transitions
Reduce isomorphic transitions removed 90 transitions.
Iterating post reduction 7 with 98 rules applied. Total rules applied 8564 place count 536 transition count 9394
Drop transitions removed 61 transitions
Redundant transition composition rules discarded 61 transitions
Iterating global reduction 8 with 61 rules applied. Total rules applied 8625 place count 536 transition count 9333
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 8 with 1 rules applied. Total rules applied 8626 place count 536 transition count 9343
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 8627 place count 535 transition count 9343
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 9 with 6 rules applied. Total rules applied 8633 place count 535 transition count 9337
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 9 with 1 rules applied. Total rules applied 8634 place count 535 transition count 9348
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 8635 place count 534 transition count 9348
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 10 with 8 rules applied. Total rules applied 8643 place count 534 transition count 9340
Partial Free-agglomeration rule applied 21 times.
Drop transitions removed 21 transitions
Iterating global reduction 10 with 21 rules applied. Total rules applied 8664 place count 534 transition count 9340
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 10 with 5 rules applied. Total rules applied 8669 place count 534 transition count 9335
Applied a total of 8669 rules in 4874 ms. Remains 534 /1315 variables (removed 781) and now considering 9335/89843 (removed 80508) transitions.
Running SMT prover for 11 properties.
[2023-03-16 20:32:27] [INFO ] Flow matrix only has 9283 transitions (discarded 52 similar events)
// Phase 1: matrix 9283 rows 534 cols
[2023-03-16 20:32:27] [INFO ] Computed 1 place invariants in 38 ms
[2023-03-16 20:32:28] [INFO ] After 138ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-16 20:32:28] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-16 20:32:31] [INFO ] After 3330ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-16 20:32:31] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-16 20:32:33] [INFO ] After 1919ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :11
[2023-03-16 20:32:36] [INFO ] After 5013ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 1760 ms.
[2023-03-16 20:32:38] [INFO ] After 10363ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
ITS runner failed with exception null
java.lang.InterruptedException
at java.base/java.lang.Object.wait(Native Method)
at java.base/java.lang.Thread.join(Thread.java:1304)
at java.base/java.lang.Thread.join(Thread.java:1372)
at fr.lip6.move.gal.application.runner.AbstractRunner.join(AbstractRunner.java:27)
at fr.lip6.move.gal.application.runner.its.ITSRunner.join(ITSRunner.java:177)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.verifyWithSDD(GlobalPropertySolver.java:675)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.lambda$2(ReachabilitySolver.java:63)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-16 20:32:41] [INFO ] Flatten gal took : 2299 ms
[2023-03-16 20:32:41] [INFO ] Applying decomposition
[2023-03-16 20:32:43] [INFO ] Flatten gal took : 2275 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph3730868985792641244.txt' '-o' '/tmp/graph3730868985792641244.bin' '-w' '/tmp/graph3730868985792641244.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph3730868985792641244.bin' '-l' '-1' '-v' '-w' '/tmp/graph3730868985792641244.weights' '-q' '0' '-e' '0.001'
[2023-03-16 20:32:49] [INFO ] Decomposing Gal with order
[2023-03-16 20:32:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 20:32:57] [INFO ] Removed a total of 203768 redundant transitions.
[2023-03-16 20:32:58] [INFO ] Flatten gal took : 6555 ms
SDD proceeding with computation,13 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,13 properties remain. new max is 8
SDD size :4 after 8
SDD proceeding with computation,13 properties remain. new max is 16
SDD size :8 after 20
SDD proceeding with computation,13 properties remain. new max is 32
SDD size :20 after 24
[2023-03-16 20:33:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 3337 labels/synchronizations in 3772 ms.
[2023-03-16 20:33:04] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5874470986490072301.gal : 294 ms
[2023-03-16 20:33:04] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13510506645435086241.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality5874470986490072301.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13510506645435086241.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
SDD proceeding with computation,13 properties remain. new max is 64
SDD size :24 after 36
SDD proceeding with computation,13 properties remain. new max is 128
SDD size :36 after 92
SDD proceeding with computation,13 properties remain. new max is 256
SDD size :92 after 96
SDD proceeding with computation,13 properties remain. new max is 512
SDD size :96 after 660
SDD proceeding with computation,13 properties remain. new max is 1024
SDD size :660 after 1948
Loading property file /tmp/ReachabilityCardinality13510506645435086241.prop.
SDD proceeding with computation,13 properties remain. new max is 2048
SDD size :1948 after 4540
SDD proceeding with computation,13 properties remain. new max is 4096
SDD size :4540 after 21476
SDD proceeding with computation,11 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,11 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,11 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,11 properties remain. new max is 32
SDD size :1 after 1
SDD proceeding with computation,11 properties remain. new max is 64
SDD size :1 after 2
SDD proceeding with computation,11 properties remain. new max is 128
SDD size :2 after 8
SDD proceeding with computation,11 properties remain. new max is 256
SDD size :8 after 8
SDD proceeding with computation,11 properties remain. new max is 512
SDD size :8 after 8
SDD proceeding with computation,11 properties remain. new max is 1024
SDD size :8 after 8
SDD proceeding with computation,11 properties remain. new max is 2048
SDD size :8 after 8
SDD proceeding with computation,11 properties remain. new max is 4096
SDD size :8 after 8
SDD proceeding with computation,11 properties remain. new max is 8192
SDD size :8 after 576
SDD proceeding with computation,11 properties remain. new max is 16384
SDD size :576 after 26496
SDD proceeding with computation,13 properties remain. new max is 8192
SDD size :21476 after 2.18409e+06
SDD proceeding with computation,11 properties remain. new max is 32768
SDD size :2.83072e+11 after 2.84593e+11
Invariant property RERS2020-PT-pb107-ReachabilityCardinality-14 does not hold.
FORMULA RERS2020-PT-pb107-ReachabilityCardinality-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,13 properties remain. new max is 16384
SDD size :2.18409e+06 after 4.27304e+06
SDD proceeding with computation,10 properties remain. new max is 32768
SDD size :1.7017e+13 after 1.70694e+13
SDD proceeding with computation,10 properties remain. new max is 65536
SDD size :1.70694e+13 after 1.89435e+13
SDD proceeding with computation,13 properties remain. new max is 32768
SDD size :4.27304e+06 after 7.16187e+06
SDD proceeding with computation,10 properties remain. new max is 131072
SDD size :1.89435e+13 after 1.89483e+13

BK_STOP 1678999222941

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="RERS2020-PT-pb107"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is RERS2020-PT-pb107, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r325-tall-167889197000270"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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