Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 18M
-rw-r--r-- 1 mcc users 7.2K Feb 26 08:33 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Feb 26 08:33 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 26 08:31 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 26 08:31 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 08:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 130K Feb 26 08:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Feb 26 08:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K Feb 26 08:35 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 18M Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME StableMarking

=== Now, execution of the tool begins

BK_START 1679134338008

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=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=RERS2020-PT-pb103
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-18 10:12:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2023-03-18 10:12:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 10:12:20] [INFO ] Load time of PNML (sax parser for PT used): 709 ms
[2023-03-18 10:12:20] [INFO ] Transformed 520 places.
[2023-03-18 10:12:20] [INFO ] Transformed 31658 transitions.
[2023-03-18 10:12:20] [INFO ] Found NUPN structural information;
[2023-03-18 10:12:20] [INFO ] Parsed PT model containing 520 places and 31658 transitions and 125892 arcs in 906 ms.
Ensure Unique test removed 3229 transitions
Reduce redundant transitions removed 3229 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 787 ms. (steps per millisecond=12 ) properties (out of 520) seen :207
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=14 ) properties (out of 313) seen :4
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=20 ) properties (out of 309) seen :3
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=20 ) properties (out of 306) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=14 ) properties (out of 306) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=14 ) properties (out of 306) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=20 ) properties (out of 306) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=20 ) properties (out of 306) seen :1
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=20 ) properties (out of 305) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=20 ) properties (out of 305) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=20 ) properties (out of 305) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 305) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=20 ) properties (out of 305) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=20 ) properties (out of 305) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 305) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=20 ) properties (out of 305) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=14 ) properties (out of 305) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=12 ) properties (out of 305) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=20 ) properties (out of 305) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=12 ) properties (out of 305) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 305) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=20 ) properties (out of 305) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 305) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 305) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 305) seen :1
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 304) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 304) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 304) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 304) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 304) seen :1
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 303) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 303) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 303) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 303) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 303) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 303) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 303) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 303) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 303) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 303) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 303) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 303) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 303) seen :1
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 302) seen :1
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 301) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 301) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 301) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 301) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 301) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 301) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 301) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 301) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 301) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 301) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 301) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 301) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 301) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 301) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 301) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 301) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 301) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 301) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 301) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 301) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 301) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 301) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 301) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 301) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 301) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 301) seen :1
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 300) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 300) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 300) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=9 ) properties (out of 300) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 300) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 300) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 300) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 300) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 300) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 300) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 300) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 300) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 300) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 300) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 300) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 300) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 300) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 300) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 300) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 300) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 300) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 300) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 300) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 300) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 300) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 300) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 300) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 300) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 300) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 300) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 300) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 300) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 300) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 300) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 300) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 300) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 300) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 300) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 300) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 300) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 300) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 300) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 300) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 300) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 300) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 300) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 300) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 300) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 300) seen :0
Running SMT prover for 300 properties.
[2023-03-18 10:12:21] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
// Phase 1: matrix 18674 rows 520 cols
[2023-03-18 10:12:21] [INFO ] Computed 15 place invariants in 109 ms
[2023-03-18 10:12:27] [INFO ] After 3608ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:300
[2023-03-18 10:12:30] [INFO ] [Nat]Absence check using 8 positive place invariants in 11 ms returned sat
[2023-03-18 10:12:30] [INFO ] [Nat]Absence check using 8 positive and 7 generalized place invariants in 4 ms returned sat
[2023-03-18 10:12:52] [INFO ] After 20622ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :300
[2023-03-18 10:12:53] [INFO ] State equation strengthened by 1379 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.solver.global.GlobalPropertySolver.applyReachabilitySolver(GlobalPropertySolver.java:724)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:558)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preSolveLiveness(GlobalPropertySolver.java:412)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preStableMarking(GlobalPropertySolver.java:321)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:294)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:386)
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-18 10:12:53] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 10:12:53] [INFO ] After 25216ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:300
Fused 300 Parikh solutions to 59 different solutions.
Parikh walk visited 0 properties in 256 ms.
Support contains 300 out of 520 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 520/520 places, 28429/28429 transitions.
Ensure Unique test removed 7 places
Drop transitions removed 1062 transitions
Reduce isomorphic transitions removed 1062 transitions.
Iterating post reduction 0 with 1069 rules applied. Total rules applied 1069 place count 513 transition count 27367
Free-agglomeration rule applied 8 times.
Iterating global reduction 1 with 8 rules applied. Total rules applied 1077 place count 513 transition count 27359
Reduce places removed 8 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 86 transitions
Reduce isomorphic transitions removed 87 transitions.
Iterating post reduction 1 with 95 rules applied. Total rules applied 1172 place count 505 transition count 27272
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 1173 place count 504 transition count 27271
Applied a total of 1173 rules in 540 ms. Remains 504 /520 variables (removed 16) and now considering 27271/28429 (removed 1158) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 545 ms. Remains : 504/520 places, 27271/28429 transitions.
Interrupted random walk after 565791 steps, including 1 resets, run timeout after 30001 ms. (steps per millisecond=18 ) properties seen 23
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 277) seen :12
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 265) seen :10
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 255) seen :11
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 244) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 238) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 237) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 233) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 230) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 225) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 225) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 225) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 225) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 223) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 223) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 223) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 223) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 223) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 222) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 222) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 222) 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 222) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 221) 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 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 221) 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 221) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 221) 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 221) 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 221) 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 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 221) 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 221) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 221) 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 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 221) seen :0
Running SMT prover for 221 properties.
[2023-03-18 10:13:28] [INFO ] Flow matrix only has 18595 transitions (discarded 8676 similar events)
// Phase 1: matrix 18595 rows 504 cols
[2023-03-18 10:13:28] [INFO ] Computed 8 place invariants in 86 ms
[2023-03-18 10:13:31] [INFO ] After 2117ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:221
[2023-03-18 10:13:32] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-18 10:14:42] [INFO ] After 67889ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :221
[2023-03-18 10:14:42] [INFO ] State equation strengthened by 1371 read => feed constraints.
[2023-03-18 10:17:16] [INFO ] After 153688ms SMT Verify possible using 1371 Read/Feed constraints in natural domain returned unsat :0 sat :219
[2023-03-18 10:17:16] [INFO ] After 153692ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :219
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-18 10:17:16] [INFO ] After 225042ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :219
Parikh walk visited 0 properties in 579 ms.
Support contains 221 out of 504 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 504/504 places, 27271/27271 transitions.
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 504 transition count 27270
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 503 transition count 27270
Applied a total of 2 rules in 254 ms. Remains 503 /504 variables (removed 1) and now considering 27270/27271 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 254 ms. Remains : 503/504 places, 27270/27271 transitions.
Interrupted random walk after 611657 steps, including 1 resets, run timeout after 30001 ms. (steps per millisecond=20 ) properties seen 0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 221) 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 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 221) 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 221) 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 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 221) 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 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 221) 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 221) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 221) seen :0
Interrupted probabilistic random walk after 1153843 steps, run timeout after 96001 ms. (steps per millisecond=12 ) properties seen :{}
Probabilistic random walk after 1153843 steps, saw 587460 distinct states, run finished after 96003 ms. (steps per millisecond=12 ) properties seen :0
Running SMT prover for 221 properties.
[2023-03-18 10:19:26] [INFO ] Flow matrix only has 18593 transitions (discarded 8677 similar events)
// Phase 1: matrix 18593 rows 503 cols
[2023-03-18 10:19:26] [INFO ] Computed 8 place invariants in 59 ms
[2023-03-18 10:19:29] [INFO ] After 2110ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:221
[2023-03-18 10:19:30] [INFO ] [Nat]Absence check using 8 positive place invariants in 7 ms returned sat
[2023-03-18 10:20:40] [INFO ] After 67953ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :221
[2023-03-18 10:20:40] [INFO ] State equation strengthened by 1370 read => feed constraints.
[2023-03-18 10:23:10] [INFO ] After 150548ms SMT Verify possible using 1370 Read/Feed constraints in natural domain returned unsat :0 sat :221
[2023-03-18 10:23:12] [INFO ] Deduced a trap composed of 101 places in 1542 ms of which 6 ms to minimize.
[2023-03-18 10:23:14] [INFO ] Deduced a trap composed of 12 places in 1475 ms of which 1 ms to minimize.
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.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
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.solver.global.GlobalPropertySolver.applyReachabilitySolver(GlobalPropertySolver.java:724)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:558)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preSolveLiveness(GlobalPropertySolver.java:412)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preStableMarking(GlobalPropertySolver.java:321)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:294)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:386)
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-18 10:23:14] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 10:23:14] [INFO ] After 225591ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:221
Fused 221 Parikh solutions to 220 different solutions.
Parikh walk visited 0 properties in 534 ms.
Support contains 221 out of 503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 503/503 places, 27270/27270 transitions.
Applied a total of 0 rules in 128 ms. Remains 503 /503 variables (removed 0) and now considering 27270/27270 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 129 ms. Remains : 503/503 places, 27270/27270 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 503/503 places, 27270/27270 transitions.
Applied a total of 0 rules in 108 ms. Remains 503 /503 variables (removed 0) and now considering 27270/27270 (removed 0) transitions.
[2023-03-18 10:23:15] [INFO ] Flow matrix only has 18593 transitions (discarded 8677 similar events)
[2023-03-18 10:23:15] [INFO ] Invariant cache hit.
[2023-03-18 10:23:16] [INFO ] Implicit Places using invariants in 540 ms returned []
Implicit Place search using SMT only with invariants took 542 ms to find 0 implicit places.
[2023-03-18 10:23:16] [INFO ] Flow matrix only has 18593 transitions (discarded 8677 similar events)
[2023-03-18 10:23:16] [INFO ] Invariant cache hit.
[2023-03-18 10:23:23] [INFO ] Dead Transitions using invariants and state equation in 7460 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8116 ms. Remains : 503/503 places, 27270/27270 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 6519 ms. (steps per millisecond=15 ) properties (out of 221) seen :0
Running SMT prover for 221 properties.
[2023-03-18 10:23:30] [INFO ] Flow matrix only has 18593 transitions (discarded 8677 similar events)
[2023-03-18 10:23:30] [INFO ] Invariant cache hit.
[2023-03-18 10:23:31] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-18 10:23:38] [INFO ] After 6969ms SMT Verify possible using state equation in real domain returned unsat :0 sat :221
[2023-03-18 10:23:38] [INFO ] State equation strengthened by 1370 read => feed constraints.
[2023-03-18 10:23:53] [INFO ] After 15016ms SMT Verify possible using 1370 Read/Feed constraints in real domain returned unsat :0 sat :221
[2023-03-18 10:23:55] [INFO ] Deduced a trap composed of 79 places in 1082 ms of which 1 ms to minimize.
[2023-03-18 10:23:56] [INFO ] Deduced a trap composed of 101 places in 1034 ms of which 12 ms to minimize.
[2023-03-18 10:23:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 3263 ms
[2023-03-18 10:24:00] [INFO ] Deduced a trap composed of 85 places in 1373 ms of which 1 ms to minimize.
[2023-03-18 10:24:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 2086 ms
[2023-03-18 10:24:03] [INFO ] Deduced a trap composed of 128 places in 1637 ms of which 1 ms to minimize.
[2023-03-18 10:24:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 2347 ms
[2023-03-18 10:24:07] [INFO ] Deduced a trap composed of 125 places in 1290 ms of which 0 ms to minimize.
[2023-03-18 10:24:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 2010 ms
[2023-03-18 10:24:11] [INFO ] Deduced a trap composed of 155 places in 1646 ms of which 1 ms to minimize.
[2023-03-18 10:24:13] [INFO ] Deduced a trap composed of 92 places in 1652 ms of which 1 ms to minimize.
[2023-03-18 10:24:15] [INFO ] Deduced a trap composed of 136 places in 1566 ms of which 1 ms to minimize.
[2023-03-18 10:24:16] [INFO ] Deduced a trap composed of 149 places in 1361 ms of which 1 ms to minimize.
[2023-03-18 10:24:17] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 8007 ms
[2023-03-18 10:24:18] [INFO ] Deduced a trap composed of 72 places in 1070 ms of which 1 ms to minimize.
[2023-03-18 10:24:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1921 ms
[2023-03-18 10:24:23] [INFO ] Deduced a trap composed of 49 places in 1229 ms of which 1 ms to minimize.
[2023-03-18 10:24:25] [INFO ] Deduced a trap composed of 95 places in 1133 ms of which 1 ms to minimize.
[2023-03-18 10:24:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 3442 ms
[2023-03-18 10:24:29] [INFO ] Deduced a trap composed of 145 places in 1737 ms of which 0 ms to minimize.
[2023-03-18 10:24:31] [INFO ] Deduced a trap composed of 84 places in 1662 ms of which 0 ms to minimize.
[2023-03-18 10:24:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 4465 ms
[2023-03-18 10:24:34] [INFO ] Deduced a trap composed of 60 places in 1591 ms of which 1 ms to minimize.
[2023-03-18 10:24:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 2322 ms
[2023-03-18 10:24:39] [INFO ] Deduced a trap composed of 187 places in 1660 ms of which 0 ms to minimize.
[2023-03-18 10:24:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 2380 ms
[2023-03-18 10:24:45] [INFO ] Deduced a trap composed of 11 places in 855 ms of which 1 ms to minimize.
[2023-03-18 10:24:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1619 ms
[2023-03-18 10:24:47] [INFO ] Deduced a trap composed of 13 places in 867 ms of which 0 ms to minimize.
[2023-03-18 10:24:48] [INFO ] Deduced a trap composed of 49 places in 808 ms of which 0 ms to minimize.
[2023-03-18 10:24:50] [INFO ] Deduced a trap composed of 53 places in 798 ms of which 0 ms to minimize.
[2023-03-18 10:24:50] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 3924 ms
[2023-03-18 10:24:54] [INFO ] Deduced a trap composed of 136 places in 1612 ms of which 1 ms to minimize.
[2023-03-18 10:24:56] [INFO ] Deduced a trap composed of 163 places in 1412 ms of which 0 ms to minimize.
[2023-03-18 10:24:58] [INFO ] Deduced a trap composed of 94 places in 1387 ms of which 0 ms to minimize.
[2023-03-18 10:24:59] [INFO ] Deduced a trap composed of 48 places in 1427 ms of which 1 ms to minimize.
[2023-03-18 10:25:00] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 7624 ms
[2023-03-18 10:25:10] [INFO ] Deduced a trap composed of 25 places in 1150 ms of which 1 ms to minimize.
[2023-03-18 10:25:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1905 ms
[2023-03-18 10:25:13] [INFO ] Deduced a trap composed of 12 places in 2078 ms of which 1 ms to minimize.
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.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
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.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:215)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositions(AtomicReducerSR.java:267)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:46)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:225)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.applyReachabilitySolver(GlobalPropertySolver.java:724)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:558)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preSolveLiveness(GlobalPropertySolver.java:412)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preStableMarking(GlobalPropertySolver.java:321)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:294)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:386)
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-18 10:25:13] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 10:25:13] [INFO ] After 102188ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Interrupted random walk after 613915 steps, including 2 resets, run timeout after 30001 ms. (steps per millisecond=20 ) properties seen 0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 221) 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 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 221) 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 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 221) 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 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 221) 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 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 221) 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 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 221) 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 221) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 221) seen :0
Interrupted probabilistic random walk after 1150135 steps, run timeout after 99001 ms. (steps per millisecond=11 ) properties seen :{}
Probabilistic random walk after 1150135 steps, saw 585751 distinct states, run finished after 99002 ms. (steps per millisecond=11 ) properties seen :0
Running SMT prover for 221 properties.
[2023-03-18 10:27:25] [INFO ] Flow matrix only has 18593 transitions (discarded 8677 similar events)
[2023-03-18 10:27:25] [INFO ] Invariant cache hit.
[2023-03-18 10:27:28] [INFO ] After 2205ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:221
[2023-03-18 10:27:29] [INFO ] [Nat]Absence check using 8 positive place invariants in 7 ms returned sat
[2023-03-18 10:28:40] [INFO ] After 69504ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :221
[2023-03-18 10:28:40] [INFO ] State equation strengthened by 1370 read => feed constraints.
[2023-03-18 10:31:13] [INFO ] After 152247ms SMT Verify possible using 1370 Read/Feed constraints in natural domain returned unsat :0 sat :219
[2023-03-18 10:31:13] [INFO ] After 152254ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :219
Attempting to minimize the solution found.
Minimization took 11 ms.
[2023-03-18 10:31:13] [INFO ] After 225052ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :219
Parikh walk visited 0 properties in 624 ms.
Support contains 221 out of 503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 503/503 places, 27270/27270 transitions.
Applied a total of 0 rules in 107 ms. Remains 503 /503 variables (removed 0) and now considering 27270/27270 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 107 ms. Remains : 503/503 places, 27270/27270 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 503/503 places, 27270/27270 transitions.
Applied a total of 0 rules in 111 ms. Remains 503 /503 variables (removed 0) and now considering 27270/27270 (removed 0) transitions.
[2023-03-18 10:31:14] [INFO ] Flow matrix only has 18593 transitions (discarded 8677 similar events)
[2023-03-18 10:31:14] [INFO ] Invariant cache hit.
[2023-03-18 10:31:14] [INFO ] Implicit Places using invariants in 546 ms returned []
Implicit Place search using SMT only with invariants took 547 ms to find 0 implicit places.
[2023-03-18 10:31:14] [INFO ] Flow matrix only has 18593 transitions (discarded 8677 similar events)
[2023-03-18 10:31:14] [INFO ] Invariant cache hit.
[2023-03-18 10:31:22] [INFO ] Dead Transitions using invariants and state equation in 7462 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8123 ms. Remains : 503/503 places, 27270/27270 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 4939 ms. (steps per millisecond=20 ) properties (out of 221) seen :0
Running SMT prover for 221 properties.
[2023-03-18 10:31:27] [INFO ] Flow matrix only has 18593 transitions (discarded 8677 similar events)
[2023-03-18 10:31:27] [INFO ] Invariant cache hit.
[2023-03-18 10:31:28] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-18 10:31:35] [INFO ] After 7046ms SMT Verify possible using state equation in real domain returned unsat :0 sat :221
[2023-03-18 10:31:35] [INFO ] State equation strengthened by 1370 read => feed constraints.
[2023-03-18 10:31:50] [INFO ] After 15466ms SMT Verify possible using 1370 Read/Feed constraints in real domain returned unsat :0 sat :221
[2023-03-18 10:31:52] [INFO ] Deduced a trap composed of 79 places in 1080 ms of which 0 ms to minimize.
[2023-03-18 10:31:53] [INFO ] Deduced a trap composed of 101 places in 1000 ms of which 0 ms to minimize.
[2023-03-18 10:31:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 3180 ms
[2023-03-18 10:31:57] [INFO ] Deduced a trap composed of 85 places in 1365 ms of which 1 ms to minimize.
[2023-03-18 10:31:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 2047 ms
[2023-03-18 10:31:59] [INFO ] Deduced a trap composed of 128 places in 1589 ms of which 0 ms to minimize.
[2023-03-18 10:32:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 2279 ms
[2023-03-18 10:32:04] [INFO ] Deduced a trap composed of 125 places in 1279 ms of which 0 ms to minimize.
[2023-03-18 10:32:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1986 ms
[2023-03-18 10:32:08] [INFO ] Deduced a trap composed of 155 places in 1638 ms of which 1 ms to minimize.
[2023-03-18 10:32:09] [INFO ] Deduced a trap composed of 92 places in 1613 ms of which 4 ms to minimize.
[2023-03-18 10:32:11] [INFO ] Deduced a trap composed of 136 places in 1562 ms of which 0 ms to minimize.
[2023-03-18 10:32:13] [INFO ] Deduced a trap composed of 149 places in 1394 ms of which 0 ms to minimize.
[2023-03-18 10:32:14] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 7952 ms
[2023-03-18 10:32:15] [INFO ] Deduced a trap composed of 72 places in 1054 ms of which 0 ms to minimize.
[2023-03-18 10:32:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1833 ms
[2023-03-18 10:32:20] [INFO ] Deduced a trap composed of 49 places in 1176 ms of which 0 ms to minimize.
[2023-03-18 10:32:22] [INFO ] Deduced a trap composed of 95 places in 1178 ms of which 1 ms to minimize.
[2023-03-18 10:32:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 3472 ms
[2023-03-18 10:32:26] [INFO ] Deduced a trap composed of 145 places in 1735 ms of which 1 ms to minimize.
[2023-03-18 10:32:28] [INFO ] Deduced a trap composed of 84 places in 1636 ms of which 0 ms to minimize.
[2023-03-18 10:32:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 4454 ms
[2023-03-18 10:32:31] [INFO ] Deduced a trap composed of 60 places in 1514 ms of which 0 ms to minimize.
[2023-03-18 10:32:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 2239 ms
[2023-03-18 10:32:36] [INFO ] Deduced a trap composed of 187 places in 1640 ms of which 0 ms to minimize.
[2023-03-18 10:32:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 2383 ms
[2023-03-18 10:32:42] [INFO ] Deduced a trap composed of 11 places in 851 ms of which 1 ms to minimize.
[2023-03-18 10:32:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1626 ms
[2023-03-18 10:32:44] [INFO ] Deduced a trap composed of 13 places in 888 ms of which 1 ms to minimize.
[2023-03-18 10:32:46] [INFO ] Deduced a trap composed of 49 places in 822 ms of which 1 ms to minimize.
[2023-03-18 10:32:47] [INFO ] Deduced a trap composed of 53 places in 807 ms of which 0 ms to minimize.
[2023-03-18 10:32:47] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 4010 ms
[2023-03-18 10:32:51] [INFO ] Deduced a trap composed of 136 places in 1683 ms of which 0 ms to minimize.
[2023-03-18 10:32:53] [INFO ] Deduced a trap composed of 163 places in 1391 ms of which 1 ms to minimize.
[2023-03-18 10:32:55] [INFO ] Deduced a trap composed of 94 places in 1395 ms of which 1 ms to minimize.
[2023-03-18 10:32:57] [INFO ] Deduced a trap composed of 48 places in 1410 ms of which 1 ms to minimize.
[2023-03-18 10:32:57] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 7672 ms
[2023-03-18 10:33:07] [INFO ] Deduced a trap composed of 25 places in 1187 ms of which 0 ms to minimize.
[2023-03-18 10:33:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1965 ms
[2023-03-18 10:33:08] [INFO ] After 92819ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :166 real:55
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-18 10:33:08] [INFO ] After 100176ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :166 real:55
[2023-03-18 10:33:08] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2023-03-18 10:33:15] [INFO ] After 7352ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :221
[2023-03-18 10:34:48] [INFO ] After 92482ms SMT Verify possible using 1370 Read/Feed constraints in natural domain returned unsat :0 sat :220
[2023-03-18 10:34:48] [INFO ] After 92483ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :220
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-03-18 10:34:48] [INFO ] After 100046ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :220
Incomplete random walk after 10000 steps, including 2 resets, run finished after 190 ms. (steps per millisecond=52 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 39013 steps, run timeout after 3001 ms. (steps per millisecond=13 ) properties seen :{}
Probabilistic random walk after 39013 steps, saw 27616 distinct states, run finished after 3001 ms. (steps per millisecond=13 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 10:34:51] [INFO ] Flow matrix only has 18593 transitions (discarded 8677 similar events)
[2023-03-18 10:34:51] [INFO ] Invariant cache hit.
[2023-03-18 10:34:51] [INFO ] After 88ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 10:34:51] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-18 10:34:54] [INFO ] After 3370ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 10:34:55] [INFO ] State equation strengthened by 1370 read => feed constraints.
[2023-03-18 10:35:00] [INFO ] After 5235ms SMT Verify possible using 1370 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 10:35:02] [INFO ] Deduced a trap composed of 60 places in 1880 ms of which 1 ms to minimize.
[2023-03-18 10:35:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 2774 ms
[2023-03-18 10:35:03] [INFO ] After 8413ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 453 ms.
[2023-03-18 10:35:03] [INFO ] After 12423ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 7 ms.
Support contains 1 out of 503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 503/503 places, 27270/27270 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 8 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 502 transition count 27269
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 8 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 501 transition count 27280
Free-agglomeration rule applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 501 transition count 27277
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 11 place count 498 transition count 27276
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 498 transition count 27456
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 497 transition count 27456
Applied a total of 13 rules in 469 ms. Remains 497 /503 variables (removed 6) and now considering 27456/27270 (removed -186) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 470 ms. Remains : 497/503 places, 27456/27270 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 229 ms. (steps per millisecond=43 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 39585 steps, run timeout after 3001 ms. (steps per millisecond=13 ) properties seen :{}
Probabilistic random walk after 39585 steps, saw 28032 distinct states, run finished after 3001 ms. (steps per millisecond=13 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 10:35:07] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
// Phase 1: matrix 18727 rows 497 cols
[2023-03-18 10:35:07] [INFO ] Computed 8 place invariants in 60 ms
[2023-03-18 10:35:07] [INFO ] After 80ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 10:35:07] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-18 10:35:11] [INFO ] After 3385ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 10:35:11] [INFO ] State equation strengthened by 1374 read => feed constraints.
[2023-03-18 10:35:19] [INFO ] After 8240ms SMT Verify possible using 1374 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 10:35:21] [INFO ] Deduced a trap composed of 101 places in 1190 ms of which 0 ms to minimize.
[2023-03-18 10:35:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 2443 ms
[2023-03-18 10:35:22] [INFO ] After 11555ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 589 ms.
[2023-03-18 10:35:23] [INFO ] After 15721ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 497 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 27456/27456 transitions.
Applied a total of 0 rules in 109 ms. Remains 497 /497 variables (removed 0) and now considering 27456/27456 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 110 ms. Remains : 497/497 places, 27456/27456 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 27456/27456 transitions.
Applied a total of 0 rules in 110 ms. Remains 497 /497 variables (removed 0) and now considering 27456/27456 (removed 0) transitions.
[2023-03-18 10:35:23] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
[2023-03-18 10:35:23] [INFO ] Invariant cache hit.
[2023-03-18 10:35:24] [INFO ] Implicit Places using invariants in 922 ms returned []
Implicit Place search using SMT only with invariants took 923 ms to find 0 implicit places.
[2023-03-18 10:35:24] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
[2023-03-18 10:35:24] [INFO ] Invariant cache hit.
[2023-03-18 10:35:32] [INFO ] Dead Transitions using invariants and state equation in 7608 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8644 ms. Remains : 497/497 places, 27456/27456 transitions.
Graph (trivial) has 10356 edges and 497 vertex of which 381 / 497 are part of one of the 62 SCC in 6 ms
Free SCC test removed 319 places
Drop transitions removed 11224 transitions
Ensure Unique test removed 13923 transitions
Reduce isomorphic transitions removed 25147 transitions.
Graph (complete) has 2322 edges and 178 vertex of which 170 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.2 ms
Discarding 8 places :
Also discarding 0 output transitions
Drop transitions removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 14 rules applied. Total rules applied 16 place count 170 transition count 2295
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 18 place count 168 transition count 2295
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 19 place count 167 transition count 2285
Iterating global reduction 2 with 1 rules applied. Total rules applied 20 place count 167 transition count 2285
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 24 place count 165 transition count 2283
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 2 with 33 rules applied. Total rules applied 57 place count 165 transition count 2250
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 59 place count 164 transition count 2260
Drop transitions removed 1196 transitions
Redundant transition composition rules discarded 1196 transitions
Iterating global reduction 3 with 1196 rules applied. Total rules applied 1255 place count 164 transition count 1064
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1223 edges and 162 vertex of which 143 are kept as prefixes of interest. Removing 19 places using SCC suffix rule.1 ms
Discarding 19 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Iterating post reduction 3 with 11 rules applied. Total rules applied 1266 place count 143 transition count 1053
Drop transitions removed 114 transitions
Reduce isomorphic transitions removed 114 transitions.
Iterating post reduction 4 with 114 rules applied. Total rules applied 1380 place count 143 transition count 939
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1382 place count 141 transition count 929
Iterating global reduction 5 with 2 rules applied. Total rules applied 1384 place count 141 transition count 929
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1385 place count 141 transition count 928
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1387 place count 140 transition count 927
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 6 with 6 rules applied. Total rules applied 1393 place count 140 transition count 921
Free-agglomeration rule applied 12 times with reduction of 7 identical transitions.
Iterating global reduction 6 with 12 rules applied. Total rules applied 1405 place count 140 transition count 902
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 6 with 32 rules applied. Total rules applied 1437 place count 128 transition count 882
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1438 place count 127 transition count 880
Iterating global reduction 7 with 1 rules applied. Total rules applied 1439 place count 127 transition count 880
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 1447 place count 127 transition count 872
Drop transitions removed 58 transitions
Redundant transition composition rules discarded 58 transitions
Iterating global reduction 8 with 58 rules applied. Total rules applied 1505 place count 127 transition count 814
Free-agglomeration rule applied 5 times.
Iterating global reduction 8 with 5 rules applied. Total rules applied 1510 place count 127 transition count 809
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 9 rules applied. Total rules applied 1519 place count 122 transition count 805
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 9 with 4 rules applied. Total rules applied 1523 place count 122 transition count 801
Free-agglomeration rule applied 1 times.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1524 place count 122 transition count 800
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 1527 place count 121 transition count 798
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 1529 place count 121 transition count 796
Free-agglomeration rule applied 1 times.
Iterating global reduction 10 with 1 rules applied. Total rules applied 1530 place count 121 transition count 795
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 3 rules applied. Total rules applied 1533 place count 120 transition count 793
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 11 with 2 rules applied. Total rules applied 1535 place count 120 transition count 791
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 11 with 5 rules applied. Total rules applied 1540 place count 120 transition count 875
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 11 with 21 rules applied. Total rules applied 1561 place count 115 transition count 859
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 1562 place count 114 transition count 855
Iterating global reduction 12 with 1 rules applied. Total rules applied 1563 place count 114 transition count 855
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 12 with 9 rules applied. Total rules applied 1572 place count 114 transition count 846
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 13 with 19 rules applied. Total rules applied 1591 place count 114 transition count 827
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 13 with 2 rules applied. Total rules applied 1593 place count 114 transition count 827
Applied a total of 1593 rules in 296 ms. Remains 114 /497 variables (removed 383) and now considering 827/27456 (removed 26629) transitions.
Running SMT prover for 1 properties.
[2023-03-18 10:35:32] [INFO ] Flow matrix only has 786 transitions (discarded 41 similar events)
// Phase 1: matrix 786 rows 114 cols
[2023-03-18 10:35:32] [INFO ] Computed 0 place invariants in 9 ms
[2023-03-18 10:35:32] [INFO ] After 23ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 10:35:32] [INFO ] After 104ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 10:35:32] [INFO ] State equation strengthened by 15 read => feed constraints.
[2023-03-18 10:35:32] [INFO ] After 20ms SMT Verify possible using 15 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 10:35:32] [INFO ] After 47ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 19 ms.
[2023-03-18 10:35:32] [INFO ] After 200ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 2 resets, run finished after 193 ms. (steps per millisecond=51 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 40127 steps, run timeout after 3001 ms. (steps per millisecond=13 ) properties seen :{}
Probabilistic random walk after 40127 steps, saw 28423 distinct states, run finished after 3001 ms. (steps per millisecond=13 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 10:35:36] [INFO ] Flow matrix only has 18593 transitions (discarded 8677 similar events)
// Phase 1: matrix 18593 rows 503 cols
[2023-03-18 10:35:36] [INFO ] Computed 8 place invariants in 85 ms
[2023-03-18 10:35:36] [INFO ] After 77ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 10:35:36] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-18 10:35:39] [INFO ] After 3382ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 10:35:39] [INFO ] State equation strengthened by 1370 read => feed constraints.
[2023-03-18 10:35:47] [INFO ] After 7471ms SMT Verify possible using 1370 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 10:35:49] [INFO ] Deduced a trap composed of 158 places in 1669 ms of which 1 ms to minimize.
[2023-03-18 10:35:51] [INFO ] Deduced a trap composed of 136 places in 1659 ms of which 1 ms to minimize.
[2023-03-18 10:35:53] [INFO ] Deduced a trap composed of 82 places in 1174 ms of which 0 ms to minimize.
[2023-03-18 10:35:53] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 6102 ms
[2023-03-18 10:35:53] [INFO ] After 13855ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 586 ms.
[2023-03-18 10:35:54] [INFO ] After 18009ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 503/503 places, 27270/27270 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 8 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 502 transition count 27269
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 8 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 501 transition count 27280
Free-agglomeration rule applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 501 transition count 27277
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 11 place count 498 transition count 27276
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 498 transition count 27456
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 497 transition count 27456
Applied a total of 13 rules in 511 ms. Remains 497 /503 variables (removed 6) and now considering 27456/27270 (removed -186) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 512 ms. Remains : 497/503 places, 27456/27270 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 191 ms. (steps per millisecond=52 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 40434 steps, run timeout after 3001 ms. (steps per millisecond=13 ) properties seen :{}
Probabilistic random walk after 40434 steps, saw 28632 distinct states, run finished after 3001 ms. (steps per millisecond=13 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 10:35:58] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
// Phase 1: matrix 18727 rows 497 cols
[2023-03-18 10:35:58] [INFO ] Computed 8 place invariants in 60 ms
[2023-03-18 10:35:58] [INFO ] After 82ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 10:35:58] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-18 10:36:01] [INFO ] After 3369ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 10:36:01] [INFO ] State equation strengthened by 1374 read => feed constraints.
[2023-03-18 10:36:10] [INFO ] After 9082ms SMT Verify possible using 1374 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 10:36:13] [INFO ] Deduced a trap composed of 47 places in 1962 ms of which 1 ms to minimize.
[2023-03-18 10:36:15] [INFO ] Deduced a trap composed of 49 places in 1790 ms of which 1 ms to minimize.
[2023-03-18 10:36:17] [INFO ] Deduced a trap composed of 137 places in 1655 ms of which 1 ms to minimize.
[2023-03-18 10:36:19] [INFO ] Deduced a trap composed of 127 places in 1686 ms of which 2 ms to minimize.
[2023-03-18 10:36:21] [INFO ] Deduced a trap composed of 51 places in 1645 ms of which 0 ms to minimize.
[2023-03-18 10:36:23] [INFO ] Deduced a trap composed of 144 places in 1635 ms of which 4 ms to minimize.
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.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
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.solver.logic.AtomicReducerSR.checkAtomicPropositions(AtomicReducerSR.java:365)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:253)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.applyReachabilitySolver(GlobalPropertySolver.java:724)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:558)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preSolveLiveness(GlobalPropertySolver.java:412)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preStableMarking(GlobalPropertySolver.java:321)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:294)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:386)
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-18 10:36:23] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 10:36:23] [INFO ] After 25410ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 497 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 27456/27456 transitions.
Applied a total of 0 rules in 102 ms. Remains 497 /497 variables (removed 0) and now considering 27456/27456 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 102 ms. Remains : 497/497 places, 27456/27456 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 27456/27456 transitions.
Applied a total of 0 rules in 100 ms. Remains 497 /497 variables (removed 0) and now considering 27456/27456 (removed 0) transitions.
[2023-03-18 10:36:23] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
[2023-03-18 10:36:23] [INFO ] Invariant cache hit.
[2023-03-18 10:36:24] [INFO ] Implicit Places using invariants in 890 ms returned []
Implicit Place search using SMT only with invariants took 891 ms to find 0 implicit places.
[2023-03-18 10:36:24] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
[2023-03-18 10:36:24] [INFO ] Invariant cache hit.
[2023-03-18 10:36:32] [INFO ] Dead Transitions using invariants and state equation in 7482 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8475 ms. Remains : 497/497 places, 27456/27456 transitions.
Graph (trivial) has 10311 edges and 497 vertex of which 381 / 497 are part of one of the 62 SCC in 1 ms
Free SCC test removed 319 places
Drop transitions removed 11224 transitions
Ensure Unique test removed 13923 transitions
Reduce isomorphic transitions removed 25147 transitions.
Graph (complete) has 2322 edges and 178 vertex of which 171 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 0 output transitions
Drop transitions removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 13 rules applied. Total rules applied 15 place count 171 transition count 2296
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 17 place count 169 transition count 2296
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 18 place count 168 transition count 2286
Iterating global reduction 2 with 1 rules applied. Total rules applied 19 place count 168 transition count 2286
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 23 place count 166 transition count 2284
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 2 with 33 rules applied. Total rules applied 56 place count 166 transition count 2251
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 58 place count 165 transition count 2261
Drop transitions removed 1202 transitions
Redundant transition composition rules discarded 1202 transitions
Iterating global reduction 3 with 1202 rules applied. Total rules applied 1260 place count 165 transition count 1059
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (complete) has 1220 edges and 162 vertex of which 2 are kept as prefixes of interest. Removing 160 places using SCC suffix rule.0 ms
Discarding 160 places :
Also discarding 1034 output transitions
Drop transitions removed 1034 transitions
Iterating post reduction 3 with 15 rules applied. Total rules applied 1275 place count 2 transition count 14
Drop transitions removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 4 with 13 rules applied. Total rules applied 1288 place count 2 transition count 1
Applied a total of 1288 rules in 141 ms. Remains 2 /497 variables (removed 495) and now considering 1/27456 (removed 27455) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1 rows 2 cols
[2023-03-18 10:36:32] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-18 10:36:32] [INFO ] After 15ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 10:36:32] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-18 10:36:32] [INFO ] After 1ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 10:36:32] [INFO ] After 3ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-18 10:36:32] [INFO ] After 20ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 3 resets, run finished after 193 ms. (steps per millisecond=51 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 41187 steps, run timeout after 3001 ms. (steps per millisecond=13 ) properties seen :{}
Probabilistic random walk after 41187 steps, saw 29115 distinct states, run finished after 3001 ms. (steps per millisecond=13 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 10:36:35] [INFO ] Flow matrix only has 18593 transitions (discarded 8677 similar events)
// Phase 1: matrix 18593 rows 503 cols
[2023-03-18 10:36:35] [INFO ] Computed 8 place invariants in 53 ms
[2023-03-18 10:36:35] [INFO ] After 88ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 10:36:35] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-18 10:36:39] [INFO ] After 3346ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 10:36:39] [INFO ] State equation strengthened by 1370 read => feed constraints.
[2023-03-18 10:36:45] [INFO ] After 6266ms SMT Verify possible using 1370 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 10:36:48] [INFO ] Deduced a trap composed of 13 places in 654 ms of which 0 ms to minimize.
[2023-03-18 10:36:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1400 ms
[2023-03-18 10:36:48] [INFO ] After 9357ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 739 ms.
[2023-03-18 10:36:49] [INFO ] After 13659ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 503/503 places, 27270/27270 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 8 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 502 transition count 27269
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 8 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 501 transition count 27280
Free-agglomeration rule applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 501 transition count 27277
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 11 place count 498 transition count 27276
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 498 transition count 27456
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 497 transition count 27456
Applied a total of 13 rules in 431 ms. Remains 497 /503 variables (removed 6) and now considering 27456/27270 (removed -186) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 432 ms. Remains : 497/503 places, 27456/27270 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 191 ms. (steps per millisecond=52 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 40314 steps, run timeout after 3001 ms. (steps per millisecond=13 ) properties seen :{}
Probabilistic random walk after 40314 steps, saw 28562 distinct states, run finished after 3001 ms. (steps per millisecond=13 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 10:36:53] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
// Phase 1: matrix 18727 rows 497 cols
[2023-03-18 10:36:53] [INFO ] Computed 8 place invariants in 51 ms
[2023-03-18 10:36:53] [INFO ] After 87ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 10:36:53] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-18 10:36:56] [INFO ] After 3349ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 10:36:56] [INFO ] State equation strengthened by 1374 read => feed constraints.
[2023-03-18 10:37:00] [INFO ] After 3223ms SMT Verify possible using 1374 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 10:37:00] [INFO ] After 3898ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1505 ms.
[2023-03-18 10:37:02] [INFO ] After 8937ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 497 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 27456/27456 transitions.
Applied a total of 0 rules in 103 ms. Remains 497 /497 variables (removed 0) and now considering 27456/27456 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 103 ms. Remains : 497/497 places, 27456/27456 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 27456/27456 transitions.
Applied a total of 0 rules in 95 ms. Remains 497 /497 variables (removed 0) and now considering 27456/27456 (removed 0) transitions.
[2023-03-18 10:37:02] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
[2023-03-18 10:37:02] [INFO ] Invariant cache hit.
[2023-03-18 10:37:03] [INFO ] Implicit Places using invariants in 893 ms returned []
Implicit Place search using SMT only with invariants took 902 ms to find 0 implicit places.
[2023-03-18 10:37:03] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
[2023-03-18 10:37:03] [INFO ] Invariant cache hit.
[2023-03-18 10:37:10] [INFO ] Dead Transitions using invariants and state equation in 7459 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8459 ms. Remains : 497/497 places, 27456/27456 transitions.
Graph (trivial) has 10249 edges and 497 vertex of which 378 / 497 are part of one of the 61 SCC in 1 ms
Free SCC test removed 317 places
Drop transitions removed 10913 transitions
Ensure Unique test removed 14180 transitions
Reduce isomorphic transitions removed 25093 transitions.
Graph (complete) has 2405 edges and 180 vertex of which 172 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 0 output transitions
Drop transitions removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 14 rules applied. Total rules applied 16 place count 172 transition count 2349
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 18 place count 170 transition count 2349
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 19 place count 169 transition count 2339
Iterating global reduction 2 with 1 rules applied. Total rules applied 20 place count 169 transition count 2339
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 24 place count 167 transition count 2337
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 2 with 33 rules applied. Total rules applied 57 place count 167 transition count 2304
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 59 place count 166 transition count 2314
Drop transitions removed 1204 transitions
Redundant transition composition rules discarded 1204 transitions
Iterating global reduction 3 with 1204 rules applied. Total rules applied 1263 place count 166 transition count 1110
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1292 edges and 164 vertex of which 146 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.0 ms
Discarding 18 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Iterating post reduction 3 with 11 rules applied. Total rules applied 1274 place count 146 transition count 1099
Drop transitions removed 113 transitions
Reduce isomorphic transitions removed 113 transitions.
Iterating post reduction 4 with 113 rules applied. Total rules applied 1387 place count 146 transition count 986
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1389 place count 144 transition count 976
Iterating global reduction 5 with 2 rules applied. Total rules applied 1391 place count 144 transition count 976
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1392 place count 144 transition count 975
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1394 place count 143 transition count 974
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 6 with 5 rules applied. Total rules applied 1399 place count 143 transition count 969
Free-agglomeration rule applied 12 times with reduction of 7 identical transitions.
Iterating global reduction 6 with 12 rules applied. Total rules applied 1411 place count 143 transition count 950
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 6 with 32 rules applied. Total rules applied 1443 place count 131 transition count 930
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1444 place count 130 transition count 926
Iterating global reduction 7 with 1 rules applied. Total rules applied 1445 place count 130 transition count 926
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 1453 place count 130 transition count 918
Drop transitions removed 58 transitions
Redundant transition composition rules discarded 58 transitions
Iterating global reduction 8 with 58 rules applied. Total rules applied 1511 place count 130 transition count 860
Free-agglomeration rule applied 6 times.
Iterating global reduction 8 with 6 rules applied. Total rules applied 1517 place count 130 transition count 854
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 10 rules applied. Total rules applied 1527 place count 124 transition count 850
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 9 with 7 rules applied. Total rules applied 1534 place count 124 transition count 843
Free-agglomeration rule applied 2 times.
Iterating global reduction 9 with 2 rules applied. Total rules applied 1536 place count 124 transition count 841
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 1540 place count 122 transition count 839
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 10 with 4 rules applied. Total rules applied 1544 place count 122 transition count 835
Free-agglomeration rule applied 2 times.
Iterating global reduction 10 with 2 rules applied. Total rules applied 1546 place count 122 transition count 833
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 1550 place count 120 transition count 831
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 11 with 3 rules applied. Total rules applied 1553 place count 120 transition count 828
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 11 with 4 rules applied. Total rules applied 1557 place count 120 transition count 912
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 11 with 19 rules applied. Total rules applied 1576 place count 116 transition count 897
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 1577 place count 115 transition count 893
Iterating global reduction 12 with 1 rules applied. Total rules applied 1578 place count 115 transition count 893
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 12 with 9 rules applied. Total rules applied 1587 place count 115 transition count 884
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 13 with 19 rules applied. Total rules applied 1606 place count 115 transition count 865
Applied a total of 1606 rules in 234 ms. Remains 115 /497 variables (removed 382) and now considering 865/27456 (removed 26591) transitions.
Running SMT prover for 1 properties.
[2023-03-18 10:37:11] [INFO ] Flow matrix only has 824 transitions (discarded 41 similar events)
// Phase 1: matrix 824 rows 115 cols
[2023-03-18 10:37:11] [INFO ] Computed 0 place invariants in 4 ms
[2023-03-18 10:37:11] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 10:37:11] [INFO ] After 113ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 10:37:11] [INFO ] State equation strengthened by 15 read => feed constraints.
[2023-03-18 10:37:11] [INFO ] After 24ms SMT Verify possible using 15 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 10:37:11] [INFO ] After 53ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2023-03-18 10:37:11] [INFO ] After 213ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 2 resets, run finished after 191 ms. (steps per millisecond=52 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 41142 steps, run timeout after 3001 ms. (steps per millisecond=13 ) properties seen :{}
Probabilistic random walk after 41142 steps, saw 29101 distinct states, run finished after 3001 ms. (steps per millisecond=13 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 10:37:14] [INFO ] Flow matrix only has 18593 transitions (discarded 8677 similar events)
// Phase 1: matrix 18593 rows 503 cols
[2023-03-18 10:37:14] [INFO ] Computed 8 place invariants in 74 ms
[2023-03-18 10:37:14] [INFO ] After 78ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 10:37:14] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-18 10:37:18] [INFO ] After 3311ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 10:37:18] [INFO ] State equation strengthened by 1370 read => feed constraints.
[2023-03-18 10:37:21] [INFO ] After 3172ms SMT Verify possible using 1370 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 10:37:23] [INFO ] Deduced a trap composed of 49 places in 1734 ms of which 1 ms to minimize.
[2023-03-18 10:37:26] [INFO ] Deduced a trap composed of 91 places in 1741 ms of which 1 ms to minimize.
[2023-03-18 10:37:28] [INFO ] Deduced a trap composed of 11 places in 1770 ms of which 0 ms to minimize.
[2023-03-18 10:37:32] [INFO ] Deduced a trap composed of 49 places in 1602 ms of which 1 ms to minimize.
[2023-03-18 10:37:35] [INFO ] Deduced a trap composed of 68 places in 1574 ms of which 1 ms to minimize.
[2023-03-18 10:37:37] [INFO ] Deduced a trap composed of 101 places in 1383 ms of which 1 ms to minimize.
[2023-03-18 10:37:38] [INFO ] Deduced a trap composed of 92 places in 1059 ms of which 1 ms to minimize.
[2023-03-18 10:37:41] [INFO ] Deduced a trap composed of 51 places in 1673 ms of which 0 ms to minimize.
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.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
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.solver.logic.AtomicReducerSR.checkAtomicPropositions(AtomicReducerSR.java:365)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:253)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.applyReachabilitySolver(GlobalPropertySolver.java:724)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:558)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preSolveLiveness(GlobalPropertySolver.java:412)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preStableMarking(GlobalPropertySolver.java:321)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:294)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:386)
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-18 10:37:41] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 10:37:41] [INFO ] After 26424ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 503/503 places, 27270/27270 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 8 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 502 transition count 27269
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 8 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 501 transition count 27280
Free-agglomeration rule applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 501 transition count 27277
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 11 place count 498 transition count 27276
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 498 transition count 27456
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 497 transition count 27456
Applied a total of 13 rules in 441 ms. Remains 497 /503 variables (removed 6) and now considering 27456/27270 (removed -186) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 442 ms. Remains : 497/503 places, 27456/27270 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 194 ms. (steps per millisecond=51 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 39117 steps, run timeout after 3001 ms. (steps per millisecond=13 ) properties seen :{}
Probabilistic random walk after 39117 steps, saw 27694 distinct states, run finished after 3001 ms. (steps per millisecond=13 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 10:37:44] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
// Phase 1: matrix 18727 rows 497 cols
[2023-03-18 10:37:44] [INFO ] Computed 8 place invariants in 78 ms
[2023-03-18 10:37:45] [INFO ] After 87ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 10:37:45] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-18 10:37:48] [INFO ] After 3543ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 10:37:48] [INFO ] State equation strengthened by 1374 read => feed constraints.
[2023-03-18 10:37:51] [INFO ] After 2879ms SMT Verify possible using 1374 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 10:37:54] [INFO ] Deduced a trap composed of 21 places in 1870 ms of which 1 ms to minimize.
[2023-03-18 10:37:56] [INFO ] Deduced a trap composed of 92 places in 1525 ms of which 1 ms to minimize.
[2023-03-18 10:37:58] [INFO ] Deduced a trap composed of 49 places in 1938 ms of which 0 ms to minimize.
[2023-03-18 10:38:00] [INFO ] Deduced a trap composed of 47 places in 1876 ms of which 1 ms to minimize.
[2023-03-18 10:38:02] [INFO ] Deduced a trap composed of 51 places in 1798 ms of which 0 ms to minimize.
[2023-03-18 10:38:04] [INFO ] Deduced a trap composed of 91 places in 1674 ms of which 0 ms to minimize.
[2023-03-18 10:38:07] [INFO ] Deduced a trap composed of 84 places in 1698 ms of which 1 ms to minimize.
[2023-03-18 10:38:09] [INFO ] Deduced a trap composed of 12 places in 1844 ms of which 1 ms to minimize.
[2023-03-18 10:38:12] [INFO ] Deduced a trap composed of 12 places in 2078 ms of which 1 ms to minimize.
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.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
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.solver.logic.AtomicReducerSR.checkAtomicPropositions(AtomicReducerSR.java:365)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:253)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.applyReachabilitySolver(GlobalPropertySolver.java:724)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:558)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preSolveLiveness(GlobalPropertySolver.java:412)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preStableMarking(GlobalPropertySolver.java:321)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:294)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:386)
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-18 10:38:12] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 10:38:12] [INFO ] After 27103ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 497 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 27456/27456 transitions.
Applied a total of 0 rules in 96 ms. Remains 497 /497 variables (removed 0) and now considering 27456/27456 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 96 ms. Remains : 497/497 places, 27456/27456 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 27456/27456 transitions.
Applied a total of 0 rules in 92 ms. Remains 497 /497 variables (removed 0) and now considering 27456/27456 (removed 0) transitions.
[2023-03-18 10:38:12] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
[2023-03-18 10:38:12] [INFO ] Invariant cache hit.
[2023-03-18 10:38:13] [INFO ] Implicit Places using invariants in 887 ms returned []
Implicit Place search using SMT only with invariants took 888 ms to find 0 implicit places.
[2023-03-18 10:38:13] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
[2023-03-18 10:38:13] [INFO ] Invariant cache hit.
[2023-03-18 10:38:21] [INFO ] Dead Transitions using invariants and state equation in 7964 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8947 ms. Remains : 497/497 places, 27456/27456 transitions.
Graph (trivial) has 10333 edges and 497 vertex of which 381 / 497 are part of one of the 62 SCC in 1 ms
Free SCC test removed 319 places
Drop transitions removed 11224 transitions
Ensure Unique test removed 13923 transitions
Reduce isomorphic transitions removed 25147 transitions.
Graph (complete) has 2322 edges and 178 vertex of which 170 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 0 output transitions
Drop transitions removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 14 rules applied. Total rules applied 16 place count 170 transition count 2295
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 18 place count 168 transition count 2295
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 19 place count 167 transition count 2285
Iterating global reduction 2 with 1 rules applied. Total rules applied 20 place count 167 transition count 2285
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 24 place count 165 transition count 2283
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 2 with 33 rules applied. Total rules applied 57 place count 165 transition count 2250
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 59 place count 164 transition count 2260
Drop transitions removed 1196 transitions
Redundant transition composition rules discarded 1196 transitions
Iterating global reduction 3 with 1196 rules applied. Total rules applied 1255 place count 164 transition count 1064
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1223 edges and 162 vertex of which 143 are kept as prefixes of interest. Removing 19 places using SCC suffix rule.1 ms
Discarding 19 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Iterating post reduction 3 with 11 rules applied. Total rules applied 1266 place count 143 transition count 1053
Drop transitions removed 115 transitions
Reduce isomorphic transitions removed 115 transitions.
Iterating post reduction 4 with 115 rules applied. Total rules applied 1381 place count 143 transition count 938
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1383 place count 141 transition count 928
Iterating global reduction 5 with 2 rules applied. Total rules applied 1385 place count 141 transition count 928
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1386 place count 141 transition count 927
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1388 place count 140 transition count 926
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 6 with 5 rules applied. Total rules applied 1393 place count 140 transition count 921
Free-agglomeration rule applied 12 times with reduction of 7 identical transitions.
Iterating global reduction 6 with 12 rules applied. Total rules applied 1405 place count 140 transition count 902
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 6 with 32 rules applied. Total rules applied 1437 place count 128 transition count 882
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1438 place count 127 transition count 880
Iterating global reduction 7 with 1 rules applied. Total rules applied 1439 place count 127 transition count 880
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 1447 place count 127 transition count 872
Drop transitions removed 58 transitions
Redundant transition composition rules discarded 58 transitions
Iterating global reduction 8 with 58 rules applied. Total rules applied 1505 place count 127 transition count 814
Free-agglomeration rule applied 6 times.
Iterating global reduction 8 with 6 rules applied. Total rules applied 1511 place count 127 transition count 808
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 10 rules applied. Total rules applied 1521 place count 121 transition count 804
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 9 with 6 rules applied. Total rules applied 1527 place count 121 transition count 798
Free-agglomeration rule applied 2 times.
Iterating global reduction 9 with 2 rules applied. Total rules applied 1529 place count 121 transition count 796
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 1533 place count 119 transition count 794
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 10 with 4 rules applied. Total rules applied 1537 place count 119 transition count 790
Free-agglomeration rule applied 2 times.
Iterating global reduction 10 with 2 rules applied. Total rules applied 1539 place count 119 transition count 788
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 1543 place count 117 transition count 786
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 11 with 2 rules applied. Total rules applied 1545 place count 117 transition count 784
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 11 with 5 rules applied. Total rules applied 1550 place count 117 transition count 868
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 11 with 21 rules applied. Total rules applied 1571 place count 112 transition count 852
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 1572 place count 111 transition count 848
Iterating global reduction 12 with 1 rules applied. Total rules applied 1573 place count 111 transition count 848
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 12 with 9 rules applied. Total rules applied 1582 place count 111 transition count 839
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 13 with 19 rules applied. Total rules applied 1601 place count 111 transition count 820
Applied a total of 1601 rules in 199 ms. Remains 111 /497 variables (removed 386) and now considering 820/27456 (removed 26636) transitions.
Running SMT prover for 1 properties.
[2023-03-18 10:38:21] [INFO ] Flow matrix only has 779 transitions (discarded 41 similar events)
// Phase 1: matrix 779 rows 111 cols
[2023-03-18 10:38:21] [INFO ] Computed 0 place invariants in 3 ms
[2023-03-18 10:38:21] [INFO ] After 27ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 10:38:21] [INFO ] After 113ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 10:38:21] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-18 10:38:21] [INFO ] After 23ms SMT Verify possible using 16 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 10:38:21] [INFO ] After 52ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2023-03-18 10:38:21] [INFO ] After 214ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 2 resets, run finished after 208 ms. (steps per millisecond=48 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 39457 steps, run timeout after 3001 ms. (steps per millisecond=13 ) properties seen :{}
Probabilistic random walk after 39457 steps, saw 27923 distinct states, run finished after 3001 ms. (steps per millisecond=13 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 10:38:24] [INFO ] Flow matrix only has 18593 transitions (discarded 8677 similar events)
// Phase 1: matrix 18593 rows 503 cols
[2023-03-18 10:38:25] [INFO ] Computed 8 place invariants in 56 ms
[2023-03-18 10:38:25] [INFO ] After 84ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 10:38:25] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-18 10:38:28] [INFO ] After 3278ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 10:38:28] [INFO ] State equation strengthened by 1370 read => feed constraints.
[2023-03-18 10:38:36] [INFO ] After 7494ms SMT Verify possible using 1370 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 10:38:38] [INFO ] Deduced a trap composed of 25 places in 1909 ms of which 0 ms to minimize.
[2023-03-18 10:38:41] [INFO ] Deduced a trap composed of 84 places in 1979 ms of which 1 ms to minimize.
[2023-03-18 10:38:42] [INFO ] Deduced a trap composed of 92 places in 1413 ms of which 1 ms to minimize.
[2023-03-18 10:38:43] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 6786 ms
[2023-03-18 10:38:43] [INFO ] After 14925ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1764 ms.
[2023-03-18 10:38:45] [INFO ] After 20160ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 503/503 places, 27270/27270 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 502 transition count 27269
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 8 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 501 transition count 27280
Free-agglomeration rule applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 501 transition count 27277
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 11 place count 498 transition count 27276
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 498 transition count 27456
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 497 transition count 27456
Applied a total of 13 rules in 449 ms. Remains 497 /503 variables (removed 6) and now considering 27456/27270 (removed -186) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 450 ms. Remains : 497/503 places, 27456/27270 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 213 ms. (steps per millisecond=46 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 39265 steps, run timeout after 3001 ms. (steps per millisecond=13 ) properties seen :{}
Probabilistic random walk after 39265 steps, saw 27781 distinct states, run finished after 3001 ms. (steps per millisecond=13 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 10:38:49] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
// Phase 1: matrix 18727 rows 497 cols
[2023-03-18 10:38:49] [INFO ] Computed 8 place invariants in 53 ms
[2023-03-18 10:38:49] [INFO ] After 83ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 10:38:49] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-18 10:38:52] [INFO ] After 3360ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 10:38:52] [INFO ] State equation strengthened by 1374 read => feed constraints.
[2023-03-18 10:39:01] [INFO ] After 8747ms SMT Verify possible using 1374 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 10:39:03] [INFO ] Deduced a trap composed of 49 places in 1681 ms of which 1 ms to minimize.
[2023-03-18 10:39:05] [INFO ] Deduced a trap composed of 66 places in 1389 ms of which 1 ms to minimize.
[2023-03-18 10:39:07] [INFO ] Deduced a trap composed of 128 places in 1146 ms of which 0 ms to minimize.
[2023-03-18 10:39:09] [INFO ] Deduced a trap composed of 92 places in 1165 ms of which 0 ms to minimize.
[2023-03-18 10:39:09] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 8083 ms
[2023-03-18 10:39:09] [INFO ] After 17231ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4252 ms.
[2023-03-18 10:39:14] [INFO ] After 25032ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 7 ms.
Support contains 1 out of 497 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 27456/27456 transitions.
Applied a total of 0 rules in 102 ms. Remains 497 /497 variables (removed 0) and now considering 27456/27456 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 103 ms. Remains : 497/497 places, 27456/27456 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 27456/27456 transitions.
Applied a total of 0 rules in 95 ms. Remains 497 /497 variables (removed 0) and now considering 27456/27456 (removed 0) transitions.
[2023-03-18 10:39:14] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
[2023-03-18 10:39:14] [INFO ] Invariant cache hit.
[2023-03-18 10:39:15] [INFO ] Implicit Places using invariants in 899 ms returned []
Implicit Place search using SMT only with invariants took 900 ms to find 0 implicit places.
[2023-03-18 10:39:15] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
[2023-03-18 10:39:15] [INFO ] Invariant cache hit.
[2023-03-18 10:39:22] [INFO ] Dead Transitions using invariants and state equation in 7557 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8555 ms. Remains : 497/497 places, 27456/27456 transitions.
Graph (trivial) has 10360 edges and 497 vertex of which 381 / 497 are part of one of the 62 SCC in 2 ms
Free SCC test removed 319 places
Drop transitions removed 11224 transitions
Ensure Unique test removed 13923 transitions
Reduce isomorphic transitions removed 25147 transitions.
Graph (complete) has 2322 edges and 178 vertex of which 171 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 0 output transitions
Drop transitions removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 13 rules applied. Total rules applied 15 place count 171 transition count 2296
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 17 place count 169 transition count 2296
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 18 place count 168 transition count 2286
Iterating global reduction 2 with 1 rules applied. Total rules applied 19 place count 168 transition count 2286
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 23 place count 166 transition count 2284
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 2 with 33 rules applied. Total rules applied 56 place count 166 transition count 2251
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 58 place count 165 transition count 2261
Drop transitions removed 1201 transitions
Redundant transition composition rules discarded 1201 transitions
Iterating global reduction 3 with 1201 rules applied. Total rules applied 1259 place count 165 transition count 1060
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1235 edges and 163 vertex of which 146 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.0 ms
Discarding 17 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Iterating post reduction 3 with 11 rules applied. Total rules applied 1270 place count 146 transition count 1050
Drop transitions removed 107 transitions
Reduce isomorphic transitions removed 107 transitions.
Iterating post reduction 4 with 107 rules applied. Total rules applied 1377 place count 146 transition count 943
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 1380 place count 143 transition count 932
Iterating global reduction 5 with 3 rules applied. Total rules applied 1383 place count 143 transition count 932
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1384 place count 143 transition count 931
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1385 place count 142 transition count 929
Iterating global reduction 6 with 1 rules applied. Total rules applied 1386 place count 142 transition count 929
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1388 place count 141 transition count 928
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 6 with 5 rules applied. Total rules applied 1393 place count 141 transition count 923
Free-agglomeration rule applied 12 times with reduction of 7 identical transitions.
Iterating global reduction 6 with 12 rules applied. Total rules applied 1405 place count 141 transition count 904
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 6 with 32 rules applied. Total rules applied 1437 place count 129 transition count 884
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1438 place count 128 transition count 882
Iterating global reduction 7 with 1 rules applied. Total rules applied 1439 place count 128 transition count 882
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 1447 place count 128 transition count 874
Drop transitions removed 58 transitions
Redundant transition composition rules discarded 58 transitions
Iterating global reduction 8 with 58 rules applied. Total rules applied 1505 place count 128 transition count 816
Free-agglomeration rule applied 6 times.
Iterating global reduction 8 with 6 rules applied. Total rules applied 1511 place count 128 transition count 810
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 10 rules applied. Total rules applied 1521 place count 122 transition count 806
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 9 with 6 rules applied. Total rules applied 1527 place count 122 transition count 800
Free-agglomeration rule applied 1 times.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1528 place count 122 transition count 799
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 1531 place count 121 transition count 797
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 1533 place count 121 transition count 795
Free-agglomeration rule applied 1 times.
Iterating global reduction 10 with 1 rules applied. Total rules applied 1534 place count 121 transition count 794
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 3 rules applied. Total rules applied 1537 place count 120 transition count 792
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 11 with 2 rules applied. Total rules applied 1539 place count 120 transition count 790
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 11 with 5 rules applied. Total rules applied 1544 place count 120 transition count 874
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 11 with 21 rules applied. Total rules applied 1565 place count 115 transition count 858
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 1566 place count 114 transition count 854
Iterating global reduction 12 with 1 rules applied. Total rules applied 1567 place count 114 transition count 854
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 12 with 9 rules applied. Total rules applied 1576 place count 114 transition count 845
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 13 with 19 rules applied. Total rules applied 1595 place count 114 transition count 826
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 13 with 5 rules applied. Total rules applied 1600 place count 114 transition count 826
Applied a total of 1600 rules in 213 ms. Remains 114 /497 variables (removed 383) and now considering 826/27456 (removed 26630) transitions.
Running SMT prover for 1 properties.
[2023-03-18 10:39:23] [INFO ] Flow matrix only has 791 transitions (discarded 35 similar events)
// Phase 1: matrix 791 rows 114 cols
[2023-03-18 10:39:23] [INFO ] Computed 0 place invariants in 7 ms
[2023-03-18 10:39:23] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 10:39:23] [INFO ] After 110ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 10:39:23] [INFO ] State equation strengthened by 15 read => feed constraints.
[2023-03-18 10:39:23] [INFO ] After 25ms SMT Verify possible using 15 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 10:39:23] [INFO ] After 56ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-18 10:39:23] [INFO ] After 211ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 3 resets, run finished after 201 ms. (steps per millisecond=49 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 39726 steps, run timeout after 3001 ms. (steps per millisecond=13 ) properties seen :{}
Probabilistic random walk after 39726 steps, saw 28133 distinct states, run finished after 3001 ms. (steps per millisecond=13 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 10:39:26] [INFO ] Flow matrix only has 18593 transitions (discarded 8677 similar events)
// Phase 1: matrix 18593 rows 503 cols
[2023-03-18 10:39:26] [INFO ] Computed 8 place invariants in 51 ms
[2023-03-18 10:39:26] [INFO ] After 89ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 10:39:26] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-18 10:39:30] [INFO ] After 3423ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 10:39:30] [INFO ] State equation strengthened by 1370 read => feed constraints.
[2023-03-18 10:39:35] [INFO ] After 5144ms SMT Verify possible using 1370 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 10:39:38] [INFO ] Deduced a trap composed of 49 places in 2032 ms of which 1 ms to minimize.
[2023-03-18 10:39:45] [INFO ] Deduced a trap composed of 84 places in 1905 ms of which 1 ms to minimize.
[2023-03-18 10:39:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 9562 ms
[2023-03-18 10:39:45] [INFO ] After 15361ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 332 ms.
[2023-03-18 10:39:46] [INFO ] After 19295ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 503/503 places, 27270/27270 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 8 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 502 transition count 27269
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 8 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 501 transition count 27280
Free-agglomeration rule applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 501 transition count 27277
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 11 place count 498 transition count 27276
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 498 transition count 27456
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 497 transition count 27456
Applied a total of 13 rules in 434 ms. Remains 497 /503 variables (removed 6) and now considering 27456/27270 (removed -186) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 435 ms. Remains : 497/503 places, 27456/27270 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 188 ms. (steps per millisecond=53 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 39671 steps, run timeout after 3001 ms. (steps per millisecond=13 ) properties seen :{}
Probabilistic random walk after 39671 steps, saw 28096 distinct states, run finished after 3001 ms. (steps per millisecond=13 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 10:39:49] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
// Phase 1: matrix 18727 rows 497 cols
[2023-03-18 10:39:49] [INFO ] Computed 8 place invariants in 58 ms
[2023-03-18 10:39:49] [INFO ] After 86ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 10:39:50] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-18 10:39:53] [INFO ] After 3378ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 10:39:53] [INFO ] State equation strengthened by 1374 read => feed constraints.
[2023-03-18 10:39:58] [INFO ] After 4704ms SMT Verify possible using 1374 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 10:40:00] [INFO ] Deduced a trap composed of 57 places in 1990 ms of which 0 ms to minimize.
[2023-03-18 10:40:08] [INFO ] Deduced a trap composed of 49 places in 1898 ms of which 0 ms to minimize.
[2023-03-18 10:40:11] [INFO ] Deduced a trap composed of 161 places in 1808 ms of which 0 ms to minimize.
[2023-03-18 10:40:13] [INFO ] Deduced a trap composed of 84 places in 1867 ms of which 1 ms to minimize.
[2023-03-18 10:40:16] [INFO ] Deduced a trap composed of 120 places in 1824 ms of which 0 ms to minimize.
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.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
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.solver.logic.AtomicReducerSR.checkAtomicPropositions(AtomicReducerSR.java:365)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:253)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.applyReachabilitySolver(GlobalPropertySolver.java:724)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:558)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preSolveLiveness(GlobalPropertySolver.java:412)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preStableMarking(GlobalPropertySolver.java:321)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:294)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:386)
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-18 10:40:16] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 10:40:16] [INFO ] After 26253ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 497 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 27456/27456 transitions.
Applied a total of 0 rules in 93 ms. Remains 497 /497 variables (removed 0) and now considering 27456/27456 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 93 ms. Remains : 497/497 places, 27456/27456 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 27456/27456 transitions.
Applied a total of 0 rules in 91 ms. Remains 497 /497 variables (removed 0) and now considering 27456/27456 (removed 0) transitions.
[2023-03-18 10:40:16] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
[2023-03-18 10:40:16] [INFO ] Invariant cache hit.
[2023-03-18 10:40:17] [INFO ] Implicit Places using invariants in 887 ms returned []
Implicit Place search using SMT only with invariants took 888 ms to find 0 implicit places.
[2023-03-18 10:40:17] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
[2023-03-18 10:40:17] [INFO ] Invariant cache hit.
[2023-03-18 10:40:24] [INFO ] Dead Transitions using invariants and state equation in 7286 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8269 ms. Remains : 497/497 places, 27456/27456 transitions.
Graph (trivial) has 10360 edges and 497 vertex of which 379 / 497 are part of one of the 62 SCC in 2 ms
Free SCC test removed 317 places
Drop transitions removed 11151 transitions
Ensure Unique test removed 13967 transitions
Reduce isomorphic transitions removed 25118 transitions.
Graph (complete) has 2352 edges and 180 vertex of which 172 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.0 ms
Discarding 8 places :
Also discarding 0 output transitions
Drop transitions removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 14 rules applied. Total rules applied 16 place count 172 transition count 2324
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 18 place count 170 transition count 2324
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 19 place count 169 transition count 2314
Iterating global reduction 2 with 1 rules applied. Total rules applied 20 place count 169 transition count 2314
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 24 place count 167 transition count 2312
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 2 with 33 rules applied. Total rules applied 57 place count 167 transition count 2279
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 59 place count 166 transition count 2289
Drop transitions removed 1214 transitions
Redundant transition composition rules discarded 1214 transitions
Iterating global reduction 3 with 1214 rules applied. Total rules applied 1273 place count 166 transition count 1075
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1238 edges and 164 vertex of which 146 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.0 ms
Discarding 18 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Iterating post reduction 3 with 11 rules applied. Total rules applied 1284 place count 146 transition count 1064
Drop transitions removed 112 transitions
Reduce isomorphic transitions removed 112 transitions.
Iterating post reduction 4 with 112 rules applied. Total rules applied 1396 place count 146 transition count 952
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1398 place count 144 transition count 942
Iterating global reduction 5 with 2 rules applied. Total rules applied 1400 place count 144 transition count 942
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1401 place count 144 transition count 941
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1403 place count 143 transition count 940
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 6 with 5 rules applied. Total rules applied 1408 place count 143 transition count 935
Free-agglomeration rule applied 12 times with reduction of 7 identical transitions.
Iterating global reduction 6 with 12 rules applied. Total rules applied 1420 place count 143 transition count 916
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 6 with 32 rules applied. Total rules applied 1452 place count 131 transition count 896
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1453 place count 130 transition count 894
Iterating global reduction 7 with 1 rules applied. Total rules applied 1454 place count 130 transition count 894
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 1462 place count 130 transition count 886
Drop transitions removed 58 transitions
Redundant transition composition rules discarded 58 transitions
Iterating global reduction 8 with 58 rules applied. Total rules applied 1520 place count 130 transition count 828
Free-agglomeration rule applied 6 times.
Iterating global reduction 8 with 6 rules applied. Total rules applied 1526 place count 130 transition count 822
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 10 rules applied. Total rules applied 1536 place count 124 transition count 818
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 9 with 6 rules applied. Total rules applied 1542 place count 124 transition count 812
Free-agglomeration rule applied 2 times.
Iterating global reduction 9 with 2 rules applied. Total rules applied 1544 place count 124 transition count 810
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 1548 place count 122 transition count 808
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 10 with 4 rules applied. Total rules applied 1552 place count 122 transition count 804
Free-agglomeration rule applied 2 times.
Iterating global reduction 10 with 2 rules applied. Total rules applied 1554 place count 122 transition count 802
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 1558 place count 120 transition count 800
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 11 with 2 rules applied. Total rules applied 1560 place count 120 transition count 798
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 11 with 5 rules applied. Total rules applied 1565 place count 120 transition count 885
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 11 with 21 rules applied. Total rules applied 1586 place count 115 transition count 869
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 1587 place count 114 transition count 865
Iterating global reduction 12 with 1 rules applied. Total rules applied 1588 place count 114 transition count 865
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 12 with 9 rules applied. Total rules applied 1597 place count 114 transition count 856
Drop transitions removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 13 with 20 rules applied. Total rules applied 1617 place count 114 transition count 836
Applied a total of 1617 rules in 196 ms. Remains 114 /497 variables (removed 383) and now considering 836/27456 (removed 26620) transitions.
Running SMT prover for 1 properties.
[2023-03-18 10:40:24] [INFO ] Flow matrix only has 794 transitions (discarded 42 similar events)
// Phase 1: matrix 794 rows 114 cols
[2023-03-18 10:40:24] [INFO ] Computed 0 place invariants in 8 ms
[2023-03-18 10:40:24] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 10:40:24] [INFO ] After 108ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 10:40:24] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-18 10:40:24] [INFO ] After 17ms SMT Verify possible using 16 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 10:40:24] [INFO ] After 45ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-03-18 10:40:24] [INFO ] After 195ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 2 resets, run finished after 188 ms. (steps per millisecond=53 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 41133 steps, run timeout after 3001 ms. (steps per millisecond=13 ) properties seen :{}
Probabilistic random walk after 41133 steps, saw 29097 distinct states, run finished after 3002 ms. (steps per millisecond=13 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 10:40:28] [INFO ] Flow matrix only has 18593 transitions (discarded 8677 similar events)
// Phase 1: matrix 18593 rows 503 cols
[2023-03-18 10:40:28] [INFO ] Computed 8 place invariants in 52 ms
[2023-03-18 10:40:28] [INFO ] After 80ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 10:40:28] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-18 10:40:31] [INFO ] After 3248ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 10:40:31] [INFO ] State equation strengthened by 1370 read => feed constraints.
[2023-03-18 10:40:36] [INFO ] After 4841ms SMT Verify possible using 1370 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 10:40:38] [INFO ] Deduced a trap composed of 163 places in 1486 ms of which 1 ms to minimize.
[2023-03-18 10:40:40] [INFO ] Deduced a trap composed of 19 places in 1516 ms of which 1 ms to minimize.
[2023-03-18 10:40:43] [INFO ] Deduced a trap composed of 157 places in 1980 ms of which 1 ms to minimize.
[2023-03-18 10:40:45] [INFO ] Deduced a trap composed of 111 places in 1776 ms of which 1 ms to minimize.
[2023-03-18 10:40:47] [INFO ] Deduced a trap composed of 47 places in 1830 ms of which 1 ms to minimize.
[2023-03-18 10:40:48] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 11244 ms
[2023-03-18 10:40:48] [INFO ] After 16596ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1054 ms.
[2023-03-18 10:40:49] [INFO ] After 21075ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 503/503 places, 27270/27270 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 502 transition count 27269
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 8 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 501 transition count 27280
Free-agglomeration rule applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 501 transition count 27277
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 11 place count 498 transition count 27276
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 498 transition count 27456
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 497 transition count 27456
Applied a total of 13 rules in 433 ms. Remains 497 /503 variables (removed 6) and now considering 27456/27270 (removed -186) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 433 ms. Remains : 497/503 places, 27456/27270 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 191 ms. (steps per millisecond=52 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 40170 steps, run timeout after 3001 ms. (steps per millisecond=13 ) properties seen :{}
Probabilistic random walk after 40170 steps, saw 28458 distinct states, run finished after 3001 ms. (steps per millisecond=13 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 10:40:53] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
// Phase 1: matrix 18727 rows 497 cols
[2023-03-18 10:40:53] [INFO ] Computed 8 place invariants in 53 ms
[2023-03-18 10:40:53] [INFO ] After 80ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 10:40:53] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-18 10:40:56] [INFO ] After 3410ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 10:40:56] [INFO ] State equation strengthened by 1374 read => feed constraints.
[2023-03-18 10:41:00] [INFO ] After 4099ms SMT Verify possible using 1374 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 10:41:03] [INFO ] Deduced a trap composed of 147 places in 1791 ms of which 0 ms to minimize.
[2023-03-18 10:41:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 2575 ms
[2023-03-18 10:41:04] [INFO ] After 7670ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 460 ms.
[2023-03-18 10:41:05] [INFO ] After 11723ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 497 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 27456/27456 transitions.
Applied a total of 0 rules in 98 ms. Remains 497 /497 variables (removed 0) and now considering 27456/27456 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 99 ms. Remains : 497/497 places, 27456/27456 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 27456/27456 transitions.
Applied a total of 0 rules in 94 ms. Remains 497 /497 variables (removed 0) and now considering 27456/27456 (removed 0) transitions.
[2023-03-18 10:41:05] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
[2023-03-18 10:41:05] [INFO ] Invariant cache hit.
[2023-03-18 10:41:06] [INFO ] Implicit Places using invariants in 890 ms returned []
Implicit Place search using SMT only with invariants took 891 ms to find 0 implicit places.
[2023-03-18 10:41:06] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
[2023-03-18 10:41:06] [INFO ] Invariant cache hit.
[2023-03-18 10:41:13] [INFO ] Dead Transitions using invariants and state equation in 7434 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8421 ms. Remains : 497/497 places, 27456/27456 transitions.
Graph (trivial) has 10360 edges and 497 vertex of which 381 / 497 are part of one of the 62 SCC in 2 ms
Free SCC test removed 319 places
Drop transitions removed 11224 transitions
Ensure Unique test removed 13923 transitions
Reduce isomorphic transitions removed 25147 transitions.
Graph (complete) has 2322 edges and 178 vertex of which 171 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 0 output transitions
Drop transitions removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 13 rules applied. Total rules applied 15 place count 171 transition count 2296
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 17 place count 169 transition count 2296
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 18 place count 168 transition count 2286
Iterating global reduction 2 with 1 rules applied. Total rules applied 19 place count 168 transition count 2286
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 23 place count 166 transition count 2284
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 2 with 33 rules applied. Total rules applied 56 place count 166 transition count 2251
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 58 place count 165 transition count 2261
Drop transitions removed 1200 transitions
Redundant transition composition rules discarded 1200 transitions
Iterating global reduction 3 with 1200 rules applied. Total rules applied 1258 place count 165 transition count 1061
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1228 edges and 163 vertex of which 144 are kept as prefixes of interest. Removing 19 places using SCC suffix rule.0 ms
Discarding 19 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Iterating post reduction 3 with 11 rules applied. Total rules applied 1269 place count 144 transition count 1050
Drop transitions removed 113 transitions
Reduce isomorphic transitions removed 113 transitions.
Iterating post reduction 4 with 113 rules applied. Total rules applied 1382 place count 144 transition count 937
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1384 place count 142 transition count 927
Iterating global reduction 5 with 2 rules applied. Total rules applied 1386 place count 142 transition count 927
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1387 place count 142 transition count 926
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1389 place count 141 transition count 925
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 6 with 5 rules applied. Total rules applied 1394 place count 141 transition count 920
Free-agglomeration rule applied 12 times with reduction of 7 identical transitions.
Iterating global reduction 6 with 12 rules applied. Total rules applied 1406 place count 141 transition count 901
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 6 with 32 rules applied. Total rules applied 1438 place count 129 transition count 881
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1439 place count 128 transition count 879
Iterating global reduction 7 with 1 rules applied. Total rules applied 1440 place count 128 transition count 879
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 1448 place count 128 transition count 871
Drop transitions removed 58 transitions
Redundant transition composition rules discarded 58 transitions
Iterating global reduction 8 with 58 rules applied. Total rules applied 1506 place count 128 transition count 813
Free-agglomeration rule applied 6 times.
Iterating global reduction 8 with 6 rules applied. Total rules applied 1512 place count 128 transition count 807
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 10 rules applied. Total rules applied 1522 place count 122 transition count 803
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 9 with 6 rules applied. Total rules applied 1528 place count 122 transition count 797
Free-agglomeration rule applied 2 times.
Iterating global reduction 9 with 2 rules applied. Total rules applied 1530 place count 122 transition count 795
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 1534 place count 120 transition count 793
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 10 with 4 rules applied. Total rules applied 1538 place count 120 transition count 789
Free-agglomeration rule applied 2 times.
Iterating global reduction 10 with 2 rules applied. Total rules applied 1540 place count 120 transition count 787
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 1544 place count 118 transition count 785
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 11 with 2 rules applied. Total rules applied 1546 place count 118 transition count 783
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 11 with 5 rules applied. Total rules applied 1551 place count 118 transition count 867
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 11 with 21 rules applied. Total rules applied 1572 place count 113 transition count 851
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 1573 place count 112 transition count 847
Iterating global reduction 12 with 1 rules applied. Total rules applied 1574 place count 112 transition count 847
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 12 with 9 rules applied. Total rules applied 1583 place count 112 transition count 838
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 13 with 19 rules applied. Total rules applied 1602 place count 112 transition count 819
Applied a total of 1602 rules in 197 ms. Remains 112 /497 variables (removed 385) and now considering 819/27456 (removed 26637) transitions.
Running SMT prover for 1 properties.
[2023-03-18 10:41:13] [INFO ] Flow matrix only has 781 transitions (discarded 38 similar events)
// Phase 1: matrix 781 rows 112 cols
[2023-03-18 10:41:13] [INFO ] Computed 0 place invariants in 7 ms
[2023-03-18 10:41:13] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 10:41:13] [INFO ] After 108ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 10:41:13] [INFO ] State equation strengthened by 15 read => feed constraints.
[2023-03-18 10:41:13] [INFO ] After 21ms SMT Verify possible using 15 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 10:41:13] [INFO ] After 52ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2023-03-18 10:41:14] [INFO ] After 205ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 2 resets, run finished after 190 ms. (steps per millisecond=52 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 40942 steps, run timeout after 3001 ms. (steps per millisecond=13 ) properties seen :{}
Probabilistic random walk after 40942 steps, saw 28982 distinct states, run finished after 3003 ms. (steps per millisecond=13 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 10:41:17] [INFO ] Flow matrix only has 18593 transitions (discarded 8677 similar events)
// Phase 1: matrix 18593 rows 503 cols
[2023-03-18 10:41:17] [INFO ] Computed 8 place invariants in 54 ms
[2023-03-18 10:41:17] [INFO ] After 85ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 10:41:17] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-18 10:41:20] [INFO ] After 3456ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 10:41:21] [INFO ] State equation strengthened by 1370 read => feed constraints.
[2023-03-18 10:41:24] [INFO ] After 3913ms SMT Verify possible using 1370 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 10:41:27] [INFO ] Deduced a trap composed of 101 places in 948 ms of which 0 ms to minimize.
[2023-03-18 10:41:29] [INFO ] Deduced a trap composed of 187 places in 1157 ms of which 1 ms to minimize.
[2023-03-18 10:41:30] [INFO ] Deduced a trap composed of 149 places in 1262 ms of which 0 ms to minimize.
[2023-03-18 10:41:32] [INFO ] Deduced a trap composed of 19 places in 1279 ms of which 1 ms to minimize.
[2023-03-18 10:41:34] [INFO ] Deduced a trap composed of 47 places in 1493 ms of which 0 ms to minimize.
[2023-03-18 10:41:37] [INFO ] Deduced a trap composed of 59 places in 1876 ms of which 0 ms to minimize.
[2023-03-18 10:41:40] [INFO ] Deduced a trap composed of 49 places in 1621 ms of which 0 ms to minimize.
[2023-03-18 10:41:42] [INFO ] Deduced a trap composed of 51 places in 1386 ms of which 0 ms to minimize.
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.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
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.solver.logic.AtomicReducerSR.checkAtomicPropositions(AtomicReducerSR.java:365)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:253)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.applyReachabilitySolver(GlobalPropertySolver.java:724)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:558)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preSolveLiveness(GlobalPropertySolver.java:412)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preStableMarking(GlobalPropertySolver.java:321)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:294)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:386)
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-18 10:41:42] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 10:41:42] [INFO ] After 25484ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 503/503 places, 27270/27270 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 8 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 502 transition count 27269
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 8 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 501 transition count 27280
Free-agglomeration rule applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 501 transition count 27277
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 11 place count 498 transition count 27276
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 498 transition count 27456
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 497 transition count 27456
Applied a total of 13 rules in 462 ms. Remains 497 /503 variables (removed 6) and now considering 27456/27270 (removed -186) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 463 ms. Remains : 497/503 places, 27456/27270 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 198 ms. (steps per millisecond=50 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 39318 steps, run timeout after 3001 ms. (steps per millisecond=13 ) properties seen :{}
Probabilistic random walk after 39318 steps, saw 27813 distinct states, run finished after 3001 ms. (steps per millisecond=13 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 10:41:46] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
// Phase 1: matrix 18727 rows 497 cols
[2023-03-18 10:41:46] [INFO ] Computed 8 place invariants in 58 ms
[2023-03-18 10:41:46] [INFO ] After 88ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 10:41:46] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-18 10:41:50] [INFO ] After 3505ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 10:41:50] [INFO ] State equation strengthened by 1374 read => feed constraints.
[2023-03-18 10:41:54] [INFO ] After 3753ms SMT Verify possible using 1374 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 10:41:56] [INFO ] Deduced a trap composed of 19 places in 1267 ms of which 1 ms to minimize.
[2023-03-18 10:41:58] [INFO ] Deduced a trap composed of 47 places in 1520 ms of which 1 ms to minimize.
[2023-03-18 10:42:00] [INFO ] Deduced a trap composed of 101 places in 1252 ms of which 0 ms to minimize.
[2023-03-18 10:42:02] [INFO ] Deduced a trap composed of 12 places in 1261 ms of which 0 ms to minimize.
[2023-03-18 10:42:03] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 7868 ms
[2023-03-18 10:42:03] [INFO ] After 12987ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 470 ms.
[2023-03-18 10:42:03] [INFO ] After 17143ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 497 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 27456/27456 transitions.
Applied a total of 0 rules in 105 ms. Remains 497 /497 variables (removed 0) and now considering 27456/27456 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 105 ms. Remains : 497/497 places, 27456/27456 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 27456/27456 transitions.
Applied a total of 0 rules in 105 ms. Remains 497 /497 variables (removed 0) and now considering 27456/27456 (removed 0) transitions.
[2023-03-18 10:42:04] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
[2023-03-18 10:42:04] [INFO ] Invariant cache hit.
[2023-03-18 10:42:05] [INFO ] Implicit Places using invariants in 910 ms returned []
Implicit Place search using SMT only with invariants took 911 ms to find 0 implicit places.
[2023-03-18 10:42:05] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
[2023-03-18 10:42:05] [INFO ] Invariant cache hit.
[2023-03-18 10:42:12] [INFO ] Dead Transitions using invariants and state equation in 7504 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8523 ms. Remains : 497/497 places, 27456/27456 transitions.
Graph (trivial) has 10326 edges and 497 vertex of which 380 / 497 are part of one of the 62 SCC in 1 ms
Free SCC test removed 318 places
Drop transitions removed 11175 transitions
Ensure Unique test removed 13875 transitions
Reduce isomorphic transitions removed 25050 transitions.
Graph (complete) has 2351 edges and 179 vertex of which 171 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 0 output transitions
Drop transitions removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 14 rules applied. Total rules applied 16 place count 171 transition count 2392
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 18 place count 169 transition count 2392
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 19 place count 168 transition count 2382
Iterating global reduction 2 with 1 rules applied. Total rules applied 20 place count 168 transition count 2382
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 24 place count 166 transition count 2380
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 2 with 33 rules applied. Total rules applied 57 place count 166 transition count 2347
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 59 place count 165 transition count 2357
Drop transitions removed 1273 transitions
Redundant transition composition rules discarded 1273 transitions
Iterating global reduction 3 with 1273 rules applied. Total rules applied 1332 place count 165 transition count 1084
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1261 edges and 163 vertex of which 145 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.1 ms
Discarding 18 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Iterating post reduction 3 with 11 rules applied. Total rules applied 1343 place count 145 transition count 1073
Drop transitions removed 86 transitions
Reduce isomorphic transitions removed 86 transitions.
Iterating post reduction 4 with 86 rules applied. Total rules applied 1429 place count 145 transition count 987
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1430 place count 144 transition count 982
Iterating global reduction 5 with 1 rules applied. Total rules applied 1431 place count 144 transition count 982
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1433 place count 143 transition count 981
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 1435 place count 143 transition count 979
Free-agglomeration rule applied 11 times with reduction of 7 identical transitions.
Iterating global reduction 5 with 11 rules applied. Total rules applied 1446 place count 143 transition count 961
Reduce places removed 11 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 5 with 31 rules applied. Total rules applied 1477 place count 132 transition count 941
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1478 place count 131 transition count 939
Iterating global reduction 6 with 1 rules applied. Total rules applied 1479 place count 131 transition count 939
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 1487 place count 131 transition count 931
Drop transitions removed 50 transitions
Redundant transition composition rules discarded 50 transitions
Iterating global reduction 7 with 50 rules applied. Total rules applied 1537 place count 131 transition count 881
Free-agglomeration rule applied 6 times.
Iterating global reduction 7 with 6 rules applied. Total rules applied 1543 place count 131 transition count 875
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 10 rules applied. Total rules applied 1553 place count 125 transition count 871
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 8 with 6 rules applied. Total rules applied 1559 place count 125 transition count 865
Free-agglomeration rule applied 2 times.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1561 place count 125 transition count 863
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 1565 place count 123 transition count 861
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 9 with 4 rules applied. Total rules applied 1569 place count 123 transition count 857
Free-agglomeration rule applied 2 times.
Iterating global reduction 9 with 2 rules applied. Total rules applied 1571 place count 123 transition count 855
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 1575 place count 121 transition count 853
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 1577 place count 121 transition count 851
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 10 with 4 rules applied. Total rules applied 1581 place count 121 transition count 945
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 10 with 19 rules applied. Total rules applied 1600 place count 117 transition count 930
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 1601 place count 116 transition count 926
Iterating global reduction 11 with 1 rules applied. Total rules applied 1602 place count 116 transition count 926
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 1603 place count 116 transition count 925
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 12 with 21 rules applied. Total rules applied 1624 place count 116 transition count 904
Applied a total of 1624 rules in 205 ms. Remains 116 /497 variables (removed 381) and now considering 904/27456 (removed 26552) transitions.
Running SMT prover for 1 properties.
[2023-03-18 10:42:12] [INFO ] Flow matrix only has 864 transitions (discarded 40 similar events)
// Phase 1: matrix 864 rows 116 cols
[2023-03-18 10:42:12] [INFO ] Computed 0 place invariants in 8 ms
[2023-03-18 10:42:12] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 10:42:12] [INFO ] After 127ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 10:42:13] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-18 10:42:13] [INFO ] After 24ms SMT Verify possible using 16 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 10:42:13] [INFO ] After 58ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 22 ms.
[2023-03-18 10:42:13] [INFO ] After 234ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 2 resets, run finished after 213 ms. (steps per millisecond=46 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 39561 steps, run timeout after 3001 ms. (steps per millisecond=13 ) properties seen :{}
Probabilistic random walk after 39561 steps, saw 28010 distinct states, run finished after 3001 ms. (steps per millisecond=13 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 10:42:16] [INFO ] Flow matrix only has 18593 transitions (discarded 8677 similar events)
// Phase 1: matrix 18593 rows 503 cols
[2023-03-18 10:42:16] [INFO ] Computed 8 place invariants in 55 ms
[2023-03-18 10:42:16] [INFO ] After 84ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 10:42:16] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
TIME LIMIT: Killed by timeout after 1800 seconds
MemTotal: 16393232 kB
MemFree: 13003980 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16103944 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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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 StableMarking -timeout 180 -rebuildPNML

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="RERS2020-PT-pb103"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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 RERS2020-PT-pb103, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r343-tall-167889215200148"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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