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-167813695000694.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-100, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r041-tajo-167813695000694
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 9.6K Feb 25 22:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 25 22:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Feb 25 22:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 25 22:08 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.4K Feb 25 15:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 15:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K 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 17K Feb 25 22:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 134K Feb 25 22:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K Feb 25 22:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Feb 25 22:32 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 15M 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-100-ReachabilityCardinality-00
FORMULA_NAME CANConstruction-PT-100-ReachabilityCardinality-01
FORMULA_NAME CANConstruction-PT-100-ReachabilityCardinality-02
FORMULA_NAME CANConstruction-PT-100-ReachabilityCardinality-03
FORMULA_NAME CANConstruction-PT-100-ReachabilityCardinality-04
FORMULA_NAME CANConstruction-PT-100-ReachabilityCardinality-05
FORMULA_NAME CANConstruction-PT-100-ReachabilityCardinality-06
FORMULA_NAME CANConstruction-PT-100-ReachabilityCardinality-07
FORMULA_NAME CANConstruction-PT-100-ReachabilityCardinality-08
FORMULA_NAME CANConstruction-PT-100-ReachabilityCardinality-09
FORMULA_NAME CANConstruction-PT-100-ReachabilityCardinality-10
FORMULA_NAME CANConstruction-PT-100-ReachabilityCardinality-11
FORMULA_NAME CANConstruction-PT-100-ReachabilityCardinality-12
FORMULA_NAME CANConstruction-PT-100-ReachabilityCardinality-13
FORMULA_NAME CANConstruction-PT-100-ReachabilityCardinality-14
FORMULA_NAME CANConstruction-PT-100-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678657965266

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-100
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 21:52:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-12 21:52:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 21:52:49] [INFO ] Load time of PNML (sax parser for PT used): 1244 ms
[2023-03-12 21:52:49] [INFO ] Transformed 21202 places.
[2023-03-12 21:52:49] [INFO ] Transformed 40800 transitions.
[2023-03-12 21:52:49] [INFO ] Parsed PT model containing 21202 places and 40800 transitions and 122000 arcs in 1683 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 53 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 5 resets, run finished after 1217 ms. (steps per millisecond=8 ) properties (out of 16) seen :1
FORMULA CANConstruction-PT-100-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) 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 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 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 26 ms. (steps per millisecond=38 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) 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 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 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 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Interrupted probabilistic random walk after 64188 steps, run timeout after 3001 ms. (steps per millisecond=21 ) properties seen :{}
Probabilistic random walk after 64188 steps, saw 63375 distinct states, run finished after 3003 ms. (steps per millisecond=21 ) properties seen :0
Running SMT prover for 15 properties.
// Phase 1: matrix 40800 rows 21202 cols
[2023-03-12 21:52:55] [INFO ] Computed 201 place invariants in 781 ms
[2023-03-12 21:53:04] [INFO ] After 8924ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2023-03-12 21:53:13] [INFO ] [Nat]Absence check using 101 positive place invariants in 658 ms returned sat
[2023-03-12 21:53:13] [INFO ] [Nat]Absence check using 101 positive and 100 generalized place invariants in 215 ms returned sat
[2023-03-12 21:53:29] [INFO ] After 11977ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :13
[2023-03-12 21:53:30] [INFO ] State equation strengthened by 19900 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:53:30] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-12 21:53:30] [INFO ] After 25579ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:15
FORMULA CANConstruction-PT-100-ReachabilityCardinality-14 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA CANConstruction-PT-100-ReachabilityCardinality-09 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 15 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 244 out of 21202 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 21202/21202 places, 40800/40800 transitions.
Drop transitions removed 669 transitions
Trivial Post-agglo rules discarded 669 transitions
Performed 669 trivial Post agglomeration. Transition count delta: 669
Iterating post reduction 0 with 669 rules applied. Total rules applied 669 place count 21202 transition count 40131
Reduce places removed 669 places and 0 transitions.
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Iterating post reduction 1 with 682 rules applied. Total rules applied 1351 place count 20533 transition count 40118
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 1364 place count 20520 transition count 40118
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 1364 place count 20520 transition count 40111
Deduced a syphon composed of 7 places in 53 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 1378 place count 20513 transition count 40111
Discarding 9673 places :
Symmetric choice reduction at 3 with 9673 rule applications. Total rules 11051 place count 10840 transition count 20765
Iterating global reduction 3 with 9673 rules applied. Total rules applied 20724 place count 10840 transition count 20765
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 24 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 3 with 180 rules applied. Total rules applied 20904 place count 10750 transition count 20675
Free-agglomeration rule applied 52 times.
Iterating global reduction 3 with 52 rules applied. Total rules applied 20956 place count 10750 transition count 20623
Reduce places removed 52 places and 0 transitions.
Iterating post reduction 3 with 52 rules applied. Total rules applied 21008 place count 10698 transition count 20623
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 4 with 4 rules applied. Total rules applied 21012 place count 10698 transition count 20619
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 21016 place count 10694 transition count 20619
Partial Free-agglomeration rule applied 149 times.
Drop transitions removed 149 transitions
Iterating global reduction 5 with 149 rules applied. Total rules applied 21165 place count 10694 transition count 20619
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 21166 place count 10694 transition count 20619
Applied a total of 21166 rules in 22708 ms. Remains 10694 /21202 variables (removed 10508) and now considering 20619/40800 (removed 20181) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22713 ms. Remains : 10694/21202 places, 20619/40800 transitions.
Incomplete random walk after 10000 steps, including 13 resets, run finished after 1248 ms. (steps per millisecond=8 ) properties (out of 13) seen :1
FORMULA CANConstruction-PT-100-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 12) 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 12) 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 12) 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 12) 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 12) 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 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 12) 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 12) seen :0
Interrupted probabilistic random walk after 52033 steps, run timeout after 3003 ms. (steps per millisecond=17 ) properties seen :{}
Probabilistic random walk after 52033 steps, saw 51224 distinct states, run finished after 3004 ms. (steps per millisecond=17 ) properties seen :0
Running SMT prover for 12 properties.
// Phase 1: matrix 20619 rows 10694 cols
[2023-03-12 21:53:58] [INFO ] Computed 201 place invariants in 174 ms
[2023-03-12 21:54:01] [INFO ] After 3510ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-12 21:54:05] [INFO ] [Nat]Absence check using 101 positive place invariants in 316 ms returned sat
[2023-03-12 21:54:05] [INFO ] [Nat]Absence check using 101 positive and 100 generalized place invariants in 225 ms returned sat
[2023-03-12 21:54:26] [INFO ] After 18926ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2023-03-12 21:54:26] [INFO ] State equation strengthened by 20059 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:54:26] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-12 21:54:26] [INFO ] After 25344ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:12
Fused 12 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 16 ms.
Support contains 242 out of 10694 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10694/10694 places, 20619/20619 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 10693 transition count 20618
Applied a total of 2 rules in 7251 ms. Remains 10693 /10694 variables (removed 1) and now considering 20618/20619 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7252 ms. Remains : 10693/10694 places, 20618/20619 transitions.
Incomplete random walk after 10000 steps, including 13 resets, run finished after 653 ms. (steps per millisecond=15 ) properties (out of 12) seen :2
FORMULA CANConstruction-PT-100-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-100-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) 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 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 30 ms. (steps per millisecond=333 ) 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 39 ms. (steps per millisecond=256 ) properties (out of 10) 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 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 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 30 ms. (steps per millisecond=333 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 20618 rows 10693 cols
[2023-03-12 21:54:35] [INFO ] Computed 201 place invariants in 348 ms
[2023-03-12 21:54:38] [INFO ] After 3116ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-12 21:54:42] [INFO ] [Nat]Absence check using 101 positive place invariants in 318 ms returned sat
[2023-03-12 21:54:42] [INFO ] [Nat]Absence check using 101 positive and 100 generalized place invariants in 385 ms returned sat
[2023-03-12 21:55:03] [INFO ] After 19502ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-12 21:55:03] [INFO ] State equation strengthened by 20060 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:55:03] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-12 21:55:03] [INFO ] After 25306ms 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 0 ms.
Support contains 238 out of 10693 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10693/10693 places, 20618/20618 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 10692 transition count 20617
Applied a total of 2 rules in 7226 ms. Remains 10692 /10693 variables (removed 1) and now considering 20617/20618 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7226 ms. Remains : 10692/10693 places, 20617/20618 transitions.
Incomplete random walk after 10000 steps, including 13 resets, run finished after 576 ms. (steps per millisecond=17 ) properties (out of 10) seen :2
FORMULA CANConstruction-PT-100-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-100-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 8) 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 8) 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 8) 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 8) 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 8) 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 8) 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 8) 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 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 20617 rows 10692 cols
[2023-03-12 21:55:12] [INFO ] Computed 201 place invariants in 263 ms
[2023-03-12 21:55:15] [INFO ] After 2744ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-12 21:55:18] [INFO ] [Nat]Absence check using 101 positive place invariants in 356 ms returned sat
[2023-03-12 21:55:18] [INFO ] [Nat]Absence check using 101 positive and 100 generalized place invariants in 147 ms returned sat
[2023-03-12 21:55:37] [INFO ] After 17925ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-12 21:55:37] [INFO ] State equation strengthened by 20061 read => feed constraints.
[2023-03-12 21:55:40] [INFO ] After 2491ms SMT Verify possible using 20061 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-03-12 21:55:40] [INFO ] After 2492ms 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 21:55:40] [INFO ] After 25039ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Fused 8 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 13 ms.
Support contains 154 out of 10692 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10692/10692 places, 20617/20617 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 10692 transition count 20616
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 10691 transition count 20616
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 10 place count 10683 transition count 20600
Iterating global reduction 2 with 8 rules applied. Total rules applied 18 place count 10683 transition count 20600
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 6 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 80 place count 10652 transition count 20569
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 7 places in 5 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 94 place count 10645 transition count 20570
Applied a total of 94 rules in 15755 ms. Remains 10645 /10692 variables (removed 47) and now considering 20570/20617 (removed 47) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15756 ms. Remains : 10645/10692 places, 20570/20617 transitions.
Incomplete random walk after 10000 steps, including 14 resets, run finished after 441 ms. (steps per millisecond=22 ) properties (out of 8) seen :1
FORMULA CANConstruction-PT-100-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) 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 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 32 ms. (steps per millisecond=312 ) 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
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) 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
Running SMT prover for 7 properties.
// Phase 1: matrix 20570 rows 10645 cols
[2023-03-12 21:55:56] [INFO ] Computed 201 place invariants in 222 ms
[2023-03-12 21:55:59] [INFO ] After 2434ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-12 21:56:01] [INFO ] [Nat]Absence check using 101 positive place invariants in 314 ms returned sat
[2023-03-12 21:56:02] [INFO ] [Nat]Absence check using 101 positive and 100 generalized place invariants in 186 ms returned sat
[2023-03-12 21:56:23] [INFO ] After 19972ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-12 21:56:23] [INFO ] State equation strengthened by 20107 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
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:56:24] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-12 21:56:24] [INFO ] After 25034ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:7
Fused 7 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 6 ms.
Support contains 152 out of 10645 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10645/10645 places, 20570/20570 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 22 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 10643 transition count 20568
Applied a total of 4 rules in 8630 ms. Remains 10643 /10645 variables (removed 2) and now considering 20568/20570 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8631 ms. Remains : 10643/10645 places, 20568/20570 transitions.
Incomplete random walk after 10000 steps, including 14 resets, run finished after 604 ms. (steps per millisecond=16 ) properties (out of 7) seen :1
FORMULA CANConstruction-PT-100-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 6) 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 6) 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 6) 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 6) 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 6) 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 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 20568 rows 10643 cols
[2023-03-12 21:56:34] [INFO ] Computed 201 place invariants in 200 ms
[2023-03-12 21:56:36] [INFO ] After 2124ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-12 21:56:38] [INFO ] [Nat]Absence check using 101 positive place invariants in 335 ms returned sat
[2023-03-12 21:56:38] [INFO ] [Nat]Absence check using 101 positive and 100 generalized place invariants in 204 ms returned sat
[2023-03-12 21:56:58] [INFO ] After 18949ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-12 21:56:59] [INFO ] State equation strengthened by 20109 read => feed constraints.
[2023-03-12 21:57:01] [INFO ] After 2014ms SMT Verify possible using 20109 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-12 21:57:01] [INFO ] After 2015ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 18 ms.
[2023-03-12 21:57:01] [INFO ] After 25054ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 14 ms.
Support contains 137 out of 10643 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10643/10643 places, 20568/20568 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 10643 transition count 20567
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 10642 transition count 20567
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 4 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 14 place count 10636 transition count 20561
Applied a total of 14 rules in 8821 ms. Remains 10636 /10643 variables (removed 7) and now considering 20561/20568 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8823 ms. Remains : 10636/10643 places, 20561/20568 transitions.
Incomplete random walk after 10000 steps, including 14 resets, run finished after 470 ms. (steps per millisecond=21 ) properties (out of 6) seen :1
FORMULA CANConstruction-PT-100-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 5) 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 5) 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 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 31 ms. (steps per millisecond=322 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 20561 rows 10636 cols
[2023-03-12 21:57:10] [INFO ] Computed 201 place invariants in 187 ms
[2023-03-12 21:57:12] [INFO ] After 2059ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-12 21:57:15] [INFO ] [Nat]Absence check using 101 positive place invariants in 340 ms returned sat
[2023-03-12 21:57:15] [INFO ] [Nat]Absence check using 101 positive and 100 generalized place invariants in 168 ms returned sat
[2023-03-12 21:57:36] [INFO ] After 20662ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-12 21:57:37] [INFO ] State equation strengthened by 20115 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
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:57:37] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-12 21:57:37] [INFO ] After 25041ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:5
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 5 ms.
Support contains 123 out of 10636 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10636/10636 places, 20561/20561 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 5 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 10629 transition count 20554
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 15 place count 10629 transition count 20554
Applied a total of 15 rules in 12876 ms. Remains 10629 /10636 variables (removed 7) and now considering 20554/20561 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12876 ms. Remains : 10629/10636 places, 20554/20561 transitions.
Incomplete random walk after 10000 steps, including 14 resets, run finished after 453 ms. (steps per millisecond=22 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) 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 34 ms. (steps per millisecond=294 ) properties (out of 5) 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 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 99528 steps, run timeout after 3001 ms. (steps per millisecond=33 ) properties seen :{}
Probabilistic random walk after 99528 steps, saw 97575 distinct states, run finished after 3014 ms. (steps per millisecond=33 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 20554 rows 10629 cols
[2023-03-12 21:57:54] [INFO ] Computed 201 place invariants in 140 ms
[2023-03-12 21:57:57] [INFO ] After 2676ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-12 21:57:59] [INFO ] [Nat]Absence check using 101 positive place invariants in 266 ms returned sat
[2023-03-12 21:57:59] [INFO ] [Nat]Absence check using 101 positive and 100 generalized place invariants in 157 ms returned sat
[2023-03-12 21:58:19] [INFO ] After 18753ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-12 21:58:19] [INFO ] State equation strengthened by 20122 read => feed constraints.
[2023-03-12 21:58:22] [INFO ] After 2573ms SMT Verify possible using 20122 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-12 21:58:22] [INFO ] After 2576ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-03-12 21:58:22] [INFO ] After 25034ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 32 ms.
Support contains 123 out of 10629 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10629/10629 places, 20554/20554 transitions.
Applied a total of 0 rules in 4306 ms. Remains 10629 /10629 variables (removed 0) and now considering 20554/20554 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4306 ms. Remains : 10629/10629 places, 20554/20554 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10629/10629 places, 20554/20554 transitions.
Applied a total of 0 rules in 4272 ms. Remains 10629 /10629 variables (removed 0) and now considering 20554/20554 (removed 0) transitions.
[2023-03-12 21:58:31] [INFO ] Invariant cache hit.
[2023-03-12 21:58:32] [INFO ] Implicit Places using invariants in 1165 ms returned []
Implicit Place search using SMT only with invariants took 1168 ms to find 0 implicit places.
[2023-03-12 21:58:32] [INFO ] Invariant cache hit.
[2023-03-12 21:58:34] [INFO ] Dead Transitions using invariants and state equation in 2121 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7566 ms. Remains : 10629/10629 places, 20554/20554 transitions.
Graph (trivial) has 19870 edges and 10629 vertex of which 9426 / 10629 are part of one of the 94 SCC in 18 ms
Free SCC test removed 9332 places
Drop transitions removed 18530 transitions
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 18544 transitions.
Graph (complete) has 2690 edges and 1297 vertex of which 972 are kept as prefixes of interest. Removing 325 places using SCC suffix rule.2 ms
Discarding 325 places :
Also discarding 142 output transitions
Drop transitions removed 142 transitions
Drop transitions removed 194 transitions
Reduce isomorphic transitions removed 194 transitions.
Drop transitions removed 587 transitions
Trivial Post-agglo rules discarded 587 transitions
Performed 587 trivial Post agglomeration. Transition count delta: 587
Iterating post reduction 0 with 781 rules applied. Total rules applied 783 place count 972 transition count 1087
Reduce places removed 587 places and 0 transitions.
Ensure Unique test removed 579 transitions
Reduce isomorphic transitions removed 579 transitions.
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Iterating post reduction 1 with 1188 rules applied. Total rules applied 1971 place count 385 transition count 486
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 2 with 22 rules applied. Total rules applied 1993 place count 363 transition count 486
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 26 Pre rules applied. Total rules applied 1993 place count 363 transition count 460
Deduced a syphon composed of 26 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 53 rules applied. Total rules applied 2046 place count 336 transition count 460
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 2054 place count 328 transition count 452
Iterating global reduction 3 with 8 rules applied. Total rules applied 2062 place count 328 transition count 452
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 4 rules applied. Total rules applied 2066 place count 327 transition count 449
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2067 place count 326 transition count 449
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 6 Pre rules applied. Total rules applied 2067 place count 326 transition count 443
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 2079 place count 320 transition count 443
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2080 place count 319 transition count 442
Iterating global reduction 5 with 1 rules applied. Total rules applied 2081 place count 319 transition count 442
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 2093 place count 313 transition count 436
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 2101 place count 309 transition count 444
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 2105 place count 309 transition count 440
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 5 with 1 rules applied. Total rules applied 2106 place count 308 transition count 440
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2107 place count 307 transition count 439
Iterating global reduction 6 with 1 rules applied. Total rules applied 2108 place count 307 transition count 439
Free-agglomeration rule applied 35 times.
Iterating global reduction 6 with 35 rules applied. Total rules applied 2143 place count 307 transition count 404
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 6 with 35 rules applied. Total rules applied 2178 place count 272 transition count 404
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 2180 place count 272 transition count 402
Partial Free-agglomeration rule applied 41 times.
Drop transitions removed 41 transitions
Iterating global reduction 7 with 41 rules applied. Total rules applied 2221 place count 272 transition count 402
Discarding 32 places :
Symmetric choice reduction at 7 with 32 rule applications. Total rules 2253 place count 240 transition count 370
Iterating global reduction 7 with 32 rules applied. Total rules applied 2285 place count 240 transition count 370
Reduce places removed 23 places and 23 transitions.
Iterating global reduction 7 with 23 rules applied. Total rules applied 2308 place count 217 transition count 347
Applied a total of 2308 rules in 311 ms. Remains 217 /10629 variables (removed 10412) and now considering 347/20554 (removed 20207) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 347 rows 217 cols
[2023-03-12 21:58:34] [INFO ] Computed 18 place invariants in 1 ms
[2023-03-12 21:58:34] [INFO ] After 65ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-12 21:58:34] [INFO ] [Nat]Absence check using 15 positive place invariants in 2 ms returned sat
[2023-03-12 21:58:34] [INFO ] [Nat]Absence check using 15 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-12 21:58:35] [INFO ] After 177ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-12 21:58:35] [INFO ] After 320ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 107 ms.
[2023-03-12 21:58:35] [INFO ] After 514ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
[2023-03-12 21:58:35] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 5 ms.
[2023-03-12 21:58:35] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 10629 places, 20554 transitions and 82008 arcs took 116 ms.
[2023-03-12 21:58:36] [INFO ] Flatten gal took : 1142 ms
Total runtime 348839 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/558/inv_0_ --invariant=/tmp/558/inv_1_ --invariant=/tmp/558/inv_2_ --invariant=/tmp/558/inv_3_ --invariant=/tmp/558/inv_4_ --inv-par
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 160236 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16213840 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:
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
++ sed s/.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-100"
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-100, 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-167813695000694"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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