Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r086-smll-174860102100205.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 itstools
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 r086-smll-174860102100205
=====================================================================

--------------------
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 1748801500264

Invoking MCC driver with
BK_TOOL=itstools
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 202505121319
[2025-06-01 18:11:42] [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-06-01 18:11:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 18:11:43] [INFO ] Load time of PNML (sax parser for PT used): 439 ms
[2025-06-01 18:11:43] [INFO ] Transformed 3271 places.
[2025-06-01 18:11:43] [INFO ] Transformed 2753 transitions.
[2025-06-01 18:11:43] [INFO ] Parsed PT model containing 3271 places and 2753 transitions and 8446 arcs in 692 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 22 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-06-01 18:11:44] [INFO ] Computed 748 invariants in 298 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 176 ms. (56 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-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 110010 steps (22 resets) in 255 ms. (429 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[5, 7, 19, 7, 7, 15, 8, 10, 0, 5, 4] Max Struct:[361, 361, 703, 722, 9968, 34116, 4292, 20099, 1, 341, 1444]
[2025-06-01 18:11:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-01 18:11:45] [INFO ] [Real]Absence check using 61 positive place invariants in 110 ms returned sat
[2025-06-01 18:11:46] [INFO ] [Real]Absence check using 61 positive and 687 generalized place invariants in 300 ms returned sat
[2025-06-01 18:11:48] [INFO ] [Real]Absence check using state equation in 2191 ms returned sat
[2025-06-01 18:11:49] [INFO ] Computed and/alt/rep : 2541/3738/2541 causal constraints (skipped 191 transitions) in 265 ms.
[2025-06-01 18:11:49] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-01 18:11:50] [INFO ] [Nat]Absence check using 61 positive place invariants in 117 ms returned sat
[2025-06-01 18:11:50] [INFO ] [Nat]Absence check using 61 positive and 687 generalized place invariants in 347 ms returned sat
[2025-06-01 18:11:53] [INFO ] [Nat]Absence check using state equation in 2324 ms returned sat
[2025-06-01 18:11:53] [INFO ] Computed and/alt/rep : 2541/3738/2541 causal constraints (skipped 191 transitions) in 315 ms.
Maximisation of solution failed !
Minimization took 1 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-01 18:11:55] [INFO ] [Real]Absence check using 61 positive place invariants in 106 ms returned sat
[2025-06-01 18:11:56] [INFO ] [Real]Absence check using 61 positive and 687 generalized place invariants in 327 ms returned sat
[2025-06-01 18:11:58] [INFO ] [Real]Absence check using state equation in 2211 ms returned sat
[2025-06-01 18:11:58] [INFO ] Computed and/alt/rep : 2541/3738/2541 causal constraints (skipped 191 transitions) in 219 ms.
[2025-06-01 18:12:00] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
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:301)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1140)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:878)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2252)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:927)
at fr.lip6.move.gal.application.Application.start(Application.java:193)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:670)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:607)
at org.eclipse.equinox.launcher.Main.run(Main.java:1492)
at org.eclipse.equinox.launcher.Main.main(Main.java:1465)
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-01 18:12:00] [INFO ] [Real]Absence check using 61 positive place invariants in 132 ms returned sat
[2025-06-01 18:12:01] [INFO ] [Real]Absence check using 61 positive and 687 generalized place invariants in 459 ms returned sat
[2025-06-01 18:12:04] [INFO ] [Real]Absence check using state equation in 2580 ms returned sat
[2025-06-01 18:12:04] [INFO ] Computed and/alt/rep : 2541/3738/2541 causal constraints (skipped 191 transitions) in 193 ms.
[2025-06-01 18:12:05] [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 2
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:301)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1140)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:878)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2252)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:927)
at fr.lip6.move.gal.application.Application.start(Application.java:193)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:670)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:607)
at org.eclipse.equinox.launcher.Main.run(Main.java:1492)
at org.eclipse.equinox.launcher.Main.main(Main.java:1465)
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-01 18:12:06] [INFO ] [Real]Absence check using 61 positive place invariants in 129 ms returned sat
[2025-06-01 18:12:06] [INFO ] [Real]Absence check using 61 positive and 687 generalized place invariants in 405 ms returned sat
[2025-06-01 18:12:08] [INFO ] [Real]Absence check using state equation in 2475 ms returned sat
[2025-06-01 18:12:09] [INFO ] Computed and/alt/rep : 2541/3738/2541 causal constraints (skipped 191 transitions) in 285 ms.
[2025-06-01 18:12:10] [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 3
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:301)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1140)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:878)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2252)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:927)
at fr.lip6.move.gal.application.Application.start(Application.java:193)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:670)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:607)
at org.eclipse.equinox.launcher.Main.run(Main.java:1492)
at org.eclipse.equinox.launcher.Main.main(Main.java:1465)
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-01 18:12:11] [INFO ] [Real]Absence check using 61 positive place invariants in 122 ms returned sat
[2025-06-01 18:12:11] [INFO ] [Real]Absence check using 61 positive and 687 generalized place invariants in 388 ms returned sat
[2025-06-01 18:12:13] [INFO ] [Real]Absence check using state equation in 2436 ms returned sat
[2025-06-01 18:12:14] [INFO ] Computed and/alt/rep : 2541/3738/2541 causal constraints (skipped 191 transitions) in 210 ms.
[2025-06-01 18:12:15] [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: Broken pipe ... while checking expression at index 4
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:301)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1140)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:878)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2252)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:927)
at fr.lip6.move.gal.application.Application.start(Application.java:193)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:670)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:607)
at org.eclipse.equinox.launcher.Main.run(Main.java:1492)
at org.eclipse.equinox.launcher.Main.main(Main.java:1465)
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-01 18:12:15] [INFO ] [Real]Absence check using 61 positive place invariants in 91 ms returned sat
[2025-06-01 18:12:16] [INFO ] [Real]Absence check using 61 positive and 687 generalized place invariants in 330 ms returned sat
[2025-06-01 18:12:18] [INFO ] [Real]Absence check using state equation in 2075 ms returned sat
[2025-06-01 18:12:18] [INFO ] Computed and/alt/rep : 2541/3738/2541 causal constraints (skipped 191 transitions) in 185 ms.
[2025-06-01 18:12:20] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-01 18:12:20] [INFO ] [Nat]Absence check using 61 positive place invariants in 91 ms returned sat
[2025-06-01 18:12:21] [INFO ] [Nat]Absence check using 61 positive and 687 generalized place invariants in 338 ms returned sat
[2025-06-01 18:12:23] [INFO ] [Nat]Absence check using state equation in 2184 ms returned sat
[2025-06-01 18:12:23] [INFO ] Computed and/alt/rep : 2541/3738/2541 causal constraints (skipped 191 transitions) in 192 ms.
[2025-06-01 18:12:25] [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: Broken pipe ... 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: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:301)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1140)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:878)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2254)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:927)
at fr.lip6.move.gal.application.Application.start(Application.java:193)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:670)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:607)
at org.eclipse.equinox.launcher.Main.run(Main.java:1492)
at org.eclipse.equinox.launcher.Main.main(Main.java:1465)
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-01 18:12:25] [INFO ] [Real]Absence check using 61 positive place invariants in 89 ms returned sat
[2025-06-01 18:12:26] [INFO ] [Real]Absence check using 61 positive and 687 generalized place invariants in 307 ms returned sat
[2025-06-01 18:12:28] [INFO ] [Real]Absence check using state equation in 1958 ms returned sat
[2025-06-01 18:12:28] [INFO ] Computed and/alt/rep : 2541/3738/2541 causal constraints (skipped 191 transitions) in 219 ms.
[2025-06-01 18:12:30] [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:301)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1140)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:878)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2252)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:927)
at fr.lip6.move.gal.application.Application.start(Application.java:193)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:670)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:607)
at org.eclipse.equinox.launcher.Main.run(Main.java:1492)
at org.eclipse.equinox.launcher.Main.main(Main.java:1465)
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-01 18:12:31] [INFO ] [Real]Absence check using 61 positive place invariants in 100 ms returned sat
[2025-06-01 18:12:31] [INFO ] [Real]Absence check using 61 positive and 687 generalized place invariants in 332 ms returned sat
[2025-06-01 18:12:33] [INFO ] [Real]Absence check using state equation in 2112 ms returned sat
[2025-06-01 18:12:34] [INFO ] Computed and/alt/rep : 2541/3738/2541 causal constraints (skipped 191 transitions) in 188 ms.
[2025-06-01 18:12:35] [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: Broken pipe ... 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: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:301)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1140)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:878)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2252)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:927)
at fr.lip6.move.gal.application.Application.start(Application.java:193)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:670)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:607)
at org.eclipse.equinox.launcher.Main.run(Main.java:1492)
at org.eclipse.equinox.launcher.Main.main(Main.java:1465)
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-01 18:12:35] [INFO ] [Real]Absence check using 61 positive place invariants in 88 ms returned sat
[2025-06-01 18:12:36] [INFO ] [Real]Absence check using 61 positive and 687 generalized place invariants in 306 ms returned sat
[2025-06-01 18:12:38] [INFO ] [Real]Absence check using state equation in 2078 ms returned sat
[2025-06-01 18:12:38] [INFO ] Computed and/alt/rep : 2541/3738/2541 causal constraints (skipped 191 transitions) in 198 ms.
[2025-06-01 18:12:40] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-01 18:12:40] [INFO ] [Nat]Absence check using 61 positive place invariants in 90 ms returned sat
[2025-06-01 18:12:41] [INFO ] [Nat]Absence check using 61 positive and 687 generalized place invariants in 292 ms returned sat
[2025-06-01 18:12:43] [INFO ] [Nat]Absence check using state equation in 2068 ms returned sat
[2025-06-01 18:12:43] [INFO ] Computed and/alt/rep : 2541/3738/2541 causal constraints (skipped 191 transitions) in 186 ms.
Maximisation of solution failed !
Minimization took 0 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-01 18:12:46] [INFO ] [Real]Absence check using 61 positive place invariants in 84 ms returned sat
[2025-06-01 18:12:46] [INFO ] [Real]Absence check using 61 positive and 687 generalized place invariants in 278 ms returned sat
[2025-06-01 18:12:48] [INFO ] [Real]Absence check using state equation in 2112 ms returned sat
[2025-06-01 18:12:48] [INFO ] Computed and/alt/rep : 2541/3738/2541 causal constraints (skipped 191 transitions) in 168 ms.
[2025-06-01 18:12:50] [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 9
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:301)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1140)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:878)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2252)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:927)
at fr.lip6.move.gal.application.Application.start(Application.java:193)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:670)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:607)
at org.eclipse.equinox.launcher.Main.run(Main.java:1492)
at org.eclipse.equinox.launcher.Main.main(Main.java:1465)
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-01 18:12:51] [INFO ] [Real]Absence check using 61 positive place invariants in 86 ms returned sat
[2025-06-01 18:12:51] [INFO ] [Real]Absence check using 61 positive and 687 generalized place invariants in 273 ms returned sat
[2025-06-01 18:12:53] [INFO ] [Real]Absence check using state equation in 2083 ms returned sat
[2025-06-01 18:12:54] [INFO ] Computed and/alt/rep : 2541/3738/2541 causal constraints (skipped 191 transitions) in 190 ms.
[2025-06-01 18:12:55] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-01 18:12:56] [INFO ] [Nat]Absence check using 61 positive place invariants in 87 ms returned sat
[2025-06-01 18:12:56] [INFO ] [Nat]Absence check using 61 positive and 687 generalized place invariants in 282 ms returned sat
[2025-06-01 18:12:58] [INFO ] [Nat]Absence check using state equation in 1990 ms returned sat
[2025-06-01 18:12:58] [INFO ] Computed and/alt/rep : 2541/3738/2541 causal constraints (skipped 191 transitions) in 232 ms.
[2025-06-01 18:13:00] [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: Broken pipe ... 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: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:301)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1140)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:878)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2254)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:927)
at fr.lip6.move.gal.application.Application.start(Application.java:193)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:670)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:607)
at org.eclipse.equinox.launcher.Main.run(Main.java:1492)
at org.eclipse.equinox.launcher.Main.main(Main.java:1465)
Current structural bounds on expressions (after SMT) : Max Seen:[5, 7, 19, 7, 7, 15, 8, 10, 0, 5, 4] Max Struct:[361, 361, 703, 722, 9968, 34116, 4292, 20099, 1, 341, 1444]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5, 7, 19, 7, 7, 15, 8, 10, 0, 5, 4] Max Struct:[361, 361, 703, 722, 9968, 34116, 4292, 20099, 1, 341, 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.11 ms
Discarding 340 places :
Also discarding 245 output transitions
Drop transitions (Output transitions of discarded places.) removed 245 transitions
Drop transitions (Empty/Sink Transition effects.) removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Discarding 315 places :
Implicit places reduction removed 315 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 735 transitions
Trivial Post-agglo rules discarded 735 transitions
Performed 735 trivial Post agglomeration. Transition count delta: 735
Iterating post reduction 0 with 1090 rules applied. Total rules applied 1091 place count 2605 transition count 1733
Reduce places removed 735 places and 0 transitions.
Performed 147 Post agglomeration using F-continuation condition.Transition count delta: 147
Iterating post reduction 1 with 882 rules applied. Total rules applied 1973 place count 1870 transition count 1586
Reduce places removed 147 places and 0 transitions.
Iterating post reduction 2 with 147 rules applied. Total rules applied 2120 place count 1723 transition count 1586
Performed 272 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 272 Pre rules applied. Total rules applied 2120 place count 1723 transition count 1314
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 2811 place count 1304 transition count 1314
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 2853 place count 1283 transition count 1293
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 4 with 21 rules applied. Total rules applied 2874 place count 1262 transition count 1293
Discarding 192 places :
Symmetric choice reduction at 5 with 192 rule applications. Total rules 3066 place count 1070 transition count 1100
Iterating global reduction 5 with 192 rules applied. Total rules applied 3258 place count 1070 transition count 1100
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Discarding 42 places :
Implicit places reduction removed 42 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 84 transitions
Trivial Post-agglo rules discarded 84 transitions
Performed 84 trivial Post agglomeration. Transition count delta: 84
Iterating post reduction 5 with 148 rules applied. Total rules applied 3406 place count 1028 transition count 994
Reduce places removed 84 places and 0 transitions.
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Iterating post reduction 6 with 105 rules applied. Total rules applied 3511 place count 944 transition count 973
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 7 with 21 rules applied. Total rules applied 3532 place count 923 transition count 973
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 23 Pre rules applied. Total rules applied 3532 place count 923 transition count 950
Deduced a syphon composed of 23 places in 2 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 8 with 46 rules applied. Total rules applied 3578 place count 900 transition count 950
Discarding 23 places :
Symmetric choice reduction at 8 with 23 rule applications. Total rules 3601 place count 877 transition count 907
Iterating global reduction 8 with 23 rules applied. Total rules applied 3624 place count 877 transition count 907
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 22 Pre rules applied. Total rules applied 3624 place count 877 transition count 885
Deduced a syphon composed of 22 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 8 with 45 rules applied. Total rules applied 3669 place count 854 transition count 885
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 3670 place count 853 transition count 864
Iterating global reduction 8 with 1 rules applied. Total rules applied 3671 place count 853 transition count 864
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 8 with 1 rules applied. Total rules applied 3672 place count 852 transition count 864
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 3672 place count 852 transition count 863
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 3674 place count 851 transition count 863
Performed 63 Post agglomeration using F-continuation condition.Transition count delta: 63
Deduced a syphon composed of 63 places in 1 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 9 with 126 rules applied. Total rules applied 3800 place count 788 transition count 800
Free-agglomeration rule (complex) applied 84 times.
Iterating global reduction 9 with 84 rules applied. Total rules applied 3884 place count 788 transition count 716
Reduce places removed 84 places and 0 transitions.
Iterating post reduction 9 with 84 rules applied. Total rules applied 3968 place count 704 transition count 716
Partial Free-agglomeration rule applied 63 times.
Drop transitions (Partial Free agglomeration) removed 63 transitions
Iterating global reduction 10 with 63 rules applied. Total rules applied 4031 place count 704 transition count 716
Applied a total of 4031 rules in 817 ms. Remains 704 /3260 variables (removed 2556) and now considering 716/2753 (removed 2037) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 832 ms. Remains : 704/3260 places, 716/2753 transitions.
// Phase 1: matrix 716 rows 704 cols
[2025-06-01 18:13:01] [INFO ] Computed 131 invariants in 25 ms
Current structural bounds on expressions (after invariants) : Max Seen:[5, 7, 19, 7, 7, 15, 8, 10, 0, 5, 4] Max Struct:[361, 361, 703, 722, 9968, 34116, 4292, 20099, 1, 341, 1444]
RANDOM walk for 1000000 steps (2723 resets) in 9768 ms. (102 steps per ms)
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 10000010 steps (1303 resets) in 15927 ms. (627 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[21, 21, 21, 21, 21, 21, 21, 15, 16, 16] Max Struct:[361, 361, 703, 722, 9968, 34116, 4292, 20099, 341, 1444]
[2025-06-01 18:13:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 18:13:27] [INFO ] [Real]Absence check using 0 positive and 131 generalized place invariants in 47 ms returned sat
[2025-06-01 18:13:27] [INFO ] [Real]Absence check using state equation in 265 ms returned unsat
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 18:13:27] [INFO ] [Real]Absence check using 0 positive and 131 generalized place invariants in 51 ms returned sat
[2025-06-01 18:13:27] [INFO ] [Real]Absence check using state equation in 283 ms returned unsat
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 18:13:28] [INFO ] [Real]Absence check using 0 positive and 131 generalized place invariants in 49 ms returned sat
[2025-06-01 18:13:28] [INFO ] [Real]Absence check using state equation in 261 ms returned unsat
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 18:13:28] [INFO ] [Real]Absence check using 0 positive and 131 generalized place invariants in 54 ms returned sat
[2025-06-01 18:13:28] [INFO ] [Real]Absence check using state equation in 271 ms returned unsat
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 18:13:29] [INFO ] [Real]Absence check using 0 positive and 131 generalized place invariants in 50 ms returned sat
[2025-06-01 18:13:29] [INFO ] [Real]Absence check using state equation in 269 ms returned unsat
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 18:13:29] [INFO ] [Real]Absence check using 0 positive and 131 generalized place invariants in 55 ms returned sat
[2025-06-01 18:13:29] [INFO ] [Real]Absence check using state equation in 234 ms returned unsat
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 18:13:29] [INFO ] [Real]Absence check using 0 positive and 131 generalized place invariants in 47 ms returned sat
[2025-06-01 18:13:30] [INFO ] [Real]Absence check using state equation in 262 ms returned unsat
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 18:13:30] [INFO ] [Real]Absence check using 0 positive and 131 generalized place invariants in 52 ms returned sat
[2025-06-01 18:13:30] [INFO ] [Real]Absence check using state equation in 368 ms returned sat
[2025-06-01 18:13:30] [INFO ] Computed and/alt/rep : 526/1030/526 causal constraints (skipped 127 transitions) in 55 ms.
[2025-06-01 18:13:31] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 18:13:31] [INFO ] [Nat]Absence check using 0 positive and 131 generalized place invariants in 53 ms returned sat
[2025-06-01 18:13:31] [INFO ] [Nat]Absence check using state equation in 373 ms returned sat
[2025-06-01 18:13:31] [INFO ] Computed and/alt/rep : 526/1030/526 causal constraints (skipped 127 transitions) in 62 ms.
[2025-06-01 18:13:34] [INFO ] Added : 184 causal constraints over 37 iterations in 3101 ms. Result :sat
Minimization took 828 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 18:13:35] [INFO ] [Real]Absence check using 0 positive and 131 generalized place invariants in 50 ms returned sat
[2025-06-01 18:13:36] [INFO ] [Real]Absence check using state equation in 427 ms returned sat
[2025-06-01 18:13:36] [INFO ] Computed and/alt/rep : 526/1030/526 causal constraints (skipped 127 transitions) in 66 ms.
[2025-06-01 18:13:36] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 18:13:37] [INFO ] [Nat]Absence check using 0 positive and 131 generalized place invariants in 50 ms returned sat
[2025-06-01 18:13:37] [INFO ] [Nat]Absence check using state equation in 407 ms returned sat
[2025-06-01 18:13:37] [INFO ] Computed and/alt/rep : 526/1030/526 causal constraints (skipped 127 transitions) in 56 ms.
[2025-06-01 18:13:41] [INFO ] Added : 272 causal constraints over 55 iterations in 3946 ms. Result :sat
Minimization took 1937 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 18:13:43] [INFO ] [Real]Absence check using 0 positive and 131 generalized place invariants in 46 ms returned sat
[2025-06-01 18:13:44] [INFO ] [Real]Absence check using state equation in 342 ms returned sat
[2025-06-01 18:13:44] [INFO ] Computed and/alt/rep : 526/1030/526 causal constraints (skipped 127 transitions) in 55 ms.
[2025-06-01 18:13:44] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 18:13:44] [INFO ] [Nat]Absence check using 0 positive and 131 generalized place invariants in 64 ms returned sat
[2025-06-01 18:13:44] [INFO ] [Nat]Absence check using state equation in 381 ms returned sat
[2025-06-01 18:13:45] [INFO ] Computed and/alt/rep : 526/1030/526 causal constraints (skipped 127 transitions) in 55 ms.
[2025-06-01 18:13:47] [INFO ] Added : 174 causal constraints over 35 iterations in 2492 ms. Result :sat
Minimization took 1019 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[21, 21, 21, 21, 21, 21, 21, 15, 16, 16] 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 704 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 704/704 places, 716/716 transitions.
Graph (complete) has 1349 edges and 704 vertex of which 636 are kept as prefixes of interest. Removing 68 places using SCC suffix rule.1 ms
Discarding 68 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 1 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 79 ms. Remains 342 /704 variables (removed 362) and now considering 378/716 (removed 338) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 79 ms. Remains : 342/704 places, 378/716 transitions.
// Phase 1: matrix 378 rows 342 cols
[2025-06-01 18:13:48] [INFO ] Computed 107 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[21, 21, 21] Max Struct:[20099, 341, 1444]
RANDOM walk for 1000000 steps (6313 resets) in 4747 ms. (210 steps per ms)
BEST_FIRST walk for 3000003 steps (740 resets) in 2974 ms. (1008 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[21, 21, 21] Max Struct:[20099, 341, 1444]
[2025-06-01 18:13:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 18:13:56] [INFO ] [Real]Absence check using 0 positive and 107 generalized place invariants in 33 ms returned sat
[2025-06-01 18:13:56] [INFO ] [Real]Absence check using state equation in 144 ms returned unsat
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 18:13:57] [INFO ] [Real]Absence check using 0 positive and 107 generalized place invariants in 31 ms returned sat
[2025-06-01 18:13:57] [INFO ] [Real]Absence check using state equation in 181 ms returned unsat
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 18:13:57] [INFO ] [Real]Absence check using 0 positive and 107 generalized place invariants in 32 ms returned sat
[2025-06-01 18:13:57] [INFO ] [Real]Absence check using state equation in 170 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 5 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-06-01 18:13:57] [INFO ] Flatten gal took : 103 ms
[2025-06-01 18:13:57] [INFO ] Flatten gal took : 42 ms
[2025-06-01 18:13:58] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality821584749289502546.gal : 30 ms
[2025-06-01 18:13:58] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13663720397085955763.prop : 0 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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality821584749289502546.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13663720397085955763.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 135290 ms.

BK_STOP 1748801638138

--------------------
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
++ 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.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /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="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
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 r086-smll-174860102100205"
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 '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;