About the Execution of 2024-gold for FamilyReunion-PT-L00020M0002C001P001G001
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
15689.610 | 147691.00 | 182035.00 | 793.00 | 2 21 21 21 21 21 21 21 1 21 1 21 1 1 1 21 | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r097-smll-174860111800026.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool gold2024
Input is FamilyReunion-PT-L00020M0002C001P001G001, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r097-smll-174860111800026
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.8M
-rw-r--r-- 1 mcc users 37K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 251K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 77K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 293K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 17K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 32K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 93K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 29K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 176K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 80K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 301K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 11K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 24 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 1.3M May 29 14:32 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of positive values
NUM_VECTOR
echo here is the order used to build the result vector(from xml file)
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-00
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-01
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-02
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-03
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-04
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-05
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-06
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-07
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-08
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-09
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-10
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-11
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-12
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-13
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-14
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1748674636281
Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FamilyReunion-PT-L00020M0002C001P001G001
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-05-31 06:57:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-05-31 06:57:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-31 06:57:19] [INFO ] Load time of PNML (sax parser for PT used): 605 ms
[2025-05-31 06:57:19] [INFO ] Transformed 3271 places.
[2025-05-31 06:57:19] [INFO ] Transformed 2753 transitions.
[2025-05-31 06:57:19] [INFO ] Parsed PT model containing 3271 places and 2753 transitions and 8446 arcs in 898 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 23 ms.
Reduce places removed 11 places and 0 transitions.
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-00 2 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 2753 rows 3260 cols
[2025-05-31 06:57:20] [INFO ] Computed 748 invariants in 369 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[361, 361, 703, 722, 9968, 34116, 4292, 1, 20099, 1, 341, 1, 1, 1, 1444]
RANDOM walk for 10000 steps (8 resets) in 306 ms. (32 steps per ms)
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 110011 steps (22 resets) in 253 ms. (433 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[6, 7, 19, 7, 6, 14, 6, 9, 5, 0, 8] Max Struct:[361, 361, 703, 722, 9968, 34116, 4292, 20099, 341, 1, 1444]
[2025-05-31 06:57:21] [INFO ] Invariant cache hit.
[2025-05-31 06:57:22] [INFO ] [Real]Absence check using 61 positive place invariants in 115 ms returned sat
[2025-05-31 06:57:22] [INFO ] [Real]Absence check using 61 positive and 687 generalized place invariants in 476 ms returned sat
[2025-05-31 06:57:25] [INFO ] [Real]Absence check using state equation in 2396 ms returned sat
[2025-05-31 06:57:26] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:954)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2249)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
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:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2025-05-31 06:57:27] [INFO ] [Real]Absence check using 61 positive place invariants in 150 ms returned sat
[2025-05-31 06:57:27] [INFO ] [Real]Absence check using 61 positive and 687 generalized place invariants in 474 ms returned sat
[2025-05-31 06:57:30] [INFO ] [Real]Absence check using state equation in 2191 ms returned sat
[2025-05-31 06:57:30] [INFO ] Computed and/alt/rep : 2541/3738/2541 causal constraints (skipped 191 transitions) in 366 ms.
[2025-05-31 06:57:31] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 06:57:32] [INFO ] [Nat]Absence check using 61 positive place invariants in 87 ms returned sat
[2025-05-31 06:57:32] [INFO ] [Nat]Absence check using 61 positive and 687 generalized place invariants in 300 ms returned sat
[2025-05-31 06:57:34] [INFO ] [Nat]Absence check using state equation in 2380 ms returned sat
[2025-05-31 06:57:35] [INFO ] Computed and/alt/rep : 2541/3738/2541 causal constraints (skipped 191 transitions) in 341 ms.
Maximisation of solution failed !
Minimization took 3 ms.
[2025-05-31 06:57:37] [INFO ] [Real]Absence check using 61 positive place invariants in 91 ms returned sat
[2025-05-31 06:57:37] [INFO ] [Real]Absence check using 61 positive and 687 generalized place invariants in 308 ms returned sat
[2025-05-31 06:57:40] [INFO ] [Real]Absence check using state equation in 3183 ms returned sat
[2025-05-31 06:57:41] [INFO ] Computed and/alt/rep : 2541/3738/2541 causal constraints (skipped 191 transitions) in 360 ms.
[2025-05-31 06:57:41] [INFO ] Added : 0 causal constraints over 0 iterations in 361 ms. Result :unknown
[2025-05-31 06:57:42] [INFO ] [Real]Absence check using 61 positive place invariants in 134 ms returned sat
[2025-05-31 06:57:42] [INFO ] [Real]Absence check using 61 positive and 687 generalized place invariants in 435 ms returned sat
[2025-05-31 06:57:46] [INFO ] [Real]Absence check using state equation in 3469 ms returned sat
[2025-05-31 06:57:46] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 06:57:47] [INFO ] [Nat]Absence check using 61 positive place invariants in 134 ms returned sat
[2025-05-31 06:57:47] [INFO ] [Nat]Absence check using 61 positive and 687 generalized place invariants in 449 ms returned sat
[2025-05-31 06:57:50] [INFO ] [Nat]Absence check using state equation in 2301 ms returned sat
[2025-05-31 06:57:50] [INFO ] Computed and/alt/rep : 2541/3738/2541 causal constraints (skipped 191 transitions) in 188 ms.
Maximisation of solution failed !
Minimization took 1 ms.
[2025-05-31 06:57:52] [INFO ] [Real]Absence check using 61 positive place invariants in 89 ms returned sat
[2025-05-31 06:57:52] [INFO ] [Real]Absence check using 61 positive and 687 generalized place invariants in 293 ms returned sat
[2025-05-31 06:57:54] [INFO ] [Real]Absence check using state equation in 2062 ms returned sat
[2025-05-31 06:57:55] [INFO ] Computed and/alt/rep : 2541/3738/2541 causal constraints (skipped 191 transitions) in 292 ms.
[2025-05-31 06:57:56] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 06:57:57] [INFO ] [Nat]Absence check using 61 positive place invariants in 124 ms returned sat
[2025-05-31 06:57:57] [INFO ] [Nat]Absence check using 61 positive and 687 generalized place invariants in 317 ms returned sat
[2025-05-31 06:58:00] [INFO ] [Nat]Absence check using state equation in 2388 ms returned sat
[2025-05-31 06:58:00] [INFO ] Computed and/alt/rep : 2541/3738/2541 causal constraints (skipped 191 transitions) in 173 ms.
Maximisation of solution failed !
Minimization took 0 ms.
[2025-05-31 06:58:02] [INFO ] [Real]Absence check using 61 positive place invariants in 102 ms returned sat
[2025-05-31 06:58:02] [INFO ] [Real]Absence check using 61 positive and 687 generalized place invariants in 359 ms returned sat
[2025-05-31 06:58:05] [INFO ] [Real]Absence check using state equation in 2368 ms returned sat
[2025-05-31 06:58:05] [INFO ] Computed and/alt/rep : 2541/3738/2541 causal constraints (skipped 191 transitions) in 325 ms.
[2025-05-31 06:58:06] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 5
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:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2249)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
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:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2025-05-31 06:58:07] [INFO ] [Real]Absence check using 61 positive place invariants in 107 ms returned sat
[2025-05-31 06:58:07] [INFO ] [Real]Absence check using 61 positive and 687 generalized place invariants in 374 ms returned sat
[2025-05-31 06:58:10] [INFO ] [Real]Absence check using state equation in 2557 ms returned sat
[2025-05-31 06:58:11] [INFO ] Computed and/alt/rep : 2541/3738/2541 causal constraints (skipped 191 transitions) in 319 ms.
[2025-05-31 06:58:11] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 6
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:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2249)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
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:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2025-05-31 06:58:12] [INFO ] [Real]Absence check using 61 positive place invariants in 89 ms returned sat
[2025-05-31 06:58:13] [INFO ] [Real]Absence check using 61 positive and 687 generalized place invariants in 340 ms returned sat
[2025-05-31 06:58:15] [INFO ] [Real]Absence check using state equation in 2753 ms returned sat
[2025-05-31 06:58:16] [INFO ] Computed and/alt/rep : 2541/3738/2541 causal constraints (skipped 191 transitions) in 295 ms.
[2025-05-31 06:58:16] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 7
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:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2249)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
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:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2025-05-31 06:58:17] [INFO ] [Real]Absence check using 61 positive place invariants in 83 ms returned sat
[2025-05-31 06:58:17] [INFO ] [Real]Absence check using 61 positive and 687 generalized place invariants in 290 ms returned sat
[2025-05-31 06:58:20] [INFO ] [Real]Absence check using state equation in 2336 ms returned sat
[2025-05-31 06:58:20] [INFO ] Computed and/alt/rep : 2541/3738/2541 causal constraints (skipped 191 transitions) in 325 ms.
[2025-05-31 06:58:21] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 06:58:22] [INFO ] [Nat]Absence check using 61 positive place invariants in 121 ms returned sat
[2025-05-31 06:58:23] [INFO ] [Nat]Absence check using 61 positive and 687 generalized place invariants in 381 ms returned sat
[2025-05-31 06:58:25] [INFO ] [Nat]Absence check using state equation in 2119 ms returned sat
[2025-05-31 06:58:25] [INFO ] Computed and/alt/rep : 2541/3738/2541 causal constraints (skipped 191 transitions) in 209 ms.
Maximisation of solution failed !
Minimization took 0 ms.
[2025-05-31 06:58:27] [INFO ] [Real]Absence check using 61 positive place invariants in 92 ms returned sat
[2025-05-31 06:58:28] [INFO ] [Real]Absence check using 61 positive and 687 generalized place invariants in 323 ms returned sat
[2025-05-31 06:58:30] [INFO ] [Real]Absence check using state equation in 2342 ms returned sat
[2025-05-31 06:58:30] [INFO ] Computed and/alt/rep : 2541/3738/2541 causal constraints (skipped 191 transitions) in 219 ms.
[2025-05-31 06:58:32] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 06:58:32] [INFO ] [Nat]Absence check using 61 positive place invariants in 133 ms returned sat
[2025-05-31 06:58:33] [INFO ] [Nat]Absence check using 61 positive and 687 generalized place invariants in 392 ms returned sat
[2025-05-31 06:58:35] [INFO ] [Nat]Absence check using state equation in 2225 ms returned sat
[2025-05-31 06:58:36] [INFO ] Computed and/alt/rep : 2541/3738/2541 causal constraints (skipped 191 transitions) in 313 ms.
Maximisation of solution failed !
Minimization took 0 ms.
[2025-05-31 06:58:37] [INFO ] [Real]Absence check using 61 positive place invariants in 103 ms returned sat
[2025-05-31 06:58:38] [INFO ] [Real]Absence check using 61 positive and 687 generalized place invariants in 317 ms returned sat
[2025-05-31 06:58:40] [INFO ] [Real]Absence check using state equation in 2008 ms returned sat
[2025-05-31 06:58:40] [INFO ] Computed and/alt/rep : 2541/3738/2541 causal constraints (skipped 191 transitions) in 199 ms.
[2025-05-31 06:58:42] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 06:58:43] [INFO ] [Nat]Absence check using 61 positive place invariants in 109 ms returned sat
[2025-05-31 06:58:43] [INFO ] [Nat]Absence check using 61 positive and 687 generalized place invariants in 438 ms returned sat
[2025-05-31 06:58:45] [INFO ] [Nat]Absence check using state equation in 2237 ms returned sat
[2025-05-31 06:58:46] [INFO ] Computed and/alt/rep : 2541/3738/2541 causal constraints (skipped 191 transitions) in 204 ms.
[2025-05-31 06:58:47] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 10
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:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
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:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
Current structural bounds on expressions (after SMT) : Max Seen:[6, 7, 19, 7, 6, 14, 6, 9, 5, 0, 8] Max Struct:[361, 361, 703, 722, 9968, 34116, 4292, 20099, 341, 1, 1444]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[7, 7, 20, 7, 7, 14, 7, 10, 10, 0, 8] Max Struct:[361, 361, 703, 722, 9968, 34116, 4292, 20099, 341, 1, 1444]
Support contains 235 out of 3260 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3260/3260 places, 2753/2753 transitions.
Graph (complete) has 4960 edges and 3260 vertex of which 2920 are kept as prefixes of interest. Removing 340 places using SCC suffix rule.12 ms
Discarding 340 places :
Also discarding 244 output transitions
Drop transitions (Output transitions of discarded places.) removed 244 transitions
Drop transitions (Empty/Sink Transition effects.) removed 43 transitions
Reduce isomorphic transitions removed 43 transitions.
Discarding 315 places :
Implicit places reduction removed 315 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 737 transitions
Trivial Post-agglo rules discarded 737 transitions
Performed 737 trivial Post agglomeration. Transition count delta: 737
Iterating post reduction 0 with 1095 rules applied. Total rules applied 1096 place count 2605 transition count 1729
Reduce places removed 737 places and 0 transitions.
Performed 147 Post agglomeration using F-continuation condition.Transition count delta: 147
Iterating post reduction 1 with 884 rules applied. Total rules applied 1980 place count 1868 transition count 1582
Reduce places removed 147 places and 0 transitions.
Iterating post reduction 2 with 147 rules applied. Total rules applied 2127 place count 1721 transition count 1582
Performed 272 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 272 Pre rules applied. Total rules applied 2127 place count 1721 transition count 1310
Deduced a syphon composed of 272 places in 3 ms
Ensure Unique test removed 147 places
Reduce places removed 419 places and 0 transitions.
Iterating global reduction 3 with 691 rules applied. Total rules applied 2818 place count 1302 transition count 1310
Discarding 21 places :
Implicit places reduction removed 21 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 3 with 42 rules applied. Total rules applied 2860 place count 1281 transition count 1289
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 4 with 21 rules applied. Total rules applied 2881 place count 1260 transition count 1289
Discarding 191 places :
Symmetric choice reduction at 5 with 191 rule applications. Total rules 3072 place count 1069 transition count 1098
Iterating global reduction 5 with 191 rules applied. Total rules applied 3263 place count 1069 transition count 1098
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Discarding 43 places :
Implicit places reduction removed 43 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 85 transitions
Trivial Post-agglo rules discarded 85 transitions
Performed 85 trivial Post agglomeration. Transition count delta: 85
Iterating post reduction 5 with 149 rules applied. Total rules applied 3412 place count 1026 transition count 992
Reduce places removed 85 places and 0 transitions.
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Iterating post reduction 6 with 106 rules applied. Total rules applied 3518 place count 941 transition count 971
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 7 with 21 rules applied. Total rules applied 3539 place count 920 transition count 971
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 23 Pre rules applied. Total rules applied 3539 place count 920 transition count 948
Deduced a syphon composed of 23 places in 3 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 8 with 46 rules applied. Total rules applied 3585 place count 897 transition count 948
Discarding 23 places :
Symmetric choice reduction at 8 with 23 rule applications. Total rules 3608 place count 874 transition count 885
Iterating global reduction 8 with 23 rules applied. Total rules applied 3631 place count 874 transition count 885
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 21 Pre rules applied. Total rules applied 3631 place count 874 transition count 864
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 8 with 42 rules applied. Total rules applied 3673 place count 853 transition count 864
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Deduced a syphon composed of 64 places in 1 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 8 with 128 rules applied. Total rules applied 3801 place count 789 transition count 800
Free-agglomeration rule (complex) applied 84 times.
Iterating global reduction 8 with 84 rules applied. Total rules applied 3885 place count 789 transition count 716
Reduce places removed 84 places and 0 transitions.
Iterating post reduction 8 with 84 rules applied. Total rules applied 3969 place count 705 transition count 716
Partial Free-agglomeration rule applied 63 times.
Drop transitions (Partial Free agglomeration) removed 63 transitions
Iterating global reduction 9 with 63 rules applied. Total rules applied 4032 place count 705 transition count 716
Applied a total of 4032 rules in 815 ms. Remains 705 /3260 variables (removed 2555) and now considering 716/2753 (removed 2037) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 833 ms. Remains : 705/3260 places, 716/2753 transitions.
// Phase 1: matrix 716 rows 705 cols
[2025-05-31 06:58:49] [INFO ] Computed 132 invariants in 10 ms
Current structural bounds on expressions (after invariants) : Max Seen:[7, 7, 20, 7, 7, 14, 7, 10, 10, 0, 8] Max Struct:[361, 361, 703, 722, 9968, 34116, 4292, 20099, 341, 1, 1444]
RANDOM walk for 1000000 steps (2723 resets) in 8070 ms. (123 steps per ms)
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 10000010 steps (1302 resets) in 14814 ms. (674 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[21, 21, 21, 21, 21, 21, 21, 15, 15, 15] Max Struct:[361, 361, 703, 722, 9968, 34116, 4292, 20099, 341, 1444]
[2025-05-31 06:59:12] [INFO ] Invariant cache hit.
[2025-05-31 06:59:12] [INFO ] [Real]Absence check using 0 positive and 132 generalized place invariants in 47 ms returned sat
[2025-05-31 06:59:13] [INFO ] [Real]Absence check using state equation in 275 ms returned unsat
[2025-05-31 06:59:13] [INFO ] [Real]Absence check using 0 positive and 132 generalized place invariants in 93 ms returned sat
[2025-05-31 06:59:13] [INFO ] [Real]Absence check using state equation in 365 ms returned unsat
[2025-05-31 06:59:13] [INFO ] [Real]Absence check using 0 positive and 132 generalized place invariants in 77 ms returned sat
[2025-05-31 06:59:14] [INFO ] [Real]Absence check using state equation in 288 ms returned unsat
[2025-05-31 06:59:14] [INFO ] [Real]Absence check using 0 positive and 132 generalized place invariants in 52 ms returned sat
[2025-05-31 06:59:14] [INFO ] [Real]Absence check using state equation in 319 ms returned unsat
[2025-05-31 06:59:14] [INFO ] [Real]Absence check using 0 positive and 132 generalized place invariants in 51 ms returned sat
[2025-05-31 06:59:15] [INFO ] [Real]Absence check using state equation in 254 ms returned unsat
[2025-05-31 06:59:15] [INFO ] [Real]Absence check using 0 positive and 132 generalized place invariants in 58 ms returned sat
[2025-05-31 06:59:15] [INFO ] [Real]Absence check using state equation in 241 ms returned unsat
[2025-05-31 06:59:15] [INFO ] [Real]Absence check using 0 positive and 132 generalized place invariants in 48 ms returned sat
[2025-05-31 06:59:15] [INFO ] [Real]Absence check using state equation in 247 ms returned unsat
[2025-05-31 06:59:16] [INFO ] [Real]Absence check using 0 positive and 132 generalized place invariants in 59 ms returned sat
[2025-05-31 06:59:16] [INFO ] [Real]Absence check using state equation in 418 ms returned sat
[2025-05-31 06:59:16] [INFO ] Computed and/alt/rep : 526/1030/526 causal constraints (skipped 127 transitions) in 57 ms.
[2025-05-31 06:59:16] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 06:59:17] [INFO ] [Nat]Absence check using 0 positive and 132 generalized place invariants in 50 ms returned sat
[2025-05-31 06:59:17] [INFO ] [Nat]Absence check using state equation in 461 ms returned sat
[2025-05-31 06:59:17] [INFO ] Computed and/alt/rep : 526/1030/526 causal constraints (skipped 127 transitions) in 59 ms.
[2025-05-31 06:59:20] [INFO ] Added : 186 causal constraints over 38 iterations in 2509 ms. Result :sat
Minimization took 1089 ms.
[2025-05-31 06:59:21] [INFO ] [Real]Absence check using 0 positive and 132 generalized place invariants in 61 ms returned sat
[2025-05-31 06:59:21] [INFO ] [Real]Absence check using state equation in 561 ms returned sat
[2025-05-31 06:59:22] [INFO ] Computed and/alt/rep : 526/1030/526 causal constraints (skipped 127 transitions) in 54 ms.
[2025-05-31 06:59:22] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 06:59:22] [INFO ] [Nat]Absence check using 0 positive and 132 generalized place invariants in 70 ms returned sat
[2025-05-31 06:59:23] [INFO ] [Nat]Absence check using state equation in 498 ms returned sat
[2025-05-31 06:59:23] [INFO ] Computed and/alt/rep : 526/1030/526 causal constraints (skipped 127 transitions) in 61 ms.
[2025-05-31 06:59:27] [INFO ] Added : 266 causal constraints over 54 iterations in 3928 ms. Result :sat
Minimization took 1444 ms.
[2025-05-31 06:59:28] [INFO ] [Real]Absence check using 0 positive and 132 generalized place invariants in 51 ms returned sat
[2025-05-31 06:59:29] [INFO ] [Real]Absence check using state equation in 456 ms returned sat
[2025-05-31 06:59:29] [INFO ] Computed and/alt/rep : 526/1030/526 causal constraints (skipped 127 transitions) in 79 ms.
[2025-05-31 06:59:29] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 06:59:29] [INFO ] [Nat]Absence check using 0 positive and 132 generalized place invariants in 71 ms returned sat
[2025-05-31 06:59:30] [INFO ] [Nat]Absence check using state equation in 402 ms returned sat
[2025-05-31 06:59:30] [INFO ] Computed and/alt/rep : 526/1030/526 causal constraints (skipped 127 transitions) in 51 ms.
[2025-05-31 06:59:32] [INFO ] Added : 164 causal constraints over 33 iterations in 2244 ms. Result :sat
Minimization took 915 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[21, 21, 21, 21, 21, 21, 21, 15, 15, 15] Max Struct:[21, 21, 21, 21, 21, 21, 21, 20099, 341, 1444]
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-07 21 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-06 21 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-05 21 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-04 21 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-03 21 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-02 21 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-01 21 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[21, 21, 21] Max Struct:[20099, 341, 1444]
Support contains 3 out of 705 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 705/705 places, 716/716 transitions.
Graph (complete) has 1353 edges and 705 vertex of which 636 are kept as prefixes of interest. Removing 69 places using SCC suffix rule.2 ms
Discarding 69 places :
Also discarding 44 output transitions
Drop transitions (Output transitions of discarded places.) removed 44 transitions
Drop transitions (Empty/Sink Transition effects.) removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 168 transitions
Trivial Post-agglo rules discarded 168 transitions
Performed 168 trivial Post agglomeration. Transition count delta: 168
Iterating post reduction 0 with 189 rules applied. Total rules applied 190 place count 636 transition count 483
Reduce places removed 168 places and 0 transitions.
Iterating post reduction 1 with 168 rules applied. Total rules applied 358 place count 468 transition count 483
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 42 Pre rules applied. Total rules applied 358 place count 468 transition count 441
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 442 place count 426 transition count 441
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 463 place count 405 transition count 420
Iterating global reduction 2 with 21 rules applied. Total rules applied 484 place count 405 transition count 420
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 2 with 21 rules applied. Total rules applied 505 place count 405 transition count 399
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 547 place count 384 transition count 378
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 84 rules applied. Total rules applied 631 place count 342 transition count 378
Applied a total of 631 rules in 136 ms. Remains 342 /705 variables (removed 363) and now considering 378/716 (removed 338) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 137 ms. Remains : 342/705 places, 378/716 transitions.
// Phase 1: matrix 378 rows 342 cols
[2025-05-31 06:59:34] [INFO ] Computed 107 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[21, 21, 21] Max Struct:[20099, 341, 1444]
RANDOM walk for 1000000 steps (6306 resets) in 4826 ms. (207 steps per ms)
BEST_FIRST walk for 3000002 steps (740 resets) in 3305 ms. (907 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[21, 21, 21] Max Struct:[20099, 341, 1444]
[2025-05-31 06:59:42] [INFO ] Invariant cache hit.
[2025-05-31 06:59:42] [INFO ] [Real]Absence check using 0 positive and 107 generalized place invariants in 42 ms returned sat
[2025-05-31 06:59:42] [INFO ] [Real]Absence check using state equation in 174 ms returned unsat
[2025-05-31 06:59:42] [INFO ] [Real]Absence check using 0 positive and 107 generalized place invariants in 32 ms returned sat
[2025-05-31 06:59:42] [INFO ] [Real]Absence check using state equation in 180 ms returned unsat
[2025-05-31 06:59:42] [INFO ] [Real]Absence check using 0 positive and 107 generalized place invariants in 42 ms returned sat
[2025-05-31 06:59:43] [INFO ] [Real]Absence check using state equation in 194 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[21, 21, 21] Max Struct:[21, 21, 21]
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-15 21 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-11 21 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-09 21 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
[2025-05-31 06:59:43] [INFO ] Flatten gal took : 153 ms
[2025-05-31 06:59:43] [INFO ] Flatten gal took : 62 ms
[2025-05-31 06:59:43] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11393175635000756865.gal : 42 ms
[2025-05-31 06:59:43] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4926102287762389637.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality11393175635000756865.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4926102287762389637.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 145031 ms.
BK_STOP 1748674783972
--------------------
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
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FamilyReunion-PT-L00020M0002C001P001G001"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2024"
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-5832"
echo " Executing tool gold2024"
echo " Input is FamilyReunion-PT-L00020M0002C001P001G001, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r097-smll-174860111800026"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FamilyReunion-PT-L00020M0002C001P001G001.tgz
mv FamilyReunion-PT-L00020M0002C001P001G001 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "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 [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "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 "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
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 ;