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-167813695000670.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 CANConstruction-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-167813695000670
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 7.8M
-rw-r--r-- 1 mcc users 11K Feb 25 22:17 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K Feb 25 22:17 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Feb 25 21:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 25 21:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.1K Feb 25 15:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 15:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Feb 25 15:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 25 22:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 107K Feb 25 22:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Feb 25 22:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Feb 25 22:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 15:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Feb 25 15:40 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 7.3M 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 CANConstruction-PT-070-ReachabilityCardinality-00
FORMULA_NAME CANConstruction-PT-070-ReachabilityCardinality-01
FORMULA_NAME CANConstruction-PT-070-ReachabilityCardinality-02
FORMULA_NAME CANConstruction-PT-070-ReachabilityCardinality-03
FORMULA_NAME CANConstruction-PT-070-ReachabilityCardinality-04
FORMULA_NAME CANConstruction-PT-070-ReachabilityCardinality-05
FORMULA_NAME CANConstruction-PT-070-ReachabilityCardinality-06
FORMULA_NAME CANConstruction-PT-070-ReachabilityCardinality-07
FORMULA_NAME CANConstruction-PT-070-ReachabilityCardinality-08
FORMULA_NAME CANConstruction-PT-070-ReachabilityCardinality-09
FORMULA_NAME CANConstruction-PT-070-ReachabilityCardinality-10
FORMULA_NAME CANConstruction-PT-070-ReachabilityCardinality-11
FORMULA_NAME CANConstruction-PT-070-ReachabilityCardinality-12
FORMULA_NAME CANConstruction-PT-070-ReachabilityCardinality-13
FORMULA_NAME CANConstruction-PT-070-ReachabilityCardinality-14
FORMULA_NAME CANConstruction-PT-070-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678655218795

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=CANConstruction-PT-070
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 21:07:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-12 21:07:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 21:07:01] [INFO ] Load time of PNML (sax parser for PT used): 462 ms
[2023-03-12 21:07:01] [INFO ] Transformed 10642 places.
[2023-03-12 21:07:01] [INFO ] Transformed 20160 transitions.
[2023-03-12 21:07:01] [INFO ] Parsed PT model containing 10642 places and 20160 transitions and 60200 arcs in 645 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 22 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 8 resets, run finished after 751 ms. (steps per millisecond=13 ) properties (out of 16) seen :3
FORMULA CANConstruction-PT-070-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-070-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-070-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 13) 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 13) 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 13) 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 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 13) 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 13) 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 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 13) 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 13) 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 13) 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 13) seen :0
Running SMT prover for 13 properties.
// Phase 1: matrix 20160 rows 10642 cols
[2023-03-12 21:07:02] [INFO ] Computed 141 place invariants in 263 ms
[2023-03-12 21:07:06] [INFO ] [Real]Absence check using 71 positive place invariants in 245 ms returned sat
[2023-03-12 21:07:06] [INFO ] [Real]Absence check using 71 positive and 70 generalized place invariants in 87 ms returned sat
[2023-03-12 21:07:07] [INFO ] After 4190ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:12
[2023-03-12 21:07:10] [INFO ] [Nat]Absence check using 71 positive place invariants in 213 ms returned sat
[2023-03-12 21:07:10] [INFO ] [Nat]Absence check using 71 positive and 70 generalized place invariants in 123 ms returned sat
[2023-03-12 21:07:32] [INFO ] After 19588ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :11
[2023-03-12 21:07:32] [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 21:07:32] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-12 21:07:32] [INFO ] After 25255ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0 real:12
FORMULA CANConstruction-PT-070-ReachabilityCardinality-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA CANConstruction-PT-070-ReachabilityCardinality-04 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 13 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 111 ms.
Support contains 173 out of 10642 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10642/10642 places, 20160/20160 transitions.
Drop transitions removed 465 transitions
Trivial Post-agglo rules discarded 465 transitions
Performed 465 trivial Post agglomeration. Transition count delta: 465
Iterating post reduction 0 with 465 rules applied. Total rules applied 465 place count 10642 transition count 19695
Reduce places removed 465 places and 0 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 1 with 474 rules applied. Total rules applied 939 place count 10177 transition count 19686
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 948 place count 10168 transition count 19686
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 948 place count 10168 transition count 19682
Deduced a syphon composed of 4 places in 19 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 956 place count 10164 transition count 19682
Discarding 4688 places :
Symmetric choice reduction at 3 with 4688 rule applications. Total rules 5644 place count 5476 transition count 10306
Iterating global reduction 3 with 4688 rules applied. Total rules applied 10332 place count 5476 transition count 10306
Performed 65 Post agglomeration using F-continuation condition.Transition count delta: 65
Deduced a syphon composed of 65 places in 8 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 3 with 130 rules applied. Total rules applied 10462 place count 5411 transition count 10241
Free-agglomeration rule applied 45 times.
Iterating global reduction 3 with 45 rules applied. Total rules applied 10507 place count 5411 transition count 10196
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 3 with 45 rules applied. Total rules applied 10552 place count 5366 transition count 10196
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 4 with 5 rules applied. Total rules applied 10557 place count 5366 transition count 10191
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 10562 place count 5361 transition count 10191
Partial Free-agglomeration rule applied 96 times.
Drop transitions removed 96 transitions
Iterating global reduction 5 with 96 rules applied. Total rules applied 10658 place count 5361 transition count 10191
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 10660 place count 5361 transition count 10191
Applied a total of 10660 rules in 11081 ms. Remains 5361 /10642 variables (removed 5281) and now considering 10191/20160 (removed 9969) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11084 ms. Remains : 5361/10642 places, 10191/20160 transitions.
Incomplete random walk after 10000 steps, including 19 resets, run finished after 591 ms. (steps per millisecond=16 ) properties (out of 11) seen :4
FORMULA CANConstruction-PT-070-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-070-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-070-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-070-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 7) 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 7) 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 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 10191 rows 5361 cols
[2023-03-12 21:07:44] [INFO ] Computed 141 place invariants in 98 ms
[2023-03-12 21:07:45] [INFO ] [Real]Absence check using 71 positive place invariants in 116 ms returned sat
[2023-03-12 21:07:45] [INFO ] [Real]Absence check using 71 positive and 70 generalized place invariants in 53 ms returned sat
[2023-03-12 21:07:46] [INFO ] After 1460ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-12 21:07:47] [INFO ] [Nat]Absence check using 71 positive place invariants in 156 ms returned sat
[2023-03-12 21:07:47] [INFO ] [Nat]Absence check using 71 positive and 70 generalized place invariants in 71 ms returned sat
[2023-03-12 21:07:54] [INFO ] After 6294ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-12 21:07:54] [INFO ] State equation strengthened by 9837 read => feed constraints.
[2023-03-12 21:08:00] [INFO ] After 5970ms SMT Verify possible using 9837 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-12 21:08:06] [INFO ] After 11978ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 4287 ms.
[2023-03-12 21:08:11] [INFO ] After 25026ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
FORMULA CANConstruction-PT-070-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 114 ms.
Support contains 124 out of 5361 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5361/5361 places, 10191/10191 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 5361 transition count 10190
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 5360 transition count 10190
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 5 place count 5357 transition count 10184
Iterating global reduction 2 with 3 rules applied. Total rules applied 8 place count 5357 transition count 10184
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 3 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 52 place count 5335 transition count 10162
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 56 place count 5333 transition count 10163
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 57 place count 5333 transition count 10163
Applied a total of 57 rules in 4657 ms. Remains 5333 /5361 variables (removed 28) and now considering 10163/10191 (removed 28) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4658 ms. Remains : 5333/5361 places, 10163/10191 transitions.
Incomplete random walk after 10000 steps, including 19 resets, run finished after 302 ms. (steps per millisecond=33 ) properties (out of 6) seen :1
FORMULA CANConstruction-PT-070-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 5) 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 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 5) 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 5) 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 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 10163 rows 5333 cols
[2023-03-12 21:08:16] [INFO ] Computed 141 place invariants in 74 ms
[2023-03-12 21:08:17] [INFO ] [Real]Absence check using 71 positive place invariants in 182 ms returned sat
[2023-03-12 21:08:17] [INFO ] [Real]Absence check using 71 positive and 70 generalized place invariants in 68 ms returned sat
[2023-03-12 21:08:17] [INFO ] After 1512ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-12 21:08:19] [INFO ] [Nat]Absence check using 71 positive place invariants in 117 ms returned sat
[2023-03-12 21:08:19] [INFO ] [Nat]Absence check using 71 positive and 70 generalized place invariants in 50 ms returned sat
[2023-03-12 21:08:25] [INFO ] After 5603ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-12 21:08:25] [INFO ] State equation strengthened by 9865 read => feed constraints.
[2023-03-12 21:08:31] [INFO ] After 6019ms SMT Verify possible using 9865 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-12 21:08:35] [INFO ] After 10623ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 2988 ms.
[2023-03-12 21:08:38] [INFO ] After 20817ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 70 ms.
Support contains 121 out of 5333 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5333/5333 places, 10163/10163 transitions.
Applied a total of 0 rules in 1028 ms. Remains 5333 /5333 variables (removed 0) and now considering 10163/10163 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1028 ms. Remains : 5333/5333 places, 10163/10163 transitions.
Incomplete random walk after 10000 steps, including 19 resets, run finished after 413 ms. (steps per millisecond=24 ) properties (out of 5) 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 5) 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 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 5) 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 5) 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 5) seen :0
Interrupted probabilistic random walk after 67600 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :{}
Probabilistic random walk after 67600 steps, saw 57800 distinct states, run finished after 3016 ms. (steps per millisecond=22 ) properties seen :0
Running SMT prover for 5 properties.
[2023-03-12 21:08:43] [INFO ] Invariant cache hit.
[2023-03-12 21:08:45] [INFO ] [Real]Absence check using 71 positive place invariants in 210 ms returned sat
[2023-03-12 21:08:45] [INFO ] [Real]Absence check using 71 positive and 70 generalized place invariants in 67 ms returned sat
[2023-03-12 21:08:45] [INFO ] After 1847ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-12 21:08:46] [INFO ] [Nat]Absence check using 71 positive place invariants in 208 ms returned sat
[2023-03-12 21:08:46] [INFO ] [Nat]Absence check using 71 positive and 70 generalized place invariants in 113 ms returned sat
[2023-03-12 21:08:53] [INFO ] After 6091ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-12 21:08:53] [INFO ] State equation strengthened by 9865 read => feed constraints.
[2023-03-12 21:08:59] [INFO ] After 5523ms SMT Verify possible using 9865 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-12 21:09:03] [INFO ] After 10237ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 3722 ms.
[2023-03-12 21:09:07] [INFO ] After 22205ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 94 ms.
Support contains 121 out of 5333 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5333/5333 places, 10163/10163 transitions.
Applied a total of 0 rules in 1067 ms. Remains 5333 /5333 variables (removed 0) and now considering 10163/10163 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1067 ms. Remains : 5333/5333 places, 10163/10163 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5333/5333 places, 10163/10163 transitions.
Applied a total of 0 rules in 1058 ms. Remains 5333 /5333 variables (removed 0) and now considering 10163/10163 (removed 0) transitions.
[2023-03-12 21:09:09] [INFO ] Invariant cache hit.
[2023-03-12 21:09:14] [INFO ] Implicit Places using invariants in 4268 ms returned []
Implicit Place search using SMT only with invariants took 4270 ms to find 0 implicit places.
[2023-03-12 21:09:14] [INFO ] Invariant cache hit.
[2023-03-12 21:09:24] [INFO ] Dead Transitions using invariants and state equation in 10502 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15837 ms. Remains : 5333/5333 places, 10163/10163 transitions.
Graph (trivial) has 9560 edges and 5333 vertex of which 4326 / 5333 are part of one of the 62 SCC in 11 ms
Free SCC test removed 4264 places
Drop transitions removed 8444 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 8447 transitions.
Graph (complete) has 2190 edges and 1069 vertex of which 877 are kept as prefixes of interest. Removing 192 places using SCC suffix rule.2 ms
Discarding 192 places :
Also discarding 66 output transitions
Drop transitions removed 66 transitions
Ensure Unique test removed 1 places
Drop transitions removed 139 transitions
Reduce isomorphic transitions removed 139 transitions.
Drop transitions removed 476 transitions
Trivial Post-agglo rules discarded 476 transitions
Performed 476 trivial Post agglomeration. Transition count delta: 476
Iterating post reduction 0 with 616 rules applied. Total rules applied 618 place count 876 transition count 1035
Reduce places removed 476 places and 0 transitions.
Ensure Unique test removed 468 transitions
Reduce isomorphic transitions removed 468 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 85 Post agglomeration using F-continuation condition.Transition count delta: 85
Iterating post reduction 1 with 1030 rules applied. Total rules applied 1648 place count 399 transition count 482
Reduce places removed 85 places and 0 transitions.
Ensure Unique test removed 66 transitions
Reduce isomorphic transitions removed 66 transitions.
Iterating post reduction 2 with 151 rules applied. Total rules applied 1799 place count 314 transition count 416
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 1799 place count 314 transition count 405
Deduced a syphon composed of 11 places in 2 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 1821 place count 303 transition count 405
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 1830 place count 294 transition count 396
Iterating global reduction 3 with 9 rules applied. Total rules applied 1839 place count 294 transition count 396
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1841 place count 294 transition count 394
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 1841 place count 294 transition count 391
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 1847 place count 291 transition count 391
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 4 with 4 rules applied. Total rules applied 1851 place count 289 transition count 389
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 1859 place count 285 transition count 391
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 1863 place count 285 transition count 387
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 4 with 1 rules applied. Total rules applied 1864 place count 284 transition count 387
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1865 place count 283 transition count 386
Iterating global reduction 5 with 1 rules applied. Total rules applied 1866 place count 283 transition count 386
Free-agglomeration rule applied 33 times.
Iterating global reduction 5 with 33 rules applied. Total rules applied 1899 place count 283 transition count 353
Ensure Unique test removed 1 places
Reduce places removed 34 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 36 rules applied. Total rules applied 1935 place count 249 transition count 351
Free-agglomeration rule applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 1936 place count 249 transition count 350
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1937 place count 248 transition count 350
Partial Free-agglomeration rule applied 21 times.
Drop transitions removed 21 transitions
Iterating global reduction 7 with 21 rules applied. Total rules applied 1958 place count 248 transition count 350
Discarding 16 places :
Symmetric choice reduction at 7 with 16 rule applications. Total rules 1974 place count 232 transition count 334
Iterating global reduction 7 with 16 rules applied. Total rules applied 1990 place count 232 transition count 334
Reduce places removed 27 places and 27 transitions.
Iterating global reduction 7 with 27 rules applied. Total rules applied 2017 place count 205 transition count 307
Applied a total of 2017 rules in 206 ms. Remains 205 /5333 variables (removed 5128) and now considering 307/10163 (removed 9856) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 307 rows 205 cols
[2023-03-12 21:09:24] [INFO ] Computed 29 place invariants in 1 ms
[2023-03-12 21:09:24] [INFO ] [Real]Absence check using 28 positive place invariants in 3 ms returned sat
[2023-03-12 21:09:24] [INFO ] [Real]Absence check using 28 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 21:09:24] [INFO ] After 64ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-12 21:09:24] [INFO ] [Nat]Absence check using 28 positive place invariants in 3 ms returned sat
[2023-03-12 21:09:24] [INFO ] [Nat]Absence check using 28 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-12 21:09:25] [INFO ] After 118ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-12 21:09:25] [INFO ] After 210ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 66 ms.
[2023-03-12 21:09:25] [INFO ] After 351ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
[2023-03-12 21:09:25] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 3 ms.
[2023-03-12 21:09:25] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 5333 places, 10163 transitions and 40509 arcs took 54 ms.
[2023-03-12 21:09:26] [INFO ] Flatten gal took : 763 ms
Total runtime 145896 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_ --inv-par
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 11740440 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16087376 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="CANConstruction-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 CANConstruction-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-167813695000670"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CANConstruction-PT-070.tgz
mv CANConstruction-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 ;