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.r241-tall-171649628000054.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 JoinFreeModules-PT-2000, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r241-tall-171649628000054
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.6M
-rw-r--r-- 1 mcc users 9.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 102K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K May 19 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 19 16:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:22 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 18:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.6K Apr 11 14:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 79K Apr 11 14:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Apr 11 14:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 44K Apr 11 14:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:13 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 19 15:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 6.2M May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716549119050

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=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=JoinFreeModules-PT-2000
Applying reductions before tool lola
Invoking reducer
Running Version 202304061127
[2024-05-24 11:12:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-24 11:12:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 11:12:01] [INFO ] Load time of PNML (sax parser for PT used): 443 ms
[2024-05-24 11:12:01] [INFO ] Transformed 10001 places.
[2024-05-24 11:12:01] [INFO ] Transformed 16001 transitions.
[2024-05-24 11:12:01] [INFO ] Parsed PT model containing 10001 places and 16001 transitions and 46002 arcs in 585 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 20 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Reduce places removed 1 places and 0 transitions.
FORMULA JoinFreeModules-PT-2000-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-2000-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-2000-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-2000-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 11009 steps, including 2 resets, run finished after 1011 ms. (steps per millisecond=10 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 896 ms. (steps per millisecond=11 ) properties (out of 12) seen :1
FORMULA JoinFreeModules-PT-2000-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 936 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 935 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 925 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 1016 ms. (steps per millisecond=9 ) properties (out of 11) seen :1
FORMULA JoinFreeModules-PT-2000-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 947 ms. (steps per millisecond=10 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 909 ms. (steps per millisecond=11 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 882 ms. (steps per millisecond=11 ) properties (out of 10) seen :1
FORMULA JoinFreeModules-PT-2000-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 915 ms. (steps per millisecond=10 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1049 ms. (steps per millisecond=9 ) properties (out of 9) seen :1
FORMULA JoinFreeModules-PT-2000-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 949 ms. (steps per millisecond=10 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 887 ms. (steps per millisecond=11 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 16001 rows 10000 cols
[2024-05-24 11:12:13] [INFO ] Computed 2000 invariants in 86 ms
[2024-05-24 11:12:16] [INFO ] [Real]Absence check using 2000 positive place invariants in 678 ms returned sat
[2024-05-24 11:12:16] [INFO ] After 3006ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2024-05-24 11:12:19] [INFO ] [Nat]Absence check using 2000 positive place invariants in 684 ms returned sat
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.checkResults(DeadlockTester.java:800)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:634)
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.Application.startNoEx(Application.java:944)
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-24 11:12:41] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-24 11:12:41] [INFO ] After 25019ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:8
Fused 8 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 166 out of 10000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10000/10000 places, 16001/16001 transitions.
Graph (complete) has 24000 edges and 10000 vertex of which 805 are kept as prefixes of interest. Removing 9195 places using SCC suffix rule.24 ms
Discarding 9195 places :
Also discarding 14712 output transitions
Drop transitions removed 14712 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 805 transition count 1288
Applied a total of 2 rules in 204 ms. Remains 805 /10000 variables (removed 9195) and now considering 1288/16001 (removed 14713) transitions.
// Phase 1: matrix 1288 rows 805 cols
[2024-05-24 11:12:42] [INFO ] Computed 161 invariants in 9 ms
[2024-05-24 11:12:42] [INFO ] Dead Transitions using invariants and state equation in 577 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 782 ms. Remains : 805/10000 places, 1288/16001 transitions.
Incomplete random walk after 10009 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=145 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 8) seen :1
FORMULA JoinFreeModules-PT-2000-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 7) 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 7) seen :0
Running SMT prover for 7 properties.
[2024-05-24 11:12:43] [INFO ] Invariant cache hit.
[2024-05-24 11:12:43] [INFO ] [Real]Absence check using 161 positive place invariants in 22 ms returned sat
[2024-05-24 11:12:43] [INFO ] After 261ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2024-05-24 11:12:43] [INFO ] [Nat]Absence check using 161 positive place invariants in 25 ms returned sat
[2024-05-24 11:12:52] [INFO ] After 8387ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2024-05-24 11:12:52] [INFO ] State equation strengthened by 161 read => feed constraints.
[2024-05-24 11:13:00] [INFO ] After 7753ms SMT Verify possible using 161 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2024-05-24 11:13:00] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 3 ms to minimize.
[2024-05-24 11:13:00] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 3 ms to minimize.
[2024-05-24 11:13:00] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-05-24 11:13:00] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2024-05-24 11:13:00] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-05-24 11:13:00] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-24 11:13:00] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 633 ms
[2024-05-24 11:13:02] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-24 11:13:02] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-05-24 11:13:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 279 ms
[2024-05-24 11:13:03] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-24 11:13:03] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-24 11:13:03] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2024-05-24 11:13:03] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-05-24 11:13:03] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-05-24 11:13:03] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2024-05-24 11:13:03] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 684 ms
[2024-05-24 11:13:05] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2024-05-24 11:13:06] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-05-24 11:13:06] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-24 11:13:06] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-05-24 11:13:06] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 497 ms
[2024-05-24 11:13:06] [INFO ] After 14073ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 2275 ms.
[2024-05-24 11:13:08] [INFO ] After 25009ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
FORMULA JoinFreeModules-PT-2000-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA JoinFreeModules-PT-2000-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 2 properties in 12006 ms.
Support contains 156 out of 805 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 805/805 places, 1288/1288 transitions.
Graph (complete) has 1932 edges and 805 vertex of which 760 are kept as prefixes of interest. Removing 45 places using SCC suffix rule.1 ms
Discarding 45 places :
Also discarding 72 output transitions
Drop transitions removed 72 transitions
Applied a total of 1 rules in 25 ms. Remains 760 /805 variables (removed 45) and now considering 1216/1288 (removed 72) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 760/805 places, 1216/1288 transitions.
Incomplete random walk after 10008 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 154024 steps, run timeout after 3004 ms. (steps per millisecond=51 ) properties seen :{}
Probabilistic random walk after 154024 steps, saw 153244 distinct states, run finished after 3005 ms. (steps per millisecond=51 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 1216 rows 760 cols
[2024-05-24 11:13:24] [INFO ] Computed 152 invariants in 8 ms
[2024-05-24 11:13:24] [INFO ] After 176ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-24 11:13:24] [INFO ] [Nat]Absence check using 152 positive place invariants in 21 ms returned sat
[2024-05-24 11:13:29] [INFO ] After 4601ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-24 11:13:29] [INFO ] State equation strengthened by 152 read => feed constraints.
[2024-05-24 11:13:36] [INFO ] After 6836ms SMT Verify possible using 152 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2024-05-24 11:13:37] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2024-05-24 11:13:37] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-05-24 11:13:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 441 ms
[2024-05-24 11:13:39] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-05-24 11:13:39] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-24 11:13:39] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-24 11:13:39] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-05-24 11:13:39] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-24 11:13:39] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-24 11:13:39] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 499 ms
[2024-05-24 11:13:40] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-05-24 11:13:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 165 ms
[2024-05-24 11:13:41] [INFO ] After 12501ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 4354 ms.
[2024-05-24 11:13:46] [INFO ] After 21726ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
FORMULA JoinFreeModules-PT-2000-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 10000 ms.
Support contains 145 out of 760 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 760/760 places, 1216/1216 transitions.
Graph (complete) has 1824 edges and 760 vertex of which 705 are kept as prefixes of interest. Removing 55 places using SCC suffix rule.3 ms
Discarding 55 places :
Also discarding 88 output transitions
Drop transitions removed 88 transitions
Applied a total of 1 rules in 42 ms. Remains 705 /760 variables (removed 55) and now considering 1128/1216 (removed 88) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 705/760 places, 1128/1216 transitions.
Incomplete random walk after 10008 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 140772 steps, run timeout after 3005 ms. (steps per millisecond=46 ) properties seen :{}
Probabilistic random walk after 140772 steps, saw 140001 distinct states, run finished after 3006 ms. (steps per millisecond=46 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 1128 rows 705 cols
[2024-05-24 11:13:59] [INFO ] Computed 141 invariants in 9 ms
[2024-05-24 11:13:59] [INFO ] After 132ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-24 11:13:59] [INFO ] [Nat]Absence check using 141 positive place invariants in 25 ms returned sat
[2024-05-24 11:14:03] [INFO ] After 3956ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-24 11:14:03] [INFO ] State equation strengthened by 141 read => feed constraints.
[2024-05-24 11:14:08] [INFO ] After 4614ms SMT Verify possible using 141 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-24 11:14:09] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-05-24 11:14:09] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-05-24 11:14:10] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2024-05-24 11:14:10] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-24 11:14:10] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2024-05-24 11:14:10] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 2 ms to minimize.
[2024-05-24 11:14:10] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 754 ms
[2024-05-24 11:14:11] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2024-05-24 11:14:11] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-24 11:14:11] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-24 11:14:11] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-24 11:14:12] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-05-24 11:14:12] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1078 ms
[2024-05-24 11:14:12] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2024-05-24 11:14:12] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2024-05-24 11:14:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 219 ms
[2024-05-24 11:14:13] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-05-24 11:14:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 142 ms
[2024-05-24 11:14:13] [INFO ] After 9662ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 2525 ms.
[2024-05-24 11:14:16] [INFO ] After 16328ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 8001 ms.
Support contains 145 out of 705 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 705/705 places, 1128/1128 transitions.
Applied a total of 0 rules in 19 ms. Remains 705 /705 variables (removed 0) and now considering 1128/1128 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 705/705 places, 1128/1128 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 705/705 places, 1128/1128 transitions.
Applied a total of 0 rules in 19 ms. Remains 705 /705 variables (removed 0) and now considering 1128/1128 (removed 0) transitions.
[2024-05-24 11:14:24] [INFO ] Invariant cache hit.
[2024-05-24 11:14:24] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-05-24 11:14:24] [INFO ] Invariant cache hit.
[2024-05-24 11:14:24] [INFO ] State equation strengthened by 141 read => feed constraints.
[2024-05-24 11:14:24] [INFO ] Implicit Places using invariants and state equation in 359 ms returned []
Implicit Place search using SMT with State Equation took 454 ms to find 0 implicit places.
[2024-05-24 11:14:24] [INFO ] Redundant transitions in 62 ms returned []
[2024-05-24 11:14:24] [INFO ] Invariant cache hit.
[2024-05-24 11:14:24] [INFO ] Dead Transitions using invariants and state equation in 393 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 934 ms. Remains : 705/705 places, 1128/1128 transitions.
Applied a total of 0 rules in 19 ms. Remains 705 /705 variables (removed 0) and now considering 1128/1128 (removed 0) transitions.
Running SMT prover for 4 properties.
[2024-05-24 11:14:24] [INFO ] Invariant cache hit.
[2024-05-24 11:14:25] [INFO ] After 119ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-24 11:14:25] [INFO ] [Nat]Absence check using 141 positive place invariants in 23 ms returned sat
[2024-05-24 11:14:29] [INFO ] After 3755ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-24 11:14:29] [INFO ] State equation strengthened by 141 read => feed constraints.
[2024-05-24 11:14:34] [INFO ] After 5198ms SMT Verify possible using 141 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-24 11:14:34] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-05-24 11:14:35] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2024-05-24 11:14:35] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-05-24 11:14:35] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2024-05-24 11:14:35] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-24 11:14:35] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-24 11:14:35] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-05-24 11:14:35] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 675 ms
[2024-05-24 11:14:37] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-05-24 11:14:37] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-24 11:14:37] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-05-24 11:14:37] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 352 ms
[2024-05-24 11:14:37] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2024-05-24 11:14:37] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-24 11:14:38] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 6 ms to minimize.
[2024-05-24 11:14:38] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-05-24 11:14:38] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 412 ms
[2024-05-24 11:14:38] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-05-24 11:14:38] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-24 11:14:38] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-05-24 11:14:39] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2024-05-24 11:14:39] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-05-24 11:14:39] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 578 ms
[2024-05-24 11:14:39] [INFO ] After 10266ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 2243 ms.
[2024-05-24 11:14:41] [INFO ] After 16443ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
[2024-05-24 11:14:41] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 6 ms.
[2024-05-24 11:14:41] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 705 places, 1128 transitions and 2961 arcs took 8 ms.
[2024-05-24 11:14:41] [INFO ] Flatten gal took : 146 ms
Total runtime 161406 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT JoinFreeModules-PT-2000
BK_EXAMINATION: ReachabilityCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/371
ReachabilityCardinality

