Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r041-tajo-167813695100758.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is CANInsertWithFailure-PT-070, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r041-tajo-167813695100758
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 30M
-rw-r--r-- 1 mcc users 7.2K Feb 26 00:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 57K Feb 26 00:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Feb 26 00:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Feb 26 00:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.0K Feb 25 15:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 15:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Feb 25 15:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 00:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 106K Feb 26 00:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Feb 26 00:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 26 00:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 15:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Feb 25 15:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 30M Mar 5 18:22 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 CANInsertWithFailure-PT-070-ReachabilityCardinality-00
FORMULA_NAME CANInsertWithFailure-PT-070-ReachabilityCardinality-01
FORMULA_NAME CANInsertWithFailure-PT-070-ReachabilityCardinality-02
FORMULA_NAME CANInsertWithFailure-PT-070-ReachabilityCardinality-03
FORMULA_NAME CANInsertWithFailure-PT-070-ReachabilityCardinality-04
FORMULA_NAME CANInsertWithFailure-PT-070-ReachabilityCardinality-05
FORMULA_NAME CANInsertWithFailure-PT-070-ReachabilityCardinality-06
FORMULA_NAME CANInsertWithFailure-PT-070-ReachabilityCardinality-07
FORMULA_NAME CANInsertWithFailure-PT-070-ReachabilityCardinality-08
FORMULA_NAME CANInsertWithFailure-PT-070-ReachabilityCardinality-09
FORMULA_NAME CANInsertWithFailure-PT-070-ReachabilityCardinality-10
FORMULA_NAME CANInsertWithFailure-PT-070-ReachabilityCardinality-11
FORMULA_NAME CANInsertWithFailure-PT-070-ReachabilityCardinality-12
FORMULA_NAME CANInsertWithFailure-PT-070-ReachabilityCardinality-13
FORMULA_NAME CANInsertWithFailure-PT-070-ReachabilityCardinality-14
FORMULA_NAME CANInsertWithFailure-PT-070-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678664656616

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=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANInsertWithFailure-PT-070
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 23:44:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-12 23:44:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 23:44:18] [INFO ] Load time of PNML (sax parser for PT used): 784 ms
[2023-03-12 23:44:18] [INFO ] Transformed 10644 places.
[2023-03-12 23:44:19] [INFO ] Transformed 29820 transitions.
[2023-03-12 23:44:19] [INFO ] Parsed PT model containing 10644 places and 29820 transitions and 79800 arcs in 956 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 32 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 6 resets, run finished after 646 ms. (steps per millisecond=15 ) properties (out of 16) seen :1
FORMULA CANInsertWithFailure-PT-070-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Interrupted probabilistic random walk after 96973 steps, run timeout after 3001 ms. (steps per millisecond=32 ) properties seen :{2=1}
Probabilistic random walk after 96973 steps, saw 94557 distinct states, run finished after 3002 ms. (steps per millisecond=32 ) properties seen :1
FORMULA CANInsertWithFailure-PT-070-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 14 properties.
// Phase 1: matrix 29820 rows 10644 cols
[2023-03-12 23:44:28] [INFO ] Computed 73 place invariants in 4964 ms
[2023-03-12 23:44:31] [INFO ] [Real]Absence check using 71 positive place invariants in 126 ms returned sat
[2023-03-12 23:44:32] [INFO ] [Real]Absence check using 71 positive and 2 generalized place invariants in 230 ms returned sat
[2023-03-12 23:44:32] [INFO ] After 4111ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2023-03-12 23:44:35] [INFO ] [Nat]Absence check using 71 positive place invariants in 169 ms returned sat
[2023-03-12 23:44:36] [INFO ] [Nat]Absence check using 71 positive and 2 generalized place invariants in 246 ms returned sat
[2023-03-12 23:44:57] [INFO ] After 18625ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :13
[2023-03-12 23:44:57] [INFO ] State equation strengthened by 9730 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-12 23:44:57] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-12 23:44:57] [INFO ] After 25182ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:14
Fused 14 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 218 out of 10644 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10644/10644 places, 29820/29820 transitions.
Graph (complete) has 40251 edges and 10644 vertex of which 10643 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.59 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 451 transitions
Trivial Post-agglo rules discarded 451 transitions
Performed 451 trivial Post agglomeration. Transition count delta: 451
Iterating post reduction 0 with 451 rules applied. Total rules applied 452 place count 10643 transition count 29369
Reduce places removed 451 places and 0 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Iterating post reduction 1 with 462 rules applied. Total rules applied 914 place count 10192 transition count 29358
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 925 place count 10181 transition count 29358
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 925 place count 10181 transition count 29348
Deduced a syphon composed of 10 places in 23 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 945 place count 10171 transition count 29348
Performed 4322 Post agglomeration using F-continuation condition.Transition count delta: 4322
Deduced a syphon composed of 4322 places in 32 ms
Reduce places removed 4322 places and 0 transitions.
Iterating global reduction 3 with 8644 rules applied. Total rules applied 9589 place count 5849 transition count 25026
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 9595 place count 5849 transition count 25020
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 9601 place count 5843 transition count 25020
Partial Free-agglomeration rule applied 5538 times.
Drop transitions removed 5538 transitions
Iterating global reduction 4 with 5538 rules applied. Total rules applied 15139 place count 5843 transition count 25020
Partial Free-agglomeration rule applied 676 times.
Drop transitions removed 676 transitions
Iterating global reduction 4 with 676 rules applied. Total rules applied 15815 place count 5843 transition count 25020
Applied a total of 15815 rules in 8831 ms. Remains 5843 /10644 variables (removed 4801) and now considering 25020/29820 (removed 4800) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8835 ms. Remains : 5843/10644 places, 25020/29820 transitions.
Incomplete random walk after 10000 steps, including 20 resets, run finished after 856 ms. (steps per millisecond=11 ) properties (out of 14) seen :4
FORMULA CANInsertWithFailure-PT-070-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-070-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-070-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-070-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
[2023-03-12 23:45:07] [INFO ] Flow matrix only has 24940 transitions (discarded 80 similar events)
// Phase 1: matrix 24940 rows 5843 cols
[2023-03-12 23:45:08] [INFO ] Computed 72 place invariants in 1447 ms
[2023-03-12 23:45:10] [INFO ] [Real]Absence check using 70 positive place invariants in 89 ms returned sat
[2023-03-12 23:45:10] [INFO ] [Real]Absence check using 70 positive and 2 generalized place invariants in 100 ms returned sat
[2023-03-12 23:45:10] [INFO ] After 1850ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-12 23:45:12] [INFO ] [Nat]Absence check using 70 positive place invariants in 63 ms returned sat
[2023-03-12 23:45:12] [INFO ] [Nat]Absence check using 70 positive and 2 generalized place invariants in 96 ms returned sat
[2023-03-12 23:45:28] [INFO ] After 15521ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-12 23:45:28] [INFO ] State equation strengthened by 22456 read => feed constraints.
[2023-03-12 23:45:35] [INFO ] After 6938ms SMT Verify possible using 22456 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2023-03-12 23:45:35] [INFO ] After 6941ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 18 ms.
[2023-03-12 23:45:35] [INFO ] After 25085ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Fused 10 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 22 ms.
Support contains 163 out of 5843 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5843/5843 places, 25020/25020 transitions.
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 9 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 0 with 60 rules applied. Total rules applied 60 place count 5813 transition count 24990
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 61 place count 5813 transition count 24989
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 62 place count 5812 transition count 24989
Partial Free-agglomeration rule applied 302 times.
Drop transitions removed 302 transitions
Iterating global reduction 1 with 302 rules applied. Total rules applied 364 place count 5812 transition count 24989
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 365 place count 5812 transition count 24989
Applied a total of 365 rules in 5216 ms. Remains 5812 /5843 variables (removed 31) and now considering 24989/25020 (removed 31) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5216 ms. Remains : 5812/5843 places, 24989/25020 transitions.
Incomplete random walk after 10000 steps, including 20 resets, run finished after 559 ms. (steps per millisecond=17 ) properties (out of 10) seen :1
FORMULA CANInsertWithFailure-PT-070-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
[2023-03-12 23:45:41] [INFO ] Flow matrix only has 24927 transitions (discarded 62 similar events)
// Phase 1: matrix 24927 rows 5812 cols
[2023-03-12 23:45:43] [INFO ] Computed 72 place invariants in 1359 ms
[2023-03-12 23:45:44] [INFO ] After 1246ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-12 23:45:46] [INFO ] [Nat]Absence check using 70 positive place invariants in 92 ms returned sat
[2023-03-12 23:45:46] [INFO ] [Nat]Absence check using 70 positive and 2 generalized place invariants in 102 ms returned sat
[2023-03-12 23:45:59] [INFO ] After 13037ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-12 23:46:00] [INFO ] State equation strengthened by 23122 read => feed constraints.
[2023-03-12 23:46:09] [INFO ] After 9406ms SMT Verify possible using 23122 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-03-12 23:46:09] [INFO ] After 9410ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-03-12 23:46:09] [INFO ] After 25056ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Fused 9 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 30 ms.
Support contains 162 out of 5812 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5812/5812 places, 24989/24989 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 5811 transition count 24988
Applied a total of 2 rules in 2197 ms. Remains 5811 /5812 variables (removed 1) and now considering 24988/24989 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2197 ms. Remains : 5811/5812 places, 24988/24989 transitions.
Incomplete random walk after 10000 steps, including 21 resets, run finished after 485 ms. (steps per millisecond=20 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 9) seen :0
Interrupted probabilistic random walk after 103833 steps, run timeout after 3001 ms. (steps per millisecond=34 ) properties seen :{}
Probabilistic random walk after 103833 steps, saw 96703 distinct states, run finished after 3002 ms. (steps per millisecond=34 ) properties seen :0
Running SMT prover for 9 properties.
[2023-03-12 23:46:15] [INFO ] Flow matrix only has 24926 transitions (discarded 62 similar events)
// Phase 1: matrix 24926 rows 5811 cols
[2023-03-12 23:46:17] [INFO ] Computed 72 place invariants in 1628 ms
[2023-03-12 23:46:18] [INFO ] After 1327ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-12 23:46:20] [INFO ] [Nat]Absence check using 70 positive place invariants in 89 ms returned sat
[2023-03-12 23:46:20] [INFO ] [Nat]Absence check using 70 positive and 2 generalized place invariants in 139 ms returned sat
[2023-03-12 23:46:35] [INFO ] After 14245ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-12 23:46:35] [INFO ] State equation strengthened by 23124 read => feed constraints.
[2023-03-12 23:46:43] [INFO ] After 7866ms SMT Verify possible using 23124 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2023-03-12 23:46:43] [INFO ] After 7866ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-12 23:46:43] [INFO ] After 25036ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Fused 9 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 5 ms.
Support contains 162 out of 5811 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5811/5811 places, 24988/24988 transitions.
Applied a total of 0 rules in 941 ms. Remains 5811 /5811 variables (removed 0) and now considering 24988/24988 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 941 ms. Remains : 5811/5811 places, 24988/24988 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5811/5811 places, 24988/24988 transitions.
Applied a total of 0 rules in 965 ms. Remains 5811 /5811 variables (removed 0) and now considering 24988/24988 (removed 0) transitions.
[2023-03-12 23:46:45] [INFO ] Flow matrix only has 24926 transitions (discarded 62 similar events)
[2023-03-12 23:46:45] [INFO ] Invariant cache hit.
[2023-03-12 23:46:49] [INFO ] Implicit Places using invariants in 4060 ms returned []
Implicit Place search using SMT only with invariants took 4074 ms to find 0 implicit places.
[2023-03-12 23:46:49] [INFO ] Flow matrix only has 24926 transitions (discarded 62 similar events)
[2023-03-12 23:46:49] [INFO ] Invariant cache hit.
[2023-03-12 23:47:01] [INFO ] Dead Transitions using invariants and state equation in 12027 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17070 ms. Remains : 5811/5811 places, 24988/24988 transitions.
Graph (trivial) has 22375 edges and 5811 vertex of which 4427 / 5811 are part of one of the 2 SCC in 7 ms
Free SCC test removed 4425 places
Drop transitions removed 15236 transitions
Ensure Unique test removed 4721 transitions
Reduce isomorphic transitions removed 19957 transitions.
Graph (complete) has 5564 edges and 1386 vertex of which 1194 are kept as prefixes of interest. Removing 192 places using SCC suffix rule.2 ms
Discarding 192 places :
Also discarding 56 output transitions
Drop transitions removed 56 transitions
Drop transitions removed 923 transitions
Reduce isomorphic transitions removed 923 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 925 rules applied. Total rules applied 927 place count 1194 transition count 4050
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 930 place count 1192 transition count 4049
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 930 place count 1192 transition count 4042
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 944 place count 1185 transition count 4042
Discarding 709 places :
Symmetric choice reduction at 2 with 709 rule applications. Total rules 1653 place count 476 transition count 2040
Iterating global reduction 2 with 709 rules applied. Total rules applied 2362 place count 476 transition count 2040
Ensure Unique test removed 586 transitions
Reduce isomorphic transitions removed 586 transitions.
Iterating post reduction 2 with 586 rules applied. Total rules applied 2948 place count 476 transition count 1454
Discarding 56 places :
Symmetric choice reduction at 3 with 56 rule applications. Total rules 3004 place count 420 transition count 1342
Iterating global reduction 3 with 56 rules applied. Total rules applied 3060 place count 420 transition count 1342
Ensure Unique test removed 56 transitions
Reduce isomorphic transitions removed 56 transitions.
Iterating post reduction 3 with 56 rules applied. Total rules applied 3116 place count 420 transition count 1286
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 3124 place count 416 transition count 1282
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3125 place count 416 transition count 1281
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 5 with 2 rules applied. Total rules applied 3127 place count 415 transition count 1280
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 3130 place count 415 transition count 1277
Drop transitions removed 78 transitions
Redundant transition composition rules discarded 78 transitions
Iterating global reduction 6 with 78 rules applied. Total rules applied 3208 place count 415 transition count 1199
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 6 with 13 rules applied. Total rules applied 3221 place count 415 transition count 1186
Reduce places removed 13 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 7 with 18 rules applied. Total rules applied 3239 place count 402 transition count 1181
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 8 with 5 rules applied. Total rules applied 3244 place count 397 transition count 1181
Discarding 4 places :
Symmetric choice reduction at 9 with 4 rule applications. Total rules 3248 place count 393 transition count 1174
Iterating global reduction 9 with 4 rules applied. Total rules applied 3252 place count 393 transition count 1174
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 9 with 42 rules applied. Total rules applied 3294 place count 372 transition count 1153
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 9 with 20 rules applied. Total rules applied 3314 place count 372 transition count 1133
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 3316 place count 371 transition count 1133
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 3318 place count 371 transition count 1131
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 11 with 9 rules applied. Total rules applied 3327 place count 371 transition count 1122
Free-agglomeration rule applied 97 times with reduction of 4 identical transitions.
Iterating global reduction 11 with 97 rules applied. Total rules applied 3424 place count 371 transition count 1021
Reduce places removed 97 places and 0 transitions.
Ensure Unique test removed 155 transitions
Reduce isomorphic transitions removed 155 transitions.
Iterating post reduction 11 with 252 rules applied. Total rules applied 3676 place count 274 transition count 866
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 12 with 12 rules applied. Total rules applied 3688 place count 274 transition count 854
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 12 with 7 rules applied. Total rules applied 3695 place count 274 transition count 854
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 12 with 20 rules applied. Total rules applied 3715 place count 267 transition count 841
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 3716 place count 267 transition count 840
Partial Free-agglomeration rule applied 107 times.
Drop transitions removed 107 transitions
Iterating global reduction 13 with 107 rules applied. Total rules applied 3823 place count 267 transition count 840
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 13 with 33 rules applied. Total rules applied 3856 place count 267 transition count 807
Discarding 6 places :
Symmetric choice reduction at 14 with 6 rule applications. Total rules 3862 place count 261 transition count 796
Iterating global reduction 14 with 6 rules applied. Total rules applied 3868 place count 261 transition count 796
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 14 with 2 rules applied. Total rules applied 3870 place count 261 transition count 794
Reduce places removed 5 places and 5 transitions.
Iterating global reduction 15 with 5 rules applied. Total rules applied 3875 place count 256 transition count 789
Applied a total of 3875 rules in 1462 ms. Remains 256 /5811 variables (removed 5555) and now considering 789/24988 (removed 24199) transitions.
Running SMT prover for 9 properties.
// Phase 1: matrix 789 rows 256 cols
[2023-03-12 23:47:03] [INFO ] Computed 9 place invariants in 2 ms
[2023-03-12 23:47:03] [INFO ] After 203ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-12 23:47:03] [INFO ] [Nat]Absence check using 9 positive place invariants in 1 ms returned sat
[2023-03-12 23:47:03] [INFO ] After 309ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-12 23:47:04] [INFO ] After 632ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 258 ms.
[2023-03-12 23:47:04] [INFO ] After 979ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
[2023-03-12 23:47:04] [INFO ] Export to MCC of 9 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 8 ms.
[2023-03-12 23:47:04] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 5811 places, 24988 transitions and 98185 arcs took 126 ms.
[2023-03-12 23:47:05] [INFO ] Flatten gal took : 811 ms
Total runtime 167690 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 --invariant=/tmp/530/inv_0_ --invariant=/tmp/530/inv_1_ --invariant=/tmp/530/inv_2_ --invariant=/tmp/530/inv_3_ --invariant=/tmp/530/inv_4_ --invariant=/tmp/530/inv_5_ --invariant=/tmp/530/inv_6_ --invariant=/tmp/530/inv_7_ --invariant=/tmp/530/inv_8_ --inv-par
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 1380032 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16046132 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 ReachabilityCardinality -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="CANInsertWithFailure-PT-070"
export BK_EXAMINATION="ReachabilityCardinality"
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 CANInsertWithFailure-PT-070, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r041-tajo-167813695100758"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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