Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r097-smll-174860111800050.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................
=====================================================================
Generated by BenchKit 2-5832
Executing tool gold2024
Input is FireWire-PT-20, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r097-smll-174860111800050
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 616K
-rw-r--r-- 1 mcc users 5.4K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 49K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.9K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 77K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 247K May 29 14:32 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1748678811957

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-20
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-05-31 08:06:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-05-31 08:06:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-31 08:06:55] [INFO ] Load time of PNML (sax parser for PT used): 285 ms
[2025-05-31 08:06:55] [INFO ] Transformed 626 places.
[2025-05-31 08:06:55] [INFO ] Transformed 1031 transitions.
[2025-05-31 08:06:55] [INFO ] Found NUPN structural information;
[2025-05-31 08:06:55] [INFO ] Parsed PT model containing 626 places and 1031 transitions and 3196 arcs in 556 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 19 ms.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 1031 rows 626 cols
[2025-05-31 08:06:55] [INFO ] Computed 13 invariants in 70 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (6 resets) in 94 ms. (105 steps per ms)
FORMULA FireWire-PT-20-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-20-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-20-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-20-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-20-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-20-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 100000 steps (46 resets) in 384 ms. (259 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-31 08:06:56] [INFO ] Invariant cache hit.
[2025-05-31 08:06:56] [INFO ] [Real]Absence check using 13 positive place invariants in 31 ms returned sat
[2025-05-31 08:06:57] [INFO ] [Real]Absence check using state equation in 760 ms returned sat
[2025-05-31 08:06:57] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 08:06:58] [INFO ] [Nat]Absence check using 13 positive place invariants in 30 ms returned sat
[2025-05-31 08:06:58] [INFO ] [Nat]Absence check using state equation in 594 ms returned sat
[2025-05-31 08:06:59] [INFO ] Deduced a trap composed of 70 places in 683 ms of which 90 ms to minimize.
[2025-05-31 08:06:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 847 ms
[2025-05-31 08:06:59] [INFO ] Computed and/alt/rep : 839/2158/839 causal constraints (skipped 191 transitions) in 191 ms.
Maximisation of solution failed !
Minimization took 2 ms.
[2025-05-31 08:07:03] [INFO ] [Real]Absence check using 13 positive place invariants in 32 ms returned sat
[2025-05-31 08:07:03] [INFO ] [Real]Absence check using state equation in 675 ms returned sat
[2025-05-31 08:07:03] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 08:07:03] [INFO ] [Nat]Absence check using 13 positive place invariants in 19 ms returned sat
[2025-05-31 08:07:04] [INFO ] [Nat]Absence check using state equation in 604 ms returned sat
[2025-05-31 08:07:05] [INFO ] Deduced a trap composed of 65 places in 570 ms of which 10 ms to minimize.
[2025-05-31 08:07:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 724 ms
[2025-05-31 08:07:05] [INFO ] Computed and/alt/rep : 839/2158/839 causal constraints (skipped 191 transitions) in 165 ms.
[2025-05-31 08:07:08] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2025-05-31 08:07:09] [INFO ] [Real]Absence check using 13 positive place invariants in 30 ms returned sat
[2025-05-31 08:07:09] [INFO ] [Real]Absence check using state equation in 494 ms returned sat
[2025-05-31 08:07:09] [INFO ] Computed and/alt/rep : 839/2158/839 causal constraints (skipped 191 transitions) in 69 ms.
[2025-05-31 08:07:09] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 08:07:10] [INFO ] [Nat]Absence check using 13 positive place invariants in 22 ms returned sat
[2025-05-31 08:07:10] [INFO ] [Nat]Absence check using state equation in 449 ms returned sat
[2025-05-31 08:07:10] [INFO ] Computed and/alt/rep : 839/2158/839 causal constraints (skipped 191 transitions) in 80 ms.
Maximisation of solution failed !
Minimization took 1 ms.
[2025-05-31 08:07:15] [INFO ] [Real]Absence check using 13 positive place invariants in 29 ms returned sat
[2025-05-31 08:07:15] [INFO ] [Real]Absence check using state equation in 605 ms returned sat
[2025-05-31 08:07:15] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 08:07:16] [INFO ] [Nat]Absence check using 13 positive place invariants in 34 ms returned sat
[2025-05-31 08:07:16] [INFO ] [Nat]Absence check using state equation in 540 ms returned sat
[2025-05-31 08:07:16] [INFO ] Computed and/alt/rep : 839/2158/839 causal constraints (skipped 191 transitions) in 132 ms.
[2025-05-31 08:07:20] [INFO ] Added : 195 causal constraints over 39 iterations in 4139 ms. Result :unknown
[2025-05-31 08:07:21] [INFO ] [Real]Absence check using 13 positive place invariants in 28 ms returned sat
[2025-05-31 08:07:21] [INFO ] [Real]Absence check using state equation in 579 ms returned sat
[2025-05-31 08:07:22] [INFO ] Computed and/alt/rep : 839/2158/839 causal constraints (skipped 191 transitions) in 132 ms.
[2025-05-31 08:07:22] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 08:07:22] [INFO ] [Nat]Absence check using 13 positive place invariants in 30 ms returned sat
[2025-05-31 08:07:23] [INFO ] [Nat]Absence check using state equation in 452 ms returned sat
[2025-05-31 08:07:23] [INFO ] Computed and/alt/rep : 839/2158/839 causal constraints (skipped 191 transitions) in 97 ms.
[2025-05-31 08:07:27] [INFO ] Added : 210 causal constraints over 42 iterations in 4194 ms. Result :unknown
[2025-05-31 08:07:27] [INFO ] [Real]Absence check using 13 positive place invariants in 29 ms returned sat
[2025-05-31 08:07:28] [INFO ] [Real]Absence check using state equation in 534 ms returned sat
[2025-05-31 08:07:28] [INFO ] Computed and/alt/rep : 839/2158/839 causal constraints (skipped 191 transitions) in 109 ms.
[2025-05-31 08:07:28] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 08:07:28] [INFO ] [Nat]Absence check using 13 positive place invariants in 30 ms returned sat
[2025-05-31 08:07:29] [INFO ] [Nat]Absence check using state equation in 656 ms returned sat
[2025-05-31 08:07:29] [INFO ] Computed and/alt/rep : 839/2158/839 causal constraints (skipped 191 transitions) in 121 ms.
0timeout
^^^^^^^^
(error "Invalid token: 0timeout")
Maximisation of solution failed !
Minimization took 0 ms.
[2025-05-31 08:07:33] [INFO ] [Real]Absence check using 13 positive place invariants in 27 ms returned sat
[2025-05-31 08:07:34] [INFO ] [Real]Absence check using state equation in 509 ms returned sat
[2025-05-31 08:07:34] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 08:07:34] [INFO ] [Nat]Absence check using 13 positive place invariants in 19 ms returned sat
[2025-05-31 08:07:35] [INFO ] [Nat]Absence check using state equation in 389 ms returned sat
[2025-05-31 08:07:35] [INFO ] Computed and/alt/rep : 839/2158/839 causal constraints (skipped 191 transitions) in 79 ms.
Maximisation of solution failed !
Minimization took 0 ms.
[2025-05-31 08:07:39] [INFO ] [Real]Absence check using 13 positive place invariants in 28 ms returned sat
[2025-05-31 08:07:40] [INFO ] [Real]Absence check using state equation in 600 ms returned sat
[2025-05-31 08:07:40] [INFO ] Computed and/alt/rep : 839/2158/839 causal constraints (skipped 191 transitions) in 118 ms.
[2025-05-31 08:07:40] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 08:07:41] [INFO ] [Nat]Absence check using 13 positive place invariants in 30 ms returned sat
[2025-05-31 08:07:41] [INFO ] [Nat]Absence check using state equation in 592 ms returned sat
[2025-05-31 08:07:42] [INFO ] Computed and/alt/rep : 839/2158/839 causal constraints (skipped 191 transitions) in 135 ms.
Maximisation of solution failed !
Minimization took 1 ms.
[2025-05-31 08:07:46] [INFO ] [Real]Absence check using 13 positive place invariants in 29 ms returned sat
[2025-05-31 08:07:46] [INFO ] [Real]Absence check using state equation in 632 ms returned sat
[2025-05-31 08:07:47] [INFO ] Deduced a trap composed of 65 places in 515 ms of which 9 ms to minimize.
[2025-05-31 08:07:47] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 08:07:47] [INFO ] [Nat]Absence check using 13 positive place invariants in 30 ms returned sat
[2025-05-31 08:07:48] [INFO ] [Nat]Absence check using state equation in 664 ms returned sat
[2025-05-31 08:07:49] [INFO ] Deduced a trap composed of 65 places in 712 ms of which 9 ms to minimize.
[2025-05-31 08:07:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 843 ms
[2025-05-31 08:07:49] [INFO ] Computed and/alt/rep : 839/2158/839 causal constraints (skipped 191 transitions) in 123 ms.
[2025-05-31 08:07:52] [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 8
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2025-05-31 08:07:52] [INFO ] [Real]Absence check using 13 positive place invariants in 29 ms returned sat
[2025-05-31 08:07:53] [INFO ] [Real]Absence check using state equation in 609 ms returned sat
[2025-05-31 08:07:53] [INFO ] Computed and/alt/rep : 839/2158/839 causal constraints (skipped 191 transitions) in 122 ms.
[2025-05-31 08:07:54] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 08:07:54] [INFO ] [Nat]Absence check using 13 positive place invariants in 30 ms returned sat
[2025-05-31 08:07:54] [INFO ] [Nat]Absence check using state equation in 578 ms returned sat
[2025-05-31 08:07:55] [INFO ] Computed and/alt/rep : 839/2158/839 causal constraints (skipped 191 transitions) in 75 ms.
[2025-05-31 08:07:59] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 9
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Support contains 10 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 1031/1031 transitions.
Graph (trivial) has 444 edges and 626 vertex of which 12 / 626 are part of one of the 3 SCC in 10 ms
Free SCC test removed 9 places
Drop transitions (Empty/Sink Transition effects.) removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Graph (complete) has 1871 edges and 617 vertex of which 602 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.6 ms
Discarding 15 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 118 transitions
Trivial Post-agglo rules discarded 118 transitions
Performed 118 trivial Post agglomeration. Transition count delta: 118
Iterating post reduction 0 with 121 rules applied. Total rules applied 123 place count 602 transition count 897
Reduce places removed 118 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 120 rules applied. Total rules applied 243 place count 484 transition count 895
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 3 rules applied. Total rules applied 246 place count 483 transition count 893
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 248 place count 481 transition count 893
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 16 Pre rules applied. Total rules applied 248 place count 481 transition count 877
Deduced a syphon composed of 16 places in 3 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 280 place count 465 transition count 877
Discarding 83 places :
Symmetric choice reduction at 4 with 83 rule applications. Total rules 363 place count 382 transition count 788
Iterating global reduction 4 with 83 rules applied. Total rules applied 446 place count 382 transition count 788
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 449 place count 382 transition count 785
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 5 Pre rules applied. Total rules applied 449 place count 382 transition count 780
Deduced a syphon composed of 5 places in 3 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 459 place count 377 transition count 780
Discarding 27 places :
Symmetric choice reduction at 5 with 27 rule applications. Total rules 486 place count 350 transition count 659
Iterating global reduction 5 with 27 rules applied. Total rules applied 513 place count 350 transition count 659
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 515 place count 350 transition count 657
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 524 place count 341 transition count 642
Iterating global reduction 6 with 9 rules applied. Total rules applied 533 place count 341 transition count 642
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 6 with 6 rules applied. Total rules applied 539 place count 341 transition count 636
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 542 place count 338 transition count 636
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 545 place count 335 transition count 627
Iterating global reduction 8 with 3 rules applied. Total rules applied 548 place count 335 transition count 627
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 551 place count 332 transition count 621
Iterating global reduction 8 with 3 rules applied. Total rules applied 554 place count 332 transition count 621
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 557 place count 329 transition count 612
Iterating global reduction 8 with 3 rules applied. Total rules applied 560 place count 329 transition count 612
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 563 place count 326 transition count 606
Iterating global reduction 8 with 3 rules applied. Total rules applied 566 place count 326 transition count 606
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 569 place count 323 transition count 597
Iterating global reduction 8 with 3 rules applied. Total rules applied 572 place count 323 transition count 597
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 575 place count 320 transition count 591
Iterating global reduction 8 with 3 rules applied. Total rules applied 578 place count 320 transition count 591
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 581 place count 317 transition count 582
Iterating global reduction 8 with 3 rules applied. Total rules applied 584 place count 317 transition count 582
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 587 place count 314 transition count 576
Iterating global reduction 8 with 3 rules applied. Total rules applied 590 place count 314 transition count 576
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 593 place count 311 transition count 567
Iterating global reduction 8 with 3 rules applied. Total rules applied 596 place count 311 transition count 567
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 599 place count 308 transition count 561
Iterating global reduction 8 with 3 rules applied. Total rules applied 602 place count 308 transition count 561
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 605 place count 305 transition count 555
Iterating global reduction 8 with 3 rules applied. Total rules applied 608 place count 305 transition count 555
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 611 place count 302 transition count 549
Iterating global reduction 8 with 3 rules applied. Total rules applied 614 place count 302 transition count 549
Performed 52 Post agglomeration using F-continuation condition.Transition count delta: 52
Deduced a syphon composed of 52 places in 1 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 8 with 104 rules applied. Total rules applied 718 place count 250 transition count 497
Performed 43 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
Deduced a syphon composed of 43 places in 2 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 8 with 86 rules applied. Total rules applied 804 place count 207 transition count 591
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 807 place count 207 transition count 588
Free-agglomeration rule applied 21 times.
Iterating global reduction 8 with 21 rules applied. Total rules applied 828 place count 207 transition count 567
Reduce places removed 21 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 8 with 29 rules applied. Total rules applied 857 place count 186 transition count 559
Discarding 5 places :
Symmetric choice reduction at 9 with 5 rule applications. Total rules 862 place count 181 transition count 554
Iterating global reduction 9 with 5 rules applied. Total rules applied 867 place count 181 transition count 554
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 9 with 6 rules applied. Total rules applied 873 place count 181 transition count 548
Drop transitions (Redundant composition of simpler transitions.) removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 10 with 26 rules applied. Total rules applied 899 place count 181 transition count 522
Applied a total of 899 rules in 510 ms. Remains 181 /626 variables (removed 445) and now considering 522/1031 (removed 509) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 528 ms. Remains : 181/626 places, 522/1031 transitions.
[2025-05-31 08:08:00] [INFO ] Flow matrix only has 512 transitions (discarded 10 similar events)
// Phase 1: matrix 512 rows 181 cols
[2025-05-31 08:08:00] [INFO ] Computed 10 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (33116 resets) in 2412 ms. (414 steps per ms)
FORMULA FireWire-PT-20-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-20-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-20-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-20-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-20-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-20-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 4000003 steps (25711 resets) in 2609 ms. (1532 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
[2025-05-31 08:08:05] [INFO ] Flow matrix only has 512 transitions (discarded 10 similar events)
[2025-05-31 08:08:05] [INFO ] Invariant cache hit.
[2025-05-31 08:08:05] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2025-05-31 08:08:05] [INFO ] [Real]Absence check using state equation in 137 ms returned sat
[2025-05-31 08:08:06] [INFO ] State equation strengthened by 95 read => feed constraints.
[2025-05-31 08:08:06] [INFO ] [Real]Added 95 Read/Feed constraints in 38 ms returned sat
[2025-05-31 08:08:06] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 08:08:06] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2025-05-31 08:08:06] [INFO ] [Nat]Absence check using state equation in 144 ms returned sat
[2025-05-31 08:08:06] [INFO ] [Nat]Added 95 Read/Feed constraints in 59 ms returned sat
[2025-05-31 08:08:06] [INFO ] Computed and/alt/rep : 159/684/159 causal constraints (skipped 345 transitions) in 41 ms.
[2025-05-31 08:08:07] [INFO ] Deduced a trap composed of 17 places in 249 ms of which 4 ms to minimize.
[2025-05-31 08:08:07] [INFO ] Deduced a trap composed of 37 places in 81 ms of which 2 ms to minimize.
[2025-05-31 08:08:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 448 ms
[2025-05-31 08:08:07] [INFO ] Added : 38 causal constraints over 12 iterations in 1126 ms. Result :sat
Minimization took 678 ms.
[2025-05-31 08:08:08] [INFO ] [Real]Absence check using 10 positive place invariants in 7 ms returned sat
[2025-05-31 08:08:08] [INFO ] [Real]Absence check using state equation in 147 ms returned sat
[2025-05-31 08:08:08] [INFO ] [Real]Added 95 Read/Feed constraints in 41 ms returned sat
[2025-05-31 08:08:08] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 08:08:08] [INFO ] [Nat]Absence check using 10 positive place invariants in 8 ms returned sat
[2025-05-31 08:08:08] [INFO ] [Nat]Absence check using state equation in 214 ms returned sat
[2025-05-31 08:08:08] [INFO ] [Nat]Added 95 Read/Feed constraints in 80 ms returned sat
[2025-05-31 08:08:08] [INFO ] Computed and/alt/rep : 159/684/159 causal constraints (skipped 345 transitions) in 66 ms.
[2025-05-31 08:08:09] [INFO ] Deduced a trap composed of 36 places in 213 ms of which 3 ms to minimize.
[2025-05-31 08:08:09] [INFO ] Deduced a trap composed of 28 places in 263 ms of which 4 ms to minimize.
[2025-05-31 08:08:10] [INFO ] Deduced a trap composed of 25 places in 237 ms of which 3 ms to minimize.
[2025-05-31 08:08:10] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 875 ms
[2025-05-31 08:08:10] [INFO ] Added : 32 causal constraints over 10 iterations in 1482 ms. Result :sat
Minimization took 687 ms.
[2025-05-31 08:08:11] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2025-05-31 08:08:11] [INFO ] [Real]Absence check using state equation in 140 ms returned sat
[2025-05-31 08:08:11] [INFO ] [Real]Added 95 Read/Feed constraints in 42 ms returned sat
[2025-05-31 08:08:11] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 08:08:11] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2025-05-31 08:08:11] [INFO ] [Nat]Absence check using state equation in 181 ms returned sat
[2025-05-31 08:08:11] [INFO ] [Nat]Added 95 Read/Feed constraints in 57 ms returned sat
[2025-05-31 08:08:11] [INFO ] Computed and/alt/rep : 159/684/159 causal constraints (skipped 345 transitions) in 79 ms.
[2025-05-31 08:08:11] [INFO ] Added : 6 causal constraints over 2 iterations in 215 ms. Result :sat
Minimization took 674 ms.
[2025-05-31 08:08:12] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2025-05-31 08:08:12] [INFO ] [Real]Absence check using state equation in 148 ms returned sat
[2025-05-31 08:08:12] [INFO ] [Real]Added 95 Read/Feed constraints in 29 ms returned sat
[2025-05-31 08:08:12] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 08:08:12] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2025-05-31 08:08:12] [INFO ] [Nat]Absence check using state equation in 169 ms returned sat
[2025-05-31 08:08:13] [INFO ] [Nat]Added 95 Read/Feed constraints in 58 ms returned sat
[2025-05-31 08:08:13] [INFO ] Computed and/alt/rep : 159/684/159 causal constraints (skipped 345 transitions) in 79 ms.
[2025-05-31 08:08:13] [INFO ] Deduced a trap composed of 17 places in 243 ms of which 3 ms to minimize.
[2025-05-31 08:08:13] [INFO ] Deduced a trap composed of 36 places in 65 ms of which 1 ms to minimize.
[2025-05-31 08:08:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 420 ms
[2025-05-31 08:08:13] [INFO ] Added : 22 causal constraints over 5 iterations in 843 ms. Result :sat
Minimization took 561 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Support contains 4 out of 181 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 181/181 places, 522/522 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 181 transition count 521
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 180 transition count 521
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 10 place count 176 transition count 517
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 174 transition count 513
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 174 transition count 513
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 17 place count 174 transition count 510
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 19 place count 173 transition count 515
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 20 place count 173 transition count 514
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 22 place count 173 transition count 512
Applied a total of 22 rules in 74 ms. Remains 173 /181 variables (removed 8) and now considering 512/522 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 75 ms. Remains : 173/181 places, 512/522 transitions.
[2025-05-31 08:08:14] [INFO ] Flow matrix only has 501 transitions (discarded 11 similar events)
// Phase 1: matrix 501 rows 173 cols
[2025-05-31 08:08:14] [INFO ] Computed 10 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
RANDOM walk for 1000000 steps (33463 resets) in 2382 ms. (419 steps per ms)
BEST_FIRST walk for 4000004 steps (25955 resets) in 2527 ms. (1582 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
[2025-05-31 08:08:19] [INFO ] Flow matrix only has 501 transitions (discarded 11 similar events)
[2025-05-31 08:08:19] [INFO ] Invariant cache hit.
[2025-05-31 08:08:19] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2025-05-31 08:08:19] [INFO ] [Real]Absence check using state equation in 134 ms returned sat
[2025-05-31 08:08:19] [INFO ] State equation strengthened by 94 read => feed constraints.
[2025-05-31 08:08:19] [INFO ] [Real]Added 94 Read/Feed constraints in 49 ms returned sat
[2025-05-31 08:08:19] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 08:08:20] [INFO ] [Nat]Absence check using 10 positive place invariants in 8 ms returned sat
[2025-05-31 08:08:20] [INFO ] [Nat]Absence check using state equation in 199 ms returned sat
[2025-05-31 08:08:20] [INFO ] [Nat]Added 94 Read/Feed constraints in 75 ms returned sat
[2025-05-31 08:08:20] [INFO ] Computed and/alt/rep : 146/657/146 causal constraints (skipped 347 transitions) in 59 ms.
[2025-05-31 08:08:20] [INFO ] Deduced a trap composed of 28 places in 195 ms of which 3 ms to minimize.
[2025-05-31 08:08:20] [INFO ] Deduced a trap composed of 25 places in 159 ms of which 6 ms to minimize.
[2025-05-31 08:08:21] [INFO ] Deduced a trap composed of 35 places in 48 ms of which 1 ms to minimize.
[2025-05-31 08:08:21] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 535 ms
[2025-05-31 08:08:21] [INFO ] Deduced a trap composed of 35 places in 92 ms of which 2 ms to minimize.
[2025-05-31 08:08:21] [INFO ] Deduced a trap composed of 35 places in 48 ms of which 1 ms to minimize.
[2025-05-31 08:08:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 223 ms
[2025-05-31 08:08:21] [INFO ] Added : 17 causal constraints over 8 iterations in 1220 ms. Result :sat
Minimization took 235 ms.
[2025-05-31 08:08:21] [INFO ] [Real]Absence check using 10 positive place invariants in 7 ms returned sat
[2025-05-31 08:08:22] [INFO ] [Real]Absence check using state equation in 177 ms returned sat
[2025-05-31 08:08:22] [INFO ] [Real]Added 94 Read/Feed constraints in 33 ms returned sat
[2025-05-31 08:08:22] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 08:08:22] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2025-05-31 08:08:22] [INFO ] [Nat]Absence check using state equation in 177 ms returned sat
[2025-05-31 08:08:22] [INFO ] [Nat]Added 94 Read/Feed constraints in 45 ms returned sat
[2025-05-31 08:08:22] [INFO ] Computed and/alt/rep : 146/657/146 causal constraints (skipped 347 transitions) in 75 ms.
[2025-05-31 08:08:22] [INFO ] Deduced a trap composed of 25 places in 167 ms of which 3 ms to minimize.
[2025-05-31 08:08:23] [INFO ] Deduced a trap composed of 35 places in 236 ms of which 3 ms to minimize.
[2025-05-31 08:08:23] [INFO ] Deduced a trap composed of 95 places in 226 ms of which 2 ms to minimize.
[2025-05-31 08:08:23] [INFO ] Deduced a trap composed of 94 places in 176 ms of which 3 ms to minimize.
[2025-05-31 08:08:23] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 971 ms
[2025-05-31 08:08:23] [INFO ] Added : 26 causal constraints over 6 iterations in 1323 ms. Result :sat
Minimization took 213 ms.
[2025-05-31 08:08:24] [INFO ] [Real]Absence check using 10 positive place invariants in 7 ms returned sat
[2025-05-31 08:08:24] [INFO ] [Real]Absence check using state equation in 180 ms returned sat
[2025-05-31 08:08:24] [INFO ] [Real]Added 94 Read/Feed constraints in 51 ms returned sat
[2025-05-31 08:08:24] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 08:08:24] [INFO ] [Nat]Absence check using 10 positive place invariants in 7 ms returned sat
[2025-05-31 08:08:24] [INFO ] [Nat]Absence check using state equation in 170 ms returned sat
[2025-05-31 08:08:24] [INFO ] [Nat]Added 94 Read/Feed constraints in 60 ms returned sat
[2025-05-31 08:08:24] [INFO ] Computed and/alt/rep : 146/657/146 causal constraints (skipped 347 transitions) in 65 ms.
[2025-05-31 08:08:25] [INFO ] Deduced a trap composed of 27 places in 182 ms of which 4 ms to minimize.
[2025-05-31 08:08:25] [INFO ] Deduced a trap composed of 25 places in 253 ms of which 4 ms to minimize.
[2025-05-31 08:08:25] [INFO ] Deduced a trap composed of 35 places in 50 ms of which 1 ms to minimize.
[2025-05-31 08:08:25] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 640 ms
[2025-05-31 08:08:25] [INFO ] Added : 9 causal constraints over 4 iterations in 922 ms. Result :sat
Minimization took 215 ms.
[2025-05-31 08:08:25] [INFO ] [Real]Absence check using 10 positive place invariants in 7 ms returned sat
[2025-05-31 08:08:26] [INFO ] [Real]Absence check using state equation in 204 ms returned sat
[2025-05-31 08:08:26] [INFO ] [Real]Added 94 Read/Feed constraints in 45 ms returned sat
[2025-05-31 08:08:26] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 08:08:26] [INFO ] [Nat]Absence check using 10 positive place invariants in 9 ms returned sat
[2025-05-31 08:08:26] [INFO ] [Nat]Absence check using state equation in 215 ms returned sat
[2025-05-31 08:08:26] [INFO ] [Nat]Added 94 Read/Feed constraints in 104 ms returned sat
[2025-05-31 08:08:26] [INFO ] Computed and/alt/rep : 146/657/146 causal constraints (skipped 347 transitions) in 69 ms.
[2025-05-31 08:08:27] [INFO ] Deduced a trap composed of 35 places in 249 ms of which 3 ms to minimize.
[2025-05-31 08:08:27] [INFO ] Deduced a trap composed of 28 places in 247 ms of which 3 ms to minimize.
[2025-05-31 08:08:27] [INFO ] Deduced a trap composed of 35 places in 228 ms of which 3 ms to minimize.
[2025-05-31 08:08:28] [INFO ] Deduced a trap composed of 25 places in 240 ms of which 3 ms to minimize.
[2025-05-31 08:08:28] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1168 ms
[2025-05-31 08:08:28] [INFO ] Added : 29 causal constraints over 9 iterations in 1755 ms. Result :sat
Minimization took 254 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Support contains 4 out of 173 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 173/173 places, 512/512 transitions.
Applied a total of 0 rules in 18 ms. Remains 173 /173 variables (removed 0) and now considering 512/512 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 173/173 places, 512/512 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 173/173 places, 512/512 transitions.
Applied a total of 0 rules in 16 ms. Remains 173 /173 variables (removed 0) and now considering 512/512 (removed 0) transitions.
[2025-05-31 08:08:28] [INFO ] Flow matrix only has 501 transitions (discarded 11 similar events)
[2025-05-31 08:08:28] [INFO ] Invariant cache hit.
[2025-05-31 08:08:29] [INFO ] Implicit Places using invariants in 343 ms returned []
[2025-05-31 08:08:29] [INFO ] Flow matrix only has 501 transitions (discarded 11 similar events)
[2025-05-31 08:08:29] [INFO ] Invariant cache hit.
[2025-05-31 08:08:29] [INFO ] State equation strengthened by 94 read => feed constraints.
[2025-05-31 08:08:30] [INFO ] Implicit Places using invariants and state equation in 760 ms returned []
Implicit Place search using SMT with State Equation took 1106 ms to find 0 implicit places.
[2025-05-31 08:08:30] [INFO ] Redundant transitions in 30 ms returned []
Running 504 sub problems to find dead transitions.
[2025-05-31 08:08:30] [INFO ] Flow matrix only has 501 transitions (discarded 11 similar events)
[2025-05-31 08:08:30] [INFO ] Invariant cache hit.
[2025-05-31 08:08:30] [INFO ] State equation strengthened by 94 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 504 unsolved
At refinement iteration 1 (OVERLAPS) 1/173 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 504 unsolved
[2025-05-31 08:08:37] [INFO ] Deduced a trap composed of 17 places in 200 ms of which 3 ms to minimize.
[2025-05-31 08:08:37] [INFO ] Deduced a trap composed of 25 places in 234 ms of which 2 ms to minimize.
[2025-05-31 08:08:40] [INFO ] Deduced a trap composed of 127 places in 217 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 504 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 504 unsolved
At refinement iteration 4 (OVERLAPS) 501/674 variables, 173/186 constraints. Problems are: Problem set: 0 solved, 504 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/674 variables, 94/280 constraints. Problems are: Problem set: 0 solved, 504 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (INCLUDED_ONLY) 0/674 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 504 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 674/674 variables, and 280 constraints, problems are : Problem set: 0 solved, 504 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 173/173 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 504/504 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 504 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 504 unsolved
At refinement iteration 1 (OVERLAPS) 1/173 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 504 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 504 unsolved
[2025-05-31 08:09:06] [INFO ] Deduced a trap composed of 27 places in 255 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 504 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/173 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 504 unsolved
At refinement iteration 5 (OVERLAPS) 501/674 variables, 173/187 constraints. Problems are: Problem set: 0 solved, 504 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/674 variables, 94/281 constraints. Problems are: Problem set: 0 solved, 504 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/674 variables, 504/785 constraints. Problems are: Problem set: 0 solved, 504 unsolved
[2025-05-31 08:09:28] [INFO ] Deduced a trap composed of 35 places in 63 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 674/674 variables, and 786 constraints, problems are : Problem set: 0 solved, 504 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 173/173 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 504/504 constraints, Known Traps: 5/5 constraints]
After SMT, in 61240ms problems are : Problem set: 0 solved, 504 unsolved
Search for dead transitions found 0 dead transitions in 61267ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62453 ms. Remains : 173/173 places, 512/512 transitions.
RANDOM walk for 40000 steps (1320 resets) in 2372 ms. (16 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (263 resets) in 145 ms. (274 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (247 resets) in 205 ms. (194 steps per ms) remains 8/8 properties
[2025-05-31 08:09:32] [INFO ] Flatten gal took : 246 ms
BEST_FIRST walk for 40003 steps (251 resets) in 115 ms. (344 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (259 resets) in 100 ms. (396 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (242 resets) in 166 ms. (239 steps per ms) remains 8/8 properties
[2025-05-31 08:09:32] [INFO ] Flatten gal took : 146 ms
BEST_FIRST walk for 40003 steps (244 resets) in 110 ms. (360 steps per ms) remains 8/8 properties
[2025-05-31 08:09:32] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2480799041638050890.gal : 34 ms
BEST_FIRST walk for 40004 steps (270 resets) in 139 ms. (285 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (262 resets) in 90 ms. (439 steps per ms) remains 8/8 properties
[2025-05-31 08:09:32] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15232525253625923204.prop : 15 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/ReachabilityCardinality2480799041638050890.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15232525253625923204.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/ReachabilityCardinality15232525253625923204.prop.
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :5 after 6
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :6 after 35
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :35 after 37
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :37 after 42
SDD proceeding with computation,8 properties remain. new max is 128
SDD size :42 after 57
SDD proceeding with computation,8 properties remain. new max is 256
SDD size :57 after 87
SDD proceeding with computation,8 properties remain. new max is 512
SDD size :87 after 340
SDD proceeding with computation,8 properties remain. new max is 1024
SDD size :340 after 1854
SDD proceeding with computation,8 properties remain. new max is 2048
SDD size :1854 after 2802
SDD proceeding with computation,8 properties remain. new max is 4096
SDD size :2802 after 8933
SDD proceeding with computation,8 properties remain. new max is 8192
SDD size :8933 after 53926
Interrupted probabilistic random walk after 258466 steps, run timeout after 3001 ms. (steps per millisecond=86 ) properties seen :0 out of 8
Probabilistic random walk after 258466 steps, saw 81057 distinct states, run finished after 3009 ms. (steps per millisecond=85 ) properties seen :0
[2025-05-31 08:09:35] [INFO ] Flow matrix only has 501 transitions (discarded 11 similar events)
[2025-05-31 08:09:35] [INFO ] Invariant cache hit.
[2025-05-31 08:09:35] [INFO ] State equation strengthened by 94 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 83/87 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 74/161 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2025-05-31 08:09:35] [INFO ] Deduced a trap composed of 35 places in 99 ms of which 2 ms to minimize.
[2025-05-31 08:09:36] [INFO ] Deduced a trap composed of 35 places in 54 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/161 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/161 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 8 unsolved
SDD proceeding with computation,8 properties remain. new max is 16384
SDD size :53926 after 222251
At refinement iteration 6 (OVERLAPS) 501/662 variables, 161/173 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/662 variables, 94/267 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/662 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 8 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 12/674 variables, 12/279 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/674 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 0/674 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 674/674 variables, and 279 constraints, problems are : Problem set: 0 solved, 8 unsolved in 978 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 173/173 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 83/87 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 74/161 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/161 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2025-05-31 08:09:36] [INFO ] Deduced a trap composed of 35 places in 66 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/161 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/161 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 501/662 variables, 161/174 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/662 variables, 94/268 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/662 variables, 8/276 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/662 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 12/674 variables, 12/288 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/674 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 0/674 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 674/674 variables, and 288 constraints, problems are : Problem set: 0 solved, 8 unsolved in 954 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 173/173 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 3/3 constraints]
After SMT, in 1957ms problems are : Problem set: 0 solved, 8 unsolved
Fused 8 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 1552 ms.
Support contains 4 out of 173 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 173/173 places, 512/512 transitions.
Applied a total of 0 rules in 26 ms. Remains 173 /173 variables (removed 0) and now considering 512/512 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 173/173 places, 512/512 transitions.
RANDOM walk for 40000 steps (1335 resets) in 322 ms. (123 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (254 resets) in 175 ms. (227 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (268 resets) in 110 ms. (360 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (266 resets) in 123 ms. (322 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (249 resets) in 123 ms. (322 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (260 resets) in 99 ms. (400 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (265 resets) in 86 ms. (459 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (252 resets) in 93 ms. (425 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (242 resets) in 87 ms. (454 steps per ms) remains 8/8 properties
SDD proceeding with computation,8 properties remain. new max is 32768
SDD size :222251 after 419227
Interrupted probabilistic random walk after 268509 steps, run timeout after 3001 ms. (steps per millisecond=89 ) properties seen :0 out of 8
Probabilistic random walk after 268509 steps, saw 84358 distinct states, run finished after 3001 ms. (steps per millisecond=89 ) properties seen :0
[2025-05-31 08:09:42] [INFO ] Flow matrix only has 501 transitions (discarded 11 similar events)
[2025-05-31 08:09:42] [INFO ] Invariant cache hit.
[2025-05-31 08:09:42] [INFO ] State equation strengthened by 94 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 83/87 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 74/161 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2025-05-31 08:09:42] [INFO ] Deduced a trap composed of 35 places in 69 ms of which 2 ms to minimize.
[2025-05-31 08:09:43] [INFO ] Deduced a trap composed of 35 places in 43 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/161 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/161 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 501/662 variables, 161/173 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/662 variables, 94/267 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/662 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 8 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 12/674 variables, 12/279 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/674 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 0/674 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 674/674 variables, and 279 constraints, problems are : Problem set: 0 solved, 8 unsolved in 893 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 173/173 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 83/87 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 74/161 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/161 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2025-05-31 08:09:43] [INFO ] Deduced a trap composed of 35 places in 44 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/161 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/161 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 501/662 variables, 161/174 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/662 variables, 94/268 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/662 variables, 8/276 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/662 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 12/674 variables, 12/288 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/674 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 0/674 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 674/674 variables, and 288 constraints, problems are : Problem set: 0 solved, 8 unsolved in 1093 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 173/173 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 3/3 constraints]
After SMT, in 1998ms problems are : Problem set: 0 solved, 8 unsolved
Fused 8 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 1194 ms.
Support contains 4 out of 173 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 173/173 places, 512/512 transitions.
Applied a total of 0 rules in 9 ms. Remains 173 /173 variables (removed 0) and now considering 512/512 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 173/173 places, 512/512 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 173/173 places, 512/512 transitions.
Applied a total of 0 rules in 9 ms. Remains 173 /173 variables (removed 0) and now considering 512/512 (removed 0) transitions.
[2025-05-31 08:09:45] [INFO ] Flow matrix only has 501 transitions (discarded 11 similar events)
[2025-05-31 08:09:45] [INFO ] Invariant cache hit.
[2025-05-31 08:09:46] [INFO ] Implicit Places using invariants in 151 ms returned []
[2025-05-31 08:09:46] [INFO ] Flow matrix only has 501 transitions (discarded 11 similar events)
[2025-05-31 08:09:46] [INFO ] Invariant cache hit.
[2025-05-31 08:09:46] [INFO ] State equation strengthened by 94 read => feed constraints.
[2025-05-31 08:09:46] [INFO ] Implicit Places using invariants and state equation in 634 ms returned []
Implicit Place search using SMT with State Equation took 790 ms to find 0 implicit places.
[2025-05-31 08:09:46] [INFO ] Redundant transitions in 12 ms returned []
Running 504 sub problems to find dead transitions.
[2025-05-31 08:09:46] [INFO ] Flow matrix only has 501 transitions (discarded 11 similar events)
[2025-05-31 08:09:46] [INFO ] Invariant cache hit.
[2025-05-31 08:09:46] [INFO ] State equation strengthened by 94 read => feed constraints.
SDD proceeding with computation,8 properties remain. new max is 65536
SDD size :419227 after 925401
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 504 unsolved
At refinement iteration 1 (OVERLAPS) 1/173 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 504 unsolved
[2025-05-31 08:09:53] [INFO ] Deduced a trap composed of 17 places in 133 ms of which 2 ms to minimize.
[2025-05-31 08:09:53] [INFO ] Deduced a trap composed of 25 places in 119 ms of which 2 ms to minimize.
[2025-05-31 08:09:56] [INFO ] Deduced a trap composed of 127 places in 175 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 504 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 504 unsolved
At refinement iteration 4 (OVERLAPS) 501/674 variables, 173/186 constraints. Problems are: Problem set: 0 solved, 504 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/674 variables, 94/280 constraints. Problems are: Problem set: 0 solved, 504 unsolved
SDD proceeding with computation,8 properties remain. new max is 131072
SDD size :925401 after 1.98641e+06
At refinement iteration 6 (INCLUDED_ONLY) 0/674 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 504 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 674/674 variables, and 280 constraints, problems are : Problem set: 0 solved, 504 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 173/173 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 504/504 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 504 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 504 unsolved
At refinement iteration 1 (OVERLAPS) 1/173 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 504 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 504 unsolved
[2025-05-31 08:10:22] [INFO ] Deduced a trap composed of 27 places in 240 ms of which 4 ms to minimize.
Detected timeout of ITS tools.
[2025-05-31 08:10:22] [INFO ] Flatten gal took : 76 ms
[2025-05-31 08:10:22] [INFO ] Applying decomposition
[2025-05-31 08:10:22] [INFO ] Flatten gal took : 71 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/graph2256848320359770403.txt' '-o' '/tmp/graph2256848320359770403.bin' '-w' '/tmp/graph2256848320359770403.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2256848320359770403.bin' '-l' '-1' '-v' '-w' '/tmp/graph2256848320359770403.weights' '-q' '0' '-e' '0.001'
[2025-05-31 08:10:23] [INFO ] Decomposing Gal with order
[2025-05-31 08:10:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 08:10:23] [INFO ] Removed a total of 800 redundant transitions.
[2025-05-31 08:10:23] [INFO ] Flatten gal took : 140 ms
[2025-05-31 08:10:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 195 labels/synchronizations in 26 ms.
[2025-05-31 08:10:23] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9977210138203805374.gal : 13 ms
[2025-05-31 08:10:23] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15406212218091459352.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/ReachabilityCardinality9977210138203805374.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15406212218091459352.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 ...308
Loading property file /tmp/ReachabilityCardinality15406212218091459352.prop.
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :1 after 9
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :9 after 4225
SDD proceeding with computation,8 properties remain. new max is 128
SDD size :4225 after 96385
SDD proceeding with computation,8 properties remain. new max is 256
SDD size :96385 after 2.24222e+06
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 504 unsolved
Invariant property MIN1 does not hold.
Reachability property MAX1 is true.
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :2.24222e+06 after 2.98076e+07
At refinement iteration 4 (INCLUDED_ONLY) 0/173 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 504 unsolved
At refinement iteration 5 (OVERLAPS) 501/674 variables, 173/187 constraints. Problems are: Problem set: 0 solved, 504 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/674 variables, 94/281 constraints. Problems are: Problem set: 0 solved, 504 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/674 variables, 504/785 constraints. Problems are: Problem set: 0 solved, 504 unsolved
SDD proceeding with computation,6 properties remain. new max is 512
SDD size :2.98076e+07 after 1.22155e+09
[2025-05-31 08:10:42] [INFO ] Deduced a trap composed of 35 places in 60 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 674/674 variables, and 786 constraints, problems are : Problem set: 0 solved, 504 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 173/173 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 504/504 constraints, Known Traps: 5/5 constraints]
After SMT, in 60941ms problems are : Problem set: 0 solved, 504 unsolved
Search for dead transitions found 0 dead transitions in 60949ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61772 ms. Remains : 173/173 places, 512/512 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 117 edges and 173 vertex of which 29 / 173 are part of one of the 4 SCC in 1 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 147 transitions
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 174 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 4 place count 145 transition count 335
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 145 transition count 335
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 22 place count 145 transition count 320
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 24 place count 144 transition count 319
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 26 place count 143 transition count 319
Drop transitions (Redundant composition of simpler transitions.) removed 27 transitions
Redundant transition composition rules discarded 27 transitions
Iterating global reduction 1 with 27 rules applied. Total rules applied 53 place count 143 transition count 292
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 6 rules applied. Total rules applied 59 place count 143 transition count 286
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 68 place count 137 transition count 283
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 68 place count 137 transition count 280
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 74 place count 134 transition count 280
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 76 place count 133 transition count 279
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 77 place count 133 transition count 278
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 79 place count 132 transition count 277
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 80 place count 131 transition count 242
Iterating global reduction 3 with 1 rules applied. Total rules applied 81 place count 131 transition count 242
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 84 place count 131 transition count 239
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 87 place count 128 transition count 239
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 93 place count 128 transition count 233
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 96 place count 128 transition count 230
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 99 place count 125 transition count 230
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 105 place count 125 transition count 230
Applied a total of 105 rules in 125 ms. Remains 125 /173 variables (removed 48) and now considering 230/512 (removed 282) transitions.
Running SMT prover for 6 properties.
[2025-05-31 08:10:47] [INFO ] Flow matrix only has 226 transitions (discarded 4 similar events)
// Phase 1: matrix 226 rows 125 cols
[2025-05-31 08:10:47] [INFO ] Computed 10 invariants in 3 ms
[2025-05-31 08:10:47] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2025-05-31 08:10:48] [INFO ] After 313ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2025-05-31 08:10:48] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2025-05-31 08:10:48] [INFO ] After 148ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2025-05-31 08:10:48] [INFO ] State equation strengthened by 8 read => feed constraints.
[2025-05-31 08:10:48] [INFO ] After 60ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :6
TRAPS : Iteration 0
[2025-05-31 08:10:48] [INFO ] After 160ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
[2025-05-31 08:10:48] [INFO ] After 465ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
[2025-05-31 08:10:48] [INFO ] Flatten gal took : 29 ms
[2025-05-31 08:10:48] [INFO ] Flatten gal took : 23 ms
[2025-05-31 08:10:48] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4418596891431505994.gal : 5 ms
[2025-05-31 08:10:48] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4687069831675842981.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/ReachabilityCardinality4418596891431505994.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4687069831675842981.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 ...328
Loading property file /tmp/ReachabilityCardinality4687069831675842981.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 11
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :11 after 17
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :17 after 31
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :31 after 207
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :207 after 263
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :263 after 359
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :359 after 1583
SDD proceeding with computation,6 properties remain. new max is 512
SDD size :1583 after 2293
SDD proceeding with computation,6 properties remain. new max is 1024
SDD size :2293 after 3939
SDD proceeding with computation,6 properties remain. new max is 2048
SDD size :3939 after 9133
SDD proceeding with computation,6 properties remain. new max is 4096
SDD size :9133 after 16841
SDD proceeding with computation,6 properties remain. new max is 8192
SDD size :16841 after 48636
SDD proceeding with computation,6 properties remain. new max is 16384
SDD size :48636 after 345679
SDD proceeding with computation,6 properties remain. new max is 32768
SDD size :345679 after 1.39175e+06
SDD proceeding with computation,6 properties remain. new max is 65536
SDD size :1.39175e+06 after 6.34159e+07
Detected timeout of ITS tools.
[2025-05-31 08:11:03] [INFO ] Flatten gal took : 22 ms
[2025-05-31 08:11:03] [INFO ] Applying decomposition
[2025-05-31 08:11:03] [INFO ] Flatten gal took : 23 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/graph12268785310101169650.txt' '-o' '/tmp/graph12268785310101169650.bin' '-w' '/tmp/graph12268785310101169650.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12268785310101169650.bin' '-l' '-1' '-v' '-w' '/tmp/graph12268785310101169650.weights' '-q' '0' '-e' '0.001'
[2025-05-31 08:11:03] [INFO ] Decomposing Gal with order
[2025-05-31 08:11:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 08:11:03] [INFO ] Removed a total of 329 redundant transitions.
[2025-05-31 08:11:03] [INFO ] Flatten gal took : 53 ms
[2025-05-31 08:11:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 95 labels/synchronizations in 21 ms.
[2025-05-31 08:11:04] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11515859756538383363.gal : 9 ms
[2025-05-31 08:11:04] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1524264178678067541.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/ReachabilityCardinality11515859756538383363.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1524264178678067541.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 ...308
Loading property file /tmp/ReachabilityCardinality1524264178678067541.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 25
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :25 after 45649
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :45649 after 61669
Invariant property MIN3 does not hold.
Reachability property MAX3 is true.
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :61669 after 3.61112e+08
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :3.61112e+08 after 1.40273e+09
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,3.48561e+09,0.792189,21812,554,95,33061,1361,558,75145,105,4415,0
Total reachable state count : 3485610530

Verifying 6 reachability properties.
Reachability property MAX0 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX0,4.77079e+07,0.793794,22072,210,69,33061,1361,558,75145,107,4415,0
Invariant property MIN0 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,4.77079e+07,0.794604,22072,210,69,33061,1361,560,75145,108,4415,0
Reachability property MAX2 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX2,4.77079e+07,0.79552,22072,210,69,33061,1361,560,75145,109,4415,0
Invariant property MIN2 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN2,4.77079e+07,0.796695,22072,210,69,33061,1361,562,75145,110,4415,0
Reachability property MAX3 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX3,1.57694e+06,0.797055,22072,124,61,33061,1361,565,75145,110,4415,0
Invariant property MIN3 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN3,1.57694e+06,0.797541,22072,124,61,33061,1361,571,75145,110,4415,0
Over-approximation ignoring read arcs solved 0 properties in 17143 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
FORMULA FireWire-PT-20-UpperBounds-08 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Starting property specific reduction for FireWire-PT-20-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:[1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1]
[2025-05-31 08:11:04] [INFO ] Flow matrix only has 501 transitions (discarded 11 similar events)
// Phase 1: matrix 501 rows 173 cols
[2025-05-31 08:11:04] [INFO ] Computed 10 invariants in 9 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (353 resets) in 25 ms. (384 steps per ms)
BEST_FIRST walk for 10000 steps (64 resets) in 9 ms. (1000 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2025-05-31 08:11:04] [INFO ] Flow matrix only has 501 transitions (discarded 11 similar events)
[2025-05-31 08:11:04] [INFO ] Invariant cache hit.
[2025-05-31 08:11:05] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2025-05-31 08:11:05] [INFO ] [Real]Absence check using state equation in 147 ms returned sat
[2025-05-31 08:11:05] [INFO ] State equation strengthened by 94 read => feed constraints.
[2025-05-31 08:11:05] [INFO ] [Real]Added 94 Read/Feed constraints in 41 ms returned sat
[2025-05-31 08:11:05] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 08:11:05] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2025-05-31 08:11:05] [INFO ] [Nat]Absence check using state equation in 160 ms returned sat
[2025-05-31 08:11:05] [INFO ] [Nat]Added 94 Read/Feed constraints in 88 ms returned sat
[2025-05-31 08:11:05] [INFO ] Computed and/alt/rep : 146/657/146 causal constraints (skipped 347 transitions) in 66 ms.
[2025-05-31 08:11:06] [INFO ] Deduced a trap composed of 28 places in 198 ms of which 3 ms to minimize.
[2025-05-31 08:11:06] [INFO ] Deduced a trap composed of 25 places in 201 ms of which 3 ms to minimize.
[2025-05-31 08:11:06] [INFO ] Deduced a trap composed of 35 places in 55 ms of which 1 ms to minimize.
[2025-05-31 08:11:06] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 595 ms
[2025-05-31 08:11:06] [INFO ] Deduced a trap composed of 35 places in 102 ms of which 2 ms to minimize.
[2025-05-31 08:11:06] [INFO ] Deduced a trap composed of 35 places in 68 ms of which 2 ms to minimize.
[2025-05-31 08:11:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 277 ms
[2025-05-31 08:11:06] [INFO ] Added : 17 causal constraints over 8 iterations in 1414 ms. Result :sat
Minimization took 360 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 173 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p526) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 173/173 places, 511/511 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 173 transition count 510
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 172 transition count 510
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 171 transition count 509
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 170 transition count 506
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 170 transition count 506
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 169 transition count 506
Applied a total of 8 rules in 41 ms. Remains 169 /173 variables (removed 4) and now considering 506/511 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 169/173 places, 506/511 transitions.
[2025-05-31 08:11:07] [INFO ] Flow matrix only has 495 transitions (discarded 11 similar events)
// Phase 1: matrix 495 rows 169 cols
[2025-05-31 08:11:07] [INFO ] Computed 10 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (33286 resets) in 2538 ms. (393 steps per ms)
BEST_FIRST walk for 1000001 steps (6568 resets) in 627 ms. (1592 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2025-05-31 08:11:10] [INFO ] Flow matrix only has 495 transitions (discarded 11 similar events)
[2025-05-31 08:11:10] [INFO ] Invariant cache hit.
[2025-05-31 08:11:10] [INFO ] [Real]Absence check using 10 positive place invariants in 8 ms returned sat
[2025-05-31 08:11:11] [INFO ] [Real]Absence check using state equation in 203 ms returned sat
[2025-05-31 08:11:11] [INFO ] State equation strengthened by 93 read => feed constraints.
[2025-05-31 08:11:11] [INFO ] [Real]Added 93 Read/Feed constraints in 62 ms returned sat
[2025-05-31 08:11:11] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 08:11:11] [INFO ] [Nat]Absence check using 10 positive place invariants in 9 ms returned sat
[2025-05-31 08:11:11] [INFO ] [Nat]Absence check using state equation in 224 ms returned sat
[2025-05-31 08:11:11] [INFO ] [Nat]Added 93 Read/Feed constraints in 148 ms returned sat
[2025-05-31 08:11:11] [INFO ] Computed and/alt/rep : 139/647/139 causal constraints (skipped 348 transitions) in 69 ms.
[2025-05-31 08:11:12] [INFO ] Deduced a trap composed of 17 places in 256 ms of which 3 ms to minimize.
[2025-05-31 08:11:12] [INFO ] Deduced a trap composed of 35 places in 64 ms of which 1 ms to minimize.
[2025-05-31 08:11:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 432 ms
[2025-05-31 08:11:12] [INFO ] Added : 23 causal constraints over 5 iterations in 824 ms. Result :sat
Minimization took 325 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 169 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 169/169 places, 506/506 transitions.
Applied a total of 0 rules in 21 ms. Remains 169 /169 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 169/169 places, 506/506 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 169/169 places, 506/506 transitions.
Applied a total of 0 rules in 13 ms. Remains 169 /169 variables (removed 0) and now considering 506/506 (removed 0) transitions.
[2025-05-31 08:11:12] [INFO ] Flow matrix only has 495 transitions (discarded 11 similar events)
[2025-05-31 08:11:12] [INFO ] Invariant cache hit.
[2025-05-31 08:11:13] [INFO ] Implicit Places using invariants in 363 ms returned []
[2025-05-31 08:11:13] [INFO ] Flow matrix only has 495 transitions (discarded 11 similar events)
[2025-05-31 08:11:13] [INFO ] Invariant cache hit.
[2025-05-31 08:11:13] [INFO ] State equation strengthened by 93 read => feed constraints.
[2025-05-31 08:11:14] [INFO ] Implicit Places using invariants and state equation in 920 ms returned []
Implicit Place search using SMT with State Equation took 1286 ms to find 0 implicit places.
[2025-05-31 08:11:14] [INFO ] Redundant transitions in 5 ms returned []
Running 498 sub problems to find dead transitions.
[2025-05-31 08:11:14] [INFO ] Flow matrix only has 495 transitions (discarded 11 similar events)
[2025-05-31 08:11:14] [INFO ] Invariant cache hit.
[2025-05-31 08:11:14] [INFO ] State equation strengthened by 93 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 1 (OVERLAPS) 2/169 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 498 unsolved
[2025-05-31 08:11:21] [INFO ] Deduced a trap composed of 17 places in 209 ms of which 3 ms to minimize.
[2025-05-31 08:11:21] [INFO ] Deduced a trap composed of 25 places in 192 ms of which 2 ms to minimize.
[2025-05-31 08:11:23] [INFO ] Deduced a trap composed of 35 places in 260 ms of which 3 ms to minimize.
[2025-05-31 08:11:24] [INFO ] Deduced a trap composed of 123 places in 221 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/169 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/169 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 4 (OVERLAPS) 495/664 variables, 169/183 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/664 variables, 93/276 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/664 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 498 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 664/664 variables, and 276 constraints, problems are : Problem set: 0 solved, 498 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 169/169 constraints, ReadFeed: 93/93 constraints, PredecessorRefiner: 498/498 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 498 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 1 (OVERLAPS) 2/169 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/169 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/169 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 4 (OVERLAPS) 495/664 variables, 169/183 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/664 variables, 93/276 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/664 variables, 498/774 constraints. Problems are: Problem set: 0 solved, 498 unsolved
[2025-05-31 08:12:11] [INFO ] Deduced a trap composed of 35 places in 68 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 664/664 variables, and 775 constraints, problems are : Problem set: 0 solved, 498 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 169/169 constraints, ReadFeed: 93/93 constraints, PredecessorRefiner: 498/498 constraints, Known Traps: 5/5 constraints]
After SMT, in 61081ms problems are : Problem set: 0 solved, 498 unsolved
Search for dead transitions found 0 dead transitions in 61089ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62403 ms. Remains : 169/169 places, 506/506 transitions.
[2025-05-31 08:12:15] [INFO ] Flatten gal took : 104 ms
RANDOM walk for 40000 steps (1310 resets) in 415 ms. (96 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (251 resets) in 109 ms. (363 steps per ms) remains 2/2 properties
[2025-05-31 08:12:15] [INFO ] Flatten gal took : 127 ms
[2025-05-31 08:12:15] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4820782967991441208.gal : 19 ms
[2025-05-31 08:12:15] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15524102453829725213.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/ReachabilityCardinality4820782967991441208.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15524102453829725213.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40003 steps (240 resets) in 81 ms. (487 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/ReachabilityCardinality15524102453829725213.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :5 after 6
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :6 after 8
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :8 after 9
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :9 after 67
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :67 after 93
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :93 after 159
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :159 after 667
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :667 after 3205
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :3205 after 5436
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :5436 after 19726
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :19726 after 45079
Interrupted probabilistic random walk after 326844 steps, run timeout after 3001 ms. (steps per millisecond=108 ) properties seen :0 out of 2
Probabilistic random walk after 326844 steps, saw 105581 distinct states, run finished after 3001 ms. (steps per millisecond=108 ) properties seen :0
[2025-05-31 08:12:18] [INFO ] Flow matrix only has 495 transitions (discarded 11 similar events)
[2025-05-31 08:12:18] [INFO ] Invariant cache hit.
[2025-05-31 08:12:18] [INFO ] State equation strengthened by 93 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 42/43 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 114/157 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-05-31 08:12:18] [INFO ] Deduced a trap composed of 27 places in 133 ms of which 2 ms to minimize.
[2025-05-31 08:12:19] [INFO ] Deduced a trap composed of 47 places in 145 ms of which 2 ms to minimize.
[2025-05-31 08:12:19] [INFO ] Deduced a trap composed of 35 places in 48 ms of which 1 ms to minimize.
[2025-05-31 08:12:19] [INFO ] Deduced a trap composed of 26 places in 142 ms of which 3 ms to minimize.
[2025-05-31 08:12:19] [INFO ] Deduced a trap composed of 25 places in 139 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/157 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 495/652 variables, 157/172 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/652 variables, 93/265 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/652 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 12/664 variables, 12/277 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/664 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/664 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 664/664 variables, and 277 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1052 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 169/169 constraints, ReadFeed: 93/93 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 42/43 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 114/157 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/157 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 495/652 variables, 157/172 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/652 variables, 93/265 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/652 variables, 2/267 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :45079 after 292931
At refinement iteration 9 (INCLUDED_ONLY) 0/652 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 12/664 variables, 12/279 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/664 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/664 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 664/664 variables, and 279 constraints, problems are : Problem set: 0 solved, 2 unsolved in 408 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 169/169 constraints, ReadFeed: 93/93 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 5/5 constraints]
After SMT, in 1469ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 62 ms.
Support contains 1 out of 169 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 169/169 places, 506/506 transitions.
Applied a total of 0 rules in 7 ms. Remains 169 /169 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 169/169 places, 506/506 transitions.
RANDOM walk for 40000 steps (1287 resets) in 313 ms. (127 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (266 resets) in 76 ms. (519 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (265 resets) in 76 ms. (519 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 409588 steps, run timeout after 3001 ms. (steps per millisecond=136 ) properties seen :0 out of 2
Probabilistic random walk after 409588 steps, saw 130032 distinct states, run finished after 3001 ms. (steps per millisecond=136 ) properties seen :0
[2025-05-31 08:12:23] [INFO ] Flow matrix only has 495 transitions (discarded 11 similar events)
[2025-05-31 08:12:23] [INFO ] Invariant cache hit.
[2025-05-31 08:12:23] [INFO ] State equation strengthened by 93 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 42/43 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 114/157 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-05-31 08:12:23] [INFO ] Deduced a trap composed of 27 places in 127 ms of which 2 ms to minimize.
[2025-05-31 08:12:23] [INFO ] Deduced a trap composed of 47 places in 129 ms of which 2 ms to minimize.
[2025-05-31 08:12:23] [INFO ] Deduced a trap composed of 35 places in 37 ms of which 1 ms to minimize.
[2025-05-31 08:12:23] [INFO ] Deduced a trap composed of 26 places in 135 ms of which 3 ms to minimize.
[2025-05-31 08:12:24] [INFO ] Deduced a trap composed of 25 places in 220 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 32768
At refinement iteration 5 (INCLUDED_ONLY) 0/157 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD size :292931 after 1.0327e+06
At refinement iteration 6 (OVERLAPS) 495/652 variables, 157/172 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/652 variables, 93/265 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/652 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 12/664 variables, 12/277 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/664 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/664 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 664/664 variables, and 277 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1214 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 169/169 constraints, ReadFeed: 93/93 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 42/43 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 114/157 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/157 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 495/652 variables, 157/172 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/652 variables, 93/265 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/652 variables, 2/267 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/652 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 12/664 variables, 12/279 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/664 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/664 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 664/664 variables, and 279 constraints, problems are : Problem set: 0 solved, 2 unsolved in 587 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 169/169 constraints, ReadFeed: 93/93 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 5/5 constraints]
After SMT, in 1819ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 56 ms.
Support contains 1 out of 169 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 169/169 places, 506/506 transitions.
Applied a total of 0 rules in 30 ms. Remains 169 /169 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 169/169 places, 506/506 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 169/169 places, 506/506 transitions.
Applied a total of 0 rules in 13 ms. Remains 169 /169 variables (removed 0) and now considering 506/506 (removed 0) transitions.
[2025-05-31 08:12:25] [INFO ] Flow matrix only has 495 transitions (discarded 11 similar events)
[2025-05-31 08:12:25] [INFO ] Invariant cache hit.
[2025-05-31 08:12:25] [INFO ] Implicit Places using invariants in 234 ms returned []
[2025-05-31 08:12:25] [INFO ] Flow matrix only has 495 transitions (discarded 11 similar events)
[2025-05-31 08:12:25] [INFO ] Invariant cache hit.
[2025-05-31 08:12:25] [INFO ] State equation strengthened by 93 read => feed constraints.
[2025-05-31 08:12:26] [INFO ] Implicit Places using invariants and state equation in 750 ms returned []
Implicit Place search using SMT with State Equation took 990 ms to find 0 implicit places.
[2025-05-31 08:12:26] [INFO ] Redundant transitions in 5 ms returned []
Running 498 sub problems to find dead transitions.
[2025-05-31 08:12:26] [INFO ] Flow matrix only has 495 transitions (discarded 11 similar events)
[2025-05-31 08:12:26] [INFO ] Invariant cache hit.
[2025-05-31 08:12:26] [INFO ] State equation strengthened by 93 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 1 (OVERLAPS) 2/169 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 498 unsolved
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :1.0327e+06 after 2.33196e+06
[2025-05-31 08:12:34] [INFO ] Deduced a trap composed of 17 places in 222 ms of which 3 ms to minimize.
[2025-05-31 08:12:34] [INFO ] Deduced a trap composed of 25 places in 213 ms of which 3 ms to minimize.
[2025-05-31 08:12:35] [INFO ] Deduced a trap composed of 35 places in 163 ms of which 3 ms to minimize.
[2025-05-31 08:12:36] [INFO ] Deduced a trap composed of 123 places in 177 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/169 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/169 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 4 (OVERLAPS) 495/664 variables, 169/183 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/664 variables, 93/276 constraints. Problems are: Problem set: 0 solved, 498 unsolved
SDD proceeding with computation,2 properties remain. new max is 131072
SDD size :2.33196e+06 after 4.45584e+06
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (INCLUDED_ONLY) 0/664 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 498 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 664/664 variables, and 276 constraints, problems are : Problem set: 0 solved, 498 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 169/169 constraints, ReadFeed: 93/93 constraints, PredecessorRefiner: 498/498 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 498 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 1 (OVERLAPS) 2/169 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/169 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/169 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 4 (OVERLAPS) 495/664 variables, 169/183 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/664 variables, 93/276 constraints. Problems are: Problem set: 0 solved, 498 unsolved
Detected timeout of ITS tools.
[2025-05-31 08:13:05] [INFO ] Flatten gal took : 19 ms
[2025-05-31 08:13:05] [INFO ] Applying decomposition
[2025-05-31 08:13:05] [INFO ] Flatten gal took : 15 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/graph1211199110330971319.txt' '-o' '/tmp/graph1211199110330971319.bin' '-w' '/tmp/graph1211199110330971319.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1211199110330971319.bin' '-l' '-1' '-v' '-w' '/tmp/graph1211199110330971319.weights' '-q' '0' '-e' '0.001'
[2025-05-31 08:13:05] [INFO ] Decomposing Gal with order
[2025-05-31 08:13:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 08:13:05] [INFO ] Removed a total of 762 redundant transitions.
[2025-05-31 08:13:05] [INFO ] Flatten gal took : 45 ms
[2025-05-31 08:13:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 225 labels/synchronizations in 17 ms.
[2025-05-31 08:13:05] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11003353554341097297.gal : 5 ms
[2025-05-31 08:13:05] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13026735050892096200.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/ReachabilityCardinality11003353554341097297.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13026735050892096200.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 ...309
Loading property file /tmp/ReachabilityCardinality13026735050892096200.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :1 after 25
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :25 after 25
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :25 after 241
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :241 after 5713
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :5713 after 85969
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :85969 after 180073
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :180073 after 3.78588e+07
At refinement iteration 6 (INCLUDED_ONLY) 0/664 variables, 498/774 constraints. Problems are: Problem set: 0 solved, 498 unsolved
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :3.78588e+07 after 4.91487e+08
[2025-05-31 08:13:22] [INFO ] Deduced a trap composed of 35 places in 46 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 664/664 variables, and 775 constraints, problems are : Problem set: 0 solved, 498 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 169/169 constraints, ReadFeed: 93/93 constraints, PredecessorRefiner: 498/498 constraints, Known Traps: 5/5 constraints]
After SMT, in 61083ms problems are : Problem set: 0 solved, 498 unsolved
Search for dead transitions found 0 dead transitions in 61090ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62106 ms. Remains : 169/169 places, 506/506 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 115 edges and 169 vertex of which 29 / 169 are part of one of the 4 SCC in 0 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 147 transitions
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 174 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 4 place count 141 transition count 329
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 141 transition count 329
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 22 place count 141 transition count 314
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 24 place count 140 transition count 313
Drop transitions (Redundant composition of simpler transitions.) removed 27 transitions
Redundant transition composition rules discarded 27 transitions
Iterating global reduction 1 with 27 rules applied. Total rules applied 51 place count 140 transition count 286
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 6 rules applied. Total rules applied 57 place count 140 transition count 280
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 66 place count 134 transition count 277
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 66 place count 134 transition count 274
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 72 place count 131 transition count 274
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 74 place count 130 transition count 273
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 75 place count 130 transition count 272
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 77 place count 129 transition count 271
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 78 place count 128 transition count 237
Iterating global reduction 3 with 1 rules applied. Total rules applied 79 place count 128 transition count 237
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 82 place count 128 transition count 234
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 85 place count 125 transition count 234
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 91 place count 125 transition count 228
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 94 place count 125 transition count 225
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 97 place count 122 transition count 225
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 103 place count 122 transition count 225
Applied a total of 103 rules in 39 ms. Remains 122 /169 variables (removed 47) and now considering 225/506 (removed 281) transitions.
Running SMT prover for 2 properties.
[2025-05-31 08:13:27] [INFO ] Flow matrix only has 221 transitions (discarded 4 similar events)
// Phase 1: matrix 221 rows 122 cols
[2025-05-31 08:13:27] [INFO ] Computed 10 invariants in 1 ms
[2025-05-31 08:13:27] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2025-05-31 08:13:27] [INFO ] After 147ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2025-05-31 08:13:27] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2025-05-31 08:13:27] [INFO ] After 83ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2025-05-31 08:13:27] [INFO ] State equation strengthened by 8 read => feed constraints.
[2025-05-31 08:13:27] [INFO ] After 20ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2025-05-31 08:13:27] [INFO ] After 47ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2025-05-31 08:13:27] [INFO ] After 196ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2025-05-31 08:13:27] [INFO ] Flatten gal took : 8 ms
[2025-05-31 08:13:27] [INFO ] Flatten gal took : 9 ms
[2025-05-31 08:13:27] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7584032003284625485.gal : 3 ms
[2025-05-31 08:13:27] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1431372026527758034.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/ReachabilityCardinality7584032003284625485.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1431372026527758034.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 ...328
Loading property file /tmp/ReachabilityCardinality1431372026527758034.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 11
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :11 after 19
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :19 after 25
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :25 after 201
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :201 after 257
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :257 after 293
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :293 after 1393
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1393 after 2133
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :2133 after 3253
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :3253 after 8887
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :8887 after 14521
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :14521 after 45574
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :45574 after 341759
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :341759 after 1.28583e+06
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :1.28583e+06 after 6.34338e+07
Detected timeout of ITS tools.
[2025-05-31 08:13:42] [INFO ] Flatten gal took : 8 ms
[2025-05-31 08:13:42] [INFO ] Applying decomposition
[2025-05-31 08:13:42] [INFO ] Flatten gal took : 7 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/graph7065331423706842493.txt' '-o' '/tmp/graph7065331423706842493.bin' '-w' '/tmp/graph7065331423706842493.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7065331423706842493.bin' '-l' '-1' '-v' '-w' '/tmp/graph7065331423706842493.weights' '-q' '0' '-e' '0.001'
[2025-05-31 08:13:42] [INFO ] Decomposing Gal with order
[2025-05-31 08:13:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 08:13:42] [INFO ] Removed a total of 327 redundant transitions.
[2025-05-31 08:13:42] [INFO ] Flatten gal took : 17 ms
[2025-05-31 08:13:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 83 labels/synchronizations in 10 ms.
[2025-05-31 08:13:42] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1728831284333879708.gal : 3 ms
[2025-05-31 08:13:42] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16286363442180644323.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/ReachabilityCardinality1728831284333879708.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16286363442180644323.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 ...308
Loading property file /tmp/ReachabilityCardinality16286363442180644323.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 721
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :721 after 4861
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :4861 after 2.83414e+06
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :2.83414e+06 after 6.73229e+06
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :6.73229e+06 after 3.53852e+07
Invariant property MIN0 does not hold.
Reachability property MAX0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 65 fixpoint passes
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,3.34863e+09,1.85154,43388,510,106,69314,2386,501,161027,99,11074,0
Total reachable state count : 3348627060

Verifying 2 reachability properties.
Reachability property MAX0 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX0,32955,1.85396,43388,53,49,69314,2386,504,161027,102,11074,0
Invariant property MIN0 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,32955,1.85446,43388,53,49,69314,2386,510,161027,104,11074,0
Over-approximation ignoring read arcs solved 0 properties in 17409 ms.
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:[1]
Ending property specific reduction for FireWire-PT-20-UpperBounds-04 in 159953 ms.
Starting property specific reduction for FireWire-PT-20-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:[1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1]
[2025-05-31 08:13:44] [INFO ] Flow matrix only has 501 transitions (discarded 11 similar events)
// Phase 1: matrix 501 rows 173 cols
[2025-05-31 08:13:44] [INFO ] Computed 10 invariants in 6 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (342 resets) in 25 ms. (384 steps per ms)
BEST_FIRST walk for 10001 steps (58 resets) in 8 ms. (1111 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2025-05-31 08:13:44] [INFO ] Flow matrix only has 501 transitions (discarded 11 similar events)
[2025-05-31 08:13:44] [INFO ] Invariant cache hit.
[2025-05-31 08:13:45] [INFO ] [Real]Absence check using 10 positive place invariants in 19 ms returned sat
[2025-05-31 08:13:45] [INFO ] [Real]Absence check using state equation in 201 ms returned sat
[2025-05-31 08:13:45] [INFO ] State equation strengthened by 94 read => feed constraints.
[2025-05-31 08:13:45] [INFO ] [Real]Added 94 Read/Feed constraints in 68 ms returned sat
[2025-05-31 08:13:45] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 08:13:45] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2025-05-31 08:13:45] [INFO ] [Nat]Absence check using state equation in 220 ms returned sat
[2025-05-31 08:13:45] [INFO ] [Nat]Added 94 Read/Feed constraints in 88 ms returned sat
[2025-05-31 08:13:45] [INFO ] Computed and/alt/rep : 146/657/146 causal constraints (skipped 347 transitions) in 68 ms.
[2025-05-31 08:13:46] [INFO ] Deduced a trap composed of 27 places in 267 ms of which 4 ms to minimize.
[2025-05-31 08:13:46] [INFO ] Deduced a trap composed of 25 places in 244 ms of which 3 ms to minimize.
[2025-05-31 08:13:46] [INFO ] Deduced a trap composed of 35 places in 61 ms of which 1 ms to minimize.
[2025-05-31 08:13:46] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 747 ms
[2025-05-31 08:13:46] [INFO ] Added : 9 causal constraints over 4 iterations in 1104 ms. Result :sat
Minimization took 344 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 173 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p528) removed 3 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 173/173 places, 509/509 transitions.
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 172 transition count 507
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 171 transition count 506
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 170 transition count 505
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 5 place count 169 transition count 502
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 169 transition count 502
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 168 transition count 502
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 9 place count 168 transition count 502
Applied a total of 9 rules in 40 ms. Remains 168 /173 variables (removed 5) and now considering 502/509 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 168/173 places, 502/509 transitions.
[2025-05-31 08:13:47] [INFO ] Flow matrix only has 491 transitions (discarded 11 similar events)
// Phase 1: matrix 491 rows 168 cols
[2025-05-31 08:13:47] [INFO ] Computed 10 invariants in 20 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (34192 resets) in 2519 ms. (396 steps per ms)
FORMULA FireWire-PT-20-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000000 steps (6822 resets) in 650 ms. (1536 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
[2025-05-31 08:13:50] [INFO ] Flatten gal took : 23 ms
[2025-05-31 08:13:50] [INFO ] Flatten gal took : 22 ms
[2025-05-31 08:13:50] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7688802039471705052.gal : 6 ms
[2025-05-31 08:13:50] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2659576918720786020.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/ReachabilityCardinality7688802039471705052.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2659576918720786020.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
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 ...328
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for FireWire-PT-20-UpperBounds-10 in 5763 ms.
Starting property specific reduction for FireWire-PT-20-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:[1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1]
[2025-05-31 08:13:50] [INFO ] Flow matrix only has 501 transitions (discarded 11 similar events)
// Phase 1: matrix 501 rows 173 cols
[2025-05-31 08:13:50] [INFO ] Computed 10 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (332 resets) in 24 ms. (400 steps per ms)
BEST_FIRST walk for 10001 steps (60 resets) in 9 ms. (1000 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2025-05-31 08:13:50] [INFO ] Flow matrix only has 501 transitions (discarded 11 similar events)
[2025-05-31 08:13:50] [INFO ] Invariant cache hit.
[2025-05-31 08:13:50] [INFO ] [Real]Absence check using 10 positive place invariants in 7 ms returned sat
[2025-05-31 08:13:50] [INFO ] [Real]Absence check using state equation in 182 ms returned sat
[2025-05-31 08:13:50] [INFO ] State equation strengthened by 94 read => feed constraints.
[2025-05-31 08:13:50] [INFO ] [Real]Added 94 Read/Feed constraints in 43 ms returned sat
[2025-05-31 08:13:51] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 08:13:51] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2025-05-31 08:13:51] [INFO ] [Nat]Absence check using state equation in 153 ms returned sat
[2025-05-31 08:13:51] [INFO ] [Nat]Added 94 Read/Feed constraints in 75 ms returned sat
[2025-05-31 08:13:51] [INFO ] Computed and/alt/rep : 146/657/146 causal constraints (skipped 347 transitions) in 46 ms.
[2025-05-31 08:13:51] [INFO ] Deduced a trap composed of 35 places in 244 ms of which 7 ms to minimize.
[2025-05-31 08:13:52] [INFO ] Deduced a trap composed of 28 places in 220 ms of which 2 ms to minimize.
[2025-05-31 08:13:52] [INFO ] Deduced a trap composed of 35 places in 222 ms of which 3 ms to minimize.
[2025-05-31 08:13:52] [INFO ] Deduced a trap composed of 25 places in 226 ms of which 2 ms to minimize.
[2025-05-31 08:13:52] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1115 ms
[2025-05-31 08:13:52] [INFO ] Added : 29 causal constraints over 9 iterations in 1642 ms. Result :sat
Minimization took 221 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 173 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p531) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 173/173 places, 511/511 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 172 transition count 510
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 172 transition count 510
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 2 place count 172 transition count 509
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 171 transition count 509
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 170 transition count 507
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 170 transition count 507
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 169 transition count 507
Applied a total of 8 rules in 29 ms. Remains 169 /173 variables (removed 4) and now considering 507/511 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 169/173 places, 507/511 transitions.
[2025-05-31 08:13:53] [INFO ] Flow matrix only has 496 transitions (discarded 11 similar events)
// Phase 1: matrix 496 rows 169 cols
[2025-05-31 08:13:53] [INFO ] Computed 10 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (33184 resets) in 2413 ms. (414 steps per ms)
FORMULA FireWire-PT-20-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (6509 resets) in 636 ms. (1569 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
[2025-05-31 08:13:56] [INFO ] Flatten gal took : 22 ms
[2025-05-31 08:13:56] [INFO ] Flatten gal took : 21 ms
[2025-05-31 08:13:56] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7381918058422845215.gal : 6 ms
[2025-05-31 08:13:56] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2667952644861588030.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/ReachabilityCardinality7381918058422845215.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2667952644861588030.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.

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 ...328
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for FireWire-PT-20-UpperBounds-14 in 5799 ms.
[2025-05-31 08:13:56] [INFO ] Flatten gal took : 19 ms
[2025-05-31 08:13:56] [INFO ] Applying decomposition
[2025-05-31 08:13:56] [INFO ] Flatten gal took : 20 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/graph12915333158143760121.txt' '-o' '/tmp/graph12915333158143760121.bin' '-w' '/tmp/graph12915333158143760121.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12915333158143760121.bin' '-l' '-1' '-v' '-w' '/tmp/graph12915333158143760121.weights' '-q' '0' '-e' '0.001'
[2025-05-31 08:13:56] [INFO ] Decomposing Gal with order
[2025-05-31 08:13:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 08:13:56] [INFO ] Removed a total of 761 redundant transitions.
[2025-05-31 08:13:56] [INFO ] Flatten gal took : 52 ms
[2025-05-31 08:13:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 237 labels/synchronizations in 21 ms.
[2025-05-31 08:13:56] [INFO ] Time to serialize gal into /tmp/UpperBounds9876361466529751987.gal : 12 ms
[2025-05-31 08:13:56] [INFO ] Time to serialize properties into /tmp/UpperBounds13517333416804295349.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/UpperBounds9876361466529751987.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds13517333416804295349.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 ...284
Loading property file /tmp/UpperBounds13517333416804295349.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,5.3201e+10,139.409,2170340,7722,306,3.25075e+06,6982,903,8.77207e+06,251,52020,0
Total reachable state count : 53200986738

Verifying 1 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property FireWire-PT-20-UpperBounds-04 :0 <= i0.i1.u41.p526 <= 1
FORMULA FireWire-PT-20-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
FireWire-PT-20-UpperBounds-04,0,141.536,2170340,1,0,3.25075e+06,6982,1161,8.77207e+06,279,52020,1724
Total runtime 563775 ms.

BK_STOP 1748679378573

--------------------
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="FireWire-PT-20"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2024"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool gold2024"
echo " Input is FireWire-PT-20, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r097-smll-174860111800050"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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