FORMULA JoinFreeModules-PT-2000-ReachabilityCardinality-2024-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-2000-ReachabilityCardinality-2024-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-2000-ReachabilityCardinality-2024-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-2000-ReachabilityCardinality-2024-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1716549283630

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

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/371/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/371/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/371/ReachabilityCardinality.xml
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: LAUNCH task # 14 (type SKEL/FNDP) for 3 JoinFreeModules-PT-2000-ReachabilityCardinality-2024-03
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 15 (type SKEL/EQUN) for 3 JoinFreeModules-PT-2000-ReachabilityCardinality-2024-03
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 17 (type SKEL/SRCH) for 3 JoinFreeModules-PT-2000-ReachabilityCardinality-2024-03
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 18 (type SKEL/SRCH) for 3 JoinFreeModules-PT-2000-ReachabilityCardinality-2024-03
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: FINISHED task # 17 (type SKEL/SRCH) for JoinFreeModules-PT-2000-ReachabilityCardinality-2024-03
lola: result : true
lola: markings : 1430
lola: fired transitions : 1429
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 14 (type FNDP) for JoinFreeModules-PT-2000-ReachabilityCardinality-2024-03 (obsolete)
lola: CANCELED task # 15 (type EQUN) for JoinFreeModules-PT-2000-ReachabilityCardinality-2024-03 (obsolete)
lola: CANCELED task # 18 (type SRCH) for JoinFreeModules-PT-2000-ReachabilityCardinality-2024-03 (obsolete)
lola: FINISHED task # 14 (type SKEL/FNDP) for JoinFreeModules-PT-2000-ReachabilityCardinality-2024-03
lola: result : true
lola: fired transitions : 1428
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: LAUNCH task # 22 (type SKEL/FNDP) for 6 JoinFreeModules-PT-2000-ReachabilityCardinality-2024-05
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 23 (type SKEL/EQUN) for 6 JoinFreeModules-PT-2000-ReachabilityCardinality-2024-05
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 25 (type SKEL/SRCH) for 6 JoinFreeModules-PT-2000-ReachabilityCardinality-2024-05
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 26 (type SKEL/SRCH) for 6 JoinFreeModules-PT-2000-ReachabilityCardinality-2024-05
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 22 (type SKEL/FNDP) for JoinFreeModules-PT-2000-ReachabilityCardinality-2024-05
lola: result : true
lola: fired transitions : 1999
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 23 (type EQUN) for JoinFreeModules-PT-2000-ReachabilityCardinality-2024-05 (obsolete)
lola: CANCELED task # 25 (type SRCH) for JoinFreeModules-PT-2000-ReachabilityCardinality-2024-05 (obsolete)
lola: CANCELED task # 26 (type SRCH) for JoinFreeModules-PT-2000-ReachabilityCardinality-2024-05 (obsolete)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
sara: try reading problem file /home/mcc/execution/371/ReachabilityCardinality-23.sara.
sara: place or transition ordering is non-deterministic
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
sara: try reading problem file /home/mcc/execution/371/ReachabilityCardinality-15.sara.
lola: LAUNCH task # 33 (type EXCL) for 6 JoinFreeModules-PT-2000-ReachabilityCardinality-2024-05
lola: time limit : 899 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 29 (type FNDP) for 6 JoinFreeModules-PT-2000-ReachabilityCardinality-2024-05
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 30 (type EQUN) for 6 JoinFreeModules-PT-2000-ReachabilityCardinality-2024-05
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 32 (type SRCH) for 6 JoinFreeModules-PT-2000-ReachabilityCardinality-2024-05
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 29 (type FNDP) for JoinFreeModules-PT-2000-ReachabilityCardinality-2024-05
lola: result : true
lola: fired transitions : 1999
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 30 (type EQUN) for JoinFreeModules-PT-2000-ReachabilityCardinality-2024-05 (obsolete)
lola: CANCELED task # 32 (type SRCH) for JoinFreeModules-PT-2000-ReachabilityCardinality-2024-05 (obsolete)
lola: CANCELED task # 33 (type EXCL) for JoinFreeModules-PT-2000-ReachabilityCardinality-2024-05 (obsolete)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
sara: place or transition ordering is non-deterministic
sara: try reading problem file /home/mcc/execution/371/ReachabilityCardinality-30.sara.
sara: place or transition ordering is non-deterministic

lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: LAUNCH task # 40 (type EXCL) for 0 JoinFreeModules-PT-2000-ReachabilityCardinality-2024-02
lola: time limit : 1199 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 36 (type FNDP) for 0 JoinFreeModules-PT-2000-ReachabilityCardinality-2024-02
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 37 (type EQUN) for 0 JoinFreeModules-PT-2000-ReachabilityCardinality-2024-02
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 39 (type SRCH) for 0 JoinFreeModules-PT-2000-ReachabilityCardinality-2024-02
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787

lola: FINISHED task # 36 (type FNDP) for JoinFreeModules-PT-2000-ReachabilityCardinality-2024-02
lola: result : true
lola: fired transitions : 4828
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 37 (type EQUN) for JoinFreeModules-PT-2000-ReachabilityCardinality-2024-02 (obsolete)
lola: CANCELED task # 39 (type SRCH) for JoinFreeModules-PT-2000-ReachabilityCardinality-2024-02 (obsolete)
lola: CANCELED task # 40 (type EXCL) for JoinFreeModules-PT-2000-ReachabilityCardinality-2024-02 (obsolete)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: LAUNCH task # 53 (type EXCL) for 9 JoinFreeModules-PT-2000-ReachabilityCardinality-2024-15
lola: time limit : 1799 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 43 (type FNDP) for 3 JoinFreeModules-PT-2000-ReachabilityCardinality-2024-03
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 44 (type EQUN) for 3 JoinFreeModules-PT-2000-ReachabilityCardinality-2024-03
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 46 (type SRCH) for 3 JoinFreeModules-PT-2000-ReachabilityCardinality-2024-03
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 23 (type SKEL/EQUN) for JoinFreeModules-PT-2000-ReachabilityCardinality-2024-05
lola: result : true
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: FINISHED task # 43 (type FNDP) for JoinFreeModules-PT-2000-ReachabilityCardinality-2024-03
lola: result : true
lola: fired transitions : 1428
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: FINISHED task # 46 (type SRCH) for JoinFreeModules-PT-2000-ReachabilityCardinality-2024-03
lola: result : true
lola: markings : 1430
lola: fired transitions : 1429
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 44 (type EQUN) for JoinFreeModules-PT-2000-ReachabilityCardinality-2024-03 (obsolete)
lola: LAUNCH task # 49 (type FNDP) for 9 JoinFreeModules-PT-2000-ReachabilityCardinality-2024-15
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 50 (type EQUN) for 9 JoinFreeModules-PT-2000-ReachabilityCardinality-2024-15
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 52 (type SRCH) for 9 JoinFreeModules-PT-2000-ReachabilityCardinality-2024-15
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 30 (type EQUN) for JoinFreeModules-PT-2000-ReachabilityCardinality-2024-05
lola: result : true
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: FINISHED task # 52 (type SRCH) for JoinFreeModules-PT-2000-ReachabilityCardinality-2024-15
lola: result : true
lola: markings : 3810
lola: fired transitions : 3809
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 49 (type FNDP) for JoinFreeModules-PT-2000-ReachabilityCardinality-2024-15 (obsolete)
lola: CANCELED task # 50 (type EQUN) for JoinFreeModules-PT-2000-ReachabilityCardinality-2024-15 (obsolete)
lola: CANCELED task # 53 (type EXCL) for JoinFreeModules-PT-2000-ReachabilityCardinality-2024-15 (obsolete)
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
JoinFreeModules-PT-2000-ReachabilityCardinality-2024-02: AG false findpath
JoinFreeModules-PT-2000-ReachabilityCardinality-2024-03: AG false findpath
JoinFreeModules-PT-2000-ReachabilityCardinality-2024-05: AG false findpath
JoinFreeModules-PT-2000-ReachabilityCardinality-2024-15: AG false tandem / insertion


Time elapsed: 1 secs. Pages in use: 2

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="JoinFreeModules-PT-2000"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is JoinFreeModules-PT-2000, 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 r241-tall-171649628000054"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/JoinFreeModules-PT-2000.tgz
mv JoinFreeModules-PT-2000 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 ;