fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r092-tall-171624189500557
Last Updated
July 7, 2024

About the Execution of ITS-Tools for DBSingleClientW-PT-d2m05

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1287.928 287471.00 366953.00 752.30 0 0 1 0 1 1 0 0 0 1 1 2 0 1 1 1 normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Apr 12 12:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 96K Apr 12 12:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 12 12:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 105K Apr 12 12:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1.6M May 18 16:42 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716326379140

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DBSingleClientW-PT-d2m05
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2024-05-21 21:19:40] [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]
[2024-05-21 21:19:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 21:19:40] [INFO ] Load time of PNML (sax parser for PT used): 194 ms
[2024-05-21 21:19:40] [INFO ] Transformed 4763 places.
[2024-05-21 21:19:40] [INFO ] Transformed 2478 transitions.
[2024-05-21 21:19:40] [INFO ] Parsed PT model containing 4763 places and 2478 transitions and 9912 arcs in 303 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Deduced a syphon composed of 3580 places in 28 ms
Reduce places removed 3580 places and 0 transitions.
FORMULA DBSingleClientW-PT-d2m05-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m05-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m05-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m05-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m05-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m05-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m05-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+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] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 2478 rows 1183 cols
[2024-05-21 21:19:40] [INFO ] Computed 6 invariants in 142 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1944, 1944, 7, 5, 7, 2, 5, 5, 7]
RANDOM walk for 10000 steps (2335 resets) in 313 ms. (31 steps per ms)
BEST_FIRST walk for 90009 steps (8478 resets) in 496 ms. (181 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 1, 0, 0, 0] Max Struct:[1944, 1944, 7, 5, 7, 2, 5, 5, 7]
[2024-05-21 21:19:41] [INFO ] Invariant cache hit.
[2024-05-21 21:19:42] [INFO ] [Real]Absence check using 2 positive place invariants in 20 ms returned sat
[2024-05-21 21:19:42] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 13 ms returned sat
[2024-05-21 21:19:42] [INFO ] [Real]Absence check using state equation in 709 ms returned sat
[2024-05-21 21:19:43] [INFO ] State equation strengthened by 1588 read => feed constraints.
[2024-05-21 21:19:43] [INFO ] [Real]Added 1588 Read/Feed constraints in 827 ms returned sat
[2024-05-21 21:19:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:19:44] [INFO ] [Nat]Absence check using 2 positive place invariants in 13 ms returned sat
[2024-05-21 21:19:44] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 9 ms returned sat
[2024-05-21 21:19:44] [INFO ] [Nat]Absence check using state equation in 708 ms returned sat
[2024-05-21 21:19:45] [INFO ] [Nat]Added 1588 Read/Feed constraints in 978 ms returned sat
[2024-05-21 21:19:46] [INFO ] Computed and/alt/rep : 372/636/372 causal constraints (skipped 2105 transitions) in 673 ms.
[2024-05-21 21:19:47] [INFO ] Deduced a trap composed of 33 places in 805 ms of which 71 ms to minimize.
[2024-05-21 21:19:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1002 ms
[2024-05-21 21:19:48] [INFO ] Added : 10 causal constraints over 3 iterations in 2413 ms. Result :sat
Minimization took 580 ms.
[2024-05-21 21:19:49] [INFO ] [Real]Absence check using 2 positive place invariants in 11 ms returned sat
[2024-05-21 21:19:49] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 9 ms returned sat
[2024-05-21 21:19:49] [INFO ] [Real]Absence check using state equation in 672 ms returned sat
[2024-05-21 21:19:50] [INFO ] [Real]Added 1588 Read/Feed constraints in 718 ms returned sat
[2024-05-21 21:19:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:19:50] [INFO ] [Nat]Absence check using 2 positive place invariants in 11 ms returned sat
[2024-05-21 21:19:50] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 9 ms returned sat
[2024-05-21 21:19:51] [INFO ] [Nat]Absence check using state equation in 637 ms returned sat
[2024-05-21 21:19:52] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-21 21:19:52] [INFO ] [Nat]Added 1588 Read/Feed constraints in 1398 ms returned sat
[2024-05-21 21:19:53] [INFO ] Deduced a trap composed of 73 places in 692 ms of which 9 ms to minimize.
[2024-05-21 21:19:54] [INFO ] Deduced a trap composed of 56 places in 683 ms of which 8 ms to minimize.
[2024-05-21 21:19:55] [INFO ] Deduced a trap composed of 75 places in 665 ms of which 8 ms to minimize.
[2024-05-21 21:19:55] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2575 ms
[2024-05-21 21:19:56] [INFO ] Computed and/alt/rep : 372/636/372 causal constraints (skipped 2105 transitions) in 588 ms.
[2024-05-21 21:19:56] [INFO ] Added : 0 causal constraints over 0 iterations in 589 ms. Result :unknown
[2024-05-21 21:19:56] [INFO ] [Real]Absence check using 2 positive place invariants in 11 ms returned sat
[2024-05-21 21:19:56] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 9 ms returned sat
[2024-05-21 21:19:56] [INFO ] [Real]Absence check using state equation in 701 ms returned sat
[2024-05-21 21:19:57] [INFO ] [Real]Added 1588 Read/Feed constraints in 737 ms returned sat
[2024-05-21 21:19:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:19:57] [INFO ] [Nat]Absence check using 2 positive place invariants in 12 ms returned sat
[2024-05-21 21:19:57] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 9 ms returned sat
[2024-05-21 21:19:58] [INFO ] [Nat]Absence check using state equation in 730 ms returned sat
[2024-05-21 21:19:59] [INFO ] [Nat]Added 1588 Read/Feed constraints in 935 ms returned sat
[2024-05-21 21:20:00] [INFO ] Computed and/alt/rep : 372/636/372 causal constraints (skipped 2105 transitions) in 381 ms.
[2024-05-21 21:20:00] [INFO ] Added : 9 causal constraints over 2 iterations in 888 ms. Result :sat
Minimization took 706 ms.
[2024-05-21 21:20:01] [INFO ] [Real]Absence check using 2 positive place invariants in 11 ms returned sat
[2024-05-21 21:20:01] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 9 ms returned sat
[2024-05-21 21:20:02] [INFO ] [Real]Absence check using state equation in 683 ms returned sat
[2024-05-21 21:20:02] [INFO ] [Real]Added 1588 Read/Feed constraints in 668 ms returned sat
[2024-05-21 21:20:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:20:03] [INFO ] [Nat]Absence check using 2 positive place invariants in 11 ms returned sat
[2024-05-21 21:20:03] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 12 ms returned sat
[2024-05-21 21:20:03] [INFO ] [Nat]Absence check using state equation in 671 ms returned sat
[2024-05-21 21:20:04] [INFO ] [Nat]Added 1588 Read/Feed constraints in 1073 ms returned sat
[2024-05-21 21:20:05] [INFO ] Computed and/alt/rep : 372/636/372 causal constraints (skipped 2105 transitions) in 389 ms.
[2024-05-21 21:20:06] [INFO ] Deduced a trap composed of 33 places in 674 ms of which 7 ms to minimize.
[2024-05-21 21:20:07] [INFO ] Deduced a trap composed of 100 places in 672 ms of which 7 ms to minimize.
[2024-05-21 21:20:07] [INFO ] Trap strengthening (SAT) tested/added 2/2 trap constraints in 2150 ms
[2024-05-21 21:20:07] [INFO ] Added : 11 causal constraints over 3 iterations in 3034 ms. Result :unknown
[2024-05-21 21:20:08] [INFO ] [Real]Absence check using 2 positive place invariants in 11 ms returned sat
[2024-05-21 21:20:08] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 9 ms returned sat
[2024-05-21 21:20:08] [INFO ] [Real]Absence check using state equation in 652 ms returned sat
[2024-05-21 21:20:09] [INFO ] [Real]Added 1588 Read/Feed constraints in 716 ms returned sat
[2024-05-21 21:20:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:20:09] [INFO ] [Nat]Absence check using 2 positive place invariants in 11 ms returned sat
[2024-05-21 21:20:09] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 8 ms returned sat
[2024-05-21 21:20:10] [INFO ] [Nat]Absence check using state equation in 655 ms returned sat
[2024-05-21 21:20:11] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-21 21:20:11] [INFO ] [Nat]Added 1588 Read/Feed constraints in 1588 ms returned unknown
[2024-05-21 21:20:12] [INFO ] [Real]Absence check using 2 positive place invariants in 12 ms returned sat
[2024-05-21 21:20:12] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 9 ms returned sat
[2024-05-21 21:20:12] [INFO ] [Real]Absence check using state equation in 699 ms returned sat
[2024-05-21 21:20:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:20:12] [INFO ] [Nat]Absence check using 2 positive place invariants in 11 ms returned sat
[2024-05-21 21:20:13] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 9 ms returned sat
[2024-05-21 21:20:13] [INFO ] [Nat]Absence check using state equation in 673 ms returned sat
[2024-05-21 21:20:14] [INFO ] [Nat]Added 1588 Read/Feed constraints in 884 ms returned sat
[2024-05-21 21:20:15] [INFO ] Computed and/alt/rep : 372/636/372 causal constraints (skipped 2105 transitions) in 371 ms.
[2024-05-21 21:20:15] [INFO ] Added : 2 causal constraints over 1 iterations in 641 ms. Result :sat
Minimization took 644 ms.
[2024-05-21 21:20:16] [INFO ] [Real]Absence check using 2 positive place invariants in 11 ms returned sat
[2024-05-21 21:20:16] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 10 ms returned sat
[2024-05-21 21:20:16] [INFO ] [Real]Absence check using state equation in 622 ms returned sat
[2024-05-21 21:20:17] [INFO ] [Real]Added 1588 Read/Feed constraints in 739 ms returned sat
[2024-05-21 21:20:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:20:17] [INFO ] [Nat]Absence check using 2 positive place invariants in 11 ms returned sat
[2024-05-21 21:20:17] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 9 ms returned sat
[2024-05-21 21:20:18] [INFO ] [Nat]Absence check using state equation in 634 ms returned sat
[2024-05-21 21:20:19] [INFO ] [Nat]Added 1588 Read/Feed constraints in 941 ms returned sat
[2024-05-21 21:20:20] [INFO ] Deduced a trap composed of 33 places in 696 ms of which 9 ms to minimize.
[2024-05-21 21:20:20] [INFO ] Deduced a trap composed of 48 places in 688 ms of which 7 ms to minimize.
[2024-05-21 21:20:21] [INFO ] Deduced a trap composed of 28 places in 673 ms of which 8 ms to minimize.
[2024-05-21 21:20:22] [INFO ] Deduced a trap composed of 76 places in 686 ms of which 8 ms to minimize.
[2024-05-21 21:20:22] [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.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
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)
[2024-05-21 21:20:22] [INFO ] [Real]Absence check using 2 positive place invariants in 11 ms returned sat
[2024-05-21 21:20:22] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 9 ms returned sat
[2024-05-21 21:20:23] [INFO ] [Real]Absence check using state equation in 665 ms returned sat
[2024-05-21 21:20:24] [INFO ] [Real]Added 1588 Read/Feed constraints in 769 ms returned sat
[2024-05-21 21:20:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:20:24] [INFO ] [Nat]Absence check using 2 positive place invariants in 12 ms returned sat
[2024-05-21 21:20:24] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 9 ms returned sat
[2024-05-21 21:20:25] [INFO ] [Nat]Absence check using state equation in 655 ms returned sat
[2024-05-21 21:20:26] [INFO ] [Nat]Added 1588 Read/Feed constraints in 1046 ms returned sat
[2024-05-21 21:20:26] [INFO ] Deduced a trap composed of 170 places in 615 ms of which 7 ms to minimize.
[2024-05-21 21:20:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 796 ms
[2024-05-21 21:20:27] [INFO ] Computed and/alt/rep : 372/636/372 causal constraints (skipped 2105 transitions) in 382 ms.
[2024-05-21 21:20:28] [INFO ] Deduced a trap composed of 32 places in 724 ms of which 8 ms to minimize.
[2024-05-21 21:20:29] [INFO ] Deduced a trap composed of 75 places in 684 ms of which 7 ms to minimize.
[2024-05-21 21:20:29] [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.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1128)
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)
[2024-05-21 21:20:29] [INFO ] [Real]Absence check using 2 positive place invariants in 11 ms returned sat
[2024-05-21 21:20:29] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 9 ms returned sat
[2024-05-21 21:20:30] [INFO ] [Real]Absence check using state equation in 626 ms returned sat
[2024-05-21 21:20:31] [INFO ] [Real]Added 1588 Read/Feed constraints in 898 ms returned sat
[2024-05-21 21:20:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:20:31] [INFO ] [Nat]Absence check using 2 positive place invariants in 16 ms returned sat
[2024-05-21 21:20:31] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 9 ms returned sat
[2024-05-21 21:20:32] [INFO ] [Nat]Absence check using state equation in 626 ms returned sat
[2024-05-21 21:20:32] [INFO ] [Nat]Added 1588 Read/Feed constraints in 885 ms returned sat
[2024-05-21 21:20:33] [INFO ] Deduced a trap composed of 50 places in 680 ms of which 7 ms to minimize.
[2024-05-21 21:20:34] [INFO ] Deduced a trap composed of 157 places in 434 ms of which 7 ms to minimize.
[2024-05-21 21:20:34] [INFO ] Trap strengthening (SAT) tested/added 2/2 trap constraints in 1785 ms
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 1, 0, 0, 0] Max Struct:[1944, 1944, 7, 5, 7, 2, 5, 5, 7]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 1, 0, 0, 0] Max Struct:[1944, 1944, 7, 5, 7, 2, 5, 5, 7]
Support contains 9 out of 1183 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1183/1183 places, 2478/2478 transitions.
Graph (complete) has 4476 edges and 1183 vertex of which 1136 are kept as prefixes of interest. Removing 47 places using SCC suffix rule.8 ms
Discarding 47 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 18 transitions
Ensure Unique test removed 199 transitions
Reduce isomorphic transitions removed 217 transitions.
Iterating post reduction 0 with 217 rules applied. Total rules applied 218 place count 1136 transition count 2261
Discarding 388 places :
Symmetric choice reduction at 1 with 388 rule applications. Total rules 606 place count 748 transition count 1220
Iterating global reduction 1 with 388 rules applied. Total rules applied 994 place count 748 transition count 1220
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 1012 place count 748 transition count 1202
Discarding 311 places :
Symmetric choice reduction at 2 with 311 rule applications. Total rules 1323 place count 437 transition count 891
Iterating global reduction 2 with 311 rules applied. Total rules applied 1634 place count 437 transition count 891
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 1645 place count 437 transition count 880
Discarding 234 places :
Symmetric choice reduction at 3 with 234 rule applications. Total rules 1879 place count 203 transition count 550
Iterating global reduction 3 with 234 rules applied. Total rules applied 2113 place count 203 transition count 550
Ensure Unique test removed 207 transitions
Reduce isomorphic transitions removed 207 transitions.
Iterating post reduction 3 with 207 rules applied. Total rules applied 2320 place count 203 transition count 343
Discarding 22 places :
Symmetric choice reduction at 4 with 22 rule applications. Total rules 2342 place count 181 transition count 306
Iterating global reduction 4 with 22 rules applied. Total rules applied 2364 place count 181 transition count 306
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 2374 place count 181 transition count 296
Discarding 14 places :
Symmetric choice reduction at 5 with 14 rule applications. Total rules 2388 place count 167 transition count 282
Iterating global reduction 5 with 14 rules applied. Total rules applied 2402 place count 167 transition count 282
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 2406 place count 167 transition count 278
Discarding 11 places :
Symmetric choice reduction at 6 with 11 rule applications. Total rules 2417 place count 156 transition count 267
Iterating global reduction 6 with 11 rules applied. Total rules applied 2428 place count 156 transition count 267
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 2433 place count 156 transition count 262
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 2435 place count 154 transition count 258
Iterating global reduction 7 with 2 rules applied. Total rules applied 2437 place count 154 transition count 258
Applied a total of 2437 rules in 230 ms. Remains 154 /1183 variables (removed 1029) and now considering 258/2478 (removed 2220) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 239 ms. Remains : 154/1183 places, 258/2478 transitions.
// Phase 1: matrix 258 rows 154 cols
[2024-05-21 21:20:35] [INFO ] Computed 2 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 1, 0, 0, 0] Max Struct:[1944, 1944, 7, 5, 7, 2, 5, 5, 7]
RANDOM walk for 1000000 steps (229444 resets) in 1635 ms. (611 steps per ms)
BEST_FIRST walk for 9000006 steps (859686 resets) in 6495 ms. (1385 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 1, 0, 0, 0] Max Struct:[1944, 1944, 7, 5, 7, 2, 5, 5, 7]
[2024-05-21 21:20:43] [INFO ] Invariant cache hit.
[2024-05-21 21:20:43] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 21:20:43] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2024-05-21 21:20:43] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-21 21:20:43] [INFO ] [Real]Added 111 Read/Feed constraints in 23 ms returned sat
[2024-05-21 21:20:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:20:43] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 21:20:43] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2024-05-21 21:20:43] [INFO ] [Nat]Added 111 Read/Feed constraints in 23 ms returned sat
[2024-05-21 21:20:43] [INFO ] Computed and/alt/rep : 58/161/58 causal constraints (skipped 199 transitions) in 19 ms.
[2024-05-21 21:20:43] [INFO ] Added : 9 causal constraints over 2 iterations in 89 ms. Result :sat
Minimization took 190 ms.
[2024-05-21 21:20:43] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 21:20:43] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2024-05-21 21:20:43] [INFO ] [Real]Added 111 Read/Feed constraints in 18 ms returned sat
[2024-05-21 21:20:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:20:44] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 21:20:44] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2024-05-21 21:20:44] [INFO ] [Nat]Added 111 Read/Feed constraints in 29 ms returned sat
[2024-05-21 21:20:44] [INFO ] Computed and/alt/rep : 58/161/58 causal constraints (skipped 199 transitions) in 19 ms.
[2024-05-21 21:20:44] [INFO ] Deduced a trap composed of 19 places in 67 ms of which 2 ms to minimize.
[2024-05-21 21:20:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 88 ms
[2024-05-21 21:20:44] [INFO ] Added : 13 causal constraints over 3 iterations in 201 ms. Result :sat
Minimization took 188 ms.
[2024-05-21 21:20:44] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 21:20:44] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2024-05-21 21:20:44] [INFO ] [Real]Added 111 Read/Feed constraints in 17 ms returned sat
[2024-05-21 21:20:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:20:44] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 21:20:44] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2024-05-21 21:20:44] [INFO ] [Nat]Added 111 Read/Feed constraints in 20 ms returned sat
[2024-05-21 21:20:44] [INFO ] Computed and/alt/rep : 58/161/58 causal constraints (skipped 199 transitions) in 17 ms.
[2024-05-21 21:20:44] [INFO ] Added : 11 causal constraints over 3 iterations in 88 ms. Result :sat
Minimization took 185 ms.
[2024-05-21 21:20:45] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 21:20:45] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2024-05-21 21:20:45] [INFO ] [Real]Added 111 Read/Feed constraints in 15 ms returned sat
[2024-05-21 21:20:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:20:45] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 21:20:45] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2024-05-21 21:20:45] [INFO ] [Nat]Added 111 Read/Feed constraints in 22 ms returned sat
[2024-05-21 21:20:45] [INFO ] Computed and/alt/rep : 58/161/58 causal constraints (skipped 199 transitions) in 16 ms.
[2024-05-21 21:20:45] [INFO ] Added : 10 causal constraints over 4 iterations in 98 ms. Result :sat
Minimization took 179 ms.
[2024-05-21 21:20:45] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 21:20:45] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2024-05-21 21:20:45] [INFO ] [Real]Added 111 Read/Feed constraints in 25 ms returned sat
[2024-05-21 21:20:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:20:45] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 21:20:45] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2024-05-21 21:20:45] [INFO ] [Nat]Added 111 Read/Feed constraints in 37 ms returned sat
[2024-05-21 21:20:45] [INFO ] Computed and/alt/rep : 58/161/58 causal constraints (skipped 199 transitions) in 22 ms.
[2024-05-21 21:20:45] [INFO ] Added : 15 causal constraints over 3 iterations in 118 ms. Result :sat
Minimization took 184 ms.
[2024-05-21 21:20:46] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 21:20:46] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2024-05-21 21:20:46] [INFO ] [Real]Added 111 Read/Feed constraints in 14 ms returned sat
[2024-05-21 21:20:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:20:46] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 21:20:46] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2024-05-21 21:20:46] [INFO ] [Nat]Added 111 Read/Feed constraints in 13 ms returned sat
[2024-05-21 21:20:46] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 1 ms to minimize.
[2024-05-21 21:20:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 76 ms
[2024-05-21 21:20:46] [INFO ] Computed and/alt/rep : 58/161/58 causal constraints (skipped 199 transitions) in 18 ms.
[2024-05-21 21:20:46] [INFO ] Added : 2 causal constraints over 1 iterations in 48 ms. Result :sat
Minimization took 163 ms.
[2024-05-21 21:20:46] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 21:20:46] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2024-05-21 21:20:46] [INFO ] [Real]Added 111 Read/Feed constraints in 20 ms returned sat
[2024-05-21 21:20:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:20:46] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 21:20:46] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2024-05-21 21:20:46] [INFO ] [Nat]Added 111 Read/Feed constraints in 22 ms returned sat
[2024-05-21 21:20:46] [INFO ] Computed and/alt/rep : 58/161/58 causal constraints (skipped 199 transitions) in 15 ms.
[2024-05-21 21:20:46] [INFO ] Added : 15 causal constraints over 4 iterations in 97 ms. Result :sat
Minimization took 186 ms.
[2024-05-21 21:20:47] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 21:20:47] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2024-05-21 21:20:47] [INFO ] [Real]Added 111 Read/Feed constraints in 17 ms returned sat
[2024-05-21 21:20:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:20:47] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 21:20:47] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2024-05-21 21:20:47] [INFO ] [Nat]Added 111 Read/Feed constraints in 21 ms returned sat
[2024-05-21 21:20:47] [INFO ] Computed and/alt/rep : 58/161/58 causal constraints (skipped 199 transitions) in 16 ms.
[2024-05-21 21:20:47] [INFO ] Added : 11 causal constraints over 3 iterations in 79 ms. Result :sat
Minimization took 185 ms.
[2024-05-21 21:20:47] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 21:20:47] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2024-05-21 21:20:47] [INFO ] [Real]Added 111 Read/Feed constraints in 17 ms returned sat
[2024-05-21 21:20:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:20:47] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 21:20:47] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2024-05-21 21:20:47] [INFO ] [Nat]Added 111 Read/Feed constraints in 26 ms returned sat
[2024-05-21 21:20:47] [INFO ] Computed and/alt/rep : 58/161/58 causal constraints (skipped 199 transitions) in 17 ms.
[2024-05-21 21:20:48] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 1 ms to minimize.
[2024-05-21 21:20:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 105 ms
[2024-05-21 21:20:48] [INFO ] Added : 13 causal constraints over 3 iterations in 209 ms. Result :sat
Minimization took 190 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 1, 0, 0, 0] Max Struct:[1944, 1944, 7, 5, 7, 2, 5, 5, 7]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 1, 0, 0, 0] Max Struct:[1944, 1944, 7, 5, 7, 2, 5, 5, 7]
Support contains 9 out of 154 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 154/154 places, 258/258 transitions.
Applied a total of 0 rules in 11 ms. Remains 154 /154 variables (removed 0) and now considering 258/258 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 154/154 places, 258/258 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 154/154 places, 258/258 transitions.
Applied a total of 0 rules in 10 ms. Remains 154 /154 variables (removed 0) and now considering 258/258 (removed 0) transitions.
[2024-05-21 21:20:48] [INFO ] Invariant cache hit.
[2024-05-21 21:20:49] [INFO ] Implicit Places using invariants in 265 ms returned []
[2024-05-21 21:20:49] [INFO ] Invariant cache hit.
[2024-05-21 21:20:49] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-21 21:20:49] [INFO ] Implicit Places using invariants and state equation in 363 ms returned []
Implicit Place search using SMT with State Equation took 636 ms to find 0 implicit places.
[2024-05-21 21:20:49] [INFO ] Redundant transitions in 9 ms returned []
Running 257 sub problems to find dead transitions.
[2024-05-21 21:20:49] [INFO ] Invariant cache hit.
[2024-05-21 21:20:49] [INFO ] State equation strengthened by 111 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/153 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 2 (OVERLAPS) 1/154 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 4 (OVERLAPS) 258/412 variables, 154/156 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/412 variables, 111/267 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/412 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 257 unsolved
[2024-05-21 21:20:58] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 1 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/412 variables, 1/268 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/412 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 9 (OVERLAPS) 0/412 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 257 unsolved
No progress, stopping.
After SMT solving in domain Real declared 412/412 variables, and 268 constraints, problems are : Problem set: 0 solved, 257 unsolved in 18668 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 154/154 constraints, ReadFeed: 111/111 constraints, PredecessorRefiner: 257/257 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 257 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/153 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 3 (OVERLAPS) 1/154 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 5 (OVERLAPS) 258/412 variables, 154/157 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/412 variables, 111/268 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/412 variables, 257/525 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/412 variables, 0/525 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 9 (OVERLAPS) 0/412 variables, 0/525 constraints. Problems are: Problem set: 0 solved, 257 unsolved
No progress, stopping.
After SMT solving in domain Int declared 412/412 variables, and 525 constraints, problems are : Problem set: 0 solved, 257 unsolved in 21481 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 154/154 constraints, ReadFeed: 111/111 constraints, PredecessorRefiner: 257/257 constraints, Known Traps: 1/1 constraints]
After SMT, in 40715ms problems are : Problem set: 0 solved, 257 unsolved
Search for dead transitions found 0 dead transitions in 40729ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41418 ms. Remains : 154/154 places, 258/258 transitions.
[2024-05-21 21:21:30] [INFO ] Flatten gal took : 106 ms
[2024-05-21 21:21:30] [INFO ] Flatten gal took : 29 ms
[2024-05-21 21:21:30] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4511504655231036060.gal : 10 ms
[2024-05-21 21:21:30] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13659740964092956792.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/ReachabilityCardinality4511504655231036060.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13659740964092956792.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality13659740964092956792.prop.
SDD proceeding with computation,18 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,18 properties remain. new max is 8
SDD size :7 after 30
SDD proceeding with computation,18 properties remain. new max is 16
SDD size :30 after 68
SDD proceeding with computation,18 properties remain. new max is 32
SDD size :68 after 142
SDD proceeding with computation,18 properties remain. new max is 64
SDD size :142 after 258
RANDOM walk for 40000 steps (9172 resets) in 1871 ms. (21 steps per ms) remains 18/18 properties
SDD proceeding with computation,18 properties remain. new max is 128
SDD size :258 after 524
SDD proceeding with computation,18 properties remain. new max is 256
SDD size :524 after 3186
BEST_FIRST walk for 4001 steps (381 resets) in 50 ms. (78 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (373 resets) in 48 ms. (81 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (376 resets) in 51 ms. (76 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (372 resets) in 69 ms. (57 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (375 resets) in 24 ms. (160 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (362 resets) in 15 ms. (250 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (391 resets) in 32 ms. (121 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (406 resets) in 37 ms. (105 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (395 resets) in 27 ms. (142 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (381 resets) in 33 ms. (117 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (403 resets) in 29 ms. (133 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (417 resets) in 29 ms. (133 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4000 steps (376 resets) in 15 ms. (250 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (433 resets) in 33 ms. (117 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (377 resets) in 34 ms. (114 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (334 resets) in 11 ms. (333 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4001 steps (357 resets) in 12 ms. (307 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (364 resets) in 49 ms. (80 steps per ms) remains 18/18 properties
SDD proceeding with computation,18 properties remain. new max is 512
SDD size :3186 after 9427
SDD proceeding with computation,18 properties remain. new max is 1024
SDD size :9427 after 14209
SDD proceeding with computation,18 properties remain. new max is 2048
SDD size :14209 after 38314
Invariant property MIN5 does not hold.
Reachability property MAX5 is true.
Invariant property MIN3 does not hold.
Invariant property MIN0 does not hold.
SDD proceeding with computation,14 properties remain. new max is 2048
SDD size :38314 after 67179
Invariant property MIN2 does not hold.
SDD proceeding with computation,13 properties remain. new max is 2048
SDD size :67179 after 91113
Invariant property MIN1 does not hold.
SDD proceeding with computation,12 properties remain. new max is 2048
SDD size :91113 after 132363
Interrupted probabilistic random walk after 309462 steps, run timeout after 3001 ms. (steps per millisecond=103 ) properties seen :10 out of 18
Probabilistic random walk after 309462 steps, saw 128026 distinct states, run finished after 3004 ms. (steps per millisecond=103 ) properties seen :10
Invariant property MIN7 does not hold.
Invariant property MIN4 does not hold.
SDD proceeding with computation,10 properties remain. new max is 2048
SDD size :132363 after 161593
[2024-05-21 21:21:34] [INFO ] Invariant cache hit.
[2024-05-21 21:21:34] [INFO ] State equation strengthened by 111 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 102/110 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 170/280 variables, 110/112 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/280 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem MAX0 is UNSAT
Problem MAX1 is UNSAT
Problem MAX2 is UNSAT
Problem MAX3 is UNSAT
Problem MAX4 is UNSAT
Problem MAX6 is UNSAT
Problem MAX7 is UNSAT
Problem MAX8 is UNSAT
After SMT solving in domain Real declared 405/412 variables, and 152 constraints, problems are : Problem set: 8 solved, 0 unsolved in 462 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 150/154 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 501ms problems are : Problem set: 8 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
FORMULA DBSingleClientW-PT-d2m05-UpperBounds-11 2 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1944, 1944, 7, 5, 7, 5, 5, 7]
Starting property specific reduction for DBSingleClientW-PT-d2m05-UpperBounds-02
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[1944]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1944]
[2024-05-21 21:21:34] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1944]
RANDOM walk for 10000 steps (2316 resets) in 20 ms. (476 steps per ms)
BEST_FIRST walk for 10001 steps (983 resets) in 9 ms. (1000 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1944]
[2024-05-21 21:21:34] [INFO ] Invariant cache hit.
[2024-05-21 21:21:34] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 21:21:34] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2024-05-21 21:21:34] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-21 21:21:34] [INFO ] [Real]Added 111 Read/Feed constraints in 17 ms returned sat
[2024-05-21 21:21:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:21:34] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 21:21:34] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2024-05-21 21:21:35] [INFO ] [Nat]Added 111 Read/Feed constraints in 23 ms returned sat
[2024-05-21 21:21:35] [INFO ] Computed and/alt/rep : 58/161/58 causal constraints (skipped 199 transitions) in 18 ms.
[2024-05-21 21:21:35] [INFO ] Added : 9 causal constraints over 2 iterations in 71 ms. Result :sat
Minimization took 194 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1944]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1944]
Support contains 1 out of 154 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 154/154 places, 258/258 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 146 transition count 246
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 146 transition count 246
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 19 place count 146 transition count 243
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 26 place count 139 transition count 235
Iterating global reduction 1 with 7 rules applied. Total rules applied 33 place count 139 transition count 235
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 35 place count 139 transition count 233
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 39 place count 135 transition count 225
Iterating global reduction 2 with 4 rules applied. Total rules applied 43 place count 135 transition count 225
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 48 place count 135 transition count 220
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 53 place count 130 transition count 198
Iterating global reduction 3 with 5 rules applied. Total rules applied 58 place count 130 transition count 198
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 60 place count 128 transition count 196
Iterating global reduction 3 with 2 rules applied. Total rules applied 62 place count 128 transition count 196
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 64 place count 128 transition count 194
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 65 place count 127 transition count 193
Iterating global reduction 4 with 1 rules applied. Total rules applied 66 place count 127 transition count 193
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 69 place count 127 transition count 190
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 71 place count 125 transition count 177
Iterating global reduction 5 with 2 rules applied. Total rules applied 73 place count 125 transition count 177
Applied a total of 73 rules in 32 ms. Remains 125 /154 variables (removed 29) and now considering 177/258 (removed 81) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 125/154 places, 177/258 transitions.
// Phase 1: matrix 177 rows 125 cols
[2024-05-21 21:21:35] [INFO ] Computed 2 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1944]
RANDOM walk for 1000000 steps (230063 resets) in 1094 ms. (913 steps per ms)
BEST_FIRST walk for 1000000 steps (95793 resets) in 535 ms. (1865 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1944]
[2024-05-21 21:21:37] [INFO ] Invariant cache hit.
[2024-05-21 21:21:37] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 21:21:37] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2024-05-21 21:21:37] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-21 21:21:37] [INFO ] [Real]Added 57 Read/Feed constraints in 10 ms returned sat
[2024-05-21 21:21:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:21:37] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 21:21:37] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2024-05-21 21:21:37] [INFO ] [Nat]Added 57 Read/Feed constraints in 10 ms returned sat
[2024-05-21 21:21:37] [INFO ] Computed and/alt/rep : 49/117/49 causal constraints (skipped 127 transitions) in 12 ms.
[2024-05-21 21:21:37] [INFO ] Added : 16 causal constraints over 4 iterations in 69 ms. Result :sat
Minimization took 71 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1944]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1944]
Support contains 1 out of 125 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 125/125 places, 177/177 transitions.
Applied a total of 0 rules in 6 ms. Remains 125 /125 variables (removed 0) and now considering 177/177 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 125/125 places, 177/177 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 125/125 places, 177/177 transitions.
Applied a total of 0 rules in 5 ms. Remains 125 /125 variables (removed 0) and now considering 177/177 (removed 0) transitions.
[2024-05-21 21:21:37] [INFO ] Invariant cache hit.
[2024-05-21 21:21:37] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-21 21:21:37] [INFO ] Invariant cache hit.
[2024-05-21 21:21:37] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-21 21:21:37] [INFO ] Implicit Places using invariants and state equation in 240 ms returned []
Implicit Place search using SMT with State Equation took 319 ms to find 0 implicit places.
[2024-05-21 21:21:37] [INFO ] Redundant transitions in 1 ms returned []
Running 176 sub problems to find dead transitions.
[2024-05-21 21:21:37] [INFO ] Invariant cache hit.
[2024-05-21 21:21:37] [INFO ] State equation strengthened by 57 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 2 (OVERLAPS) 1/125 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 4 (OVERLAPS) 177/302 variables, 125/127 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/302 variables, 57/184 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/302 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 7 (OVERLAPS) 0/302 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 176 unsolved
No progress, stopping.
After SMT solving in domain Real declared 302/302 variables, and 184 constraints, problems are : Problem set: 0 solved, 176 unsolved in 4457 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 125/125 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 176/176 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 176 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 2 (OVERLAPS) 1/125 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 4 (OVERLAPS) 177/302 variables, 125/127 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/302 variables, 57/184 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/302 variables, 176/360 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/302 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 8 (OVERLAPS) 0/302 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 176 unsolved
No progress, stopping.
After SMT solving in domain Int declared 302/302 variables, and 360 constraints, problems are : Problem set: 0 solved, 176 unsolved in 10833 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 125/125 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 176/176 constraints, Known Traps: 0/0 constraints]
After SMT, in 15556ms problems are : Problem set: 0 solved, 176 unsolved
Search for dead transitions found 0 dead transitions in 15558ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15896 ms. Remains : 125/125 places, 177/177 transitions.
[2024-05-21 21:21:53] [INFO ] Flatten gal took : 19 ms
[2024-05-21 21:21:53] [INFO ] Flatten gal took : 16 ms
[2024-05-21 21:21:53] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3546135010869637577.gal : 5 ms
[2024-05-21 21:21:53] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10286604572544886146.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality3546135010869637577.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10286604572544886146.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality10286604572544886146.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :7 after 30
RANDOM walk for 40000 steps (9218 resets) in 159 ms. (250 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :30 after 68
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :68 after 106
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :106 after 182
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :182 after 282
BEST_FIRST walk for 40004 steps (3914 resets) in 51 ms. (769 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :282 after 548
BEST_FIRST walk for 40002 steps (3760 resets) in 47 ms. (833 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :548 after 1442
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1442 after 5638
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :5638 after 21934
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :21934 after 41322
Probably explored full state space saw : 190433 states, properties seen :1
Probabilistic random walk after 461337 steps, saw 190433 distinct states, run finished after 732 ms. (steps per millisecond=630 ) properties seen :1
Explored full state space saw : 190906 states, properties seen :0
Exhaustive walk after 462250 steps, saw 190906 distinct states, run finished after 453 ms. (steps per millisecond=1020 ) properties seen :0
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:[0] Max Struct:[1944]
Ending property specific reduction for DBSingleClientW-PT-d2m05-UpperBounds-02 in 19872 ms.
Starting property specific reduction for DBSingleClientW-PT-d2m05-UpperBounds-04
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[1944]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1944]
// Phase 1: matrix 258 rows 154 cols
[2024-05-21 21:21:54] [INFO ] Computed 2 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1944]
RANDOM walk for 10000 steps (2284 resets) in 18 ms. (526 steps per ms)
BEST_FIRST walk for 10000 steps (981 resets) in 9 ms. (1000 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1944]
[2024-05-21 21:21:54] [INFO ] Invariant cache hit.
[2024-05-21 21:21:54] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 21:21:54] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2024-05-21 21:21:54] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-21 21:21:54] [INFO ] [Real]Added 111 Read/Feed constraints in 21 ms returned sat
[2024-05-21 21:21:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:21:54] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 21:21:54] [INFO ] [Nat]Absence check using state equation in 64 ms returned sat
[2024-05-21 21:21:54] [INFO ] [Nat]Added 111 Read/Feed constraints in 34 ms returned sat
[2024-05-21 21:21:54] [INFO ] Computed and/alt/rep : 58/161/58 causal constraints (skipped 199 transitions) in 15 ms.
[2024-05-21 21:21:55] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 1 ms to minimize.
[2024-05-21 21:21:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 96 ms
[2024-05-21 21:21:55] [INFO ] Added : 13 causal constraints over 3 iterations in 210 ms. Result :sat
Minimization took 205 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1944]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1944]
Support contains 1 out of 154 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 154/154 places, 258/258 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 146 transition count 246
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 146 transition count 246
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 19 place count 146 transition count 243
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 26 place count 139 transition count 235
Iterating global reduction 1 with 7 rules applied. Total rules applied 33 place count 139 transition count 235
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 35 place count 139 transition count 233
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 39 place count 135 transition count 225
Iterating global reduction 2 with 4 rules applied. Total rules applied 43 place count 135 transition count 225
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 48 place count 135 transition count 220
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 52 place count 131 transition count 206
Iterating global reduction 3 with 4 rules applied. Total rules applied 56 place count 131 transition count 206
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 58 place count 129 transition count 204
Iterating global reduction 3 with 2 rules applied. Total rules applied 60 place count 129 transition count 204
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 62 place count 129 transition count 202
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 63 place count 128 transition count 201
Iterating global reduction 4 with 1 rules applied. Total rules applied 64 place count 128 transition count 201
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 67 place count 128 transition count 198
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 70 place count 125 transition count 178
Iterating global reduction 5 with 3 rules applied. Total rules applied 73 place count 125 transition count 178
Applied a total of 73 rules in 39 ms. Remains 125 /154 variables (removed 29) and now considering 178/258 (removed 80) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 125/154 places, 178/258 transitions.
// Phase 1: matrix 178 rows 125 cols
[2024-05-21 21:21:55] [INFO ] Computed 2 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1944]
RANDOM walk for 1000000 steps (229906 resets) in 1113 ms. (897 steps per ms)
BEST_FIRST walk for 1000001 steps (94705 resets) in 507 ms. (1968 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1944]
[2024-05-21 21:21:57] [INFO ] Invariant cache hit.
[2024-05-21 21:21:57] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 21:21:57] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2024-05-21 21:21:57] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-21 21:21:57] [INFO ] [Real]Added 58 Read/Feed constraints in 11 ms returned sat
[2024-05-21 21:21:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:21:57] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 21:21:57] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2024-05-21 21:21:57] [INFO ] [Nat]Added 58 Read/Feed constraints in 19 ms returned sat
[2024-05-21 21:21:57] [INFO ] Computed and/alt/rep : 49/117/49 causal constraints (skipped 128 transitions) in 12 ms.
[2024-05-21 21:21:57] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
[2024-05-21 21:21:57] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2024-05-21 21:21:57] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2024-05-21 21:21:57] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 1 ms to minimize.
[2024-05-21 21:21:57] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 310 ms
[2024-05-21 21:21:57] [INFO ] Added : 22 causal constraints over 5 iterations in 414 ms. Result :sat
Minimization took 91 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1944]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1944]
Support contains 1 out of 125 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 125/125 places, 178/178 transitions.
Applied a total of 0 rules in 5 ms. Remains 125 /125 variables (removed 0) and now considering 178/178 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 125/125 places, 178/178 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 125/125 places, 178/178 transitions.
Applied a total of 0 rules in 5 ms. Remains 125 /125 variables (removed 0) and now considering 178/178 (removed 0) transitions.
[2024-05-21 21:21:57] [INFO ] Invariant cache hit.
[2024-05-21 21:21:57] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-05-21 21:21:57] [INFO ] Invariant cache hit.
[2024-05-21 21:21:57] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-21 21:21:58] [INFO ] Implicit Places using invariants and state equation in 254 ms returned []
Implicit Place search using SMT with State Equation took 334 ms to find 0 implicit places.
[2024-05-21 21:21:58] [INFO ] Redundant transitions in 2 ms returned []
Running 177 sub problems to find dead transitions.
[2024-05-21 21:21:58] [INFO ] Invariant cache hit.
[2024-05-21 21:21:58] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (OVERLAPS) 1/125 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 4 (OVERLAPS) 178/303 variables, 125/127 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/303 variables, 58/185 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/303 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 7 (OVERLAPS) 0/303 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 177 unsolved
No progress, stopping.
After SMT solving in domain Real declared 303/303 variables, and 185 constraints, problems are : Problem set: 0 solved, 177 unsolved in 4692 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 125/125 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 177 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (OVERLAPS) 1/125 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 4 (OVERLAPS) 178/303 variables, 125/127 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/303 variables, 58/185 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/303 variables, 177/362 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/303 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 8 (OVERLAPS) 0/303 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 177 unsolved
No progress, stopping.
After SMT solving in domain Int declared 303/303 variables, and 362 constraints, problems are : Problem set: 0 solved, 177 unsolved in 9658 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 125/125 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 0/0 constraints]
After SMT, in 14569ms problems are : Problem set: 0 solved, 177 unsolved
Search for dead transitions found 0 dead transitions in 14572ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14920 ms. Remains : 125/125 places, 178/178 transitions.
[2024-05-21 21:22:12] [INFO ] Flatten gal took : 21 ms
RANDOM walk for 40000 steps (9131 resets) in 120 ms. (330 steps per ms) remains 2/2 properties
[2024-05-21 21:22:12] [INFO ] Flatten gal took : 23 ms
BEST_FIRST walk for 40004 steps (3800 resets) in 35 ms. (1111 steps per ms) remains 2/2 properties
[2024-05-21 21:22:12] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3272308833557890809.gal : 3 ms
[2024-05-21 21:22:12] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10545006635931322068.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/ReachabilityCardinality3272308833557890809.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10545006635931322068.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality10545006635931322068.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :7 after 30
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :30 after 68
BEST_FIRST walk for 40001 steps (3776 resets) in 62 ms. (634 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :68 after 106
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :106 after 182
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :182 after 282
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :282 after 548
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :548 after 1730
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1730 after 6632
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :6632 after 30266
Probably explored full state space saw : 193672 states, properties seen :1
Probabilistic random walk after 473596 steps, saw 193672 distinct states, run finished after 707 ms. (steps per millisecond=669 ) properties seen :1
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :30266 after 42432
Explored full state space saw : 194154 states, properties seen :0
Exhaustive walk after 474514 steps, saw 194154 distinct states, run finished after 448 ms. (steps per millisecond=1059 ) properties seen :0
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:[0] Max Struct:[1944]
Ending property specific reduction for DBSingleClientW-PT-d2m05-UpperBounds-04 in 19422 ms.
Starting property specific reduction for DBSingleClientW-PT-d2m05-UpperBounds-05
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[7]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[7]
// Phase 1: matrix 258 rows 154 cols
[2024-05-21 21:22:14] [INFO ] Computed 2 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[7]
RANDOM walk for 10000 steps (2282 resets) in 22 ms. (434 steps per ms)
BEST_FIRST walk for 10001 steps (992 resets) in 8 ms. (1111 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[7]
[2024-05-21 21:22:14] [INFO ] Invariant cache hit.
[2024-05-21 21:22:14] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 21:22:14] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2024-05-21 21:22:14] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-21 21:22:14] [INFO ] [Real]Added 111 Read/Feed constraints in 19 ms returned sat
[2024-05-21 21:22:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:22:14] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 21:22:14] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2024-05-21 21:22:14] [INFO ] [Nat]Added 111 Read/Feed constraints in 20 ms returned sat
[2024-05-21 21:22:14] [INFO ] Computed and/alt/rep : 58/161/58 causal constraints (skipped 199 transitions) in 16 ms.
[2024-05-21 21:22:14] [INFO ] Added : 11 causal constraints over 3 iterations in 78 ms. Result :sat
Minimization took 177 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[7]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[7]
Support contains 1 out of 154 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 154/154 places, 258/258 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 146 transition count 246
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 146 transition count 246
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 20 place count 146 transition count 242
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 26 place count 140 transition count 235
Iterating global reduction 1 with 6 rules applied. Total rules applied 32 place count 140 transition count 235
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 33 place count 140 transition count 234
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 37 place count 136 transition count 226
Iterating global reduction 2 with 4 rules applied. Total rules applied 41 place count 136 transition count 226
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 46 place count 136 transition count 221
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 51 place count 131 transition count 199
Iterating global reduction 3 with 5 rules applied. Total rules applied 56 place count 131 transition count 199
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 58 place count 129 transition count 197
Iterating global reduction 3 with 2 rules applied. Total rules applied 60 place count 129 transition count 197
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 62 place count 129 transition count 195
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 63 place count 128 transition count 194
Iterating global reduction 4 with 1 rules applied. Total rules applied 64 place count 128 transition count 194
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 67 place count 128 transition count 191
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 69 place count 126 transition count 176
Iterating global reduction 5 with 2 rules applied. Total rules applied 71 place count 126 transition count 176
Applied a total of 71 rules in 19 ms. Remains 126 /154 variables (removed 28) and now considering 176/258 (removed 82) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 126/154 places, 176/258 transitions.
// Phase 1: matrix 176 rows 126 cols
[2024-05-21 21:22:14] [INFO ] Computed 2 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[7]
RANDOM walk for 1000000 steps (229660 resets) in 1056 ms. (946 steps per ms)
BEST_FIRST walk for 1000000 steps (95359 resets) in 493 ms. (2024 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[7]
[2024-05-21 21:22:16] [INFO ] Invariant cache hit.
[2024-05-21 21:22:16] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 21:22:16] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2024-05-21 21:22:16] [INFO ] State equation strengthened by 55 read => feed constraints.
[2024-05-21 21:22:16] [INFO ] [Real]Added 55 Read/Feed constraints in 8 ms returned sat
[2024-05-21 21:22:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:22:16] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 21:22:16] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2024-05-21 21:22:16] [INFO ] [Nat]Added 55 Read/Feed constraints in 11 ms returned sat
[2024-05-21 21:22:16] [INFO ] Computed and/alt/rep : 50/117/50 causal constraints (skipped 125 transitions) in 11 ms.
[2024-05-21 21:22:16] [INFO ] Added : 16 causal constraints over 4 iterations in 70 ms. Result :sat
Minimization took 68 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[7]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[7]
Support contains 1 out of 126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 176/176 transitions.
Applied a total of 0 rules in 4 ms. Remains 126 /126 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 126/126 places, 176/176 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 176/176 transitions.
Applied a total of 0 rules in 3 ms. Remains 126 /126 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2024-05-21 21:22:16] [INFO ] Invariant cache hit.
[2024-05-21 21:22:16] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-05-21 21:22:16] [INFO ] Invariant cache hit.
[2024-05-21 21:22:16] [INFO ] State equation strengthened by 55 read => feed constraints.
[2024-05-21 21:22:16] [INFO ] Implicit Places using invariants and state equation in 265 ms returned []
Implicit Place search using SMT with State Equation took 336 ms to find 0 implicit places.
[2024-05-21 21:22:16] [INFO ] Redundant transitions in 1 ms returned []
Running 175 sub problems to find dead transitions.
[2024-05-21 21:22:16] [INFO ] Invariant cache hit.
[2024-05-21 21:22:16] [INFO ] State equation strengthened by 55 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 1/126 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (OVERLAPS) 176/302 variables, 126/128 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/302 variables, 55/183 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/302 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (OVERLAPS) 0/302 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Real declared 302/302 variables, and 183 constraints, problems are : Problem set: 0 solved, 175 unsolved in 4421 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 126/126 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 175 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 1/126 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (OVERLAPS) 176/302 variables, 126/128 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/302 variables, 55/183 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/302 variables, 175/358 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/302 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (OVERLAPS) 0/302 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Int declared 302/302 variables, and 358 constraints, problems are : Problem set: 0 solved, 175 unsolved in 10217 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 126/126 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 0/0 constraints]
After SMT, in 14839ms problems are : Problem set: 0 solved, 175 unsolved
Search for dead transitions found 0 dead transitions in 14840ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15194 ms. Remains : 126/126 places, 176/176 transitions.
[2024-05-21 21:22:31] [INFO ] Flatten gal took : 12 ms
[2024-05-21 21:22:31] [INFO ] Flatten gal took : 9 ms
[2024-05-21 21:22:31] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2756072765926223394.gal : 3 ms
[2024-05-21 21:22:31] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13205601376749022623.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2756072765926223394.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13205601376749022623.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality13205601376749022623.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :7 after 30
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :30 after 68
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :68 after 106
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :106 after 142
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :142 after 212
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :212 after 348
RANDOM walk for 40000 steps (9204 resets) in 185 ms. (215 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (3812 resets) in 48 ms. (816 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (3742 resets) in 65 ms. (606 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :348 after 1202
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1202 after 2651
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :2651 after 9506
Invariant property MIN0 does not hold.
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :9506 after 41016
Probably explored full state space saw : 189798 states, properties seen :1
Probabilistic random walk after 458920 steps, saw 189798 distinct states, run finished after 699 ms. (steps per millisecond=656 ) properties seen :1
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :41016 after 54791
Explored full state space saw : 190198 states, properties seen :0
Exhaustive walk after 459670 steps, saw 190198 distinct states, run finished after 480 ms. (steps per millisecond=957 ) properties seen :0
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:[0] Max Struct:[7]
Ending property specific reduction for DBSingleClientW-PT-d2m05-UpperBounds-05 in 19097 ms.
Starting property specific reduction for DBSingleClientW-PT-d2m05-UpperBounds-09
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[5]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[5]
// Phase 1: matrix 258 rows 154 cols
[2024-05-21 21:22:33] [INFO ] Computed 2 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[5]
RANDOM walk for 10000 steps (2291 resets) in 18 ms. (526 steps per ms)
BEST_FIRST walk for 10001 steps (971 resets) in 8 ms. (1111 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[5]
[2024-05-21 21:22:33] [INFO ] Invariant cache hit.
[2024-05-21 21:22:33] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 21:22:33] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2024-05-21 21:22:33] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-21 21:22:33] [INFO ] [Real]Added 111 Read/Feed constraints in 18 ms returned sat
[2024-05-21 21:22:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:22:33] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 21:22:33] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2024-05-21 21:22:33] [INFO ] [Nat]Added 111 Read/Feed constraints in 18 ms returned sat
[2024-05-21 21:22:33] [INFO ] Computed and/alt/rep : 58/161/58 causal constraints (skipped 199 transitions) in 19 ms.
[2024-05-21 21:22:33] [INFO ] Added : 10 causal constraints over 4 iterations in 99 ms. Result :sat
Minimization took 179 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[5]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[5]
Support contains 1 out of 154 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 154/154 places, 258/258 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 146 transition count 249
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 146 transition count 249
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 20 place count 146 transition count 245
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 26 place count 140 transition count 238
Iterating global reduction 1 with 6 rules applied. Total rules applied 32 place count 140 transition count 238
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 34 place count 140 transition count 236
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 37 place count 137 transition count 230
Iterating global reduction 2 with 3 rules applied. Total rules applied 40 place count 137 transition count 230
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 45 place count 137 transition count 225
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 49 place count 133 transition count 204
Iterating global reduction 3 with 4 rules applied. Total rules applied 53 place count 133 transition count 204
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 54 place count 132 transition count 203
Iterating global reduction 3 with 1 rules applied. Total rules applied 55 place count 132 transition count 203
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 56 place count 131 transition count 202
Iterating global reduction 3 with 1 rules applied. Total rules applied 57 place count 131 transition count 202
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 60 place count 131 transition count 199
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 63 place count 128 transition count 179
Iterating global reduction 4 with 3 rules applied. Total rules applied 66 place count 128 transition count 179
Applied a total of 66 rules in 31 ms. Remains 128 /154 variables (removed 26) and now considering 179/258 (removed 79) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 128/154 places, 179/258 transitions.
// Phase 1: matrix 179 rows 128 cols
[2024-05-21 21:22:33] [INFO ] Computed 2 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[5]
RANDOM walk for 1000000 steps (229863 resets) in 1067 ms. (936 steps per ms)
BEST_FIRST walk for 1000001 steps (95904 resets) in 493 ms. (2024 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[5]
[2024-05-21 21:22:35] [INFO ] Invariant cache hit.
[2024-05-21 21:22:35] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 21:22:35] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2024-05-21 21:22:35] [INFO ] State equation strengthened by 54 read => feed constraints.
[2024-05-21 21:22:35] [INFO ] [Real]Added 54 Read/Feed constraints in 8 ms returned sat
[2024-05-21 21:22:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:22:35] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 21:22:35] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2024-05-21 21:22:35] [INFO ] [Nat]Added 54 Read/Feed constraints in 9 ms returned sat
[2024-05-21 21:22:35] [INFO ] Computed and/alt/rep : 51/127/51 causal constraints (skipped 127 transitions) in 10 ms.
[2024-05-21 21:22:35] [INFO ] Added : 6 causal constraints over 2 iterations in 40 ms. Result :sat
Minimization took 65 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[5]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[5]
Support contains 1 out of 128 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 128/128 places, 179/179 transitions.
Applied a total of 0 rules in 3 ms. Remains 128 /128 variables (removed 0) and now considering 179/179 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 128/128 places, 179/179 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 128/128 places, 179/179 transitions.
Applied a total of 0 rules in 3 ms. Remains 128 /128 variables (removed 0) and now considering 179/179 (removed 0) transitions.
[2024-05-21 21:22:35] [INFO ] Invariant cache hit.
[2024-05-21 21:22:35] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-05-21 21:22:35] [INFO ] Invariant cache hit.
[2024-05-21 21:22:35] [INFO ] State equation strengthened by 54 read => feed constraints.
[2024-05-21 21:22:35] [INFO ] Implicit Places using invariants and state equation in 245 ms returned []
Implicit Place search using SMT with State Equation took 317 ms to find 0 implicit places.
[2024-05-21 21:22:35] [INFO ] Redundant transitions in 1 ms returned []
Running 178 sub problems to find dead transitions.
[2024-05-21 21:22:35] [INFO ] Invariant cache hit.
[2024-05-21 21:22:35] [INFO ] State equation strengthened by 54 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 2 (OVERLAPS) 1/128 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 4 (OVERLAPS) 179/307 variables, 128/130 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/307 variables, 54/184 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/307 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 7 (OVERLAPS) 0/307 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 178 unsolved
No progress, stopping.
After SMT solving in domain Real declared 307/307 variables, and 184 constraints, problems are : Problem set: 0 solved, 178 unsolved in 4578 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 128/128 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 178/178 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 178 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 2 (OVERLAPS) 1/128 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 4 (OVERLAPS) 179/307 variables, 128/130 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/307 variables, 54/184 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/307 variables, 178/362 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/307 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 8 (OVERLAPS) 0/307 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 178 unsolved
No progress, stopping.
After SMT solving in domain Int declared 307/307 variables, and 362 constraints, problems are : Problem set: 0 solved, 178 unsolved in 10471 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 128/128 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 178/178 constraints, Known Traps: 0/0 constraints]
After SMT, in 15277ms problems are : Problem set: 0 solved, 178 unsolved
Search for dead transitions found 0 dead transitions in 15279ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15609 ms. Remains : 128/128 places, 179/179 transitions.
[2024-05-21 21:22:51] [INFO ] Flatten gal took : 9 ms
[2024-05-21 21:22:51] [INFO ] Flatten gal took : 9 ms
[2024-05-21 21:22:51] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7959429573341322942.gal : 2 ms
[2024-05-21 21:22:51] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10414063184847854794.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality7959429573341322942.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10414063184847854794.prop' '--nowitness' '--gen-order' 'FOLLOW'
RANDOM walk for 40000 steps (9125 resets) in 108 ms. (366 steps per ms) remains 2/2 properties

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality10414063184847854794.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :7 after 30
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :30 after 68
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :68 after 106
BEST_FIRST walk for 40001 steps (3675 resets) in 55 ms. (714 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :106 after 142
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :142 after 212
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :212 after 348
BEST_FIRST walk for 40003 steps (3763 resets) in 59 ms. (666 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :348 after 1114
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1114 after 1821
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1821 after 6535
Invariant property MIN0 does not hold.
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :6535 after 41158
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :41158 after 52339
Probably explored full state space saw : 242402 states, properties seen :1
Probabilistic random walk after 594682 steps, saw 242402 distinct states, run finished after 943 ms. (steps per millisecond=630 ) properties seen :1
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :52339 after 74901
Explored full state space saw : 242724 states, properties seen :0
Exhaustive walk after 595398 steps, saw 242724 distinct states, run finished after 636 ms. (steps per millisecond=936 ) properties seen :0
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:[0] Max Struct:[5]
Ending property specific reduction for DBSingleClientW-PT-d2m05-UpperBounds-09 in 19828 ms.
Starting property specific reduction for DBSingleClientW-PT-d2m05-UpperBounds-10
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[7]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[7]
// Phase 1: matrix 258 rows 154 cols
[2024-05-21 21:22:52] [INFO ] Computed 2 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[7]
RANDOM walk for 10000 steps (2285 resets) in 20 ms. (476 steps per ms)
BEST_FIRST walk for 10001 steps (942 resets) in 8 ms. (1111 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[7]
[2024-05-21 21:22:53] [INFO ] Invariant cache hit.
[2024-05-21 21:22:53] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 21:22:53] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2024-05-21 21:22:53] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-21 21:22:53] [INFO ] [Real]Added 111 Read/Feed constraints in 24 ms returned sat
[2024-05-21 21:22:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:22:53] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 21:22:53] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2024-05-21 21:22:53] [INFO ] [Nat]Added 111 Read/Feed constraints in 36 ms returned sat
[2024-05-21 21:22:53] [INFO ] Computed and/alt/rep : 58/161/58 causal constraints (skipped 199 transitions) in 15 ms.
[2024-05-21 21:22:53] [INFO ] Added : 15 causal constraints over 3 iterations in 98 ms. Result :sat
Minimization took 182 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[7]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[7]
Support contains 1 out of 154 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 154/154 places, 258/258 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 146 transition count 246
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 146 transition count 246
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 20 place count 146 transition count 242
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 26 place count 140 transition count 235
Iterating global reduction 1 with 6 rules applied. Total rules applied 32 place count 140 transition count 235
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 33 place count 140 transition count 234
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 37 place count 136 transition count 226
Iterating global reduction 2 with 4 rules applied. Total rules applied 41 place count 136 transition count 226
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 46 place count 136 transition count 221
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 50 place count 132 transition count 207
Iterating global reduction 3 with 4 rules applied. Total rules applied 54 place count 132 transition count 207
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 56 place count 130 transition count 205
Iterating global reduction 3 with 2 rules applied. Total rules applied 58 place count 130 transition count 205
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 60 place count 130 transition count 203
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 61 place count 129 transition count 202
Iterating global reduction 4 with 1 rules applied. Total rules applied 62 place count 129 transition count 202
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 65 place count 129 transition count 199
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 68 place count 126 transition count 179
Iterating global reduction 5 with 3 rules applied. Total rules applied 71 place count 126 transition count 179
Applied a total of 71 rules in 17 ms. Remains 126 /154 variables (removed 28) and now considering 179/258 (removed 79) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 126/154 places, 179/258 transitions.
// Phase 1: matrix 179 rows 126 cols
[2024-05-21 21:22:53] [INFO ] Computed 2 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[7]
RANDOM walk for 1000000 steps (230230 resets) in 1068 ms. (935 steps per ms)
BEST_FIRST walk for 1000001 steps (95781 resets) in 500 ms. (1996 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[7]
[2024-05-21 21:22:55] [INFO ] Invariant cache hit.
[2024-05-21 21:22:55] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 21:22:55] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2024-05-21 21:22:55] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-21 21:22:55] [INFO ] [Real]Added 58 Read/Feed constraints in 9 ms returned sat
[2024-05-21 21:22:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:22:55] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 21:22:55] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2024-05-21 21:22:55] [INFO ] [Nat]Added 58 Read/Feed constraints in 13 ms returned sat
[2024-05-21 21:22:55] [INFO ] Computed and/alt/rep : 50/117/50 causal constraints (skipped 128 transitions) in 13 ms.
[2024-05-21 21:22:55] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 1 ms to minimize.
[2024-05-21 21:22:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 92 ms
[2024-05-21 21:22:55] [INFO ] Added : 16 causal constraints over 4 iterations in 176 ms. Result :sat
Minimization took 76 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[7]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[7]
Support contains 1 out of 126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 179/179 transitions.
Applied a total of 0 rules in 3 ms. Remains 126 /126 variables (removed 0) and now considering 179/179 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 126/126 places, 179/179 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 179/179 transitions.
Applied a total of 0 rules in 3 ms. Remains 126 /126 variables (removed 0) and now considering 179/179 (removed 0) transitions.
[2024-05-21 21:22:55] [INFO ] Invariant cache hit.
[2024-05-21 21:22:55] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-21 21:22:55] [INFO ] Invariant cache hit.
[2024-05-21 21:22:55] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-21 21:22:56] [INFO ] Implicit Places using invariants and state equation in 264 ms returned []
Implicit Place search using SMT with State Equation took 343 ms to find 0 implicit places.
[2024-05-21 21:22:56] [INFO ] Redundant transitions in 1 ms returned []
Running 178 sub problems to find dead transitions.
[2024-05-21 21:22:56] [INFO ] Invariant cache hit.
[2024-05-21 21:22:56] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 2 (OVERLAPS) 1/126 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 4 (OVERLAPS) 179/305 variables, 126/128 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/305 variables, 58/186 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/305 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 7 (OVERLAPS) 0/305 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 178 unsolved
No progress, stopping.
After SMT solving in domain Real declared 305/305 variables, and 186 constraints, problems are : Problem set: 0 solved, 178 unsolved in 5856 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 126/126 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 178/178 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 178 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 2 (OVERLAPS) 1/126 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 4 (OVERLAPS) 179/305 variables, 126/128 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/305 variables, 58/186 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/305 variables, 178/364 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/305 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 8 (OVERLAPS) 0/305 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 178 unsolved
No progress, stopping.
After SMT solving in domain Int declared 305/305 variables, and 364 constraints, problems are : Problem set: 0 solved, 178 unsolved in 12866 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 126/126 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 178/178 constraints, Known Traps: 0/0 constraints]
After SMT, in 18955ms problems are : Problem set: 0 solved, 178 unsolved
Search for dead transitions found 0 dead transitions in 18958ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19310 ms. Remains : 126/126 places, 179/179 transitions.
[2024-05-21 21:23:15] [INFO ] Flatten gal took : 15 ms
[2024-05-21 21:23:15] [INFO ] Flatten gal took : 8 ms
[2024-05-21 21:23:15] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8912912578193269761.gal : 1 ms
[2024-05-21 21:23:15] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14561588144634444036.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality8912912578193269761.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14561588144634444036.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality14561588144634444036.prop.
RANDOM walk for 40000 steps (9244 resets) in 144 ms. (275 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :7 after 30
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :30 after 68
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :68 after 106
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :106 after 182
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :182 after 282
BEST_FIRST walk for 40002 steps (3889 resets) in 61 ms. (645 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :282 after 548
BEST_FIRST walk for 40002 steps (3681 resets) in 54 ms. (727 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :548 after 1474
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1474 after 4952
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :4952 after 30552
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :30552 after 43143
Probably explored full state space saw : 194472 states, properties seen :1
Probabilistic random walk after 474516 steps, saw 194472 distinct states, run finished after 689 ms. (steps per millisecond=688 ) properties seen :1
Explored full state space saw : 194970 states, properties seen :0
Exhaustive walk after 475450 steps, saw 194970 distinct states, run finished after 478 ms. (steps per millisecond=994 ) properties seen :0
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:[0] Max Struct:[7]
Ending property specific reduction for DBSingleClientW-PT-d2m05-UpperBounds-10 in 23336 ms.
Starting property specific reduction for DBSingleClientW-PT-d2m05-UpperBounds-13
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[5]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[5]
// Phase 1: matrix 258 rows 154 cols
[2024-05-21 21:23:16] [INFO ] Computed 2 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[5]
RANDOM walk for 10000 steps (2306 resets) in 20 ms. (476 steps per ms)
BEST_FIRST walk for 10000 steps (912 resets) in 8 ms. (1111 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[5]
[2024-05-21 21:23:16] [INFO ] Invariant cache hit.
[2024-05-21 21:23:16] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 21:23:16] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2024-05-21 21:23:16] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-21 21:23:16] [INFO ] [Real]Added 111 Read/Feed constraints in 19 ms returned sat
[2024-05-21 21:23:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:23:16] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 21:23:16] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2024-05-21 21:23:16] [INFO ] [Nat]Added 111 Read/Feed constraints in 22 ms returned sat
[2024-05-21 21:23:16] [INFO ] Computed and/alt/rep : 58/161/58 causal constraints (skipped 199 transitions) in 20 ms.
[2024-05-21 21:23:16] [INFO ] Added : 15 causal constraints over 4 iterations in 103 ms. Result :sat
Minimization took 186 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[5]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[5]
Support contains 1 out of 154 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 154/154 places, 258/258 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 146 transition count 246
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 146 transition count 246
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 20 place count 146 transition count 242
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 25 place count 141 transition count 236
Iterating global reduction 1 with 5 rules applied. Total rules applied 30 place count 141 transition count 236
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 32 place count 141 transition count 234
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 35 place count 138 transition count 230
Iterating global reduction 2 with 3 rules applied. Total rules applied 38 place count 138 transition count 230
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 43 place count 138 transition count 225
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 47 place count 134 transition count 204
Iterating global reduction 3 with 4 rules applied. Total rules applied 51 place count 134 transition count 204
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 52 place count 133 transition count 203
Iterating global reduction 3 with 1 rules applied. Total rules applied 53 place count 133 transition count 203
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 55 place count 133 transition count 201
Applied a total of 55 rules in 28 ms. Remains 133 /154 variables (removed 21) and now considering 201/258 (removed 57) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 133/154 places, 201/258 transitions.
// Phase 1: matrix 201 rows 133 cols
[2024-05-21 21:23:17] [INFO ] Computed 2 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[5]
RANDOM walk for 1000000 steps (229735 resets) in 1310 ms. (762 steps per ms)
BEST_FIRST walk for 1000001 steps (96030 resets) in 568 ms. (1757 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[5]
[2024-05-21 21:23:18] [INFO ] Invariant cache hit.
[2024-05-21 21:23:18] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 21:23:18] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2024-05-21 21:23:18] [INFO ] State equation strengthened by 74 read => feed constraints.
[2024-05-21 21:23:18] [INFO ] [Real]Added 74 Read/Feed constraints in 14 ms returned sat
[2024-05-21 21:23:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:23:19] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 21:23:19] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2024-05-21 21:23:19] [INFO ] [Nat]Added 74 Read/Feed constraints in 17 ms returned sat
[2024-05-21 21:23:19] [INFO ] Computed and/alt/rep : 52/123/52 causal constraints (skipped 148 transitions) in 14 ms.
[2024-05-21 21:23:19] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 1 ms to minimize.
[2024-05-21 21:23:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 78 ms
[2024-05-21 21:23:19] [INFO ] Added : 12 causal constraints over 4 iterations in 153 ms. Result :sat
Minimization took 129 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[5]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[5]
Support contains 1 out of 133 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 201/201 transitions.
Applied a total of 0 rules in 17 ms. Remains 133 /133 variables (removed 0) and now considering 201/201 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 133/133 places, 201/201 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 201/201 transitions.
Applied a total of 0 rules in 6 ms. Remains 133 /133 variables (removed 0) and now considering 201/201 (removed 0) transitions.
[2024-05-21 21:23:19] [INFO ] Invariant cache hit.
[2024-05-21 21:23:19] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-21 21:23:19] [INFO ] Invariant cache hit.
[2024-05-21 21:23:19] [INFO ] State equation strengthened by 74 read => feed constraints.
[2024-05-21 21:23:19] [INFO ] Implicit Places using invariants and state equation in 372 ms returned []
Implicit Place search using SMT with State Equation took 442 ms to find 0 implicit places.
[2024-05-21 21:23:19] [INFO ] Redundant transitions in 1 ms returned []
Running 200 sub problems to find dead transitions.
[2024-05-21 21:23:19] [INFO ] Invariant cache hit.
[2024-05-21 21:23:19] [INFO ] State equation strengthened by 74 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 1/133 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (OVERLAPS) 201/334 variables, 133/135 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/334 variables, 74/209 constraints. Problems are: Problem set: 0 solved, 200 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/334 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 7 (OVERLAPS) 0/334 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Real declared 334/334 variables, and 209 constraints, problems are : Problem set: 0 solved, 200 unsolved in 5650 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 133/133 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 1/133 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (OVERLAPS) 201/334 variables, 133/135 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/334 variables, 74/209 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/334 variables, 200/409 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/334 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 8 (OVERLAPS) 0/334 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Int declared 334/334 variables, and 409 constraints, problems are : Problem set: 0 solved, 200 unsolved in 13572 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 133/133 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints]
After SMT, in 19473ms problems are : Problem set: 0 solved, 200 unsolved
Search for dead transitions found 0 dead transitions in 19476ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19930 ms. Remains : 133/133 places, 201/201 transitions.
[2024-05-21 21:23:39] [INFO ] Flatten gal took : 12 ms
[2024-05-21 21:23:39] [INFO ] Flatten gal took : 8 ms
[2024-05-21 21:23:39] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12531920402380055239.gal : 2 ms
[2024-05-21 21:23:39] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13423274384758543346.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12531920402380055239.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13423274384758543346.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality13423274384758543346.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :7 after 30
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :30 after 68
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :68 after 106
RANDOM walk for 40000 steps (9237 resets) in 189 ms. (210 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :106 after 182
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :182 after 282
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :282 after 560
BEST_FIRST walk for 40002 steps (3825 resets) in 74 ms. (533 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (3753 resets) in 54 ms. (727 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :560 after 1576
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1576 after 6353
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :6353 after 22804
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :22804 after 44970
Probably explored full state space saw : 222751 states, properties seen :1
Probabilistic random walk after 556807 steps, saw 222751 distinct states, run finished after 839 ms. (steps per millisecond=663 ) properties seen :1
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :44970 after 81788
Explored full state space saw : 224184 states, properties seen :0
Exhaustive walk after 559488 steps, saw 224184 distinct states, run finished after 560 ms. (steps per millisecond=999 ) properties seen :0
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:[0] Max Struct:[5]
Ending property specific reduction for DBSingleClientW-PT-d2m05-UpperBounds-13 in 24615 ms.
Starting property specific reduction for DBSingleClientW-PT-d2m05-UpperBounds-14
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[5]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[5]
// Phase 1: matrix 258 rows 154 cols
[2024-05-21 21:23:40] [INFO ] Computed 2 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[5]
RANDOM walk for 10000 steps (2280 resets) in 20 ms. (476 steps per ms)
BEST_FIRST walk for 10001 steps (897 resets) in 8 ms. (1111 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[5]
[2024-05-21 21:23:40] [INFO ] Invariant cache hit.
[2024-05-21 21:23:40] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 21:23:41] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2024-05-21 21:23:41] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-21 21:23:41] [INFO ] [Real]Added 111 Read/Feed constraints in 18 ms returned sat
[2024-05-21 21:23:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:23:41] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 21:23:41] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2024-05-21 21:23:41] [INFO ] [Nat]Added 111 Read/Feed constraints in 20 ms returned sat
[2024-05-21 21:23:41] [INFO ] Computed and/alt/rep : 58/161/58 causal constraints (skipped 199 transitions) in 16 ms.
[2024-05-21 21:23:41] [INFO ] Added : 11 causal constraints over 3 iterations in 93 ms. Result :sat
Minimization took 207 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[5]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[5]
Support contains 1 out of 154 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 154/154 places, 258/258 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 146 transition count 246
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 146 transition count 246
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 20 place count 146 transition count 242
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 26 place count 140 transition count 235
Iterating global reduction 1 with 6 rules applied. Total rules applied 32 place count 140 transition count 235
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 34 place count 140 transition count 233
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 37 place count 137 transition count 226
Iterating global reduction 2 with 3 rules applied. Total rules applied 40 place count 137 transition count 226
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 42 place count 137 transition count 224
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 44 place count 135 transition count 222
Iterating global reduction 3 with 2 rules applied. Total rules applied 46 place count 135 transition count 222
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 48 place count 133 transition count 220
Iterating global reduction 3 with 2 rules applied. Total rules applied 50 place count 133 transition count 220
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 52 place count 133 transition count 218
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 53 place count 132 transition count 217
Iterating global reduction 4 with 1 rules applied. Total rules applied 54 place count 132 transition count 217
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 57 place count 132 transition count 214
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 60 place count 129 transition count 194
Iterating global reduction 5 with 3 rules applied. Total rules applied 63 place count 129 transition count 194
Applied a total of 63 rules in 18 ms. Remains 129 /154 variables (removed 25) and now considering 194/258 (removed 64) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 129/154 places, 194/258 transitions.
// Phase 1: matrix 194 rows 129 cols
[2024-05-21 21:23:41] [INFO ] Computed 2 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[5]
RANDOM walk for 1000000 steps (229753 resets) in 1179 ms. (847 steps per ms)
BEST_FIRST walk for 1000001 steps (95570 resets) in 538 ms. (1855 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[5]
[2024-05-21 21:23:43] [INFO ] Invariant cache hit.
[2024-05-21 21:23:43] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 21:23:43] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2024-05-21 21:23:43] [INFO ] State equation strengthened by 73 read => feed constraints.
[2024-05-21 21:23:43] [INFO ] [Real]Added 73 Read/Feed constraints in 12 ms returned sat
[2024-05-21 21:23:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:23:43] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 21:23:43] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2024-05-21 21:23:43] [INFO ] [Nat]Added 73 Read/Feed constraints in 15 ms returned sat
[2024-05-21 21:23:43] [INFO ] Computed and/alt/rep : 50/117/50 causal constraints (skipped 143 transitions) in 13 ms.
[2024-05-21 21:23:43] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 1 ms to minimize.
[2024-05-21 21:23:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 77 ms
[2024-05-21 21:23:43] [INFO ] Added : 10 causal constraints over 2 iterations in 134 ms. Result :sat
Minimization took 107 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[5]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[5]
Support contains 1 out of 129 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 129/129 places, 194/194 transitions.
Applied a total of 0 rules in 3 ms. Remains 129 /129 variables (removed 0) and now considering 194/194 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 129/129 places, 194/194 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 129/129 places, 194/194 transitions.
Applied a total of 0 rules in 3 ms. Remains 129 /129 variables (removed 0) and now considering 194/194 (removed 0) transitions.
[2024-05-21 21:23:43] [INFO ] Invariant cache hit.
[2024-05-21 21:23:43] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-05-21 21:23:43] [INFO ] Invariant cache hit.
[2024-05-21 21:23:43] [INFO ] State equation strengthened by 73 read => feed constraints.
[2024-05-21 21:23:44] [INFO ] Implicit Places using invariants and state equation in 318 ms returned []
Implicit Place search using SMT with State Equation took 399 ms to find 0 implicit places.
[2024-05-21 21:23:44] [INFO ] Redundant transitions in 1 ms returned []
Running 193 sub problems to find dead transitions.
[2024-05-21 21:23:44] [INFO ] Invariant cache hit.
[2024-05-21 21:23:44] [INFO ] State equation strengthened by 73 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/128 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 2 (OVERLAPS) 1/129 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 4 (OVERLAPS) 194/323 variables, 129/131 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/323 variables, 73/204 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/323 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 7 (OVERLAPS) 0/323 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 193 unsolved
No progress, stopping.
After SMT solving in domain Real declared 323/323 variables, and 204 constraints, problems are : Problem set: 0 solved, 193 unsolved in 5276 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 129/129 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 193/193 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 193 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/128 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 2 (OVERLAPS) 1/129 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 4 (OVERLAPS) 194/323 variables, 129/131 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/323 variables, 73/204 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/323 variables, 193/397 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/323 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 8 (OVERLAPS) 0/323 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 193 unsolved
No progress, stopping.
After SMT solving in domain Int declared 323/323 variables, and 397 constraints, problems are : Problem set: 0 solved, 193 unsolved in 12958 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 129/129 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 193/193 constraints, Known Traps: 0/0 constraints]
After SMT, in 18468ms problems are : Problem set: 0 solved, 193 unsolved
Search for dead transitions found 0 dead transitions in 18471ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18881 ms. Remains : 129/129 places, 194/194 transitions.
RANDOM walk for 40000 steps (9186 resets) in 92 ms. (430 steps per ms) remains 2/2 properties
[2024-05-21 21:24:02] [INFO ] Flatten gal took : 36 ms
[2024-05-21 21:24:02] [INFO ] Flatten gal took : 8 ms
[2024-05-21 21:24:02] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4353128629871558495.gal : 7 ms
[2024-05-21 21:24:02] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16265252439158789170.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality4353128629871558495.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16265252439158789170.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
BEST_FIRST walk for 40003 steps (3898 resets) in 89 ms. (444 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality16265252439158789170.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 7
BEST_FIRST walk for 40001 steps (3740 resets) in 51 ms. (769 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :7 after 30
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :30 after 68
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :68 after 106
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :106 after 182
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :182 after 316
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :316 after 694
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :694 after 3106
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :3106 after 13021
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :13021 after 32854
Probably explored full state space saw : 205416 states, properties seen :1
Probabilistic random walk after 510014 steps, saw 205416 distinct states, run finished after 681 ms. (steps per millisecond=748 ) properties seen :1
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :32854 after 54316
Explored full state space saw : 207012 states, properties seen :0
Exhaustive walk after 512925 steps, saw 207012 distinct states, run finished after 488 ms. (steps per millisecond=1051 ) properties seen :0
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:[0] Max Struct:[5]
Ending property specific reduction for DBSingleClientW-PT-d2m05-UpperBounds-14 in 23036 ms.
Starting property specific reduction for DBSingleClientW-PT-d2m05-UpperBounds-15
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[7]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[7]
// Phase 1: matrix 258 rows 154 cols
[2024-05-21 21:24:03] [INFO ] Computed 2 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[7]
RANDOM walk for 10000 steps (2322 resets) in 20 ms. (476 steps per ms)
BEST_FIRST walk for 10000 steps (936 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[7]
[2024-05-21 21:24:03] [INFO ] Invariant cache hit.
[2024-05-21 21:24:04] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 21:24:04] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2024-05-21 21:24:04] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-21 21:24:04] [INFO ] [Real]Added 111 Read/Feed constraints in 15 ms returned sat
[2024-05-21 21:24:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:24:04] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 21:24:04] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2024-05-21 21:24:04] [INFO ] [Nat]Added 111 Read/Feed constraints in 25 ms returned sat
[2024-05-21 21:24:04] [INFO ] Computed and/alt/rep : 58/161/58 causal constraints (skipped 199 transitions) in 16 ms.
[2024-05-21 21:24:04] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 1 ms to minimize.
[2024-05-21 21:24:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 122 ms
[2024-05-21 21:24:04] [INFO ] Added : 13 causal constraints over 3 iterations in 227 ms. Result :sat
Minimization took 186 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[7]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[7]
Support contains 1 out of 154 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 154/154 places, 258/258 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 146 transition count 246
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 146 transition count 246
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 19 place count 146 transition count 243
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 25 place count 140 transition count 237
Iterating global reduction 1 with 6 rules applied. Total rules applied 31 place count 140 transition count 237
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 33 place count 140 transition count 235
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 36 place count 137 transition count 228
Iterating global reduction 2 with 3 rules applied. Total rules applied 39 place count 137 transition count 228
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 43 place count 137 transition count 224
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 48 place count 132 transition count 202
Iterating global reduction 3 with 5 rules applied. Total rules applied 53 place count 132 transition count 202
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 55 place count 130 transition count 200
Iterating global reduction 3 with 2 rules applied. Total rules applied 57 place count 130 transition count 200
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 59 place count 130 transition count 198
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 60 place count 129 transition count 197
Iterating global reduction 4 with 1 rules applied. Total rules applied 61 place count 129 transition count 197
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 64 place count 129 transition count 194
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 67 place count 126 transition count 174
Iterating global reduction 5 with 3 rules applied. Total rules applied 70 place count 126 transition count 174
Applied a total of 70 rules in 15 ms. Remains 126 /154 variables (removed 28) and now considering 174/258 (removed 84) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 126/154 places, 174/258 transitions.
// Phase 1: matrix 174 rows 126 cols
[2024-05-21 21:24:04] [INFO ] Computed 2 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[7]
RANDOM walk for 1000000 steps (229660 resets) in 1038 ms. (962 steps per ms)
BEST_FIRST walk for 1000001 steps (96022 resets) in 486 ms. (2053 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[7]
[2024-05-21 21:24:06] [INFO ] Invariant cache hit.
[2024-05-21 21:24:06] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 21:24:06] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2024-05-21 21:24:06] [INFO ] State equation strengthened by 51 read => feed constraints.
[2024-05-21 21:24:06] [INFO ] [Real]Added 51 Read/Feed constraints in 7 ms returned sat
[2024-05-21 21:24:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:24:06] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 21:24:06] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2024-05-21 21:24:06] [INFO ] [Nat]Added 51 Read/Feed constraints in 7 ms returned sat
[2024-05-21 21:24:06] [INFO ] Computed and/alt/rep : 50/124/50 causal constraints (skipped 123 transitions) in 10 ms.
[2024-05-21 21:24:06] [INFO ] Added : 10 causal constraints over 3 iterations in 49 ms. Result :sat
Minimization took 71 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[7]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[7]
Support contains 1 out of 126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 174/174 transitions.
Applied a total of 0 rules in 2 ms. Remains 126 /126 variables (removed 0) and now considering 174/174 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 126/126 places, 174/174 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 174/174 transitions.
Applied a total of 0 rules in 2 ms. Remains 126 /126 variables (removed 0) and now considering 174/174 (removed 0) transitions.
[2024-05-21 21:24:06] [INFO ] Invariant cache hit.
[2024-05-21 21:24:06] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-21 21:24:06] [INFO ] Invariant cache hit.
[2024-05-21 21:24:06] [INFO ] State equation strengthened by 51 read => feed constraints.
[2024-05-21 21:24:06] [INFO ] Implicit Places using invariants and state equation in 229 ms returned []
Implicit Place search using SMT with State Equation took 300 ms to find 0 implicit places.
[2024-05-21 21:24:06] [INFO ] Redundant transitions in 1 ms returned []
Running 173 sub problems to find dead transitions.
[2024-05-21 21:24:06] [INFO ] Invariant cache hit.
[2024-05-21 21:24:06] [INFO ] State equation strengthened by 51 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 2 (OVERLAPS) 1/126 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 4 (OVERLAPS) 174/300 variables, 126/128 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/300 variables, 51/179 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/300 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 7 (OVERLAPS) 0/300 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 173 unsolved
No progress, stopping.
After SMT solving in domain Real declared 300/300 variables, and 179 constraints, problems are : Problem set: 0 solved, 173 unsolved in 4409 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 126/126 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 173/173 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 173 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 2 (OVERLAPS) 1/126 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 4 (OVERLAPS) 174/300 variables, 126/128 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/300 variables, 51/179 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/300 variables, 173/352 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/300 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 8 (OVERLAPS) 0/300 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 173 unsolved
No progress, stopping.
After SMT solving in domain Int declared 300/300 variables, and 352 constraints, problems are : Problem set: 0 solved, 173 unsolved in 11444 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 126/126 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 173/173 constraints, Known Traps: 0/0 constraints]
After SMT, in 16053ms problems are : Problem set: 0 solved, 173 unsolved
Search for dead transitions found 0 dead transitions in 16055ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16362 ms. Remains : 126/126 places, 174/174 transitions.
[2024-05-21 21:24:22] [INFO ] Flatten gal took : 14 ms
[2024-05-21 21:24:22] [INFO ] Flatten gal took : 7 ms
[2024-05-21 21:24:22] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5053015877464479750.gal : 1 ms
[2024-05-21 21:24:22] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17938392327873144684.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/ReachabilityCardinality5053015877464479750.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17938392327873144684.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality17938392327873144684.prop.
RANDOM walk for 40000 steps (9181 resets) in 133 ms. (298 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :7 after 30
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :30 after 68
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :68 after 108
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :108 after 184
BEST_FIRST walk for 40002 steps (3887 resets) in 58 ms. (678 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :184 after 348
BEST_FIRST walk for 40002 steps (3803 resets) in 57 ms. (689 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :348 after 1148
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1148 after 1980
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1980 after 8130
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :8130 after 31750
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :31750 after 44052
Probably explored full state space saw : 195530 states, properties seen :1
Probabilistic random walk after 472686 steps, saw 195530 distinct states, run finished after 619 ms. (steps per millisecond=763 ) properties seen :1
Explored full state space saw : 195814 states, properties seen :0
Exhaustive walk after 473234 steps, saw 195814 distinct states, run finished after 489 ms. (steps per millisecond=967 ) properties seen :0
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:[0] Max Struct:[7]
Ending property specific reduction for DBSingleClientW-PT-d2m05-UpperBounds-15 in 20218 ms.
[2024-05-21 21:24:24] [INFO ] Flatten gal took : 30 ms
[2024-05-21 21:24:24] [INFO ] Applying decomposition
[2024-05-21 21:24:24] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph4925174966499187452.txt' '-o' '/tmp/graph4925174966499187452.bin' '-w' '/tmp/graph4925174966499187452.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4925174966499187452.bin' '-l' '-1' '-v' '-w' '/tmp/graph4925174966499187452.weights' '-q' '0' '-e' '0.001'
[2024-05-21 21:24:24] [INFO ] Decomposing Gal with order
[2024-05-21 21:24:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 21:24:24] [INFO ] Removed a total of 254 redundant transitions.
[2024-05-21 21:24:24] [INFO ] Flatten gal took : 58 ms
[2024-05-21 21:24:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 171 labels/synchronizations in 11 ms.
[2024-05-21 21:24:24] [INFO ] Time to serialize gal into /tmp/UpperBounds12341570746315633391.gal : 6 ms
[2024-05-21 21:24:24] [INFO ] Time to serialize properties into /tmp/UpperBounds13590642592016411024.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/UpperBounds12341570746315633391.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds13590642592016411024.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...285
Loading property file /tmp/UpperBounds13590642592016411024.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,365195,1.99589,75924,1675,2212,61047,56961,606,259377,276,457380,0
Total reachable state count : 365195

Verifying 8 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DBSingleClientW-PT-d2m05-UpperBounds-02 :0 <= i0.u0.l1613 <= 1
FORMULA DBSingleClientW-PT-d2m05-UpperBounds-02 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DBSingleClientW-PT-d2m05-UpperBounds-02,0,2.06165,75924,1,0,61047,56961,751,259377,363,457380,991
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DBSingleClientW-PT-d2m05-UpperBounds-04 :0 <= i2.u6.l1723 <= 1
FORMULA DBSingleClientW-PT-d2m05-UpperBounds-04 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DBSingleClientW-PT-d2m05-UpperBounds-04,0,2.06302,75924,1,0,61047,56961,783,259377,368,457380,1326
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DBSingleClientW-PT-d2m05-UpperBounds-05 :0 <= i5.u15.p260 <= 1
FORMULA DBSingleClientW-PT-d2m05-UpperBounds-05 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DBSingleClientW-PT-d2m05-UpperBounds-05,0,2.06517,75924,1,0,61047,56961,807,259377,380,457380,1400
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DBSingleClientW-PT-d2m05-UpperBounds-09 :0 <= i8.u24.l4116 <= 1
FORMULA DBSingleClientW-PT-d2m05-UpperBounds-09 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DBSingleClientW-PT-d2m05-UpperBounds-09,0,2.06634,75924,1,0,61047,56961,835,259377,389,457380,1476
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DBSingleClientW-PT-d2m05-UpperBounds-10 :0 <= i4.u8.p269 <= 1
FORMULA DBSingleClientW-PT-d2m05-UpperBounds-10 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DBSingleClientW-PT-d2m05-UpperBounds-10,0,2.06658,75924,1,0,61047,56961,855,259377,389,457380,1522
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DBSingleClientW-PT-d2m05-UpperBounds-13 :0 <= i4.u14.l2317 <= 1
FORMULA DBSingleClientW-PT-d2m05-UpperBounds-13 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DBSingleClientW-PT-d2m05-UpperBounds-13,0,2.06728,75924,1,0,61047,56961,878,259377,398,457380,1567
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DBSingleClientW-PT-d2m05-UpperBounds-14 :0 <= i4.u13.l2295 <= 1
FORMULA DBSingleClientW-PT-d2m05-UpperBounds-14 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DBSingleClientW-PT-d2m05-UpperBounds-14,0,2.06815,75924,1,0,61047,56961,902,259377,405,457380,1604
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DBSingleClientW-PT-d2m05-UpperBounds-15 :0 <= i8.u19.p416 <= 1
FORMULA DBSingleClientW-PT-d2m05-UpperBounds-15 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DBSingleClientW-PT-d2m05-UpperBounds-15,0,2.0713,75924,1,0,61047,56961,927,259377,405,457380,1664
Total runtime 286255 ms.

BK_STOP 1716326666611

--------------------
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="DBSingleClientW-PT-d2m05"
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-5568"
echo " Executing tool itstools"
echo " Input is DBSingleClientW-PT-d2m05, 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 r092-tall-171624189500557"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DBSingleClientW-PT-d2m05.tgz
mv DBSingleClientW-PT-d2m05 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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -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 ;