Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r297-tall-167873950900751.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is PolyORBNT-PT-S05J80, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r297-tall-167873950900751
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.7M
-rw-r--r-- 1 mcc users 50K Feb 25 23:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 257K Feb 25 23:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 50K Feb 25 23:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 224K Feb 25 23:45 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 27K Feb 25 16:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 90K Feb 25 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 26K Feb 25 16:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 85K Feb 25 16:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 71K Feb 26 00:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 285K Feb 26 00:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 133K Feb 25 23:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 578K Feb 25 23:59 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.1K Feb 25 16:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.8K Feb 25 16:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 1.8M Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679635481235

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-PT-S05J80
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-24 05:24:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-24 05:24:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-24 05:24:43] [INFO ] Load time of PNML (sax parser for PT used): 172 ms
[2023-03-24 05:24:43] [INFO ] Transformed 1189 places.
[2023-03-24 05:24:43] [INFO ] Transformed 2350 transitions.
[2023-03-24 05:24:43] [INFO ] Parsed PT model containing 1189 places and 2350 transitions and 14464 arcs in 276 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 42 ms.
Working with output stream class java.io.PrintStream
[2023-03-24 05:24:43] [INFO ] Reduced 555 identical enabling conditions.
[2023-03-24 05:24:43] [INFO ] Reduced 90 identical enabling conditions.
[2023-03-24 05:24:43] [INFO ] Reduced 555 identical enabling conditions.
[2023-03-24 05:24:43] [INFO ] Reduced 10 identical enabling conditions.
[2023-03-24 05:24:43] [INFO ] Reduced 555 identical enabling conditions.
[2023-03-24 05:24:43] [INFO ] Reduced 90 identical enabling conditions.
Ensure Unique test removed 655 transitions
Reduce redundant transitions removed 655 transitions.
Incomplete random walk after 10000 steps, including 697 resets, run finished after 567 ms. (steps per millisecond=17 ) properties (out of 16) seen :2
FORMULA PolyORBNT-PT-S05J80-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-PT-S05J80-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 248 resets, run finished after 321 ms. (steps per millisecond=31 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 43 resets, run finished after 1454 ms. (steps per millisecond=6 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 256 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 246 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 262 ms. (steps per millisecond=38 ) properties (out of 14) seen :1
FORMULA PolyORBNT-PT-S05J80-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 361 ms. (steps per millisecond=27 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 204 ms. (steps per millisecond=49 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 120 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 105 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 135 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 70 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 97 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 13) seen :0
Running SMT prover for 13 properties.
[2023-03-24 05:24:47] [INFO ] Flow matrix only has 1691 transitions (discarded 4 similar events)
// Phase 1: matrix 1691 rows 1189 cols
[2023-03-24 05:24:47] [INFO ] Computed 182 place invariants in 158 ms
[2023-03-24 05:24:51] [INFO ] [Real]Absence check using 157 positive place invariants in 53 ms returned sat
[2023-03-24 05:24:51] [INFO ] [Real]Absence check using 157 positive and 25 generalized place invariants in 63 ms returned sat
[2023-03-24 05:24:51] [INFO ] After 983ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:12
[2023-03-24 05:24:52] [INFO ] [Nat]Absence check using 157 positive place invariants in 40 ms returned sat
[2023-03-24 05:24:52] [INFO ] [Nat]Absence check using 157 positive and 25 generalized place invariants in 70 ms returned sat
[2023-03-24 05:25:16] [INFO ] After 24096ms SMT Verify possible using state equation in natural domain returned unsat :8 sat :3
[2023-03-24 05:25:16] [INFO ] State equation strengthened by 1 read => feed constraints.
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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
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:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-24 05:25:16] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-24 05:25:16] [INFO ] After 25033ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0 real:12
FORMULA PolyORBNT-PT-S05J80-ReachabilityFireability-09 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBNT-PT-S05J80-ReachabilityFireability-08 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBNT-PT-S05J80-ReachabilityFireability-07 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBNT-PT-S05J80-ReachabilityFireability-06 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBNT-PT-S05J80-ReachabilityFireability-05 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBNT-PT-S05J80-ReachabilityFireability-04 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBNT-PT-S05J80-ReachabilityFireability-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBNT-PT-S05J80-ReachabilityFireability-01 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 13 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 325 out of 1189 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1189/1189 places, 1695/1695 transitions.
Ensure Unique test removed 5 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 1184 transition count 1693
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 10 place count 1182 transition count 1692
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 11 place count 1181 transition count 1692
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 11 place count 1181 transition count 1691
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 13 place count 1180 transition count 1691
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 15 place count 1179 transition count 1690
Applied a total of 15 rules in 350 ms. Remains 1179 /1189 variables (removed 10) and now considering 1690/1695 (removed 5) transitions.
[2023-03-24 05:25:17] [INFO ] Flow matrix only has 1686 transitions (discarded 4 similar events)
// Phase 1: matrix 1686 rows 1179 cols
[2023-03-24 05:25:17] [INFO ] Computed 177 place invariants in 114 ms
[2023-03-24 05:25:20] [INFO ] Dead Transitions using invariants and state equation in 3307 ms found 95 transitions.
Found 95 dead transitions using SMT.
Drop transitions removed 95 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 95 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1179/1189 places, 1595/1695 transitions.
Applied a total of 0 rules in 70 ms. Remains 1179 /1179 variables (removed 0) and now considering 1595/1595 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3736 ms. Remains : 1179/1189 places, 1595/1695 transitions.
Incomplete random walk after 10000 steps, including 607 resets, run finished after 253 ms. (steps per millisecond=39 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 263 resets, run finished after 243 ms. (steps per millisecond=41 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 49 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 49 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 5) seen :1
FORMULA PolyORBNT-PT-S05J80-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 4 properties.
[2023-03-24 05:25:21] [INFO ] Flow matrix only has 1591 transitions (discarded 4 similar events)
// Phase 1: matrix 1591 rows 1179 cols
[2023-03-24 05:25:21] [INFO ] Computed 177 place invariants in 41 ms
[2023-03-24 05:25:21] [INFO ] [Real]Absence check using 156 positive place invariants in 38 ms returned sat
[2023-03-24 05:25:21] [INFO ] [Real]Absence check using 156 positive and 21 generalized place invariants in 55 ms returned sat
[2023-03-24 05:25:22] [INFO ] After 447ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-24 05:25:22] [INFO ] [Nat]Absence check using 156 positive place invariants in 37 ms returned sat
[2023-03-24 05:25:22] [INFO ] [Nat]Absence check using 156 positive and 21 generalized place invariants in 51 ms returned sat
[2023-03-24 05:25:37] [INFO ] After 14766ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2023-03-24 05:25:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 05:25:47] [INFO ] After 9714ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :1 sat :2
[2023-03-24 05:25:47] [INFO ] After 9716ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-24 05:25:47] [INFO ] After 25022ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
FORMULA PolyORBNT-PT-S05J80-ReachabilityFireability-00 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 10 ms.
Support contains 62 out of 1179 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1179/1179 places, 1595/1595 transitions.
Drop transitions removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 0 with 71 rules applied. Total rules applied 71 place count 1179 transition count 1524
Reduce places removed 71 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 72 rules applied. Total rules applied 143 place count 1108 transition count 1523
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 144 place count 1107 transition count 1523
Performed 81 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 81 Pre rules applied. Total rules applied 144 place count 1107 transition count 1442
Deduced a syphon composed of 81 places in 1 ms
Reduce places removed 81 places and 0 transitions.
Iterating global reduction 3 with 162 rules applied. Total rules applied 306 place count 1026 transition count 1442
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 310 place count 1024 transition count 1440
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 311 place count 1024 transition count 1439
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 312 place count 1023 transition count 1439
Applied a total of 312 rules in 258 ms. Remains 1023 /1179 variables (removed 156) and now considering 1439/1595 (removed 156) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 258 ms. Remains : 1023/1179 places, 1439/1595 transitions.
Incomplete random walk after 10000 steps, including 479 resets, run finished after 168 ms. (steps per millisecond=59 ) properties (out of 3) seen :1
FORMULA PolyORBNT-PT-S05J80-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 27 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-24 05:25:47] [INFO ] Flow matrix only has 1435 transitions (discarded 4 similar events)
// Phase 1: matrix 1435 rows 1023 cols
[2023-03-24 05:25:47] [INFO ] Computed 177 place invariants in 52 ms
[2023-03-24 05:25:47] [INFO ] [Real]Absence check using 156 positive place invariants in 34 ms returned sat
[2023-03-24 05:25:48] [INFO ] [Real]Absence check using 156 positive and 21 generalized place invariants in 52 ms returned sat
[2023-03-24 05:25:48] [INFO ] After 345ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-24 05:25:48] [INFO ] [Nat]Absence check using 156 positive place invariants in 36 ms returned sat
[2023-03-24 05:25:48] [INFO ] [Nat]Absence check using 156 positive and 21 generalized place invariants in 44 ms returned sat
[2023-03-24 05:26:00] [INFO ] After 12069ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-24 05:26:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 05:26:03] [INFO ] After 3289ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-24 05:26:07] [INFO ] Deduced a trap composed of 336 places in 502 ms of which 12 ms to minimize.
[2023-03-24 05:26:07] [INFO ] Deduced a trap composed of 330 places in 538 ms of which 1 ms to minimize.
[2023-03-24 05:26:11] [INFO ] Deduced a trap composed of 348 places in 471 ms of which 9 ms to minimize.
[2023-03-24 05:26:11] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 5297 ms
[2023-03-24 05:26:11] [INFO ] After 11326ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.checkResults(DeadlockTester.java:797)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:692)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
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:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-24 05:26:13] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-24 05:26:13] [INFO ] After 25085ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Parikh walk visited 0 properties in 3 ms.
Support contains 60 out of 1023 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1023/1023 places, 1439/1439 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 1023 transition count 1438
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 1022 transition count 1438
Applied a total of 2 rules in 58 ms. Remains 1022 /1023 variables (removed 1) and now considering 1438/1439 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59 ms. Remains : 1022/1023 places, 1438/1439 transitions.
Incomplete random walk after 10000 steps, including 475 resets, run finished after 161 ms. (steps per millisecond=62 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 102092 steps, run timeout after 3001 ms. (steps per millisecond=34 ) properties seen :{}
Probabilistic random walk after 102092 steps, saw 30728 distinct states, run finished after 3002 ms. (steps per millisecond=34 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-24 05:26:16] [INFO ] Flow matrix only has 1434 transitions (discarded 4 similar events)
// Phase 1: matrix 1434 rows 1022 cols
[2023-03-24 05:26:16] [INFO ] Computed 177 place invariants in 32 ms
[2023-03-24 05:26:16] [INFO ] [Real]Absence check using 156 positive place invariants in 36 ms returned sat
[2023-03-24 05:26:16] [INFO ] [Real]Absence check using 156 positive and 21 generalized place invariants in 40 ms returned sat
[2023-03-24 05:26:16] [INFO ] After 282ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-24 05:26:17] [INFO ] [Nat]Absence check using 156 positive place invariants in 33 ms returned sat
[2023-03-24 05:26:17] [INFO ] [Nat]Absence check using 156 positive and 21 generalized place invariants in 50 ms returned sat
[2023-03-24 05:26:30] [INFO ] After 12871ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-24 05:26:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 05:26:31] [INFO ] After 1309ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-24 05:26:40] [INFO ] After 10457ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-24 05:26:40] [INFO ] After 23721ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 3 ms.
Support contains 60 out of 1022 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1022/1022 places, 1438/1438 transitions.
Applied a total of 0 rules in 45 ms. Remains 1022 /1022 variables (removed 0) and now considering 1438/1438 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 1022/1022 places, 1438/1438 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1022/1022 places, 1438/1438 transitions.
Applied a total of 0 rules in 44 ms. Remains 1022 /1022 variables (removed 0) and now considering 1438/1438 (removed 0) transitions.
[2023-03-24 05:26:40] [INFO ] Flow matrix only has 1434 transitions (discarded 4 similar events)
[2023-03-24 05:26:40] [INFO ] Invariant cache hit.
[2023-03-24 05:26:42] [INFO ] Implicit Places using invariants in 2000 ms returned []
[2023-03-24 05:26:42] [INFO ] Flow matrix only has 1434 transitions (discarded 4 similar events)
[2023-03-24 05:26:42] [INFO ] Invariant cache hit.
[2023-03-24 05:26:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 05:27:13] [INFO ] Performed 732/1022 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-24 05:27:22] [INFO ] Implicit Places using invariants and state equation in 39605 ms returned []
Implicit Place search using SMT with State Equation took 41609 ms to find 0 implicit places.
[2023-03-24 05:27:22] [INFO ] Redundant transitions in 87 ms returned []
[2023-03-24 05:27:22] [INFO ] Flow matrix only has 1434 transitions (discarded 4 similar events)
[2023-03-24 05:27:22] [INFO ] Invariant cache hit.
[2023-03-24 05:27:24] [INFO ] Dead Transitions using invariants and state equation in 2079 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43837 ms. Remains : 1022/1022 places, 1438/1438 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 1022 transition count 1434
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 4 place count 1022 transition count 1433
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 6 place count 1021 transition count 1433
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 1021 transition count 1432
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 1020 transition count 1432
Applied a total of 8 rules in 159 ms. Remains 1020 /1022 variables (removed 2) and now considering 1432/1438 (removed 6) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 1432 rows 1020 cols
[2023-03-24 05:27:24] [INFO ] Computed 177 place invariants in 33 ms
[2023-03-24 05:27:24] [INFO ] [Real]Absence check using 156 positive place invariants in 37 ms returned sat
[2023-03-24 05:27:25] [INFO ] [Real]Absence check using 156 positive and 21 generalized place invariants in 44 ms returned sat
[2023-03-24 05:27:25] [INFO ] After 309ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-24 05:27:25] [INFO ] [Nat]Absence check using 156 positive place invariants in 37 ms returned sat
[2023-03-24 05:27:25] [INFO ] [Nat]Absence check using 156 positive and 21 generalized place invariants in 47 ms returned sat
[2023-03-24 05:27:38] [INFO ] After 13605ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-24 05:28:26] [INFO ] After 60776ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-24 05:28:26] [INFO ] After 61123ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
[2023-03-24 05:28:26] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 4 ms.
[2023-03-24 05:28:26] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1022 places, 1438 transitions and 7233 arcs took 9 ms.
[2023-03-24 05:28:26] [INFO ] Flatten gal took : 185 ms
Total runtime 223455 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --inv-bin-par --invariant=/tmp/527/inv_0_ --invariant=/tmp/527/inv_1_ --inv-par
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 14181768 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16094932 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
mcc2023

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="PolyORBNT-PT-S05J80"
export BK_EXAMINATION="ReachabilityFireability"
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-5348"
echo " Executing tool ltsminxred"
echo " Input is PolyORBNT-PT-S05J80, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r297-tall-167873950900751"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-PT-S05J80.tgz
mv PolyORBNT-PT-S05J80 execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;