Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 70M
-rw-r--r-- 1 mcc users 7.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:13 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 16:19 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 19 07:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:52 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 121K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 91K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 19 07:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 19 15:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 2 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 69M May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME StableMarking

=== Now, execution of the tool begins

BK_START 1716799980484

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=RERS17pb115-PT-8
Not applying reductions.
Model is PT
StableMarking PT
Running Version 202304061127
[2024-05-27 08:53:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2024-05-27 08:53:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 08:53:04] [INFO ] Load time of PNML (sax parser for PT used): 1936 ms
[2024-05-27 08:53:04] [INFO ] Transformed 1399 places.
[2024-05-27 08:53:04] [INFO ] Transformed 144369 transitions.
[2024-05-27 08:53:04] [INFO ] Parsed PT model containing 1399 places and 144369 transitions and 577414 arcs in 2511 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1852 ms. (steps per millisecond=5 ) properties (out of 1399) seen :934
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=5 ) properties (out of 465) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=7 ) properties (out of 465) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=6 ) properties (out of 465) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=7 ) properties (out of 465) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=6 ) properties (out of 465) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=7 ) properties (out of 465) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=7 ) properties (out of 465) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=7 ) properties (out of 465) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=7 ) properties (out of 465) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=7 ) properties (out of 465) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=5 ) properties (out of 465) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=6 ) properties (out of 465) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=6 ) properties (out of 465) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=5 ) properties (out of 465) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=6 ) properties (out of 465) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=5 ) properties (out of 465) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=6 ) properties (out of 465) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=6 ) properties (out of 465) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=6 ) properties (out of 465) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=5 ) properties (out of 465) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=5 ) properties (out of 465) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=6 ) properties (out of 465) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=5 ) properties (out of 465) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=5 ) properties (out of 465) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=5 ) properties (out of 465) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=6 ) properties (out of 465) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=5 ) properties (out of 465) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=5 ) properties (out of 465) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=6 ) properties (out of 465) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=6 ) properties (out of 465) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=7 ) properties (out of 465) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=6 ) properties (out of 465) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=7 ) properties (out of 465) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=6 ) properties (out of 465) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=2 ) properties (out of 465) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=5 ) properties (out of 465) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=5 ) properties (out of 465) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=6 ) properties (out of 465) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=6 ) properties (out of 465) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=5 ) properties (out of 465) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=5 ) properties (out of 465) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=5 ) properties (out of 465) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=6 ) properties (out of 465) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=5 ) properties (out of 465) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=6 ) properties (out of 465) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=5 ) properties (out of 465) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=6 ) properties (out of 465) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=6 ) properties (out of 465) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=6 ) properties (out of 465) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=6 ) properties (out of 465) seen :0
Running SMT prover for 465 properties.
[2024-05-27 08:53:10] [INFO ] Flow matrix only has 81238 transitions (discarded 63131 similar events)
// Phase 1: matrix 81238 rows 1399 cols
[2024-05-27 08:53:10] [INFO ] Computed 37 invariants in 550 ms
[2024-05-27 08:53:13] [INFO ] Flatten gal took : 4673 ms
[2024-05-27 08:53:16] [INFO ] Flatten gal took : 3690 ms
[2024-05-27 08:53:17] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1153387541213957274.gal : 695 ms
[2024-05-27 08:53:17] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8158492505334003154.prop : 9 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality1153387541213957274.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8158492505334003154.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
[2024-05-27 08:53:24] [INFO ] After 13344ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:465
[2024-05-27 08:53:34] [INFO ] [Nat]Absence check using 19 positive place invariants in 18 ms returned sat
[2024-05-27 08:53:34] [INFO ] [Nat]Absence check using 19 positive and 18 generalized place invariants in 4 ms returned sat
Loading property file /tmp/ReachabilityCardinality8158492505334003154.prop.
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:632)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.applyReachabilitySolver(GlobalPropertySolver.java:724)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:558)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preSolveLiveness(GlobalPropertySolver.java:412)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preStableMarking(GlobalPropertySolver.java:321)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:294)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:426)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-27 08:53:49] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-27 08:53:49] [INFO ] After 25020ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:465
Fused 465 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 465 out of 1399 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1399/1399 places, 144369/144369 transitions.
Ensure Unique test removed 18 places
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 1381 transition count 144369
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 1380 transition count 144368
Applied a total of 19 rules in 2630 ms. Remains 1380 /1399 variables (removed 19) and now considering 144368/144369 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2645 ms. Remains : 1380/1399 places, 144368/144369 transitions.
Interrupted random walk after 186330 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=6 ) properties seen 440
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 831 ms. (steps per millisecond=120 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 513 ms. (steps per millisecond=194 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 430 ms. (steps per millisecond=232 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 441 ms. (steps per millisecond=226 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 443 ms. (steps per millisecond=225 ) properties (out of 25) seen :1
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 526 ms. (steps per millisecond=190 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 488 ms. (steps per millisecond=204 ) properties (out of 24) seen :1
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 466 ms. (steps per millisecond=214 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 448 ms. (steps per millisecond=223 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 445 ms. (steps per millisecond=224 ) properties (out of 23) seen :1
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 506 ms. (steps per millisecond=197 ) properties (out of 22) seen :1
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 500 ms. (steps per millisecond=200 ) properties (out of 21) seen :1
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 475 ms. (steps per millisecond=210 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 436 ms. (steps per millisecond=229 ) properties (out of 20) seen :1
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 456 ms. (steps per millisecond=219 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 488 ms. (steps per millisecond=204 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 469 ms. (steps per millisecond=213 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 442 ms. (steps per millisecond=226 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 429 ms. (steps per millisecond=233 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 447 ms. (steps per millisecond=223 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 514 ms. (steps per millisecond=194 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 491 ms. (steps per millisecond=203 ) properties (out of 19) seen :1
Running SMT prover for 18 properties.
[2024-05-27 08:54:32] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
// Phase 1: matrix 81237 rows 1380 cols
[2024-05-27 08:54:33] [INFO ] Computed 19 invariants in 296 ms
[2024-05-27 08:54:33] [INFO ] After 575ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:18
[2024-05-27 08:54:34] [INFO ] [Nat]Absence check using 19 positive place invariants in 17 ms returned sat
[2024-05-27 08:55:14] [INFO ] After 39665ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :18
[2024-05-27 08:55:15] [INFO ] State equation strengthened by 741 read => feed constraints.
[2024-05-27 08:55:45] [INFO ] After 30208ms SMT Verify possible using 741 Read/Feed constraints in natural domain returned unsat :0 sat :18
[2024-05-27 08:55:53] [INFO ] Deduced a trap composed of 48 places in 6378 ms of which 5 ms to minimize.
[2024-05-27 08:55:59] [INFO ] Deduced a trap composed of 34 places in 5454 ms of which 2 ms to minimize.
[2024-05-27 08:56:08] [INFO ] Deduced a trap composed of 40 places in 6994 ms of which 3 ms to minimize.
[2024-05-27 08:56:13] [INFO ] Deduced a trap composed of 72 places in 4500 ms of which 2 ms to minimize.
[2024-05-27 08:56:18] [INFO ] Deduced a trap composed of 72 places in 3663 ms of which 0 ms to minimize.
[2024-05-27 08:56:22] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 36913 ms
[2024-05-27 08:57:46] [INFO ] After 151398ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :18
Attempting to minimize the solution found.
Minimization took 25576 ms.
[2024-05-27 08:58:12] [INFO ] After 218716ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :18
Fused 18 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 18 out of 1380 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1380/1380 places, 144368/144368 transitions.
Applied a total of 0 rules in 1128 ms. Remains 1380 /1380 variables (removed 0) and now considering 144368/144368 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1129 ms. Remains : 1380/1380 places, 144368/144368 transitions.
Interrupted random walk after 230873 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=7 ) properties seen 16
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3917 ms. (steps per millisecond=255 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3786 ms. (steps per millisecond=264 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
[2024-05-27 08:58:51] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
[2024-05-27 08:58:51] [INFO ] Invariant cache hit.
[2024-05-27 08:58:52] [INFO ] After 170ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-27 08:58:52] [INFO ] [Nat]Absence check using 19 positive place invariants in 16 ms returned sat
[2024-05-27 08:59:12] [INFO ] After 20358ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-27 08:59:13] [INFO ] State equation strengthened by 741 read => feed constraints.
[2024-05-27 08:59:22] [INFO ] After 8860ms SMT Verify possible using 741 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-27 08:59:33] [INFO ] Deduced a trap composed of 128 places in 9555 ms of which 2 ms to minimize.
[2024-05-27 08:59:42] [INFO ] Deduced a trap composed of 48 places in 7775 ms of which 2 ms to minimize.
[2024-05-27 08:59:51] [INFO ] Deduced a trap composed of 40 places in 8079 ms of which 2 ms to minimize.
[2024-05-27 08:59:59] [INFO ] Deduced a trap composed of 96 places in 7017 ms of which 3 ms to minimize.
[2024-05-27 09:00:07] [INFO ] Deduced a trap composed of 72 places in 7112 ms of which 1 ms to minimize.
[2024-05-27 09:00:15] [INFO ] Deduced a trap composed of 128 places in 6222 ms of which 2 ms to minimize.
[2024-05-27 09:00:21] [INFO ] Deduced a trap composed of 128 places in 5462 ms of which 1 ms to minimize.
[2024-05-27 09:00:26] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 63969 ms
[2024-05-27 09:00:27] [INFO ] After 73593ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1178 ms.
[2024-05-27 09:00:28] [INFO ] After 96268ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 1380 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1380/1380 places, 144368/144368 transitions.
Applied a total of 0 rules in 1274 ms. Remains 1380 /1380 variables (removed 0) and now considering 144368/144368 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1274 ms. Remains : 1380/1380 places, 144368/144368 transitions.
Interrupted random walk after 239155 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=7 ) properties seen 0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3644 ms. (steps per millisecond=274 ) properties (out of 1) seen :0
SDD proceeding with computation,465 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,465 properties remain. new max is 8
SDD size :3 after 5
SDD proceeding with computation,465 properties remain. new max is 16
SDD size :5 after 6
SDD proceeding with computation,465 properties remain. new max is 32
SDD size :6 after 9
SDD proceeding with computation,465 properties remain. new max is 64
SDD size :9 after 10
SDD proceeding with computation,465 properties remain. new max is 128
SDD size :10 after 12
SDD proceeding with computation,465 properties remain. new max is 256
SDD size :12 after 20
SDD proceeding with computation,465 properties remain. new max is 512
SDD size :20 after 22
SDD proceeding with computation,465 properties remain. new max is 1024
SDD size :22 after 26
Interrupted probabilistic random walk after 113888 steps, run timeout after 99002 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 113888 steps, saw 102613 distinct states, run finished after 99005 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-27 09:02:42] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
[2024-05-27 09:02:42] [INFO ] Invariant cache hit.
[2024-05-27 09:02:42] [INFO ] After 160ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
SDD proceeding with computation,465 properties remain. new max is 2048
SDD size :26 after 146
[2024-05-27 09:02:43] [INFO ] [Nat]Absence check using 19 positive place invariants in 14 ms returned sat
[2024-05-27 09:03:02] [INFO ] After 19859ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-27 09:03:03] [INFO ] State equation strengthened by 741 read => feed constraints.
SDD proceeding with computation,465 properties remain. new max is 4096
SDD size :146 after 236
[2024-05-27 09:03:11] [INFO ] After 8274ms SMT Verify possible using 741 Read/Feed constraints in natural domain returned unsat :0 sat :1
Detected timeout of ITS tools.
[2024-05-27 09:03:22] [INFO ] Flatten gal took : 3998 ms
[2024-05-27 09:03:22] [INFO ] Applying decomposition
[2024-05-27 09:03:23] [INFO ] Deduced a trap composed of 128 places in 10905 ms of which 2 ms to minimize.
[2024-05-27 09:03:25] [INFO ] Flatten gal took : 3530 ms
[2024-05-27 09:03:34] [INFO ] Deduced a trap composed of 48 places in 9001 ms of which 1 ms to minimize.
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph3483497943075535996.txt' '-o' '/tmp/graph3483497943075535996.bin' '-w' '/tmp/graph3483497943075535996.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph3483497943075535996.bin' '-l' '-1' '-v' '-w' '/tmp/graph3483497943075535996.weights' '-q' '0' '-e' '0.001'
[2024-05-27 09:03:34] [INFO ] Decomposing Gal with order
[2024-05-27 09:03:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 09:03:44] [INFO ] Deduced a trap composed of 40 places in 8925 ms of which 1 ms to minimize.
[2024-05-27 09:03:46] [INFO ] Removed a total of 435317 redundant transitions.
[2024-05-27 09:03:47] [INFO ] Flatten gal took : 6844 ms
[2024-05-27 09:03:54] [INFO ] Deduced a trap composed of 96 places in 9070 ms of which 1 ms to minimize.
[2024-05-27 09:04:02] [INFO ] Deduced a trap composed of 72 places in 7144 ms of which 2 ms to minimize.
[2024-05-27 09:04:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 4176 labels/synchronizations in 14187 ms.
[2024-05-27 09:04:07] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3327617336083967289.gal : 392 ms
[2024-05-27 09:04:07] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3678900214891576383.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality3327617336083967289.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3678900214891576383.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
[2024-05-27 09:04:10] [INFO ] Deduced a trap composed of 128 places in 6398 ms of which 0 ms to minimize.
[2024-05-27 09:04:16] [INFO ] Deduced a trap composed of 128 places in 5321 ms of which 1 ms to minimize.
[2024-05-27 09:04:21] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 69679 ms
[2024-05-27 09:04:22] [INFO ] After 78672ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1224 ms.
[2024-05-27 09:04:23] [INFO ] After 100570ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 1380 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1380/1380 places, 144368/144368 transitions.
Applied a total of 0 rules in 1216 ms. Remains 1380 /1380 variables (removed 0) and now considering 144368/144368 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1216 ms. Remains : 1380/1380 places, 144368/144368 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1380/1380 places, 144368/144368 transitions.
Applied a total of 0 rules in 1164 ms. Remains 1380 /1380 variables (removed 0) and now considering 144368/144368 (removed 0) transitions.
[2024-05-27 09:04:25] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
[2024-05-27 09:04:25] [INFO ] Invariant cache hit.
[2024-05-27 09:04:35] [INFO ] Implicit Places using invariants in 9622 ms returned []
Implicit Place search using SMT only with invariants took 9624 ms to find 0 implicit places.
[2024-05-27 09:04:35] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
[2024-05-27 09:04:35] [INFO ] Invariant cache hit.
[2024-05-27 09:05:05] [INFO ] Performed 87413/144368 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2024-05-27 09:05:25] [INFO ] Dead Transitions using invariants and state equation in 49989 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60796 ms. Remains : 1380/1380 places, 144368/144368 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 12879 ms. (steps per millisecond=7 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-27 09:05:38] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
[2024-05-27 09:05:38] [INFO ] Invariant cache hit.
[2024-05-27 09:05:39] [INFO ] [Real]Absence check using 19 positive place invariants in 11 ms returned sat
[2024-05-27 09:05:58] [INFO ] After 19255ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-27 09:05:59] [INFO ] State equation strengthened by 741 read => feed constraints.
[2024-05-27 09:06:08] [INFO ] After 8564ms SMT Verify possible using 741 Read/Feed constraints in real domain returned unsat :0 sat :1
[2024-05-27 09:06:20] [INFO ] Deduced a trap composed of 128 places in 11290 ms of which 2 ms to minimize.
[2024-05-27 09:06:30] [INFO ] Deduced a trap composed of 48 places in 8146 ms of which 1 ms to minimize.
[2024-05-27 09:06:38] [INFO ] Deduced a trap composed of 40 places in 7279 ms of which 1 ms to minimize.
[2024-05-27 09:06:47] [INFO ] Deduced a trap composed of 96 places in 7605 ms of which 2 ms to minimize.
[2024-05-27 09:06:56] [INFO ] Deduced a trap composed of 72 places in 7092 ms of which 0 ms to minimize.
[2024-05-27 09:07:03] [INFO ] Deduced a trap composed of 128 places in 6260 ms of which 1 ms to minimize.
[2024-05-27 09:07:10] [INFO ] Deduced a trap composed of 128 places in 5354 ms of which 1 ms to minimize.
[2024-05-27 09:07:15] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 66749 ms
[2024-05-27 09:07:15] [INFO ] After 76112ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-27 09:07:15] [INFO ] After 96800ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-27 09:07:15] [INFO ] [Nat]Absence check using 19 positive place invariants in 12 ms returned sat
Loading property file /tmp/ReachabilityCardinality3678900214891576383.prop.
[2024-05-27 09:07:35] [INFO ] After 19212ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-27 09:07:42] [INFO ] After 7726ms SMT Verify possible using 741 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-27 09:07:54] [INFO ] Deduced a trap composed of 128 places in 10573 ms of which 3 ms to minimize.
[2024-05-27 09:08:03] [INFO ] Deduced a trap composed of 48 places in 7583 ms of which 2 ms to minimize.
[2024-05-27 09:08:12] [INFO ] Deduced a trap composed of 40 places in 8008 ms of which 1 ms to minimize.
[2024-05-27 09:08:20] [INFO ] Deduced a trap composed of 96 places in 7159 ms of which 1 ms to minimize.
[2024-05-27 09:08:28] [INFO ] Deduced a trap composed of 72 places in 6439 ms of which 2 ms to minimize.
[2024-05-27 09:08:35] [INFO ] Deduced a trap composed of 128 places in 6090 ms of which 1 ms to minimize.
[2024-05-27 09:08:41] [INFO ] Deduced a trap composed of 128 places in 4979 ms of which 1 ms to minimize.
[2024-05-27 09:08:46] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 63734 ms
[2024-05-27 09:08:47] [INFO ] After 72191ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 133 ms.
[2024-05-27 09:08:47] [INFO ] After 91672ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Interrupted random walk after 303804 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=10 ) properties seen 0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3228 ms. (steps per millisecond=309 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 131963 steps, run timeout after 99002 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 131963 steps, saw 118397 distinct states, run finished after 99004 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-27 09:10:59] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
[2024-05-27 09:10:59] [INFO ] Invariant cache hit.
[2024-05-27 09:10:59] [INFO ] After 171ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-27 09:11:00] [INFO ] [Nat]Absence check using 19 positive place invariants in 15 ms returned sat
[2024-05-27 09:11:24] [INFO ] After 23991ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-27 09:11:29] [INFO ] State equation strengthened by 741 read => feed constraints.
[2024-05-27 09:11:42] [INFO ] After 12787ms SMT Verify possible using 741 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-27 09:12:22] [INFO ] Deduced a trap composed of 128 places in 38922 ms of which 18 ms to minimize.

BK_STOP 1716801164478

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="RERS17pb115-PT-8"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="gold2023"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is RERS17pb115-PT-8, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r330-tall-171662363000198"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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