Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 15:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:21 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.4K Apr 13 08:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 68K Apr 13 08:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Apr 13 08:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 45K Apr 13 08:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:45 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:45 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 726K May 18 16:42 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717182862110

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FlexibleBarrier-PT-14b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 19:14:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-31 19:14:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 19:14:23] [INFO ] Load time of PNML (sax parser for PT used): 167 ms
[2024-05-31 19:14:23] [INFO ] Transformed 2678 places.
[2024-05-31 19:14:23] [INFO ] Transformed 3085 transitions.
[2024-05-31 19:14:23] [INFO ] Found NUPN structural information;
[2024-05-31 19:14:23] [INFO ] Parsed PT model containing 2678 places and 3085 transitions and 7733 arcs in 286 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 9 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 3085 rows 2678 cols
[2024-05-31 19:14:23] [INFO ] Computed 16 invariants in 95 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 (101 resets) in 74 ms. (133 steps per ms)
FORMULA FlexibleBarrier-PT-14b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-14b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-14b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-14b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-14b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-14b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-14b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 90009 steps (82 resets) in 96 ms. (927 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-31 19:14:23] [INFO ] Invariant cache hit.
[2024-05-31 19:14:24] [INFO ] [Real]Absence check using 16 positive place invariants in 59 ms returned sat
[2024-05-31 19:14:25] [INFO ] [Real]Absence check using state equation in 1066 ms returned sat
[2024-05-31 19:14:26] [INFO ] Deduced a trap composed of 82 places in 346 ms of which 43 ms to minimize.
[2024-05-31 19:14:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 19:14:27] [INFO ] [Nat]Absence check using 16 positive place invariants in 64 ms returned sat
[2024-05-31 19:14:28] [INFO ] [Nat]Absence check using state equation in 1053 ms returned sat
[2024-05-31 19:14:28] [INFO ] Deduced a trap composed of 82 places in 265 ms of which 8 ms to minimize.
[2024-05-31 19:14:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 508 ms
[2024-05-31 19:14:28] [INFO ] Computed and/alt/rep : 2839/4489/2839 causal constraints (skipped 245 transitions) in 195 ms.
[2024-05-31 19:14:31] [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 0
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)
[2024-05-31 19:14:32] [INFO ] [Real]Absence check using 16 positive place invariants in 59 ms returned sat
[2024-05-31 19:14:33] [INFO ] [Real]Absence check using state equation in 984 ms returned sat
[2024-05-31 19:14:33] [INFO ] Deduced a trap composed of 268 places in 169 ms of which 4 ms to minimize.
[2024-05-31 19:14:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 19:14:33] [INFO ] [Nat]Absence check using 16 positive place invariants in 58 ms returned sat
[2024-05-31 19:14:34] [INFO ] [Nat]Absence check using state equation in 974 ms returned sat
[2024-05-31 19:14:35] [INFO ] Deduced a trap composed of 268 places in 169 ms of which 4 ms to minimize.
[2024-05-31 19:14:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 352 ms
[2024-05-31 19:14:35] [INFO ] Computed and/alt/rep : 2839/4489/2839 causal constraints (skipped 245 transitions) in 200 ms.
Maximisation of solution failed !
Minimization took 1 ms.
[2024-05-31 19:14:39] [INFO ] [Real]Absence check using 16 positive place invariants in 59 ms returned sat
[2024-05-31 19:14:40] [INFO ] [Real]Absence check using state equation in 1107 ms returned sat
[2024-05-31 19:14:40] [INFO ] Deduced a trap composed of 26 places in 213 ms of which 4 ms to minimize.
[2024-05-31 19:14:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 19:14:41] [INFO ] [Nat]Absence check using 16 positive place invariants in 61 ms returned sat
[2024-05-31 19:14:42] [INFO ] [Nat]Absence check using state equation in 1082 ms returned sat
[2024-05-31 19:14:42] [INFO ] Deduced a trap composed of 26 places in 216 ms of which 4 ms to minimize.
[2024-05-31 19:14:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 418 ms
[2024-05-31 19:14:42] [INFO ] Computed and/alt/rep : 2839/4489/2839 causal constraints (skipped 245 transitions) in 165 ms.
[2024-05-31 19:14:45] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java: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)
[2024-05-31 19:14:46] [INFO ] [Real]Absence check using 16 positive place invariants in 59 ms returned sat
[2024-05-31 19:14:47] [INFO ] [Real]Absence check using state equation in 1022 ms returned sat
[2024-05-31 19:14:48] [INFO ] Deduced a trap composed of 933 places in 1346 ms of which 15 ms to minimize.
[2024-05-31 19:14:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 19:14:49] [INFO ] [Nat]Absence check using 16 positive place invariants in 55 ms returned sat
[2024-05-31 19:14:50] [INFO ] [Nat]Absence check using state equation in 945 ms returned sat
[2024-05-31 19:14:51] [INFO ] Deduced a trap composed of 933 places in 1248 ms of which 13 ms to minimize.
[2024-05-31 19:14:52] [INFO ] Deduced a trap composed of 255 places in 1161 ms of which 13 ms to minimize.
[2024-05-31 19:14:54] [INFO ] Deduced a trap composed of 269 places in 1148 ms of which 12 ms to minimize.
[2024-05-31 19:14:54] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 3
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-31 19:14:54] [INFO ] [Real]Absence check using 16 positive place invariants in 60 ms returned sat
[2024-05-31 19:14:55] [INFO ] [Real]Absence check using state equation in 1040 ms returned sat
[2024-05-31 19:14:56] [INFO ] Deduced a trap composed of 268 places in 296 ms of which 5 ms to minimize.
[2024-05-31 19:14:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 19:14:56] [INFO ] [Nat]Absence check using 16 positive place invariants in 56 ms returned sat
[2024-05-31 19:14:57] [INFO ] [Nat]Absence check using state equation in 1002 ms returned sat
[2024-05-31 19:14:58] [INFO ] Deduced a trap composed of 268 places in 280 ms of which 6 ms to minimize.
[2024-05-31 19:14:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 486 ms
[2024-05-31 19:14:58] [INFO ] Computed and/alt/rep : 2839/4489/2839 causal constraints (skipped 245 transitions) in 168 ms.
[2024-05-31 19:15:01] [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 4
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)
[2024-05-31 19:15:01] [INFO ] [Real]Absence check using 16 positive place invariants in 55 ms returned sat
[2024-05-31 19:15:02] [INFO ] [Real]Absence check using state equation in 1021 ms returned sat
[2024-05-31 19:15:03] [INFO ] Deduced a trap composed of 82 places in 294 ms of which 5 ms to minimize.
[2024-05-31 19:15:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 19:15:03] [INFO ] [Nat]Absence check using 16 positive place invariants in 57 ms returned sat
[2024-05-31 19:15:04] [INFO ] [Nat]Absence check using state equation in 1024 ms returned sat
[2024-05-31 19:15:05] [INFO ] Deduced a trap composed of 82 places in 290 ms of which 6 ms to minimize.
[2024-05-31 19:15:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 496 ms
[2024-05-31 19:15:05] [INFO ] Computed and/alt/rep : 2839/4489/2839 causal constraints (skipped 245 transitions) in 174 ms.
Maximisation of solution failed !
Minimization took 0 ms.
[2024-05-31 19:15:08] [INFO ] [Real]Absence check using 16 positive place invariants in 58 ms returned sat
[2024-05-31 19:15:10] [INFO ] [Real]Absence check using state equation in 1105 ms returned sat
[2024-05-31 19:15:10] [INFO ] Computed and/alt/rep : 2839/4489/2839 causal constraints (skipped 245 transitions) in 170 ms.
[2024-05-31 19:15:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 19:15:11] [INFO ] [Nat]Absence check using 16 positive place invariants in 62 ms returned sat
[2024-05-31 19:15:12] [INFO ] [Nat]Absence check using state equation in 1186 ms returned sat
[2024-05-31 19:15:12] [INFO ] Computed and/alt/rep : 2839/4489/2839 causal constraints (skipped 245 transitions) in 145 ms.
Maximisation of solution failed !
Minimization took 0 ms.
[2024-05-31 19:15:16] [INFO ] [Real]Absence check using 16 positive place invariants in 58 ms returned sat
[2024-05-31 19:15:17] [INFO ] [Real]Absence check using state equation in 1040 ms returned sat
[2024-05-31 19:15:17] [INFO ] Deduced a trap composed of 94 places in 175 ms of which 4 ms to minimize.
[2024-05-31 19:15:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 19:15:18] [INFO ] [Nat]Absence check using 16 positive place invariants in 60 ms returned sat
[2024-05-31 19:15:19] [INFO ] [Nat]Absence check using state equation in 986 ms returned sat
[2024-05-31 19:15:19] [INFO ] Deduced a trap composed of 94 places in 183 ms of which 3 ms to minimize.
[2024-05-31 19:15:19] [INFO ] Deduced a trap composed of 146 places in 157 ms of which 4 ms to minimize.
[2024-05-31 19:15:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 614 ms
[2024-05-31 19:15:20] [INFO ] Computed and/alt/rep : 2839/4489/2839 causal constraints (skipped 245 transitions) in 160 ms.
Maximisation of solution failed !
Minimization took 0 ms.
[2024-05-31 19:15:23] [INFO ] [Real]Absence check using 16 positive place invariants in 57 ms returned sat
[2024-05-31 19:15:24] [INFO ] [Real]Absence check using state equation in 1062 ms returned sat
[2024-05-31 19:15:24] [INFO ] Deduced a trap composed of 385 places in 223 ms of which 4 ms to minimize.
[2024-05-31 19:15:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 19:15:25] [INFO ] [Nat]Absence check using 16 positive place invariants in 60 ms returned sat
[2024-05-31 19:15:26] [INFO ] [Nat]Absence check using state equation in 1009 ms returned sat
[2024-05-31 19:15:26] [INFO ] Deduced a trap composed of 385 places in 225 ms of which 5 ms to minimize.
[2024-05-31 19:15:26] [INFO ] Deduced a trap composed of 268 places in 168 ms of which 3 ms to minimize.
[2024-05-31 19:15:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 679 ms
[2024-05-31 19:15:27] [INFO ] Computed and/alt/rep : 2839/4489/2839 causal constraints (skipped 245 transitions) in 161 ms.
[2024-05-31 19:15:29] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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)
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[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] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1]
Support contains 9 out of 2678 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2678/2678 places, 3085/3085 transitions.
Graph (trivial) has 2619 edges and 2678 vertex of which 86 / 2678 are part of one of the 14 SCC in 10 ms
Free SCC test removed 72 places
Drop transitions (Empty/Sink Transition effects.) removed 87 transitions
Reduce isomorphic transitions removed 87 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 662 transitions
Trivial Post-agglo rules discarded 662 transitions
Performed 662 trivial Post agglomeration. Transition count delta: 662
Iterating post reduction 0 with 662 rules applied. Total rules applied 663 place count 2606 transition count 2336
Reduce places removed 662 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 665 rules applied. Total rules applied 1328 place count 1944 transition count 2333
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 1331 place count 1941 transition count 2333
Performed 175 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 175 Pre rules applied. Total rules applied 1331 place count 1941 transition count 2158
Deduced a syphon composed of 175 places in 3 ms
Reduce places removed 175 places and 0 transitions.
Iterating global reduction 3 with 350 rules applied. Total rules applied 1681 place count 1766 transition count 2158
Discarding 1041 places :
Symmetric choice reduction at 3 with 1041 rule applications. Total rules 2722 place count 725 transition count 1117
Iterating global reduction 3 with 1041 rules applied. Total rules applied 3763 place count 725 transition count 1117
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 3763 place count 725 transition count 1103
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 3791 place count 711 transition count 1103
Discarding 167 places :
Symmetric choice reduction at 3 with 167 rule applications. Total rules 3958 place count 544 transition count 936
Iterating global reduction 3 with 167 rules applied. Total rules applied 4125 place count 544 transition count 936
Ensure Unique test removed 163 transitions
Reduce isomorphic transitions removed 163 transitions.
Iterating post reduction 3 with 163 rules applied. Total rules applied 4288 place count 544 transition count 773
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 0 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 4 with 144 rules applied. Total rules applied 4432 place count 472 transition count 701
Drop transitions (Empty/Sink Transition effects.) removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 4 with 28 rules applied. Total rules applied 4460 place count 472 transition count 673
Discarding 14 places :
Symmetric choice reduction at 5 with 14 rule applications. Total rules 4474 place count 458 transition count 659
Iterating global reduction 5 with 14 rules applied. Total rules applied 4488 place count 458 transition count 659
Free-agglomeration rule applied 372 times.
Iterating global reduction 5 with 372 rules applied. Total rules applied 4860 place count 458 transition count 287
Reduce places removed 372 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 167 transitions
Reduce isomorphic transitions removed 167 transitions.
Graph (complete) has 234 edges and 86 vertex of which 71 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.0 ms
Discarding 15 places :
Also discarding 0 output transitions
Iterating post reduction 5 with 540 rules applied. Total rules applied 5400 place count 71 transition count 120
Drop transitions (Empty/Sink Transition effects.) removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 6 with 21 rules applied. Total rules applied 5421 place count 71 transition count 99
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 5422 place count 71 transition count 99
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 5423 place count 70 transition count 98
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 55 edges and 69 vertex of which 22 / 69 are part of one of the 11 SCC in 0 ms
Free SCC test removed 11 places
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 7 with 3 rules applied. Total rules applied 5426 place count 58 transition count 97
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 8 with 23 rules applied. Total rules applied 5449 place count 57 transition count 75
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 10 Pre rules applied. Total rules applied 5449 place count 57 transition count 65
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 9 with 20 rules applied. Total rules applied 5469 place count 47 transition count 65
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 9 with 10 rules applied. Total rules applied 5479 place count 47 transition count 55
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 10 with 20 rules applied. Total rules applied 5499 place count 37 transition count 45
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 10 with 2 rules applied. Total rules applied 5501 place count 36 transition count 44
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 5502 place count 36 transition count 43
Free-agglomeration rule applied 10 times.
Iterating global reduction 10 with 10 rules applied. Total rules applied 5512 place count 36 transition count 33
Reduce places removed 16 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 10 with 26 rules applied. Total rules applied 5538 place count 20 transition count 23
Free-agglomeration rule applied 1 times.
Iterating global reduction 11 with 1 rules applied. Total rules applied 5539 place count 20 transition count 22
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 5540 place count 19 transition count 22
Applied a total of 5540 rules in 536 ms. Remains 19 /2678 variables (removed 2659) and now considering 22/3085 (removed 3063) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 546 ms. Remains : 19/2678 places, 22/3085 transitions.
// Phase 1: matrix 22 rows 19 cols
[2024-05-31 19:15:30] [INFO ] Computed 6 invariants in 0 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (2 resets) in 912 ms. (1095 steps per ms)
FORMULA FlexibleBarrier-PT-14b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-14b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-14b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-14b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-14b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-14b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-14b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-14b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-14b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (2 resets) in 241 ms. (4132 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 )
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 68436 ms.
ITS solved all properties within timeout

BK_STOP 1717182931740

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is FlexibleBarrier-PT-14b, 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 r496-tall-171640602600093"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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