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-167813695100759.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 ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r041-tajo-167813695100759
=====================================================================

--------------------
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-ReachabilityFireability-00
FORMULA_NAME CANInsertWithFailure-PT-070-ReachabilityFireability-01
FORMULA_NAME CANInsertWithFailure-PT-070-ReachabilityFireability-02
FORMULA_NAME CANInsertWithFailure-PT-070-ReachabilityFireability-03
FORMULA_NAME CANInsertWithFailure-PT-070-ReachabilityFireability-04
FORMULA_NAME CANInsertWithFailure-PT-070-ReachabilityFireability-05
FORMULA_NAME CANInsertWithFailure-PT-070-ReachabilityFireability-06
FORMULA_NAME CANInsertWithFailure-PT-070-ReachabilityFireability-07
FORMULA_NAME CANInsertWithFailure-PT-070-ReachabilityFireability-08
FORMULA_NAME CANInsertWithFailure-PT-070-ReachabilityFireability-09
FORMULA_NAME CANInsertWithFailure-PT-070-ReachabilityFireability-10
FORMULA_NAME CANInsertWithFailure-PT-070-ReachabilityFireability-11
FORMULA_NAME CANInsertWithFailure-PT-070-ReachabilityFireability-12
FORMULA_NAME CANInsertWithFailure-PT-070-ReachabilityFireability-13
FORMULA_NAME CANInsertWithFailure-PT-070-ReachabilityFireability-14
FORMULA_NAME CANInsertWithFailure-PT-070-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678664735211

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANInsertWithFailure-PT-070
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 23:45:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 23:45:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 23:45:38] [INFO ] Load time of PNML (sax parser for PT used): 819 ms
[2023-03-12 23:45:38] [INFO ] Transformed 10644 places.
[2023-03-12 23:45:38] [INFO ] Transformed 29820 transitions.
[2023-03-12 23:45:38] [INFO ] Parsed PT model containing 10644 places and 29820 transitions and 79800 arcs in 1061 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 30 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 6 resets, run finished after 863 ms. (steps per millisecond=11 ) properties (out of 16) seen :3
FORMULA CANInsertWithFailure-PT-070-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-070-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-070-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) 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 57 ms. (steps per millisecond=175 ) 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 21 ms. (steps per millisecond=476 ) properties (out of 13) 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 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) 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 22 ms. (steps per millisecond=454 ) 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 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 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 30 ms. (steps per millisecond=333 ) properties (out of 13) seen :0
Running SMT prover for 13 properties.
// Phase 1: matrix 29820 rows 10644 cols
[2023-03-12 23:45:45] [INFO ] Computed 73 place invariants in 5633 ms
[2023-03-12 23:45:50] [INFO ] [Real]Absence check using 71 positive place invariants in 173 ms returned sat
[2023-03-12 23:45:50] [INFO ] [Real]Absence check using 71 positive and 2 generalized place invariants in 245 ms returned sat
[2023-03-12 23:46:10] [INFO ] After 19006ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:10
[2023-03-12 23:46:11] [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:339)
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:46:11] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-12 23:46:11] [INFO ] After 25389ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 13 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 189 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.45 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 393 transitions
Trivial Post-agglo rules discarded 393 transitions
Performed 393 trivial Post agglomeration. Transition count delta: 393
Iterating post reduction 0 with 393 rules applied. Total rules applied 394 place count 10643 transition count 29427
Reduce places removed 393 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 396 rules applied. Total rules applied 790 place count 10250 transition count 29424
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 793 place count 10247 transition count 29424
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 19 Pre rules applied. Total rules applied 793 place count 10247 transition count 29405
Deduced a syphon composed of 19 places in 42 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 831 place count 10228 transition count 29405
Performed 4742 Post agglomeration using F-continuation condition.Transition count delta: 4742
Deduced a syphon composed of 4742 places in 38 ms
Reduce places removed 4742 places and 0 transitions.
Iterating global reduction 3 with 9484 rules applied. Total rules applied 10315 place count 5486 transition count 24663
Free-agglomeration rule (complex) applied 68 times.
Iterating global reduction 3 with 68 rules applied. Total rules applied 10383 place count 5486 transition count 24595
Reduce places removed 68 places and 0 transitions.
Iterating post reduction 3 with 68 rules applied. Total rules applied 10451 place count 5418 transition count 24595
Partial Free-agglomeration rule applied 4860 times.
Drop transitions removed 4860 transitions
Iterating global reduction 4 with 4860 rules applied. Total rules applied 15311 place count 5418 transition count 24595
Partial Free-agglomeration rule applied 1350 times.
Drop transitions removed 1350 transitions
Iterating global reduction 4 with 1350 rules applied. Total rules applied 16661 place count 5418 transition count 24595
Applied a total of 16661 rules in 13869 ms. Remains 5418 /10644 variables (removed 5226) and now considering 24595/29820 (removed 5225) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13874 ms. Remains : 5418/10644 places, 24595/29820 transitions.
Incomplete random walk after 10000 steps, including 22 resets, run finished after 835 ms. (steps per millisecond=11 ) properties (out of 13) seen :3
FORMULA CANInsertWithFailure-PT-070-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-070-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-070-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 10) 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 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 23 ms. (steps per millisecond=434 ) properties (out of 10) 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 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 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 41 ms. (steps per millisecond=243 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) 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
Running SMT prover for 10 properties.
[2023-03-12 23:46:26] [INFO ] Flow matrix only has 24539 transitions (discarded 56 similar events)
// Phase 1: matrix 24539 rows 5418 cols
[2023-03-12 23:46:27] [INFO ] Computed 72 place invariants in 1399 ms
[2023-03-12 23:46:29] [INFO ] [Real]Absence check using 70 positive place invariants in 104 ms returned sat
[2023-03-12 23:46:29] [INFO ] [Real]Absence check using 70 positive and 2 generalized place invariants in 96 ms returned sat
[2023-03-12 23:46:30] [INFO ] After 2439ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-12 23:46:31] [INFO ] [Nat]Absence check using 70 positive place invariants in 76 ms returned sat
[2023-03-12 23:46:31] [INFO ] [Nat]Absence check using 70 positive and 2 generalized place invariants in 66 ms returned sat
[2023-03-12 23:46:51] [INFO ] After 18413ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-12 23:46:51] [INFO ] State equation strengthened by 23830 read => feed constraints.
[2023-03-12 23:46:55] [INFO ] After 3708ms SMT Verify possible using 23830 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2023-03-12 23:46:55] [INFO ] After 3709ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-12 23:46:55] [INFO ] After 25054ms 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 64 ms.
Support contains 151 out of 5418 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5418/5418 places, 24595/24595 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 5418 transition count 24592
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 5415 transition count 24592
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 5 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 40 place count 5398 transition count 24575
Partial Free-agglomeration rule applied 12 times.
Drop transitions removed 12 transitions
Iterating global reduction 2 with 12 rules applied. Total rules applied 52 place count 5398 transition count 24575
Applied a total of 52 rules in 4223 ms. Remains 5398 /5418 variables (removed 20) and now considering 24575/24595 (removed 20) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4224 ms. Remains : 5398/5418 places, 24575/24595 transitions.
Incomplete random walk after 10000 steps, including 22 resets, run finished after 565 ms. (steps per millisecond=17 ) 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 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 25 ms. (steps per millisecond=400 ) 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 33 ms. (steps per millisecond=303 ) 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 31 ms. (steps per millisecond=322 ) properties (out of 10) 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 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 10) 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 10) seen :0
Interrupted probabilistic random walk after 47368 steps, run timeout after 3001 ms. (steps per millisecond=15 ) properties seen :{}
Probabilistic random walk after 47368 steps, saw 45468 distinct states, run finished after 3003 ms. (steps per millisecond=15 ) properties seen :0
Running SMT prover for 10 properties.
[2023-03-12 23:47:03] [INFO ] Flow matrix only has 24531 transitions (discarded 44 similar events)
// Phase 1: matrix 24531 rows 5398 cols
[2023-03-12 23:47:04] [INFO ] Computed 72 place invariants in 1492 ms
[2023-03-12 23:47:06] [INFO ] [Real]Absence check using 70 positive place invariants in 81 ms returned sat
[2023-03-12 23:47:06] [INFO ] [Real]Absence check using 70 positive and 2 generalized place invariants in 100 ms returned sat
[2023-03-12 23:47:07] [INFO ] After 2098ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-12 23:47:08] [INFO ] [Nat]Absence check using 70 positive place invariants in 92 ms returned sat
[2023-03-12 23:47:08] [INFO ] [Nat]Absence check using 70 positive and 2 generalized place invariants in 104 ms returned sat
[2023-03-12 23:47:32] [INFO ] After 22474ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-12 23:47:32] [INFO ] State equation strengthened by 23884 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:47:32] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-12 23:47:32] [INFO ] After 25483ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:10
Fused 10 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 7 ms.
Support contains 151 out of 5398 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5398/5398 places, 24575/24575 transitions.
Applied a total of 0 rules in 1228 ms. Remains 5398 /5398 variables (removed 0) and now considering 24575/24575 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1230 ms. Remains : 5398/5398 places, 24575/24575 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5398/5398 places, 24575/24575 transitions.
Applied a total of 0 rules in 1231 ms. Remains 5398 /5398 variables (removed 0) and now considering 24575/24575 (removed 0) transitions.
[2023-03-12 23:47:34] [INFO ] Flow matrix only has 24531 transitions (discarded 44 similar events)
[2023-03-12 23:47:35] [INFO ] Invariant cache hit.
[2023-03-12 23:47:39] [INFO ] Implicit Places using invariants in 4396 ms returned []
Implicit Place search using SMT only with invariants took 4398 ms to find 0 implicit places.
[2023-03-12 23:47:39] [INFO ] Flow matrix only has 24531 transitions (discarded 44 similar events)
[2023-03-12 23:47:39] [INFO ] Invariant cache hit.
[2023-03-12 23:47:54] [INFO ] Dead Transitions using invariants and state equation in 15079 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20713 ms. Remains : 5398/5398 places, 24575/24575 transitions.
Graph (trivial) has 21240 edges and 5398 vertex of which 3718 / 5398 are part of one of the 2 SCC in 27 ms
Free SCC test removed 3716 places
Drop transitions removed 13156 transitions
Ensure Unique test removed 4588 transitions
Reduce isomorphic transitions removed 17744 transitions.
Graph (complete) has 7256 edges and 1682 vertex of which 1561 are kept as prefixes of interest. Removing 121 places using SCC suffix rule.2 ms
Discarding 121 places :
Also discarding 40 output transitions
Drop transitions removed 40 transitions
Drop transitions removed 883 transitions
Reduce isomorphic transitions removed 883 transitions.
Iterating post reduction 0 with 883 rules applied. Total rules applied 885 place count 1561 transition count 5908
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 12 Pre rules applied. Total rules applied 885 place count 1561 transition count 5896
Deduced a syphon composed of 12 places in 2 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 1 with 24 rules applied. Total rules applied 909 place count 1549 transition count 5896
Discarding 927 places :
Symmetric choice reduction at 1 with 927 rule applications. Total rules 1836 place count 622 transition count 2895
Iterating global reduction 1 with 927 rules applied. Total rules applied 2763 place count 622 transition count 2895
Ensure Unique test removed 888 transitions
Reduce isomorphic transitions removed 888 transitions.
Iterating post reduction 1 with 888 rules applied. Total rules applied 3651 place count 622 transition count 2007
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 3653 place count 621 transition count 2006
Drop transitions removed 361 transitions
Redundant transition composition rules discarded 361 transitions
Iterating global reduction 2 with 361 rules applied. Total rules applied 4014 place count 621 transition count 1645
Discarding 65 places :
Symmetric choice reduction at 2 with 65 rule applications. Total rules 4079 place count 556 transition count 1515
Iterating global reduction 2 with 65 rules applied. Total rules applied 4144 place count 556 transition count 1515
Performed 163 Post agglomeration using F-continuation condition.Transition count delta: 163
Deduced a syphon composed of 163 places in 0 ms
Reduce places removed 163 places and 0 transitions.
Iterating global reduction 2 with 326 rules applied. Total rules applied 4470 place count 393 transition count 1352
Ensure Unique test removed 228 transitions
Reduce isomorphic transitions removed 228 transitions.
Iterating post reduction 2 with 228 rules applied. Total rules applied 4698 place count 393 transition count 1124
Performed 65 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 65 places in 0 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 3 with 130 rules applied. Total rules applied 4828 place count 328 transition count 1124
Ensure Unique test removed 130 transitions
Reduce isomorphic transitions removed 130 transitions.
Iterating post reduction 3 with 130 rules applied. Total rules applied 4958 place count 328 transition count 994
Drop transitions removed 85 transitions
Redundant transition composition rules discarded 85 transitions
Iterating global reduction 4 with 85 rules applied. Total rules applied 5043 place count 328 transition count 909
Free-agglomeration rule applied 12 times.
Iterating global reduction 4 with 12 rules applied. Total rules applied 5055 place count 328 transition count 897
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 13 rules applied. Total rules applied 5068 place count 316 transition count 896
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 5070 place count 316 transition count 894
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 5072 place count 314 transition count 894
Partial Free-agglomeration rule applied 50 times.
Drop transitions removed 50 transitions
Iterating global reduction 6 with 50 rules applied. Total rules applied 5122 place count 314 transition count 894
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 6 with 17 rules applied. Total rules applied 5139 place count 314 transition count 877
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 7 with 9 rules applied. Total rules applied 5148 place count 314 transition count 868
Partial Post-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 7 with 7 rules applied. Total rules applied 5155 place count 314 transition count 868
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 5162 place count 307 transition count 861
Iterating global reduction 7 with 7 rules applied. Total rules applied 5169 place count 307 transition count 861
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 7 with 9 rules applied. Total rules applied 5178 place count 307 transition count 852
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 5179 place count 306 transition count 851
Applied a total of 5179 rules in 6572 ms. Remains 306 /5398 variables (removed 5092) and now considering 851/24575 (removed 23724) transitions.
Running SMT prover for 10 properties.
// Phase 1: matrix 851 rows 306 cols
[2023-03-12 23:48:01] [INFO ] Computed 30 place invariants in 3 ms
[2023-03-12 23:48:01] [INFO ] [Real]Absence check using 30 positive place invariants in 15 ms returned sat
[2023-03-12 23:48:01] [INFO ] After 421ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-12 23:48:01] [INFO ] [Nat]Absence check using 30 positive place invariants in 6 ms returned sat
[2023-03-12 23:48:02] [INFO ] After 416ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-12 23:48:02] [INFO ] After 848ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 369 ms.
[2023-03-12 23:48:02] [INFO ] After 1337ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
[2023-03-12 23:48:02] [INFO ] Export to MCC of 10 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 5 ms.
[2023-03-12 23:48:03] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 5398 places, 24575 transitions and 97703 arcs took 101 ms.
[2023-03-12 23:48:04] [INFO ] Flatten gal took : 921 ms
Total runtime 146998 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --inv-bin-par --invariant=/tmp/514/inv_0_ --invariant=/tmp/514/inv_1_ --invariant=/tmp/514/inv_2_ --invariant=/tmp/514/inv_3_ --invariant=/tmp/514/inv_4_ --invariant=/tmp/514/inv_5_ --invariant=/tmp/514/inv_6_ --invariant=/tmp/514/inv_7_ --invariant=/tmp/514/inv_8_ --invariant=/tmp/514/inv_9_ --inv-par
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 7455400 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16048936 kB

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CANInsertWithFailure-PT-070"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is CANInsertWithFailure-PT-070, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r041-tajo-167813695100759"
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 [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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